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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 6.5K Feb 25 12:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 12:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 12:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 12:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 15:33 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:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Feb 25 12:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 12:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K 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 159K 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-05b-ReachabilityCardinality-00
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-01
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-02
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-03
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-04
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-05
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-06
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-07
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-08
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-09
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-10
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-11
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-12
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-13
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-14
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678740374355

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-05b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 20:46:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 20:46:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 20:46:16] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2023-03-13 20:46:16] [INFO ] Transformed 255 places.
[2023-03-13 20:46:16] [INFO ] Transformed 490 transitions.
[2023-03-13 20:46:16] [INFO ] Found NUPN structural information;
[2023-03-13 20:46:16] [INFO ] Parsed PT model containing 255 places and 490 transitions and 2527 arcs in 161 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 5 resets, run finished after 313 ms. (steps per millisecond=31 ) properties (out of 12) seen :6
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 6) seen :1
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 490 rows 255 cols
[2023-03-13 20:46:17] [INFO ] Computed 10 place invariants in 20 ms
[2023-03-13 20:46:18] [INFO ] After 558ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 20:46:18] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-13 20:46:19] [INFO ] After 287ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2023-03-13 20:46:19] [INFO ] Deduced a trap composed of 7 places in 318 ms of which 7 ms to minimize.
[2023-03-13 20:46:19] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 1 ms to minimize.
[2023-03-13 20:46:19] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 1 ms to minimize.
[2023-03-13 20:46:19] [INFO ] Deduced a trap composed of 35 places in 102 ms of which 1 ms to minimize.
[2023-03-13 20:46:19] [INFO ] Deduced a trap composed of 47 places in 166 ms of which 3 ms to minimize.
[2023-03-13 20:46:20] [INFO ] Deduced a trap composed of 30 places in 229 ms of which 0 ms to minimize.
[2023-03-13 20:46:20] [INFO ] Deduced a trap composed of 46 places in 90 ms of which 1 ms to minimize.
[2023-03-13 20:46:20] [INFO ] Deduced a trap composed of 43 places in 128 ms of which 14 ms to minimize.
[2023-03-13 20:46:20] [INFO ] Deduced a trap composed of 45 places in 71 ms of which 0 ms to minimize.
[2023-03-13 20:46:20] [INFO ] Deduced a trap composed of 46 places in 90 ms of which 2 ms to minimize.
[2023-03-13 20:46:20] [INFO ] Deduced a trap composed of 45 places in 122 ms of which 1 ms to minimize.
[2023-03-13 20:46:20] [INFO ] Deduced a trap composed of 46 places in 90 ms of which 0 ms to minimize.
[2023-03-13 20:46:20] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1898 ms
[2023-03-13 20:46:21] [INFO ] Deduced a trap composed of 44 places in 134 ms of which 1 ms to minimize.
[2023-03-13 20:46:21] [INFO ] Deduced a trap composed of 43 places in 125 ms of which 1 ms to minimize.
[2023-03-13 20:46:21] [INFO ] Deduced a trap composed of 45 places in 102 ms of which 1 ms to minimize.
[2023-03-13 20:46:21] [INFO ] Deduced a trap composed of 45 places in 132 ms of which 0 ms to minimize.
[2023-03-13 20:46:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 574 ms
[2023-03-13 20:46:21] [INFO ] After 3047ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :2
Attempting to minimize the solution found.
Minimization took 140 ms.
[2023-03-13 20:46:21] [INFO ] After 3354ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :2
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 31 ms.
Support contains 49 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 490/490 transitions.
Graph (trivial) has 154 edges and 255 vertex of which 4 / 255 are part of one of the 2 SCC in 6 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 759 edges and 253 vertex of which 248 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.15 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 59 rules applied. Total rules applied 61 place count 248 transition count 424
Reduce places removed 58 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 67 rules applied. Total rules applied 128 place count 190 transition count 415
Reduce places removed 5 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 2 with 18 rules applied. Total rules applied 146 place count 185 transition count 402
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 159 place count 172 transition count 402
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 159 place count 172 transition count 389
Deduced a syphon composed of 13 places in 3 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 185 place count 159 transition count 389
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 200 place count 144 transition count 374
Iterating global reduction 4 with 15 rules applied. Total rules applied 215 place count 144 transition count 374
Ensure Unique test removed 101 transitions
Reduce isomorphic transitions removed 101 transitions.
Iterating post reduction 4 with 101 rules applied. Total rules applied 316 place count 144 transition count 273
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 316 place count 144 transition count 271
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 320 place count 142 transition count 271
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 322 place count 140 transition count 261
Iterating global reduction 5 with 2 rules applied. Total rules applied 324 place count 140 transition count 261
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 360 place count 122 transition count 243
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 361 place count 121 transition count 237
Iterating global reduction 5 with 1 rules applied. Total rules applied 362 place count 121 transition count 237
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 366 place count 119 transition count 237
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 369 place count 119 transition count 234
Free-agglomeration rule applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 375 place count 119 transition count 228
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 381 place count 113 transition count 228
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 384 place count 113 transition count 225
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 386 place count 113 transition count 225
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 387 place count 112 transition count 219
Iterating global reduction 6 with 1 rules applied. Total rules applied 388 place count 112 transition count 219
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 389 place count 112 transition count 219
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 390 place count 111 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 391 place count 110 transition count 218
Applied a total of 391 rules in 230 ms. Remains 110 /255 variables (removed 145) and now considering 218/490 (removed 272) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 230 ms. Remains : 110/255 places, 218/490 transitions.
Incomplete random walk after 10000 steps, including 231 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :1
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 218 rows 110 cols
[2023-03-13 20:46:22] [INFO ] Computed 8 place invariants in 6 ms
[2023-03-13 20:46:22] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 20:46:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 20:46:22] [INFO ] After 150ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 20:46:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 20:46:22] [INFO ] After 16ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 20:46:22] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 0 ms to minimize.
[2023-03-13 20:46:22] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 0 ms to minimize.
[2023-03-13 20:46:22] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 0 ms to minimize.
[2023-03-13 20:46:23] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
[2023-03-13 20:46:23] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 313 ms
[2023-03-13 20:46:23] [INFO ] After 358ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-13 20:46:23] [INFO ] After 592ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 18 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 218/218 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 110 transition count 203
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 19 rules applied. Total rules applied 34 place count 95 transition count 199
Reduce places removed 2 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 2 with 4 rules applied. Total rules applied 38 place count 93 transition count 197
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 39 place count 92 transition count 197
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 39 place count 92 transition count 191
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 51 place count 86 transition count 191
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 53 place count 84 transition count 185
Iterating global reduction 4 with 2 rules applied. Total rules applied 55 place count 84 transition count 185
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 56 place count 84 transition count 184
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 76 place count 74 transition count 174
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 78 place count 72 transition count 167
Iterating global reduction 5 with 2 rules applied. Total rules applied 80 place count 72 transition count 167
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 81 place count 72 transition count 166
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 82 place count 72 transition count 165
Free-agglomeration rule applied 10 times.
Iterating global reduction 6 with 10 rules applied. Total rules applied 92 place count 72 transition count 155
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 102 place count 62 transition count 155
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 104 place count 62 transition count 153
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 105 place count 61 transition count 152
Applied a total of 105 rules in 52 ms. Remains 61 /110 variables (removed 49) and now considering 152/218 (removed 66) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 61/110 places, 152/218 transitions.
Incomplete random walk after 10000 steps, including 312 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 72162 steps, run visited all 1 properties in 254 ms. (steps per millisecond=284 )
Probabilistic random walk after 72162 steps, saw 13650 distinct states, run finished after 254 ms. (steps per millisecond=284 ) properties seen :1
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 6674 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running AutonomousCar (PT), instance 05b
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 255 places, 490 transitions, 2527 arcs.
Final Score: 7238.658
Took : 41 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: AutonomousCar-PT-05b-ReachabilityCardinality-00 (reachable &!potential( ( (tk(P13)) <= ( 1 ) )))
PROPERTY: AutonomousCar-PT-05b-ReachabilityCardinality-01 (reachable &!potential( ( ( (! ( (tk(P237)) <= (tk(P92)) )) | (! ( ( ( 1 ) <= (tk(P14)) ) & (! ( ( ( (tk(P242)) <= (tk(P248)) ) & ( (tk(P78)) <= ( 0 ) ) ) & (! ( ( (tk(P240)) <= (tk(P105)) ) | ( (tk(P73)) <= (tk(P162)) ) )) )) )) ) | ( ( 1 ) <= (tk(P108)) ) )))
PROPERTY: AutonomousCar-PT-05b-ReachabilityCardinality-02 (reachable &!potential( (! ( ( 1 ) <= (tk(P82)) ))))
PROPERTY: AutonomousCar-PT-05b-ReachabilityCardinality-03 (reachable & potential((! ( (! ( ( ( (! ( (tk(P50)) <= ( 0 ) )) | ( (tk(P40)) <= ( 0 ) ) ) & ( ( ( ( 1 ) <= (tk(P201)) ) | ( ( (tk(P89)) <= (tk(P173)) ) & ( (tk(P49)) <= ( 0 ) ) ) ) & (! ( (tk(P155)) <= (tk(P2)) )) ) ) & (! ( (tk(P232)) <= (tk(P59)) )) )) | ( ( (tk(P73)) <= ( 1 ) ) | ( ( ( ( ( ( ( ( 1 ) <= (tk(P184)) ) | ( ( 1 ) <= (tk(P22)) ) ) & ( ( ( 1 ) <= (tk(P19)) ) | ( ( 1 ) <= (tk(P10)) ) ) ) & ( (tk(P140)) <= ( 0 ) ) ) & ( (! ( (tk(P36)) <= ( 0 ) )) | ( ( ( (tk(P193)) <= (tk(P17)) ) & ( (tk(P121)) <= (tk(P245)) ) ) | ( (tk(P178)) <= ( 1 ) ) ) ) ) & ( ( ( ( 1 ) <= (tk(P175)) ) | (! ( ( 1 ) <= (tk(P175)) )) ) | ( (tk(P89)) <= (tk(P216)) ) ) ) & ( ( ( ( (tk(P87)) <= ( 1 ) ) | ( (tk(P138)) <= ( 0 ) ) ) | ( ( ( 1 ) <= (tk(P80)) ) & ( (tk(P233)) <= (tk(P161)) ) ) ) & (! ( (! ( (tk(P172)) <= ( 1 ) )) & ( (! ( (tk(P116)) <= ( 1 ) )) & ( ( ( 1 ) <= (tk(P158)) ) & ( ( 1 ) <= (tk(P236)) ) ) ) )) ) ) ) ))))
PROPERTY: AutonomousCar-PT-05b-ReachabilityCardinality-04 (reachable &!potential( (! ( ( 1 ) <= (tk(P79)) ))))
PROPERTY: AutonomousCar-PT-05b-ReachabilityCardinality-05 (reachable &!potential( ( ( (! ( (tk(P71)) <= (tk(P58)) )) | ( (! ( (! ( (tk(P97)) <= ( 1 ) )) & (! ( ( ( 1 ) <= (tk(P97)) ) | ( ( ( ( 1 ) <= (tk(P211)) ) | ( (tk(P80)) <= (tk(P252)) ) ) & ( ( 1 ) <= (tk(P149)) ) ) )) )) & ( ( 1 ) <= (tk(P116)) ) ) ) | (! ( (! ( ( (tk(P196)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P124)) ) )) & ( ( ( (! ( ( (tk(P236)) <= ( 0 ) ) & (! ( (tk(P76)) <= ( 0 ) )) )) | (! ( (tk(P176)) <= (tk(P18)) )) ) & ( ( ( 1 ) <= (tk(P220)) ) & ( ( (tk(P31)) <= (tk(P141)) ) & ( ( ( ( 1 ) <= (tk(P225)) ) & ( (tk(P71)) <= ( 0 ) ) ) & (! ( (tk(P36)) <= ( 0 ) )) ) ) ) ) & (! ( ( (! ( ( ( 1 ) <= (tk(P210)) ) & ( (tk(P114)) <= (tk(P168)) ) )) & ( (! ( (tk(P227)) <= (tk(P206)) )) | ( ( (tk(P178)) <= ( 1 ) ) & ( (tk(P86)) <= (tk(P229)) ) ) ) ) | ( ( (tk(P244)) <= (tk(P105)) ) & (! ( ( 1 ) <= (tk(P59)) )) ) )) ) )) )))
PROPERTY: AutonomousCar-PT-05b-ReachabilityCardinality-06 (reachable &!potential( (! ( ( ( 1 ) <= (tk(P162)) ) | ( ( ( (tk(P182)) <= ( 1 ) ) | ( (! ( ( 1 ) <= (tk(P24)) )) & ( (! ( ( (tk(P148)) <= (tk(P154)) ) | ( (tk(P184)) <= (tk(P73)) ) )) | (! ( ( (tk(P172)) <= (tk(P78)) ) & ( (tk(P167)) <= ( 1 ) ) )) ) ) ) & (! ( (tk(P87)) <= (tk(P157)) )) ) ))))
PROPERTY: AutonomousCar-PT-05b-ReachabilityCardinality-07 (reachable &!potential( ( (! ( (! ( ( ( ( (! ( (tk(P215)) <= ( 0 ) )) | (! ( (tk(P104)) <= (tk(P124)) )) ) & ( (tk(P114)) <= ( 0 ) ) ) | ( ( ( (tk(P184)) <= ( 1 ) ) | ( ( ( 1 ) <= (tk(P179)) ) & ( (tk(P74)) <= (tk(P208)) ) ) ) & ( (tk(P104)) <= ( 0 ) ) ) ) & ( ( ( 1 ) <= (tk(P95)) ) | ( (! ( ( (tk(P48)) <= (tk(P115)) ) & ( (tk(P145)) <= (tk(P215)) ) )) & ( (tk(P160)) <= (tk(P171)) ) ) ) )) & (! ( ( ( 1 ) <= (tk(P83)) ) | (! ( ( ( 1 ) <= (tk(P178)) ) & ( ( 1 ) <= (tk(P122)) ) )) )) )) & ( (! ( ( ( ( ( 1 ) <= (tk(P13)) ) | ( ( 1 ) <= (tk(P233)) ) ) & ( ( (! ( ( (tk(P15)) <= ( 1 ) ) & ( (tk(P203)) <= (tk(P157)) ) )) | ( (! ( (tk(P136)) <= ( 1 ) )) & ( ( (tk(P91)) <= (tk(P86)) ) & ( ( 1 ) <= (tk(P93)) ) ) ) ) | ( ( (! ( (tk(P127)) <= (tk(P222)) )) | ( ( (tk(P164)) <= (tk(P223)) ) | ( ( 1 ) <= (tk(P231)) ) ) ) & ( (tk(P251)) <= ( 1 ) ) ) ) ) | (! ( (tk(P21)) <= (tk(P16)) )) )) | ( (tk(P49)) <= (tk(P126)) ) ) )))
PROPERTY: AutonomousCar-PT-05b-ReachabilityCardinality-08 (reachable & potential(( ( 1 ) <= (tk(P53)) )))
PROPERTY: AutonomousCar-PT-05b-ReachabilityCardinality-09 (reachable &!potential( ( (! ( ( ( ( (tk(P15)) <= ( 0 ) ) | (! ( (! ( ( 1 ) <= (tk(P156)) )) | ( ( (tk(P101)) <= (tk(P153)) ) & ( (tk(P225)) <= ( 1 ) ) ) )) ) | (! ( ( ( ( (tk(P63)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P102)) ) ) & ( ( (tk(P133)) <= ( 1 ) ) | ( (tk(P238)) <= (tk(P184)) ) ) ) | ( ( 1 ) <= (tk(P48)) ) )) ) & ( ( ( ( 1 ) <= (tk(P202)) ) & (! ( (tk(P185)) <= (tk(P219)) )) ) & ( ( ( ( (tk(P188)) <= (tk(P230)) ) | ( ( (tk(P145)) <= (tk(P140)) ) | ( (tk(P159)) <= ( 1 ) ) ) ) & (! ( ( (tk(P146)) <= (tk(P179)) ) | ( ( 1 ) <= (tk(P31)) ) )) ) | ( (! ( (tk(P87)) <= ( 0 ) )) | (! ( ( (tk(P139)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P207)) ) )) ) ) ) )) & ( (! ( ( 1 ) <= (tk(P40)) )) | ( (tk(P234)) <= ( 0 ) ) ) )))
PROPERTY: AutonomousCar-PT-05b-ReachabilityCardinality-10 (reachable &!potential( ( (tk(P200)) <= ( 1 ) )))
PROPERTY: AutonomousCar-PT-05b-ReachabilityCardinality-11 (reachable &!potential( (! ( ( ( ( ( ( ( ( ( 1 ) <= (tk(P94)) ) | ( ( 1 ) <= (tk(P156)) ) ) | ( ( ( 1 ) <= (tk(P146)) ) | ( ( 1 ) <= (tk(P53)) ) ) ) | ( (! ( (tk(P115)) <= ( 0 ) )) | ( ( ( 1 ) <= (tk(P172)) ) & ( ( 1 ) <= (tk(P182)) ) ) ) ) | (! ( (tk(P114)) <= ( 0 ) )) ) & ( ( 1 ) <= (tk(P28)) ) ) | ( ( (! ( ( 1 ) <= (tk(P117)) )) | ( ( ( (tk(P94)) <= ( 0 ) ) | ( ( (tk(P134)) <= (tk(P168)) ) & ( (tk(P140)) <= ( 0 ) ) ) ) & ( (tk(P51)) <= (tk(P249)) ) ) ) & ( (! ( ( ( ( 1 ) <= (tk(P148)) ) | ( (tk(P140)) <= ( 0 ) ) ) & ( ( (tk(P105)) <= (tk(P240)) ) | ( ( 1 ) <= (tk(P168)) ) ) )) & ( ( 1 ) <= (tk(P245)) ) ) ) ) & (! ( ( ( ( ( 1 ) <= (tk(P68)) ) | (! ( ( 1 ) <= (tk(P204)) )) ) & ( ( ( (tk(P176)) <= (tk(P241)) ) & ( (tk(P53)) <= ( 1 ) ) ) & ( ( 1 ) <= (tk(P227)) ) ) ) | (! ( (! ( (tk(P32)) <= (tk(P118)) )) & (! ( ( 1 ) <= (tk(P94)) )) )) )) ))))
PROPERTY: AutonomousCar-PT-05b-ReachabilityCardinality-12 (reachable & potential(( ( ( ( 1 ) <= (tk(P41)) ) & (! ( (tk(P237)) <= ( 1 ) )) ) & (! ( (tk(P149)) <= ( 1 ) )) )))
PROPERTY: AutonomousCar-PT-05b-ReachabilityCardinality-13 (reachable &!potential( ( ( ( (! ( ( (! ( (tk(P166)) <= (tk(P108)) )) & ( (tk(P219)) <= (tk(P122)) ) ) & ( ( ( ( 1 ) <= (tk(P217)) ) & ( ( (tk(P59)) <= (tk(P66)) ) | ( ( (tk(P143)) <= (tk(P207)) ) | ( (tk(P195)) <= (tk(P250)) ) ) ) ) & ( ( (tk(P94)) <= (tk(P193)) ) & ( ( ( (tk(P28)) <= (tk(P182)) ) & ( (tk(P7)) <= ( 1 ) ) ) & ( ( (tk(P86)) <= ( 1 ) ) & ( (tk(P43)) <= ( 1 ) ) ) ) ) ) )) & ( ( ( ( ( (! ( ( 1 ) <= (tk(P247)) )) | ( ( ( 1 ) <= (tk(P20)) ) | ( (tk(P100)) <= ( 1 ) ) ) ) & ( ( (tk(P75)) <= ( 1 ) ) | ( (tk(P208)) <= (tk(P74)) ) ) ) | ( ( ( (tk(P98)) <= (tk(P22)) ) & (! ( ( 1 ) <= (tk(P248)) )) ) | ( ( ( 1 ) <= (tk(P252)) ) | ( ( (tk(P47)) <= (tk(P226)) ) | ( ( 1 ) <= (tk(P12)) ) ) ) ) ) & (! ( (tk(P123)) <= ( 1 ) )) ) | ( ( ( ( ( ( (tk(P93)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P158)) ) ) | ( ( (tk(P151)) <= ( 0 ) ) & ( (tk(P124)) <= ( 0 ) ) ) ) | ( (tk(P188)) <= (tk(P148)) ) ) & ( (tk(P225)) <= (tk(P130)) ) ) | ( (tk(P94)) <= ( 0 ) ) ) ) ) | ( ( ( ( (! ( (tk(P252)) <= (tk(P27)) )) & ( ( 1 ) <= (tk(P47)) ) ) & (! ( (tk(P34)) <= (tk(P167)) )) ) | ( (! ( ( ( 1 ) <= (tk(P147)) ) & ( ( ( ( 1 ) <= (tk(P67)) ) | ( ( 1 ) <= (tk(P214)) ) ) | ( (tk(P102)) <= ( 1 ) ) ) )) & ( ( (tk(P104)) <= ( 0 ) ) | ( ( (! ( ( 1 ) <= (tk(P139)) )) & ( (tk(P54)) <= (tk(P210)) ) ) | ( (tk(P90)) <= (tk(P167)) ) ) ) ) ) | ( ( ( ( (tk(P31)) <= (tk(P138)) ) | ( ( (tk(P109)) <= (tk(P228)) ) & ( (! ( (tk(P240)) <= ( 1 ) )) | ( (tk(P9)) <= (tk(P142)) ) ) ) ) & ( ( 1 ) <= (tk(P224)) ) ) & (! ( ( ( 1 ) <= (tk(P101)) ) | ( ( (tk(P250)) <= ( 1 ) ) | ( ( (tk(P162)) <= (tk(P63)) ) & ( (tk(P54)) <= (tk(P162)) ) ) ) )) ) ) ) & ( (tk(P225)) <= ( 1 ) ) )))
PROPERTY: AutonomousCar-PT-05b-ReachabilityCardinality-14 (reachable & potential((! ( ( (tk(P110)) <= (tk(P80)) ) | ( (! ( ( 1 ) <= (tk(P26)) )) & ( (tk(P203)) <= ( 1 ) ) ) ))))
PROPERTY: AutonomousCar-PT-05b-ReachabilityCardinality-15 (reachable &!potential( ( ( (tk(P169)) <= (tk(P117)) ) | ( ( ( 1 ) <= (tk(P181)) ) & ( ( ( (! ( (! ( (tk(P106)) <= ( 1 ) )) & ( ( ( 1 ) <= (tk(P10)) ) & (! ( ( 1 ) <= (tk(P109)) )) ) )) | ( ( (! ( ( 1 ) <= (tk(P229)) )) | (! ( ( 1 ) <= (tk(P174)) )) ) & (! ( (tk(P160)) <= (tk(P219)) )) ) ) | ( (! ( (! ( ( (tk(P19)) <= (tk(P177)) ) & ( (tk(P41)) <= (tk(P209)) ) )) | ( (tk(P245)) <= ( 1 ) ) )) | (! ( ( ( ( ( 1 ) <= (tk(P29)) ) & ( (tk(P236)) <= ( 1 ) ) ) & (! ( (tk(P140)) <= (tk(P118)) )) ) & ( (tk(P120)) <= (tk(P143)) ) )) ) ) | ( ( ( ( (tk(P150)) <= ( 1 ) ) | (! ( (tk(P24)) <= ( 0 ) )) ) | (! ( (tk(P30)) <= (tk(P158)) )) ) & ( ( ( 1 ) <= (tk(P211)) ) | ( ( 1 ) <= (tk(P100)) ) ) ) ) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 1902748 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16103488 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
Caught signal 15, terminating.

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-05b"
export BK_EXAMINATION="ReachabilityCardinality"
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-05b, examination is ReachabilityCardinality"
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-167813600400606"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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