fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r009-oct2-167813598200623
Last Updated
May 14, 2023

About the Execution of LTSMin+red for AutonomousCar-PT-06b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
563.483 186421.00 680852.00 65.60 TTFFTTFTFFTTFTFF normal

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-167813598200623.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-06b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813598200623
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 684K
-rw-r--r-- 1 mcc users 7.2K Feb 25 12:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 12:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 12:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 12:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K 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.3K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Feb 25 12:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 25 12:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 25 12:52 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 228K 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-06b-ReachabilityFireability-00
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-01
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-02
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-03
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-04
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-05
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-06
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-07
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-08
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-09
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-10
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-11
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-12
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-13
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-14
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678638322314

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-06b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 16:25:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 16:25:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 16:25:26] [INFO ] Load time of PNML (sax parser for PT used): 135 ms
[2023-03-12 16:25:26] [INFO ] Transformed 289 places.
[2023-03-12 16:25:26] [INFO ] Transformed 644 transitions.
[2023-03-12 16:25:26] [INFO ] Found NUPN structural information;
[2023-03-12 16:25:26] [INFO ] Parsed PT model containing 289 places and 644 transitions and 3812 arcs in 267 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 20 resets, run finished after 365 ms. (steps per millisecond=27 ) properties (out of 16) seen :6
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :3
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 7) seen :1
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 644 rows 289 cols
[2023-03-12 16:25:27] [INFO ] Computed 11 place invariants in 18 ms
[2023-03-12 16:25:28] [INFO ] [Real]Absence check using 11 positive place invariants in 26 ms returned sat
[2023-03-12 16:25:28] [INFO ] After 570ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 16:25:28] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-12 16:25:29] [INFO ] After 1364ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 16:25:30] [INFO ] Deduced a trap composed of 23 places in 658 ms of which 28 ms to minimize.
[2023-03-12 16:25:30] [INFO ] Deduced a trap composed of 16 places in 448 ms of which 1 ms to minimize.
[2023-03-12 16:25:31] [INFO ] Deduced a trap composed of 26 places in 360 ms of which 1 ms to minimize.
[2023-03-12 16:25:31] [INFO ] Deduced a trap composed of 35 places in 247 ms of which 1 ms to minimize.
[2023-03-12 16:25:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1840 ms
[2023-03-12 16:25:32] [INFO ] Deduced a trap composed of 35 places in 373 ms of which 14 ms to minimize.
[2023-03-12 16:25:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 394 ms
[2023-03-12 16:25:32] [INFO ] Deduced a trap composed of 35 places in 399 ms of which 0 ms to minimize.
[2023-03-12 16:25:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 449 ms
[2023-03-12 16:25:33] [INFO ] After 4942ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 756 ms.
[2023-03-12 16:25:33] [INFO ] After 5867ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 28 ms.
Support contains 75 out of 289 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 289/289 places, 644/644 transitions.
Graph (trivial) has 149 edges and 289 vertex of which 4 / 289 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 958 edges and 287 vertex of which 282 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 72 place count 282 transition count 567
Reduce places removed 70 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 83 rules applied. Total rules applied 155 place count 212 transition count 554
Reduce places removed 7 places and 0 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 2 with 22 rules applied. Total rules applied 177 place count 205 transition count 539
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 19 rules applied. Total rules applied 196 place count 190 transition count 535
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 197 place count 189 transition count 535
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 15 Pre rules applied. Total rules applied 197 place count 189 transition count 520
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 227 place count 174 transition count 520
Discarding 26 places :
Symmetric choice reduction at 5 with 26 rule applications. Total rules 253 place count 148 transition count 494
Iterating global reduction 5 with 26 rules applied. Total rules applied 279 place count 148 transition count 494
Ensure Unique test removed 146 transitions
Reduce isomorphic transitions removed 146 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 5 with 147 rules applied. Total rules applied 426 place count 148 transition count 347
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 427 place count 147 transition count 347
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 428 place count 146 transition count 346
Iterating global reduction 7 with 1 rules applied. Total rules applied 429 place count 146 transition count 346
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 455 place count 133 transition count 333
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 459 place count 133 transition count 329
Free-agglomeration rule applied 10 times.
Iterating global reduction 7 with 10 rules applied. Total rules applied 469 place count 133 transition count 319
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 479 place count 123 transition count 319
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 481 place count 123 transition count 319
Applied a total of 481 rules in 127 ms. Remains 123 /289 variables (removed 166) and now considering 319/644 (removed 325) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 123/289 places, 319/644 transitions.
Incomplete random walk after 10000 steps, including 201 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :1
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 319 rows 123 cols
[2023-03-12 16:25:34] [INFO ] Computed 9 place invariants in 4 ms
[2023-03-12 16:25:34] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 16:25:34] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-12 16:25:35] [INFO ] After 519ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 16:25:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:25:35] [INFO ] After 430ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 16:25:36] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 1 ms to minimize.
[2023-03-12 16:25:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2023-03-12 16:25:36] [INFO ] After 1205ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 426 ms.
[2023-03-12 16:25:36] [INFO ] After 2268ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 46 ms.
Support contains 73 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 319/319 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 0 with 1 rules applied. Total rules applied 1 place count 123 transition count 318
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 122 transition count 318
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 122 transition count 317
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 121 transition count 317
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 5 place count 120 transition count 316
Applied a total of 5 rules in 48 ms. Remains 120 /123 variables (removed 3) and now considering 316/319 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 120/123 places, 316/319 transitions.
Incomplete random walk after 10000 steps, including 212 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 31 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 637304 steps, run timeout after 3001 ms. (steps per millisecond=212 ) properties seen :{}
Probabilistic random walk after 637304 steps, saw 102923 distinct states, run finished after 3005 ms. (steps per millisecond=212 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 316 rows 120 cols
[2023-03-12 16:25:40] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-12 16:25:40] [INFO ] After 203ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 16:25:40] [INFO ] [Nat]Absence check using 9 positive place invariants in 64 ms returned sat
[2023-03-12 16:25:41] [INFO ] After 451ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 16:25:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:25:41] [INFO ] After 441ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 16:25:42] [INFO ] After 868ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 463 ms.
[2023-03-12 16:25:42] [INFO ] After 2002ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 7 ms.
Support contains 73 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 316/316 transitions.
Applied a total of 0 rules in 7 ms. Remains 120 /120 variables (removed 0) and now considering 316/316 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 120/120 places, 316/316 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 316/316 transitions.
Applied a total of 0 rules in 20 ms. Remains 120 /120 variables (removed 0) and now considering 316/316 (removed 0) transitions.
[2023-03-12 16:25:42] [INFO ] Invariant cache hit.
[2023-03-12 16:25:42] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-12 16:25:42] [INFO ] Invariant cache hit.
[2023-03-12 16:25:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:25:43] [INFO ] Implicit Places using invariants and state equation in 473 ms returned [117]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 606 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 119/120 places, 316/316 transitions.
Applied a total of 0 rules in 7 ms. Remains 119 /119 variables (removed 0) and now considering 316/316 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 633 ms. Remains : 119/120 places, 316/316 transitions.
Incomplete random walk after 10000 steps, including 199 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :1
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :1
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 316 rows 119 cols
[2023-03-12 16:25:43] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-12 16:25:43] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 16:25:43] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-12 16:25:44] [INFO ] After 254ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 16:25:44] [INFO ] After 505ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 200 ms.
[2023-03-12 16:25:44] [INFO ] After 807ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 5 ms.
Support contains 47 out of 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 316/316 transitions.
Graph (complete) has 659 edges and 119 vertex of which 118 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 118 transition count 302
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 26 place count 106 transition count 302
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 26 place count 106 transition count 299
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 32 place count 103 transition count 299
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 34 place count 101 transition count 297
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 101 transition count 297
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 42 place count 98 transition count 294
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 98 transition count 293
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 98 transition count 292
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 45 place count 97 transition count 292
Free-agglomeration rule applied 11 times.
Iterating global reduction 4 with 11 rules applied. Total rules applied 56 place count 97 transition count 281
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 67 place count 86 transition count 281
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 71 place count 86 transition count 281
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 72 place count 85 transition count 280
Applied a total of 72 rules in 49 ms. Remains 85 /119 variables (removed 34) and now considering 280/316 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 85/119 places, 280/316 transitions.
Incomplete random walk after 10000 steps, including 284 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 920879 steps, run timeout after 3001 ms. (steps per millisecond=306 ) properties seen :{}
Probabilistic random walk after 920879 steps, saw 142126 distinct states, run finished after 3001 ms. (steps per millisecond=306 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 280 rows 85 cols
[2023-03-12 16:25:47] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-12 16:25:48] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 16:25:48] [INFO ] [Nat]Absence check using 10 positive place invariants in 27 ms returned sat
[2023-03-12 16:25:48] [INFO ] After 305ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 16:25:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:25:48] [INFO ] After 179ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 16:25:49] [INFO ] Deduced a trap composed of 10 places in 265 ms of which 1 ms to minimize.
[2023-03-12 16:25:49] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 1 ms to minimize.
[2023-03-12 16:25:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 402 ms
[2023-03-12 16:25:49] [INFO ] After 811ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 155 ms.
[2023-03-12 16:25:49] [INFO ] After 1423ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 35 ms.
Support contains 47 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 280/280 transitions.
Applied a total of 0 rules in 6 ms. Remains 85 /85 variables (removed 0) and now considering 280/280 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 85/85 places, 280/280 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 280/280 transitions.
Applied a total of 0 rules in 6 ms. Remains 85 /85 variables (removed 0) and now considering 280/280 (removed 0) transitions.
[2023-03-12 16:25:49] [INFO ] Invariant cache hit.
[2023-03-12 16:25:49] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-12 16:25:49] [INFO ] Invariant cache hit.
[2023-03-12 16:25:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:25:49] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
[2023-03-12 16:25:49] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-12 16:25:49] [INFO ] Invariant cache hit.
[2023-03-12 16:25:50] [INFO ] Dead Transitions using invariants and state equation in 558 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 927 ms. Remains : 85/85 places, 280/280 transitions.
Applied a total of 0 rules in 18 ms. Remains 85 /85 variables (removed 0) and now considering 280/280 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-12 16:25:50] [INFO ] Invariant cache hit.
[2023-03-12 16:25:50] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 16:25:50] [INFO ] [Nat]Absence check using 10 positive place invariants in 29 ms returned sat
[2023-03-12 16:25:50] [INFO ] After 187ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 16:25:51] [INFO ] Deduced a trap composed of 10 places in 208 ms of which 0 ms to minimize.
[2023-03-12 16:25:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 231 ms
[2023-03-12 16:25:51] [INFO ] Deduced a trap composed of 8 places in 172 ms of which 26 ms to minimize.
[2023-03-12 16:25:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 202 ms
[2023-03-12 16:25:51] [INFO ] After 776ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 211 ms.
[2023-03-12 16:25:51] [INFO ] After 1113ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-12 16:25:51] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 13 ms.
[2023-03-12 16:25:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 85 places, 280 transitions and 2213 arcs took 12 ms.
[2023-03-12 16:25:52] [INFO ] Flatten gal took : 115 ms
Total runtime 26153 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 --inv-bin-par --invariant=/tmp/576/inv_0_ --invariant=/tmp/576/inv_1_ --inv-par
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678638508735

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
mcc2023
rfs formula name AutonomousCar-PT-06b-ReachabilityFireability-08
rfs formula type AG
rfs formula formula --invariant=/tmp/576/inv_0_
rfs formula name AutonomousCar-PT-06b-ReachabilityFireability-10
rfs formula type EF
rfs formula formula --invariant=/tmp/576/inv_1_
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 85 places, 280 transitions and 2213 arcs
pnml2lts-sym: Petri net AutonomousCar_PT_06b analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 280->262 groups
pnml2lts-sym: Regrouping took 0.050 real 0.060 user 0.000 sys
pnml2lts-sym: state vector length is 85; there are 262 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: 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:
pnml2lts-sym: Invariant violation (/tmp/576/inv_1_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/576/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: all invariants violated
pnml2lts-sym: exiting now
pnml2lts-sym: invariant detection took 155.970 real 622.790 user 0.470 sys
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="AutonomousCar-PT-06b"
export BK_EXAMINATION="ReachabilityFireability"
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-06b, examination is ReachabilityFireability"
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-167813598200623"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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