Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r293-tall-167873945700613.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is PolyORBLF-PT-S06J06T04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r293-tall-167873945700613
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 16K Feb 26 13:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 26 13:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 223K Feb 26 13:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 956K Feb 26 13:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 44K Feb 25 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 211K Feb 25 16:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 658K Feb 25 16:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 26K Feb 26 14:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Feb 26 14:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 167K Feb 26 14:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 773K Feb 26 14:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.4K Feb 25 16:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 6.9M Mar 5 18:23 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 PolyORBLF-PT-S06J06T04-UpperBounds-00
FORMULA_NAME PolyORBLF-PT-S06J06T04-UpperBounds-01
FORMULA_NAME PolyORBLF-PT-S06J06T04-UpperBounds-02
FORMULA_NAME PolyORBLF-PT-S06J06T04-UpperBounds-03
FORMULA_NAME PolyORBLF-PT-S06J06T04-UpperBounds-04
FORMULA_NAME PolyORBLF-PT-S06J06T04-UpperBounds-05
FORMULA_NAME PolyORBLF-PT-S06J06T04-UpperBounds-06
FORMULA_NAME PolyORBLF-PT-S06J06T04-UpperBounds-07
FORMULA_NAME PolyORBLF-PT-S06J06T04-UpperBounds-08
FORMULA_NAME PolyORBLF-PT-S06J06T04-UpperBounds-09
FORMULA_NAME PolyORBLF-PT-S06J06T04-UpperBounds-10
FORMULA_NAME PolyORBLF-PT-S06J06T04-UpperBounds-11
FORMULA_NAME PolyORBLF-PT-S06J06T04-UpperBounds-12
FORMULA_NAME PolyORBLF-PT-S06J06T04-UpperBounds-13
FORMULA_NAME PolyORBLF-PT-S06J06T04-UpperBounds-14
FORMULA_NAME PolyORBLF-PT-S06J06T04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678914808924

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S06J06T04
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-15 21:13:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-15 21:13:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 21:13:30] [INFO ] Load time of PNML (sax parser for PT used): 365 ms
[2023-03-15 21:13:30] [INFO ] Transformed 506 places.
[2023-03-15 21:13:30] [INFO ] Transformed 7154 transitions.
[2023-03-15 21:13:31] [INFO ] Parsed PT model containing 506 places and 7154 transitions and 59824 arcs in 832 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Ensure Unique test removed 5380 transitions
Reduce redundant transitions removed 5380 transitions.
Normalized transition count is 1750 out of 1774 initially.
// Phase 1: matrix 1750 rows 506 cols
[2023-03-15 21:13:31] [INFO ] Computed 54 place invariants in 98 ms
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-10 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 39 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 14) seen :37
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-09 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :19
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :20
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 9) seen :7
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :20
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :21
Incomplete Best-First random walk after 10000 steps, including 31 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :20
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) seen :23
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) seen :20
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :22
[2023-03-15 21:13:31] [INFO ] Flow matrix only has 1750 transitions (discarded 24 similar events)
// Phase 1: matrix 1750 rows 506 cols
[2023-03-15 21:13:31] [INFO ] Computed 54 place invariants in 52 ms
[2023-03-15 21:13:32] [INFO ] [Real]Absence check using 23 positive place invariants in 20 ms returned sat
[2023-03-15 21:13:32] [INFO ] [Real]Absence check using 23 positive and 31 generalized place invariants in 20 ms returned sat
[2023-03-15 21:13:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:13:33] [INFO ] [Real]Absence check using state equation in 1677 ms returned sat
[2023-03-15 21:13:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:13:34] [INFO ] [Nat]Absence check using 23 positive place invariants in 8 ms returned sat
[2023-03-15 21:13:34] [INFO ] [Nat]Absence check using 23 positive and 31 generalized place invariants in 12 ms returned sat
[2023-03-15 21:13:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:13:38] [INFO ] [Nat]Absence check using state equation in 4371 ms returned sat
[2023-03-15 21:13:38] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 21:13:39] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 21:13:39] [INFO ] [Nat]Added 112 Read/Feed constraints in 510 ms returned unknown
[2023-03-15 21:13:39] [INFO ] [Real]Absence check using 23 positive place invariants in 20 ms returned sat
[2023-03-15 21:13:39] [INFO ] [Real]Absence check using 23 positive and 31 generalized place invariants in 18 ms returned sat
[2023-03-15 21:13:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:13:40] [INFO ] [Real]Absence check using state equation in 970 ms returned sat
[2023-03-15 21:13:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:13:40] [INFO ] [Nat]Absence check using 23 positive place invariants in 7 ms returned sat
[2023-03-15 21:13:40] [INFO ] [Nat]Absence check using 23 positive and 31 generalized place invariants in 16 ms returned sat
[2023-03-15 21:13:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:13:45] [INFO ] [Nat]Absence check using state equation in 4910 ms returned unknown
[2023-03-15 21:13:45] [INFO ] [Real]Absence check using 23 positive place invariants in 7 ms returned sat
[2023-03-15 21:13:45] [INFO ] [Real]Absence check using 23 positive and 31 generalized place invariants in 13 ms returned unsat
[2023-03-15 21:13:45] [INFO ] [Real]Absence check using 23 positive place invariants in 7 ms returned sat
[2023-03-15 21:13:45] [INFO ] [Real]Absence check using 23 positive and 31 generalized place invariants in 13 ms returned unsat
[2023-03-15 21:13:45] [INFO ] [Real]Absence check using 23 positive place invariants in 5 ms returned unsat
[2023-03-15 21:13:45] [INFO ] [Real]Absence check using 23 positive place invariants in 7 ms returned sat
[2023-03-15 21:13:45] [INFO ] [Real]Absence check using 23 positive and 31 generalized place invariants in 12 ms returned unsat
[2023-03-15 21:13:45] [INFO ] [Real]Absence check using 23 positive place invariants in 5 ms returned unsat
[2023-03-15 21:13:45] [INFO ] [Real]Absence check using 23 positive place invariants in 7 ms returned sat
[2023-03-15 21:13:45] [INFO ] [Real]Absence check using 23 positive and 31 generalized place invariants in 18 ms returned unsat
[2023-03-15 21:13:45] [INFO ] [Real]Absence check using 23 positive place invariants in 9 ms returned sat
[2023-03-15 21:13:45] [INFO ] [Real]Absence check using 23 positive and 31 generalized place invariants in 17 ms returned unsat
Current structural bounds on expressions (after SMT) : [-1, 356, 6, 4, 1, 4, 1, 1, 1] Max seen :[3, 2, 6, 4, 1, 4, 1, 1, 1]
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-06 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-03 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 28 out of 506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 506/506 places, 1774/1774 transitions.
Ensure Unique test removed 6 places
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 500 transition count 1738
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 78 place count 464 transition count 1738
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 78 place count 464 transition count 1682
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 190 place count 408 transition count 1682
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 286 place count 360 transition count 1634
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 294 place count 360 transition count 1626
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 302 place count 352 transition count 1626
Applied a total of 302 rules in 270 ms. Remains 352 /506 variables (removed 154) and now considering 1626/1774 (removed 148) transitions.
[2023-03-15 21:13:46] [INFO ] Flow matrix only has 1602 transitions (discarded 24 similar events)
// Phase 1: matrix 1602 rows 352 cols
[2023-03-15 21:13:46] [INFO ] Computed 48 place invariants in 31 ms
[2023-03-15 21:13:46] [INFO ] Dead Transitions using invariants and state equation in 844 ms found 612 transitions.
Found 612 dead transitions using SMT.
Drop transitions removed 612 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 612 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 352/506 places, 1014/1774 transitions.
Applied a total of 0 rules in 23 ms. Remains 352 /352 variables (removed 0) and now considering 1014/1014 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1141 ms. Remains : 352/506 places, 1014/1774 transitions.
Normalized transition count is 990 out of 1014 initially.
// Phase 1: matrix 990 rows 352 cols
[2023-03-15 21:13:46] [INFO ] Computed 48 place invariants in 14 ms
Incomplete random walk after 1000000 steps, including 9913 resets, run finished after 5846 ms. (steps per millisecond=171 ) properties (out of 2) seen :5
Incomplete Best-First random walk after 1000001 steps, including 1465 resets, run finished after 2354 ms. (steps per millisecond=424 ) properties (out of 2) seen :3
Incomplete Best-First random walk after 1000001 steps, including 327 resets, run finished after 2540 ms. (steps per millisecond=393 ) properties (out of 2) seen :5
[2023-03-15 21:13:57] [INFO ] Flow matrix only has 990 transitions (discarded 24 similar events)
// Phase 1: matrix 990 rows 352 cols
[2023-03-15 21:13:57] [INFO ] Computed 48 place invariants in 21 ms
[2023-03-15 21:13:57] [INFO ] [Real]Absence check using 19 positive place invariants in 5 ms returned sat
[2023-03-15 21:13:57] [INFO ] [Real]Absence check using 19 positive and 29 generalized place invariants in 16 ms returned sat
[2023-03-15 21:13:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:13:59] [INFO ] [Real]Absence check using state equation in 1423 ms returned sat
[2023-03-15 21:13:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:13:59] [INFO ] [Nat]Absence check using 19 positive place invariants in 6 ms returned sat
[2023-03-15 21:13:59] [INFO ] [Nat]Absence check using 19 positive and 29 generalized place invariants in 13 ms returned sat
[2023-03-15 21:13:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:14:00] [INFO ] [Nat]Absence check using state equation in 1196 ms returned sat
[2023-03-15 21:14:00] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 21:14:01] [INFO ] [Nat]Added 112 Read/Feed constraints in 791 ms returned sat
[2023-03-15 21:14:01] [INFO ] Deduced a trap composed of 18 places in 212 ms of which 5 ms to minimize.
[2023-03-15 21:14:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 245 ms
[2023-03-15 21:14:01] [INFO ] [Real]Absence check using 19 positive place invariants in 5 ms returned sat
[2023-03-15 21:14:01] [INFO ] [Real]Absence check using 19 positive and 29 generalized place invariants in 14 ms returned sat
[2023-03-15 21:14:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:14:02] [INFO ] [Real]Absence check using state equation in 1303 ms returned sat
[2023-03-15 21:14:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:14:02] [INFO ] [Nat]Absence check using 19 positive place invariants in 6 ms returned sat
[2023-03-15 21:14:02] [INFO ] [Nat]Absence check using 19 positive and 29 generalized place invariants in 14 ms returned sat
[2023-03-15 21:14:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:14:05] [INFO ] [Nat]Absence check using state equation in 2489 ms returned sat
[2023-03-15 21:14:06] [INFO ] [Nat]Added 112 Read/Feed constraints in 953 ms returned sat
[2023-03-15 21:14:06] [INFO ] Deduced a trap composed of 80 places in 214 ms of which 1 ms to minimize.
[2023-03-15 21:14:07] [INFO ] Deduced a trap composed of 18 places in 198 ms of which 1 ms to minimize.
[2023-03-15 21:14:07] [INFO ] Deduced a trap composed of 57 places in 55 ms of which 1 ms to minimize.
[2023-03-15 21:14:07] [INFO ] Deduced a trap composed of 198 places in 235 ms of which 1 ms to minimize.
[2023-03-15 21:14:08] [INFO ] Deduced a trap composed of 184 places in 223 ms of which 0 ms to minimize.
[2023-03-15 21:14:11] [INFO ] Trap strengthening (SAT) tested/added 5/5 trap constraints in 4616 ms
Current structural bounds on expressions (after SMT) : [3, 356] Max seen :[3, 2]
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-00 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 24 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 1014/1014 transitions.
Applied a total of 0 rules in 21 ms. Remains 352 /352 variables (removed 0) and now considering 1014/1014 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 352/352 places, 1014/1014 transitions.
Normalized transition count is 990 out of 1014 initially.
// Phase 1: matrix 990 rows 352 cols
[2023-03-15 21:14:11] [INFO ] Computed 48 place invariants in 15 ms
Incomplete random walk after 1000000 steps, including 9976 resets, run finished after 5855 ms. (steps per millisecond=170 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 303 resets, run finished after 2517 ms. (steps per millisecond=397 ) properties (out of 1) seen :2
[2023-03-15 21:14:19] [INFO ] Flow matrix only has 990 transitions (discarded 24 similar events)
// Phase 1: matrix 990 rows 352 cols
[2023-03-15 21:14:19] [INFO ] Computed 48 place invariants in 25 ms
[2023-03-15 21:14:19] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2023-03-15 21:14:19] [INFO ] [Real]Absence check using 19 positive and 29 generalized place invariants in 14 ms returned sat
[2023-03-15 21:14:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:14:20] [INFO ] [Real]Absence check using state equation in 1287 ms returned sat
[2023-03-15 21:14:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:14:20] [INFO ] [Nat]Absence check using 19 positive place invariants in 5 ms returned sat
[2023-03-15 21:14:21] [INFO ] [Nat]Absence check using 19 positive and 29 generalized place invariants in 13 ms returned sat
[2023-03-15 21:14:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:14:23] [INFO ] [Nat]Absence check using state equation in 2512 ms returned sat
[2023-03-15 21:14:23] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 21:14:24] [INFO ] [Nat]Added 112 Read/Feed constraints in 965 ms returned sat
[2023-03-15 21:14:24] [INFO ] Deduced a trap composed of 80 places in 213 ms of which 0 ms to minimize.
[2023-03-15 21:14:25] [INFO ] Deduced a trap composed of 18 places in 200 ms of which 0 ms to minimize.
[2023-03-15 21:14:25] [INFO ] Deduced a trap composed of 57 places in 46 ms of which 0 ms to minimize.
[2023-03-15 21:14:25] [INFO ] Deduced a trap composed of 198 places in 208 ms of which 1 ms to minimize.
[2023-03-15 21:14:26] [INFO ] Deduced a trap composed of 184 places in 199 ms of which 1 ms to minimize.
[2023-03-15 21:14:29] [INFO ] Trap strengthening (SAT) tested/added 5/5 trap constraints in 4567 ms
Current structural bounds on expressions (after SMT) : [356] Max seen :[2]
Support contains 24 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 1014/1014 transitions.
Applied a total of 0 rules in 19 ms. Remains 352 /352 variables (removed 0) and now considering 1014/1014 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 352/352 places, 1014/1014 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 1014/1014 transitions.
Applied a total of 0 rules in 17 ms. Remains 352 /352 variables (removed 0) and now considering 1014/1014 (removed 0) transitions.
[2023-03-15 21:14:29] [INFO ] Flow matrix only has 990 transitions (discarded 24 similar events)
[2023-03-15 21:14:29] [INFO ] Invariant cache hit.
[2023-03-15 21:14:29] [INFO ] Implicit Places using invariants in 381 ms returned [17, 70, 145, 291]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 388 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 348/352 places, 1014/1014 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 344 transition count 1010
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 344 transition count 1010
Applied a total of 8 rules in 29 ms. Remains 344 /348 variables (removed 4) and now considering 1010/1014 (removed 4) transitions.
[2023-03-15 21:14:29] [INFO ] Flow matrix only has 986 transitions (discarded 24 similar events)
// Phase 1: matrix 986 rows 344 cols
[2023-03-15 21:14:29] [INFO ] Computed 44 place invariants in 17 ms
[2023-03-15 21:14:29] [INFO ] Implicit Places using invariants in 367 ms returned []
[2023-03-15 21:14:29] [INFO ] Flow matrix only has 986 transitions (discarded 24 similar events)
[2023-03-15 21:14:29] [INFO ] Invariant cache hit.
[2023-03-15 21:14:30] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 21:14:42] [INFO ] Implicit Places using invariants and state equation in 12193 ms returned []
Implicit Place search using SMT with State Equation took 12563 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 344/352 places, 1010/1014 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 12999 ms. Remains : 344/352 places, 1010/1014 transitions.
Normalized transition count is 986 out of 1010 initially.
// Phase 1: matrix 986 rows 344 cols
[2023-03-15 21:14:42] [INFO ] Computed 44 place invariants in 21 ms
Incomplete random walk after 1000000 steps, including 9822 resets, run finished after 5555 ms. (steps per millisecond=180 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000000 steps, including 284 resets, run finished after 2491 ms. (steps per millisecond=401 ) properties (out of 1) seen :2
[2023-03-15 21:14:50] [INFO ] Flow matrix only has 986 transitions (discarded 24 similar events)
// Phase 1: matrix 986 rows 344 cols
[2023-03-15 21:14:50] [INFO ] Computed 44 place invariants in 21 ms
[2023-03-15 21:14:50] [INFO ] [Real]Absence check using 22 positive place invariants in 5 ms returned sat
[2023-03-15 21:14:50] [INFO ] [Real]Absence check using 22 positive and 22 generalized place invariants in 12 ms returned sat
[2023-03-15 21:14:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:14:52] [INFO ] [Real]Absence check using state equation in 2276 ms returned sat
[2023-03-15 21:14:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:14:52] [INFO ] [Nat]Absence check using 22 positive place invariants in 6 ms returned sat
[2023-03-15 21:14:52] [INFO ] [Nat]Absence check using 22 positive and 22 generalized place invariants in 13 ms returned sat
[2023-03-15 21:14:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:14:55] [INFO ] [Nat]Absence check using state equation in 3308 ms returned sat
[2023-03-15 21:14:56] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 21:14:57] [INFO ] [Nat]Added 112 Read/Feed constraints in 1038 ms returned sat
[2023-03-15 21:14:57] [INFO ] Deduced a trap composed of 85 places in 200 ms of which 1 ms to minimize.
[2023-03-15 21:14:57] [INFO ] Deduced a trap composed of 18 places in 203 ms of which 1 ms to minimize.
[2023-03-15 21:14:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 714 ms
[2023-03-15 21:14:57] [INFO ] Computed and/alt/rep : 574/2809/569 causal constraints (skipped 411 transitions) in 78 ms.
[2023-03-15 21:14:59] [INFO ] Added : 94 causal constraints over 19 iterations in 2102 ms. Result :sat
Minimization took 1272 ms.
Current structural bounds on expressions (after SMT) : [356] Max seen :[2]
Support contains 24 out of 344 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 344/344 places, 1010/1010 transitions.
Applied a total of 0 rules in 18 ms. Remains 344 /344 variables (removed 0) and now considering 1010/1010 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 344/344 places, 1010/1010 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 344/344 places, 1010/1010 transitions.
Applied a total of 0 rules in 17 ms. Remains 344 /344 variables (removed 0) and now considering 1010/1010 (removed 0) transitions.
[2023-03-15 21:15:01] [INFO ] Flow matrix only has 986 transitions (discarded 24 similar events)
[2023-03-15 21:15:01] [INFO ] Invariant cache hit.
[2023-03-15 21:15:02] [INFO ] Implicit Places using invariants in 339 ms returned []
[2023-03-15 21:15:02] [INFO ] Flow matrix only has 986 transitions (discarded 24 similar events)
[2023-03-15 21:15:02] [INFO ] Invariant cache hit.
[2023-03-15 21:15:02] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 21:15:14] [INFO ] Implicit Places using invariants and state equation in 12008 ms returned []
Implicit Place search using SMT with State Equation took 12349 ms to find 0 implicit places.
[2023-03-15 21:15:14] [INFO ] Redundant transitions in 63 ms returned []
[2023-03-15 21:15:14] [INFO ] Flow matrix only has 986 transitions (discarded 24 similar events)
[2023-03-15 21:15:14] [INFO ] Invariant cache hit.
[2023-03-15 21:15:14] [INFO ] Dead Transitions using invariants and state equation in 516 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12956 ms. Remains : 344/344 places, 1010/1010 transitions.
Starting property specific reduction for PolyORBLF-PT-S06J06T04-UpperBounds-02
Normalized transition count is 986 out of 1010 initially.
// Phase 1: matrix 986 rows 344 cols
[2023-03-15 21:15:14] [INFO ] Computed 44 place invariants in 18 ms
Incomplete random walk after 10000 steps, including 99 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :2
[2023-03-15 21:15:14] [INFO ] Flow matrix only has 986 transitions (discarded 24 similar events)
// Phase 1: matrix 986 rows 344 cols
[2023-03-15 21:15:14] [INFO ] Computed 44 place invariants in 19 ms
[2023-03-15 21:15:15] [INFO ] [Real]Absence check using 22 positive place invariants in 6 ms returned sat
[2023-03-15 21:15:15] [INFO ] [Real]Absence check using 22 positive and 22 generalized place invariants in 13 ms returned sat
[2023-03-15 21:15:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:15:17] [INFO ] [Real]Absence check using state equation in 2287 ms returned sat
[2023-03-15 21:15:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:15:17] [INFO ] [Nat]Absence check using 22 positive place invariants in 5 ms returned sat
[2023-03-15 21:15:17] [INFO ] [Nat]Absence check using 22 positive and 22 generalized place invariants in 12 ms returned sat
[2023-03-15 21:15:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:15:20] [INFO ] [Nat]Absence check using state equation in 3132 ms returned sat
[2023-03-15 21:15:20] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 21:15:21] [INFO ] [Nat]Added 112 Read/Feed constraints in 990 ms returned sat
[2023-03-15 21:15:21] [INFO ] Deduced a trap composed of 85 places in 184 ms of which 1 ms to minimize.
[2023-03-15 21:15:22] [INFO ] Deduced a trap composed of 18 places in 185 ms of which 0 ms to minimize.
[2023-03-15 21:15:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 675 ms
[2023-03-15 21:15:22] [INFO ] Computed and/alt/rep : 574/2809/569 causal constraints (skipped 411 transitions) in 49 ms.
[2023-03-15 21:15:22] [INFO ] Added : 5 causal constraints over 1 iterations in 135 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 24 out of 344 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 344/344 places, 1010/1010 transitions.
Applied a total of 0 rules in 25 ms. Remains 344 /344 variables (removed 0) and now considering 1010/1010 (removed 0) transitions.
[2023-03-15 21:15:22] [INFO ] Flow matrix only has 986 transitions (discarded 24 similar events)
[2023-03-15 21:15:22] [INFO ] Invariant cache hit.
[2023-03-15 21:15:23] [INFO ] Dead Transitions using invariants and state equation in 766 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 792 ms. Remains : 344/344 places, 1010/1010 transitions.
Normalized transition count is 986 out of 1010 initially.
// Phase 1: matrix 986 rows 344 cols
[2023-03-15 21:15:23] [INFO ] Computed 44 place invariants in 12 ms
Incomplete random walk after 1000000 steps, including 9896 resets, run finished after 5500 ms. (steps per millisecond=181 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 343 resets, run finished after 2487 ms. (steps per millisecond=402 ) properties (out of 1) seen :2
[2023-03-15 21:15:31] [INFO ] Flow matrix only has 986 transitions (discarded 24 similar events)
// Phase 1: matrix 986 rows 344 cols
[2023-03-15 21:15:31] [INFO ] Computed 44 place invariants in 30 ms
[2023-03-15 21:15:31] [INFO ] [Real]Absence check using 22 positive place invariants in 6 ms returned sat
[2023-03-15 21:15:31] [INFO ] [Real]Absence check using 22 positive and 22 generalized place invariants in 13 ms returned sat
[2023-03-15 21:15:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:15:33] [INFO ] [Real]Absence check using state equation in 2293 ms returned sat
[2023-03-15 21:15:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:15:33] [INFO ] [Nat]Absence check using 22 positive place invariants in 6 ms returned sat
[2023-03-15 21:15:33] [INFO ] [Nat]Absence check using 22 positive and 22 generalized place invariants in 21 ms returned sat
[2023-03-15 21:15:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:15:36] [INFO ] [Nat]Absence check using state equation in 3160 ms returned sat
[2023-03-15 21:15:36] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 21:15:37] [INFO ] [Nat]Added 112 Read/Feed constraints in 1000 ms returned sat
[2023-03-15 21:15:38] [INFO ] Deduced a trap composed of 85 places in 191 ms of which 1 ms to minimize.
[2023-03-15 21:15:38] [INFO ] Deduced a trap composed of 18 places in 182 ms of which 0 ms to minimize.
[2023-03-15 21:15:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 666 ms
[2023-03-15 21:15:38] [INFO ] Computed and/alt/rep : 574/2809/569 causal constraints (skipped 411 transitions) in 48 ms.
[2023-03-15 21:15:40] [INFO ] Added : 94 causal constraints over 19 iterations in 2035 ms. Result :sat
Minimization took 1268 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 24 out of 344 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 344/344 places, 1010/1010 transitions.
Applied a total of 0 rules in 15 ms. Remains 344 /344 variables (removed 0) and now considering 1010/1010 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 344/344 places, 1010/1010 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 344/344 places, 1010/1010 transitions.
Applied a total of 0 rules in 15 ms. Remains 344 /344 variables (removed 0) and now considering 1010/1010 (removed 0) transitions.
[2023-03-15 21:15:42] [INFO ] Flow matrix only has 986 transitions (discarded 24 similar events)
[2023-03-15 21:15:42] [INFO ] Invariant cache hit.
[2023-03-15 21:15:43] [INFO ] Implicit Places using invariants in 399 ms returned []
[2023-03-15 21:15:43] [INFO ] Flow matrix only has 986 transitions (discarded 24 similar events)
[2023-03-15 21:15:43] [INFO ] Invariant cache hit.
[2023-03-15 21:15:43] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 21:15:53] [INFO ] Implicit Places using invariants and state equation in 10707 ms returned []
Implicit Place search using SMT with State Equation took 11108 ms to find 0 implicit places.
[2023-03-15 21:15:53] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-15 21:15:53] [INFO ] Flow matrix only has 986 transitions (discarded 24 similar events)
[2023-03-15 21:15:53] [INFO ] Invariant cache hit.
[2023-03-15 21:15:54] [INFO ] Dead Transitions using invariants and state equation in 519 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11681 ms. Remains : 344/344 places, 1010/1010 transitions.
Ending property specific reduction for PolyORBLF-PT-S06J06T04-UpperBounds-02 in 39417 ms.
[2023-03-15 21:15:54] [INFO ] Flatten gal took : 198 ms
[2023-03-15 21:15:54] [INFO ] Applying decomposition
[2023-03-15 21:15:54] [INFO ] Flatten gal took : 76 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph17221870058763944947.txt' '-o' '/tmp/graph17221870058763944947.bin' '-w' '/tmp/graph17221870058763944947.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph17221870058763944947.bin' '-l' '-1' '-v' '-w' '/tmp/graph17221870058763944947.weights' '-q' '0' '-e' '0.001'
[2023-03-15 21:15:55] [INFO ] Decomposing Gal with order
[2023-03-15 21:15:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 21:15:55] [INFO ] Removed a total of 764 redundant transitions.
[2023-03-15 21:15:55] [INFO ] Flatten gal took : 280 ms
[2023-03-15 21:15:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 180 labels/synchronizations in 24 ms.
[2023-03-15 21:15:55] [INFO ] Time to serialize gal into /tmp/UpperBounds4644914072717776422.gal : 49 ms
[2023-03-15 21:15:55] [INFO ] Time to serialize properties into /tmp/UpperBounds13979512373335571686.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds4644914072717776422.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds13979512373335571686.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...305
Loading property file /tmp/UpperBounds13979512373335571686.prop.
Detected timeout of ITS tools.
[2023-03-15 21:37:13] [INFO ] Flatten gal took : 484 ms
[2023-03-15 21:37:13] [INFO ] Time to serialize gal into /tmp/UpperBounds9336143597128135105.gal : 108 ms
[2023-03-15 21:37:13] [INFO ] Time to serialize properties into /tmp/UpperBounds6230793152367929617.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds9336143597128135105.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds6230793152367929617.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...304
Loading property file /tmp/UpperBounds6230793152367929617.prop.
Detected timeout of ITS tools.
[2023-03-15 21:58:18] [INFO ] Flatten gal took : 513 ms
[2023-03-15 21:58:19] [INFO ] Input system was already deterministic with 1010 transitions.
[2023-03-15 21:58:20] [INFO ] Transformed 344 places.
[2023-03-15 21:58:20] [INFO ] Transformed 1010 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-15 21:58:50] [INFO ] Time to serialize gal into /tmp/UpperBounds996361219972534485.gal : 12 ms
[2023-03-15 21:58:50] [INFO ] Time to serialize properties into /tmp/UpperBounds17790230985642660990.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds996361219972534485.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds17790230985642660990.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...349
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds17790230985642660990.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 141164 kB
After kill :
MemTotal: 16393216 kB
MemFree: 14314520 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="PolyORBLF-PT-S06J06T04"
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-5348"
echo " Executing tool itstools"
echo " Input is PolyORBLF-PT-S06J06T04, 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 r293-tall-167873945700613"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S06J06T04.tgz
mv PolyORBLF-PT-S06J06T04 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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;