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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
491.147 23085.00 46362.00 75.10 TTFTTTFTTTTTFTFT 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-167813598100591.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-04b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813598100591
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 5.2K Feb 25 12:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Feb 25 12:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 12:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 12:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 25 12:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 12:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 12:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:33 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 110K 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-04b-ReachabilityFireability-00
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityFireability-01
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityFireability-02
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityFireability-03
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityFireability-04
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityFireability-05
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityFireability-06
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityFireability-07
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityFireability-08
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityFireability-09
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityFireability-10
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityFireability-11
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityFireability-12
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityFireability-13
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityFireability-14
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678637582270

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-04b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 16:13:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 16:13:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 16:13:05] [INFO ] Load time of PNML (sax parser for PT used): 119 ms
[2023-03-12 16:13:05] [INFO ] Transformed 221 places.
[2023-03-12 16:13:05] [INFO ] Transformed 368 transitions.
[2023-03-12 16:13:05] [INFO ] Found NUPN structural information;
[2023-03-12 16:13:05] [INFO ] Parsed PT model containing 221 places and 368 transitions and 1658 arcs in 370 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 40 resets, run finished after 513 ms. (steps per millisecond=19 ) properties (out of 16) seen :7
FORMULA AutonomousCar-PT-04b-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-04b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-04b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-04b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-04b-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-04b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-04b-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 9) seen :1
FORMULA AutonomousCar-PT-04b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) seen :1
FORMULA AutonomousCar-PT-04b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :1
FORMULA AutonomousCar-PT-04b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :1
FORMULA AutonomousCar-PT-04b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 5 properties.
// Phase 1: matrix 368 rows 221 cols
[2023-03-12 16:13:07] [INFO ] Computed 9 place invariants in 13 ms
[2023-03-12 16:13:07] [INFO ] After 429ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 16:13:07] [INFO ] [Nat]Absence check using 9 positive place invariants in 111 ms returned sat
[2023-03-12 16:13:08] [INFO ] After 486ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :1
[2023-03-12 16:13:09] [INFO ] Deduced a trap composed of 27 places in 407 ms of which 20 ms to minimize.
[2023-03-12 16:13:09] [INFO ] Deduced a trap composed of 24 places in 246 ms of which 1 ms to minimize.
[2023-03-12 16:13:09] [INFO ] Deduced a trap composed of 26 places in 273 ms of which 1 ms to minimize.
[2023-03-12 16:13:09] [INFO ] Deduced a trap composed of 9 places in 308 ms of which 2 ms to minimize.
[2023-03-12 16:13:10] [INFO ] Deduced a trap composed of 42 places in 105 ms of which 5 ms to minimize.
[2023-03-12 16:13:10] [INFO ] Deduced a trap composed of 43 places in 104 ms of which 0 ms to minimize.
[2023-03-12 16:13:10] [INFO ] Deduced a trap composed of 20 places in 474 ms of which 1 ms to minimize.
[2023-03-12 16:13:10] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 1 ms to minimize.
[2023-03-12 16:13:11] [INFO ] Deduced a trap composed of 20 places in 275 ms of which 28 ms to minimize.
[2023-03-12 16:13:11] [INFO ] Deduced a trap composed of 14 places in 214 ms of which 1 ms to minimize.
[2023-03-12 16:13:11] [INFO ] Deduced a trap composed of 35 places in 129 ms of which 0 ms to minimize.
[2023-03-12 16:13:11] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3036 ms
[2023-03-12 16:13:11] [INFO ] After 3657ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :1
Attempting to minimize the solution found.
Minimization took 136 ms.
[2023-03-12 16:13:11] [INFO ] After 4125ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :1
FORMULA AutonomousCar-PT-04b-ReachabilityFireability-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-04b-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-04b-ReachabilityFireability-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-04b-ReachabilityFireability-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 60 out of 221 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 221/221 places, 368/368 transitions.
Graph (trivial) has 106 edges and 221 vertex of which 2 / 221 are part of one of the 1 SCC in 7 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 586 edges and 220 vertex of which 216 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 216 transition count 313
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 57 rules applied. Total rules applied 109 place count 166 transition count 306
Reduce places removed 4 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 2 with 14 rules applied. Total rules applied 123 place count 162 transition count 296
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 12 rules applied. Total rules applied 135 place count 152 transition count 294
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 136 place count 151 transition count 294
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 12 Pre rules applied. Total rules applied 136 place count 151 transition count 282
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 160 place count 139 transition count 282
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 177 place count 122 transition count 265
Iterating global reduction 5 with 17 rules applied. Total rules applied 194 place count 122 transition count 265
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 5 with 68 rules applied. Total rules applied 262 place count 122 transition count 197
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 262 place count 122 transition count 196
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 264 place count 121 transition count 196
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 284 place count 111 transition count 186
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 286 place count 110 transition count 186
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 287 place count 110 transition count 185
Free-agglomeration rule applied 5 times.
Iterating global reduction 6 with 5 rules applied. Total rules applied 292 place count 110 transition count 180
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 297 place count 105 transition count 180
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 299 place count 105 transition count 178
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 301 place count 105 transition count 178
Applied a total of 301 rules in 101 ms. Remains 105 /221 variables (removed 116) and now considering 178/368 (removed 190) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 105/221 places, 178/368 transitions.
Incomplete random walk after 10000 steps, including 56 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2235059 steps, run timeout after 3001 ms. (steps per millisecond=744 ) properties seen :{}
Probabilistic random walk after 2235059 steps, saw 369516 distinct states, run finished after 3004 ms. (steps per millisecond=744 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 178 rows 105 cols
[2023-03-12 16:13:14] [INFO ] Computed 8 place invariants in 4 ms
[2023-03-12 16:13:15] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 16:13:15] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 16:13:15] [INFO ] After 318ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 16:13:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:13:15] [INFO ] After 82ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 16:13:15] [INFO ] Deduced a trap composed of 20 places in 146 ms of which 1 ms to minimize.
[2023-03-12 16:13:15] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 1 ms to minimize.
[2023-03-12 16:13:15] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 0 ms to minimize.
[2023-03-12 16:13:16] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 1 ms to minimize.
[2023-03-12 16:13:16] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2023-03-12 16:13:16] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 617 ms
[2023-03-12 16:13:16] [INFO ] After 779ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 85 ms.
[2023-03-12 16:13:16] [INFO ] After 1267ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 60 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 178/178 transitions.
Applied a total of 0 rules in 12 ms. Remains 105 /105 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 105/105 places, 178/178 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 178/178 transitions.
Applied a total of 0 rules in 9 ms. Remains 105 /105 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2023-03-12 16:13:16] [INFO ] Invariant cache hit.
[2023-03-12 16:13:16] [INFO ] Implicit Places using invariants in 145 ms returned []
[2023-03-12 16:13:16] [INFO ] Invariant cache hit.
[2023-03-12 16:13:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:13:16] [INFO ] Implicit Places using invariants and state equation in 168 ms returned [92]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 331 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 104/105 places, 178/178 transitions.
Applied a total of 0 rules in 11 ms. Remains 104 /104 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 351 ms. Remains : 104/105 places, 178/178 transitions.
Incomplete random walk after 10000 steps, including 25 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2552317 steps, run timeout after 3001 ms. (steps per millisecond=850 ) properties seen :{}
Probabilistic random walk after 2552317 steps, saw 426016 distinct states, run finished after 3001 ms. (steps per millisecond=850 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 178 rows 104 cols
[2023-03-12 16:13:19] [INFO ] Computed 7 place invariants in 4 ms
[2023-03-12 16:13:19] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 16:13:20] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-12 16:13:20] [INFO ] After 284ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 16:13:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:13:20] [INFO ] After 130ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 16:13:20] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 1 ms to minimize.
[2023-03-12 16:13:20] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 0 ms to minimize.
[2023-03-12 16:13:21] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 1 ms to minimize.
[2023-03-12 16:13:21] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 0 ms to minimize.
[2023-03-12 16:13:21] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2023-03-12 16:13:21] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 585 ms
[2023-03-12 16:13:21] [INFO ] After 892ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 139 ms.
[2023-03-12 16:13:21] [INFO ] After 1479ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 60 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 178/178 transitions.
Applied a total of 0 rules in 6 ms. Remains 104 /104 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 104/104 places, 178/178 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 178/178 transitions.
Applied a total of 0 rules in 6 ms. Remains 104 /104 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2023-03-12 16:13:21] [INFO ] Invariant cache hit.
[2023-03-12 16:13:21] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-12 16:13:21] [INFO ] Invariant cache hit.
[2023-03-12 16:13:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:13:21] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2023-03-12 16:13:21] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-12 16:13:21] [INFO ] Invariant cache hit.
[2023-03-12 16:13:21] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 300 ms. Remains : 104/104 places, 178/178 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 104 transition count 178
Applied a total of 1 rules in 7 ms. Remains 104 /104 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 178 rows 104 cols
[2023-03-12 16:13:21] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 16:13:21] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 16:13:21] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-12 16:13:21] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 16:13:22] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 1 ms to minimize.
[2023-03-12 16:13:22] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 1 ms to minimize.
[2023-03-12 16:13:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 252 ms
[2023-03-12 16:13:22] [INFO ] After 439ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 119 ms.
[2023-03-12 16:13:22] [INFO ] After 601ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-12 16:13:22] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2023-03-12 16:13:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 104 places, 178 transitions and 902 arcs took 2 ms.
[2023-03-12 16:13:22] [INFO ] Flatten gal took : 53 ms
Total runtime 17245 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/587/inv_0_ --inv-par
FORMULA AutonomousCar-PT-04b-ReachabilityFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678637605355

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-04b-ReachabilityFireability-05
rfs formula type EF
rfs formula formula --invariant=/tmp/587/inv_0_
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 104 places, 178 transitions and 902 arcs
pnml2lts-sym: Petri net AutonomousCar_PT_04b 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: 178->163 groups
pnml2lts-sym: Regrouping took 0.020 real 0.020 user 0.000 sys
pnml2lts-sym: state vector length is 104; there are 163 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:
pnml2lts-sym: Invariant violation (/tmp/587/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: all invariants violated
pnml2lts-sym: exiting now
pnml2lts-sym: invariant detection took 1.900 real 7.590 user 0.000 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-04b"
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-04b, 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-167813598100591"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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