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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 5.8K Feb 25 12:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 12:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 12:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 12:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K 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 7.7K Feb 25 12:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 25 12:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 25 12:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K 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 781K 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-09a-ReachabilityFireability-00
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-01
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-02
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-03
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-04
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-05
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-06
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-07
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-08
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-09
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-10
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-11
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-12
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-13
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-14
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678640198156

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-09a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 16:56:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 16:56:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 16:56:41] [INFO ] Load time of PNML (sax parser for PT used): 177 ms
[2023-03-12 16:56:41] [INFO ] Transformed 89 places.
[2023-03-12 16:56:41] [INFO ] Transformed 1249 transitions.
[2023-03-12 16:56:41] [INFO ] Found NUPN structural information;
[2023-03-12 16:56:41] [INFO ] Parsed PT model containing 89 places and 1249 transitions and 15631 arcs in 343 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 345 transitions
Reduce redundant transitions removed 345 transitions.
Incomplete random walk after 10000 steps, including 501 resets, run finished after 762 ms. (steps per millisecond=13 ) properties (out of 16) seen :1
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 48 ms. (steps per millisecond=20 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 328876 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :{0=1, 9=1, 10=1}
Probabilistic random walk after 328876 steps, saw 46150 distinct states, run finished after 3002 ms. (steps per millisecond=109 ) properties seen :3
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 12 properties.
[2023-03-12 16:56:45] [INFO ] Flow matrix only has 903 transitions (discarded 1 similar events)
// Phase 1: matrix 903 rows 89 cols
[2023-03-12 16:56:45] [INFO ] Computed 14 place invariants in 29 ms
[2023-03-12 16:56:47] [INFO ] After 570ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-12 16:56:47] [INFO ] [Nat]Absence check using 14 positive place invariants in 30 ms returned sat
[2023-03-12 16:56:50] [INFO ] After 2950ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :9
[2023-03-12 16:56:50] [INFO ] State equation strengthened by 327 read => feed constraints.
[2023-03-12 16:56:53] [INFO ] After 2854ms SMT Verify possible using 327 Read/Feed constraints in natural domain returned unsat :3 sat :9
[2023-03-12 16:56:55] [INFO ] After 5455ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :9
Attempting to minimize the solution found.
Minimization took 2551 ms.
[2023-03-12 16:56:58] [INFO ] After 11298ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :9
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 9 different solutions.
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 1423 ms.
Support contains 50 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 904/904 transitions.
Graph (complete) has 1045 edges and 89 vertex of which 87 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions 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 0 with 3 rules applied. Total rules applied 4 place count 87 transition count 899
Reduce places removed 1 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 86 transition count 895
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 13 place count 82 transition count 895
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 13 place count 82 transition count 894
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 15 place count 81 transition count 894
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 16 place count 80 transition count 884
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 80 transition count 884
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 23 place count 80 transition count 878
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 38 place count 74 transition count 869
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 39 place count 74 transition count 869
Applied a total of 39 rules in 306 ms. Remains 74 /89 variables (removed 15) and now considering 869/904 (removed 35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 307 ms. Remains : 74/89 places, 869/904 transitions.
Incomplete random walk after 10000 steps, including 482 resets, run finished after 584 ms. (steps per millisecond=17 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :2
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :1
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 5 properties.
// Phase 1: matrix 869 rows 74 cols
[2023-03-12 16:57:01] [INFO ] Computed 14 place invariants in 6 ms
[2023-03-12 16:57:01] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 16:57:01] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-12 16:57:03] [INFO ] After 1706ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 16:57:03] [INFO ] State equation strengthened by 309 read => feed constraints.
[2023-03-12 16:57:04] [INFO ] After 1385ms SMT Verify possible using 309 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 16:57:06] [INFO ] After 2709ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 1149 ms.
[2023-03-12 16:57:07] [INFO ] After 5665ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 58 ms.
Support contains 44 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 869/869 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 74 transition count 868
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 73 transition count 868
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 72 transition count 867
Free-agglomeration rule applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 72 transition count 863
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 39 place count 68 transition count 836
Applied a total of 39 rules in 143 ms. Remains 68 /74 variables (removed 6) and now considering 836/869 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 68/74 places, 836/869 transitions.
Incomplete random walk after 10000 steps, including 55 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 5) seen :2
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 836 rows 68 cols
[2023-03-12 16:57:07] [INFO ] Computed 14 place invariants in 4 ms
[2023-03-12 16:57:08] [INFO ] After 189ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 16:57:08] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-12 16:57:09] [INFO ] After 1527ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 16:57:09] [INFO ] State equation strengthened by 282 read => feed constraints.
[2023-03-12 16:57:10] [INFO ] After 1012ms SMT Verify possible using 282 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 16:57:12] [INFO ] After 2222ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1016 ms.
[2023-03-12 16:57:13] [INFO ] After 4845ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 65 ms.
Support contains 43 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 836/836 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 68 transition count 835
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 67 transition count 835
Applied a total of 2 rules in 98 ms. Remains 67 /68 variables (removed 1) and now considering 835/836 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 67/68 places, 835/836 transitions.
Incomplete random walk after 10000 steps, including 24 resets, run finished after 349 ms. (steps per millisecond=28 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 526682 steps, run timeout after 3001 ms. (steps per millisecond=175 ) properties seen :{}
Probabilistic random walk after 526682 steps, saw 77303 distinct states, run finished after 3002 ms. (steps per millisecond=175 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 835 rows 67 cols
[2023-03-12 16:57:16] [INFO ] Computed 14 place invariants in 5 ms
[2023-03-12 16:57:16] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 16:57:17] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2023-03-12 16:57:18] [INFO ] After 1199ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 16:57:18] [INFO ] State equation strengthened by 282 read => feed constraints.
[2023-03-12 16:57:19] [INFO ] After 1022ms SMT Verify possible using 282 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 16:57:20] [INFO ] After 2162ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 936 ms.
[2023-03-12 16:57:21] [INFO ] After 4377ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 61 ms.
Support contains 43 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 835/835 transitions.
Applied a total of 0 rules in 48 ms. Remains 67 /67 variables (removed 0) and now considering 835/835 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 67/67 places, 835/835 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 835/835 transitions.
Applied a total of 0 rules in 36 ms. Remains 67 /67 variables (removed 0) and now considering 835/835 (removed 0) transitions.
[2023-03-12 16:57:21] [INFO ] Invariant cache hit.
[2023-03-12 16:57:21] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-12 16:57:21] [INFO ] Invariant cache hit.
[2023-03-12 16:57:21] [INFO ] State equation strengthened by 282 read => feed constraints.
[2023-03-12 16:57:22] [INFO ] Implicit Places using invariants and state equation in 440 ms returned [63, 65]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 589 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 65/67 places, 835/835 transitions.
Applied a total of 0 rules in 52 ms. Remains 65 /65 variables (removed 0) and now considering 835/835 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 687 ms. Remains : 65/67 places, 835/835 transitions.
Incomplete random walk after 10000 steps, including 58 resets, run finished after 270 ms. (steps per millisecond=37 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 486788 steps, run timeout after 3001 ms. (steps per millisecond=162 ) properties seen :{}
Probabilistic random walk after 486788 steps, saw 71216 distinct states, run finished after 3001 ms. (steps per millisecond=162 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 835 rows 65 cols
[2023-03-12 16:57:25] [INFO ] Computed 12 place invariants in 6 ms
[2023-03-12 16:57:25] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 16:57:25] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-12 16:57:27] [INFO ] After 1267ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 16:57:27] [INFO ] State equation strengthened by 282 read => feed constraints.
[2023-03-12 16:57:28] [INFO ] After 1045ms SMT Verify possible using 282 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 16:57:29] [INFO ] After 2056ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 993 ms.
[2023-03-12 16:57:30] [INFO ] After 4378ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 153 ms.
Support contains 20 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 835/835 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 65 transition count 834
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 64 transition count 834
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 63 transition count 824
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 63 transition count 824
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 63 transition count 820
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 40 rules applied. Total rules applied 48 place count 59 transition count 784
Applied a total of 48 rules in 94 ms. Remains 59 /65 variables (removed 6) and now considering 784/835 (removed 51) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 59/65 places, 784/835 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 716739 steps, run timeout after 3001 ms. (steps per millisecond=238 ) properties seen :{}
Probabilistic random walk after 716739 steps, saw 92903 distinct states, run finished after 3001 ms. (steps per millisecond=238 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 784 rows 59 cols
[2023-03-12 16:57:33] [INFO ] Computed 12 place invariants in 4 ms
[2023-03-12 16:57:33] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-12 16:57:33] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 16:57:33] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-12 16:57:34] [INFO ] After 542ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 16:57:34] [INFO ] State equation strengthened by 237 read => feed constraints.
[2023-03-12 16:57:34] [INFO ] After 294ms SMT Verify possible using 237 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 16:57:34] [INFO ] After 617ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 308 ms.
[2023-03-12 16:57:35] [INFO ] After 1580ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 139 ms.
Support contains 20 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 784/784 transitions.
Applied a total of 0 rules in 32 ms. Remains 59 /59 variables (removed 0) and now considering 784/784 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 59/59 places, 784/784 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 784/784 transitions.
Applied a total of 0 rules in 34 ms. Remains 59 /59 variables (removed 0) and now considering 784/784 (removed 0) transitions.
[2023-03-12 16:57:35] [INFO ] Invariant cache hit.
[2023-03-12 16:57:35] [INFO ] Implicit Places using invariants in 311 ms returned []
[2023-03-12 16:57:35] [INFO ] Invariant cache hit.
[2023-03-12 16:57:36] [INFO ] State equation strengthened by 237 read => feed constraints.
[2023-03-12 16:57:36] [INFO ] Implicit Places using invariants and state equation in 623 ms returned []
Implicit Place search using SMT with State Equation took 949 ms to find 0 implicit places.
[2023-03-12 16:57:36] [INFO ] Redundant transitions in 49 ms returned []
[2023-03-12 16:57:36] [INFO ] Invariant cache hit.
[2023-03-12 16:57:36] [INFO ] Dead Transitions using invariants and state equation in 514 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1565 ms. Remains : 59/59 places, 784/784 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 59 transition count 783
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 59 transition count 782
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 58 transition count 782
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 57 transition count 781
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 57 transition count 781
Applied a total of 5 rules in 39 ms. Remains 57 /59 variables (removed 2) and now considering 781/784 (removed 3) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 781 rows 57 cols
[2023-03-12 16:57:37] [INFO ] Computed 13 place invariants in 6 ms
[2023-03-12 16:57:37] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-12 16:57:37] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 16:57:37] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-12 16:57:37] [INFO ] After 436ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 16:57:38] [INFO ] After 803ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 300 ms.
[2023-03-12 16:57:38] [INFO ] After 1204ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-12 16:57:38] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2023-03-12 16:57:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 59 places, 784 transitions and 12212 arcs took 12 ms.
[2023-03-12 16:57:38] [INFO ] Flatten gal took : 310 ms
Total runtime 57788 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/547/inv_0_ --invariant=/tmp/547/inv_1_ --inv-par
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678640505010

--------------------
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-09a-ReachabilityFireability-02
rfs formula type EF
rfs formula formula --invariant=/tmp/547/inv_0_
rfs formula name AutonomousCar-PT-09a-ReachabilityFireability-05
rfs formula type AG
rfs formula formula --invariant=/tmp/547/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 59 places, 784 transitions and 12212 arcs
pnml2lts-sym: Petri net AutonomousCar_PT_09a analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.020 real 0.010 user 0.010 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: 784->758 groups
pnml2lts-sym: Regrouping took 0.350 real 0.350 user 0.000 sys
pnml2lts-sym: state vector length is 59; there are 758 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/547/inv_1_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/547/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: all invariants violated
pnml2lts-sym: exiting now
pnml2lts-sym: invariant detection took 245.040 real 978.260 user 0.510 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-09a"
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-09a, 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-167813598200663"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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