About the Execution of Smart+red for AutonomousCar-PT-03b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
669.424 | 33066.00 | 49189.00 | 37.70 | FTFTTTTTTTFFTTTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r011-oct2-167813600400574.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-03b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r011-oct2-167813600400574
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 7.2K Feb 25 12:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 12:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 12:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 12:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Feb 25 12:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 12:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 12:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 25 12:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 75K 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-03b-ReachabilityCardinality-00
FORMULA_NAME AutonomousCar-PT-03b-ReachabilityCardinality-01
FORMULA_NAME AutonomousCar-PT-03b-ReachabilityCardinality-02
FORMULA_NAME AutonomousCar-PT-03b-ReachabilityCardinality-03
FORMULA_NAME AutonomousCar-PT-03b-ReachabilityCardinality-04
FORMULA_NAME AutonomousCar-PT-03b-ReachabilityCardinality-05
FORMULA_NAME AutonomousCar-PT-03b-ReachabilityCardinality-06
FORMULA_NAME AutonomousCar-PT-03b-ReachabilityCardinality-07
FORMULA_NAME AutonomousCar-PT-03b-ReachabilityCardinality-08
FORMULA_NAME AutonomousCar-PT-03b-ReachabilityCardinality-09
FORMULA_NAME AutonomousCar-PT-03b-ReachabilityCardinality-10
FORMULA_NAME AutonomousCar-PT-03b-ReachabilityCardinality-11
FORMULA_NAME AutonomousCar-PT-03b-ReachabilityCardinality-12
FORMULA_NAME AutonomousCar-PT-03b-ReachabilityCardinality-13
FORMULA_NAME AutonomousCar-PT-03b-ReachabilityCardinality-14
FORMULA_NAME AutonomousCar-PT-03b-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1678740127381
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-03b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 20:42:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 20:42:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 20:42:10] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2023-03-13 20:42:10] [INFO ] Transformed 190 places.
[2023-03-13 20:42:10] [INFO ] Transformed 273 transitions.
[2023-03-13 20:42:10] [INFO ] Found NUPN structural information;
[2023-03-13 20:42:10] [INFO ] Parsed PT model containing 190 places and 273 transitions and 1051 arcs in 164 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 15 resets, run finished after 341 ms. (steps per millisecond=29 ) properties (out of 14) seen :7
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 7) seen :1
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 6) seen :1
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 5 properties.
// Phase 1: matrix 273 rows 190 cols
[2023-03-13 20:42:11] [INFO ] Computed 8 place invariants in 11 ms
[2023-03-13 20:42:12] [INFO ] After 422ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 20:42:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2023-03-13 20:42:12] [INFO ] After 227ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-13 20:42:13] [INFO ] Deduced a trap composed of 12 places in 304 ms of which 25 ms to minimize.
[2023-03-13 20:42:13] [INFO ] Deduced a trap composed of 39 places in 132 ms of which 1 ms to minimize.
[2023-03-13 20:42:13] [INFO ] Deduced a trap composed of 35 places in 101 ms of which 2 ms to minimize.
[2023-03-13 20:42:13] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 0 ms to minimize.
[2023-03-13 20:42:13] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 716 ms
[2023-03-13 20:42:13] [INFO ] Deduced a trap composed of 7 places in 192 ms of which 1 ms to minimize.
[2023-03-13 20:42:13] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 1 ms to minimize.
[2023-03-13 20:42:14] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2023-03-13 20:42:14] [INFO ] Deduced a trap composed of 45 places in 74 ms of which 1 ms to minimize.
[2023-03-13 20:42:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 548 ms
[2023-03-13 20:42:14] [INFO ] Deduced a trap composed of 31 places in 126 ms of which 1 ms to minimize.
[2023-03-13 20:42:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 140 ms
[2023-03-13 20:42:14] [INFO ] After 1734ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :2
Attempting to minimize the solution found.
Minimization took 100 ms.
[2023-03-13 20:42:14] [INFO ] After 2012ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :2
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 20 ms.
Support contains 45 out of 190 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 190/190 places, 273/273 transitions.
Graph (trivial) has 101 edges and 190 vertex of which 2 / 190 are part of one of the 1 SCC in 6 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 438 edges and 189 vertex of which 188 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 45 place count 188 transition count 228
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 50 rules applied. Total rules applied 95 place count 145 transition count 221
Reduce places removed 4 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 11 rules applied. Total rules applied 106 place count 141 transition count 214
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 113 place count 134 transition count 214
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 113 place count 134 transition count 206
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 129 place count 126 transition count 206
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 138 place count 117 transition count 197
Iterating global reduction 4 with 9 rules applied. Total rules applied 147 place count 117 transition count 197
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 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 38 rules applied. Total rules applied 185 place count 117 transition count 159
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 186 place count 116 transition count 159
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 212 place count 103 transition count 146
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 216 place count 101 transition count 154
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 220 place count 101 transition count 150
Free-agglomeration rule applied 5 times.
Iterating global reduction 6 with 5 rules applied. Total rules applied 225 place count 101 transition count 145
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 230 place count 96 transition count 145
Applied a total of 230 rules in 108 ms. Remains 96 /190 variables (removed 94) and now considering 145/273 (removed 128) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 96/190 places, 145/273 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 45 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :1
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 145 rows 96 cols
[2023-03-13 20:42:14] [INFO ] Computed 7 place invariants in 3 ms
[2023-03-13 20:42:14] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 20:42:14] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-13 20:42:14] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 20:42:14] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-13 20:42:14] [INFO ] After 30ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 20:42:15] [INFO ] Deduced a trap composed of 4 places in 218 ms of which 1 ms to minimize.
[2023-03-13 20:42:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 243 ms
[2023-03-13 20:42:15] [INFO ] After 317ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-03-13 20:42:15] [INFO ] After 481ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 16 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 145/145 transitions.
Graph (trivial) has 48 edges and 96 vertex of which 2 / 96 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 319 edges and 95 vertex of which 90 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 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 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 12 rules applied. Total rules applied 14 place count 90 transition count 127
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 13 rules applied. Total rules applied 27 place count 79 transition count 125
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 30 place count 78 transition count 123
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 32 place count 76 transition count 123
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 32 place count 76 transition count 119
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 40 place count 72 transition count 119
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 42 place count 70 transition count 117
Iterating global reduction 4 with 2 rules applied. Total rules applied 44 place count 70 transition count 117
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 70 place count 57 transition count 104
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 72 place count 55 transition count 96
Iterating global reduction 4 with 2 rules applied. Total rules applied 74 place count 55 transition count 96
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 75 place count 55 transition count 95
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 78 place count 55 transition count 92
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 84 place count 52 transition count 89
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 85 place count 52 transition count 89
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 86 place count 51 transition count 88
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 87 place count 50 transition count 88
Applied a total of 87 rules in 51 ms. Remains 50 /96 variables (removed 46) and now considering 88/145 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 50/96 places, 88/145 transitions.
Incomplete random walk after 10000 steps, including 297 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 39553 steps, run visited all 1 properties in 107 ms. (steps per millisecond=369 )
Probabilistic random walk after 39553 steps, saw 9318 distinct states, run finished after 108 ms. (steps per millisecond=366 ) properties seen :1
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 4966 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running AutonomousCar (PT), instance 03b
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: 190 places, 273 transitions, 1051 arcs.
Final Score: 3510.588
Took : 16 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: AutonomousCar-PT-03b-ReachabilityCardinality-00 (reachable &!potential( (! ( (! ( ( ( ( ( (tk(P72)) <= (tk(P156)) ) & ( (tk(P4)) <= (tk(P29)) ) ) | ( ( 1 ) <= (tk(P173)) ) ) & ( (tk(P96)) <= (tk(P120)) ) ) | (! ( (! ( ( 1 ) <= (tk(P134)) )) & ( ( ( (tk(P51)) <= ( 0 ) ) & ( (tk(P128)) <= (tk(P16)) ) ) & ( (tk(P163)) <= (tk(P60)) ) ) )) )) & (! ( ( (tk(P181)) <= (tk(P77)) ) & ( ( ( (! ( (tk(P70)) <= (tk(P70)) )) & (! ( (tk(P188)) <= ( 1 ) )) ) & (! ( ( 1 ) <= (tk(P184)) )) ) | ( ( 1 ) <= (tk(P22)) ) ) )) ))))
PROPERTY: AutonomousCar-PT-03b-ReachabilityCardinality-01 (reachable & potential(( (! ( (! ( (tk(P2)) <= ( 1 ) )) | (! ( ( ( ( (tk(P175)) <= ( 0 ) ) & ( ( ( (tk(P177)) <= (tk(P153)) ) | ( (tk(P180)) <= (tk(P65)) ) ) & ( (tk(P168)) <= (tk(P21)) ) ) ) & (! ( ( ( (tk(P149)) <= ( 1 ) ) | ( ( 1 ) <= (tk(P3)) ) ) & (! ( ( 1 ) <= (tk(P163)) )) )) ) & (! ( ( (! ( ( 1 ) <= (tk(P188)) )) & ( ( ( 1 ) <= (tk(P162)) ) | ( ( 1 ) <= (tk(P83)) ) ) ) | ( ( ( (tk(P76)) <= (tk(P119)) ) | ( (tk(P142)) <= ( 0 ) ) ) | (! ( (tk(P34)) <= (tk(P146)) )) ) )) )) )) & ( (tk(P190)) <= ( 1 ) ) )))
PROPERTY: AutonomousCar-PT-03b-ReachabilityCardinality-02 (reachable &!potential( ( (tk(P61)) <= (tk(P72)) )))
PROPERTY: AutonomousCar-PT-03b-ReachabilityCardinality-03 (reachable & potential(( ( ( (tk(P175)) <= (tk(P167)) ) & (! ( ( ( 1 ) <= (tk(P91)) ) & (! ( (! ( ( (tk(P7)) <= ( 1 ) ) | ( (tk(P169)) <= ( 0 ) ) )) & (! ( (tk(P161)) <= (tk(P186)) )) )) )) ) & ( ( ( ( 1 ) <= (tk(P118)) ) & (! ( ( ( (tk(P179)) <= ( 0 ) ) & ( (! ( ( 1 ) <= (tk(P37)) )) & ( (tk(P155)) <= ( 1 ) ) ) ) & ( ( ( ( 1 ) <= (tk(P56)) ) | (! ( (tk(P60)) <= (tk(P8)) )) ) | ( (! ( ( (tk(P139)) <= ( 1 ) ) & ( (tk(P134)) <= (tk(P172)) ) )) & (! ( ( ( 1 ) <= (tk(P22)) ) & ( (tk(P58)) <= ( 1 ) ) )) ) ) )) ) & ( ( ( ( (! ( ( (tk(P166)) <= (tk(P124)) ) | ( ( ( 1 ) <= (tk(P87)) ) | ( (tk(P154)) <= (tk(P106)) ) ) )) & ( ( ( ( (tk(P149)) <= (tk(P115)) ) & ( ( 1 ) <= (tk(P130)) ) ) | ( ( (tk(P188)) <= (tk(P100)) ) | ( (tk(P92)) <= (tk(P185)) ) ) ) | ( ( (tk(P72)) <= ( 1 ) ) | ( (tk(P126)) <= ( 1 ) ) ) ) ) & (! ( (tk(P81)) <= (tk(P163)) )) ) | ( ( ( ( 1 ) <= (tk(P44)) ) | ( (! ( ( ( 1 ) <= (tk(P27)) ) & ( ( 1 ) <= (tk(P164)) ) )) & ( ( ( ( 1 ) <= (tk(P131)) ) & ( ( 1 ) <= (tk(P22)) ) ) | ( ( (tk(P103)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P129)) ) ) ) ) ) | ( ( (tk(P85)) <= ( 1 ) ) & ( ( ( (tk(P69)) <= (tk(P61)) ) & (! ( ( 1 ) <= (tk(P77)) )) ) | ( ( ( 1 ) <= (tk(P29)) ) & ( ( ( 1 ) <= (tk(P190)) ) & ( ( 1 ) <= (tk(P101)) ) ) ) ) ) ) ) | ( (tk(P93)) <= (tk(P114)) ) ) ) )))
PROPERTY: AutonomousCar-PT-03b-ReachabilityCardinality-04 (reachable & potential(( ( ( 1 ) <= (tk(P161)) ) & ( (tk(P154)) <= ( 1 ) ) )))
PROPERTY: AutonomousCar-PT-03b-ReachabilityCardinality-05 (reachable &!potential( ( ( (tk(P143)) <= (tk(P24)) ) | ( (tk(P40)) <= ( 1 ) ) )))
PROPERTY: AutonomousCar-PT-03b-ReachabilityCardinality-06 (reachable & potential(( ( 1 ) <= (tk(P68)) )))
PROPERTY: AutonomousCar-PT-03b-ReachabilityCardinality-07 (reachable &!potential( ( ( ( ( (tk(P98)) <= (tk(P79)) ) & ( (tk(P20)) <= ( 1 ) ) ) | (! ( ( 1 ) <= (tk(P112)) )) ) | ( (! ( ( ( 1 ) <= (tk(P94)) ) | ( ( ( (tk(P124)) <= ( 0 ) ) | (! ( (tk(P117)) <= ( 1 ) )) ) | (! ( (tk(P15)) <= ( 0 ) )) ) )) | ( (tk(P181)) <= ( 0 ) ) ) )))
PROPERTY: AutonomousCar-PT-03b-ReachabilityCardinality-08 (reachable & potential(( ( (! ( (! ( ( ( ( ( (tk(P112)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P9)) ) ) & ( ( ( 1 ) <= (tk(P52)) ) & ( (tk(P153)) <= (tk(P107)) ) ) ) & (! ( (tk(P176)) <= (tk(P97)) )) ) & ( ( ( ( (tk(P190)) <= (tk(P177)) ) & ( (tk(P179)) <= ( 0 ) ) ) & (! ( ( 1 ) <= (tk(P121)) )) ) | ( ( 1 ) <= (tk(P113)) ) ) )) & (! ( (! ( (tk(P172)) <= ( 1 ) )) | ( ( 1 ) <= (tk(P114)) ) )) )) | ( ( ( ( ( ( ( ( (tk(P96)) <= (tk(P138)) ) & ( (tk(P172)) <= (tk(P149)) ) ) & ( ( (tk(P142)) <= (tk(P43)) ) | ( (tk(P15)) <= (tk(P58)) ) ) ) | (! ( (tk(P47)) <= (tk(P60)) )) ) | ( ( ( ( 1 ) <= (tk(P116)) ) | ( (tk(P137)) <= (tk(P39)) ) ) & ( (tk(P126)) <= (tk(P17)) ) ) ) | ( (! ( ( 1 ) <= (tk(P171)) )) | (! ( (tk(P7)) <= ( 0 ) )) ) ) & (! ( (! ( ( 1 ) <= (tk(P121)) )) | ( (! ( ( 1 ) <= (tk(P54)) )) & ( ( (tk(P121)) <= ( 1 ) ) & ( (tk(P176)) <= ( 0 ) ) ) ) )) ) & ( ( 1 ) <= (tk(P70)) ) ) ) & (! ( (tk(P158)) <= ( 0 ) )) )))
PROPERTY: AutonomousCar-PT-03b-ReachabilityCardinality-09 (reachable & potential((! ( ( (! ( (! ( ( 1 ) <= (tk(P23)) )) | ( ( ( ( 1 ) <= (tk(P184)) ) & ( (tk(P2)) <= ( 1 ) ) ) | ( ( (tk(P44)) <= ( 0 ) ) | ( (tk(P141)) <= (tk(P134)) ) ) ) )) | ( ( (! ( ( (tk(P120)) <= ( 1 ) ) | ( ( 1 ) <= (tk(P144)) ) )) & (! ( (tk(P64)) <= ( 0 ) )) ) & (! ( (! ( ( (tk(P37)) <= (tk(P72)) ) & ( (tk(P187)) <= ( 1 ) ) )) | ( ( ( (tk(P136)) <= (tk(P75)) ) | ( (tk(P64)) <= (tk(P100)) ) ) & (! ( ( 1 ) <= (tk(P74)) )) ) )) ) ) | (! ( ( 1 ) <= (tk(P46)) )) ))))
PROPERTY: AutonomousCar-PT-03b-ReachabilityCardinality-10 (reachable &!potential( ( (tk(P148)) <= ( 0 ) )))
PROPERTY: AutonomousCar-PT-03b-ReachabilityCardinality-11 (reachable &!potential( (! ( ( 1 ) <= (tk(P64)) ))))
PROPERTY: AutonomousCar-PT-03b-ReachabilityCardinality-12 (reachable &!potential( ( (tk(P54)) <= ( 1 ) )))
PROPERTY: AutonomousCar-PT-03b-ReachabilityCardinality-13 (reachable &!potential( ( ( (tk(P15)) <= ( 0 ) ) | ( (! ( (! ( (tk(P19)) <= ( 0 ) )) | (! ( (! ( ( ( (tk(P183)) <= (tk(P158)) ) | ( (tk(P131)) <= ( 0 ) ) ) | (! ( ( 1 ) <= (tk(P52)) )) )) | ( ( ( (tk(P44)) <= ( 1 ) ) & ( (tk(P127)) <= (tk(P107)) ) ) | ( (! ( (tk(P166)) <= ( 0 ) )) | ( (tk(P158)) <= ( 1 ) ) ) ) )) )) | ( ( (tk(P158)) <= (tk(P190)) ) | ( ( 1 ) <= (tk(P27)) ) ) ) )))
PROPERTY: AutonomousCar-PT-03b-ReachabilityCardinality-14 (reachable &!potential( (! ( ( (! ( (! ( ( ( 1 ) <= (tk(P121)) ) | (! ( (tk(P55)) <= ( 1 ) )) )) & (! ( (tk(P173)) <= ( 0 ) )) )) | ( (tk(P49)) <= (tk(P189)) ) ) & ( (! ( (tk(P79)) <= ( 0 ) )) & ( ( ( ( 1 ) <= (tk(P120)) ) & ( ( ( ( ( (tk(P76)) <= ( 0 ) ) | ( (tk(P142)) <= ( 1 ) ) ) | (! ( ( 1 ) <= (tk(P166)) )) ) & ( ( ( ( 1 ) <= (tk(P115)) ) & ( ( 1 ) <= (tk(P2)) ) ) & ( ( ( 1 ) <= (tk(P111)) ) | ( (tk(P68)) <= (tk(P138)) ) ) ) ) | ( ( 1 ) <= (tk(P55)) ) ) ) | ( ( 1 ) <= (tk(P68)) ) ) ) ))))
PROPERTY: AutonomousCar-PT-03b-ReachabilityCardinality-15 (reachable &!potential( ( (tk(P182)) <= (tk(P17)) )))
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
BK_STOP 1678740160447
--------------------
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
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-03b"
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-03b, 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-167813600400574"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-03b.tgz
mv AutonomousCar-PT-03b 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 '
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 ;