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.r010-oct2-167813599400678.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 marciexred
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 r010-oct2-167813599400678
=====================================================================

--------------------
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 1678704149368

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=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-10a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 10:42:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 10:42:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 10:42:32] [INFO ] Load time of PNML (sax parser for PT used): 228 ms
[2023-03-13 10:42:32] [INFO ] Transformed 97 places.
[2023-03-13 10:42:32] [INFO ] Transformed 1921 transitions.
[2023-03-13 10:42:32] [INFO ] Found NUPN structural information;
[2023-03-13 10:42:32] [INFO ] Parsed PT model containing 97 places and 1921 transitions and 29152 arcs in 490 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 26 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 459 resets, run finished after 539 ms. (steps per millisecond=18 ) properties (out of 9) seen :5
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-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-13 10:42:33] [INFO ] Flow matrix only has 1497 transitions (discarded 1 similar events)
// Phase 1: matrix 1497 rows 97 cols
[2023-03-13 10:42:33] [INFO ] Computed 15 place invariants in 25 ms
[2023-03-13 10:42:34] [INFO ] After 260ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 10:42:34] [INFO ] [Nat]Absence check using 15 positive place invariants in 25 ms returned sat
[2023-03-13 10:42:34] [INFO ] After 675ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 10:42:34] [INFO ] State equation strengthened by 403 read => feed constraints.
[2023-03-13 10:42:35] [INFO ] After 225ms SMT Verify possible using 403 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-13 10:42:35] [INFO ] Deduced a trap composed of 7 places in 712 ms of which 6 ms to minimize.
[2023-03-13 10:42:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 818 ms
[2023-03-13 10:42:36] [INFO ] After 1503ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 314 ms.
[2023-03-13 10:42:36] [INFO ] After 2665ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 154 ms.
Support contains 59 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 1498/1498 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 97 transition count 1493
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 94 transition count 1493
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 12 place count 90 transition count 1449
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 90 transition count 1449
Free-agglomeration rule applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 21 place count 90 transition count 1444
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 56 place count 85 transition count 1414
Applied a total of 56 rules in 390 ms. Remains 85 /97 variables (removed 12) and now considering 1414/1498 (removed 84) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 391 ms. Remains : 85/97 places, 1414/1498 transitions.
Incomplete random walk after 10000 steps, including 405 resets, run finished after 391 ms. (steps per millisecond=25 ) properties (out of 4) seen :2
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1414 rows 85 cols
[2023-03-13 10:42:37] [INFO ] Computed 15 place invariants in 33 ms
[2023-03-13 10:42:37] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 10:42:37] [INFO ] [Nat]Absence check using 15 positive place invariants in 4 ms returned sat
[2023-03-13 10:42:38] [INFO ] After 401ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 10:42:38] [INFO ] State equation strengthened by 332 read => feed constraints.
[2023-03-13 10:42:38] [INFO ] After 136ms SMT Verify possible using 332 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 10:42:38] [INFO ] After 354ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 137 ms.
[2023-03-13 10:42:38] [INFO ] After 955ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 80 ms.
Support contains 26 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 1414/1414 transitions.
Graph (complete) has 1165 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output 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 84 transition count 1411
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 82 transition count 1411
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 11 place count 77 transition count 1356
Iterating global reduction 2 with 5 rules applied. Total rules applied 16 place count 77 transition count 1356
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 18 place count 76 transition count 1355
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 76 transition count 1353
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 42 place count 74 transition count 1333
Applied a total of 42 rules in 269 ms. Remains 74 /85 variables (removed 11) and now considering 1333/1414 (removed 81) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 269 ms. Remains : 74/85 places, 1333/1414 transitions.
Incomplete random walk after 10000 steps, including 354 resets, run finished after 259 ms. (steps per millisecond=38 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 657552 steps, run timeout after 3001 ms. (steps per millisecond=219 ) properties seen :{}
Probabilistic random walk after 657552 steps, saw 80036 distinct states, run finished after 3005 ms. (steps per millisecond=218 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1333 rows 74 cols
[2023-03-13 10:42:42] [INFO ] Computed 15 place invariants in 22 ms
[2023-03-13 10:42:42] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 10:42:42] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-03-13 10:42:43] [INFO ] After 436ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 10:42:43] [INFO ] State equation strengthened by 262 read => feed constraints.
[2023-03-13 10:42:43] [INFO ] After 107ms SMT Verify possible using 262 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 10:42:43] [INFO ] After 321ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 120 ms.
[2023-03-13 10:42:43] [INFO ] After 971ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 86 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 94 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 94 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 82 ms. Remains 74 /74 variables (removed 0) and now considering 1333/1333 (removed 0) transitions.
[2023-03-13 10:42:43] [INFO ] Invariant cache hit.
[2023-03-13 10:42:44] [INFO ] Implicit Places using invariants in 683 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 690 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 116 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 889 ms. Remains : 73/74 places, 1333/1333 transitions.
Incomplete random walk after 10000 steps, including 374 resets, run finished after 283 ms. (steps per millisecond=35 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 716140 steps, run timeout after 3001 ms. (steps per millisecond=238 ) properties seen :{}
Probabilistic random walk after 716140 steps, saw 86213 distinct states, run finished after 3001 ms. (steps per millisecond=238 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1333 rows 73 cols
[2023-03-13 10:42:48] [INFO ] Computed 14 place invariants in 18 ms
[2023-03-13 10:42:48] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 10:42:48] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-13 10:42:48] [INFO ] After 440ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 10:42:48] [INFO ] After 654ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 108 ms.
[2023-03-13 10:42:48] [INFO ] After 804ms 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 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 82 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 82 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 81 ms. Remains 73 /73 variables (removed 0) and now considering 1333/1333 (removed 0) transitions.
[2023-03-13 10:42:49] [INFO ] Invariant cache hit.
[2023-03-13 10:42:49] [INFO ] Implicit Places using invariants in 640 ms returned []
[2023-03-13 10:42:49] [INFO ] Invariant cache hit.
[2023-03-13 10:42:50] [INFO ] Implicit Places using invariants and state equation in 1015 ms returned [71]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1676 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 123 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 1881 ms. Remains : 72/73 places, 1333/1333 transitions.
Incomplete random walk after 10000 steps, including 359 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 713229 steps, run timeout after 3001 ms. (steps per millisecond=237 ) properties seen :{}
Probabilistic random walk after 713229 steps, saw 85808 distinct states, run finished after 3001 ms. (steps per millisecond=237 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1333 rows 72 cols
[2023-03-13 10:42:54] [INFO ] Computed 13 place invariants in 9 ms
[2023-03-13 10:42:54] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 10:42:54] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-13 10:42:55] [INFO ] After 497ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 10:42:55] [INFO ] After 653ms 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 10:42:55] [INFO ] After 841ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 71 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 77 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 78 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 116 ms. Remains 72 /72 variables (removed 0) and now considering 1333/1333 (removed 0) transitions.
[2023-03-13 10:42:55] [INFO ] Invariant cache hit.
[2023-03-13 10:42:56] [INFO ] Implicit Places using invariants in 630 ms returned []
[2023-03-13 10:42:56] [INFO ] Invariant cache hit.
[2023-03-13 10:42:57] [INFO ] Implicit Places using invariants and state equation in 809 ms returned []
Implicit Place search using SMT with State Equation took 1447 ms to find 0 implicit places.
[2023-03-13 10:42:57] [INFO ] Redundant transitions in 117 ms returned []
[2023-03-13 10:42:57] [INFO ] Invariant cache hit.
[2023-03-13 10:42:57] [INFO ] Dead Transitions using invariants and state equation in 550 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2244 ms. Remains : 72/72 places, 1333/1333 transitions.
Applied a total of 0 rules in 81 ms. Remains 72 /72 variables (removed 0) and now considering 1333/1333 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-13 10:42:57] [INFO ] Invariant cache hit.
[2023-03-13 10:42:57] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 10:42:57] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-13 10:42:58] [INFO ] After 478ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 10:42:58] [INFO ] After 638ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 106 ms.
[2023-03-13 10:42:58] [INFO ] After 813ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-13 10:42:58] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 9 ms.
[2023-03-13 10:42:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 72 places, 1333 transitions and 24207 arcs took 41 ms.
[2023-03-13 10:42:59] [INFO ] Flatten gal took : 414 ms
Total runtime 27357 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: AutonomousCar_PT_10a
(NrP: 72 NrTr: 1333 NrArc: 24207)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.052sec

net check time: 0m 0.002sec

init dd package: 0m 2.986sec


RS generation: 0m41.060sec


-> reachability set: #nodes 33395 (3.3e+04) #states 1,100,783,618 (9)



starting MCC model checker
--------------------------

checking: AG [[[1<=p68 & p68<=1] | [p14<=0 & 0<=p14]]]
normalized: ~ [E [true U ~ [[[1<=p68 & p68<=1] | [p14<=0 & 0<=p14]]]]]

abstracting: (0<=p14)
states: 1,100,783,618 (9)
abstracting: (p14<=0)
states: 917,489,666 (8)
abstracting: (p68<=1)
states: 1,100,783,618 (9)
abstracting: (1<=p68)
states: 878,239,745 (8)
-> the formula is FALSE

FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 10m34.308sec

checking: EF [[[[[[[1<=p2 & p2<=1] | [0<=p7 & p7<=0]] & [1<=p35 & p35<=1]] & [[1<=p27 & p27<=1] & [0<=p49 & p49<=0]]] | [[[[[p26<=1 & 1<=p26] & [0<=p36 & p36<=0]] | [p49<=1 & 1<=p49]] & [[[[1<=p57 & p57<=1] & [1<=p27 & p27<=1]] & [0<=p11 & p11<=0]] | [1<=p22 & p22<=1]]] & [p20<=0 & 0<=p20]]] & [[p69<=1 & 1<=p69] | [[[[0<=p30 & p30<=0] & [p70<=0 & 0<=p70]] & [[0<=p58 & p58<=0] & [p34<=1 & 1<=p34]]] & [[[[1<=p62 & p62<=1] | [0<=p53 & p53<=0]] & [1<=p32 & p32<=1]] & [[[[1<=p23 & p23<=1] & [0<=p14 & p14<=0]] | [[0<=p13 & p13<=0] & [p17<=1 & 1<=p17]]] & [[p38<=1 & 1<=p38] | [[p32<=0 & 0<=p32] & [p16<=1 & 1<=p16]]]]]]]]]
normalized: E [true U [[[[[[[[p16<=1 & 1<=p16] & [p32<=0 & 0<=p32]] | [p38<=1 & 1<=p38]] & [[[p17<=1 & 1<=p17] & [0<=p13 & p13<=0]] | [[0<=p14 & p14<=0] & [1<=p23 & p23<=1]]]] & [[1<=p32 & p32<=1] & [[0<=p53 & p53<=0] | [1<=p62 & p62<=1]]]] & [[[p34<=1 & 1<=p34] & [0<=p58 & p58<=0]] & [[p70<=0 & 0<=p70] & [0<=p30 & p30<=0]]]] | [p69<=1 & 1<=p69]] & [[[p20<=0 & 0<=p20] & [[[1<=p22 & p22<=1] | [[0<=p11 & p11<=0] & [[1<=p27 & p27<=1] & [1<=p57 & p57<=1]]]] & [[p49<=1 & 1<=p49] | [[0<=p36 & p36<=0] & [p26<=1 & 1<=p26]]]]] | [[[0<=p49 & p49<=0] & [1<=p27 & p27<=1]] & [[1<=p35 & p35<=1] & [[0<=p7 & p7<=0] | [1<=p2 & p2<=1]]]]]]]

abstracting: (p2<=1)
states: 1,100,783,618 (9)
abstracting: (1<=p2)
states: 83,607,552 (7)
abstracting: (p7<=0)
states: 1,008,091,138 (9)
abstracting: (0<=p7)
states: 1,100,783,618 (9)
abstracting: (p35<=1)
states: 1,100,783,618 (9)
abstracting: (1<=p35)
states: 154,869,760 (8)
abstracting: (p27<=1)
states: 1,100,783,618 (9)
abstracting: (1<=p27)
states: 183,293,952 (8)
abstracting: (p49<=0)
states: 917,489,666 (8)
abstracting: (0<=p49)
states: 1,100,783,618 (9)
abstracting: (1<=p26)
states: 183,803,904 (8)
abstracting: (p26<=1)
states: 1,100,783,618 (9)
abstracting: (p36<=0)
states: 942,858,242 (8)
abstracting: (0<=p36)
states: 1,100,783,618 (9)
abstracting: (1<=p49)
states: 183,293,952 (8)
abstracting: (p49<=1)
states: 1,100,783,618 (9)
abstracting: (p57<=1)
states: 1,100,783,618 (9)
abstracting: (1<=p57)
states: 275,705,857 (8)
abstracting: (p27<=1)
states: 1,100,783,618 (9)
abstracting: (1<=p27)
states: 183,293,952 (8)
abstracting: (p11<=0)
states: 1,008,091,138 (9)
abstracting: (0<=p11)
states: 1,100,783,618 (9)
abstracting: (p22<=1)
states: 1,100,783,618 (9)
abstracting: (1<=p22)
states: 275,705,857 (8)
abstracting: (0<=p20)
states: 1,100,783,618 (9)
abstracting: (p20<=0)
states: 825,077,762 (8)
abstracting: (1<=p69)
states: 222,543,872 (8)
abstracting: (p69<=1)
states: 1,100,783,618 (9)
abstracting: (p30<=0)
states: 825,077,762 (8)
abstracting: (0<=p30)
states: 1,100,783,618 (9)
abstracting: (0<=p70)
states: 1,100,783,618 (9)
abstracting: (p70<=0)
states: 878,239,746 (8)
abstracting: (p58<=0)
states: 917,489,666 (8)
abstracting: (0<=p58)
states: 1,100,783,618 (9)
abstracting: (1<=p34)
states: 157,515,776 (8)
abstracting: (p34<=1)
states: 1,100,783,618 (9)
abstracting: (p62<=1)
states: 1,100,783,618 (9)
abstracting: (1<=p62)
states: 183,293,952 (8)
abstracting: (p53<=0)
states: 916,979,713 (8)
abstracting: (0<=p53)
states: 1,100,783,618 (9)
abstracting: (p32<=1)
states: 1,100,783,618 (9)
abstracting: (1<=p32)
states: 275,705,857 (8)
abstracting: (p23<=1)
states: 1,100,783,618 (9)
abstracting: (1<=p23)
states: 183,293,952 (8)
abstracting: (p14<=0)
states: 917,489,666 (8)
abstracting: (0<=p14)
states: 1,100,783,618 (9)
abstracting: (p13<=0)
states: 917,489,666 (8)
abstracting: (0<=p13)
states: 1,100,783,618 (9)
abstracting: (1<=p17)
states: 183,293,952 (8)
abstracting: (p17<=1)
states: 1,100,783,618 (9)
abstracting: (1<=p38)
states: 157,515,776 (8)
abstracting: (p38<=1)
states: 1,100,783,618 (9)
abstracting: (0<=p32)
states: 1,100,783,618 (9)
abstracting: (p32<=0)
states: 825,077,761 (8)
abstracting: (1<=p16)
states: 183,803,904 (8)
abstracting: (p16<=1)
states: 1,100,783,618 (9)

before gc: list nodes free: 1017326

after gc: idd nodes used:484259, unused:63515741; list nodes free:308151295
-> the formula is TRUE

FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 16m23.170sec

totally nodes used: 79832904 (8.0e+07)
number of garbage collections: 1
fire ops cache: hits/miss/sum: 2734164926 69900292 2804065218
used/not used/entry size/cache size: 67108729 135 16 1024MB
basic ops cache: hits/miss/sum: 116091930 82688213 198780143
used/not used/entry size/cache size: 13919527 2857689 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 196202 429970 626172
used/not used/entry size/cache size: 0 8388608 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 52777085
1 12531250
2 1630085
3 156970
4 12591
5 832
6 49
7 1
8 1
9 0
>= 10 0

Total processing time: 27m45.371sec


BK_STOP 1678705845103

--------------------
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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.006sec

29017 34281 35745
iterations count:329359 (247), effective:2459 (1)

initing FirstDep: 0m 0.003sec

17683 17864 17540 17766 17832 17617 18052 17743 17950 17966 18208 17840 17959 18389 18386 18307 17941 18168 18397 18426 18564 18788 18928 18746 18719 18638 18908 19163 19383 19395 19523 19712 19963 19901 19852 19683 18919 18779 19184 19166 19678 19563 19261 19895 19946 20181 20196 20001 20302 20067 20107 20014 19915 19757 19626 19370 19475 19522 20197 20244 20172 20327 20387 21039 21131 21496 21616 21354 21743 21518 21514 21466 21336 21133 20802 20444 19442 20130 19849 20692 20893 20405 21030 21249 20649 21128 21435 20731 21047 20984 20832 20911 20874 21722 22016 21988 22675 23002 22572 23182 23338 22943 23207 23391 22998 23224 23027 23126 23093 23073 22875 23106 23000 22861 22925 22869 22657 22581 22642 22528 22354 22155 22328 22226 21939 21931 21737 21333 21221 21101 20939 20687 20217 21647 21995 21456 22427 22798 22104 22978 23356 22561 23259 23692 22968 23265 23388 23381 23099 23131 24139 24787 24481 25141 25516 25251 25776 26053 25752 26140 26261 26044 26112 25927 26085 26142 26031 25916 26123 25950 25896 25835 25768 25635 25693 25534 25401 25180 25071 25197 25051 24689 24610 24228 23771 23479 23154 22809 22512 21898
iterations count:19053262 (14293), effective:129607 (97)
27551 27201 27733 27681 27500 27606 27889 28679 28600 28782 28899 29152 29213 29132 32948 33125 33382 33376 33262 33292 33481 33235 33371 32887 32756 32375 32989 32911 32694 32877 33310 33355 33031 30735 30858 30969 30788 31320 31733 31753 31483 31499 31599 31653 31622 31520 32063 32425 32824 32746 32581 32777 32919 32991 32833 33167 32655 33010 32575 32386 32131 32690 33246 33113 33164 33165 33959 34551 34550 34549 34493 34426 34653 34835 34747 35014 34670 34901 34572 34207 33819 33087 31022 31958 33065 32997 33424 33724 33792 34311 34496 34519 34683 34609 34863 35387 34506 35103 34777 35064 34554 34632 34856 35030 35110 34889 35107 34620 34734 34961 34835 34964 34673 34613 34427 34995 36241 36256 36967 36786 37280 37378 37280 37765 38254 37724 38188 38107 38444 38566 38205 38735 39127 38309 38882 38679 38967 39007 38867 39238 39390 38864 39321 39384 39001 39426 39430 39345 39269 39457 39354 39489 39248 39237 39058 39291 39182 39310 39336 39321 39380 38935 38996 38703 38701 38511 38611 38231 38308 37965 37743 37347 37673 37426 37676 37374 37459 37114 37128 36840 36476 36479 36316 36019 35949 35597 35409 35004 35822 36865 36519 37386 37221 37753 38133 38625 38182 38819 38577 38888 38853 39049 39422 38654 39390 39015 39327 39051 38931 39211 39114 39511 39051 39569 39568 39423 39296 39461 39366 39366 39090 39065 38837 39731 40872 41491 41510 41462 41971 41969 41867 42613 42738 43157 43206 42991 43152 43418 43306 43864 44277 43536 43982 43873 44128 44250 44059 44383 44706 44212 44772 44815 44282 45068 44866 44687 44941 44786 44984 44912 44926 44744 44704 44616 44900 44592 44923 44546 44647 44462 44380 44237 44049 44070 43813 43773 43613 43388 43138 42814 42732 42504 42443 42382 42282 42230 41756 41650 41151 40889 40486 40394 40096 39930 39368 38899 38312
iterations count:29731457 (22304), effective:205834 (154)

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="marciexred"
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 marciexred"
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 r010-oct2-167813599400678"
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 ;