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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 6.2K Feb 26 15:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 26 15:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 15:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 15:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K 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 9.2K Feb 26 15:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 26 15:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 15:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 15:44 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 70K 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-30a-UpperBounds-00
FORMULA_NAME DES-PT-30a-UpperBounds-01
FORMULA_NAME DES-PT-30a-UpperBounds-02
FORMULA_NAME DES-PT-30a-UpperBounds-03
FORMULA_NAME DES-PT-30a-UpperBounds-04
FORMULA_NAME DES-PT-30a-UpperBounds-05
FORMULA_NAME DES-PT-30a-UpperBounds-06
FORMULA_NAME DES-PT-30a-UpperBounds-07
FORMULA_NAME DES-PT-30a-UpperBounds-08
FORMULA_NAME DES-PT-30a-UpperBounds-09
FORMULA_NAME DES-PT-30a-UpperBounds-10
FORMULA_NAME DES-PT-30a-UpperBounds-11
FORMULA_NAME DES-PT-30a-UpperBounds-12
FORMULA_NAME DES-PT-30a-UpperBounds-13
FORMULA_NAME DES-PT-30a-UpperBounds-14
FORMULA_NAME DES-PT-30a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678300051060

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=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-30a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 18:27:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-08 18:27:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 18:27:32] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2023-03-08 18:27:32] [INFO ] Transformed 234 places.
[2023-03-08 18:27:32] [INFO ] Transformed 191 transitions.
[2023-03-08 18:27:32] [INFO ] Found NUPN structural information;
[2023-03-08 18:27:32] [INFO ] Parsed PT model containing 234 places and 191 transitions and 926 arcs in 123 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 177 rows 234 cols
[2023-03-08 18:27:32] [INFO ] Computed 59 place invariants in 28 ms
Incomplete random walk after 10000 steps, including 216 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 16) seen :11
FORMULA DES-PT-30a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) 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 5) 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 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 46 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
[2023-03-08 18:27:32] [INFO ] Invariant cache hit.
[2023-03-08 18:27:33] [INFO ] [Real]Absence check using 34 positive place invariants in 15 ms returned sat
[2023-03-08 18:27:33] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 11 ms returned sat
[2023-03-08 18:27:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 18:27:33] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2023-03-08 18:27:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 18:27:33] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2023-03-08 18:27:33] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 87 ms returned sat
[2023-03-08 18:27:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 18:27:33] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2023-03-08 18:27:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 18:27:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 41 ms returned sat
[2023-03-08 18:27:33] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 3 ms to minimize.
[2023-03-08 18:27:33] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 1 ms to minimize.
[2023-03-08 18:27:34] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2023-03-08 18:27:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 348 ms
[2023-03-08 18:27:34] [INFO ] Computed and/alt/rep : 169/510/169 causal constraints (skipped 7 transitions) in 31 ms.
[2023-03-08 18:27:35] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 1 ms to minimize.
[2023-03-08 18:27:35] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 1 ms to minimize.
[2023-03-08 18:27:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 252 ms
[2023-03-08 18:27:35] [INFO ] Added : 158 causal constraints over 32 iterations in 1108 ms. Result :sat
Minimization took 88 ms.
[2023-03-08 18:27:35] [INFO ] [Real]Absence check using 34 positive place invariants in 25 ms returned sat
[2023-03-08 18:27:35] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 11 ms returned sat
[2023-03-08 18:27:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 18:27:35] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2023-03-08 18:27:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 18:27:35] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-08 18:27:35] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 76 ms returned sat
[2023-03-08 18:27:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 18:27:35] [INFO ] [Nat]Absence check using state equation in 216 ms returned sat
[2023-03-08 18:27:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-08 18:27:35] [INFO ] Computed and/alt/rep : 169/510/169 causal constraints (skipped 7 transitions) in 13 ms.
[2023-03-08 18:27:36] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2023-03-08 18:27:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2023-03-08 18:27:36] [INFO ] Added : 67 causal constraints over 14 iterations in 369 ms. Result :sat
Minimization took 128 ms.
[2023-03-08 18:27:36] [INFO ] [Real]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-08 18:27:36] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-08 18:27:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 18:27:36] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2023-03-08 18:27:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 18:27:36] [INFO ] [Nat]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-08 18:27:36] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 50 ms returned sat
[2023-03-08 18:27:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 18:27:36] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2023-03-08 18:27:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 48 ms returned sat
[2023-03-08 18:27:36] [INFO ] Computed and/alt/rep : 169/510/169 causal constraints (skipped 7 transitions) in 13 ms.
[2023-03-08 18:27:37] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 0 ms to minimize.
[2023-03-08 18:27:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2023-03-08 18:27:37] [INFO ] Added : 98 causal constraints over 21 iterations in 496 ms. Result :sat
Minimization took 128 ms.
[2023-03-08 18:27:37] [INFO ] [Real]Absence check using 34 positive place invariants in 6 ms returned sat
[2023-03-08 18:27:37] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 8 ms returned sat
[2023-03-08 18:27:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 18:27:37] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2023-03-08 18:27:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 18:27:37] [INFO ] [Nat]Absence check using 34 positive place invariants in 10 ms returned sat
[2023-03-08 18:27:37] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 78 ms returned sat
[2023-03-08 18:27:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 18:27:37] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2023-03-08 18:27:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-08 18:27:37] [INFO ] Computed and/alt/rep : 169/510/169 causal constraints (skipped 7 transitions) in 15 ms.
[2023-03-08 18:27:38] [INFO ] Added : 84 causal constraints over 18 iterations in 459 ms. Result :sat
Minimization took 69 ms.
[2023-03-08 18:27:38] [INFO ] [Real]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-08 18:27:38] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-08 18:27:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 18:27:38] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2023-03-08 18:27:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 18:27:38] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-08 18:27:38] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 37 ms returned sat
[2023-03-08 18:27:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 18:27:39] [INFO ] [Nat]Absence check using state equation in 320 ms returned sat
[2023-03-08 18:27:39] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-08 18:27:39] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2023-03-08 18:27:39] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 0 ms to minimize.
[2023-03-08 18:27:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 136 ms
[2023-03-08 18:27:39] [INFO ] Computed and/alt/rep : 169/510/169 causal constraints (skipped 7 transitions) in 19 ms.
[2023-03-08 18:27:39] [INFO ] Added : 117 causal constraints over 24 iterations in 472 ms. Result :sat
Minimization took 108 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 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 177/177 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 234 transition count 175
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 233 transition count 174
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 233 transition count 174
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 233 transition count 174
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 232 transition count 173
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 231 transition count 173
Applied a total of 12 rules in 71 ms. Remains 231 /234 variables (removed 3) and now considering 173/177 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 231/234 places, 173/177 transitions.
// Phase 1: matrix 173 rows 231 cols
[2023-03-08 18:27:40] [INFO ] Computed 60 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 13620 resets, run finished after 1949 ms. (steps per millisecond=513 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2288 resets, run finished after 919 ms. (steps per millisecond=1088 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2245 resets, run finished after 894 ms. (steps per millisecond=1118 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2266 resets, run finished after 901 ms. (steps per millisecond=1109 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2260 resets, run finished after 906 ms. (steps per millisecond=1103 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2264 resets, run finished after 927 ms. (steps per millisecond=1078 ) properties (out of 5) seen :0
[2023-03-08 18:27:47] [INFO ] Invariant cache hit.
[2023-03-08 18:27:47] [INFO ] [Real]Absence check using 35 positive place invariants in 7 ms returned sat
[2023-03-08 18:27:47] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-08 18:27:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 18:27:47] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2023-03-08 18:27:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 18:27:47] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 18:27:47] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 62 ms returned sat
[2023-03-08 18:27:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 18:27:47] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2023-03-08 18:27:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 18:27:47] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2023-03-08 18:27:47] [INFO ] Computed and/alt/rep : 164/290/164 causal constraints (skipped 6 transitions) in 13 ms.
[2023-03-08 18:27:48] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 0 ms to minimize.
[2023-03-08 18:27:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2023-03-08 18:27:48] [INFO ] Added : 149 causal constraints over 31 iterations in 544 ms. Result :sat
Minimization took 71 ms.
[2023-03-08 18:27:48] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 18:27:48] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-08 18:27:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 18:27:48] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2023-03-08 18:27:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 18:27:48] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 18:27:48] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 111 ms returned sat
[2023-03-08 18:27:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 18:27:48] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2023-03-08 18:27:48] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2023-03-08 18:27:48] [INFO ] Computed and/alt/rep : 164/290/164 causal constraints (skipped 6 transitions) in 14 ms.
[2023-03-08 18:27:48] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 0 ms to minimize.
[2023-03-08 18:27:48] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 0 ms to minimize.
[2023-03-08 18:27:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 150 ms
[2023-03-08 18:27:49] [INFO ] Added : 60 causal constraints over 13 iterations in 358 ms. Result :sat
Minimization took 80 ms.
[2023-03-08 18:27:49] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 18:27:49] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-08 18:27:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 18:27:49] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2023-03-08 18:27:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 18:27:49] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 18:27:49] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 56 ms returned sat
[2023-03-08 18:27:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 18:27:49] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2023-03-08 18:27:49] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2023-03-08 18:27:49] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 0 ms to minimize.
[2023-03-08 18:27:49] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 0 ms to minimize.
[2023-03-08 18:27:49] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 0 ms to minimize.
[2023-03-08 18:27:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 211 ms
[2023-03-08 18:27:49] [INFO ] Computed and/alt/rep : 164/290/164 causal constraints (skipped 6 transitions) in 9 ms.
[2023-03-08 18:27:49] [INFO ] Added : 108 causal constraints over 22 iterations in 309 ms. Result :sat
Minimization took 46 ms.
[2023-03-08 18:27:50] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 18:27:50] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-08 18:27:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 18:27:50] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2023-03-08 18:27:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 18:27:50] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 18:27:50] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 48 ms returned sat
[2023-03-08 18:27:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 18:27:50] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2023-03-08 18:27:50] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2023-03-08 18:27:50] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 0 ms to minimize.
[2023-03-08 18:27:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2023-03-08 18:27:50] [INFO ] Computed and/alt/rep : 164/290/164 causal constraints (skipped 6 transitions) in 9 ms.
[2023-03-08 18:27:50] [INFO ] Added : 74 causal constraints over 15 iterations in 253 ms. Result :sat
Minimization took 48 ms.
[2023-03-08 18:27:50] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 18:27:50] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-08 18:27:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 18:27:50] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2023-03-08 18:27:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 18:27:50] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 18:27:51] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 60 ms returned sat
[2023-03-08 18:27:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 18:27:51] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2023-03-08 18:27:51] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2023-03-08 18:27:51] [INFO ] Computed and/alt/rep : 164/290/164 causal constraints (skipped 6 transitions) in 22 ms.
[2023-03-08 18:27:51] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2023-03-08 18:27:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2023-03-08 18:27:51] [INFO ] Added : 111 causal constraints over 23 iterations in 476 ms. Result :sat
Minimization took 44 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 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 17 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 231/231 places, 173/173 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 15 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
[2023-03-08 18:27:52] [INFO ] Invariant cache hit.
[2023-03-08 18:27:53] [INFO ] Implicit Places using invariants in 155 ms returned []
[2023-03-08 18:27:53] [INFO ] Invariant cache hit.
[2023-03-08 18:27:53] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 18:27:53] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
[2023-03-08 18:27:53] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-08 18:27:53] [INFO ] Invariant cache hit.
[2023-03-08 18:27:53] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 587 ms. Remains : 231/231 places, 173/173 transitions.
Starting property specific reduction for DES-PT-30a-UpperBounds-00
[2023-03-08 18:27:53] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 136 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
[2023-03-08 18:27:53] [INFO ] Invariant cache hit.
[2023-03-08 18:27:53] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 18:27:53] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-08 18:27:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 18:27:53] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2023-03-08 18:27:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 18:27:53] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2023-03-08 18:27:53] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 65 ms returned sat
[2023-03-08 18:27:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 18:27:53] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2023-03-08 18:27:53] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 18:27:53] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2023-03-08 18:27:53] [INFO ] Computed and/alt/rep : 164/290/164 causal constraints (skipped 6 transitions) in 11 ms.
[2023-03-08 18:27:54] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 0 ms to minimize.
[2023-03-08 18:27:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2023-03-08 18:27:54] [INFO ] Added : 149 causal constraints over 31 iterations in 502 ms. Result :sat
Minimization took 62 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 10 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 231/231 places, 173/173 transitions.
[2023-03-08 18:27:54] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 13586 resets, run finished after 2013 ms. (steps per millisecond=496 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2259 resets, run finished after 970 ms. (steps per millisecond=1030 ) properties (out of 1) seen :0
[2023-03-08 18:27:57] [INFO ] Invariant cache hit.
[2023-03-08 18:27:57] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 18:27:57] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-08 18:27:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 18:27:57] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2023-03-08 18:27:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 18:27:57] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 18:27:58] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 60 ms returned sat
[2023-03-08 18:27:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 18:27:58] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2023-03-08 18:27:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 18:27:58] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2023-03-08 18:27:58] [INFO ] Computed and/alt/rep : 164/290/164 causal constraints (skipped 6 transitions) in 10 ms.
[2023-03-08 18:27:58] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2023-03-08 18:27:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2023-03-08 18:27:58] [INFO ] Added : 149 causal constraints over 31 iterations in 493 ms. Result :sat
Minimization took 58 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 8 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 231/231 places, 173/173 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 8 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
[2023-03-08 18:27:58] [INFO ] Invariant cache hit.
[2023-03-08 18:27:59] [INFO ] Implicit Places using invariants in 143 ms returned []
[2023-03-08 18:27:59] [INFO ] Invariant cache hit.
[2023-03-08 18:27:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 18:27:59] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
[2023-03-08 18:27:59] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-08 18:27:59] [INFO ] Invariant cache hit.
[2023-03-08 18:27:59] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 569 ms. Remains : 231/231 places, 173/173 transitions.
Ending property specific reduction for DES-PT-30a-UpperBounds-00 in 6050 ms.
Starting property specific reduction for DES-PT-30a-UpperBounds-01
[2023-03-08 18:27:59] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 140 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
[2023-03-08 18:27:59] [INFO ] Invariant cache hit.
[2023-03-08 18:27:59] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 18:27:59] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-08 18:27:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 18:27:59] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2023-03-08 18:27:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 18:27:59] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 18:27:59] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 110 ms returned sat
[2023-03-08 18:27:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 18:27:59] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2023-03-08 18:27:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 18:27:59] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2023-03-08 18:27:59] [INFO ] Computed and/alt/rep : 164/290/164 causal constraints (skipped 6 transitions) in 10 ms.
[2023-03-08 18:28:00] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2023-03-08 18:28:00] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2023-03-08 18:28:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 129 ms
[2023-03-08 18:28:00] [INFO ] Added : 60 causal constraints over 13 iterations in 321 ms. Result :sat
Minimization took 72 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 7 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 231/231 places, 173/173 transitions.
[2023-03-08 18:28:00] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 13612 resets, run finished after 1951 ms. (steps per millisecond=512 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2318 resets, run finished after 954 ms. (steps per millisecond=1048 ) properties (out of 1) seen :0
[2023-03-08 18:28:03] [INFO ] Invariant cache hit.
[2023-03-08 18:28:03] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 18:28:03] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-08 18:28:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 18:28:03] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2023-03-08 18:28:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 18:28:03] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 18:28:03] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 110 ms returned sat
[2023-03-08 18:28:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 18:28:03] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2023-03-08 18:28:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 18:28:03] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2023-03-08 18:28:03] [INFO ] Computed and/alt/rep : 164/290/164 causal constraints (skipped 6 transitions) in 9 ms.
[2023-03-08 18:28:04] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2023-03-08 18:28:04] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 0 ms to minimize.
[2023-03-08 18:28:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 141 ms
[2023-03-08 18:28:04] [INFO ] Added : 60 causal constraints over 13 iterations in 327 ms. Result :sat
Minimization took 73 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 7 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 231/231 places, 173/173 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 7 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
[2023-03-08 18:28:04] [INFO ] Invariant cache hit.
[2023-03-08 18:28:04] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-08 18:28:04] [INFO ] Invariant cache hit.
[2023-03-08 18:28:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 18:28:04] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
[2023-03-08 18:28:04] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-08 18:28:04] [INFO ] Invariant cache hit.
[2023-03-08 18:28:04] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 537 ms. Remains : 231/231 places, 173/173 transitions.
Ending property specific reduction for DES-PT-30a-UpperBounds-01 in 5322 ms.
Starting property specific reduction for DES-PT-30a-UpperBounds-06
[2023-03-08 18:28:04] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 143 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-08 18:28:04] [INFO ] Invariant cache hit.
[2023-03-08 18:28:04] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 18:28:04] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-08 18:28:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 18:28:05] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2023-03-08 18:28:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 18:28:05] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 18:28:05] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 56 ms returned sat
[2023-03-08 18:28:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 18:28:05] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2023-03-08 18:28:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 18:28:05] [INFO ] [Nat]Added 2 Read/Feed constraints in 0 ms returned sat
[2023-03-08 18:28:05] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 0 ms to minimize.
[2023-03-08 18:28:05] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2023-03-08 18:28:05] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2023-03-08 18:28:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 199 ms
[2023-03-08 18:28:05] [INFO ] Computed and/alt/rep : 164/290/164 causal constraints (skipped 6 transitions) in 8 ms.
[2023-03-08 18:28:05] [INFO ] Added : 108 causal constraints over 22 iterations in 370 ms. Result :sat
Minimization took 50 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 7 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 231/231 places, 173/173 transitions.
[2023-03-08 18:28:06] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 13619 resets, run finished after 1949 ms. (steps per millisecond=513 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2260 resets, run finished after 965 ms. (steps per millisecond=1036 ) properties (out of 1) seen :0
[2023-03-08 18:28:09] [INFO ] Invariant cache hit.
[2023-03-08 18:28:09] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 18:28:09] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-08 18:28:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 18:28:09] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2023-03-08 18:28:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 18:28:09] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 18:28:09] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 59 ms returned sat
[2023-03-08 18:28:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 18:28:09] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2023-03-08 18:28:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 18:28:09] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2023-03-08 18:28:09] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 0 ms to minimize.
[2023-03-08 18:28:09] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 0 ms to minimize.
[2023-03-08 18:28:09] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2023-03-08 18:28:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 201 ms
[2023-03-08 18:28:09] [INFO ] Computed and/alt/rep : 164/290/164 causal constraints (skipped 6 transitions) in 9 ms.
[2023-03-08 18:28:09] [INFO ] Added : 108 causal constraints over 22 iterations in 311 ms. Result :sat
Minimization took 46 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 9 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 231/231 places, 173/173 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 6 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
[2023-03-08 18:28:10] [INFO ] Invariant cache hit.
[2023-03-08 18:28:10] [INFO ] Implicit Places using invariants in 136 ms returned []
[2023-03-08 18:28:10] [INFO ] Invariant cache hit.
[2023-03-08 18:28:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 18:28:10] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
[2023-03-08 18:28:10] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 18:28:10] [INFO ] Invariant cache hit.
[2023-03-08 18:28:10] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 546 ms. Remains : 231/231 places, 173/173 transitions.
Ending property specific reduction for DES-PT-30a-UpperBounds-06 in 5925 ms.
Starting property specific reduction for DES-PT-30a-UpperBounds-13
[2023-03-08 18:28:10] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 129 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
[2023-03-08 18:28:10] [INFO ] Invariant cache hit.
[2023-03-08 18:28:10] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 18:28:10] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-08 18:28:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 18:28:10] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2023-03-08 18:28:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 18:28:11] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 18:28:11] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 46 ms returned sat
[2023-03-08 18:28:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 18:28:11] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2023-03-08 18:28:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 18:28:11] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2023-03-08 18:28:11] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2023-03-08 18:28:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2023-03-08 18:28:11] [INFO ] Computed and/alt/rep : 164/290/164 causal constraints (skipped 6 transitions) in 10 ms.
[2023-03-08 18:28:11] [INFO ] Added : 74 causal constraints over 15 iterations in 238 ms. Result :sat
Minimization took 49 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 6 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 231/231 places, 173/173 transitions.
[2023-03-08 18:28:11] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 13647 resets, run finished after 1935 ms. (steps per millisecond=516 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2302 resets, run finished after 927 ms. (steps per millisecond=1078 ) properties (out of 1) seen :0
[2023-03-08 18:28:14] [INFO ] Invariant cache hit.
[2023-03-08 18:28:14] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 18:28:14] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-08 18:28:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 18:28:14] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2023-03-08 18:28:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 18:28:14] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 18:28:14] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 46 ms returned sat
[2023-03-08 18:28:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 18:28:14] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2023-03-08 18:28:14] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 18:28:14] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2023-03-08 18:28:15] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2023-03-08 18:28:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2023-03-08 18:28:15] [INFO ] Computed and/alt/rep : 164/290/164 causal constraints (skipped 6 transitions) in 9 ms.
[2023-03-08 18:28:15] [INFO ] Added : 74 causal constraints over 15 iterations in 235 ms. Result :sat
Minimization took 45 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 6 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 231/231 places, 173/173 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 6 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
[2023-03-08 18:28:15] [INFO ] Invariant cache hit.
[2023-03-08 18:28:15] [INFO ] Implicit Places using invariants in 138 ms returned []
[2023-03-08 18:28:15] [INFO ] Invariant cache hit.
[2023-03-08 18:28:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 18:28:16] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
[2023-03-08 18:28:16] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 18:28:16] [INFO ] Invariant cache hit.
[2023-03-08 18:28:16] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 545 ms. Remains : 231/231 places, 173/173 transitions.
Ending property specific reduction for DES-PT-30a-UpperBounds-13 in 5341 ms.
Starting property specific reduction for DES-PT-30a-UpperBounds-14
[2023-03-08 18:28:16] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 127 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-08 18:28:16] [INFO ] Invariant cache hit.
[2023-03-08 18:28:16] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 18:28:16] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-08 18:28:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 18:28:16] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2023-03-08 18:28:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 18:28:16] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 18:28:16] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 61 ms returned sat
[2023-03-08 18:28:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 18:28:16] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2023-03-08 18:28:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 18:28:16] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2023-03-08 18:28:16] [INFO ] Computed and/alt/rep : 164/290/164 causal constraints (skipped 6 transitions) in 12 ms.
[2023-03-08 18:28:16] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 0 ms to minimize.
[2023-03-08 18:28:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2023-03-08 18:28:17] [INFO ] Added : 111 causal constraints over 23 iterations in 445 ms. Result :sat
Minimization took 44 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 6 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 231/231 places, 173/173 transitions.
[2023-03-08 18:28:17] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 13715 resets, run finished after 1903 ms. (steps per millisecond=525 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2243 resets, run finished after 945 ms. (steps per millisecond=1058 ) properties (out of 1) seen :0
[2023-03-08 18:28:20] [INFO ] Invariant cache hit.
[2023-03-08 18:28:20] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 18:28:20] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-08 18:28:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 18:28:20] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2023-03-08 18:28:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 18:28:20] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 18:28:20] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 61 ms returned sat
[2023-03-08 18:28:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 18:28:20] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2023-03-08 18:28:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 18:28:20] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2023-03-08 18:28:20] [INFO ] Computed and/alt/rep : 164/290/164 causal constraints (skipped 6 transitions) in 10 ms.
[2023-03-08 18:28:21] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 0 ms to minimize.
[2023-03-08 18:28:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2023-03-08 18:28:21] [INFO ] Added : 111 causal constraints over 23 iterations in 440 ms. Result :sat
Minimization took 44 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 5 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 231/231 places, 173/173 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 6 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
[2023-03-08 18:28:21] [INFO ] Invariant cache hit.
[2023-03-08 18:28:21] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-08 18:28:21] [INFO ] Invariant cache hit.
[2023-03-08 18:28:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 18:28:21] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
[2023-03-08 18:28:21] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 18:28:21] [INFO ] Invariant cache hit.
[2023-03-08 18:28:21] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 562 ms. Remains : 231/231 places, 173/173 transitions.
Ending property specific reduction for DES-PT-30a-UpperBounds-14 in 5816 ms.
[2023-03-08 18:28:22] [INFO ] Flatten gal took : 51 ms
[2023-03-08 18:28:22] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2023-03-08 18:28:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 231 places, 173 transitions and 839 arcs took 2 ms.
Total runtime 49607 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --maxsum=/tmp/781/ub_0_ --maxsum=/tmp/781/ub_1_ --maxsum=/tmp/781/ub_2_ --maxsum=/tmp/781/ub_3_ --maxsum=/tmp/781/ub_4_
FORMULA DES-PT-30a-UpperBounds-00 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-30a-UpperBounds-01 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-30a-UpperBounds-06 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-30a-UpperBounds-13 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-30a-UpperBounds-14 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678300436103

--------------------
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
mcc2023
ub formula name DES-PT-30a-UpperBounds-00
ub formula formula --maxsum=/tmp/781/ub_0_
ub formula name DES-PT-30a-UpperBounds-01
ub formula formula --maxsum=/tmp/781/ub_1_
ub formula name DES-PT-30a-UpperBounds-06
ub formula formula --maxsum=/tmp/781/ub_2_
ub formula name DES-PT-30a-UpperBounds-13
ub formula formula --maxsum=/tmp/781/ub_3_
ub formula name DES-PT-30a-UpperBounds-14
ub formula formula --maxsum=/tmp/781/ub_4_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 231 places, 173 transitions and 839 arcs
pnml2lts-sym: Petri net DES_PT_30a analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 173->168 groups
pnml2lts-sym: Regrouping took 0.030 real 0.030 user 0.000 sys
pnml2lts-sym: state vector length is 231; there are 168 groups
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Exploration took 44014459 group checks and 0 next state calls
pnml2lts-sym: reachability took 327.330 real 1301.050 user 7.060 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.780 real 3.120 user 0.000 sys
pnml2lts-sym: state space has 9614416128980 states, 2507865 nodes
pnml2lts-sym: Maximum sum of /tmp/781/ub_0_ is: 1
pnml2lts-sym: Maximum sum of /tmp/781/ub_1_ is: 1
pnml2lts-sym: Maximum sum of /tmp/781/ub_2_ is: 1
pnml2lts-sym: Maximum sum of /tmp/781/ub_3_ is: 1
pnml2lts-sym: Maximum sum of /tmp/781/ub_4_ is: 1
pnml2lts-sym: group_next: 1896 nodes total
pnml2lts-sym: group_explored: 1974 nodes, 2716 short vectors total
pnml2lts-sym: max token count: 1

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-30a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is DES-PT-30a, 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 r105-tall-167814481200445"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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