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-167814481200437.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-20b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814481200437
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 7.6K Feb 26 15:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 26 15:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 15:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 15:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 26 15:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 15:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 15:37 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 91K 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-20b-UpperBounds-00
FORMULA_NAME DES-PT-20b-UpperBounds-01
FORMULA_NAME DES-PT-20b-UpperBounds-02
FORMULA_NAME DES-PT-20b-UpperBounds-03
FORMULA_NAME DES-PT-20b-UpperBounds-04
FORMULA_NAME DES-PT-20b-UpperBounds-05
FORMULA_NAME DES-PT-20b-UpperBounds-06
FORMULA_NAME DES-PT-20b-UpperBounds-07
FORMULA_NAME DES-PT-20b-UpperBounds-08
FORMULA_NAME DES-PT-20b-UpperBounds-09
FORMULA_NAME DES-PT-20b-UpperBounds-10
FORMULA_NAME DES-PT-20b-UpperBounds-11
FORMULA_NAME DES-PT-20b-UpperBounds-12
FORMULA_NAME DES-PT-20b-UpperBounds-13
FORMULA_NAME DES-PT-20b-UpperBounds-14
FORMULA_NAME DES-PT-20b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678299163511

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-20b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 18:12:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-08 18:12:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 18:12:45] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2023-03-08 18:12:45] [INFO ] Transformed 360 places.
[2023-03-08 18:12:45] [INFO ] Transformed 311 transitions.
[2023-03-08 18:12:45] [INFO ] Found NUPN structural information;
[2023-03-08 18:12:45] [INFO ] Parsed PT model containing 360 places and 311 transitions and 987 arcs in 127 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 311 rows 360 cols
[2023-03-08 18:12:45] [INFO ] Computed 65 place invariants in 37 ms
Incomplete random walk after 10000 steps, including 89 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 16) seen :12
FORMULA DES-PT-20b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 4) seen :1
FORMULA DES-PT-20b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :0
[2023-03-08 18:12:45] [INFO ] Invariant cache hit.
[2023-03-08 18:12:45] [INFO ] [Real]Absence check using 39 positive place invariants in 23 ms returned sat
[2023-03-08 18:12:45] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 12 ms returned sat
[2023-03-08 18:12:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 18:12:45] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2023-03-08 18:12:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 18:12:46] [INFO ] [Nat]Absence check using 39 positive place invariants in 18 ms returned sat
[2023-03-08 18:12:46] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 43 ms returned sat
[2023-03-08 18:12:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 18:12:46] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2023-03-08 18:12:46] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 3 ms to minimize.
[2023-03-08 18:12:46] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2023-03-08 18:12:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 303 ms
[2023-03-08 18:12:46] [INFO ] Computed and/alt/rep : 305/595/305 causal constraints (skipped 5 transitions) in 25 ms.
[2023-03-08 18:12:48] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 1 ms to minimize.
[2023-03-08 18:12:48] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 2 ms to minimize.
[2023-03-08 18:12:48] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 0 ms to minimize.
[2023-03-08 18:12:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 309 ms
[2023-03-08 18:12:48] [INFO ] Added : 276 causal constraints over 56 iterations in 2260 ms. Result :sat
Minimization took 150 ms.
[2023-03-08 18:12:49] [INFO ] [Real]Absence check using 39 positive place invariants in 12 ms returned sat
[2023-03-08 18:12:49] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 11 ms returned sat
[2023-03-08 18:12:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 18:12:49] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2023-03-08 18:12:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 18:12:49] [INFO ] [Nat]Absence check using 39 positive place invariants in 12 ms returned sat
[2023-03-08 18:12:49] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 9 ms returned sat
[2023-03-08 18:12:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 18:12:49] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2023-03-08 18:12:49] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2023-03-08 18:12:49] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2023-03-08 18:12:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 154 ms
[2023-03-08 18:12:49] [INFO ] Computed and/alt/rep : 305/595/305 causal constraints (skipped 5 transitions) in 21 ms.
[2023-03-08 18:12:50] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2023-03-08 18:12:51] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2023-03-08 18:12:51] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 0 ms to minimize.
[2023-03-08 18:12:51] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
[2023-03-08 18:12:51] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 0 ms to minimize.
[2023-03-08 18:12:51] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2023-03-08 18:12:51] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2023-03-08 18:12:51] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 638 ms
[2023-03-08 18:12:51] [INFO ] Added : 235 causal constraints over 48 iterations in 1991 ms. Result :sat
Minimization took 200 ms.
[2023-03-08 18:12:51] [INFO ] [Real]Absence check using 39 positive place invariants in 12 ms returned sat
[2023-03-08 18:12:51] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 11 ms returned sat
[2023-03-08 18:12:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 18:12:51] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2023-03-08 18:12:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 18:12:52] [INFO ] [Nat]Absence check using 39 positive place invariants in 12 ms returned sat
[2023-03-08 18:12:52] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 23 ms returned sat
[2023-03-08 18:12:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 18:12:52] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2023-03-08 18:12:52] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 0 ms to minimize.
[2023-03-08 18:12:52] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2023-03-08 18:12:52] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 1 ms to minimize.
[2023-03-08 18:12:52] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 1 ms to minimize.
[2023-03-08 18:12:52] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 0 ms to minimize.
[2023-03-08 18:12:52] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2023-03-08 18:12:52] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 597 ms
[2023-03-08 18:12:52] [INFO ] Computed and/alt/rep : 305/595/305 causal constraints (skipped 5 transitions) in 19 ms.
[2023-03-08 18:12:54] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 0 ms to minimize.
[2023-03-08 18:12:54] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 0 ms to minimize.
[2023-03-08 18:12:55] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 1 ms to minimize.
[2023-03-08 18:12:55] [INFO ] Deduced a trap composed of 52 places in 75 ms of which 0 ms to minimize.
[2023-03-08 18:12:55] [INFO ] Deduced a trap composed of 59 places in 72 ms of which 0 ms to minimize.
[2023-03-08 18:12:55] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2023-03-08 18:12:55] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2023-03-08 18:12:55] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 750 ms
[2023-03-08 18:12:55] [INFO ] Added : 286 causal constraints over 58 iterations in 2702 ms. Result :sat
Minimization took 169 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 360 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 311/311 transitions.
Graph (complete) has 741 edges and 360 vertex of which 349 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 349 transition count 283
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 45 place count 328 transition count 283
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 45 place count 328 transition count 274
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 63 place count 319 transition count 274
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 82 place count 300 transition count 255
Iterating global reduction 2 with 19 rules applied. Total rules applied 101 place count 300 transition count 255
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 101 place count 300 transition count 254
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 299 transition count 254
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 118 place count 284 transition count 239
Iterating global reduction 2 with 15 rules applied. Total rules applied 133 place count 284 transition count 239
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 15 rules applied. Total rules applied 148 place count 284 transition count 224
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 151 place count 282 transition count 223
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 151 place count 282 transition count 220
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 157 place count 279 transition count 220
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 311 place count 202 transition count 143
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 315 place count 200 transition count 145
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 316 place count 200 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 317 place count 199 transition count 144
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 318 place count 199 transition count 144
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 319 place count 198 transition count 143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 320 place count 197 transition count 143
Applied a total of 320 rules in 141 ms. Remains 197 /360 variables (removed 163) and now considering 143/311 (removed 168) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 197/360 places, 143/311 transitions.
// Phase 1: matrix 143 rows 197 cols
[2023-03-08 18:12:57] [INFO ] Computed 60 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 47824 resets, run finished after 1865 ms. (steps per millisecond=536 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 8989 resets, run finished after 883 ms. (steps per millisecond=1132 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 8991 resets, run finished after 886 ms. (steps per millisecond=1128 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9168 resets, run finished after 882 ms. (steps per millisecond=1133 ) properties (out of 3) seen :0
[2023-03-08 18:13:02] [INFO ] Invariant cache hit.
[2023-03-08 18:13:02] [INFO ] [Real]Absence check using 36 positive place invariants in 13 ms returned sat
[2023-03-08 18:13:02] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 9 ms returned sat
[2023-03-08 18:13:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 18:13:02] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2023-03-08 18:13:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 18:13:02] [INFO ] [Nat]Absence check using 36 positive place invariants in 8 ms returned sat
[2023-03-08 18:13:02] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 250 ms returned sat
[2023-03-08 18:13:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 18:13:02] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2023-03-08 18:13:02] [INFO ] Computed and/alt/rep : 129/263/129 causal constraints (skipped 11 transitions) in 10 ms.
[2023-03-08 18:13:02] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 0 ms to minimize.
[2023-03-08 18:13:02] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2023-03-08 18:13:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 128 ms
[2023-03-08 18:13:02] [INFO ] Added : 116 causal constraints over 24 iterations in 420 ms. Result :sat
Minimization took 39 ms.
[2023-03-08 18:13:03] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 18:13:03] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-08 18:13:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 18:13:03] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2023-03-08 18:13:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 18:13:03] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 18:13:03] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 76 ms returned sat
[2023-03-08 18:13:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 18:13:03] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2023-03-08 18:13:03] [INFO ] Computed and/alt/rep : 129/263/129 causal constraints (skipped 11 transitions) in 8 ms.
[2023-03-08 18:13:03] [INFO ] Added : 101 causal constraints over 21 iterations in 241 ms. Result :sat
Minimization took 44 ms.
[2023-03-08 18:13:03] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 18:13:03] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-08 18:13:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 18:13:03] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2023-03-08 18:13:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 18:13:03] [INFO ] [Nat]Absence check using 36 positive place invariants in 9 ms returned sat
[2023-03-08 18:13:03] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 57 ms returned sat
[2023-03-08 18:13:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 18:13:03] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2023-03-08 18:13:03] [INFO ] Computed and/alt/rep : 129/263/129 causal constraints (skipped 11 transitions) in 11 ms.
[2023-03-08 18:13:04] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2023-03-08 18:13:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2023-03-08 18:13:04] [INFO ] Added : 119 causal constraints over 24 iterations in 349 ms. Result :sat
Minimization took 45 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 143/143 transitions.
Applied a total of 0 rules in 6 ms. Remains 197 /197 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 197/197 places, 143/143 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 143/143 transitions.
Applied a total of 0 rules in 6 ms. Remains 197 /197 variables (removed 0) and now considering 143/143 (removed 0) transitions.
[2023-03-08 18:13:04] [INFO ] Invariant cache hit.
[2023-03-08 18:13:05] [INFO ] Implicit Places using invariants in 136 ms returned []
[2023-03-08 18:13:05] [INFO ] Invariant cache hit.
[2023-03-08 18:13:05] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
[2023-03-08 18:13:05] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-08 18:13:05] [INFO ] Invariant cache hit.
[2023-03-08 18:13:05] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 463 ms. Remains : 197/197 places, 143/143 transitions.
Starting property specific reduction for DES-PT-20b-UpperBounds-00
[2023-03-08 18:13:05] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 462 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-08 18:13:05] [INFO ] Invariant cache hit.
[2023-03-08 18:13:05] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 18:13:05] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 7 ms returned sat
[2023-03-08 18:13:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 18:13:05] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2023-03-08 18:13:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 18:13:05] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 18:13:05] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 250 ms returned sat
[2023-03-08 18:13:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 18:13:05] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2023-03-08 18:13:05] [INFO ] Computed and/alt/rep : 129/263/129 causal constraints (skipped 11 transitions) in 9 ms.
[2023-03-08 18:13:06] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 0 ms to minimize.
[2023-03-08 18:13:06] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
[2023-03-08 18:13:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 115 ms
[2023-03-08 18:13:06] [INFO ] Added : 116 causal constraints over 24 iterations in 383 ms. Result :sat
Minimization took 40 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 143/143 transitions.
Applied a total of 0 rules in 6 ms. Remains 197 /197 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 197/197 places, 143/143 transitions.
[2023-03-08 18:13:06] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 47911 resets, run finished after 1765 ms. (steps per millisecond=566 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 8992 resets, run finished after 858 ms. (steps per millisecond=1165 ) properties (out of 1) seen :0
[2023-03-08 18:13:09] [INFO ] Invariant cache hit.
[2023-03-08 18:13:09] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 18:13:09] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-08 18:13:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 18:13:09] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2023-03-08 18:13:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 18:13:09] [INFO ] [Nat]Absence check using 36 positive place invariants in 10 ms returned sat
[2023-03-08 18:13:09] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 255 ms returned sat
[2023-03-08 18:13:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 18:13:09] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2023-03-08 18:13:09] [INFO ] Computed and/alt/rep : 129/263/129 causal constraints (skipped 11 transitions) in 8 ms.
[2023-03-08 18:13:09] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 0 ms to minimize.
[2023-03-08 18:13:09] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2023-03-08 18:13:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 105 ms
[2023-03-08 18:13:09] [INFO ] Added : 116 causal constraints over 24 iterations in 387 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 143/143 transitions.
Applied a total of 0 rules in 6 ms. Remains 197 /197 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 197/197 places, 143/143 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 143/143 transitions.
Applied a total of 0 rules in 6 ms. Remains 197 /197 variables (removed 0) and now considering 143/143 (removed 0) transitions.
[2023-03-08 18:13:10] [INFO ] Invariant cache hit.
[2023-03-08 18:13:10] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-03-08 18:13:10] [INFO ] Invariant cache hit.
[2023-03-08 18:13:10] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2023-03-08 18:13:10] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-08 18:13:10] [INFO ] Invariant cache hit.
[2023-03-08 18:13:10] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 418 ms. Remains : 197/197 places, 143/143 transitions.
Ending property specific reduction for DES-PT-20b-UpperBounds-00 in 5222 ms.
Starting property specific reduction for DES-PT-20b-UpperBounds-04
[2023-03-08 18:13:10] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 482 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 81 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-08 18:13:10] [INFO ] Invariant cache hit.
[2023-03-08 18:13:10] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 18:13:10] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 7 ms returned sat
[2023-03-08 18:13:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 18:13:10] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2023-03-08 18:13:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 18:13:10] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 18:13:10] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 79 ms returned sat
[2023-03-08 18:13:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 18:13:10] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2023-03-08 18:13:10] [INFO ] Computed and/alt/rep : 129/263/129 causal constraints (skipped 11 transitions) in 8 ms.
[2023-03-08 18:13:11] [INFO ] Added : 101 causal constraints over 21 iterations in 235 ms. Result :sat
Minimization took 48 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 143/143 transitions.
Applied a total of 0 rules in 6 ms. Remains 197 /197 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 197/197 places, 143/143 transitions.
[2023-03-08 18:13:11] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 47849 resets, run finished after 1738 ms. (steps per millisecond=575 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9213 resets, run finished after 860 ms. (steps per millisecond=1162 ) properties (out of 1) seen :0
[2023-03-08 18:13:13] [INFO ] Invariant cache hit.
[2023-03-08 18:13:13] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 18:13:14] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-08 18:13:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 18:13:14] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2023-03-08 18:13:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 18:13:14] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 18:13:14] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 75 ms returned sat
[2023-03-08 18:13:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 18:13:14] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2023-03-08 18:13:14] [INFO ] Computed and/alt/rep : 129/263/129 causal constraints (skipped 11 transitions) in 14 ms.
[2023-03-08 18:13:14] [INFO ] Added : 101 causal constraints over 21 iterations in 250 ms. Result :sat
Minimization took 45 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 143/143 transitions.
Applied a total of 0 rules in 6 ms. Remains 197 /197 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 197/197 places, 143/143 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 143/143 transitions.
Applied a total of 0 rules in 5 ms. Remains 197 /197 variables (removed 0) and now considering 143/143 (removed 0) transitions.
[2023-03-08 18:13:14] [INFO ] Invariant cache hit.
[2023-03-08 18:13:14] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-08 18:13:14] [INFO ] Invariant cache hit.
[2023-03-08 18:13:15] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
[2023-03-08 18:13:15] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-08 18:13:15] [INFO ] Invariant cache hit.
[2023-03-08 18:13:15] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 401 ms. Remains : 197/197 places, 143/143 transitions.
Ending property specific reduction for DES-PT-20b-UpperBounds-04 in 4531 ms.
Starting property specific reduction for DES-PT-20b-UpperBounds-11
[2023-03-08 18:13:15] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 467 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-08 18:13:15] [INFO ] Invariant cache hit.
[2023-03-08 18:13:15] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 18:13:15] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 7 ms returned sat
[2023-03-08 18:13:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 18:13:15] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2023-03-08 18:13:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 18:13:15] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 18:13:15] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 55 ms returned sat
[2023-03-08 18:13:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 18:13:15] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2023-03-08 18:13:15] [INFO ] Computed and/alt/rep : 129/263/129 causal constraints (skipped 11 transitions) in 9 ms.
[2023-03-08 18:13:15] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2023-03-08 18:13:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2023-03-08 18:13:15] [INFO ] Added : 119 causal constraints over 24 iterations in 337 ms. Result :sat
Minimization took 42 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 143/143 transitions.
Applied a total of 0 rules in 5 ms. Remains 197 /197 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 197/197 places, 143/143 transitions.
[2023-03-08 18:13:16] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 47611 resets, run finished after 1766 ms. (steps per millisecond=566 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9058 resets, run finished after 871 ms. (steps per millisecond=1148 ) properties (out of 1) seen :0
[2023-03-08 18:13:18] [INFO ] Invariant cache hit.
[2023-03-08 18:13:18] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 18:13:18] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2023-03-08 18:13:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 18:13:18] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2023-03-08 18:13:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 18:13:18] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 18:13:18] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 55 ms returned sat
[2023-03-08 18:13:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 18:13:19] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2023-03-08 18:13:19] [INFO ] Computed and/alt/rep : 129/263/129 causal constraints (skipped 11 transitions) in 8 ms.
[2023-03-08 18:13:19] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2023-03-08 18:13:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2023-03-08 18:13:19] [INFO ] Added : 119 causal constraints over 24 iterations in 326 ms. Result :sat
Minimization took 40 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 143/143 transitions.
Applied a total of 0 rules in 4 ms. Remains 197 /197 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 197/197 places, 143/143 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 143/143 transitions.
Applied a total of 0 rules in 4 ms. Remains 197 /197 variables (removed 0) and now considering 143/143 (removed 0) transitions.
[2023-03-08 18:13:19] [INFO ] Invariant cache hit.
[2023-03-08 18:13:19] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-08 18:13:19] [INFO ] Invariant cache hit.
[2023-03-08 18:13:19] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
[2023-03-08 18:13:19] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 18:13:19] [INFO ] Invariant cache hit.
[2023-03-08 18:13:19] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 396 ms. Remains : 197/197 places, 143/143 transitions.
Ending property specific reduction for DES-PT-20b-UpperBounds-11 in 4898 ms.
[2023-03-08 18:13:20] [INFO ] Flatten gal took : 56 ms
[2023-03-08 18:13:20] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2023-03-08 18:13:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 197 places, 143 transitions and 711 arcs took 2 ms.
Total runtime 34960 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/706/ub_0_ --maxsum=/tmp/706/ub_1_ --maxsum=/tmp/706/ub_2_
FORMULA DES-PT-20b-UpperBounds-00 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-20b-UpperBounds-04 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-20b-UpperBounds-11 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678299347607

--------------------
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-20b-UpperBounds-00
ub formula formula --maxsum=/tmp/706/ub_0_
ub formula name DES-PT-20b-UpperBounds-04
ub formula formula --maxsum=/tmp/706/ub_1_
ub formula name DES-PT-20b-UpperBounds-11
ub formula formula --maxsum=/tmp/706/ub_2_
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 197 places, 143 transitions and 711 arcs
pnml2lts-sym: Petri net DES_PT_20b analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 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: 143->134 groups
pnml2lts-sym: Regrouping took 0.030 real 0.020 user 0.000 sys
pnml2lts-sym: state vector length is 197; there are 134 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: 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: Exploration took 19830077 group checks and 0 next state calls
pnml2lts-sym: reachability took 130.220 real 503.400 user 16.620 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.220 real 0.870 user 0.000 sys
pnml2lts-sym: state space has 9638559829248 states, 916015 nodes
pnml2lts-sym: Maximum sum of /tmp/706/ub_0_ is: 1
pnml2lts-sym: Maximum sum of /tmp/706/ub_1_ is: 1
pnml2lts-sym: Maximum sum of /tmp/706/ub_2_ is: 1
pnml2lts-sym: group_next: 1549 nodes total
pnml2lts-sym: group_explored: 1569 nodes, 2280 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-20b"
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-20b, 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-167814481200437"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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