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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 5.8K Feb 25 12:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 12:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 12:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 12:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 7.7K Feb 25 12:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 25 12:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 25 12:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 12:53 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 781K 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-09a-ReachabilityCardinality-00
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityCardinality-01
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityCardinality-02
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityCardinality-03
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityCardinality-04
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityCardinality-05
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityCardinality-06
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityCardinality-07
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityCardinality-08
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityCardinality-09
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityCardinality-10
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityCardinality-11
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityCardinality-12
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityCardinality-13
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityCardinality-14
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678703185984

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-09a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 10:26:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 10:26:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 10:26:29] [INFO ] Load time of PNML (sax parser for PT used): 150 ms
[2023-03-13 10:26:29] [INFO ] Transformed 89 places.
[2023-03-13 10:26:29] [INFO ] Transformed 1249 transitions.
[2023-03-13 10:26:29] [INFO ] Found NUPN structural information;
[2023-03-13 10:26:29] [INFO ] Parsed PT model containing 89 places and 1249 transitions and 15631 arcs in 273 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 345 transitions
Reduce redundant transitions removed 345 transitions.
FORMULA AutonomousCar-PT-09a-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09a-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09a-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09a-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09a-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09a-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09a-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 484 resets, run finished after 628 ms. (steps per millisecond=15 ) properties (out of 9) seen :6
FORMULA AutonomousCar-PT-09a-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09a-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09a-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09a-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09a-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09a-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-13 10:26:30] [INFO ] Flow matrix only has 903 transitions (discarded 1 similar events)
// Phase 1: matrix 903 rows 89 cols
[2023-03-13 10:26:30] [INFO ] Computed 14 place invariants in 19 ms
[2023-03-13 10:26:31] [INFO ] After 636ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 10:26:31] [INFO ] [Nat]Absence check using 14 positive place invariants in 15 ms returned sat
[2023-03-13 10:26:32] [INFO ] After 718ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 10:26:32] [INFO ] State equation strengthened by 327 read => feed constraints.
[2023-03-13 10:26:32] [INFO ] After 467ms SMT Verify possible using 327 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 10:26:33] [INFO ] After 1091ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 421 ms.
[2023-03-13 10:26:33] [INFO ] After 2399ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 252 ms.
Support contains 34 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 904/904 transitions.
Graph (complete) has 1045 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.59 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 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 88 transition count 898
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 10 place count 84 transition count 898
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 13 place count 81 transition count 868
Iterating global reduction 2 with 3 rules applied. Total rules applied 16 place count 81 transition count 868
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 80 transition count 867
Free-agglomeration rule applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 25 place count 80 transition count 860
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 43 rules applied. Total rules applied 68 place count 73 transition count 824
Applied a total of 68 rules in 264 ms. Remains 73 /89 variables (removed 16) and now considering 824/904 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 265 ms. Remains : 73/89 places, 824/904 transitions.
Incomplete random walk after 10000 steps, including 399 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 533663 steps, run timeout after 3012 ms. (steps per millisecond=177 ) properties seen :{}
Probabilistic random walk after 533663 steps, saw 83151 distinct states, run finished after 3014 ms. (steps per millisecond=177 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 824 rows 73 cols
[2023-03-13 10:26:37] [INFO ] Computed 13 place invariants in 14 ms
[2023-03-13 10:26:37] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 10:26:37] [INFO ] [Nat]Absence check using 13 positive place invariants in 39 ms returned sat
[2023-03-13 10:26:38] [INFO ] After 728ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 10:26:38] [INFO ] State equation strengthened by 263 read => feed constraints.
[2023-03-13 10:26:39] [INFO ] After 466ms SMT Verify possible using 263 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 10:26:39] [INFO ] After 940ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 404 ms.
[2023-03-13 10:26:40] [INFO ] After 2256ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 205 ms.
Support contains 33 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 824/824 transitions.
Applied a total of 0 rules in 74 ms. Remains 73 /73 variables (removed 0) and now considering 824/824 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 73/73 places, 824/824 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 824/824 transitions.
Applied a total of 0 rules in 61 ms. Remains 73 /73 variables (removed 0) and now considering 824/824 (removed 0) transitions.
[2023-03-13 10:26:40] [INFO ] Invariant cache hit.
[2023-03-13 10:26:41] [INFO ] Implicit Places using invariants in 769 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 776 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 72/73 places, 824/824 transitions.
Applied a total of 0 rules in 64 ms. Remains 72 /72 variables (removed 0) and now considering 824/824 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 901 ms. Remains : 72/73 places, 824/824 transitions.
Incomplete random walk after 10000 steps, including 393 resets, run finished after 276 ms. (steps per millisecond=36 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :1
FORMULA AutonomousCar-PT-09a-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 824 rows 72 cols
[2023-03-13 10:26:41] [INFO ] Computed 12 place invariants in 6 ms
[2023-03-13 10:26:41] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 10:26:41] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-13 10:26:42] [INFO ] After 513ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 10:26:42] [INFO ] After 956ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 271 ms.
[2023-03-13 10:26:42] [INFO ] After 1267ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 104 ms.
Support contains 31 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 824/824 transitions.
Applied a total of 0 rules in 36 ms. Remains 72 /72 variables (removed 0) and now considering 824/824 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 72/72 places, 824/824 transitions.
Incomplete random walk after 10000 steps, including 401 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 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 39 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 701612 steps, run timeout after 3001 ms. (steps per millisecond=233 ) properties seen :{}
Probabilistic random walk after 701612 steps, saw 105804 distinct states, run finished after 3001 ms. (steps per millisecond=233 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-13 10:26:46] [INFO ] Invariant cache hit.
[2023-03-13 10:26:46] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 10:26:46] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-13 10:26:46] [INFO ] After 483ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 10:26:47] [INFO ] After 860ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 325 ms.
[2023-03-13 10:26:47] [INFO ] After 1256ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 169 ms.
Support contains 31 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 824/824 transitions.
Applied a total of 0 rules in 43 ms. Remains 72 /72 variables (removed 0) and now considering 824/824 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 72/72 places, 824/824 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 824/824 transitions.
Applied a total of 0 rules in 33 ms. Remains 72 /72 variables (removed 0) and now considering 824/824 (removed 0) transitions.
[2023-03-13 10:26:47] [INFO ] Invariant cache hit.
[2023-03-13 10:26:48] [INFO ] Implicit Places using invariants in 488 ms returned []
[2023-03-13 10:26:48] [INFO ] Invariant cache hit.
[2023-03-13 10:26:49] [INFO ] Implicit Places using invariants and state equation in 756 ms returned [67, 70]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1278 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 70/72 places, 824/824 transitions.
Applied a total of 0 rules in 63 ms. Remains 70 /70 variables (removed 0) and now considering 824/824 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1375 ms. Remains : 70/72 places, 824/824 transitions.
Incomplete random walk after 10000 steps, including 377 resets, run finished after 305 ms. (steps per millisecond=32 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 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 33 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 733060 steps, run timeout after 3007 ms. (steps per millisecond=243 ) properties seen :{}
Probabilistic random walk after 733060 steps, saw 110118 distinct states, run finished after 3007 ms. (steps per millisecond=243 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 824 rows 70 cols
[2023-03-13 10:26:52] [INFO ] Computed 10 place invariants in 9 ms
[2023-03-13 10:26:52] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 10:26:52] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-13 10:26:53] [INFO ] After 440ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 10:26:53] [INFO ] After 724ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 306 ms.
[2023-03-13 10:26:53] [INFO ] After 1110ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 183 ms.
Support contains 31 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 824/824 transitions.
Applied a total of 0 rules in 35 ms. Remains 70 /70 variables (removed 0) and now considering 824/824 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 70/70 places, 824/824 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 824/824 transitions.
Applied a total of 0 rules in 48 ms. Remains 70 /70 variables (removed 0) and now considering 824/824 (removed 0) transitions.
[2023-03-13 10:26:54] [INFO ] Invariant cache hit.
[2023-03-13 10:26:54] [INFO ] Implicit Places using invariants in 473 ms returned []
[2023-03-13 10:26:54] [INFO ] Invariant cache hit.
[2023-03-13 10:26:55] [INFO ] Implicit Places using invariants and state equation in 662 ms returned []
Implicit Place search using SMT with State Equation took 1167 ms to find 0 implicit places.
[2023-03-13 10:26:55] [INFO ] Redundant transitions in 74 ms returned []
[2023-03-13 10:26:55] [INFO ] Invariant cache hit.
[2023-03-13 10:26:56] [INFO ] Dead Transitions using invariants and state equation in 619 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1948 ms. Remains : 70/70 places, 824/824 transitions.
Applied a total of 0 rules in 35 ms. Remains 70 /70 variables (removed 0) and now considering 824/824 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-13 10:26:56] [INFO ] Invariant cache hit.
[2023-03-13 10:26:56] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 10:26:56] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-13 10:26:56] [INFO ] After 574ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 10:26:57] [INFO ] After 934ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 319 ms.
[2023-03-13 10:26:57] [INFO ] After 1345ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-13 10:26:57] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 11 ms.
[2023-03-13 10:26:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 70 places, 824 transitions and 11924 arcs took 21 ms.
[2023-03-13 10:26:58] [INFO ] Flatten gal took : 207 ms
Total runtime 28814 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_09a
(NrP: 70 NrTr: 824 NrArc: 11924)

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

net check time: 0m 0.001sec

init dd package: 0m 3.000sec


RS generation: 1m46.217sec


-> reachability set: #nodes 53810 (5.4e+04) #states 661,694,978 (8)



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

checking: AG [[[[[[[[[p62<=1 & 1<=p62] & [p23<=0 & 0<=p23]] | [p33<=0 & 0<=p33]] & [[[[0<=p51 & p51<=0] & [[p49<=0 & 0<=p49] | [p63<=1 & 1<=p63]]] | [0<=p35 & p35<=0]] | [[1<=p33 & p33<=1] | [0<=p61 & p61<=0]]]] & [[[1<=p25 & p25<=1] | [0<=p55 & p55<=0]] & [p2<=0 & 0<=p2]]] | [1<=p60 & p60<=1]] | [0<=p34 & p34<=0]] | [[p67<=0 & 0<=p67] | [[p57<=0 & 0<=p57] | [p13<=1 & 1<=p13]]]]]
normalized: ~ [E [true U ~ [[[[[[[[[p62<=1 & 1<=p62] & [p23<=0 & 0<=p23]] | [p33<=0 & 0<=p33]] & [[[[0<=p51 & p51<=0] & [[p49<=0 & 0<=p49] | [p63<=1 & 1<=p63]]] | [0<=p35 & p35<=0]] | [[1<=p33 & p33<=1] | [0<=p61 & p61<=0]]]] & [[[1<=p25 & p25<=1] | [0<=p55 & p55<=0]] & [p2<=0 & 0<=p2]]] | [1<=p60 & p60<=1]] | [0<=p34 & p34<=0]] | [[p67<=0 & 0<=p67] | [[p57<=0 & 0<=p57] | [p13<=1 & 1<=p13]]]]]]]

abstracting: (1<=p13)
states: 131,781,888 (8)
abstracting: (p13<=1)
states: 661,694,978 (8)
abstracting: (0<=p57)
states: 661,694,978 (8)
abstracting: (p57<=0)
states: 550,321,538 (8)
abstracting: (0<=p67)
states: 661,694,978 (8)
abstracting: (p67<=0)
states: 528,797,378 (8)
abstracting: (p34<=0)
states: 567,395,714 (8)
abstracting: (0<=p34)
states: 661,694,978 (8)
abstracting: (p60<=1)
states: 661,694,978 (8)
abstracting: (1<=p60)
states: 3,528,000 (6)
abstracting: (0<=p2)
states: 661,694,978 (8)
abstracting: (p2<=0)
states: 591,782,978 (8)
abstracting: (p55<=0)
states: 551,751,746 (8)
abstracting: (0<=p55)
states: 661,694,978 (8)
abstracting: (p25<=1)
states: 661,694,978 (8)
abstracting: (1<=p25)
states: 95,443,200 (7)
abstracting: (p61<=0)
states: 658,166,978 (8)
abstracting: (0<=p61)
states: 661,694,978 (8)
abstracting: (p33<=1)
states: 661,694,978 (8)
abstracting: (1<=p33)
states: 94,299,264 (7)
abstracting: (p35<=0)
states: 566,251,777 (8)
abstracting: (0<=p35)
states: 661,694,978 (8)
abstracting: (1<=p63)
states: 154,363,392 (8)
abstracting: (p63<=1)
states: 661,694,978 (8)
abstracting: (0<=p49)
states: 661,694,978 (8)
abstracting: (p49<=0)
states: 528,212,737 (8)
abstracting: (p51<=0)
states: 494,842,178 (8)
abstracting: (0<=p51)
states: 661,694,978 (8)
abstracting: (0<=p33)
states: 661,694,978 (8)
abstracting: (p33<=0)
states: 567,395,714 (8)
abstracting: (0<=p23)
states: 661,694,978 (8)
abstracting: (p23<=0)
states: 567,395,714 (8)
abstracting: (1<=p62)
states: 154,363,392 (8)
abstracting: (p62<=1)
states: 661,694,978 (8)
-> the formula is FALSE

FORMULA AutonomousCar-PT-09a-ReachabilityCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 4m58.028sec

checking: AG [[[[p67<=1 & 1<=p67] | [0<=p68 & p68<=0]] | [[[1<=p42 & p42<=1] & [0<=p44 & p44<=0]] | [[[[1<=p8 & p8<=1] | [0<=p23 & p23<=0]] & [[[0<=p30 & p30<=0] | [1<=p5 & p5<=1]] | [[1<=p56 & p56<=1] | [p69<=0 & 0<=p69]]]] | [[[[[[p63<=0 & 0<=p63] & [p64<=1 & 1<=p64]] & [[[[p26<=1 & 1<=p26] & [p27<=0 & 0<=p27]] | [p45<=1 & 1<=p45]] & [1<=p44 & p44<=1]]] | [p24<=1 & 1<=p24]] & [p17<=1 & 1<=p17]] & [p36<=0 & 0<=p36]]]]]]
normalized: ~ [E [true U ~ [[[[[[[[[[[p45<=1 & 1<=p45] | [[p27<=0 & 0<=p27] & [p26<=1 & 1<=p26]]] & [1<=p44 & p44<=1]] & [[p64<=1 & 1<=p64] & [p63<=0 & 0<=p63]]] | [p24<=1 & 1<=p24]] & [p17<=1 & 1<=p17]] & [p36<=0 & 0<=p36]] | [[[[p69<=0 & 0<=p69] | [1<=p56 & p56<=1]] | [[1<=p5 & p5<=1] | [0<=p30 & p30<=0]]] & [[0<=p23 & p23<=0] | [1<=p8 & p8<=1]]]] | [[0<=p44 & p44<=0] & [1<=p42 & p42<=1]]] | [[0<=p68 & p68<=0] | [p67<=1 & 1<=p67]]]]]]

abstracting: (1<=p67)
states: 132,897,600 (8)
abstracting: (p67<=1)
states: 661,694,978 (8)
abstracting: (p68<=0)
states: 528,797,378 (8)
abstracting: (0<=p68)
states: 661,694,978 (8)
abstracting: (p42<=1)
states: 661,694,978 (8)
abstracting: (1<=p42)
states: 131,781,888 (8)
abstracting: (p44<=0)
states: 528,005,377 (8)
abstracting: (0<=p44)
states: 661,694,978 (8)
abstracting: (p8<=1)
states: 661,694,978 (8)
abstracting: (1<=p8)
states: 69,912,000 (7)
abstracting: (p23<=0)
states: 567,395,714 (8)
abstracting: (0<=p23)
states: 661,694,978 (8)
abstracting: (p30<=0)
states: 567,395,714 (8)
abstracting: (0<=p30)
states: 661,694,978 (8)
abstracting: (p5<=1)
states: 661,694,978 (8)
abstracting: (1<=p5)
states: 69,912,000 (7)
abstracting: (p56<=1)
states: 661,694,978 (8)
abstracting: (1<=p56)
states: 109,118,400 (8)
abstracting: (0<=p69)
states: 661,694,978 (8)
abstracting: (p69<=0)
states: 542,174,401 (8)
abstracting: (0<=p36)
states: 661,694,978 (8)
abstracting: (p36<=0)
states: 498,730,178 (8)
abstracting: (1<=p17)
states: 109,806,144 (8)
abstracting: (p17<=1)
states: 661,694,978 (8)
abstracting: (1<=p24)
states: 93,611,520 (7)
abstracting: (p24<=1)
states: 661,694,978 (8)
abstracting: (0<=p63)
states: 661,694,978 (8)
abstracting: (p63<=0)
states: 507,331,586 (8)
abstracting: (1<=p64)
states: 173,908,800 (8)
abstracting: (p64<=1)
states: 661,694,978 (8)
abstracting: (p44<=1)
states: 661,694,978 (8)
abstracting: (1<=p44)
states: 133,689,601 (8)
abstracting: (1<=p26)
states: 94,299,264 (7)
abstracting: (p26<=1)
states: 661,694,978 (8)
abstracting: (0<=p27)
states: 661,694,978 (8)
abstracting: (p27<=0)
states: 567,395,714 (8)
abstracting: (1<=p45)
states: 131,576,832 (8)
abstracting: (p45<=1)
states: 661,694,978 (8)
-> the formula is FALSE

FORMULA AutonomousCar-PT-09a-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m34.891sec

totally nodes used: 37645287 (3.8e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1060726915 1763485053 2824211968
used/not used/entry size/cache size: 67108864 0 16 1024MB
basic ops cache: hits/miss/sum: 43331081 41805428 85136509
used/not used/entry size/cache size: 16496696 280520 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: 366986 784919 1151905
used/not used/entry size/cache size: 750906 7637702 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 38666594
1 20942309
2 6051642
3 1225614
4 194110
5 25497
6 2783
7 291
8 24
9 0
>= 10 0

Total processing time: 9m27.356sec


BK_STOP 1678703785913

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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.001sec

17637 19882 22266 22441 25682 25731 26238 26636 26344 34592 35397 35584 36375 36995 36973 37295 37132 37407 37524 37628 38111 60302 62548 64456 65144 68258 68386 70878 70719 70854 71037 71380 71422 72356 71960 72040 72342 72842 73034 73182 73552 73496 73248 73320 73842 65320 65906 61114 60173 55904
iterations count:5007603 (6077), effective:60178 (73)

initing FirstDep: 0m 0.001sec

10269 10602 15068 15803 16453 16178 16469 16917 19289 20233 19664 20584 20274 20159 20991 21355 20516 21940 21935 21070 23348 23998 24101 24312 23837 23125 25728 25247 25385 25179 24397 24707 24624 26272 28109 27130 26294 26404 26646 26957 28630 27765 27078 27015 24881 26707 26863 26674 27357 27193 27256 27709 28026 27633 27543 27620 27420 27765 28671 28247 28225 28771 28760 28311 28660 28927 28401 28020 28856 28035 27576 26996 27695 27862 28449 28765 28197 28937 29028 28413 28538 28235 27859 28678 29475 29351 29928 30952 29731 29637 30242 29589 29589 30036 29421 28755
iterations count:9602628 (11653), effective:83819 (101)
22057 22349 22888 22857 23591 32034 32840 32297 33404 34071 33461 32504 36703 37210 38041 37251 37172 37458 36608 38480 38608 40482 38810 39345 38429 37920 36526 38838 38294 38656 38042 39882 39154 39118 38914 39846 39214 38580 39680 38368 38539 41137 40691 39632 40238 41624 41470 40219 40578 41727 41267 40866 40066 41170 39884 40042
iterations count:5643499 (6848), effective:44787 (54)

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

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