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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 6.6K Feb 25 12:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 25 12:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 12:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 12:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 12:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 163K Feb 25 12:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 12:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 25 12:54 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 177K 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-06a-ReachabilityCardinality-00
FORMULA_NAME AutonomousCar-PT-06a-ReachabilityCardinality-01
FORMULA_NAME AutonomousCar-PT-06a-ReachabilityCardinality-02
FORMULA_NAME AutonomousCar-PT-06a-ReachabilityCardinality-03
FORMULA_NAME AutonomousCar-PT-06a-ReachabilityCardinality-04
FORMULA_NAME AutonomousCar-PT-06a-ReachabilityCardinality-05
FORMULA_NAME AutonomousCar-PT-06a-ReachabilityCardinality-06
FORMULA_NAME AutonomousCar-PT-06a-ReachabilityCardinality-07
FORMULA_NAME AutonomousCar-PT-06a-ReachabilityCardinality-08
FORMULA_NAME AutonomousCar-PT-06a-ReachabilityCardinality-09
FORMULA_NAME AutonomousCar-PT-06a-ReachabilityCardinality-10
FORMULA_NAME AutonomousCar-PT-06a-ReachabilityCardinality-11
FORMULA_NAME AutonomousCar-PT-06a-ReachabilityCardinality-12
FORMULA_NAME AutonomousCar-PT-06a-ReachabilityCardinality-13
FORMULA_NAME AutonomousCar-PT-06a-ReachabilityCardinality-14
FORMULA_NAME AutonomousCar-PT-06a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678740434008

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-06a
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 20:47:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 20:47:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 20:47:16] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2023-03-13 20:47:16] [INFO ] Transformed 65 places.
[2023-03-13 20:47:16] [INFO ] Transformed 417 transitions.
[2023-03-13 20:47:16] [INFO ] Found NUPN structural information;
[2023-03-13 20:47:16] [INFO ] Parsed PT model containing 65 places and 417 transitions and 3356 arcs in 189 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 159 transitions
Reduce redundant transitions removed 159 transitions.
FORMULA AutonomousCar-PT-06a-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06a-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06a-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06a-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06a-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06a-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06a-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06a-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06a-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 556 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 7) seen :5
FORMULA AutonomousCar-PT-06a-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06a-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06a-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06a-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06a-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 62 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-13 20:47:17] [INFO ] Flow matrix only has 257 transitions (discarded 1 similar events)
// Phase 1: matrix 257 rows 65 cols
[2023-03-13 20:47:17] [INFO ] Computed 11 place invariants in 7 ms
[2023-03-13 20:47:17] [INFO ] After 186ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-13 20:47:17] [INFO ] [Nat]Absence check using 11 positive place invariants in 21 ms returned sat
[2023-03-13 20:47:17] [INFO ] After 175ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-13 20:47:17] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-13 20:47:17] [INFO ] After 95ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-13 20:47:17] [INFO ] After 137ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-03-13 20:47:17] [INFO ] After 446ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
FORMULA AutonomousCar-PT-06a-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 40 ms.
Support contains 28 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 258/258 transitions.
Graph (complete) has 529 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 64 transition count 254
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 62 transition count 253
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 61 transition count 253
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 8 place count 61 transition count 252
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 10 place count 60 transition count 252
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 13 place count 57 transition count 231
Iterating global reduction 3 with 3 rules applied. Total rules applied 16 place count 57 transition count 231
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 19 place count 57 transition count 228
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 34 place count 54 transition count 216
Applied a total of 34 rules in 97 ms. Remains 54 /65 variables (removed 11) and now considering 216/258 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 54/65 places, 216/258 transitions.
Incomplete random walk after 10000 steps, including 535 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2638222 steps, run timeout after 3001 ms. (steps per millisecond=879 ) properties seen :{}
Probabilistic random walk after 2638222 steps, saw 381553 distinct states, run finished after 3017 ms. (steps per millisecond=874 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 216 rows 54 cols
[2023-03-13 20:47:20] [INFO ] Computed 10 place invariants in 30 ms
[2023-03-13 20:47:21] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 20:47:21] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-13 20:47:21] [INFO ] After 96ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 20:47:21] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-13 20:47:21] [INFO ] After 47ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 20:47:21] [INFO ] After 102ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-03-13 20:47:21] [INFO ] After 297ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 28 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 216/216 transitions.
Applied a total of 0 rules in 7 ms. Remains 54 /54 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 54/54 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 216/216 transitions.
Applied a total of 0 rules in 7 ms. Remains 54 /54 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-03-13 20:47:21] [INFO ] Invariant cache hit.
[2023-03-13 20:47:21] [INFO ] Implicit Places using invariants in 140 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 142 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 53/54 places, 216/216 transitions.
Applied a total of 0 rules in 5 ms. Remains 53 /53 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 154 ms. Remains : 53/54 places, 216/216 transitions.
Incomplete random walk after 10000 steps, including 495 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3003534 steps, run timeout after 3001 ms. (steps per millisecond=1000 ) properties seen :{}
Probabilistic random walk after 3003534 steps, saw 428840 distinct states, run finished after 3001 ms. (steps per millisecond=1000 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 216 rows 53 cols
[2023-03-13 20:47:24] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-13 20:47:24] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 20:47:24] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-13 20:47:24] [INFO ] After 130ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 20:47:25] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 1 ms to minimize.
[2023-03-13 20:47:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2023-03-13 20:47:25] [INFO ] After 300ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-13 20:47:25] [INFO ] After 399ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 28 out of 53 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 216/216 transitions.
Applied a total of 0 rules in 6 ms. Remains 53 /53 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 53/53 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 216/216 transitions.
Applied a total of 0 rules in 5 ms. Remains 53 /53 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-03-13 20:47:25] [INFO ] Invariant cache hit.
[2023-03-13 20:47:25] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-13 20:47:25] [INFO ] Invariant cache hit.
[2023-03-13 20:47:25] [INFO ] Implicit Places using invariants and state equation in 125 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 205 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 52/53 places, 216/216 transitions.
Applied a total of 0 rules in 21 ms. Remains 52 /52 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 232 ms. Remains : 52/53 places, 216/216 transitions.
Incomplete random walk after 10000 steps, including 505 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2970159 steps, run timeout after 3001 ms. (steps per millisecond=989 ) properties seen :{}
Probabilistic random walk after 2970159 steps, saw 425080 distinct states, run finished after 3001 ms. (steps per millisecond=989 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 216 rows 52 cols
[2023-03-13 20:47:28] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-13 20:47:28] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 20:47:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 20:47:28] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 20:47:28] [INFO ] After 162ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-13 20:47:28] [INFO ] After 251ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 28 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 216/216 transitions.
Applied a total of 0 rules in 28 ms. Remains 52 /52 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 52/52 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 216/216 transitions.
Applied a total of 0 rules in 4 ms. Remains 52 /52 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-03-13 20:47:28] [INFO ] Invariant cache hit.
[2023-03-13 20:47:28] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-13 20:47:28] [INFO ] Invariant cache hit.
[2023-03-13 20:47:28] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2023-03-13 20:47:28] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-13 20:47:28] [INFO ] Invariant cache hit.
[2023-03-13 20:47:29] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 383 ms. Remains : 52/52 places, 216/216 transitions.
Applied a total of 0 rules in 4 ms. Remains 52 /52 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-13 20:47:29] [INFO ] Invariant cache hit.
[2023-03-13 20:47:29] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 20:47:29] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-13 20:47:29] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 20:47:29] [INFO ] After 104ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-13 20:47:29] [INFO ] After 180ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-13 20:47:29] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2023-03-13 20:47:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 52 places, 216 transitions and 1673 arcs took 2 ms.
[2023-03-13 20:47:29] [INFO ] Flatten gal took : 95 ms
Total runtime 13365 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running AutonomousCar (PT), instance 06a
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: 52 places, 216 transitions, 1673 arcs.
Final Score: 1456.229
Took : 20 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: AutonomousCar-PT-06a-ReachabilityCardinality-00 (reachable &!potential( ( ( ( ( ( (tk(P46)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P46)) ) ) | ( ( (tk(P47)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P47)) ) ) ) | ( ( ( (tk(P13)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P13)) ) ) | ( ( (tk(P12)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P12)) ) ) ) ) | ( ( ( ( (tk(P28)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P28)) ) ) | ( ( ( (tk(P50)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P50)) ) ) & ( ( (tk(P7)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P7)) ) ) ) ) | ( ( ( ( (tk(P15)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P15)) ) ) & ( ( (tk(P52)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P52)) ) ) ) | ( ( ( ( (tk(P1)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1)) ) ) & ( ( ( ( ( (tk(P36)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P36)) ) ) & ( ( (tk(P33)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P33)) ) ) ) & ( ( ( ( (tk(P16)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P16)) ) ) | ( ( (tk(P31)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P31)) ) ) ) & ( ( ( ( (tk(P6)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P6)) ) ) | ( ( (tk(P50)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P50)) ) ) ) & ( ( ( (tk(P23)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P23)) ) ) | ( ( (tk(P51)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P51)) ) ) ) ) ) ) | ( ( ( ( ( (tk(P25)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P25)) ) ) | ( ( (tk(P44)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P44)) ) ) ) & ( ( ( (tk(P38)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P38)) ) ) | ( ( ( (tk(P2)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P2)) ) ) & ( ( (tk(P9)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P9)) ) ) ) ) ) | ( ( ( ( (tk(P44)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P44)) ) ) & ( ( (tk(P5)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P5)) ) ) ) & ( ( ( (tk(P27)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P27)) ) ) & ( ( (tk(P14)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P14)) ) ) ) ) ) ) ) | ( ( ( (tk(P49)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P49)) ) ) & ( ( ( ( (tk(P28)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P28)) ) ) | ( ( (tk(P46)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P46)) ) ) ) & ( ( ( (tk(P43)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P43)) ) ) | ( ( (tk(P34)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P34)) ) ) ) ) ) ) ) ) )))
FORMULA AutonomousCar-PT-06a-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS

BK_STOP 1678740471535

--------------------
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-06a"
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-06a, 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-167813600500614"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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