About the Execution of Marcie+red for AutonomousCar-PT-06a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 10288.155 | 292961.00 | 311284.00 | 47.50 | TFFFFFFFTFTFFFTT | normal |
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-167813599300609.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-06a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813599300609
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 6.6K Feb 25 12:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 25 12:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 12:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 12:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 12:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 163K Feb 25 12:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 12:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 25 12:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 177K Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME AutonomousCar-PT-06a-CTLCardinality-00
FORMULA_NAME AutonomousCar-PT-06a-CTLCardinality-01
FORMULA_NAME AutonomousCar-PT-06a-CTLCardinality-02
FORMULA_NAME AutonomousCar-PT-06a-CTLCardinality-03
FORMULA_NAME AutonomousCar-PT-06a-CTLCardinality-04
FORMULA_NAME AutonomousCar-PT-06a-CTLCardinality-05
FORMULA_NAME AutonomousCar-PT-06a-CTLCardinality-06
FORMULA_NAME AutonomousCar-PT-06a-CTLCardinality-07
FORMULA_NAME AutonomousCar-PT-06a-CTLCardinality-08
FORMULA_NAME AutonomousCar-PT-06a-CTLCardinality-09
FORMULA_NAME AutonomousCar-PT-06a-CTLCardinality-10
FORMULA_NAME AutonomousCar-PT-06a-CTLCardinality-11
FORMULA_NAME AutonomousCar-PT-06a-CTLCardinality-12
FORMULA_NAME AutonomousCar-PT-06a-CTLCardinality-13
FORMULA_NAME AutonomousCar-PT-06a-CTLCardinality-14
FORMULA_NAME AutonomousCar-PT-06a-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678699641024
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-06a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 09:27:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 09:27:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 09:27:24] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2023-03-13 09:27:24] [INFO ] Transformed 65 places.
[2023-03-13 09:27:24] [INFO ] Transformed 417 transitions.
[2023-03-13 09:27:24] [INFO ] Found NUPN structural information;
[2023-03-13 09:27:24] [INFO ] Parsed PT model containing 65 places and 417 transitions and 3356 arcs in 186 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 9 ms.
Ensure Unique test removed 159 transitions
Reduce redundant transitions removed 159 transitions.
Support contains 54 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 258/258 transitions.
Applied a total of 0 rules in 11 ms. Remains 65 /65 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2023-03-13 09:27:24] [INFO ] Flow matrix only has 257 transitions (discarded 1 similar events)
// Phase 1: matrix 257 rows 65 cols
[2023-03-13 09:27:24] [INFO ] Computed 11 place invariants in 9 ms
[2023-03-13 09:27:24] [INFO ] Implicit Places using invariants in 365 ms returned []
[2023-03-13 09:27:24] [INFO ] Flow matrix only has 257 transitions (discarded 1 similar events)
[2023-03-13 09:27:24] [INFO ] Invariant cache hit.
[2023-03-13 09:27:24] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-13 09:27:24] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 688 ms to find 0 implicit places.
[2023-03-13 09:27:24] [INFO ] Flow matrix only has 257 transitions (discarded 1 similar events)
[2023-03-13 09:27:24] [INFO ] Invariant cache hit.
[2023-03-13 09:27:25] [INFO ] Dead Transitions using invariants and state equation in 479 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1182 ms. Remains : 65/65 places, 258/258 transitions.
Support contains 54 out of 65 places after structural reductions.
[2023-03-13 09:27:25] [INFO ] Flatten gal took : 75 ms
[2023-03-13 09:27:25] [INFO ] Flatten gal took : 32 ms
[2023-03-13 09:27:25] [INFO ] Input system was already deterministic with 258 transitions.
Support contains 50 out of 65 places (down from 54) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 566 resets, run finished after 281 ms. (steps per millisecond=35 ) properties (out of 45) seen :43
Incomplete Best-First random walk after 10001 steps, including 65 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 74 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-13 09:27:26] [INFO ] Flow matrix only has 257 transitions (discarded 1 similar events)
[2023-03-13 09:27:26] [INFO ] Invariant cache hit.
[2023-03-13 09:27:26] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-13 09:27:26] [INFO ] After 56ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1
[2023-03-13 09:27:26] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-13 09:27:26] [INFO ] After 17ms SMT Verify possible using 147 Read/Feed constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-13 09:27:26] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-13 09:27:26] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-13 09:27:26] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-13 09:27:26] [INFO ] After 15ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-13 09:27:26] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 3 ms to minimize.
[2023-03-13 09:27:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2023-03-13 09:27:26] [INFO ] After 107ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-13 09:27:26] [INFO ] After 226ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 258/258 transitions.
Graph (complete) has 529 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 64 transition count 249
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 15 place count 58 transition count 249
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 15 place count 58 transition count 248
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 17 place count 57 transition count 248
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 23 place count 51 transition count 206
Iterating global reduction 2 with 6 rules applied. Total rules applied 29 place count 51 transition count 206
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 2 with 4 rules applied. Total rules applied 33 place count 49 transition count 204
Free-agglomeration rule applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 38 place count 49 transition count 199
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 73 place count 44 transition count 169
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 74 place count 44 transition count 169
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 43 transition count 168
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 76 place count 42 transition count 168
Applied a total of 76 rules in 63 ms. Remains 42 /65 variables (removed 23) and now considering 168/258 (removed 90) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 42/65 places, 168/258 transitions.
Incomplete random walk after 10000 steps, including 165 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 113 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 373924 steps, run visited all 1 properties in 473 ms. (steps per millisecond=790 )
Probabilistic random walk after 373924 steps, saw 55580 distinct states, run finished after 486 ms. (steps per millisecond=769 ) properties seen :1
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
[2023-03-13 09:27:27] [INFO ] Flatten gal took : 58 ms
[2023-03-13 09:27:27] [INFO ] Flatten gal took : 29 ms
[2023-03-13 09:27:27] [INFO ] Input system was already deterministic with 258 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 65/65 places, 258/258 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 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 7 rules applied. Total rules applied 7 place count 63 transition count 251
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 57 transition count 250
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 56 transition count 250
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 22 place count 49 transition count 207
Iterating global reduction 3 with 7 rules applied. Total rules applied 29 place count 49 transition count 207
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 33 place count 47 transition count 205
Applied a total of 33 rules in 19 ms. Remains 47 /65 variables (removed 18) and now considering 205/258 (removed 53) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 47/65 places, 205/258 transitions.
[2023-03-13 09:27:27] [INFO ] Flatten gal took : 18 ms
[2023-03-13 09:27:27] [INFO ] Flatten gal took : 18 ms
[2023-03-13 09:27:27] [INFO ] Input system was already deterministic with 205 transitions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 258/258 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 61 transition count 230
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 61 transition count 230
Applied a total of 8 rules in 4 ms. Remains 61 /65 variables (removed 4) and now considering 230/258 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 61/65 places, 230/258 transitions.
[2023-03-13 09:27:27] [INFO ] Flatten gal took : 19 ms
[2023-03-13 09:27:27] [INFO ] Flatten gal took : 19 ms
[2023-03-13 09:27:27] [INFO ] Input system was already deterministic with 230 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 65/65 places, 258/258 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 4 rules applied. Total rules applied 4 place count 65 transition count 254
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 10 place count 61 transition count 252
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 59 transition count 252
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 19 place count 52 transition count 209
Iterating global reduction 3 with 7 rules applied. Total rules applied 26 place count 52 transition count 209
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 3 with 2 rules applied. Total rules applied 28 place count 51 transition count 208
Applied a total of 28 rules in 16 ms. Remains 51 /65 variables (removed 14) and now considering 208/258 (removed 50) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16 ms. Remains : 51/65 places, 208/258 transitions.
[2023-03-13 09:27:27] [INFO ] Flatten gal took : 13 ms
[2023-03-13 09:27:27] [INFO ] Flatten gal took : 13 ms
[2023-03-13 09:27:27] [INFO ] Input system was already deterministic with 208 transitions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 258/258 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 60 transition count 223
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 60 transition count 223
Applied a total of 10 rules in 2 ms. Remains 60 /65 variables (removed 5) and now considering 223/258 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 60/65 places, 223/258 transitions.
[2023-03-13 09:27:27] [INFO ] Flatten gal took : 15 ms
[2023-03-13 09:27:27] [INFO ] Flatten gal took : 15 ms
[2023-03-13 09:27:27] [INFO ] Input system was already deterministic with 223 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 65/65 places, 258/258 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 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 5 place count 63 transition count 253
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 59 transition count 253
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 14 place count 54 transition count 218
Iterating global reduction 2 with 5 rules applied. Total rules applied 19 place count 54 transition count 218
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 21 place count 53 transition count 217
Applied a total of 21 rules in 13 ms. Remains 53 /65 variables (removed 12) and now considering 217/258 (removed 41) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 53/65 places, 217/258 transitions.
[2023-03-13 09:27:27] [INFO ] Flatten gal took : 14 ms
[2023-03-13 09:27:27] [INFO ] Flatten gal took : 14 ms
[2023-03-13 09:27:27] [INFO ] Input system was already deterministic with 217 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 65/65 places, 258/258 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 63 transition count 252
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 58 transition count 252
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 18 place count 51 transition count 209
Iterating global reduction 2 with 7 rules applied. Total rules applied 25 place count 51 transition count 209
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 29 place count 49 transition count 207
Applied a total of 29 rules in 13 ms. Remains 49 /65 variables (removed 16) and now considering 207/258 (removed 51) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 49/65 places, 207/258 transitions.
[2023-03-13 09:27:27] [INFO ] Flatten gal took : 12 ms
[2023-03-13 09:27:27] [INFO ] Flatten gal took : 35 ms
[2023-03-13 09:27:27] [INFO ] Input system was already deterministic with 207 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 65/65 places, 258/258 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 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 8 rules applied. Total rules applied 8 place count 63 transition count 250
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 56 transition count 250
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 21 place count 50 transition count 214
Iterating global reduction 2 with 6 rules applied. Total rules applied 27 place count 50 transition count 214
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 31 place count 48 transition count 212
Applied a total of 31 rules in 14 ms. Remains 48 /65 variables (removed 17) and now considering 212/258 (removed 46) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 48/65 places, 212/258 transitions.
[2023-03-13 09:27:27] [INFO ] Flatten gal took : 12 ms
[2023-03-13 09:27:27] [INFO ] Flatten gal took : 12 ms
[2023-03-13 09:27:27] [INFO ] Input system was already deterministic with 212 transitions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 258/258 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 58 transition count 215
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 58 transition count 215
Applied a total of 14 rules in 3 ms. Remains 58 /65 variables (removed 7) and now considering 215/258 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 58/65 places, 215/258 transitions.
[2023-03-13 09:27:27] [INFO ] Flatten gal took : 12 ms
[2023-03-13 09:27:27] [INFO ] Flatten gal took : 12 ms
[2023-03-13 09:27:27] [INFO ] Input system was already deterministic with 215 transitions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 258/258 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 59 transition count 222
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 59 transition count 222
Applied a total of 12 rules in 2 ms. Remains 59 /65 variables (removed 6) and now considering 222/258 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 59/65 places, 222/258 transitions.
[2023-03-13 09:27:27] [INFO ] Flatten gal took : 13 ms
[2023-03-13 09:27:27] [INFO ] Flatten gal took : 13 ms
[2023-03-13 09:27:27] [INFO ] Input system was already deterministic with 222 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 65/65 places, 258/258 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 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 7 rules applied. Total rules applied 7 place count 63 transition count 251
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 57 transition count 250
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 56 transition count 250
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 22 place count 49 transition count 207
Iterating global reduction 3 with 7 rules applied. Total rules applied 29 place count 49 transition count 207
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 33 place count 47 transition count 205
Applied a total of 33 rules in 15 ms. Remains 47 /65 variables (removed 18) and now considering 205/258 (removed 53) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 47/65 places, 205/258 transitions.
[2023-03-13 09:27:27] [INFO ] Flatten gal took : 12 ms
[2023-03-13 09:27:27] [INFO ] Flatten gal took : 13 ms
[2023-03-13 09:27:27] [INFO ] Input system was already deterministic with 205 transitions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 258/258 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 58 transition count 215
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 58 transition count 215
Applied a total of 14 rules in 2 ms. Remains 58 /65 variables (removed 7) and now considering 215/258 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 58/65 places, 215/258 transitions.
[2023-03-13 09:27:27] [INFO ] Flatten gal took : 13 ms
[2023-03-13 09:27:27] [INFO ] Flatten gal took : 14 ms
[2023-03-13 09:27:28] [INFO ] Input system was already deterministic with 215 transitions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 258/258 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 61 transition count 230
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 61 transition count 230
Applied a total of 8 rules in 2 ms. Remains 61 /65 variables (removed 4) and now considering 230/258 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 61/65 places, 230/258 transitions.
[2023-03-13 09:27:28] [INFO ] Flatten gal took : 14 ms
[2023-03-13 09:27:28] [INFO ] Flatten gal took : 14 ms
[2023-03-13 09:27:28] [INFO ] Input system was already deterministic with 230 transitions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 258/258 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 63 transition count 244
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 63 transition count 244
Applied a total of 4 rules in 1 ms. Remains 63 /65 variables (removed 2) and now considering 244/258 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 63/65 places, 244/258 transitions.
[2023-03-13 09:27:28] [INFO ] Flatten gal took : 14 ms
[2023-03-13 09:27:28] [INFO ] Flatten gal took : 15 ms
[2023-03-13 09:27:28] [INFO ] Input system was already deterministic with 244 transitions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 258/258 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 59 transition count 222
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 59 transition count 222
Applied a total of 12 rules in 3 ms. Remains 59 /65 variables (removed 6) and now considering 222/258 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 59/65 places, 222/258 transitions.
[2023-03-13 09:27:28] [INFO ] Flatten gal took : 11 ms
[2023-03-13 09:27:28] [INFO ] Flatten gal took : 11 ms
[2023-03-13 09:27:28] [INFO ] Input system was already deterministic with 222 transitions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 258/258 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 59 transition count 216
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 59 transition count 216
Applied a total of 12 rules in 2 ms. Remains 59 /65 variables (removed 6) and now considering 216/258 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 59/65 places, 216/258 transitions.
[2023-03-13 09:27:28] [INFO ] Flatten gal took : 13 ms
[2023-03-13 09:27:28] [INFO ] Flatten gal took : 13 ms
[2023-03-13 09:27:28] [INFO ] Input system was already deterministic with 216 transitions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 258/258 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 61 transition count 230
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 61 transition count 230
Applied a total of 8 rules in 1 ms. Remains 61 /65 variables (removed 4) and now considering 230/258 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 61/65 places, 230/258 transitions.
[2023-03-13 09:27:28] [INFO ] Flatten gal took : 13 ms
[2023-03-13 09:27:28] [INFO ] Flatten gal took : 13 ms
[2023-03-13 09:27:28] [INFO ] Input system was already deterministic with 230 transitions.
[2023-03-13 09:27:28] [INFO ] Flatten gal took : 14 ms
[2023-03-13 09:27:28] [INFO ] Flatten gal took : 14 ms
[2023-03-13 09:27:28] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-13 09:27:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 65 places, 258 transitions and 2174 arcs took 1 ms.
Total runtime 4526 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: 65 NrTr: 258 NrArc: 2174)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.006sec
net check time: 0m 0.000sec
init dd package: 0m 2.980sec
RS generation: 0m 3.189sec
-> reachability set: #nodes 17667 (1.8e+04) #states 15,168,174 (7)
starting MCC model checker
--------------------------
checking: EX [0<=0]
normalized: EX [0<=0]
abstracting: (0<=0)
states: 15,168,174 (7)
.-> the formula is TRUE
FORMULA AutonomousCar-PT-06a-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.646sec
checking: AG [AX [EX [[p5<=0 & 0<=p5]]]]
normalized: ~ [E [true U EX [~ [EX [[p5<=0 & 0<=p5]]]]]]
abstracting: (0<=p5)
states: 15,168,174 (7)
abstracting: (p5<=0)
states: 13,049,569 (7)
..-> the formula is FALSE
FORMULA AutonomousCar-PT-06a-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m25.756sec
checking: AF [AG [[[p39<=0 & 0<=p39] & [p11<=1 & 1<=p11]]]]
normalized: ~ [EG [E [true U ~ [[[p11<=1 & 1<=p11] & [p39<=0 & 0<=p39]]]]]]
abstracting: (0<=p39)
states: 15,168,174 (7)
abstracting: (p39<=0)
states: 13,075,844 (7)
abstracting: (1<=p11)
states: 2,092,330 (6)
abstracting: (p11<=1)
states: 15,168,174 (7)
EG iterations: 0
-> the formula is FALSE
FORMULA AutonomousCar-PT-06a-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.497sec
checking: AF [AG [[[p35<=0 & 0<=p35] & [p59<=1 & 1<=p59]]]]
normalized: ~ [EG [E [true U ~ [[[p59<=1 & 1<=p59] & [p35<=0 & 0<=p35]]]]]]
abstracting: (0<=p35)
states: 15,168,174 (7)
abstracting: (p35<=0)
states: 13,075,844 (7)
abstracting: (1<=p59)
states: 3,012,922 (6)
abstracting: (p59<=1)
states: 15,168,174 (7)
EG iterations: 0
-> the formula is FALSE
FORMULA AutonomousCar-PT-06a-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.086sec
checking: AF [[[p50<=0 & 0<=p50] & [p34<=1 & 1<=p34]]]
normalized: ~ [EG [~ [[[p34<=1 & 1<=p34] & [p50<=0 & 0<=p50]]]]]
abstracting: (0<=p50)
states: 15,168,174 (7)
abstracting: (p50<=0)
states: 13,075,844 (7)
abstracting: (1<=p34)
states: 2,367,277 (6)
abstracting: (p34<=1)
states: 15,168,174 (7)
................
EG iterations: 16
-> the formula is FALSE
FORMULA AutonomousCar-PT-06a-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.537sec
checking: AX [EG [~ [A [[EF [[p17<=1 & 1<=p17]] & ~ [[p22<=1 & 1<=p22]]] U EG [[p14<=0 & 0<=p14]]]]]]
normalized: ~ [EX [~ [EG [~ [[~ [EG [~ [EG [[p14<=0 & 0<=p14]]]]] & ~ [E [~ [EG [[p14<=0 & 0<=p14]]] U [~ [[E [true U [p17<=1 & 1<=p17]] & ~ [[p22<=1 & 1<=p22]]]] & ~ [EG [[p14<=0 & 0<=p14]]]]]]]]]]]]
abstracting: (0<=p14)
states: 15,168,174 (7)
abstracting: (p14<=0)
states: 13,075,844 (7)
.
EG iterations: 1
abstracting: (1<=p22)
states: 2,092,330 (6)
abstracting: (p22<=1)
states: 15,168,174 (7)
abstracting: (1<=p17)
states: 2,092,330 (6)
abstracting: (p17<=1)
states: 15,168,174 (7)
abstracting: (0<=p14)
states: 15,168,174 (7)
abstracting: (p14<=0)
states: 13,075,844 (7)
.
EG iterations: 1
abstracting: (0<=p14)
states: 15,168,174 (7)
abstracting: (p14<=0)
states: 13,075,844 (7)
.
EG iterations: 1
................
EG iterations: 16
................
EG iterations: 16
.-> the formula is FALSE
FORMULA AutonomousCar-PT-06a-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 7.819sec
checking: AX [E [EF [[[p61<=1 & 1<=p61] & [p25<=1 & 1<=p25]]] U AX [AX [[p63<=1 & 1<=p63]]]]]
normalized: ~ [EX [~ [E [E [true U [[p25<=1 & 1<=p25] & [p61<=1 & 1<=p61]]] U ~ [EX [EX [~ [[p63<=1 & 1<=p63]]]]]]]]]
abstracting: (1<=p63)
states: 6,731,738 (6)
abstracting: (p63<=1)
states: 15,168,174 (7)
..abstracting: (1<=p61)
states: 3,012,922 (6)
abstracting: (p61<=1)
states: 15,168,174 (7)
abstracting: (1<=p25)
states: 2,092,330 (6)
abstracting: (p25<=1)
states: 15,168,174 (7)
.-> the formula is TRUE
FORMULA AutonomousCar-PT-06a-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m16.897sec
checking: AX [AF [[A [[0<=p27 & p27<=0] U EX [[[p26<=1 & 1<=p26] | [p19<=0 & 0<=p19]]]] & EX [[[p53<=0 & 0<=p53] & [p26<=1 & 1<=p26]]]]]]
normalized: ~ [EX [EG [~ [[[~ [EG [~ [EX [[[p19<=0 & 0<=p19] | [p26<=1 & 1<=p26]]]]]] & ~ [E [~ [EX [[[p19<=0 & 0<=p19] | [p26<=1 & 1<=p26]]]] U [~ [[0<=p27 & p27<=0]] & ~ [EX [[[p19<=0 & 0<=p19] | [p26<=1 & 1<=p26]]]]]]]] & EX [[[p26<=1 & 1<=p26] & [p53<=0 & 0<=p53]]]]]]]]
abstracting: (0<=p53)
states: 15,168,174 (7)
abstracting: (p53<=0)
states: 14,932,876 (7)
abstracting: (1<=p26)
states: 2,064,298 (6)
abstracting: (p26<=1)
states: 15,168,174 (7)
.abstracting: (1<=p26)
states: 2,064,298 (6)
abstracting: (p26<=1)
states: 15,168,174 (7)
abstracting: (0<=p19)
states: 15,168,174 (7)
abstracting: (p19<=0)
states: 13,103,876 (7)
.abstracting: (p27<=0)
states: 12,800,897 (7)
abstracting: (0<=p27)
states: 15,168,174 (7)
abstracting: (1<=p26)
states: 2,064,298 (6)
abstracting: (p26<=1)
states: 15,168,174 (7)
abstracting: (0<=p19)
states: 15,168,174 (7)
abstracting: (p19<=0)
states: 13,103,876 (7)
.abstracting: (1<=p26)
states: 2,064,298 (6)
abstracting: (p26<=1)
states: 15,168,174 (7)
abstracting: (0<=p19)
states: 15,168,174 (7)
abstracting: (p19<=0)
states: 13,103,876 (7)
...
EG iterations: 2
........
EG iterations: 8
.-> the formula is FALSE
FORMULA AutonomousCar-PT-06a-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.945sec
checking: EF [~ [A [[[[1<=p62 & p62<=1] | [p54<=0 & 0<=p54]] & [[p13<=0 & 0<=p13] | [1<=p29 & p29<=1]]] U EG [EF [[[1<=p54 & p54<=1] | [0<=p41 & p41<=0]]]]]]]
normalized: E [true U ~ [[~ [EG [~ [EG [E [true U [[0<=p41 & p41<=0] | [1<=p54 & p54<=1]]]]]]] & ~ [E [~ [EG [E [true U [[0<=p41 & p41<=0] | [1<=p54 & p54<=1]]]]] U [~ [[[[p54<=0 & 0<=p54] | [1<=p62 & p62<=1]] & [[1<=p29 & p29<=1] | [p13<=0 & 0<=p13]]]] & ~ [EG [E [true U [[0<=p41 & p41<=0] | [1<=p54 & p54<=1]]]]]]]]]]]
abstracting: (p54<=1)
states: 15,168,174 (7)
abstracting: (1<=p54)
states: 235,298 (5)
abstracting: (p41<=0)
states: 12,800,897 (7)
abstracting: (0<=p41)
states: 15,168,174 (7)
......................................................................................
EG iterations: 86
abstracting: (0<=p13)
states: 15,168,174 (7)
abstracting: (p13<=0)
states: 12,800,897 (7)
abstracting: (p29<=1)
states: 15,168,174 (7)
abstracting: (1<=p29)
states: 2,092,330 (6)
abstracting: (p62<=1)
states: 15,168,174 (7)
abstracting: (1<=p62)
states: 3,012,922 (6)
abstracting: (0<=p54)
states: 15,168,174 (7)
abstracting: (p54<=0)
states: 14,932,876 (7)
abstracting: (p54<=1)
states: 15,168,174 (7)
abstracting: (1<=p54)
states: 235,298 (5)
abstracting: (p41<=0)
states: 12,800,897 (7)
abstracting: (0<=p41)
states: 15,168,174 (7)
......................................................................................
EG iterations: 86
abstracting: (p54<=1)
states: 15,168,174 (7)
abstracting: (1<=p54)
states: 235,298 (5)
abstracting: (p41<=0)
states: 12,800,897 (7)
abstracting: (0<=p41)
states: 15,168,174 (7)
......................................................................................
EG iterations: 86
.
EG iterations: 1
-> the formula is TRUE
FORMULA AutonomousCar-PT-06a-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m53.036sec
checking: AF [[EG [~ [A [[[p25<=0 & 0<=p25] | [p56<=1 & 1<=p56]] U [[p9<=0 & 0<=p9] | [p64<=1 & 1<=p64]]]]] | [[p36<=0 & 0<=p36] & [p6<=1 & 1<=p6]]]]
normalized: ~ [EG [~ [[[[p6<=1 & 1<=p6] & [p36<=0 & 0<=p36]] | EG [~ [[~ [EG [~ [[[p64<=1 & 1<=p64] | [p9<=0 & 0<=p9]]]]] & ~ [E [~ [[[p64<=1 & 1<=p64] | [p9<=0 & 0<=p9]]] U [~ [[[p56<=1 & 1<=p56] | [p25<=0 & 0<=p25]]] & ~ [[[p64<=1 & 1<=p64] | [p9<=0 & 0<=p9]]]]]]]]]]]]]
abstracting: (0<=p9)
states: 15,168,174 (7)
abstracting: (p9<=0)
states: 13,227,961 (7)
abstracting: (1<=p64)
states: 2,410,591 (6)
abstracting: (p64<=1)
states: 15,168,174 (7)
abstracting: (0<=p25)
states: 15,168,174 (7)
abstracting: (p25<=0)
states: 13,075,844 (7)
abstracting: (1<=p56)
states: 3,001,256 (6)
abstracting: (p56<=1)
states: 15,168,174 (7)
abstracting: (0<=p9)
states: 15,168,174 (7)
abstracting: (p9<=0)
states: 13,227,961 (7)
abstracting: (1<=p64)
states: 2,410,591 (6)
abstracting: (p64<=1)
states: 15,168,174 (7)
abstracting: (0<=p9)
states: 15,168,174 (7)
abstracting: (p9<=0)
states: 13,227,961 (7)
abstracting: (1<=p64)
states: 2,410,591 (6)
abstracting: (p64<=1)
states: 15,168,174 (7)
.............
EG iterations: 13
............
EG iterations: 12
abstracting: (0<=p36)
states: 15,168,174 (7)
abstracting: (p36<=0)
states: 13,075,844 (7)
abstracting: (1<=p6)
states: 2,118,605 (6)
abstracting: (p6<=1)
states: 15,168,174 (7)
..............
EG iterations: 14
-> the formula is FALSE
FORMULA AutonomousCar-PT-06a-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 8.216sec
checking: AF [[[AF [[[p3<=1 & 1<=p3] & EX [[[p45<=0 & 0<=p45] | [p26<=1 & 1<=p26]]]]] | AF [[p61<=1 & 1<=p61]]] | [EG [~ [[p40<=1 & 1<=p40]]] | [p53<=1 & 1<=p53]]]]
normalized: ~ [EG [~ [[[~ [EG [~ [[[p3<=1 & 1<=p3] & EX [[[p26<=1 & 1<=p26] | [p45<=0 & 0<=p45]]]]]]] | ~ [EG [~ [[p61<=1 & 1<=p61]]]]] | [[p53<=1 & 1<=p53] | EG [~ [[p40<=1 & 1<=p40]]]]]]]]
abstracting: (1<=p40)
states: 2,064,298 (6)
abstracting: (p40<=1)
states: 15,168,174 (7)
.........
EG iterations: 9
abstracting: (1<=p53)
states: 235,298 (5)
abstracting: (p53<=1)
states: 15,168,174 (7)
abstracting: (1<=p61)
states: 3,012,922 (6)
abstracting: (p61<=1)
states: 15,168,174 (7)
.
EG iterations: 1
abstracting: (0<=p45)
states: 15,168,174 (7)
abstracting: (p45<=0)
states: 13,075,844 (7)
abstracting: (1<=p26)
states: 2,064,298 (6)
abstracting: (p26<=1)
states: 15,168,174 (7)
.abstracting: (1<=p3)
states: 1,294,139 (6)
abstracting: (p3<=1)
states: 15,168,174 (7)
..................
EG iterations: 18
.........................................................................................
EG iterations: 89
-> the formula is TRUE
FORMULA AutonomousCar-PT-06a-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m32.842sec
checking: AG [EF [[EX [[[p37<=1 & 1<=p37] | [p57<=1 & 1<=p57]]] | [EF [[p34<=1 & 1<=p34]] & [EX [[p1<=1 & 1<=p1]] & [[p12<=0 & 0<=p12] | [[p61<=0 & 0<=p61] & [p6<=1 & 1<=p6]]]]]]]]
normalized: ~ [E [true U ~ [E [true U [[E [true U [p34<=1 & 1<=p34]] & [[[[p6<=1 & 1<=p6] & [p61<=0 & 0<=p61]] | [p12<=0 & 0<=p12]] & EX [[p1<=1 & 1<=p1]]]] | EX [[[p57<=1 & 1<=p57] | [p37<=1 & 1<=p37]]]]]]]]
abstracting: (1<=p37)
states: 2,367,278 (6)
abstracting: (p37<=1)
states: 15,168,174 (7)
abstracting: (1<=p57)
states: 4,517,318 (6)
abstracting: (p57<=1)
states: 15,168,174 (7)
.abstracting: (1<=p1)
states: 15,168,173 (7)
abstracting: (p1<=1)
states: 15,168,174 (7)
.abstracting: (0<=p12)
states: 15,168,174 (7)
abstracting: (p12<=0)
states: 13,103,876 (7)
abstracting: (0<=p61)
states: 15,168,174 (7)
abstracting: (p61<=0)
states: 12,155,252 (7)
abstracting: (1<=p6)
states: 2,118,605 (6)
abstracting: (p6<=1)
states: 15,168,174 (7)
abstracting: (1<=p34)
states: 2,367,277 (6)
abstracting: (p34<=1)
states: 15,168,174 (7)
-> the formula is FALSE
FORMULA AutonomousCar-PT-06a-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m33.389sec
checking: AG [[EF [[p10<=0 & 0<=p10]] & [A [~ [[p32<=1 & 1<=p32]] U [[p4<=0 & 0<=p4] | [[p40<=1 & 1<=p40] | [p55<=1 & 1<=p55]]]] | [[p11<=0 & 0<=p11] & [p61<=1 & 1<=p61]]]]]
normalized: ~ [E [true U ~ [[[[[p61<=1 & 1<=p61] & [p11<=0 & 0<=p11]] | [~ [EG [~ [[[[p55<=1 & 1<=p55] | [p40<=1 & 1<=p40]] | [p4<=0 & 0<=p4]]]]] & ~ [E [~ [[[[p55<=1 & 1<=p55] | [p40<=1 & 1<=p40]] | [p4<=0 & 0<=p4]]] U [[p32<=1 & 1<=p32] & ~ [[[[p55<=1 & 1<=p55] | [p40<=1 & 1<=p40]] | [p4<=0 & 0<=p4]]]]]]]] & E [true U [p10<=0 & 0<=p10]]]]]]
abstracting: (0<=p10)
states: 15,168,174 (7)
abstracting: (p10<=0)
states: 13,075,844 (7)
abstracting: (0<=p4)
states: 15,168,174 (7)
abstracting: (p4<=0)
states: 13,049,569 (7)
abstracting: (1<=p40)
states: 2,064,298 (6)
abstracting: (p40<=1)
states: 15,168,174 (7)
abstracting: (1<=p55)
states: 3,001,256 (6)
abstracting: (p55<=1)
states: 15,168,174 (7)
abstracting: (1<=p32)
states: 2,092,330 (6)
abstracting: (p32<=1)
states: 15,168,174 (7)
abstracting: (0<=p4)
states: 15,168,174 (7)
abstracting: (p4<=0)
states: 13,049,569 (7)
abstracting: (1<=p40)
states: 2,064,298 (6)
abstracting: (p40<=1)
states: 15,168,174 (7)
abstracting: (1<=p55)
states: 3,001,256 (6)
abstracting: (p55<=1)
states: 15,168,174 (7)
abstracting: (0<=p4)
states: 15,168,174 (7)
abstracting: (p4<=0)
states: 13,049,569 (7)
abstracting: (1<=p40)
states: 2,064,298 (6)
abstracting: (p40<=1)
states: 15,168,174 (7)
abstracting: (1<=p55)
states: 3,001,256 (6)
abstracting: (p55<=1)
states: 15,168,174 (7)
...............
EG iterations: 15
abstracting: (0<=p11)
states: 15,168,174 (7)
abstracting: (p11<=0)
states: 13,075,844 (7)
abstracting: (1<=p61)
states: 3,012,922 (6)
abstracting: (p61<=1)
states: 15,168,174 (7)
-> the formula is FALSE
FORMULA AutonomousCar-PT-06a-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m34.060sec
checking: [EG [[[p41<=0 & 0<=p41] | [[p63<=1 & 1<=p63] | [p28<=1 & 1<=p28]]]] & EG [AX [[AF [[[p41<=0 & 0<=p41] & [p64<=1 & 1<=p64]]] | [[[p2<=0 & 0<=p2] & [p32<=1 & 1<=p32]] | AG [[[p32<=0 & 0<=p32] & [p20<=1 & 1<=p20]]]]]]]]
normalized: [EG [~ [EX [~ [[[~ [E [true U ~ [[[p20<=1 & 1<=p20] & [p32<=0 & 0<=p32]]]]] | [[p32<=1 & 1<=p32] & [p2<=0 & 0<=p2]]] | ~ [EG [~ [[[p64<=1 & 1<=p64] & [p41<=0 & 0<=p41]]]]]]]]]] & EG [[[[p28<=1 & 1<=p28] | [p63<=1 & 1<=p63]] | [p41<=0 & 0<=p41]]]]
abstracting: (0<=p41)
states: 15,168,174 (7)
abstracting: (p41<=0)
states: 12,800,897 (7)
abstracting: (1<=p63)
states: 6,731,738 (6)
abstracting: (p63<=1)
states: 15,168,174 (7)
abstracting: (1<=p28)
states: 2,092,330 (6)
abstracting: (p28<=1)
states: 15,168,174 (7)
...............
EG iterations: 15
abstracting: (0<=p41)
states: 15,168,174 (7)
abstracting: (p41<=0)
states: 12,800,897 (7)
abstracting: (1<=p64)
states: 2,410,591 (6)
abstracting: (p64<=1)
states: 15,168,174 (7)
.........
EG iterations: 9
abstracting: (0<=p2)
states: 15,168,174 (7)
abstracting: (p2<=0)
states: 13,827,378 (7)
abstracting: (1<=p32)
states: 2,092,330 (6)
abstracting: (p32<=1)
states: 15,168,174 (7)
abstracting: (0<=p32)
states: 15,168,174 (7)
abstracting: (p32<=0)
states: 13,075,844 (7)
abstracting: (1<=p20)
states: 2,367,277 (6)
abstracting: (p20<=1)
states: 15,168,174 (7)
..............
EG iterations: 13
-> the formula is TRUE
FORMULA AutonomousCar-PT-06a-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m14.460sec
checking: [EF [[[[[p28<=0 & 0<=p28] & AG [[~ [[p22<=0 & 0<=p22]] & ~ [[p38<=1 & 1<=p38]]]]] | [[p0<=0 & 0<=p0] & [p1<=1 & 1<=p1]]] | [[p1<=1 & 1<=p1] | [[p63<=0 & 0<=p63] & [[p20<=0 & 0<=p20] & [p15<=1 & 1<=p15]]]]]] & [~ [A [AX [[p1<=1 & 1<=p1]] U EG [EX [[p33<=0 & 0<=p33]]]]] | EG [[p53<=1 & 1<=p53]]]]
normalized: [[~ [[~ [EG [~ [EG [EX [[p33<=0 & 0<=p33]]]]]] & ~ [E [~ [EG [EX [[p33<=0 & 0<=p33]]]] U [EX [~ [[p1<=1 & 1<=p1]]] & ~ [EG [EX [[p33<=0 & 0<=p33]]]]]]]]] | EG [[p53<=1 & 1<=p53]]] & E [true U [[[[[p15<=1 & 1<=p15] & [p20<=0 & 0<=p20]] & [p63<=0 & 0<=p63]] | [p1<=1 & 1<=p1]] | [[[p1<=1 & 1<=p1] & [p0<=0 & 0<=p0]] | [~ [E [true U ~ [[~ [[p38<=1 & 1<=p38]] & ~ [[p22<=0 & 0<=p22]]]]]] & [p28<=0 & 0<=p28]]]]]]
abstracting: (0<=p28)
states: 15,168,174 (7)
abstracting: (p28<=0)
states: 13,075,844 (7)
abstracting: (0<=p22)
states: 15,168,174 (7)
abstracting: (p22<=0)
states: 13,075,844 (7)
abstracting: (1<=p38)
states: 2,092,330 (6)
abstracting: (p38<=1)
states: 15,168,174 (7)
abstracting: (0<=p0)
states: 15,168,174 (7)
abstracting: (p0<=0)
states: 15,168,173 (7)
abstracting: (1<=p1)
states: 15,168,173 (7)
abstracting: (p1<=1)
states: 15,168,174 (7)
abstracting: (1<=p1)
states: 15,168,173 (7)
abstracting: (p1<=1)
states: 15,168,174 (7)
abstracting: (0<=p63)
states: 15,168,174 (7)
abstracting: (p63<=0)
states: 8,436,436 (6)
abstracting: (0<=p20)
states: 15,168,174 (7)
abstracting: (p20<=0)
states: 12,800,897 (7)
abstracting: (1<=p15)
states: 2,092,330 (6)
abstracting: (p15<=1)
states: 15,168,174 (7)
abstracting: (1<=p53)
states: 235,298 (5)
abstracting: (p53<=1)
states: 15,168,174 (7)
.
EG iterations: 1
abstracting: (0<=p33)
states: 15,168,174 (7)
abstracting: (p33<=0)
states: 13,103,876 (7)
........................................................................................
EG iterations: 87
abstracting: (1<=p1)
states: 15,168,173 (7)
abstracting: (p1<=1)
states: 15,168,174 (7)
.abstracting: (0<=p33)
states: 15,168,174 (7)
abstracting: (p33<=0)
states: 13,103,876 (7)
........................................................................................
EG iterations: 87
abstracting: (0<=p33)
states: 15,168,174 (7)
abstracting: (p33<=0)
states: 13,103,876 (7)
........................................................................................
EG iterations: 87
.........
EG iterations: 9
-> the formula is FALSE
FORMULA AutonomousCar-PT-06a-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m17.079sec
checking: [AG [[EG [AX [AF [[[p22<=0 & 0<=p22] | [p5<=1 & 1<=p5]]]]] & AF [[[[[p25<=1 & 1<=p25] | [p33<=0 & 0<=p33]] | [[p40<=1 & 1<=p40] | [p21<=1 & 1<=p21]]] & [p30<=1 & 1<=p30]]]]] & [AF [[AG [~ [[p18<=0 & 0<=p18]]] | AF [[[p50<=0 & 0<=p50] | [p47<=1 & 1<=p47]]]]] | EG [[EG [AG [[[p22<=0 & 0<=p22] | [p53<=1 & 1<=p53]]]] | EF [[p41<=0 & 0<=p41]]]]]]
normalized: [[~ [EG [~ [[~ [E [true U [p18<=0 & 0<=p18]]] | ~ [EG [~ [[[p47<=1 & 1<=p47] | [p50<=0 & 0<=p50]]]]]]]]] | EG [[E [true U [p41<=0 & 0<=p41]] | EG [~ [E [true U ~ [[[p53<=1 & 1<=p53] | [p22<=0 & 0<=p22]]]]]]]]] & ~ [E [true U ~ [[~ [EG [~ [[[p30<=1 & 1<=p30] & [[[p21<=1 & 1<=p21] | [p40<=1 & 1<=p40]] | [[p33<=0 & 0<=p33] | [p25<=1 & 1<=p25]]]]]]] & EG [~ [EX [EG [~ [[[p5<=1 & 1<=p5] | [p22<=0 & 0<=p22]]]]]]]]]]]]
abstracting: (0<=p22)
states: 15,168,174 (7)
abstracting: (p22<=0)
states: 13,075,844 (7)
abstracting: (1<=p5)
states: 2,118,605 (6)
abstracting: (p5<=1)
states: 15,168,174 (7)
................
EG iterations: 16
.........
EG iterations: 8
abstracting: (1<=p25)
states: 2,092,330 (6)
abstracting: (p25<=1)
states: 15,168,174 (7)
abstracting: (0<=p33)
states: 15,168,174 (7)
abstracting: (p33<=0)
states: 13,103,876 (7)
abstracting: (1<=p40)
states: 2,064,298 (6)
abstracting: (p40<=1)
states: 15,168,174 (7)
abstracting: (1<=p21)
states: 2,092,330 (6)
abstracting: (p21<=1)
states: 15,168,174 (7)
abstracting: (1<=p30)
states: 2,367,278 (6)
abstracting: (p30<=1)
states: 15,168,174 (7)
..............
EG iterations: 14
abstracting: (0<=p22)
states: 15,168,174 (7)
abstracting: (p22<=0)
states: 13,075,844 (7)
abstracting: (1<=p53)
states: 235,298 (5)
abstracting: (p53<=1)
states: 15,168,174 (7)
.
EG iterations: 1
abstracting: (0<=p41)
states: 15,168,174 (7)
abstracting: (p41<=0)
states: 12,800,897 (7)
before gc: list nodes free: 24454
after gc: idd nodes used:305001, unused:63694999; list nodes free:308969064
.
EG iterations: 1
abstracting: (0<=p50)
states: 15,168,174 (7)
abstracting: (p50<=0)
states: 13,075,844 (7)
abstracting: (1<=p47)
states: 2,064,298 (6)
abstracting: (p47<=1)
states: 15,168,174 (7)
................
EG iterations: 16
abstracting: (0<=p18)
states: 15,168,174 (7)
abstracting: (p18<=0)
states: 13,075,844 (7)
.
EG iterations: 1
-> the formula is FALSE
FORMULA AutonomousCar-PT-06a-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m26.024sec
totally nodes used: 65339909 (6.5e+07)
number of garbage collections: 1
fire ops cache: hits/miss/sum: 354681063 712259961 1066941024
used/not used/entry size/cache size: 15062279 52046585 16 1024MB
basic ops cache: hits/miss/sum: 28877021 39657173 68534194
used/not used/entry size/cache size: 1500797 15276419 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: 152995 315879 468874
used/not used/entry size/cache size: 26408 8362200 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 65567253
1 1449708
2 81618
3 9267
4 929
5 85
6 4
7 0
8 0
9 0
>= 10 0
Total processing time: 4m45.302sec
BK_STOP 1678699933985
--------------------
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 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.001sec
16155 18035
iterations count:278462 (1079), effective:6370 (24)
initing FirstDep: 0m 0.000sec
37414 38473 35812 36307
iterations count:457788 (1774), effective:7926 (30)
iterations count:259 (1), effective:1 (0)
iterations count:259 (1), effective:1 (0)
18275
iterations count:195975 (759), effective:2814 (10)
iterations count:8431 (32), effective:77 (0)
15803 15854 18934
iterations count:395654 (1533), effective:6239 (24)
iterations count:79398 (307), effective:1867 (7)
iterations count:258 (1), effective:0 (0)
22749
iterations count:182402 (706), effective:2676 (10)
22749
iterations count:182402 (706), effective:2676 (10)
17614
iterations count:115967 (449), effective:1557 (6)
22749
iterations count:182402 (706), effective:2676 (10)
32171 32049 19842 18773
iterations count:450452 (1745), effective:7977 (30)
iterations count:20832 (80), effective:313 (1)
14392 17959 16218 16604 16384 16578
iterations count:606079 (2349), effective:10332 (40)
iterations count:272 (1), effective:1 (0)
30292 28552 33614
iterations count:310443 (1203), effective:5562 (21)
iterations count:340 (1), effective:7 (0)
iterations count:6601 (25), effective:119 (0)
32389 36732 34315 36549 36726
iterations count:595799 (2309), effective:8434 (32)
22115
iterations count:194267 (752), effective:2684 (10)
iterations count:302 (1), effective:2 (0)
iterations count:393 (1), effective:1 (0)
24024 23520
iterations count:203289 (787), effective:3244 (12)
11576
iterations count:199707 (774), effective:3228 (12)
20599
iterations count:183488 (711), effective:2801 (10)
iterations count:259 (1), effective:1 (0)
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutonomousCar-PT-06a"
export BK_EXAMINATION="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-06a, 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-167813599300609"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-06a.tgz
mv AutonomousCar-PT-06a execution
cd execution
if [ "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 '
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 ;