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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 6.6K Feb 25 12:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 25 12:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 12:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 25 12:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K 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 18K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Feb 25 12:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Feb 25 12:57 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 334K 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-07b-ReachabilityFireability-00
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityFireability-01
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityFireability-02
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityFireability-03
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityFireability-04
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityFireability-05
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityFireability-06
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityFireability-07
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityFireability-08
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityFireability-09
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityFireability-10
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityFireability-11
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityFireability-12
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityFireability-13
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityFireability-14
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678740662364

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-07b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 20:51:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 20:51:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 20:51:04] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2023-03-13 20:51:04] [INFO ] Transformed 323 places.
[2023-03-13 20:51:04] [INFO ] Transformed 846 transitions.
[2023-03-13 20:51:04] [INFO ] Found NUPN structural information;
[2023-03-13 20:51:04] [INFO ] Parsed PT model containing 323 places and 846 transitions and 5865 arcs in 173 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 12 resets, run finished after 369 ms. (steps per millisecond=27 ) properties (out of 16) seen :3
FORMULA AutonomousCar-PT-07b-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 13) seen :1
FORMULA AutonomousCar-PT-07b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 846 rows 323 cols
[2023-03-13 20:51:06] [INFO ] Computed 12 place invariants in 14 ms
[2023-03-13 20:51:07] [INFO ] After 488ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-13 20:51:07] [INFO ] [Nat]Absence check using 12 positive place invariants in 9 ms returned sat
[2023-03-13 20:51:10] [INFO ] After 2242ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :9
[2023-03-13 20:51:10] [INFO ] Deduced a trap composed of 22 places in 186 ms of which 10 ms to minimize.
[2023-03-13 20:51:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 299 ms
[2023-03-13 20:51:11] [INFO ] Deduced a trap composed of 36 places in 238 ms of which 14 ms to minimize.
[2023-03-13 20:51:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 325 ms
[2023-03-13 20:51:11] [INFO ] Deduced a trap composed of 35 places in 247 ms of which 1 ms to minimize.
[2023-03-13 20:51:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 308 ms
[2023-03-13 20:51:13] [INFO ] After 5473ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :9
Attempting to minimize the solution found.
Minimization took 1925 ms.
[2023-03-13 20:51:15] [INFO ] After 7738ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :9
FORMULA AutonomousCar-PT-07b-ReachabilityFireability-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-07b-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-07b-ReachabilityFireability-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 115 ms.
Support contains 89 out of 323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 323/323 places, 846/846 transitions.
Graph (trivial) has 163 edges and 323 vertex of which 2 / 323 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1183 edges and 322 vertex of which 319 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 73 rules applied. Total rules applied 75 place count 319 transition count 769
Reduce places removed 72 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 83 rules applied. Total rules applied 158 place count 247 transition count 758
Reduce places removed 5 places and 0 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 2 with 20 rules applied. Total rules applied 178 place count 242 transition count 743
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 18 rules applied. Total rules applied 196 place count 227 transition count 740
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 197 place count 226 transition count 740
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 25 Pre rules applied. Total rules applied 197 place count 226 transition count 715
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 247 place count 201 transition count 715
Discarding 22 places :
Symmetric choice reduction at 5 with 22 rule applications. Total rules 269 place count 179 transition count 693
Iterating global reduction 5 with 22 rules applied. Total rules applied 291 place count 179 transition count 693
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 294 place count 179 transition count 690
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 294 place count 179 transition count 688
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 298 place count 177 transition count 688
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 299 place count 176 transition count 687
Iterating global reduction 6 with 1 rules applied. Total rules applied 300 place count 176 transition count 687
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 334 place count 159 transition count 670
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 338 place count 159 transition count 666
Free-agglomeration rule applied 11 times.
Iterating global reduction 6 with 11 rules applied. Total rules applied 349 place count 159 transition count 655
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 360 place count 148 transition count 655
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 361 place count 148 transition count 654
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 362 place count 148 transition count 654
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 363 place count 147 transition count 653
Applied a total of 363 rules in 256 ms. Remains 147 /323 variables (removed 176) and now considering 653/846 (removed 193) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 256 ms. Remains : 147/323 places, 653/846 transitions.
Incomplete random walk after 10000 steps, including 200 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 569729 steps, run timeout after 3001 ms. (steps per millisecond=189 ) properties seen :{}
Probabilistic random walk after 569729 steps, saw 77898 distinct states, run finished after 3006 ms. (steps per millisecond=189 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 653 rows 147 cols
[2023-03-13 20:51:19] [INFO ] Computed 12 place invariants in 5 ms
[2023-03-13 20:51:19] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-13 20:51:19] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-13 20:51:21] [INFO ] After 1559ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-13 20:51:21] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 1 ms to minimize.
[2023-03-13 20:51:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2023-03-13 20:51:21] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 1 ms to minimize.
[2023-03-13 20:51:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2023-03-13 20:51:22] [INFO ] Deduced a trap composed of 17 places in 203 ms of which 1 ms to minimize.
[2023-03-13 20:51:23] [INFO ] Deduced a trap composed of 15 places in 184 ms of which 1 ms to minimize.
[2023-03-13 20:51:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 451 ms
[2023-03-13 20:51:23] [INFO ] Deduced a trap composed of 13 places in 225 ms of which 0 ms to minimize.
[2023-03-13 20:51:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 271 ms
[2023-03-13 20:51:24] [INFO ] After 4576ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 1522 ms.
[2023-03-13 20:51:25] [INFO ] After 6268ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 78 ms.
Support contains 89 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 653/653 transitions.
Applied a total of 0 rules in 16 ms. Remains 147 /147 variables (removed 0) and now considering 653/653 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 147/147 places, 653/653 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 653/653 transitions.
Applied a total of 0 rules in 24 ms. Remains 147 /147 variables (removed 0) and now considering 653/653 (removed 0) transitions.
[2023-03-13 20:51:26] [INFO ] Invariant cache hit.
[2023-03-13 20:51:26] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-13 20:51:26] [INFO ] Invariant cache hit.
[2023-03-13 20:51:26] [INFO ] Implicit Places using invariants and state equation in 639 ms returned [143]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 716 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 146/147 places, 653/653 transitions.
Applied a total of 0 rules in 29 ms. Remains 146 /146 variables (removed 0) and now considering 653/653 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 790 ms. Remains : 146/147 places, 653/653 transitions.
Incomplete random walk after 10000 steps, including 190 resets, run finished after 342 ms. (steps per millisecond=29 ) properties (out of 9) seen :1
FORMULA AutonomousCar-PT-07b-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 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 26 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 653 rows 146 cols
[2023-03-13 20:51:27] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-13 20:51:27] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-13 20:51:27] [INFO ] [Nat]Absence check using 11 positive place invariants in 39 ms returned sat
[2023-03-13 20:51:29] [INFO ] After 1402ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-13 20:51:29] [INFO ] Deduced a trap composed of 18 places in 236 ms of which 3 ms to minimize.
[2023-03-13 20:51:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 308 ms
[2023-03-13 20:51:30] [INFO ] Deduced a trap composed of 19 places in 266 ms of which 1 ms to minimize.
[2023-03-13 20:51:31] [INFO ] Deduced a trap composed of 17 places in 262 ms of which 10 ms to minimize.
[2023-03-13 20:51:31] [INFO ] Deduced a trap composed of 20 places in 250 ms of which 1 ms to minimize.
[2023-03-13 20:51:31] [INFO ] Deduced a trap composed of 12 places in 198 ms of which 0 ms to minimize.
[2023-03-13 20:51:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1144 ms
[2023-03-13 20:51:32] [INFO ] Deduced a trap composed of 21 places in 226 ms of which 5 ms to minimize.
[2023-03-13 20:51:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 292 ms
[2023-03-13 20:51:32] [INFO ] After 4563ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1526 ms.
[2023-03-13 20:51:33] [INFO ] After 6282ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 61 ms.
Support contains 74 out of 146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 653/653 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 146 transition count 644
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 19 place count 137 transition count 643
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 21 place count 136 transition count 642
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 21 place count 136 transition count 640
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 25 place count 134 transition count 640
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 28 place count 131 transition count 637
Iterating global reduction 3 with 3 rules applied. Total rules applied 31 place count 131 transition count 637
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 3 with 196 rules applied. Total rules applied 227 place count 131 transition count 441
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 4 with 6 rules applied. Total rules applied 233 place count 128 transition count 438
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 234 place count 128 transition count 437
Free-agglomeration rule applied 7 times.
Iterating global reduction 5 with 7 rules applied. Total rules applied 241 place count 128 transition count 430
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 248 place count 121 transition count 430
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 251 place count 121 transition count 430
Applied a total of 251 rules in 48 ms. Remains 121 /146 variables (removed 25) and now considering 430/653 (removed 223) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 121/146 places, 430/653 transitions.
Incomplete random walk after 10000 steps, including 72 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 430286 steps, run timeout after 3001 ms. (steps per millisecond=143 ) properties seen :{}
Probabilistic random walk after 430286 steps, saw 60263 distinct states, run finished after 3002 ms. (steps per millisecond=143 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 430 rows 121 cols
[2023-03-13 20:51:37] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-13 20:51:37] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-13 20:51:37] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-13 20:51:38] [INFO ] After 754ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-13 20:51:39] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 0 ms to minimize.
[2023-03-13 20:51:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2023-03-13 20:51:39] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2023-03-13 20:51:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2023-03-13 20:51:39] [INFO ] Deduced a trap composed of 14 places in 227 ms of which 1 ms to minimize.
[2023-03-13 20:51:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 251 ms
[2023-03-13 20:51:40] [INFO ] After 2014ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 786 ms.
[2023-03-13 20:51:40] [INFO ] After 2907ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 80 ms.
Support contains 74 out of 121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 430/430 transitions.
Applied a total of 0 rules in 9 ms. Remains 121 /121 variables (removed 0) and now considering 430/430 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 121/121 places, 430/430 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 430/430 transitions.
Applied a total of 0 rules in 8 ms. Remains 121 /121 variables (removed 0) and now considering 430/430 (removed 0) transitions.
[2023-03-13 20:51:40] [INFO ] Invariant cache hit.
[2023-03-13 20:51:40] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-13 20:51:41] [INFO ] Invariant cache hit.
[2023-03-13 20:51:41] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
[2023-03-13 20:51:41] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-13 20:51:41] [INFO ] Invariant cache hit.
[2023-03-13 20:51:41] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 513 ms. Remains : 121/121 places, 430/430 transitions.
Applied a total of 0 rules in 9 ms. Remains 121 /121 variables (removed 0) and now considering 430/430 (removed 0) transitions.
Running SMT prover for 8 properties.
[2023-03-13 20:51:41] [INFO ] Invariant cache hit.
[2023-03-13 20:51:41] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-13 20:51:41] [INFO ] [Nat]Absence check using 11 positive place invariants in 62 ms returned sat
[2023-03-13 20:51:42] [INFO ] After 840ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-13 20:51:43] [INFO ] Deduced a trap composed of 10 places in 224 ms of which 1 ms to minimize.
[2023-03-13 20:51:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 282 ms
[2023-03-13 20:51:43] [INFO ] Deduced a trap composed of 7 places in 206 ms of which 1 ms to minimize.
[2023-03-13 20:51:43] [INFO ] Deduced a trap composed of 14 places in 222 ms of which 0 ms to minimize.
[2023-03-13 20:51:44] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 1 ms to minimize.
[2023-03-13 20:51:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 697 ms
[2023-03-13 20:51:44] [INFO ] Deduced a trap composed of 9 places in 192 ms of which 0 ms to minimize.
[2023-03-13 20:51:44] [INFO ] Deduced a trap composed of 7 places in 194 ms of which 1 ms to minimize.
[2023-03-13 20:51:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 493 ms
[2023-03-13 20:51:45] [INFO ] After 3235ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 765 ms.
[2023-03-13 20:51:45] [INFO ] After 4195ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
[2023-03-13 20:51:45] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2023-03-13 20:51:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 121 places, 430 transitions and 3849 arcs took 4 ms.
[2023-03-13 20:51:46] [INFO ] Flatten gal took : 102 ms
Total runtime 41706 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running AutonomousCar (PT), instance 07b
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: 121 places, 430 transitions, 3849 arcs.
Final Score: 3438.749
Took : 66 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1678740773364

--------------------
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 4411:
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-07b"
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-07b, 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-167813600500639"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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