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.r009-oct2-167813598200686.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 AutonomousCar-PT-10b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813598200686
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.8K Feb 25 12:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 25 12:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 12:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 25 12:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 25 12:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 12:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 12:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 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.6M 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 AutonomousCar-PT-10b-ReachabilityCardinality-00
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-01
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-02
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-03
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-04
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-05
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-06
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-07
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-08
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-09
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-10
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-11
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-12
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-13
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-14
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678642879835

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=AutonomousCar-PT-10b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 17:41:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 17:41:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 17:41:23] [INFO ] Load time of PNML (sax parser for PT used): 259 ms
[2023-03-12 17:41:23] [INFO ] Transformed 425 places.
[2023-03-12 17:41:23] [INFO ] Transformed 2252 transitions.
[2023-03-12 17:41:23] [INFO ] Found NUPN structural information;
[2023-03-12 17:41:23] [INFO ] Parsed PT model containing 425 places and 2252 transitions and 29816 arcs in 407 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 76 resets, run finished after 520 ms. (steps per millisecond=19 ) properties (out of 14) seen :8
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :1
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 2252 rows 425 cols
[2023-03-12 17:41:24] [INFO ] Computed 15 place invariants in 42 ms
[2023-03-12 17:41:25] [INFO ] After 635ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 17:41:25] [INFO ] [Nat]Absence check using 15 positive place invariants in 13 ms returned sat
[2023-03-12 17:41:27] [INFO ] After 1693ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 17:41:28] [INFO ] Deduced a trap composed of 16 places in 1689 ms of which 57 ms to minimize.
[2023-03-12 17:41:30] [INFO ] Deduced a trap composed of 42 places in 1231 ms of which 2 ms to minimize.
[2023-03-12 17:41:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3159 ms
[2023-03-12 17:41:32] [INFO ] Deduced a trap composed of 35 places in 1489 ms of which 1 ms to minimize.
[2023-03-12 17:41:33] [INFO ] Deduced a trap composed of 48 places in 991 ms of which 2 ms to minimize.
[2023-03-12 17:41:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 2657 ms
[2023-03-12 17:41:33] [INFO ] After 8159ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 367 ms.
[2023-03-12 17:41:34] [INFO ] After 8820ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 184 ms.
Support contains 49 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 2252/2252 transitions.
Graph (trivial) has 321 edges and 425 vertex of which 2 / 425 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1996 edges and 424 vertex of which 420 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.30 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 132 transitions
Trivial Post-agglo rules discarded 132 transitions
Performed 132 trivial Post agglomeration. Transition count delta: 132
Iterating post reduction 0 with 133 rules applied. Total rules applied 135 place count 420 transition count 2114
Reduce places removed 132 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 154 rules applied. Total rules applied 289 place count 288 transition count 2092
Reduce places removed 10 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 2 with 29 rules applied. Total rules applied 318 place count 278 transition count 2073
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 21 rules applied. Total rules applied 339 place count 259 transition count 2071
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 340 place count 258 transition count 2071
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 16 Pre rules applied. Total rules applied 340 place count 258 transition count 2055
Deduced a syphon composed of 16 places in 3 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 372 place count 242 transition count 2055
Discarding 26 places :
Symmetric choice reduction at 5 with 26 rule applications. Total rules 398 place count 216 transition count 2029
Iterating global reduction 5 with 26 rules applied. Total rules applied 424 place count 216 transition count 2029
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 426 place count 216 transition count 2027
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 426 place count 216 transition count 2026
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 428 place count 215 transition count 2026
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 435 place count 208 transition count 1886
Iterating global reduction 6 with 7 rules applied. Total rules applied 442 place count 208 transition count 1886
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 444 place count 208 transition count 1884
Performed 51 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 7 with 102 rules applied. Total rules applied 546 place count 157 transition count 1832
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 551 place count 152 transition count 1727
Iterating global reduction 7 with 5 rules applied. Total rules applied 556 place count 152 transition count 1727
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 560 place count 150 transition count 1728
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 561 place count 150 transition count 1727
Drop transitions removed 287 transitions
Redundant transition composition rules discarded 287 transitions
Iterating global reduction 8 with 287 rules applied. Total rules applied 848 place count 150 transition count 1440
Free-agglomeration rule applied 17 times.
Iterating global reduction 8 with 17 rules applied. Total rules applied 865 place count 150 transition count 1423
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 8 with 17 rules applied. Total rules applied 882 place count 133 transition count 1423
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 884 place count 133 transition count 1421
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 885 place count 133 transition count 1421
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 886 place count 132 transition count 1420
Applied a total of 886 rules in 1055 ms. Remains 132 /425 variables (removed 293) and now considering 1420/2252 (removed 832) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1056 ms. Remains : 132/425 places, 1420/2252 transitions.
Incomplete random walk after 10000 steps, including 266 resets, run finished after 417 ms. (steps per millisecond=23 ) properties (out of 4) seen :1
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1420 rows 132 cols
[2023-03-12 17:41:35] [INFO ] Computed 15 place invariants in 32 ms
[2023-03-12 17:41:36] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 17:41:36] [INFO ] [Nat]Absence check using 15 positive place invariants in 20 ms returned sat
[2023-03-12 17:41:37] [INFO ] After 781ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 17:41:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:41:37] [INFO ] After 212ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 17:41:38] [INFO ] Deduced a trap composed of 34 places in 989 ms of which 3 ms to minimize.
[2023-03-12 17:41:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1133 ms
[2023-03-12 17:41:38] [INFO ] After 1653ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 223 ms.
[2023-03-12 17:41:39] [INFO ] After 2821ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 69 ms.
Support contains 47 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 1420/1420 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 0 with 2 rules applied. Total rules applied 2 place count 132 transition count 1418
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 130 transition count 1418
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 23 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 129 transition count 1417
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 129 transition count 1416
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 128 transition count 1416
Applied a total of 8 rules in 264 ms. Remains 128 /132 variables (removed 4) and now considering 1416/1420 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 276 ms. Remains : 128/132 places, 1416/1420 transitions.
Incomplete random walk after 10000 steps, including 273 resets, run finished after 317 ms. (steps per millisecond=31 ) properties (out of 3) seen :2
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1416 rows 128 cols
[2023-03-12 17:41:39] [INFO ] Computed 15 place invariants in 11 ms
[2023-03-12 17:41:39] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:41:39] [INFO ] [Nat]Absence check using 15 positive place invariants in 27 ms returned sat
[2023-03-12 17:41:40] [INFO ] After 558ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 17:41:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:41:40] [INFO ] After 155ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 17:41:40] [INFO ] After 298ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 115 ms.
[2023-03-12 17:41:40] [INFO ] After 1072ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 10 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 1416/1416 transitions.
Graph (trivial) has 86 edges and 128 vertex of which 2 / 128 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1266 edges and 127 vertex of which 126 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output 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 23 place count 126 transition count 1393
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 24 rules applied. Total rules applied 47 place count 105 transition count 1390
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 49 place count 104 transition count 1389
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 51 place count 103 transition count 1388
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 51 place count 103 transition count 1384
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 59 place count 99 transition count 1384
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 62 place count 96 transition count 1381
Iterating global reduction 4 with 3 rules applied. Total rules applied 65 place count 96 transition count 1381
Performed 12 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 89 place count 84 transition count 1368
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 90 place count 84 transition count 1367
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 93 place count 81 transition count 1344
Iterating global reduction 5 with 3 rules applied. Total rules applied 96 place count 81 transition count 1344
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 97 place count 81 transition count 1343
Free-agglomeration rule applied 8 times.
Iterating global reduction 6 with 8 rules applied. Total rules applied 105 place count 81 transition count 1335
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 18 rules applied. Total rules applied 123 place count 73 transition count 1325
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 7 with 11 rules applied. Total rules applied 134 place count 73 transition count 1314
Applied a total of 134 rules in 406 ms. Remains 73 /128 variables (removed 55) and now considering 1314/1416 (removed 102) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 407 ms. Remains : 73/128 places, 1314/1416 transitions.
Finished random walk after 174 steps, including 3 resets, run visited all 1 properties in 3 ms. (steps per millisecond=58 )
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 18420 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/513/inv_0_ --invariant=/tmp/513/inv_1_ --invariant=/tmp/513/inv_2_ --invariant=/tmp/513/inv_3_ --invariant=/tmp/513/inv_4_ --invariant=/tmp/513/inv_5_ --invariant=/tmp/513/inv_6_ --invariant=/tmp/513/inv_7_ --invariant=/tmp/513/inv_8_ --invariant=/tmp/513/inv_9_ --invariant=/tmp/513/inv_10_ --invariant=/tmp/513/inv_11_ --invariant=/tmp/513/inv_12_ --invariant=/tmp/513/inv_13_ --invariant=/tmp/513/inv_14_ --invariant=/tmp/513/inv_15_ --inv-par
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393220 kB
MemFree: 15634656 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16095432 kB
Could not compute solution for formula : AutonomousCar-PT-10b-ReachabilityCardinality-00
Could not compute solution for formula : AutonomousCar-PT-10b-ReachabilityCardinality-01
Could not compute solution for formula : AutonomousCar-PT-10b-ReachabilityCardinality-02
Could not compute solution for formula : AutonomousCar-PT-10b-ReachabilityCardinality-03
Could not compute solution for formula : AutonomousCar-PT-10b-ReachabilityCardinality-04
Could not compute solution for formula : AutonomousCar-PT-10b-ReachabilityCardinality-05
Could not compute solution for formula : AutonomousCar-PT-10b-ReachabilityCardinality-06
Could not compute solution for formula : AutonomousCar-PT-10b-ReachabilityCardinality-07
Could not compute solution for formula : AutonomousCar-PT-10b-ReachabilityCardinality-08
Could not compute solution for formula : AutonomousCar-PT-10b-ReachabilityCardinality-09
Could not compute solution for formula : AutonomousCar-PT-10b-ReachabilityCardinality-10
Could not compute solution for formula : AutonomousCar-PT-10b-ReachabilityCardinality-11
Could not compute solution for formula : AutonomousCar-PT-10b-ReachabilityCardinality-12
Could not compute solution for formula : AutonomousCar-PT-10b-ReachabilityCardinality-13
Could not compute solution for formula : AutonomousCar-PT-10b-ReachabilityCardinality-14
Could not compute solution for formula : AutonomousCar-PT-10b-ReachabilityCardinality-15

BK_STOP 1678646473339

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2023
rfs formula name AutonomousCar-PT-10b-ReachabilityCardinality-00
rfs formula type AG
rfs formula formula --invariant=/tmp/513/inv_0_
rfs formula name AutonomousCar-PT-10b-ReachabilityCardinality-01
rfs formula type EF
rfs formula formula --invariant=/tmp/513/inv_1_
rfs formula name AutonomousCar-PT-10b-ReachabilityCardinality-02
rfs formula type AG
rfs formula formula --invariant=/tmp/513/inv_2_
rfs formula name AutonomousCar-PT-10b-ReachabilityCardinality-03
rfs formula type AG
rfs formula formula --invariant=/tmp/513/inv_3_
rfs formula name AutonomousCar-PT-10b-ReachabilityCardinality-04
rfs formula type AG
rfs formula formula --invariant=/tmp/513/inv_4_
rfs formula name AutonomousCar-PT-10b-ReachabilityCardinality-05
rfs formula type AG
rfs formula formula --invariant=/tmp/513/inv_5_
rfs formula name AutonomousCar-PT-10b-ReachabilityCardinality-06
rfs formula type AG
rfs formula formula --invariant=/tmp/513/inv_6_
rfs formula name AutonomousCar-PT-10b-ReachabilityCardinality-07
rfs formula type AG
rfs formula formula --invariant=/tmp/513/inv_7_
rfs formula name AutonomousCar-PT-10b-ReachabilityCardinality-08
rfs formula type EF
rfs formula formula --invariant=/tmp/513/inv_8_
rfs formula name AutonomousCar-PT-10b-ReachabilityCardinality-09
rfs formula type AG
rfs formula formula --invariant=/tmp/513/inv_9_
rfs formula name AutonomousCar-PT-10b-ReachabilityCardinality-10
rfs formula type AG
rfs formula formula --invariant=/tmp/513/inv_10_
rfs formula name AutonomousCar-PT-10b-ReachabilityCardinality-11
rfs formula type AG
rfs formula formula --invariant=/tmp/513/inv_11_
rfs formula name AutonomousCar-PT-10b-ReachabilityCardinality-12
rfs formula type AG
rfs formula formula --invariant=/tmp/513/inv_12_
rfs formula name AutonomousCar-PT-10b-ReachabilityCardinality-13
rfs formula type EF
rfs formula formula --invariant=/tmp/513/inv_13_
rfs formula name AutonomousCar-PT-10b-ReachabilityCardinality-14
rfs formula type AG
rfs formula formula --invariant=/tmp/513/inv_14_
rfs formula name AutonomousCar-PT-10b-ReachabilityCardinality-15
rfs formula type AG
rfs formula formula --invariant=/tmp/513/inv_15_
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 425 places, 2252 transitions and 29816 arcs
pnml2lts-sym: Petri net AutonomousCar-PT-10b analyzed
pnml2lts-sym: There are safe places
pnml2lts-sym: Loading Petri net took 0.060 real 0.040 user 0.020 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: 2252->2252 groups
pnml2lts-sym: Regrouping took 2.380 real 2.380 user 0.000 sys
pnml2lts-sym: state vector length is 425; there are 2252 groups
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: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: got initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
Killing (15) : 519
Killing (9) : 519

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="AutonomousCar-PT-10b"
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 AutonomousCar-PT-10b, 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 r009-oct2-167813598200686"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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