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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 7.7K Feb 25 12:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 12:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 12:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 12:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 12:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 12:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 12:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 114K Feb 25 12:58 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 1.5M 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-10a-ReachabilityCardinality-00
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-01
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-02
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-03
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-04
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-05
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-06
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-07
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-08
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-09
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-10
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-11
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-12
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-13
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-14
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678741748050

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-10a
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 21:09:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 21:09:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 21:09:10] [INFO ] Load time of PNML (sax parser for PT used): 232 ms
[2023-03-13 21:09:10] [INFO ] Transformed 97 places.
[2023-03-13 21:09:10] [INFO ] Transformed 1921 transitions.
[2023-03-13 21:09:10] [INFO ] Found NUPN structural information;
[2023-03-13 21:09:10] [INFO ] Parsed PT model containing 97 places and 1921 transitions and 29152 arcs in 371 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 423 transitions
Reduce redundant transitions removed 423 transitions.
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 452 resets, run finished after 491 ms. (steps per millisecond=20 ) properties (out of 9) seen :7
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-13 21:09:11] [INFO ] Flow matrix only has 1497 transitions (discarded 1 similar events)
// Phase 1: matrix 1497 rows 97 cols
[2023-03-13 21:09:11] [INFO ] Computed 15 place invariants in 39 ms
[2023-03-13 21:09:11] [INFO ] After 352ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 21:09:12] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2023-03-13 21:09:12] [INFO ] After 491ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 21:09:12] [INFO ] State equation strengthened by 403 read => feed constraints.
[2023-03-13 21:09:12] [INFO ] After 159ms SMT Verify possible using 403 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 21:09:13] [INFO ] After 437ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 224 ms.
[2023-03-13 21:09:13] [INFO ] After 1299ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 112 ms.
Support contains 26 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 1498/1498 transitions.
Graph (complete) has 1257 edges and 97 vertex of which 96 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.17 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 96 transition count 1489
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 15 place count 90 transition count 1489
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 15 place count 90 transition count 1488
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 89 transition count 1488
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 26 place count 80 transition count 1389
Iterating global reduction 2 with 9 rules applied. Total rules applied 35 place count 80 transition count 1389
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 37 place count 79 transition count 1388
Free-agglomeration rule applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 42 place count 79 transition count 1383
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 2 with 55 rules applied. Total rules applied 97 place count 74 transition count 1333
Applied a total of 97 rules in 443 ms. Remains 74 /97 variables (removed 23) and now considering 1333/1498 (removed 165) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 445 ms. Remains : 74/97 places, 1333/1498 transitions.
Incomplete random walk after 10000 steps, including 351 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 719785 steps, run timeout after 3001 ms. (steps per millisecond=239 ) properties seen :{}
Probabilistic random walk after 719785 steps, saw 86753 distinct states, run finished after 3005 ms. (steps per millisecond=239 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1333 rows 74 cols
[2023-03-13 21:09:17] [INFO ] Computed 15 place invariants in 19 ms
[2023-03-13 21:09:17] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 21:09:17] [INFO ] [Nat]Absence check using 15 positive place invariants in 4 ms returned sat
[2023-03-13 21:09:17] [INFO ] After 549ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 21:09:17] [INFO ] State equation strengthened by 262 read => feed constraints.
[2023-03-13 21:09:17] [INFO ] After 82ms SMT Verify possible using 262 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 21:09:18] [INFO ] After 212ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 125 ms.
[2023-03-13 21:09:18] [INFO ] After 959ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 84 ms.
Support contains 26 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 1333/1333 transitions.
Applied a total of 0 rules in 123 ms. Remains 74 /74 variables (removed 0) and now considering 1333/1333 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 74/74 places, 1333/1333 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 1333/1333 transitions.
Applied a total of 0 rules in 91 ms. Remains 74 /74 variables (removed 0) and now considering 1333/1333 (removed 0) transitions.
[2023-03-13 21:09:18] [INFO ] Invariant cache hit.
[2023-03-13 21:09:19] [INFO ] Implicit Places using invariants in 542 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 548 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 73/74 places, 1333/1333 transitions.
Applied a total of 0 rules in 117 ms. Remains 73 /73 variables (removed 0) and now considering 1333/1333 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 760 ms. Remains : 73/74 places, 1333/1333 transitions.
Incomplete random walk after 10000 steps, including 367 resets, run finished after 270 ms. (steps per millisecond=37 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 676711 steps, run timeout after 3001 ms. (steps per millisecond=225 ) properties seen :{}
Probabilistic random walk after 676711 steps, saw 82428 distinct states, run finished after 3002 ms. (steps per millisecond=225 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1333 rows 73 cols
[2023-03-13 21:09:22] [INFO ] Computed 14 place invariants in 21 ms
[2023-03-13 21:09:22] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 21:09:22] [INFO ] [Nat]Absence check using 14 positive place invariants in 18 ms returned sat
[2023-03-13 21:09:23] [INFO ] After 596ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 21:09:23] [INFO ] After 816ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 96 ms.
[2023-03-13 21:09:23] [INFO ] After 987ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 50 ms.
Support contains 26 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 1333/1333 transitions.
Applied a total of 0 rules in 188 ms. Remains 73 /73 variables (removed 0) and now considering 1333/1333 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 188 ms. Remains : 73/73 places, 1333/1333 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 1333/1333 transitions.
Applied a total of 0 rules in 118 ms. Remains 73 /73 variables (removed 0) and now considering 1333/1333 (removed 0) transitions.
[2023-03-13 21:09:23] [INFO ] Invariant cache hit.
[2023-03-13 21:09:24] [INFO ] Implicit Places using invariants in 709 ms returned []
[2023-03-13 21:09:24] [INFO ] Invariant cache hit.
[2023-03-13 21:09:26] [INFO ] Implicit Places using invariants and state equation in 1297 ms returned [71]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2012 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 72/73 places, 1333/1333 transitions.
Applied a total of 0 rules in 84 ms. Remains 72 /72 variables (removed 0) and now considering 1333/1333 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2214 ms. Remains : 72/73 places, 1333/1333 transitions.
Incomplete random walk after 10000 steps, including 341 resets, run finished after 307 ms. (steps per millisecond=32 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 727638 steps, run timeout after 3001 ms. (steps per millisecond=242 ) properties seen :{}
Probabilistic random walk after 727638 steps, saw 87749 distinct states, run finished after 3001 ms. (steps per millisecond=242 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1333 rows 72 cols
[2023-03-13 21:09:29] [INFO ] Computed 13 place invariants in 7 ms
[2023-03-13 21:09:29] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 21:09:29] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-13 21:09:30] [INFO ] After 399ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 21:09:30] [INFO ] After 640ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 109 ms.
[2023-03-13 21:09:30] [INFO ] After 822ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 87 ms.
Support contains 26 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 1333/1333 transitions.
Applied a total of 0 rules in 107 ms. Remains 72 /72 variables (removed 0) and now considering 1333/1333 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 72/72 places, 1333/1333 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 1333/1333 transitions.
Applied a total of 0 rules in 90 ms. Remains 72 /72 variables (removed 0) and now considering 1333/1333 (removed 0) transitions.
[2023-03-13 21:09:30] [INFO ] Invariant cache hit.
[2023-03-13 21:09:31] [INFO ] Implicit Places using invariants in 550 ms returned []
[2023-03-13 21:09:31] [INFO ] Invariant cache hit.
[2023-03-13 21:09:32] [INFO ] Implicit Places using invariants and state equation in 1162 ms returned []
Implicit Place search using SMT with State Equation took 1733 ms to find 0 implicit places.
[2023-03-13 21:09:32] [INFO ] Redundant transitions in 134 ms returned []
[2023-03-13 21:09:32] [INFO ] Invariant cache hit.
[2023-03-13 21:09:33] [INFO ] Dead Transitions using invariants and state equation in 645 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2617 ms. Remains : 72/72 places, 1333/1333 transitions.
Applied a total of 0 rules in 85 ms. Remains 72 /72 variables (removed 0) and now considering 1333/1333 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-13 21:09:33] [INFO ] Invariant cache hit.
[2023-03-13 21:09:33] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 21:09:33] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-13 21:09:34] [INFO ] After 447ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 21:09:34] [INFO ] After 634ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 105 ms.
[2023-03-13 21:09:34] [INFO ] After 843ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-13 21:09:34] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 11 ms.
[2023-03-13 21:09:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 72 places, 1333 transitions and 24207 arcs took 22 ms.
[2023-03-13 21:09:35] [INFO ] Flatten gal took : 405 ms
Total runtime 24894 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running AutonomousCar (PT), instance 10a
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: 72 places, 1333 transitions, 24207 arcs.
Final Score: 11012.48
Took : 106 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: AutonomousCar-PT-10a-ReachabilityCardinality-06 (reachable &!potential( ( ( ( (tk(P15)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P15)) ) ) | ( ( (tk(P69)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P69)) ) ) )))
PROPERTY: AutonomousCar-PT-10a-ReachabilityCardinality-08 (reachable & potential(( ( ( ( ( (tk(P21)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P21)) ) ) & ( ( ( ( (tk(P50)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P50)) ) ) | ( ( ( (tk(P37)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P37)) ) ) & ( ( (tk(P27)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P27)) ) ) ) ) & ( ( ( (tk(P23)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P23)) ) ) | ( ( ( (tk(P12)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P12)) ) ) & ( ( ( (tk(P28)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P28)) ) ) & ( ( (tk(P58)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P58)) ) ) ) ) ) ) ) | ( ( ( ( (tk(P50)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P50)) ) ) & ( ( (tk(P28)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P28)) ) ) ) & ( ( ( (tk(P36)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P36)) ) ) & ( ( ( (tk(P3)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P3)) ) ) | ( ( (tk(P8)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P8)) ) ) ) ) ) ) & ( ( ( (tk(P70)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P70)) ) ) | ( ( ( ( ( (tk(P31)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P31)) ) ) & ( ( (tk(P71)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P71)) ) ) ) & ( ( ( (tk(P35)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P35)) ) ) & ( ( (tk(P59)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P59)) ) ) ) ) & ( ( ( ( (tk(P33)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P33)) ) ) & ( ( ( (tk(P54)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P54)) ) ) | ( ( (tk(P63)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P63)) ) ) ) ) & ( ( ( ( ( (tk(P15)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P15)) ) ) & ( ( (tk(P24)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P24)) ) ) ) | ( ( ( (tk(P14)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P14)) ) ) & ( ( (tk(P18)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P18)) ) ) ) ) & ( ( ( (tk(P39)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P39)) ) ) | ( ( ( (tk(P33)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P33)) ) ) & ( ( (tk(P17)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P17)) ) ) ) ) ) ) ) ) )))
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS

BK_STOP 1678744180146

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

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