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.r169-tall-167838856100566.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 FlexibleBarrier-PT-18b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838856100566
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 6.6K Feb 25 12:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 25 12:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 12:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 12:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 25 12:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Feb 25 12:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:07 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 1.2M 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 booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-00
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-01
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-02
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-03
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-04
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-05
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-06
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-07
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-08
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-09
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-10
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-11
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-12
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-13
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-14
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678571245143

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-18b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 21:47:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 21:47:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 21:47:26] [INFO ] Load time of PNML (sax parser for PT used): 279 ms
[2023-03-11 21:47:26] [INFO ] Transformed 4370 places.
[2023-03-11 21:47:27] [INFO ] Transformed 5037 transitions.
[2023-03-11 21:47:27] [INFO ] Found NUPN structural information;
[2023-03-11 21:47:27] [INFO ] Parsed PT model containing 4370 places and 5037 transitions and 12657 arcs in 371 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 81 resets, run finished after 482 ms. (steps per millisecond=20 ) properties (out of 15) seen :3
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) seen :1
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 5037 rows 4370 cols
[2023-03-11 21:47:28] [INFO ] Computed 20 place invariants in 166 ms
[2023-03-11 21:47:29] [INFO ] After 1565ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-11 21:47:31] [INFO ] [Nat]Absence check using 20 positive place invariants in 39 ms returned sat
[2023-03-11 21:47:36] [INFO ] After 4506ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :9
[2023-03-11 21:47:36] [INFO ] Deduced a trap composed of 327 places in 409 ms of which 6 ms to minimize.
[2023-03-11 21:47:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 704 ms
[2023-03-11 21:47:37] [INFO ] Deduced a trap composed of 30 places in 420 ms of which 1 ms to minimize.
[2023-03-11 21:47:38] [INFO ] Deduced a trap composed of 189 places in 421 ms of which 2 ms to minimize.
[2023-03-11 21:47:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1316 ms
[2023-03-11 21:47:41] [INFO ] Deduced a trap composed of 334 places in 2578 ms of which 3 ms to minimize.
[2023-03-11 21:47:44] [INFO ] Deduced a trap composed of 1624 places in 2499 ms of which 3 ms to minimize.
[2023-03-11 21:47:46] [INFO ] Deduced a trap composed of 1587 places in 2329 ms of which 2 ms to minimize.
[2023-03-11 21:47:49] [INFO ] Deduced a trap composed of 1540 places in 2265 ms of which 3 ms to minimize.
[2023-03-11 21:47:51] [INFO ] Deduced a trap composed of 1528 places in 1917 ms of which 2 ms to minimize.
[2023-03-11 21:47:53] [INFO ] Deduced a trap composed of 1492 places in 2074 ms of which 2 ms to minimize.
[2023-03-11 21:47:53] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 14777 ms
[2023-03-11 21:47:54] [INFO ] After 23256ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :9
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-11 21:47:54] [INFO ] After 25059ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :9
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 191 ms.
Support contains 98 out of 4370 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4370/4370 places, 5037/5037 transitions.
Graph (trivial) has 4145 edges and 4370 vertex of which 110 / 4370 are part of one of the 18 SCC in 24 ms
Free SCC test removed 92 places
Drop transitions removed 111 transitions
Reduce isomorphic transitions removed 111 transitions.
Drop transitions removed 988 transitions
Trivial Post-agglo rules discarded 988 transitions
Performed 988 trivial Post agglomeration. Transition count delta: 988
Iterating post reduction 0 with 988 rules applied. Total rules applied 989 place count 4278 transition count 3938
Reduce places removed 988 places and 0 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Iterating post reduction 1 with 1013 rules applied. Total rules applied 2002 place count 3290 transition count 3913
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 2027 place count 3265 transition count 3913
Performed 305 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 305 Pre rules applied. Total rules applied 2027 place count 3265 transition count 3608
Deduced a syphon composed of 305 places in 3 ms
Reduce places removed 305 places and 0 transitions.
Iterating global reduction 3 with 610 rules applied. Total rules applied 2637 place count 2960 transition count 3608
Discarding 1704 places :
Symmetric choice reduction at 3 with 1704 rule applications. Total rules 4341 place count 1256 transition count 1904
Iterating global reduction 3 with 1704 rules applied. Total rules applied 6045 place count 1256 transition count 1904
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 6045 place count 1256 transition count 1898
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 6057 place count 1250 transition count 1898
Discarding 247 places :
Symmetric choice reduction at 3 with 247 rule applications. Total rules 6304 place count 1003 transition count 1651
Iterating global reduction 3 with 247 rules applied. Total rules applied 6551 place count 1003 transition count 1651
Ensure Unique test removed 223 transitions
Reduce isomorphic transitions removed 223 transitions.
Iterating post reduction 3 with 223 rules applied. Total rules applied 6774 place count 1003 transition count 1428
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 6976 place count 902 transition count 1327
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 4 with 36 rules applied. Total rules applied 7012 place count 902 transition count 1291
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 7028 place count 886 transition count 1275
Iterating global reduction 5 with 16 rules applied. Total rules applied 7044 place count 886 transition count 1275
Free-agglomeration rule applied 659 times.
Iterating global reduction 5 with 659 rules applied. Total rules applied 7703 place count 886 transition count 616
Reduce places removed 659 places and 0 transitions.
Drop transitions removed 251 transitions
Reduce isomorphic transitions removed 251 transitions.
Iterating post reduction 5 with 910 rules applied. Total rules applied 8613 place count 227 transition count 365
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 8614 place count 227 transition count 364
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 8616 place count 227 transition count 364
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 8617 place count 226 transition count 363
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t2.t3.t4.t4358.t3676.t3677.t3655.t3656 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 87 edges and 224 vertex of which 32 / 224 are part of one of the 16 SCC in 0 ms
Free SCC test removed 16 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 4 rules applied. Total rules applied 8621 place count 208 transition count 360
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 34 rules applied. Total rules applied 8655 place count 207 transition count 327
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 8656 place count 206 transition count 327
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 18 Pre rules applied. Total rules applied 8656 place count 206 transition count 309
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 9 with 36 rules applied. Total rules applied 8692 place count 188 transition count 309
Drop transitions removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 9 with 17 rules applied. Total rules applied 8709 place count 188 transition count 292
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 10 with 34 rules applied. Total rules applied 8743 place count 171 transition count 275
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 8744 place count 171 transition count 274
Free-agglomeration rule applied 18 times.
Iterating global reduction 11 with 18 rules applied. Total rules applied 8762 place count 171 transition count 256
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 11 with 33 rules applied. Total rules applied 8795 place count 153 transition count 241
Applied a total of 8795 rules in 1025 ms. Remains 153 /4370 variables (removed 4217) and now considering 241/5037 (removed 4796) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1026 ms. Remains : 153/4370 places, 241/5037 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 251 ms. (steps per millisecond=39 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 9) seen :2
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) seen :1
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 6) seen :1
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-11 21:47:57] [INFO ] Flow matrix only has 227 transitions (discarded 14 similar events)
// Phase 1: matrix 227 rows 153 cols
[2023-03-11 21:47:57] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-11 21:47:57] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 21:47:57] [INFO ] [Nat]Absence check using 19 positive place invariants in 3 ms returned sat
[2023-03-11 21:47:57] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-11 21:47:57] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-11 21:47:57] [INFO ] After 66ms SMT Verify possible using 45 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-11 21:47:57] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 0 ms to minimize.
[2023-03-11 21:47:57] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 0 ms to minimize.
[2023-03-11 21:47:57] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 1 ms to minimize.
[2023-03-11 21:47:57] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 0 ms to minimize.
[2023-03-11 21:47:57] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 0 ms to minimize.
[2023-03-11 21:47:57] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 298 ms
[2023-03-11 21:47:57] [INFO ] After 454ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 62 ms.
[2023-03-11 21:47:57] [INFO ] After 687ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 18 ms.
Support contains 88 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 241/241 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 153 transition count 237
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 149 transition count 237
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 13 place count 144 transition count 232
Iterating global reduction 2 with 5 rules applied. Total rules applied 18 place count 144 transition count 232
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 26 place count 140 transition count 228
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 34 place count 140 transition count 220
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 35 place count 140 transition count 219
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 37 place count 139 transition count 218
Applied a total of 37 rules in 17 ms. Remains 139 /153 variables (removed 14) and now considering 218/241 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 139/153 places, 218/241 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 533456 steps, run timeout after 3001 ms. (steps per millisecond=177 ) properties seen :{0=1, 2=1}
Probabilistic random walk after 533456 steps, saw 201375 distinct states, run finished after 3002 ms. (steps per millisecond=177 ) properties seen :2
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 3 properties.
[2023-03-11 21:48:01] [INFO ] Flow matrix only has 204 transitions (discarded 14 similar events)
// Phase 1: matrix 204 rows 139 cols
[2023-03-11 21:48:01] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-11 21:48:01] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 21:48:01] [INFO ] [Nat]Absence check using 19 positive place invariants in 3 ms returned sat
[2023-03-11 21:48:01] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 21:48:01] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-11 21:48:01] [INFO ] After 29ms SMT Verify possible using 40 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 21:48:01] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2023-03-11 21:48:01] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 0 ms to minimize.
[2023-03-11 21:48:01] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2023-03-11 21:48:01] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 0 ms to minimize.
[2023-03-11 21:48:01] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 218 ms
[2023-03-11 21:48:01] [INFO ] After 286ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-11 21:48:02] [INFO ] After 422ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 4 ms.
Support contains 23 out of 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 218/218 transitions.
Graph (trivial) has 88 edges and 139 vertex of which 2 / 139 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
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 21 rules applied. Total rules applied 22 place count 138 transition count 195
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 43 place count 117 transition count 195
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 72 place count 88 transition count 166
Iterating global reduction 2 with 29 rules applied. Total rules applied 101 place count 88 transition count 166
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 103 place count 88 transition count 164
Performed 18 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 141 place count 68 transition count 145
Drop transitions removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Graph (complete) has 170 edges and 68 vertex of which 65 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Iterating post reduction 3 with 55 rules applied. Total rules applied 196 place count 65 transition count 89
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 198 place count 65 transition count 87
Free-agglomeration rule applied 16 times with reduction of 1 identical transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 214 place count 65 transition count 70
Reduce places removed 19 places and 0 transitions.
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 5 with 34 rules applied. Total rules applied 248 place count 46 transition count 55
Applied a total of 248 rules in 11 ms. Remains 46 /139 variables (removed 93) and now considering 55/218 (removed 163) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 46/139 places, 55/218 transitions.
Finished random walk after 4475 steps, including 1 resets, run visited all 1 properties in 10 ms. (steps per millisecond=447 )
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 35433 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/531/inv_0_ --invariant=/tmp/531/inv_1_ --invariant=/tmp/531/inv_2_ --invariant=/tmp/531/inv_3_ --invariant=/tmp/531/inv_4_ --invariant=/tmp/531/inv_5_ --invariant=/tmp/531/inv_6_ --invariant=/tmp/531/inv_7_ --invariant=/tmp/531/inv_8_ --invariant=/tmp/531/inv_9_ --invariant=/tmp/531/inv_10_ --invariant=/tmp/531/inv_11_ --invariant=/tmp/531/inv_12_ --invariant=/tmp/531/inv_13_ --invariant=/tmp/531/inv_14_ --invariant=/tmp/531/inv_15_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 14807680 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16098248 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2023

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="FlexibleBarrier-PT-18b"
export BK_EXAMINATION="ReachabilityCardinality"
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 FlexibleBarrier-PT-18b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r169-tall-167838856100566"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-18b.tgz
mv FlexibleBarrier-PT-18b execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;