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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 712K
-rw-r--r-- 1 mcc users 6.0K Feb 25 12:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 12:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 12:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 25 12:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 17K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 12:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 165K Feb 25 12:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 12:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K 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 276K 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-07a-CTLCardinality-00
FORMULA_NAME AutonomousCar-PT-07a-CTLCardinality-01
FORMULA_NAME AutonomousCar-PT-07a-CTLCardinality-02
FORMULA_NAME AutonomousCar-PT-07a-CTLCardinality-03
FORMULA_NAME AutonomousCar-PT-07a-CTLCardinality-04
FORMULA_NAME AutonomousCar-PT-07a-CTLCardinality-05
FORMULA_NAME AutonomousCar-PT-07a-CTLCardinality-06
FORMULA_NAME AutonomousCar-PT-07a-CTLCardinality-07
FORMULA_NAME AutonomousCar-PT-07a-CTLCardinality-08
FORMULA_NAME AutonomousCar-PT-07a-CTLCardinality-09
FORMULA_NAME AutonomousCar-PT-07a-CTLCardinality-10
FORMULA_NAME AutonomousCar-PT-07a-CTLCardinality-11
FORMULA_NAME AutonomousCar-PT-07a-CTLCardinality-12
FORMULA_NAME AutonomousCar-PT-07a-CTLCardinality-13
FORMULA_NAME AutonomousCar-PT-07a-CTLCardinality-14
FORMULA_NAME AutonomousCar-PT-07a-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678699949505

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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-07a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 09:32:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 09:32:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 09:32:32] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2023-03-13 09:32:32] [INFO ] Transformed 73 places.
[2023-03-13 09:32:32] [INFO ] Transformed 593 transitions.
[2023-03-13 09:32:32] [INFO ] Found NUPN structural information;
[2023-03-13 09:32:32] [INFO ] Parsed PT model containing 73 places and 593 transitions and 5357 arcs in 203 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 9 ms.
Ensure Unique test removed 213 transitions
Reduce redundant transitions removed 213 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA AutonomousCar-PT-07a-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07a-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07a-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07a-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 380/380 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 72 transition count 372
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 72 transition count 372
Applied a total of 2 rules in 18 ms. Remains 72 /73 variables (removed 1) and now considering 372/380 (removed 8) transitions.
[2023-03-13 09:32:32] [INFO ] Flow matrix only has 371 transitions (discarded 1 similar events)
// Phase 1: matrix 371 rows 72 cols
[2023-03-13 09:32:32] [INFO ] Computed 12 place invariants in 20 ms
[2023-03-13 09:32:33] [INFO ] Implicit Places using invariants in 766 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 801 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 71/73 places, 372/380 transitions.
Applied a total of 0 rules in 3 ms. Remains 71 /71 variables (removed 0) and now considering 372/372 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 822 ms. Remains : 71/73 places, 372/380 transitions.
Support contains 43 out of 71 places after structural reductions.
[2023-03-13 09:32:33] [INFO ] Flatten gal took : 113 ms
[2023-03-13 09:32:33] [INFO ] Flatten gal took : 59 ms
[2023-03-13 09:32:34] [INFO ] Input system was already deterministic with 372 transitions.
Support contains 40 out of 71 places (down from 43) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 570 resets, run finished after 448 ms. (steps per millisecond=22 ) properties (out of 36) seen :33
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2023-03-13 09:32:34] [INFO ] Flow matrix only has 371 transitions (discarded 1 similar events)
// Phase 1: matrix 371 rows 71 cols
[2023-03-13 09:32:34] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-13 09:32:34] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 09:32:34] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-13 09:32:34] [INFO ] After 113ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 09:32:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 09:32:34] [INFO ] After 27ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 09:32:34] [INFO ] After 67ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-03-13 09:32:34] [INFO ] After 275ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 71 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 372/372 transitions.
Graph (complete) has 646 edges and 71 vertex of which 69 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 69 transition count 361
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 18 place count 62 transition count 360
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 61 transition count 360
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 19 place count 61 transition count 359
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 21 place count 60 transition count 359
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 27 place count 54 transition count 311
Iterating global reduction 3 with 6 rules applied. Total rules applied 33 place count 54 transition count 311
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 37 place count 52 transition count 309
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 43 place count 52 transition count 303
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 3 with 48 rules applied. Total rules applied 91 place count 46 transition count 261
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 92 place count 46 transition count 261
Applied a total of 92 rules in 101 ms. Remains 46 /71 variables (removed 25) and now considering 261/372 (removed 111) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 46/71 places, 261/372 transitions.
Incomplete random walk after 10000 steps, including 12 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 11114 steps, run visited all 1 properties in 37 ms. (steps per millisecond=300 )
Probabilistic random walk after 11114 steps, saw 3234 distinct states, run finished after 37 ms. (steps per millisecond=300 ) properties seen :1
[2023-03-13 09:32:35] [INFO ] Flatten gal took : 42 ms
[2023-03-13 09:32:35] [INFO ] Flatten gal took : 33 ms
[2023-03-13 09:32:35] [INFO ] Input system was already deterministic with 372 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 372/372 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 64 transition count 323
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 64 transition count 323
Applied a total of 14 rules in 4 ms. Remains 64 /71 variables (removed 7) and now considering 323/372 (removed 49) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 64/71 places, 323/372 transitions.
[2023-03-13 09:32:35] [INFO ] Flatten gal took : 24 ms
[2023-03-13 09:32:35] [INFO ] Flatten gal took : 25 ms
[2023-03-13 09:32:35] [INFO ] Input system was already deterministic with 323 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 372/372 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 65 transition count 324
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 65 transition count 324
Applied a total of 12 rules in 4 ms. Remains 65 /71 variables (removed 6) and now considering 324/372 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 65/71 places, 324/372 transitions.
[2023-03-13 09:32:35] [INFO ] Flatten gal took : 25 ms
[2023-03-13 09:32:35] [INFO ] Flatten gal took : 27 ms
[2023-03-13 09:32:35] [INFO ] Input system was already deterministic with 324 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 372/372 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 65 transition count 331
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 65 transition count 331
Applied a total of 12 rules in 3 ms. Remains 65 /71 variables (removed 6) and now considering 331/372 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 65/71 places, 331/372 transitions.
[2023-03-13 09:32:35] [INFO ] Flatten gal took : 20 ms
[2023-03-13 09:32:35] [INFO ] Flatten gal took : 21 ms
[2023-03-13 09:32:35] [INFO ] Input system was already deterministic with 331 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 372/372 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 65 transition count 331
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 65 transition count 331
Applied a total of 12 rules in 4 ms. Remains 65 /71 variables (removed 6) and now considering 331/372 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 65/71 places, 331/372 transitions.
[2023-03-13 09:32:35] [INFO ] Flatten gal took : 40 ms
[2023-03-13 09:32:35] [INFO ] Flatten gal took : 21 ms
[2023-03-13 09:32:35] [INFO ] Input system was already deterministic with 331 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 372/372 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 64 transition count 323
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 64 transition count 323
Applied a total of 14 rules in 4 ms. Remains 64 /71 variables (removed 7) and now considering 323/372 (removed 49) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 64/71 places, 323/372 transitions.
[2023-03-13 09:32:35] [INFO ] Flatten gal took : 20 ms
[2023-03-13 09:32:35] [INFO ] Flatten gal took : 22 ms
[2023-03-13 09:32:35] [INFO ] Input system was already deterministic with 323 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 372/372 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 66 transition count 339
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 66 transition count 339
Applied a total of 10 rules in 16 ms. Remains 66 /71 variables (removed 5) and now considering 339/372 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 66/71 places, 339/372 transitions.
[2023-03-13 09:32:35] [INFO ] Flatten gal took : 21 ms
[2023-03-13 09:32:35] [INFO ] Flatten gal took : 26 ms
[2023-03-13 09:32:36] [INFO ] Input system was already deterministic with 339 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 372/372 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 64 transition count 323
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 64 transition count 323
Applied a total of 14 rules in 3 ms. Remains 64 /71 variables (removed 7) and now considering 323/372 (removed 49) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 64/71 places, 323/372 transitions.
[2023-03-13 09:32:36] [INFO ] Flatten gal took : 19 ms
[2023-03-13 09:32:36] [INFO ] Flatten gal took : 20 ms
[2023-03-13 09:32:36] [INFO ] Input system was already deterministic with 323 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 71/71 places, 372/372 transitions.
Reduce places removed 1 places and 1 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 6 rules applied. Total rules applied 6 place count 70 transition count 365
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 64 transition count 365
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 17 place count 59 transition count 332
Iterating global reduction 2 with 5 rules applied. Total rules applied 22 place count 59 transition count 332
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 58 transition count 331
Applied a total of 24 rules in 49 ms. Remains 58 /71 variables (removed 13) and now considering 331/372 (removed 41) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 49 ms. Remains : 58/71 places, 331/372 transitions.
[2023-03-13 09:32:36] [INFO ] Flatten gal took : 23 ms
[2023-03-13 09:32:36] [INFO ] Flatten gal took : 22 ms
[2023-03-13 09:32:36] [INFO ] Input system was already deterministic with 331 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 372/372 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 65 transition count 331
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 65 transition count 331
Applied a total of 12 rules in 2 ms. Remains 65 /71 variables (removed 6) and now considering 331/372 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 65/71 places, 331/372 transitions.
[2023-03-13 09:32:36] [INFO ] Flatten gal took : 21 ms
[2023-03-13 09:32:36] [INFO ] Flatten gal took : 20 ms
[2023-03-13 09:32:36] [INFO ] Input system was already deterministic with 331 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 372/372 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 64 transition count 323
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 64 transition count 323
Applied a total of 14 rules in 2 ms. Remains 64 /71 variables (removed 7) and now considering 323/372 (removed 49) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 64/71 places, 323/372 transitions.
[2023-03-13 09:32:36] [INFO ] Flatten gal took : 21 ms
[2023-03-13 09:32:36] [INFO ] Flatten gal took : 32 ms
[2023-03-13 09:32:36] [INFO ] Input system was already deterministic with 323 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 372/372 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 65 transition count 324
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 65 transition count 324
Applied a total of 12 rules in 3 ms. Remains 65 /71 variables (removed 6) and now considering 324/372 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 65/71 places, 324/372 transitions.
[2023-03-13 09:32:36] [INFO ] Flatten gal took : 20 ms
[2023-03-13 09:32:36] [INFO ] Flatten gal took : 21 ms
[2023-03-13 09:32:36] [INFO ] Input system was already deterministic with 324 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 372/372 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 64 transition count 323
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 64 transition count 323
Applied a total of 14 rules in 3 ms. Remains 64 /71 variables (removed 7) and now considering 323/372 (removed 49) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 64/71 places, 323/372 transitions.
[2023-03-13 09:32:36] [INFO ] Flatten gal took : 17 ms
[2023-03-13 09:32:36] [INFO ] Flatten gal took : 18 ms
[2023-03-13 09:32:36] [INFO ] Input system was already deterministic with 323 transitions.
[2023-03-13 09:32:36] [INFO ] Flatten gal took : 67 ms
[2023-03-13 09:32:36] [INFO ] Flatten gal took : 30 ms
[2023-03-13 09:32:36] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-13 09:32:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 71 places, 372 transitions and 3314 arcs took 5 ms.
Total runtime 4468 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=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 71 NrTr: 372 NrArc: 3314)

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

net check time: 0m 0.000sec

init dd package: 0m 3.071sec


RS generation: 0m 9.357sec


-> reachability set: #nodes 39109 (3.9e+04) #states 106,932,740 (8)



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

checking: EX [AX [1<=0]]
normalized: EX [~ [EX [~ [1<=0]]]]

abstracting: (1<=0)
states: 0
..-> the formula is FALSE

FORMULA AutonomousCar-PT-07a-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.442sec

checking: EG [EX [AF [[1<=p45 & p45<=1]]]]
normalized: EG [EX [~ [EG [~ [[1<=p45 & p45<=1]]]]]]

abstracting: (p45<=1)
states: 106,932,740 (8)
abstracting: (1<=p45)
states: 14,933,214 (7)
.
EG iterations: 1
...................
EG iterations: 18
-> the formula is FALSE

FORMULA AutonomousCar-PT-07a-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m12.182sec

checking: EX [EG [[0<=p59 & p59<=0]]]
normalized: EX [EG [[0<=p59 & p59<=0]]]

abstracting: (p59<=0)
states: 105,520,952 (8)
abstracting: (0<=p59)
states: 106,932,740 (8)
.
EG iterations: 1
.-> the formula is TRUE

FORMULA AutonomousCar-PT-07a-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.047sec

checking: A [~ [EX [0<=0]] U ~ [AF [[p10<=1 & 1<=p10]]]]
normalized: [~ [EG [~ [EG [~ [[p10<=1 & 1<=p10]]]]]] & ~ [E [~ [EG [~ [[p10<=1 & 1<=p10]]]] U [EX [0<=0] & ~ [EG [~ [[p10<=1 & 1<=p10]]]]]]]]

abstracting: (1<=p10)
states: 14,933,214 (7)
abstracting: (p10<=1)
states: 106,932,740 (8)
..................
EG iterations: 18
abstracting: (0<=0)
states: 106,932,740 (8)
.abstracting: (1<=p10)
states: 14,933,214 (7)
abstracting: (p10<=1)
states: 106,932,740 (8)
..................
EG iterations: 18
abstracting: (1<=p10)
states: 14,933,214 (7)
abstracting: (p10<=1)
states: 106,932,740 (8)
..................
EG iterations: 18
....
EG iterations: 4
-> the formula is TRUE

FORMULA AutonomousCar-PT-07a-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m10.680sec

checking: AF [EX [AG [~ [[p29<=0 & 0<=p29]]]]]
normalized: ~ [EG [~ [EX [~ [E [true U [p29<=0 & 0<=p29]]]]]]]

abstracting: (0<=p29)
states: 106,932,740 (8)
abstracting: (p29<=0)
states: 91,999,526 (7)
.
EG iterations: 0
-> the formula is FALSE

FORMULA AutonomousCar-PT-07a-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.382sec

checking: AX [~ [A [[[p15<=0 & 0<=p15] | [p66<=1 & 1<=p66]] U AF [~ [[[p1<=0 & 0<=p1] | [p70<=1 & 1<=p70]]]]]]]
normalized: ~ [EX [[~ [EG [EG [[[p70<=1 & 1<=p70] | [p1<=0 & 0<=p1]]]]] & ~ [E [EG [[[p70<=1 & 1<=p70] | [p1<=0 & 0<=p1]]] U [~ [[[p66<=1 & 1<=p66] | [p15<=0 & 0<=p15]]] & EG [[[p70<=1 & 1<=p70] | [p1<=0 & 0<=p1]]]]]]]]]

abstracting: (0<=p1)
states: 106,932,740 (8)
abstracting: (p1<=0)
states: 98,887,969 (7)
abstracting: (1<=p70)
states: 17,592,943 (7)
abstracting: (p70<=1)
states: 106,932,740 (8)
........................
EG iterations: 24
abstracting: (0<=p15)
states: 106,932,740 (8)
abstracting: (p15<=0)
states: 91,999,526 (7)
abstracting: (1<=p66)
states: 85,656,631 (7)
abstracting: (p66<=1)
states: 106,932,740 (8)
abstracting: (0<=p1)
states: 106,932,740 (8)
abstracting: (p1<=0)
states: 98,887,969 (7)
abstracting: (1<=p70)
states: 17,592,943 (7)
abstracting: (p70<=1)
states: 106,932,740 (8)
........................
EG iterations: 24
abstracting: (0<=p1)
states: 106,932,740 (8)
abstracting: (p1<=0)
states: 98,887,969 (7)
abstracting: (1<=p70)
states: 17,592,943 (7)
abstracting: (p70<=1)
states: 106,932,740 (8)
........................
EG iterations: 24
.
EG iterations: 1
.-> the formula is TRUE

FORMULA AutonomousCar-PT-07a-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m43.855sec

checking: EX [EG [[[AF [[0<=p28 & p28<=0]] | A [[p22<=1 & 1<=p22] U [p57<=0 & 0<=p57]]] | [EG [[p42<=1 & 1<=p42]] | [p13<=1 & 1<=p13]]]]]
normalized: EX [EG [[[[~ [E [~ [[p57<=0 & 0<=p57]] U [~ [[p22<=1 & 1<=p22]] & ~ [[p57<=0 & 0<=p57]]]]] & ~ [EG [~ [[p57<=0 & 0<=p57]]]]] | ~ [EG [~ [[0<=p28 & p28<=0]]]]] | [[p13<=1 & 1<=p13] | EG [[p42<=1 & 1<=p42]]]]]]

abstracting: (1<=p42)
states: 17,286,777 (7)
abstracting: (p42<=1)
states: 106,932,740 (8)
..................
EG iterations: 18
abstracting: (1<=p13)
states: 16,220,502 (7)
abstracting: (p13<=1)
states: 106,932,740 (8)
abstracting: (p28<=0)
states: 91,999,526 (7)
abstracting: (0<=p28)
states: 106,932,740 (8)
..................
EG iterations: 18
abstracting: (0<=p57)
states: 106,932,740 (8)
abstracting: (p57<=0)
states: 90,712,237 (7)
..........
EG iterations: 10
abstracting: (0<=p57)
states: 106,932,740 (8)
abstracting: (p57<=0)
states: 90,712,237 (7)
abstracting: (1<=p22)
states: 14,933,214 (7)
abstracting: (p22<=1)
states: 106,932,740 (8)
abstracting: (0<=p57)
states: 106,932,740 (8)
abstracting: (p57<=0)
states: 90,712,237 (7)
.
EG iterations: 1
.-> the formula is TRUE

FORMULA AutonomousCar-PT-07a-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m16.527sec

checking: AX [AF [[[EX [[p3<=0 & 0<=p3]] | [EG [[[p2<=0 & 0<=p2] & [p1<=1 & 1<=p1]]] & [[p0<=0 & 0<=p0] | [p24<=1 & 1<=p24]]]] & AF [[p59<=1 & 1<=p59]]]]]
normalized: ~ [EX [EG [~ [[~ [EG [~ [[p59<=1 & 1<=p59]]]] & [[[[p24<=1 & 1<=p24] | [p0<=0 & 0<=p0]] & EG [[[p1<=1 & 1<=p1] & [p2<=0 & 0<=p2]]]] | EX [[p3<=0 & 0<=p3]]]]]]]]

abstracting: (0<=p3)
states: 106,932,740 (8)
abstracting: (p3<=0)
states: 93,752,360 (7)
.abstracting: (0<=p2)
states: 106,932,740 (8)
abstracting: (p2<=0)
states: 99,167,906 (7)
abstracting: (1<=p1)
states: 8,044,771 (6)
abstracting: (p1<=1)
states: 106,932,740 (8)
...............
EG iterations: 15
abstracting: (0<=p0)
states: 106,932,740 (8)
abstracting: (p0<=0)
states: 106,932,739 (8)
abstracting: (1<=p24)
states: 14,933,214 (7)
abstracting: (p24<=1)
states: 106,932,740 (8)
abstracting: (1<=p59)
states: 1,411,788 (6)
abstracting: (p59<=1)
states: 106,932,740 (8)
.
EG iterations: 1
.
EG iterations: 1
.-> the formula is FALSE

FORMULA AutonomousCar-PT-07a-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.474sec

checking: E [A [AF [[[[0<=p2 & p2<=0] | [p19<=1 & 1<=p19]] & [[1<=p29 & p29<=1] | [p64<=1 & 1<=p64]]]] U [~ [[[1<=p1 & p1<=1] | ~ [[[1<=p32 & p32<=1] | [0<=p11 & p11<=0]]]]] | EX [0<=0]]] U AF [[[p18<=1 & 1<=p18] & [p45<=1 & 1<=p45]]]]
normalized: E [[~ [EG [~ [[EX [0<=0] | ~ [[~ [[[0<=p11 & p11<=0] | [1<=p32 & p32<=1]]] | [1<=p1 & p1<=1]]]]]]] & ~ [E [~ [[EX [0<=0] | ~ [[~ [[[0<=p11 & p11<=0] | [1<=p32 & p32<=1]]] | [1<=p1 & p1<=1]]]]] U [EG [~ [[[[p64<=1 & 1<=p64] | [1<=p29 & p29<=1]] & [[p19<=1 & 1<=p19] | [0<=p2 & p2<=0]]]]] & ~ [[EX [0<=0] | ~ [[~ [[[0<=p11 & p11<=0] | [1<=p32 & p32<=1]]] | [1<=p1 & p1<=1]]]]]]]]] U ~ [EG [~ [[[p45<=1 & 1<=p45] & [p18<=1 & 1<=p18]]]]]]

abstracting: (1<=p18)
states: 14,933,214 (7)
abstracting: (p18<=1)
states: 106,932,740 (8)
abstracting: (1<=p45)
states: 14,933,214 (7)
abstracting: (p45<=1)
states: 106,932,740 (8)
.
EG iterations: 1
abstracting: (p1<=1)
states: 106,932,740 (8)
abstracting: (1<=p1)
states: 8,044,771 (6)
abstracting: (p32<=1)
states: 106,932,740 (8)
abstracting: (1<=p32)
states: 14,933,214 (7)
abstracting: (p11<=0)
states: 91,999,526 (7)
abstracting: (0<=p11)
states: 106,932,740 (8)
abstracting: (0<=0)
states: 106,932,740 (8)
.abstracting: (p2<=0)
states: 99,167,906 (7)
abstracting: (0<=p2)
states: 106,932,740 (8)
abstracting: (1<=p19)
states: 14,758,878 (7)
abstracting: (p19<=1)
states: 106,932,740 (8)
abstracting: (p29<=1)
states: 106,932,740 (8)
abstracting: (1<=p29)
states: 14,933,214 (7)
abstracting: (1<=p64)
states: 27,786,101 (7)
abstracting: (p64<=1)
states: 106,932,740 (8)
..................
EG iterations: 18
abstracting: (p1<=1)
states: 106,932,740 (8)
abstracting: (1<=p1)
states: 8,044,771 (6)
abstracting: (p32<=1)
states: 106,932,740 (8)
abstracting: (1<=p32)
states: 14,933,214 (7)
abstracting: (p11<=0)
states: 91,999,526 (7)
abstracting: (0<=p11)
states: 106,932,740 (8)
abstracting: (0<=0)
states: 106,932,740 (8)
.abstracting: (p1<=1)
states: 106,932,740 (8)
abstracting: (1<=p1)
states: 8,044,771 (6)
abstracting: (p32<=1)
states: 106,932,740 (8)
abstracting: (1<=p32)
states: 14,933,214 (7)
abstracting: (p11<=0)
states: 91,999,526 (7)
abstracting: (0<=p11)
states: 106,932,740 (8)
abstracting: (0<=0)
states: 106,932,740 (8)
..
EG iterations: 1
-> the formula is TRUE

FORMULA AutonomousCar-PT-07a-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m21.185sec

checking: A [A [AX [AF [[[p14<=1 & 1<=p14] | [p58<=0 & 0<=p58]]]] U [[p20<=1 & 1<=p20] | [0<=p56 & p56<=0]]] U ~ [[AG [~ [[~ [[p30<=1 & 1<=p30]] & ~ [[[0<=p7 & p7<=0] | [p0<=1 & 1<=p0]]]]]] & AX [~ [AG [[[p49<=0 & 0<=p49] | [p52<=1 & 1<=p52]]]]]]]]
normalized: [~ [EG [[~ [EX [~ [E [true U ~ [[[p52<=1 & 1<=p52] | [p49<=0 & 0<=p49]]]]]]] & ~ [E [true U [~ [[[p0<=1 & 1<=p0] | [0<=p7 & p7<=0]]] & ~ [[p30<=1 & 1<=p30]]]]]]]] & ~ [E [[~ [EX [~ [E [true U ~ [[[p52<=1 & 1<=p52] | [p49<=0 & 0<=p49]]]]]]] & ~ [E [true U [~ [[[p0<=1 & 1<=p0] | [0<=p7 & p7<=0]]] & ~ [[p30<=1 & 1<=p30]]]]]] U [~ [[~ [EG [~ [[[0<=p56 & p56<=0] | [p20<=1 & 1<=p20]]]]] & ~ [E [~ [[[0<=p56 & p56<=0] | [p20<=1 & 1<=p20]]] U [EX [EG [~ [[[p58<=0 & 0<=p58] | [p14<=1 & 1<=p14]]]]] & ~ [[[0<=p56 & p56<=0] | [p20<=1 & 1<=p20]]]]]]]] & [~ [EX [~ [E [true U ~ [[[p52<=1 & 1<=p52] | [p49<=0 & 0<=p49]]]]]]] & ~ [E [true U [~ [[[p0<=1 & 1<=p0] | [0<=p7 & p7<=0]]] & ~ [[p30<=1 & 1<=p30]]]]]]]]]]

abstracting: (1<=p30)
states: 16,220,503 (7)
abstracting: (p30<=1)
states: 106,932,740 (8)
abstracting: (p7<=0)
states: 93,752,360 (7)
abstracting: (0<=p7)
states: 106,932,740 (8)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 106,932,740 (8)
abstracting: (0<=p49)
states: 106,932,740 (8)
abstracting: (p49<=0)
states: 91,999,526 (7)
abstracting: (1<=p52)
states: 14,933,214 (7)
abstracting: (p52<=1)
states: 106,932,740 (8)
.abstracting: (1<=p20)
states: 16,220,502 (7)
abstracting: (p20<=1)
states: 106,932,740 (8)
abstracting: (p56<=0)
states: 91,999,526 (7)
abstracting: (0<=p56)
states: 106,932,740 (8)
abstracting: (1<=p14)
states: 14,933,214 (7)
abstracting: (p14<=1)
states: 106,932,740 (8)
abstracting: (0<=p58)
states: 106,932,740 (8)
abstracting: (p58<=0)
states: 105,520,952 (8)
.................
EG iterations: 17
.abstracting: (1<=p20)
states: 16,220,502 (7)
abstracting: (p20<=1)
states: 106,932,740 (8)
abstracting: (p56<=0)
states: 91,999,526 (7)
abstracting: (0<=p56)
states: 106,932,740 (8)
abstracting: (1<=p20)
states: 16,220,502 (7)
abstracting: (p20<=1)
states: 106,932,740 (8)
abstracting: (p56<=0)
states: 91,999,526 (7)
abstracting: (0<=p56)
states: 106,932,740 (8)
..................
EG iterations: 18
abstracting: (1<=p30)
states: 16,220,503 (7)
abstracting: (p30<=1)
states: 106,932,740 (8)
abstracting: (p7<=0)
states: 93,752,360 (7)
abstracting: (0<=p7)
states: 106,932,740 (8)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 106,932,740 (8)
abstracting: (0<=p49)
states: 106,932,740 (8)
abstracting: (p49<=0)
states: 91,999,526 (7)
abstracting: (1<=p52)
states: 14,933,214 (7)
abstracting: (p52<=1)
states: 106,932,740 (8)
.abstracting: (1<=p30)
states: 16,220,503 (7)
abstracting: (p30<=1)
states: 106,932,740 (8)
abstracting: (p7<=0)
states: 93,752,360 (7)
abstracting: (0<=p7)
states: 106,932,740 (8)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 106,932,740 (8)
abstracting: (0<=p49)
states: 106,932,740 (8)
abstracting: (p49<=0)
states: 91,999,526 (7)
abstracting: (1<=p52)
states: 14,933,214 (7)
abstracting: (p52<=1)
states: 106,932,740 (8)
.................
EG iterations: 16
-> the formula is TRUE

FORMULA AutonomousCar-PT-07a-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m 4.553sec

checking: EG [[[p52<=0 & 0<=p52] & E [~ [[[[p58<=1 & 1<=p58] | [p12<=1 & 1<=p12]] | [A [[p15<=1 & 1<=p15] U [[p47<=0 & 0<=p47] | [p11<=1 & 1<=p11]]] | [p13<=0 & 0<=p13]]]] U AG [[[p19<=0 & 0<=p19] | EG [[p2<=1 & 1<=p2]]]]]]]
normalized: EG [[E [~ [[[[p13<=0 & 0<=p13] | [~ [EG [~ [[[p11<=1 & 1<=p11] | [p47<=0 & 0<=p47]]]]] & ~ [E [~ [[[p11<=1 & 1<=p11] | [p47<=0 & 0<=p47]]] U [~ [[p15<=1 & 1<=p15]] & ~ [[[p11<=1 & 1<=p11] | [p47<=0 & 0<=p47]]]]]]]] | [[p12<=1 & 1<=p12] | [p58<=1 & 1<=p58]]]] U ~ [E [true U ~ [[EG [[p2<=1 & 1<=p2]] | [p19<=0 & 0<=p19]]]]]] & [p52<=0 & 0<=p52]]]

abstracting: (0<=p52)
states: 106,932,740 (8)
abstracting: (p52<=0)
states: 91,999,526 (7)
abstracting: (0<=p19)
states: 106,932,740 (8)
abstracting: (p19<=0)
states: 92,173,862 (7)
abstracting: (1<=p2)
states: 7,764,834 (6)
abstracting: (p2<=1)
states: 106,932,740 (8)
........................
EG iterations: 24
abstracting: (1<=p58)
states: 1,411,788 (6)
abstracting: (p58<=1)
states: 106,932,740 (8)
abstracting: (1<=p12)
states: 14,758,878 (7)
abstracting: (p12<=1)
states: 106,932,740 (8)
abstracting: (0<=p47)
states: 106,932,740 (8)
abstracting: (p47<=0)
states: 90,712,238 (7)
abstracting: (1<=p11)
states: 14,933,214 (7)
abstracting: (p11<=1)
states: 106,932,740 (8)
abstracting: (1<=p15)
states: 14,933,214 (7)
abstracting: (p15<=1)
states: 106,932,740 (8)
abstracting: (0<=p47)
states: 106,932,740 (8)
abstracting: (p47<=0)
states: 90,712,238 (7)
abstracting: (1<=p11)
states: 14,933,214 (7)
abstracting: (p11<=1)
states: 106,932,740 (8)
abstracting: (0<=p47)
states: 106,932,740 (8)
abstracting: (p47<=0)
states: 90,712,238 (7)
abstracting: (1<=p11)
states: 14,933,214 (7)
abstracting: (p11<=1)
states: 106,932,740 (8)
...........
EG iterations: 11
abstracting: (0<=p13)
states: 106,932,740 (8)
abstracting: (p13<=0)
states: 90,712,238 (7)
........
EG iterations: 8
-> the formula is FALSE

FORMULA AutonomousCar-PT-07a-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m48.801sec

checking: A [[[[[[[1<=p33 & p33<=1] | [p27<=0 & 0<=p27]] & E [~ [[p31<=1 & 1<=p31]] U [p20<=1 & 1<=p20]]] | ~ [EG [[E [[p13<=0 & 0<=p13] U [1<=p2 & p2<=1]] | ~ [[[p6<=0 & 0<=p6] | [p39<=1 & 1<=p39]]]]]]] | [0<=p58 & p58<=0]] & AX [AG [AX [[[0<=p60 & p60<=0] | [p43<=1 & 1<=p43]]]]]] U AG [EF [[1<=p48 & p48<=1]]]]
normalized: [~ [EG [E [true U ~ [E [true U [1<=p48 & p48<=1]]]]]] & ~ [E [E [true U ~ [E [true U [1<=p48 & p48<=1]]]] U [~ [[[[~ [EG [[~ [[[p39<=1 & 1<=p39] | [p6<=0 & 0<=p6]]] | E [[p13<=0 & 0<=p13] U [1<=p2 & p2<=1]]]]] | [E [~ [[p31<=1 & 1<=p31]] U [p20<=1 & 1<=p20]] & [[p27<=0 & 0<=p27] | [1<=p33 & p33<=1]]]] | [0<=p58 & p58<=0]] & ~ [EX [E [true U EX [~ [[[0<=p60 & p60<=0] | [p43<=1 & 1<=p43]]]]]]]]] & E [true U ~ [E [true U [1<=p48 & p48<=1]]]]]]]]

abstracting: (p48<=1)
states: 106,932,740 (8)
abstracting: (1<=p48)
states: 14,933,214 (7)
abstracting: (1<=p43)
states: 18,892,816 (7)
abstracting: (p43<=1)
states: 106,932,740 (8)
abstracting: (p60<=0)
states: 105,520,952 (8)
abstracting: (0<=p60)
states: 106,932,740 (8)
..abstracting: (p58<=0)
states: 105,520,952 (8)
abstracting: (0<=p58)
states: 106,932,740 (8)
abstracting: (p33<=1)
states: 106,932,740 (8)
abstracting: (1<=p33)
states: 14,758,878 (7)
abstracting: (0<=p27)
states: 106,932,740 (8)
abstracting: (p27<=0)
states: 90,712,238 (7)
abstracting: (1<=p20)
states: 16,220,502 (7)
abstracting: (p20<=1)
states: 106,932,740 (8)
abstracting: (1<=p31)
states: 14,933,214 (7)
abstracting: (p31<=1)
states: 106,932,740 (8)

before gc: list nodes free: 1856513

after gc: idd nodes used:581288, unused:63418712; list nodes free:307672265
abstracting: (p2<=1)
states: 106,932,740 (8)
abstracting: (1<=p2)
states: 7,764,834 (6)
abstracting: (0<=p13)
states: 106,932,740 (8)
abstracting: (p13<=0)
states: 90,712,238 (7)
abstracting: (0<=p6)
states: 106,932,740 (8)
abstracting: (p6<=0)
states: 93,752,360 (7)
abstracting: (1<=p39)
states: 17,286,777 (7)
abstracting: (p39<=1)
states: 106,932,740 (8)
........................
EG iterations: 24
abstracting: (p48<=1)
states: 106,932,740 (8)
abstracting: (1<=p48)
states: 14,933,214 (7)
abstracting: (p48<=1)
states: 106,932,740 (8)
abstracting: (1<=p48)
states: 14,933,214 (7)

EG iterations: 0
-> the formula is FALSE

FORMULA AutonomousCar-PT-07a-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m37.535sec

totally nodes used: 74999215 (7.5e+07)
number of garbage collections: 1
fire ops cache: hits/miss/sum: 706414600 1283007407 1989422007
used/not used/entry size/cache size: 63187799 3921065 16 1024MB
basic ops cache: hits/miss/sum: 53457584 58278712 111736296
used/not used/entry size/cache size: 10271230 6505986 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: 300775 600464 901239
used/not used/entry size/cache size: 90465 8298143 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 56776869
1 9206683
2 1013090
3 102105
4 9325
5 736
6 47
7 9
8 0
9 0
>= 10 0

Total processing time: 7m42.133sec


BK_STOP 1678700419284

--------------------
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 CTLCardinality -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.013sec

34696 35567 38194 38762 38663 39796
iterations count:601363 (1616), effective:10089 (27)

initing FirstDep: 0m 0.001sec


iterations count:372 (1), effective:0 (0)

iterations count:396 (1), effective:1 (0)
17552 21098 23677 23762 29753 29191 28589 27252
iterations count:899478 (2417), effective:10763 (28)

iterations count:457 (1), effective:1 (0)

iterations count:372 (1), effective:0 (0)
38628 41483 41441
iterations count:331951 (892), effective:4307 (11)
23705 28812 30663 34881 35055 34405 35035 40138 40402 38054 40753 40408 38520 37406 33777
iterations count:1522620 (4093), effective:18591 (49)
23107 25683 27636 29132 29252 29549
iterations count:660793 (1776), effective:8311 (22)
23705 28812 30663 34881 35055 34405 35035 40138 40402 38054 40753 40408 38520 37406 33777
iterations count:1522620 (4093), effective:18591 (49)
23107 25683 27636 29132 29252 29549
iterations count:660793 (1776), effective:8311 (22)

iterations count:372 (1), effective:0 (0)
23705 28812 30663 34881 35055 34405 35035 40138 40402 38054 40753 40408 38520 37406 33777
iterations count:1522620 (4093), effective:18591 (49)
23107 25683 27636 29132 29252 29549
iterations count:660793 (1776), effective:8311 (22)
19620 23780 25102 29774 31507 31890 33478 39600 40785 41581 39966 41965 41427 40106 40389
iterations count:1536776 (4131), effective:18208 (48)

iterations count:656 (1), effective:9 (0)

iterations count:14210 (38), effective:95 (0)
31642 34260 36006 37371 37276 37184
iterations count:660794 (1776), effective:8311 (22)
46555 43913 40738
iterations count:301689 (810), effective:5023 (13)
19794 22131 24351 26588 28394 31041 28506 31966 35545 35556 39261 37249 36354 35780 34922 33262
iterations count:1644721 (4421), effective:19359 (52)
39917 42949 42519 45653 45864 45318 44326
iterations count:717750 (1929), effective:8570 (23)
18417 20822 21947 23613 25199 26701 26261 25173
iterations count:819536 (2203), effective:9594 (25)
31642 34260 36006 37371 37276 37184
iterations count:660794 (1776), effective:8311 (22)
46555 43913 40738
iterations count:301689 (810), effective:5023 (13)

iterations count:823 (2), effective:11 (0)
31642 34260 36006 37371 37276 37184
iterations count:660794 (1776), effective:8311 (22)
46555 43913 40738
iterations count:301689 (810), effective:5023 (13)

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-07a"
export BK_EXAMINATION="CTLCardinality"
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-07a, examination is CTLCardinality"
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-167813599300625"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-07a.tgz
mv AutonomousCar-PT-07a execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;