## About the Execution of ITS-Tools for BridgeAndVehicles-PT-V20P20N10

Execution Summary | |||||

Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |

1008.384 | 45707.00 | 64685.00 | 90.10 | 20 20 1 10 20 10 1 20 1 1 1 1 1 1 1 1 | normal |

## Execution Chart

We display below the execution chart for this examination (boot time has been removed).

## Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r026-tajo-162038143500203.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off

Waiting for the VM to be ready (probing ssh)

.........................

=====================================================================

Generated by BenchKit 2-4028

Executing tool itstools

Input is BridgeAndVehicles-PT-V20P20N10, examination is UpperBounds

Time confinement is 3600 seconds

Memory confinement is 16384 MBytes

Number of cores is 4

Run identifier is r026-tajo-162038143500203

=====================================================================

--------------------

preparation of the directory to be used:

/home/mcc/execution

total 3.5M

-rw-r--r-- 1 mcc users 46K May 5 16:58 CTLCardinality.txt

-rw-r--r-- 1 mcc users 255K May 5 16:58 CTLCardinality.xml

-rw-r--r-- 1 mcc users 443K May 5 16:58 CTLFireability.txt

-rw-r--r-- 1 mcc users 1.8M May 5 16:58 CTLFireability.xml

-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml

-rw-r--r-- 1 mcc users 4.5K Mar 28 15:46 LTLCardinality.txt

-rw-r--r-- 1 mcc users 25K Mar 28 15:46 LTLCardinality.xml

-rw-r--r-- 1 mcc users 36K Mar 28 15:46 LTLFireability.txt

-rw-r--r-- 1 mcc users 113K Mar 28 15:46 LTLFireability.xml

-rw-r--r-- 1 mcc users 7.1K Mar 23 02:49 ReachabilityCardinality.txt

-rw-r--r-- 1 mcc users 28K Mar 23 02:49 ReachabilityCardinality.xml

-rw-r--r-- 1 mcc users 31K Mar 22 11:06 ReachabilityFireability.txt

-rw-r--r-- 1 mcc users 93K Mar 22 11:06 ReachabilityFireability.xml

-rw-r--r-- 1 mcc users 2.3K Mar 22 09:10 UpperBounds.txt

-rw-r--r-- 1 mcc users 4.7K Mar 22 09:10 UpperBounds.xml

-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col

-rw-r--r-- 1 mcc users 10 May 5 16:51 instance

-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored

-rw-r--r-- 1 mcc users 598K May 5 16:51 model.pnml

--------------------

content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values

NUM_VECTOR

here is the order used to build the result vector(from text file)

FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-UpperBounds-00

FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-UpperBounds-01

FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-UpperBounds-02

FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-UpperBounds-03

FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-UpperBounds-04

FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-UpperBounds-05

FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-UpperBounds-06

FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-UpperBounds-07

FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-UpperBounds-08

FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-UpperBounds-09

FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-UpperBounds-10

FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-UpperBounds-11

FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-UpperBounds-12

FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-UpperBounds-13

FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-UpperBounds-14

FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-UpperBounds-15

=== Now, execution of the tool begins

**BK_START 1620527845232
**

Running Version 0

[2021-05-09 02:37:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]

[2021-05-09 02:37:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml

[2021-05-09 02:37:27] [INFO ] Load time of PNML (sax parser for PT used): 79 ms

[2021-05-09 02:37:27] [INFO ] Transformed 68 places.

[2021-05-09 02:37:27] [INFO ] Transformed 548 transitions.

[2021-05-09 02:37:27] [INFO ] Parsed PT model containing 68 places and 548 transitions in 121 ms.

Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
**FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
**

Normalized transition count is 130 out of 548 initially.

// Phase 1: matrix 130 rows 68 cols

[2021-05-09 02:37:27] [INFO ] Computed 7 place invariants in 17 ms
**FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-04 20 TECHNIQUES TOPOLOGICAL INITIAL_STATE
****FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-01 20 TECHNIQUES TOPOLOGICAL INITIAL_STATE
****FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-00 20 TECHNIQUES TOPOLOGICAL INITIAL_STATE
**

Incomplete random walk after 10000 steps, including 56 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 12) seen :41
**FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
****FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
****FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
****FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
****FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
****FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
****FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
****FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
****FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-07 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
**

Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :3

Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :17

Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :15

[2021-05-09 02:37:27] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)

// Phase 1: matrix 130 rows 68 cols

[2021-05-09 02:37:27] [INFO ] Computed 7 place invariants in 4 ms

[2021-05-09 02:37:27] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat

[2021-05-09 02:37:27] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat

[2021-05-09 02:37:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.

[2021-05-09 02:37:27] [INFO ] [Real]Absence check using state equation in 81 ms returned sat

[2021-05-09 02:37:28] [INFO ] Solution in real domain found non-integer solution.

[2021-05-09 02:37:28] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat

[2021-05-09 02:37:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.

[2021-05-09 02:37:28] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat

[2021-05-09 02:37:28] [INFO ] State equation strengthened by 22 read => feed constraints.

[2021-05-09 02:37:28] [INFO ] [Nat]Added 22 Read/Feed constraints in 10 ms returned sat

[2021-05-09 02:37:28] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 3 ms to minimize.

[2021-05-09 02:37:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms

[2021-05-09 02:37:28] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 77 transitions) in 52 ms.

[2021-05-09 02:37:28] [INFO ] Added : 46 causal constraints over 12 iterations in 252 ms. Result :sat

Minimization took 24 ms.

[2021-05-09 02:37:28] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat

[2021-05-09 02:37:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.

[2021-05-09 02:37:28] [INFO ] [Real]Absence check using state equation in 38 ms returned sat

[2021-05-09 02:37:28] [INFO ] Solution in real domain found non-integer solution.

[2021-05-09 02:37:28] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat

[2021-05-09 02:37:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.

[2021-05-09 02:37:28] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat

[2021-05-09 02:37:28] [INFO ] [Nat]Added 22 Read/Feed constraints in 7 ms returned sat

[2021-05-09 02:37:28] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 2 ms to minimize.

[2021-05-09 02:37:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms

[2021-05-09 02:37:28] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 77 transitions) in 34 ms.

[2021-05-09 02:37:28] [INFO ] Added : 47 causal constraints over 10 iterations in 137 ms. Result :sat

Minimization took 38 ms.

Current structural bounds on expressions (after SMT) : [1, 20, 20] Max seen :[1, 10, 10]
**FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
**

Incomplete Parikh walk after 38200 steps, including 837 resets, run finished after 139 ms. (steps per millisecond=274 ) properties (out of 2) seen :18 could not realise parikh vector

Incomplete Parikh walk after 49000 steps, including 1016 resets, run finished after 187 ms. (steps per millisecond=262 ) properties (out of 2) seen :15 could not realise parikh vector

Support contains 2 out of 68 places. Attempting structural reductions.

Starting structural reductions, iteration 0 : 68/68 places, 548/548 transitions.

Graph (complete) has 562 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms

Discarding 2 places :

Also discarding 0 output transitions

Applied a total of 1 rules in 79 ms. Remains 66 /68 variables (removed 2) and now considering 548/548 (removed 0) transitions.

[2021-05-09 02:37:29] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)

// Phase 1: matrix 130 rows 66 cols

[2021-05-09 02:37:29] [INFO ] Computed 5 place invariants in 2 ms

[2021-05-09 02:37:29] [INFO ] Dead Transitions using invariants and state equation in 334 ms returned []

Finished structural reductions, in 1 iterations. Remains : 66/68 places, 548/548 transitions.

Normalized transition count is 130 out of 548 initially.

// Phase 1: matrix 130 rows 66 cols

[2021-05-09 02:37:29] [INFO ] Computed 5 place invariants in 25 ms

Incomplete random walk after 1000000 steps, including 5633 resets, run finished after 2566 ms. (steps per millisecond=389 ) properties (out of 2) seen :16

Incomplete Best-First random walk after 1000001 steps, including 2052 resets, run finished after 1041 ms. (steps per millisecond=960 ) properties (out of 2) seen :19

Incomplete Best-First random walk after 1000000 steps, including 1940 resets, run finished after 826 ms. (steps per millisecond=1210 ) properties (out of 2) seen :17

[2021-05-09 02:37:34] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)

// Phase 1: matrix 130 rows 66 cols

[2021-05-09 02:37:34] [INFO ] Computed 5 place invariants in 4 ms

[2021-05-09 02:37:34] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat

[2021-05-09 02:37:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.

[2021-05-09 02:37:34] [INFO ] [Real]Absence check using state equation in 59 ms returned sat

[2021-05-09 02:37:34] [INFO ] State equation strengthened by 22 read => feed constraints.

[2021-05-09 02:37:34] [INFO ] [Real]Added 22 Read/Feed constraints in 10 ms returned sat

[2021-05-09 02:37:34] [INFO ] Solution in real domain found non-integer solution.

[2021-05-09 02:37:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat

[2021-05-09 02:37:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.

[2021-05-09 02:37:34] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat

[2021-05-09 02:37:34] [INFO ] [Nat]Added 22 Read/Feed constraints in 10 ms returned sat

[2021-05-09 02:37:34] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.

[2021-05-09 02:37:34] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 6 ms to minimize.

[2021-05-09 02:37:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 176 ms

[2021-05-09 02:37:34] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 77 transitions) in 24 ms.

[2021-05-09 02:37:34] [INFO ] Added : 47 causal constraints over 14 iterations in 170 ms. Result :sat

Minimization took 35 ms.

[2021-05-09 02:37:34] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat

[2021-05-09 02:37:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.

[2021-05-09 02:37:34] [INFO ] [Real]Absence check using state equation in 18 ms returned sat

[2021-05-09 02:37:34] [INFO ] [Real]Added 22 Read/Feed constraints in 4 ms returned sat

[2021-05-09 02:37:34] [INFO ] Solution in real domain found non-integer solution.

[2021-05-09 02:37:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat

[2021-05-09 02:37:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.

[2021-05-09 02:37:34] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat

[2021-05-09 02:37:34] [INFO ] [Nat]Added 22 Read/Feed constraints in 10 ms returned sat

[2021-05-09 02:37:35] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 0 ms to minimize.

[2021-05-09 02:37:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms

[2021-05-09 02:37:35] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 77 transitions) in 25 ms.

[2021-05-09 02:37:35] [INFO ] Added : 47 causal constraints over 13 iterations in 170 ms. Result :sat

Minimization took 31 ms.

Current structural bounds on expressions (after SMT) : [20, 20] Max seen :[10, 10]

Incomplete Parikh walk after 49300 steps, including 965 resets, run finished after 144 ms. (steps per millisecond=342 ) properties (out of 2) seen :20 could not realise parikh vector

Incomplete Parikh walk after 50800 steps, including 994 resets, run finished after 133 ms. (steps per millisecond=381 ) properties (out of 2) seen :15 could not realise parikh vector

Support contains 2 out of 66 places. Attempting structural reductions.

Starting structural reductions, iteration 0 : 66/66 places, 548/548 transitions.

Applied a total of 0 rules in 26 ms. Remains 66 /66 variables (removed 0) and now considering 548/548 (removed 0) transitions.

Finished structural reductions, in 1 iterations. Remains : 66/66 places, 548/548 transitions.

Starting structural reductions, iteration 0 : 66/66 places, 548/548 transitions.

Applied a total of 0 rules in 28 ms. Remains 66 /66 variables (removed 0) and now considering 548/548 (removed 0) transitions.

[2021-05-09 02:37:35] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)

// Phase 1: matrix 130 rows 66 cols

[2021-05-09 02:37:35] [INFO ] Computed 5 place invariants in 1 ms

[2021-05-09 02:37:35] [INFO ] Implicit Places using invariants in 309 ms returned []

[2021-05-09 02:37:35] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)

// Phase 1: matrix 130 rows 66 cols

[2021-05-09 02:37:35] [INFO ] Computed 5 place invariants in 1 ms

[2021-05-09 02:37:35] [INFO ] State equation strengthened by 22 read => feed constraints.

[2021-05-09 02:37:36] [INFO ] Implicit Places using invariants and state equation in 235 ms returned [22, 48]

Discarding 2 places :

Implicit Place search using SMT with State Equation took 555 ms to find 2 implicit places.

[2021-05-09 02:37:36] [INFO ] Redundant transitions in 33 ms returned []

[2021-05-09 02:37:36] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)

// Phase 1: matrix 130 rows 64 cols

[2021-05-09 02:37:36] [INFO ] Computed 5 place invariants in 1 ms

[2021-05-09 02:37:36] [INFO ] Dead Transitions using invariants and state equation in 206 ms returned []

Starting structural reductions, iteration 1 : 64/66 places, 548/548 transitions.

Applied a total of 0 rules in 29 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.

[2021-05-09 02:37:36] [INFO ] Redundant transitions in 13 ms returned []

[2021-05-09 02:37:36] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)

// Phase 1: matrix 130 rows 64 cols

[2021-05-09 02:37:36] [INFO ] Computed 5 place invariants in 1 ms

[2021-05-09 02:37:36] [INFO ] Dead Transitions using invariants and state equation in 397 ms returned []

Finished structural reductions, in 2 iterations. Remains : 64/66 places, 548/548 transitions.

Normalized transition count is 130 out of 548 initially.

// Phase 1: matrix 130 rows 64 cols

[2021-05-09 02:37:36] [INFO ] Computed 5 place invariants in 1 ms

Incomplete random walk after 1000000 steps, including 5632 resets, run finished after 2129 ms. (steps per millisecond=469 ) properties (out of 2) seen :17

Incomplete Best-First random walk after 1000001 steps, including 2045 resets, run finished after 796 ms. (steps per millisecond=1256 ) properties (out of 2) seen :19

Incomplete Best-First random walk after 1000001 steps, including 1940 resets, run finished after 759 ms. (steps per millisecond=1317 ) properties (out of 2) seen :18

[2021-05-09 02:37:40] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)

// Phase 1: matrix 130 rows 64 cols

[2021-05-09 02:37:40] [INFO ] Computed 5 place invariants in 2 ms

[2021-05-09 02:37:40] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat

[2021-05-09 02:37:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.

[2021-05-09 02:37:40] [INFO ] [Real]Absence check using state equation in 38 ms returned sat

[2021-05-09 02:37:40] [INFO ] Solution in real domain found non-integer solution.

[2021-05-09 02:37:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat

[2021-05-09 02:37:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.

[2021-05-09 02:37:40] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat

[2021-05-09 02:37:40] [INFO ] State equation strengthened by 22 read => feed constraints.

[2021-05-09 02:37:40] [INFO ] [Nat]Added 22 Read/Feed constraints in 13 ms returned sat

[2021-05-09 02:37:40] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.

[2021-05-09 02:37:40] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.

[2021-05-09 02:37:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 171 ms

[2021-05-09 02:37:40] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 77 transitions) in 20 ms.

[2021-05-09 02:37:41] [INFO ] Added : 47 causal constraints over 10 iterations in 111 ms. Result :sat

Minimization took 30 ms.

[2021-05-09 02:37:41] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat

[2021-05-09 02:37:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.

[2021-05-09 02:37:41] [INFO ] [Real]Absence check using state equation in 113 ms returned sat

[2021-05-09 02:37:41] [INFO ] Solution in real domain found non-integer solution.

[2021-05-09 02:37:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat

[2021-05-09 02:37:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.

[2021-05-09 02:37:41] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat

[2021-05-09 02:37:41] [INFO ] [Nat]Added 22 Read/Feed constraints in 10 ms returned sat

[2021-05-09 02:37:41] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.

[2021-05-09 02:37:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms

[2021-05-09 02:37:41] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 77 transitions) in 35 ms.

[2021-05-09 02:37:41] [INFO ] Added : 45 causal constraints over 11 iterations in 158 ms. Result :sat

Minimization took 29 ms.

Current structural bounds on expressions (after SMT) : [20, 20] Max seen :[10, 10]

Incomplete Parikh walk after 49300 steps, including 981 resets, run finished after 112 ms. (steps per millisecond=440 ) properties (out of 2) seen :17 could not realise parikh vector

Incomplete Parikh walk after 49000 steps, including 1015 resets, run finished after 121 ms. (steps per millisecond=404 ) properties (out of 2) seen :20 could not realise parikh vector

Support contains 2 out of 64 places. Attempting structural reductions.

Starting structural reductions, iteration 0 : 64/64 places, 548/548 transitions.

Applied a total of 0 rules in 18 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.

Finished structural reductions, in 1 iterations. Remains : 64/64 places, 548/548 transitions.

Starting structural reductions, iteration 0 : 64/64 places, 548/548 transitions.

Applied a total of 0 rules in 18 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.

[2021-05-09 02:37:41] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)

// Phase 1: matrix 130 rows 64 cols

[2021-05-09 02:37:41] [INFO ] Computed 5 place invariants in 2 ms

[2021-05-09 02:37:41] [INFO ] Implicit Places using invariants in 195 ms returned []

[2021-05-09 02:37:41] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)

// Phase 1: matrix 130 rows 64 cols

[2021-05-09 02:37:41] [INFO ] Computed 5 place invariants in 1 ms

[2021-05-09 02:37:42] [INFO ] State equation strengthened by 22 read => feed constraints.

[2021-05-09 02:37:42] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []

Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.

[2021-05-09 02:37:42] [INFO ] Redundant transitions in 4 ms returned []

[2021-05-09 02:37:42] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)

// Phase 1: matrix 130 rows 64 cols

[2021-05-09 02:37:42] [INFO ] Computed 5 place invariants in 1 ms

[2021-05-09 02:37:42] [INFO ] Dead Transitions using invariants and state equation in 253 ms returned []

Finished structural reductions, in 1 iterations. Remains : 64/64 places, 548/548 transitions.

Starting property specific reduction for BridgeAndVehicles-PT-V20P20N10-UpperBounds-03

Normalized transition count is 130 out of 548 initially.

// Phase 1: matrix 130 rows 64 cols

[2021-05-09 02:37:42] [INFO ] Computed 5 place invariants in 1 ms

Incomplete random walk after 10000 steps, including 56 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :5

Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :10

[2021-05-09 02:37:42] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)

// Phase 1: matrix 130 rows 64 cols

[2021-05-09 02:37:42] [INFO ] Computed 5 place invariants in 1 ms

[2021-05-09 02:37:42] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat

[2021-05-09 02:37:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.

[2021-05-09 02:37:42] [INFO ] [Real]Absence check using state equation in 27 ms returned sat

[2021-05-09 02:37:42] [INFO ] Solution in real domain found non-integer solution.

[2021-05-09 02:37:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat

[2021-05-09 02:37:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.

[2021-05-09 02:37:42] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat

[2021-05-09 02:37:42] [INFO ] State equation strengthened by 22 read => feed constraints.

[2021-05-09 02:37:42] [INFO ] [Nat]Added 22 Read/Feed constraints in 9 ms returned sat

[2021-05-09 02:37:42] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 0 ms to minimize.

[2021-05-09 02:37:42] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.

[2021-05-09 02:37:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 131 ms

[2021-05-09 02:37:42] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 77 transitions) in 17 ms.

[2021-05-09 02:37:42] [INFO ] Added : 47 causal constraints over 10 iterations in 87 ms. Result :sat

Minimization took 19 ms.

Current structural bounds on expressions (after SMT) : [20] Max seen :[10]

Incomplete Parikh walk after 49000 steps, including 1013 resets, run finished after 115 ms. (steps per millisecond=426 ) properties (out of 1) seen :10 could not realise parikh vector

Support contains 1 out of 64 places. Attempting structural reductions.

Starting structural reductions, iteration 0 : 64/64 places, 548/548 transitions.

Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1

Deduced a syphon composed of 1 places in 1 ms

Reduce places removed 1 places and 0 transitions.

Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 63 transition count 547

Applied a total of 2 rules in 25 ms. Remains 63 /64 variables (removed 1) and now considering 547/548 (removed 1) transitions.

[2021-05-09 02:37:42] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)

// Phase 1: matrix 129 rows 63 cols

[2021-05-09 02:37:42] [INFO ] Computed 5 place invariants in 2 ms

[2021-05-09 02:37:43] [INFO ] Dead Transitions using invariants and state equation in 279 ms returned []

Finished structural reductions, in 1 iterations. Remains : 63/64 places, 547/548 transitions.

Normalized transition count is 129 out of 547 initially.

// Phase 1: matrix 129 rows 63 cols

[2021-05-09 02:37:43] [INFO ] Computed 5 place invariants in 1 ms

Incomplete random walk after 1000000 steps, including 6490 resets, run finished after 2098 ms. (steps per millisecond=476 ) properties (out of 1) seen :9

Incomplete Best-First random walk after 1000000 steps, including 2550 resets, run finished after 997 ms. (steps per millisecond=1003 ) properties (out of 1) seen :10

[2021-05-09 02:37:46] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)

// Phase 1: matrix 129 rows 63 cols

[2021-05-09 02:37:46] [INFO ] Computed 5 place invariants in 1 ms

[2021-05-09 02:37:46] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat

[2021-05-09 02:37:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.

[2021-05-09 02:37:46] [INFO ] [Real]Absence check using state equation in 43 ms returned sat

[2021-05-09 02:37:46] [INFO ] Solution in real domain found non-integer solution.

[2021-05-09 02:37:46] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat

[2021-05-09 02:37:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.

[2021-05-09 02:37:46] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat

[2021-05-09 02:37:46] [INFO ] State equation strengthened by 22 read => feed constraints.

[2021-05-09 02:37:46] [INFO ] [Nat]Added 22 Read/Feed constraints in 9 ms returned sat

[2021-05-09 02:37:46] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 76 transitions) in 15 ms.

[2021-05-09 02:37:46] [INFO ] Added : 43 causal constraints over 10 iterations in 97 ms. Result :sat

Minimization took 27 ms.

Current structural bounds on expressions (after SMT) : [20] Max seen :[10]

Incomplete Parikh walk after 47000 steps, including 1037 resets, run finished after 146 ms. (steps per millisecond=321 ) properties (out of 1) seen :9 could not realise parikh vector

Support contains 1 out of 63 places. Attempting structural reductions.

Starting structural reductions, iteration 0 : 63/63 places, 547/547 transitions.

Applied a total of 0 rules in 19 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.

Finished structural reductions, in 1 iterations. Remains : 63/63 places, 547/547 transitions.

Starting structural reductions, iteration 0 : 63/63 places, 547/547 transitions.

Applied a total of 0 rules in 18 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.

[2021-05-09 02:37:46] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)

// Phase 1: matrix 129 rows 63 cols

[2021-05-09 02:37:46] [INFO ] Computed 5 place invariants in 2 ms

[2021-05-09 02:37:46] [INFO ] Implicit Places using invariants in 141 ms returned []

[2021-05-09 02:37:46] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)

// Phase 1: matrix 129 rows 63 cols

[2021-05-09 02:37:46] [INFO ] Computed 5 place invariants in 2 ms

[2021-05-09 02:37:47] [INFO ] State equation strengthened by 22 read => feed constraints.

[2021-05-09 02:37:47] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []

Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.

[2021-05-09 02:37:47] [INFO ] Redundant transitions in 2 ms returned []

[2021-05-09 02:37:47] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)

// Phase 1: matrix 129 rows 63 cols

[2021-05-09 02:37:47] [INFO ] Computed 5 place invariants in 1 ms

[2021-05-09 02:37:47] [INFO ] Dead Transitions using invariants and state equation in 220 ms returned []

Finished structural reductions, in 1 iterations. Remains : 63/63 places, 547/547 transitions.

Ending property specific reduction for BridgeAndVehicles-PT-V20P20N10-UpperBounds-03 in 5069 ms.

Starting property specific reduction for BridgeAndVehicles-PT-V20P20N10-UpperBounds-05

Normalized transition count is 130 out of 548 initially.

// Phase 1: matrix 130 rows 64 cols

[2021-05-09 02:37:47] [INFO ] Computed 5 place invariants in 1 ms

Incomplete random walk after 10000 steps, including 56 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :5

Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :10

[2021-05-09 02:37:47] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)

// Phase 1: matrix 130 rows 64 cols

[2021-05-09 02:37:47] [INFO ] Computed 5 place invariants in 1 ms

[2021-05-09 02:37:47] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat

[2021-05-09 02:37:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.

[2021-05-09 02:37:47] [INFO ] [Real]Absence check using state equation in 46 ms returned sat

[2021-05-09 02:37:47] [INFO ] Solution in real domain found non-integer solution.

[2021-05-09 02:37:47] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat

[2021-05-09 02:37:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.

[2021-05-09 02:37:47] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat

[2021-05-09 02:37:47] [INFO ] State equation strengthened by 22 read => feed constraints.

[2021-05-09 02:37:47] [INFO ] [Nat]Added 22 Read/Feed constraints in 6 ms returned sat

[2021-05-09 02:37:47] [INFO ] Deduced a trap composed of 14 places in 277 ms of which 0 ms to minimize.

[2021-05-09 02:37:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 286 ms

[2021-05-09 02:37:47] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 77 transitions) in 10 ms.

[2021-05-09 02:37:48] [INFO ] Added : 45 causal constraints over 11 iterations in 71 ms. Result :sat

Minimization took 21 ms.

Current structural bounds on expressions (after SMT) : [20] Max seen :[10]

Incomplete Parikh walk after 49300 steps, including 983 resets, run finished after 93 ms. (steps per millisecond=530 ) properties (out of 1) seen :9 could not realise parikh vector

Support contains 1 out of 64 places. Attempting structural reductions.

Starting structural reductions, iteration 0 : 64/64 places, 548/548 transitions.

Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1

Deduced a syphon composed of 1 places in 0 ms

Reduce places removed 1 places and 0 transitions.

Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 63 transition count 547

Applied a total of 2 rules in 17 ms. Remains 63 /64 variables (removed 1) and now considering 547/548 (removed 1) transitions.

[2021-05-09 02:37:48] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)

// Phase 1: matrix 129 rows 63 cols

[2021-05-09 02:37:48] [INFO ] Computed 5 place invariants in 1 ms

[2021-05-09 02:37:48] [INFO ] Dead Transitions using invariants and state equation in 233 ms returned []

Finished structural reductions, in 1 iterations. Remains : 63/64 places, 547/548 transitions.

Normalized transition count is 129 out of 547 initially.

// Phase 1: matrix 129 rows 63 cols

[2021-05-09 02:37:48] [INFO ] Computed 5 place invariants in 0 ms

Incomplete random walk after 1000000 steps, including 6490 resets, run finished after 1880 ms. (steps per millisecond=531 ) properties (out of 1) seen :8

Incomplete Best-First random walk after 1000001 steps, including 2459 resets, run finished after 753 ms. (steps per millisecond=1328 ) properties (out of 1) seen :10

[2021-05-09 02:37:51] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)

// Phase 1: matrix 129 rows 63 cols

[2021-05-09 02:37:51] [INFO ] Computed 5 place invariants in 0 ms

[2021-05-09 02:37:51] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat

[2021-05-09 02:37:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.

[2021-05-09 02:37:51] [INFO ] [Real]Absence check using state equation in 18 ms returned sat

[2021-05-09 02:37:51] [INFO ] State equation strengthened by 22 read => feed constraints.

[2021-05-09 02:37:51] [INFO ] [Real]Added 22 Read/Feed constraints in 5 ms returned sat

[2021-05-09 02:37:51] [INFO ] Solution in real domain found non-integer solution.

[2021-05-09 02:37:51] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat

[2021-05-09 02:37:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.

[2021-05-09 02:37:51] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat

[2021-05-09 02:37:51] [INFO ] [Nat]Added 22 Read/Feed constraints in 9 ms returned sat

[2021-05-09 02:37:51] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 76 transitions) in 13 ms.

[2021-05-09 02:37:51] [INFO ] Added : 47 causal constraints over 10 iterations in 72 ms. Result :sat

Minimization took 19 ms.

Current structural bounds on expressions (after SMT) : [20] Max seen :[10]

Incomplete Parikh walk after 48800 steps, including 939 resets, run finished after 104 ms. (steps per millisecond=469 ) properties (out of 1) seen :10 could not realise parikh vector

Support contains 1 out of 63 places. Attempting structural reductions.

Starting structural reductions, iteration 0 : 63/63 places, 547/547 transitions.

Applied a total of 0 rules in 11 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.

Finished structural reductions, in 1 iterations. Remains : 63/63 places, 547/547 transitions.

Starting structural reductions, iteration 0 : 63/63 places, 547/547 transitions.

Applied a total of 0 rules in 19 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.

[2021-05-09 02:37:51] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)

// Phase 1: matrix 129 rows 63 cols

[2021-05-09 02:37:51] [INFO ] Computed 5 place invariants in 1 ms

[2021-05-09 02:37:51] [INFO ] Implicit Places using invariants in 239 ms returned []

[2021-05-09 02:37:51] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)

// Phase 1: matrix 129 rows 63 cols

[2021-05-09 02:37:51] [INFO ] Computed 5 place invariants in 0 ms

[2021-05-09 02:37:51] [INFO ] State equation strengthened by 22 read => feed constraints.

[2021-05-09 02:37:51] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []

Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.

[2021-05-09 02:37:51] [INFO ] Redundant transitions in 2 ms returned []

[2021-05-09 02:37:51] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)

// Phase 1: matrix 129 rows 63 cols

[2021-05-09 02:37:51] [INFO ] Computed 5 place invariants in 1 ms

[2021-05-09 02:37:52] [INFO ] Dead Transitions using invariants and state equation in 207 ms returned []

Finished structural reductions, in 1 iterations. Remains : 63/63 places, 547/547 transitions.

Ending property specific reduction for BridgeAndVehicles-PT-V20P20N10-UpperBounds-05 in 4616 ms.

[2021-05-09 02:37:52] [INFO ] Flatten gal took : 87 ms

[2021-05-09 02:37:52] [INFO ] Applying decomposition

[2021-05-09 02:37:52] [INFO ] Flatten gal took : 35 ms

Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph12505826264274511856.txt, -o, /tmp/graph12505826264274511856.bin, -w, /tmp/graph12505826264274511856.weights], workingDir=null]

Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph12505826264274511856.bin, -l, -1, -v, -w, /tmp/graph12505826264274511856.weights, -q, 0, -e, 0.001], workingDir=null]

[2021-05-09 02:37:52] [INFO ] Decomposing Gal with order

[2021-05-09 02:37:52] [INFO ] Rewriting arrays to variables to allow decomposition.

[2021-05-09 02:37:52] [INFO ] Removed a total of 953 redundant transitions.

[2021-05-09 02:37:52] [INFO ] Flatten gal took : 189 ms

[2021-05-09 02:37:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 137 labels/synchronizations in 11 ms.

[2021-05-09 02:37:52] [INFO ] Time to serialize gal into /tmp/UpperBounds10885400046408631001.gal : 3 ms

[2021-05-09 02:37:52] [INFO ] Time to serialize properties into /tmp/UpperBounds10681369685302317239.prop : 0 ms

Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds10885400046408631001.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds10681369685302317239.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds10885400046408631001.gal -t CGAL -reachable-file /tmp/UpperBounds10681369685302317239.prop --nowitness

Loading property file /tmp/UpperBounds10681369685302317239.prop.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache

petri\_inst\_inst\_mod\_flat,6.73257e+06,16.8051,403968,2938,4121,283196,261241,105,846022,188,4.0912e+06,0

Total reachable state count : 6732570

Verifying 2 reachability properties.

Min sum of variable value : 0

Maximum sum along a path : 10

Bounds property BridgeAndVehicles-PT-V20P20N10-UpperBounds-03 :0 <= u1.SUR_PONT_A <= 10
**FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-03 10 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
**

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache

BridgeAndVehicles-PT-V20P20N10-UpperBounds-03,0,17.2499,403968,1,0,283196,261241,132,846022,230,4.0912e+06,128

Min sum of variable value : 0

Maximum sum along a path : 10

Bounds property BridgeAndVehicles-PT-V20P20N10-UpperBounds-05 :0 <= u1.SUR_PONT_B <= 10
**FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-05 10 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
**

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache

BridgeAndVehicles-PT-V20P20N10-UpperBounds-05,0,17.2895,403968,1,0,283196,261241,139,846022,244,4.0912e+06,206

**BK_STOP 1620527890939
**

--------------------

content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../

+ BINDIR=/home/mcc/BenchKit/bin//../

++ pwd

+ export MODEL=/home/mcc/execution

+ MODEL=/home/mcc/execution

+ [[ UpperBounds = StateSpace ]]

+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

+ ulimit -s 65536

+ [[ -z '' ]]

+ export LTSMIN_MEM_SIZE=8589934592

+ LTSMIN_MEM_SIZE=8589934592

++ cut -d . -f 9

++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar

+ VERSION=0

+ echo 'Running Version 0'

+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

## Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x

# this is for BenchKit: configuration of major elements for the test

export BK_INPUT="BridgeAndVehicles-PT-V20P20N10"

export BK_EXAMINATION="UpperBounds"

export BK_TOOL="itstools"

export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"

export BK_TIME_CONFINEMENT="3600"

export BK_MEMORY_CONFINEMENT="16384"

export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)

if [ -d execution ] ; then

rm -rf execution

fi

# this is for BenchKit: explicit launching of the test

echo "====================================================================="

echo " Generated by BenchKit 2-4028"

echo " Executing tool itstools"

echo " Input is BridgeAndVehicles-PT-V20P20N10, examination is UpperBounds"

echo " Time confinement is $BK_TIME_CONFINEMENT seconds"

echo " Memory confinement is 16384 MBytes"

echo " Number of cores is 4"

echo " Run identifier is r026-tajo-162038143500203"

echo "====================================================================="

echo

echo "--------------------"

echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V20P20N10.tgz

mv BridgeAndVehicles-PT-V20P20N10 execution

cd execution

if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then

rm -f GenericPropertiesVerdict.xml

fi

pwd

ls -lh

echo

echo "--------------------"

echo "content from stdout:"

echo

echo "=== Data for post analysis generated by BenchKit (invocation template)"

echo

if [ "UpperBounds" = "UpperBounds" ] ; then

echo "The expected result is a vector of positive values"

echo NUM_VECTOR

elif [ "UpperBounds" != "StateSpace" ] ; then

echo "The expected result is a vector of booleans"

echo BOOL_VECTOR

else

echo "no data necessary for post analysis"

fi

echo

if [ -f "UpperBounds.txt" ] ; then

echo "here is the order used to build the result vector(from text file)"

for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do

echo "FORMULA_NAME $x"

done

elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)

echo echo "here is the order used to build the result vector(from xml file)"

for x in $(grep '

echo "FORMULA_NAME $x"

done

elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then

echo "FORMULA_NAME UpperBounds"

fi

echo

echo "=== Now, execution of the tool begins"

echo

echo -n "BK_START "

date -u +%s%3N

echo

timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"

if [ $? -eq 137 ] ; then

echo

echo "BK_TIME_CONFINEMENT_REACHED"

fi

echo

echo "--------------------"

echo "content from stderr:"

echo

cat STDERR ;