About the Execution of Smart+red for AutonomousCar-PT-02b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1738.212 | 69294.00 | 87370.00 | 62.60 | FFFTTTTFTTTTTTTF | 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-167813600400558.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-02b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r011-oct2-167813600400558
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 7.4K Feb 25 12:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 12:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 12:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 12:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 25 12:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 12:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 25 12:57 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 49K 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-02b-ReachabilityCardinality-00
FORMULA_NAME AutonomousCar-PT-02b-ReachabilityCardinality-01
FORMULA_NAME AutonomousCar-PT-02b-ReachabilityCardinality-02
FORMULA_NAME AutonomousCar-PT-02b-ReachabilityCardinality-03
FORMULA_NAME AutonomousCar-PT-02b-ReachabilityCardinality-04
FORMULA_NAME AutonomousCar-PT-02b-ReachabilityCardinality-05
FORMULA_NAME AutonomousCar-PT-02b-ReachabilityCardinality-06
FORMULA_NAME AutonomousCar-PT-02b-ReachabilityCardinality-07
FORMULA_NAME AutonomousCar-PT-02b-ReachabilityCardinality-08
FORMULA_NAME AutonomousCar-PT-02b-ReachabilityCardinality-09
FORMULA_NAME AutonomousCar-PT-02b-ReachabilityCardinality-10
FORMULA_NAME AutonomousCar-PT-02b-ReachabilityCardinality-11
FORMULA_NAME AutonomousCar-PT-02b-ReachabilityCardinality-12
FORMULA_NAME AutonomousCar-PT-02b-ReachabilityCardinality-13
FORMULA_NAME AutonomousCar-PT-02b-ReachabilityCardinality-14
FORMULA_NAME AutonomousCar-PT-02b-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1678739987449
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-02b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 20:39:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 20:39:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 20:39:50] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2023-03-13 20:39:50] [INFO ] Transformed 155 places.
[2023-03-13 20:39:50] [INFO ] Transformed 194 transitions.
[2023-03-13 20:39:50] [INFO ] Found NUPN structural information;
[2023-03-13 20:39:50] [INFO ] Parsed PT model containing 155 places and 194 transitions and 620 arcs in 158 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 3 resets, run finished after 304 ms. (steps per millisecond=32 ) properties (out of 12) seen :6
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 6) seen :1
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 5) seen :1
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 4) seen :1
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 3 properties.
// Phase 1: matrix 194 rows 155 cols
[2023-03-13 20:39:51] [INFO ] Computed 7 place invariants in 7 ms
[2023-03-13 20:39:52] [INFO ] After 348ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 20:39:52] [INFO ] [Nat]Absence check using 7 positive place invariants in 21 ms returned sat
[2023-03-13 20:39:52] [INFO ] After 239ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-13 20:39:52] [INFO ] Deduced a trap composed of 24 places in 267 ms of which 20 ms to minimize.
[2023-03-13 20:39:53] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 1 ms to minimize.
[2023-03-13 20:39:53] [INFO ] Deduced a trap composed of 17 places in 158 ms of which 12 ms to minimize.
[2023-03-13 20:39:53] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 1 ms to minimize.
[2023-03-13 20:39:53] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 1 ms to minimize.
[2023-03-13 20:39:53] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 0 ms to minimize.
[2023-03-13 20:39:53] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1013 ms
[2023-03-13 20:39:53] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 1 ms to minimize.
[2023-03-13 20:39:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2023-03-13 20:39:53] [INFO ] After 1439ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 68 ms.
[2023-03-13 20:39:53] [INFO ] After 1673ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 15 ms.
Support contains 41 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 194/194 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 155 transition count 164
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 34 rules applied. Total rules applied 64 place count 125 transition count 160
Reduce places removed 1 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 2 with 12 rules applied. Total rules applied 76 place count 124 transition count 149
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 87 place count 113 transition count 149
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 87 place count 113 transition count 144
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 97 place count 108 transition count 144
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 102 place count 103 transition count 139
Iterating global reduction 4 with 5 rules applied. Total rules applied 107 place count 103 transition count 139
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 123 place count 103 transition count 123
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 124 place count 102 transition count 121
Iterating global reduction 5 with 1 rules applied. Total rules applied 125 place count 102 transition count 121
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 145 place count 92 transition count 111
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 149 place count 90 transition count 120
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 152 place count 90 transition count 117
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 155 place count 90 transition count 114
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 158 place count 87 transition count 114
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 160 place count 87 transition count 114
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 161 place count 87 transition count 114
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 162 place count 86 transition count 113
Applied a total of 162 rules in 103 ms. Remains 86 /155 variables (removed 69) and now considering 113/194 (removed 81) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 86/155 places, 113/194 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :1
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 113 rows 86 cols
[2023-03-13 20:39:54] [INFO ] Computed 7 place invariants in 4 ms
[2023-03-13 20:39:54] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 20:39:54] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-13 20:39:54] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 20:39:54] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-13 20:39:54] [INFO ] After 26ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 20:39:54] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2023-03-13 20:39:54] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 2 ms to minimize.
[2023-03-13 20:39:54] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2023-03-13 20:39:54] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2023-03-13 20:39:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 358 ms
[2023-03-13 20:39:54] [INFO ] After 410ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 60 ms.
[2023-03-13 20:39:54] [INFO ] After 570ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 40 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 113/113 transitions.
Graph (trivial) has 2 edges and 86 vertex of which 2 / 86 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 222 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 2 rules in 11 ms. Remains 84 /86 variables (removed 2) and now considering 111/113 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 84/86 places, 111/113 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Probably explored full state space saw : 143280 states, properties seen :0
Probabilistic random walk after 757661 steps, saw 143280 distinct states, run finished after 962 ms. (steps per millisecond=787 ) properties seen :0
Explored full state space saw : 143280 states, properties seen :0
Exhaustive walk after 757661 steps, saw 143280 distinct states, run finished after 599 ms. (steps per millisecond=1264 ) properties seen :0
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
All properties solved without resorting to model-checking.
Total runtime 6013 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running AutonomousCar (PT), instance 02b
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: 155 places, 194 transitions, 620 arcs.
Final Score: 2126.31
Took : 8 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: AutonomousCar-PT-02b-ReachabilityCardinality-00 (reachable & potential(( (! ( ( (! ( ( (! ( ( ( 1 ) <= (tk(P22)) ) & ( (tk(P95)) <= (tk(P6)) ) )) & (! ( ( ( 1 ) <= (tk(P110)) ) & ( (tk(P59)) <= (tk(P33)) ) )) ) | ( ( ( 1 ) <= (tk(P37)) ) & ( ( ( ( 1 ) <= (tk(P76)) ) & ( ( 1 ) <= (tk(P14)) ) ) | (! ( ( 1 ) <= (tk(P87)) )) ) ) )) | ( (! ( ( (tk(P121)) <= ( 0 ) ) | (! ( ( (tk(P81)) <= ( 0 ) ) | ( (tk(P133)) <= ( 0 ) ) )) )) | ( ( 1 ) <= (tk(P78)) ) ) ) | ( ( ( (tk(P8)) <= (tk(P100)) ) & ( ( ( (! ( ( 1 ) <= (tk(P103)) )) | (! ( (tk(P66)) <= (tk(P92)) )) ) | ( (! ( (tk(P35)) <= ( 0 ) )) | ( ( ( 1 ) <= (tk(P99)) ) | ( (tk(P47)) <= ( 0 ) ) ) ) ) | (! ( ( ( 1 ) <= (tk(P139)) ) & ( (tk(P73)) <= (tk(P115)) ) )) ) ) & (! ( ( ( (! ( (tk(P134)) <= ( 0 ) )) | ( ( (tk(P21)) <= ( 1 ) ) | ( (tk(P25)) <= (tk(P96)) ) ) ) | ( ( ( (tk(P98)) <= (tk(P153)) ) & ( (tk(P77)) <= (tk(P28)) ) ) & ( ( (tk(P126)) <= (tk(P46)) ) | ( ( 1 ) <= (tk(P76)) ) ) ) ) & (! ( ( (tk(P43)) <= ( 1 ) ) | ( (tk(P8)) <= ( 1 ) ) )) )) ) )) & (! ( ( ( ( 1 ) <= (tk(P137)) ) & (! ( (! ( ( ( (tk(P13)) <= ( 1 ) ) | ( (tk(P136)) <= ( 1 ) ) ) & (! ( (tk(P7)) <= ( 1 ) )) )) | ( ( 1 ) <= (tk(P126)) ) )) ) | ( ( ( ( ( ( ( (tk(P142)) <= (tk(P92)) ) | ( (tk(P105)) <= (tk(P48)) ) ) & ( ( (tk(P25)) <= (tk(P90)) ) | ( ( 1 ) <= (tk(P6)) ) ) ) & ( (! ( (tk(P62)) <= ( 0 ) )) & ( ( ( 1 ) <= (tk(P45)) ) | ( (tk(P115)) <= (tk(P45)) ) ) ) ) | ( (tk(P7)) <= (tk(P56)) ) ) | ( ( ( 1 ) <= (tk(P24)) ) | ( (tk(P22)) <= (tk(P130)) ) ) ) & ( ( ( (tk(P127)) <= ( 0 ) ) & ( ( ( (tk(P46)) <= (tk(P150)) ) & ( (tk(P100)) <= ( 1 ) ) ) & ( ( 1 ) <= (tk(P10)) ) ) ) & ( (tk(P1)) <= ( 1 ) ) ) ) )) )))
PROPERTY: AutonomousCar-PT-02b-ReachabilityCardinality-01 (reachable & potential(( (! ( ( ( (! ( (tk(P25)) <= (tk(P46)) )) & (! ( ( ( (tk(P132)) <= ( 1 ) ) | ( (tk(P139)) <= ( 1 ) ) ) & ( ( ( 1 ) <= (tk(P54)) ) | ( ( 1 ) <= (tk(P77)) ) ) )) ) & ( (! ( ( (tk(P114)) <= (tk(P43)) ) | ( ( ( 1 ) <= (tk(P101)) ) | ( (tk(P16)) <= (tk(P40)) ) ) )) & ( ( ( (tk(P77)) <= ( 0 ) ) | ( (tk(P30)) <= ( 1 ) ) ) & (! ( (tk(P32)) <= ( 0 ) )) ) ) ) | ( ( ( (tk(P122)) <= (tk(P31)) ) | (! ( (tk(P41)) <= ( 1 ) )) ) | ( ( ( (! ( (tk(P66)) <= ( 1 ) )) & ( ( ( 1 ) <= (tk(P77)) ) | ( (tk(P27)) <= (tk(P111)) ) ) ) & ( (tk(P48)) <= (tk(P47)) ) ) | (! ( ( 1 ) <= (tk(P84)) )) ) ) )) & (! ( ( (tk(P83)) <= (tk(P6)) ) | ( ( ( 1 ) <= (tk(P104)) ) & (! ( (! ( ( (tk(P123)) <= ( 0 ) ) & (! ( (tk(P96)) <= ( 1 ) )) )) & (! ( (tk(P20)) <= (tk(P28)) )) )) ) )) )))
PROPERTY: AutonomousCar-PT-02b-ReachabilityCardinality-02 (reachable & potential((! ( ( (tk(P80)) <= ( 0 ) ) | ( (tk(P110)) <= ( 1 ) ) ))))
PROPERTY: AutonomousCar-PT-02b-ReachabilityCardinality-03 (reachable & potential(( ( 1 ) <= (tk(P6)) )))
PROPERTY: AutonomousCar-PT-02b-ReachabilityCardinality-04 (reachable &!potential( ( ( (tk(P89)) <= (tk(P44)) ) | ( (tk(P5)) <= ( 1 ) ) )))
PROPERTY: AutonomousCar-PT-02b-ReachabilityCardinality-05 (reachable & potential(( ( 1 ) <= (tk(P135)) )))
PROPERTY: AutonomousCar-PT-02b-ReachabilityCardinality-06 (reachable &!potential( ( (tk(P147)) <= ( 1 ) )))
PROPERTY: AutonomousCar-PT-02b-ReachabilityCardinality-07 (reachable &!potential( ( ( ( ( ( ( (tk(P45)) <= ( 0 ) ) | ( (tk(P101)) <= ( 0 ) ) ) | (! ( (tk(P128)) <= ( 1 ) )) ) | ( ( 1 ) <= (tk(P72)) ) ) & ( ( (tk(P136)) <= ( 1 ) ) & ( ( (tk(P91)) <= (tk(P123)) ) & ( ( ( (tk(P19)) <= (tk(P118)) ) | ( ( ( (tk(P139)) <= (tk(P142)) ) | ( (tk(P153)) <= (tk(P102)) ) ) | ( (tk(P76)) <= (tk(P94)) ) ) ) | ( (tk(P31)) <= (tk(P18)) ) ) ) ) ) | (! ( (! ( (tk(P147)) <= ( 0 ) )) | ( ( (tk(P4)) <= (tk(P136)) ) | ( (! ( ( ( 1 ) <= (tk(P94)) ) | ( ( ( ( 1 ) <= (tk(P6)) ) & ( ( 1 ) <= (tk(P148)) ) ) | ( ( (tk(P21)) <= ( 1 ) ) | ( (tk(P153)) <= ( 0 ) ) ) ) )) | ( (! ( ( 1 ) <= (tk(P137)) )) | (! ( ( 1 ) <= (tk(P12)) )) ) ) ) )) )))
PROPERTY: AutonomousCar-PT-02b-ReachabilityCardinality-08 (reachable & potential(( ( 1 ) <= (tk(P27)) )))
PROPERTY: AutonomousCar-PT-02b-ReachabilityCardinality-09 (reachable & potential(( ( ( (tk(P84)) <= ( 0 ) ) | (! ( ( (tk(P57)) <= ( 1 ) ) & ( ( ( ( (! ( ( 1 ) <= (tk(P50)) )) | (! ( (tk(P7)) <= (tk(P61)) )) ) | (! ( (tk(P107)) <= (tk(P7)) )) ) & ( ( 1 ) <= (tk(P31)) ) ) & ( (tk(P142)) <= (tk(P120)) ) ) )) ) & ( (! ( ( (! ( (! ( ( 1 ) <= (tk(P145)) )) & ( ( (tk(P101)) <= (tk(P81)) ) & (! ( (tk(P43)) <= ( 0 ) )) ) )) & ( ( ( ( (tk(P135)) <= (tk(P63)) ) | ( (tk(P75)) <= (tk(P76)) ) ) | ( ( ( ( 1 ) <= (tk(P148)) ) & ( ( 1 ) <= (tk(P12)) ) ) | ( ( (tk(P131)) <= (tk(P14)) ) & ( ( 1 ) <= (tk(P71)) ) ) ) ) & ( (tk(P91)) <= (tk(P147)) ) ) ) | ( ( ( ( (tk(P63)) <= (tk(P120)) ) | ( (! ( ( 1 ) <= (tk(P75)) )) & ( (tk(P96)) <= ( 1 ) ) ) ) & (! ( ( ( 1 ) <= (tk(P107)) ) & ( (tk(P139)) <= (tk(P17)) ) )) ) | ( (! ( ( ( (tk(P90)) <= (tk(P123)) ) | ( ( 1 ) <= (tk(P118)) ) ) | ( ( (tk(P70)) <= ( 1 ) ) & ( (tk(P151)) <= ( 1 ) ) ) )) & (! ( (tk(P147)) <= ( 1 ) )) ) ) )) & ( (! ( ( (! ( ( ( (tk(P118)) <= (tk(P99)) ) & ( ( 1 ) <= (tk(P91)) ) ) & ( ( ( 1 ) <= (tk(P2)) ) & ( ( 1 ) <= (tk(P111)) ) ) )) & (! ( ( ( (tk(P16)) <= (tk(P64)) ) & ( (tk(P90)) <= ( 0 ) ) ) | ( ( (tk(P53)) <= (tk(P132)) ) | ( (tk(P91)) <= (tk(P116)) ) ) )) ) & ( ( 1 ) <= (tk(P11)) ) )) & (! ( ( ( (! ( ( ( 1 ) <= (tk(P83)) ) & ( (tk(P57)) <= (tk(P110)) ) )) & ( ( 1 ) <= (tk(P48)) ) ) & ( (tk(P19)) <= (tk(P50)) ) ) & ( ( 1 ) <= (tk(P61)) ) )) ) ) )))
PROPERTY: AutonomousCar-PT-02b-ReachabilityCardinality-10 (reachable & potential(( (! ( ( ( ( ( ( 1 ) <= (tk(P4)) ) & (! ( ( (tk(P22)) <= (tk(P78)) ) & ( ( (tk(P23)) <= (tk(P94)) ) | ( (tk(P31)) <= (tk(P103)) ) ) )) ) | ( ( (tk(P11)) <= (tk(P22)) ) & ( (! ( (tk(P133)) <= (tk(P131)) )) | (! ( ( (tk(P4)) <= (tk(P151)) ) | ( (tk(P152)) <= (tk(P69)) ) )) ) ) ) & ( (tk(P24)) <= ( 0 ) ) ) & (! ( (tk(P66)) <= (tk(P135)) )) )) & ( ( ( 1 ) <= (tk(P38)) ) & ( ( ( (tk(P11)) <= ( 1 ) ) & ( ( ( ( ( ( ( 1 ) <= (tk(P90)) ) | ( ( 1 ) <= (tk(P70)) ) ) & (! ( ( 1 ) <= (tk(P16)) )) ) & (! ( ( (tk(P39)) <= ( 1 ) ) | ( (tk(P74)) <= (tk(P93)) ) )) ) & (! ( ( ( (tk(P155)) <= ( 0 ) ) & ( (tk(P30)) <= (tk(P97)) ) ) | ( ( 1 ) <= (tk(P65)) ) )) ) & (! ( ( (tk(P59)) <= ( 1 ) ) | ( (tk(P17)) <= ( 1 ) ) )) ) ) | ( ( ( ( ( ( ( (tk(P105)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P145)) ) ) | ( ( (tk(P36)) <= ( 0 ) ) | ( (tk(P119)) <= ( 1 ) ) ) ) | ( ( ( ( 1 ) <= (tk(P151)) ) & ( (tk(P152)) <= ( 1 ) ) ) & ( ( 1 ) <= (tk(P119)) ) ) ) | ( ( (tk(P13)) <= (tk(P48)) ) & ( (! ( ( 1 ) <= (tk(P25)) )) & ( ( ( 1 ) <= (tk(P74)) ) & ( (tk(P120)) <= ( 1 ) ) ) ) ) ) & ( (! ( ( (tk(P49)) <= ( 0 ) ) | ( (tk(P136)) <= ( 0 ) ) )) | ( (! ( ( 1 ) <= (tk(P82)) )) | ( ( ( ( 1 ) <= (tk(P119)) ) | ( (tk(P121)) <= (tk(P92)) ) ) & ( ( (tk(P98)) <= (tk(P65)) ) | ( (tk(P22)) <= (tk(P51)) ) ) ) ) ) ) & ( ( ( ( (tk(P35)) <= ( 0 ) ) | ( ( ( (tk(P98)) <= (tk(P90)) ) & ( (tk(P150)) <= ( 1 ) ) ) | ( ( (tk(P114)) <= (tk(P96)) ) | ( (tk(P113)) <= ( 1 ) ) ) ) ) & ( ( (tk(P59)) <= (tk(P39)) ) | ( (! ( ( 1 ) <= (tk(P43)) )) | ( ( ( 1 ) <= (tk(P126)) ) & ( ( 1 ) <= (tk(P111)) ) ) ) ) ) & ( ( ( (! ( (tk(P16)) <= (tk(P54)) )) | ( (tk(P115)) <= ( 0 ) ) ) | ( (! ( (tk(P59)) <= (tk(P139)) )) & ( ( (tk(P117)) <= (tk(P103)) ) & ( (tk(P45)) <= (tk(P7)) ) ) ) ) | ( ( 1 ) <= (tk(P74)) ) ) ) ) ) ) )))
PROPERTY: AutonomousCar-PT-02b-ReachabilityCardinality-11 (reachable & potential(( (! ( (tk(P110)) <= (tk(P37)) )) & ( ( ( ( (tk(P37)) <= ( 0 ) ) | ( (tk(P147)) <= ( 0 ) ) ) & ( ( 1 ) <= (tk(P18)) ) ) | (! ( (! ( ( ( ( ( 1 ) <= (tk(P22)) ) & ( ( 1 ) <= (tk(P96)) ) ) & ( ( ( 1 ) <= (tk(P43)) ) & ( (tk(P67)) <= ( 1 ) ) ) ) & (! ( ( (tk(P39)) <= ( 1 ) ) & ( (tk(P4)) <= (tk(P107)) ) )) )) & (! ( (tk(P83)) <= ( 0 ) )) )) ) )))
PROPERTY: AutonomousCar-PT-02b-ReachabilityCardinality-12 (reachable & potential((! ( (tk(P76)) <= ( 0 ) ))))
PROPERTY: AutonomousCar-PT-02b-ReachabilityCardinality-13 (reachable & potential((! ( (tk(P48)) <= ( 0 ) ))))
PROPERTY: AutonomousCar-PT-02b-ReachabilityCardinality-14 (reachable & potential(( ( 1 ) <= (tk(P110)) )))
PROPERTY: AutonomousCar-PT-02b-ReachabilityCardinality-15 (reachable & potential((! ( ( (tk(P89)) <= ( 1 ) ) | ( ( 1 ) <= (tk(P60)) ) ))))
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA AutonomousCar-PT-02b-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
BK_STOP 1678740056743
--------------------
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-02b"
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-02b, 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-167813600400558"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-02b.tgz
mv AutonomousCar-PT-02b 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 ;