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.r011-oct2-167813600500623.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 smartxred
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 r011-oct2-167813600500623
=====================================================================

--------------------
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 1678740508349

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=smartxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-06b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 20:48:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 20:48:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 20:48:30] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2023-03-13 20:48:30] [INFO ] Transformed 289 places.
[2023-03-13 20:48:30] [INFO ] Transformed 644 transitions.
[2023-03-13 20:48:30] [INFO ] Found NUPN structural information;
[2023-03-13 20:48:30] [INFO ] Parsed PT model containing 289 places and 644 transitions and 3812 arcs in 158 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 101 resets, run finished after 395 ms. (steps per millisecond=25 ) properties (out of 16) seen :9
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-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) seen :1
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :1
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :1
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :1
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 3 properties.
// Phase 1: matrix 644 rows 289 cols
[2023-03-13 20:48:31] [INFO ] Computed 11 place invariants in 27 ms
[2023-03-13 20:48:32] [INFO ] After 436ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 20:48:32] [INFO ] [Nat]Absence check using 11 positive place invariants in 49 ms returned sat
[2023-03-13 20:48:33] [INFO ] After 933ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 20:48:34] [INFO ] Deduced a trap composed of 45 places in 452 ms of which 8 ms to minimize.
[2023-03-13 20:48:34] [INFO ] Deduced a trap composed of 35 places in 421 ms of which 3 ms to minimize.
[2023-03-13 20:48:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1013 ms
[2023-03-13 20:48:35] [INFO ] Deduced a trap composed of 35 places in 317 ms of which 2 ms to minimize.
[2023-03-13 20:48:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 346 ms
[2023-03-13 20:48:35] [INFO ] After 2952ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 465 ms.
[2023-03-13 20:48:36] [INFO ] After 3709ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 37 ms.
Support contains 63 out of 289 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 289/289 places, 644/644 transitions.
Graph (trivial) has 169 edges and 289 vertex of which 4 / 289 are part of one of the 2 SCC in 5 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 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 83 place count 282 transition count 556
Reduce places removed 81 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 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 1 with 103 rules applied. Total rules applied 186 place count 201 transition count 534
Reduce places removed 12 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 2 with 23 rules applied. Total rules applied 209 place count 189 transition count 523
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 222 place count 178 transition count 521
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 15 Pre rules applied. Total rules applied 222 place count 178 transition count 506
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 252 place count 163 transition count 506
Discarding 26 places :
Symmetric choice reduction at 4 with 26 rule applications. Total rules 278 place count 137 transition count 480
Iterating global reduction 4 with 26 rules applied. Total rules applied 304 place count 137 transition count 480
Ensure Unique test removed 147 transitions
Reduce isomorphic transitions removed 147 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 4 with 148 rules applied. Total rules applied 452 place count 137 transition count 332
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 454 place count 136 transition count 331
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 455 place count 135 transition count 331
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 455 place count 135 transition count 330
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 457 place count 134 transition count 330
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 458 place count 133 transition count 329
Iterating global reduction 7 with 1 rules applied. Total rules applied 459 place count 133 transition count 329
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 485 place count 120 transition count 316
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 486 place count 120 transition count 315
Free-agglomeration rule applied 14 times.
Iterating global reduction 7 with 14 rules applied. Total rules applied 500 place count 120 transition count 301
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 514 place count 106 transition count 301
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 516 place count 106 transition count 301
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 517 place count 105 transition count 300
Applied a total of 517 rules in 157 ms. Remains 105 /289 variables (removed 184) and now considering 300/644 (removed 344) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 105/289 places, 300/644 transitions.
Incomplete random walk after 10000 steps, including 239 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1152119 steps, run timeout after 3001 ms. (steps per millisecond=383 ) properties seen :{}
Probabilistic random walk after 1152119 steps, saw 182087 distinct states, run finished after 3004 ms. (steps per millisecond=383 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 300 rows 105 cols
[2023-03-13 20:48:39] [INFO ] Computed 9 place invariants in 6 ms
[2023-03-13 20:48:39] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 20:48:39] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-13 20:48:40] [INFO ] After 386ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 20:48:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 20:48:40] [INFO ] After 300ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 20:48:40] [INFO ] After 608ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 275 ms.
[2023-03-13 20:48:40] [INFO ] After 1347ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 63 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 300/300 transitions.
Applied a total of 0 rules in 35 ms. Remains 105 /105 variables (removed 0) and now considering 300/300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 105/105 places, 300/300 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 300/300 transitions.
Applied a total of 0 rules in 7 ms. Remains 105 /105 variables (removed 0) and now considering 300/300 (removed 0) transitions.
[2023-03-13 20:48:40] [INFO ] Invariant cache hit.
[2023-03-13 20:48:41] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-13 20:48:41] [INFO ] Invariant cache hit.
[2023-03-13 20:48:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 20:48:41] [INFO ] Implicit Places using invariants and state equation in 109 ms returned [102]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 190 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 104/105 places, 300/300 transitions.
Applied a total of 0 rules in 9 ms. Remains 104 /104 variables (removed 0) and now considering 300/300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 219 ms. Remains : 104/105 places, 300/300 transitions.
Incomplete random walk after 10000 steps, including 237 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :1
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 300 rows 104 cols
[2023-03-13 20:48:41] [INFO ] Computed 9 place invariants in 3 ms
[2023-03-13 20:48:41] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 20:48:41] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-13 20:48:41] [INFO ] After 155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 20:48:41] [INFO ] After 304ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 147 ms.
[2023-03-13 20:48:41] [INFO ] After 520ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 47 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 300/300 transitions.
Graph (complete) has 644 edges and 104 vertex of which 103 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 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 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 103 transition count 295
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 100 transition count 295
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 8 place count 100 transition count 293
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 98 transition count 293
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 97 transition count 292
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 97 transition count 292
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 20 place count 94 transition count 289
Free-agglomeration rule applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 28 place count 94 transition count 281
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 36 place count 86 transition count 281
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 39 place count 86 transition count 281
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 40 place count 85 transition count 280
Applied a total of 40 rules in 85 ms. Remains 85 /104 variables (removed 19) and now considering 280/300 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 85/104 places, 280/300 transitions.
Incomplete random walk after 10000 steps, including 293 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2472976 steps, run timeout after 3001 ms. (steps per millisecond=824 ) properties seen :{}
Probabilistic random walk after 2472976 steps, saw 362850 distinct states, run finished after 3001 ms. (steps per millisecond=824 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 280 rows 85 cols
[2023-03-13 20:48:45] [INFO ] Computed 10 place invariants in 5 ms
[2023-03-13 20:48:45] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 20:48:45] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-13 20:48:45] [INFO ] After 272ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 20:48:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 20:48:45] [INFO ] After 161ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 20:48:46] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 1 ms to minimize.
[2023-03-13 20:48:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2023-03-13 20:48:46] [INFO ] After 528ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 190 ms.
[2023-03-13 20:48:46] [INFO ] After 1128ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 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 5 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 5 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 5 ms. Remains 85 /85 variables (removed 0) and now considering 280/280 (removed 0) transitions.
[2023-03-13 20:48:46] [INFO ] Invariant cache hit.
[2023-03-13 20:48:46] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-13 20:48:46] [INFO ] Invariant cache hit.
[2023-03-13 20:48:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 20:48:46] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
[2023-03-13 20:48:46] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-13 20:48:46] [INFO ] Invariant cache hit.
[2023-03-13 20:48:46] [INFO ] Dead Transitions using invariants and state equation in 247 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 591 ms. Remains : 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.
Running SMT prover for 1 properties.
[2023-03-13 20:48:46] [INFO ] Invariant cache hit.
[2023-03-13 20:48:47] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 20:48:47] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-13 20:48:48] [INFO ] After 929ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 20:48:48] [INFO ] After 1066ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 177 ms.
[2023-03-13 20:48:48] [INFO ] After 1328ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-13 20:48:48] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2023-03-13 20:48:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 85 places, 280 transitions and 2213 arcs took 8 ms.
[2023-03-13 20:48:48] [INFO ] Flatten gal took : 121 ms
Total runtime 18235 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running AutonomousCar (PT), instance 06b
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 85 places, 280 transitions, 2213 arcs.
Final Score: 2573.003
Took : 41 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1678740570625

--------------------
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
ERROR in file model.sm near line 2590:
syntax error

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="smartxred"
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 smartxred"
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 r011-oct2-167813600500623"
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 ;