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.r107-tall-167814484200461.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 smartxred
Input is DES-PT-40a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r107-tall-167814484200461
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 6.4K Feb 26 15:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 15:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 15:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 15:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Feb 26 15:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 15:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 15:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 83K Mar 5 18:22 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 DES-PT-40a-UpperBounds-00
FORMULA_NAME DES-PT-40a-UpperBounds-01
FORMULA_NAME DES-PT-40a-UpperBounds-02
FORMULA_NAME DES-PT-40a-UpperBounds-03
FORMULA_NAME DES-PT-40a-UpperBounds-04
FORMULA_NAME DES-PT-40a-UpperBounds-05
FORMULA_NAME DES-PT-40a-UpperBounds-06
FORMULA_NAME DES-PT-40a-UpperBounds-07
FORMULA_NAME DES-PT-40a-UpperBounds-08
FORMULA_NAME DES-PT-40a-UpperBounds-09
FORMULA_NAME DES-PT-40a-UpperBounds-10
FORMULA_NAME DES-PT-40a-UpperBounds-11
FORMULA_NAME DES-PT-40a-UpperBounds-12
FORMULA_NAME DES-PT-40a-UpperBounds-13
FORMULA_NAME DES-PT-40a-UpperBounds-14
FORMULA_NAME DES-PT-40a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678373248951

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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-40a
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-09 14:47:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-09 14:47:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 14:47:30] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2023-03-09 14:47:30] [INFO ] Transformed 274 places.
[2023-03-09 14:47:30] [INFO ] Transformed 231 transitions.
[2023-03-09 14:47:30] [INFO ] Found NUPN structural information;
[2023-03-09 14:47:30] [INFO ] Parsed PT model containing 274 places and 231 transitions and 1116 arcs in 144 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
// Phase 1: matrix 217 rows 274 cols
[2023-03-09 14:47:30] [INFO ] Computed 59 place invariants in 31 ms
Incomplete random walk after 10000 steps, including 226 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 16) seen :7
FORMULA DES-PT-40a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 45 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 45 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 51 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 9) seen :0
[2023-03-09 14:47:30] [INFO ] Invariant cache hit.
[2023-03-09 14:47:31] [INFO ] [Real]Absence check using 34 positive place invariants in 15 ms returned sat
[2023-03-09 14:47:31] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 27 ms returned sat
[2023-03-09 14:47:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 14:47:31] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2023-03-09 14:47:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 14:47:31] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-09 14:47:31] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 94 ms returned sat
[2023-03-09 14:47:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 14:47:31] [INFO ] [Nat]Absence check using state equation in 297 ms returned sat
[2023-03-09 14:47:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 14:47:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 116 ms returned sat
[2023-03-09 14:47:31] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 16 ms.
[2023-03-09 14:47:32] [INFO ] Added : 84 causal constraints over 17 iterations in 531 ms. Result :sat
Minimization took 341 ms.
[2023-03-09 14:47:32] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-09 14:47:32] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-09 14:47:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 14:47:33] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2023-03-09 14:47:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 14:47:33] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-09 14:47:33] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 75 ms returned sat
[2023-03-09 14:47:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 14:47:33] [INFO ] [Nat]Absence check using state equation in 651 ms returned sat
[2023-03-09 14:47:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 18 ms returned sat
[2023-03-09 14:47:33] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 5 ms to minimize.
[2023-03-09 14:47:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2023-03-09 14:47:33] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 28 ms.
[2023-03-09 14:47:34] [INFO ] Added : 97 causal constraints over 20 iterations in 777 ms. Result :sat
Minimization took 84 ms.
[2023-03-09 14:47:34] [INFO ] [Real]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-09 14:47:34] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-09 14:47:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 14:47:34] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2023-03-09 14:47:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 14:47:35] [INFO ] [Nat]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-09 14:47:35] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 38 ms returned sat
[2023-03-09 14:47:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 14:47:35] [INFO ] [Nat]Absence check using state equation in 225 ms returned sat
[2023-03-09 14:47:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 340 ms returned sat
[2023-03-09 14:47:35] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 0 ms to minimize.
[2023-03-09 14:47:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 410 ms
[2023-03-09 14:47:36] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 15 ms.
[2023-03-09 14:47:36] [INFO ] Added : 69 causal constraints over 14 iterations in 620 ms. Result :sat
Minimization took 126 ms.
[2023-03-09 14:47:36] [INFO ] [Real]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-09 14:47:36] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-09 14:47:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 14:47:37] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2023-03-09 14:47:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 14:47:37] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-09 14:47:37] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-09 14:47:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 14:47:37] [INFO ] [Nat]Absence check using state equation in 180 ms returned sat
[2023-03-09 14:47:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 96 ms returned sat
[2023-03-09 14:47:37] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2023-03-09 14:47:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2023-03-09 14:47:37] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 15 ms.
[2023-03-09 14:47:38] [INFO ] Added : 171 causal constraints over 35 iterations in 811 ms. Result :sat
Minimization took 106 ms.
[2023-03-09 14:47:38] [INFO ] [Real]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-09 14:47:38] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-09 14:47:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 14:47:38] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2023-03-09 14:47:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 14:47:38] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-09 14:47:38] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 155 ms returned sat
[2023-03-09 14:47:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 14:47:39] [INFO ] [Nat]Absence check using state equation in 342 ms returned sat
[2023-03-09 14:47:39] [INFO ] [Nat]Added 1 Read/Feed constraints in 105 ms returned sat
[2023-03-09 14:47:39] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2023-03-09 14:47:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2023-03-09 14:47:39] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 16 ms.
[2023-03-09 14:47:39] [INFO ] Added : 108 causal constraints over 22 iterations in 558 ms. Result :sat
Minimization took 105 ms.
[2023-03-09 14:47:40] [INFO ] [Real]Absence check using 34 positive place invariants in 9 ms returned sat
[2023-03-09 14:47:40] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 19 ms returned sat
[2023-03-09 14:47:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 14:47:40] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2023-03-09 14:47:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 14:47:40] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-09 14:47:40] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 150 ms returned sat
[2023-03-09 14:47:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 14:47:41] [INFO ] [Nat]Absence check using state equation in 1306 ms returned sat
[2023-03-09 14:47:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-09 14:47:41] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 16 ms.
[2023-03-09 14:47:42] [INFO ] Added : 148 causal constraints over 30 iterations in 685 ms. Result :sat
Minimization took 120 ms.
[2023-03-09 14:47:42] [INFO ] [Real]Absence check using 34 positive place invariants in 6 ms returned sat
[2023-03-09 14:47:42] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-09 14:47:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 14:47:42] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2023-03-09 14:47:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 14:47:42] [INFO ] [Nat]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-09 14:47:42] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 81 ms returned sat
[2023-03-09 14:47:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 14:47:43] [INFO ] [Nat]Absence check using state equation in 313 ms returned sat
[2023-03-09 14:47:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 141 ms returned sat
[2023-03-09 14:47:43] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2023-03-09 14:47:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2023-03-09 14:47:43] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 13 ms.
[2023-03-09 14:47:43] [INFO ] Added : 68 causal constraints over 14 iterations in 393 ms. Result :sat
Minimization took 82 ms.
[2023-03-09 14:47:43] [INFO ] [Real]Absence check using 34 positive place invariants in 9 ms returned sat
[2023-03-09 14:47:43] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-09 14:47:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 14:47:44] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2023-03-09 14:47:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 14:47:44] [INFO ] [Nat]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-09 14:47:44] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 90 ms returned sat
[2023-03-09 14:47:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 14:47:45] [INFO ] [Nat]Absence check using state equation in 1295 ms returned sat
[2023-03-09 14:47:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 390 ms returned sat
[2023-03-09 14:47:45] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 13 ms.
[2023-03-09 14:47:46] [INFO ] Added : 149 causal constraints over 30 iterations in 762 ms. Result :sat
Minimization took 202 ms.
[2023-03-09 14:47:46] [INFO ] [Real]Absence check using 34 positive place invariants in 6 ms returned sat
[2023-03-09 14:47:46] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-09 14:47:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 14:47:47] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2023-03-09 14:47:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 14:47:47] [INFO ] [Nat]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-09 14:47:47] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 77 ms returned sat
[2023-03-09 14:47:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 14:47:48] [INFO ] [Nat]Absence check using state equation in 914 ms returned sat
[2023-03-09 14:47:48] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-09 14:47:48] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 10 ms.
[2023-03-09 14:47:49] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2023-03-09 14:47:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2023-03-09 14:47:49] [INFO ] Added : 153 causal constraints over 31 iterations in 906 ms. Result :sat
Minimization took 119 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA DES-PT-40a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-40a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-40a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-40a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 5 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 217/217 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 274 transition count 215
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 273 transition count 214
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 273 transition count 214
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 10 place count 273 transition count 214
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 272 transition count 213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 271 transition count 213
Applied a total of 12 rules in 96 ms. Remains 271 /274 variables (removed 3) and now considering 213/217 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 271/274 places, 213/217 transitions.
// Phase 1: matrix 213 rows 271 cols
[2023-03-09 14:47:51] [INFO ] Computed 60 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 13624 resets, run finished after 1878 ms. (steps per millisecond=532 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2276 resets, run finished after 867 ms. (steps per millisecond=1153 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2259 resets, run finished after 851 ms. (steps per millisecond=1175 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2295 resets, run finished after 843 ms. (steps per millisecond=1186 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2301 resets, run finished after 846 ms. (steps per millisecond=1182 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2278 resets, run finished after 848 ms. (steps per millisecond=1179 ) properties (out of 5) seen :0
[2023-03-09 14:47:57] [INFO ] Invariant cache hit.
[2023-03-09 14:47:57] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 14:47:57] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 11 ms returned sat
[2023-03-09 14:47:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 14:47:57] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2023-03-09 14:47:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 14:47:57] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 14:47:57] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-09 14:47:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 14:47:57] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2023-03-09 14:47:57] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 14:47:57] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2023-03-09 14:47:57] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 14 ms.
[2023-03-09 14:47:58] [INFO ] Deduced a trap composed of 40 places in 30 ms of which 0 ms to minimize.
[2023-03-09 14:47:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2023-03-09 14:47:58] [INFO ] Added : 196 causal constraints over 41 iterations in 669 ms. Result :sat
Minimization took 75 ms.
[2023-03-09 14:47:58] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 14:47:58] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 11 ms returned sat
[2023-03-09 14:47:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 14:47:58] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2023-03-09 14:47:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 14:47:58] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 14:47:58] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 56 ms returned sat
[2023-03-09 14:47:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 14:47:58] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2023-03-09 14:47:58] [INFO ] [Nat]Added 2 Read/Feed constraints in 4 ms returned sat
[2023-03-09 14:47:58] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 4 ms to minimize.
[2023-03-09 14:47:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2023-03-09 14:47:58] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 10 ms.
[2023-03-09 14:47:59] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 0 ms to minimize.
[2023-03-09 14:47:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2023-03-09 14:47:59] [INFO ] Added : 85 causal constraints over 17 iterations in 363 ms. Result :sat
Minimization took 88 ms.
[2023-03-09 14:47:59] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 14:47:59] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 12 ms returned sat
[2023-03-09 14:47:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 14:47:59] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2023-03-09 14:47:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 14:47:59] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 14:47:59] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 43 ms returned sat
[2023-03-09 14:47:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 14:47:59] [INFO ] [Nat]Absence check using state equation in 196 ms returned sat
[2023-03-09 14:47:59] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2023-03-09 14:47:59] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 12 ms.
[2023-03-09 14:48:00] [INFO ] Added : 155 causal constraints over 31 iterations in 535 ms. Result :sat
Minimization took 85 ms.
[2023-03-09 14:48:00] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 14:48:00] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-09 14:48:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 14:48:00] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2023-03-09 14:48:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 14:48:00] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 14:48:00] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 58 ms returned sat
[2023-03-09 14:48:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 14:48:00] [INFO ] [Nat]Absence check using state equation in 224 ms returned sat
[2023-03-09 14:48:00] [INFO ] [Nat]Added 2 Read/Feed constraints in 6 ms returned sat
[2023-03-09 14:48:00] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 0 ms to minimize.
[2023-03-09 14:48:00] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2023-03-09 14:48:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 132 ms
[2023-03-09 14:48:00] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 11 ms.
[2023-03-09 14:48:01] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 0 ms to minimize.
[2023-03-09 14:48:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2023-03-09 14:48:01] [INFO ] Added : 179 causal constraints over 37 iterations in 683 ms. Result :sat
Minimization took 69 ms.
[2023-03-09 14:48:01] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 14:48:01] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-09 14:48:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 14:48:01] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2023-03-09 14:48:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 14:48:01] [INFO ] [Nat]Absence check using 35 positive place invariants in 11 ms returned sat
[2023-03-09 14:48:02] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 98 ms returned sat
[2023-03-09 14:48:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 14:48:02] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
[2023-03-09 14:48:02] [INFO ] [Nat]Added 2 Read/Feed constraints in 26 ms returned sat
[2023-03-09 14:48:02] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 12 ms.
[2023-03-09 14:48:02] [INFO ] Deduced a trap composed of 40 places in 31 ms of which 0 ms to minimize.
[2023-03-09 14:48:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2023-03-09 14:48:02] [INFO ] Added : 183 causal constraints over 37 iterations in 689 ms. Result :sat
Minimization took 76 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 24 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 271/271 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 12 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2023-03-09 14:48:04] [INFO ] Invariant cache hit.
[2023-03-09 14:48:04] [INFO ] Implicit Places using invariants in 177 ms returned []
[2023-03-09 14:48:04] [INFO ] Invariant cache hit.
[2023-03-09 14:48:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 14:48:05] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 567 ms to find 0 implicit places.
[2023-03-09 14:48:05] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-09 14:48:05] [INFO ] Invariant cache hit.
[2023-03-09 14:48:05] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 716 ms. Remains : 271/271 places, 213/213 transitions.
Starting property specific reduction for DES-PT-40a-UpperBounds-08
[2023-03-09 14:48:05] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 139 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-09 14:48:05] [INFO ] Invariant cache hit.
[2023-03-09 14:48:05] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 14:48:05] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-09 14:48:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 14:48:05] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2023-03-09 14:48:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 14:48:05] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 14:48:05] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 19 ms returned sat
[2023-03-09 14:48:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 14:48:05] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2023-03-09 14:48:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 14:48:05] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2023-03-09 14:48:05] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 11 ms.
[2023-03-09 14:48:06] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 1 ms to minimize.
[2023-03-09 14:48:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2023-03-09 14:48:06] [INFO ] Added : 196 causal constraints over 41 iterations in 707 ms. Result :sat
Minimization took 73 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 8 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 271/271 places, 213/213 transitions.
[2023-03-09 14:48:06] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 13635 resets, run finished after 1771 ms. (steps per millisecond=564 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2321 resets, run finished after 849 ms. (steps per millisecond=1177 ) properties (out of 1) seen :0
[2023-03-09 14:48:09] [INFO ] Invariant cache hit.
[2023-03-09 14:48:09] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 14:48:09] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-09 14:48:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 14:48:09] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2023-03-09 14:48:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 14:48:09] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 14:48:09] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-09 14:48:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 14:48:09] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2023-03-09 14:48:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 14:48:09] [INFO ] [Nat]Added 2 Read/Feed constraints in 0 ms returned sat
[2023-03-09 14:48:09] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 12 ms.
[2023-03-09 14:48:10] [INFO ] Deduced a trap composed of 40 places in 32 ms of which 1 ms to minimize.
[2023-03-09 14:48:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2023-03-09 14:48:10] [INFO ] Added : 196 causal constraints over 41 iterations in 711 ms. Result :sat
Minimization took 72 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 8 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 271/271 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 8 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2023-03-09 14:48:11] [INFO ] Invariant cache hit.
[2023-03-09 14:48:11] [INFO ] Implicit Places using invariants in 152 ms returned []
[2023-03-09 14:48:11] [INFO ] Invariant cache hit.
[2023-03-09 14:48:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 14:48:11] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 546 ms to find 0 implicit places.
[2023-03-09 14:48:11] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-09 14:48:11] [INFO ] Invariant cache hit.
[2023-03-09 14:48:11] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 669 ms. Remains : 271/271 places, 213/213 transitions.
Ending property specific reduction for DES-PT-40a-UpperBounds-08 in 6226 ms.
Starting property specific reduction for DES-PT-40a-UpperBounds-09
[2023-03-09 14:48:11] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 139 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-09 14:48:11] [INFO ] Invariant cache hit.
[2023-03-09 14:48:11] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 14:48:11] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-09 14:48:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 14:48:11] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2023-03-09 14:48:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 14:48:11] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 14:48:11] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 56 ms returned sat
[2023-03-09 14:48:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 14:48:12] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2023-03-09 14:48:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 14:48:12] [INFO ] [Nat]Added 2 Read/Feed constraints in 4 ms returned sat
[2023-03-09 14:48:12] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2023-03-09 14:48:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2023-03-09 14:48:12] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 10 ms.
[2023-03-09 14:48:12] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 0 ms to minimize.
[2023-03-09 14:48:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2023-03-09 14:48:12] [INFO ] Added : 85 causal constraints over 17 iterations in 360 ms. Result :sat
Minimization took 82 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 13 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 271/271 places, 213/213 transitions.
[2023-03-09 14:48:12] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 13696 resets, run finished after 1817 ms. (steps per millisecond=550 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2276 resets, run finished after 848 ms. (steps per millisecond=1179 ) properties (out of 1) seen :0
[2023-03-09 14:48:15] [INFO ] Invariant cache hit.
[2023-03-09 14:48:15] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 14:48:15] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-09 14:48:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 14:48:15] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2023-03-09 14:48:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 14:48:15] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 14:48:15] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 62 ms returned sat
[2023-03-09 14:48:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 14:48:15] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2023-03-09 14:48:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 14:48:15] [INFO ] [Nat]Added 2 Read/Feed constraints in 6 ms returned sat
[2023-03-09 14:48:16] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
[2023-03-09 14:48:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2023-03-09 14:48:16] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 11 ms.
[2023-03-09 14:48:16] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2023-03-09 14:48:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2023-03-09 14:48:16] [INFO ] Added : 85 causal constraints over 17 iterations in 359 ms. Result :sat
Minimization took 84 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 16 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 271/271 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 7 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2023-03-09 14:48:16] [INFO ] Invariant cache hit.
[2023-03-09 14:48:17] [INFO ] Implicit Places using invariants in 133 ms returned []
[2023-03-09 14:48:17] [INFO ] Invariant cache hit.
[2023-03-09 14:48:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 14:48:17] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 527 ms to find 0 implicit places.
[2023-03-09 14:48:17] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-09 14:48:17] [INFO ] Invariant cache hit.
[2023-03-09 14:48:17] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 655 ms. Remains : 271/271 places, 213/213 transitions.
Ending property specific reduction for DES-PT-40a-UpperBounds-09 in 5865 ms.
Starting property specific reduction for DES-PT-40a-UpperBounds-10
[2023-03-09 14:48:17] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 133 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
[2023-03-09 14:48:17] [INFO ] Invariant cache hit.
[2023-03-09 14:48:17] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 14:48:17] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-09 14:48:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 14:48:17] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2023-03-09 14:48:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 14:48:17] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 14:48:17] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 50 ms returned sat
[2023-03-09 14:48:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 14:48:18] [INFO ] [Nat]Absence check using state equation in 201 ms returned sat
[2023-03-09 14:48:18] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 14:48:18] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2023-03-09 14:48:18] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 12 ms.
[2023-03-09 14:48:18] [INFO ] Added : 155 causal constraints over 31 iterations in 527 ms. Result :sat
Minimization took 89 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 6 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 271/271 places, 213/213 transitions.
[2023-03-09 14:48:18] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 13713 resets, run finished after 1802 ms. (steps per millisecond=554 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2280 resets, run finished after 835 ms. (steps per millisecond=1197 ) properties (out of 1) seen :0
[2023-03-09 14:48:21] [INFO ] Invariant cache hit.
[2023-03-09 14:48:21] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 14:48:21] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-09 14:48:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 14:48:21] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2023-03-09 14:48:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 14:48:21] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 14:48:21] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 43 ms returned sat
[2023-03-09 14:48:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 14:48:21] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
[2023-03-09 14:48:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 14:48:21] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2023-03-09 14:48:22] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 12 ms.
[2023-03-09 14:48:22] [INFO ] Added : 155 causal constraints over 31 iterations in 511 ms. Result :sat
Minimization took 90 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 6 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 271/271 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 6 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2023-03-09 14:48:22] [INFO ] Invariant cache hit.
[2023-03-09 14:48:23] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-03-09 14:48:23] [INFO ] Invariant cache hit.
[2023-03-09 14:48:23] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 14:48:23] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 517 ms to find 0 implicit places.
[2023-03-09 14:48:23] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-09 14:48:23] [INFO ] Invariant cache hit.
[2023-03-09 14:48:23] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 655 ms. Remains : 271/271 places, 213/213 transitions.
Ending property specific reduction for DES-PT-40a-UpperBounds-10 in 5982 ms.
Starting property specific reduction for DES-PT-40a-UpperBounds-12
[2023-03-09 14:48:23] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 136 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-09 14:48:23] [INFO ] Invariant cache hit.
[2023-03-09 14:48:23] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 14:48:23] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-09 14:48:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 14:48:23] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2023-03-09 14:48:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 14:48:23] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 14:48:23] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 57 ms returned sat
[2023-03-09 14:48:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 14:48:24] [INFO ] [Nat]Absence check using state equation in 237 ms returned sat
[2023-03-09 14:48:24] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 14:48:24] [INFO ] [Nat]Added 2 Read/Feed constraints in 6 ms returned sat
[2023-03-09 14:48:24] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 0 ms to minimize.
[2023-03-09 14:48:24] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 0 ms to minimize.
[2023-03-09 14:48:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 130 ms
[2023-03-09 14:48:24] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 10 ms.
[2023-03-09 14:48:24] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2023-03-09 14:48:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2023-03-09 14:48:24] [INFO ] Added : 179 causal constraints over 37 iterations in 651 ms. Result :sat
Minimization took 69 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 7 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 271/271 places, 213/213 transitions.
[2023-03-09 14:48:25] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 13669 resets, run finished after 1803 ms. (steps per millisecond=554 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2225 resets, run finished after 860 ms. (steps per millisecond=1162 ) properties (out of 1) seen :0
[2023-03-09 14:48:27] [INFO ] Invariant cache hit.
[2023-03-09 14:48:27] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 14:48:27] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 18 ms returned sat
[2023-03-09 14:48:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 14:48:28] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2023-03-09 14:48:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 14:48:28] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2023-03-09 14:48:28] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 57 ms returned sat
[2023-03-09 14:48:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 14:48:28] [INFO ] [Nat]Absence check using state equation in 222 ms returned sat
[2023-03-09 14:48:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 14:48:28] [INFO ] [Nat]Added 2 Read/Feed constraints in 6 ms returned sat
[2023-03-09 14:48:28] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2023-03-09 14:48:28] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 0 ms to minimize.
[2023-03-09 14:48:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 139 ms
[2023-03-09 14:48:28] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 9 ms.
[2023-03-09 14:48:29] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 0 ms to minimize.
[2023-03-09 14:48:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2023-03-09 14:48:29] [INFO ] Added : 179 causal constraints over 37 iterations in 658 ms. Result :sat
Minimization took 69 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 7 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 271/271 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 9 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2023-03-09 14:48:29] [INFO ] Invariant cache hit.
[2023-03-09 14:48:29] [INFO ] Implicit Places using invariants in 140 ms returned []
[2023-03-09 14:48:29] [INFO ] Invariant cache hit.
[2023-03-09 14:48:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 14:48:30] [INFO ] Implicit Places using invariants and state equation in 370 ms returned []
Implicit Place search using SMT with State Equation took 510 ms to find 0 implicit places.
[2023-03-09 14:48:30] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 14:48:30] [INFO ] Invariant cache hit.
[2023-03-09 14:48:30] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 642 ms. Remains : 271/271 places, 213/213 transitions.
Ending property specific reduction for DES-PT-40a-UpperBounds-12 in 6687 ms.
Starting property specific reduction for DES-PT-40a-UpperBounds-15
[2023-03-09 14:48:30] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 135 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-09 14:48:30] [INFO ] Invariant cache hit.
[2023-03-09 14:48:30] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 14:48:30] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-09 14:48:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 14:48:30] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2023-03-09 14:48:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 14:48:30] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 14:48:30] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 95 ms returned sat
[2023-03-09 14:48:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 14:48:30] [INFO ] [Nat]Absence check using state equation in 203 ms returned sat
[2023-03-09 14:48:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 14:48:30] [INFO ] [Nat]Added 2 Read/Feed constraints in 21 ms returned sat
[2023-03-09 14:48:30] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 10 ms.
[2023-03-09 14:48:31] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 0 ms to minimize.
[2023-03-09 14:48:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2023-03-09 14:48:31] [INFO ] Added : 183 causal constraints over 37 iterations in 699 ms. Result :sat
Minimization took 75 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 6 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 271/271 places, 213/213 transitions.
[2023-03-09 14:48:31] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 13618 resets, run finished after 1805 ms. (steps per millisecond=554 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2272 resets, run finished after 848 ms. (steps per millisecond=1179 ) properties (out of 1) seen :0
[2023-03-09 14:48:34] [INFO ] Invariant cache hit.
[2023-03-09 14:48:34] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 14:48:34] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 11 ms returned sat
[2023-03-09 14:48:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 14:48:34] [INFO ] [Real]Absence check using state equation in 40 ms returned unsat
Current structural bounds on expressions (after SMT) : [1] Max seen :[1]
FORMULA DES-PT-40a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for DES-PT-40a-UpperBounds-15 in 4462 ms.
[2023-03-09 14:48:34] [INFO ] Flatten gal took : 62 ms
[2023-03-09 14:48:34] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2023-03-09 14:48:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 271 places, 213 transitions and 1029 arcs took 3 ms.
Total runtime 64534 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running DES (PT), instance 40a
Examination UpperBounds
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/UpperBoundParse.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//upper_bound//smart

PNML FILE: model.pnml
Petri model created: 271 places, 213 transitions, 1029 arcs.
Final Score: 3695.573
Took : 12 seconds
Bounds file is: UpperBounds.xml
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 1016724 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16105616 kB

BK_TIME_CONFINEMENT_REACHED

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
Caught signal 15, terminating.

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="DES-PT-40a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is DES-PT-40a, 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 r107-tall-167814484200461"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-40a.tgz
mv DES-PT-40a 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 ;