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.r266-smll-167863540900410.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 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 Parking-PT-104, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r266-smll-167863540900410
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 6.7K Feb 26 14:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 14:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 26 14:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 26 14:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 15:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 15:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 14:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K Feb 26 14:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 23K Mar 5 18:23 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 Parking-PT-104-CTLFireability-00
FORMULA_NAME Parking-PT-104-CTLFireability-01
FORMULA_NAME Parking-PT-104-CTLFireability-02
FORMULA_NAME Parking-PT-104-CTLFireability-03
FORMULA_NAME Parking-PT-104-CTLFireability-04
FORMULA_NAME Parking-PT-104-CTLFireability-05
FORMULA_NAME Parking-PT-104-CTLFireability-06
FORMULA_NAME Parking-PT-104-CTLFireability-07
FORMULA_NAME Parking-PT-104-CTLFireability-08
FORMULA_NAME Parking-PT-104-CTLFireability-09
FORMULA_NAME Parking-PT-104-CTLFireability-10
FORMULA_NAME Parking-PT-104-CTLFireability-11
FORMULA_NAME Parking-PT-104-CTLFireability-12
FORMULA_NAME Parking-PT-104-CTLFireability-13
FORMULA_NAME Parking-PT-104-CTLFireability-14
FORMULA_NAME Parking-PT-104-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679042459791

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=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-104
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-17 08:41:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-17 08:41:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 08:41:03] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2023-03-17 08:41:03] [INFO ] Transformed 65 places.
[2023-03-17 08:41:03] [INFO ] Transformed 97 transitions.
[2023-03-17 08:41:03] [INFO ] Found NUPN structural information;
[2023-03-17 08:41:03] [INFO ] Parsed PT model containing 65 places and 97 transitions and 284 arcs in 234 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 18 ms.
Ensure Unique test removed 41 transitions
Reduce redundant transitions removed 41 transitions.
Support contains 48 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 56/56 transitions.
Applied a total of 0 rules in 34 ms. Remains 65 /65 variables (removed 0) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 65 cols
[2023-03-17 08:41:04] [INFO ] Computed 16 place invariants in 10 ms
[2023-03-17 08:41:04] [INFO ] Implicit Places using invariants in 327 ms returned [32, 48]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 390 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/65 places, 56/56 transitions.
Applied a total of 0 rules in 5 ms. Remains 63 /63 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 432 ms. Remains : 63/65 places, 56/56 transitions.
Support contains 48 out of 63 places after structural reductions.
[2023-03-17 08:41:04] [INFO ] Flatten gal took : 67 ms
[2023-03-17 08:41:04] [INFO ] Flatten gal took : 22 ms
[2023-03-17 08:41:04] [INFO ] Input system was already deterministic with 56 transitions.
Incomplete random walk after 10000 steps, including 594 resets, run finished after 1136 ms. (steps per millisecond=8 ) properties (out of 48) seen :37
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 110 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 101 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 102 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 110 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 56 rows 63 cols
[2023-03-17 08:41:06] [INFO ] Computed 14 place invariants in 3 ms
[2023-03-17 08:41:06] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-17 08:41:07] [INFO ] After 97ms SMT Verify possible using state equation in real domain returned unsat :6 sat :1 real:4
[2023-03-17 08:41:07] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-17 08:41:07] [INFO ] After 18ms SMT Verify possible using 12 Read/Feed constraints in real domain returned unsat :6 sat :0 real:5
[2023-03-17 08:41:07] [INFO ] After 326ms SMT Verify possible using all constraints in real domain returned unsat :6 sat :0 real:5
[2023-03-17 08:41:07] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2023-03-17 08:41:07] [INFO ] After 94ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :5
[2023-03-17 08:41:07] [INFO ] After 56ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :6 sat :5
[2023-03-17 08:41:07] [INFO ] After 146ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :5
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-17 08:41:07] [INFO ] After 415ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :5
Fused 11 Parikh solutions to 5 different solutions.
Parikh walk visited 2 properties in 12 ms.
Support contains 6 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 56/56 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 63 transition count 54
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 61 transition count 54
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 61 transition count 52
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 8 place count 59 transition count 52
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 58 transition count 51
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 58 transition count 51
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 55 transition count 48
Free-agglomeration rule applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 23 place count 55 transition count 41
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 30 place count 48 transition count 41
Applied a total of 30 rules in 35 ms. Remains 48 /63 variables (removed 15) and now considering 41/56 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 48/63 places, 41/56 transitions.
Incomplete random walk after 10000 steps, including 269 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 41 rows 48 cols
[2023-03-17 08:41:07] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-17 08:41:07] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2023-03-17 08:41:07] [INFO ] After 41ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-17 08:41:07] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-17 08:41:07] [INFO ] After 10ms SMT Verify possible using 26 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-17 08:41:07] [INFO ] After 21ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-17 08:41:07] [INFO ] After 128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 08:41:07] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2023-03-17 08:41:07] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 08:41:07] [INFO ] After 14ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 08:41:07] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-17 08:41:07] [INFO ] After 137ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 9 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=4 )
Parikh walk visited 1 properties in 1 ms.
Successfully simplified 6 atomic propositions for a total of 16 simplifications.
[2023-03-17 08:41:07] [INFO ] Flatten gal took : 11 ms
[2023-03-17 08:41:07] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Parking-PT-104-CTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-17 08:41:08] [INFO ] Flatten gal took : 12 ms
[2023-03-17 08:41:08] [INFO ] Input system was already deterministic with 56 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 56/56 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 62 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 62 transition count 55
Applied a total of 2 rules in 5 ms. Remains 62 /63 variables (removed 1) and now considering 55/56 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 62/63 places, 55/56 transitions.
[2023-03-17 08:41:08] [INFO ] Flatten gal took : 8 ms
[2023-03-17 08:41:08] [INFO ] Flatten gal took : 9 ms
[2023-03-17 08:41:08] [INFO ] Input system was already deterministic with 55 transitions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 56/56 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 61 transition count 54
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 61 transition count 54
Applied a total of 4 rules in 6 ms. Remains 61 /63 variables (removed 2) and now considering 54/56 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 61/63 places, 54/56 transitions.
[2023-03-17 08:41:08] [INFO ] Flatten gal took : 7 ms
[2023-03-17 08:41:08] [INFO ] Flatten gal took : 8 ms
[2023-03-17 08:41:08] [INFO ] Input system was already deterministic with 54 transitions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 56/56 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 61 transition count 54
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 61 transition count 54
Applied a total of 4 rules in 6 ms. Remains 61 /63 variables (removed 2) and now considering 54/56 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 61/63 places, 54/56 transitions.
[2023-03-17 08:41:08] [INFO ] Flatten gal took : 7 ms
[2023-03-17 08:41:08] [INFO ] Flatten gal took : 7 ms
[2023-03-17 08:41:08] [INFO ] Input system was already deterministic with 54 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 63/63 places, 56/56 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 62 transition count 53
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 60 transition count 53
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 60 transition count 51
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 8 place count 58 transition count 51
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 56 transition count 49
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 56 transition count 49
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 14 place count 55 transition count 48
Applied a total of 14 rules in 18 ms. Remains 55 /63 variables (removed 8) and now considering 48/56 (removed 8) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 55/63 places, 48/56 transitions.
[2023-03-17 08:41:08] [INFO ] Flatten gal took : 6 ms
[2023-03-17 08:41:08] [INFO ] Flatten gal took : 6 ms
[2023-03-17 08:41:08] [INFO ] Input system was already deterministic with 48 transitions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 56/56 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 62 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 62 transition count 55
Applied a total of 2 rules in 5 ms. Remains 62 /63 variables (removed 1) and now considering 55/56 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 62/63 places, 55/56 transitions.
[2023-03-17 08:41:08] [INFO ] Flatten gal took : 7 ms
[2023-03-17 08:41:08] [INFO ] Flatten gal took : 7 ms
[2023-03-17 08:41:08] [INFO ] Input system was already deterministic with 55 transitions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 56/56 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 61 transition count 54
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 61 transition count 54
Applied a total of 4 rules in 5 ms. Remains 61 /63 variables (removed 2) and now considering 54/56 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 61/63 places, 54/56 transitions.
[2023-03-17 08:41:08] [INFO ] Flatten gal took : 6 ms
[2023-03-17 08:41:08] [INFO ] Flatten gal took : 7 ms
[2023-03-17 08:41:08] [INFO ] Input system was already deterministic with 54 transitions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 56/56 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 61 transition count 54
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 61 transition count 54
Applied a total of 4 rules in 5 ms. Remains 61 /63 variables (removed 2) and now considering 54/56 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 61/63 places, 54/56 transitions.
[2023-03-17 08:41:08] [INFO ] Flatten gal took : 6 ms
[2023-03-17 08:41:08] [INFO ] Flatten gal took : 6 ms
[2023-03-17 08:41:08] [INFO ] Input system was already deterministic with 54 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 63/63 places, 56/56 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 63 transition count 54
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 61 transition count 54
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 61 transition count 52
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 8 place count 59 transition count 52
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 57 transition count 50
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 57 transition count 50
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 14 place count 56 transition count 49
Applied a total of 14 rules in 16 ms. Remains 56 /63 variables (removed 7) and now considering 49/56 (removed 7) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16 ms. Remains : 56/63 places, 49/56 transitions.
[2023-03-17 08:41:08] [INFO ] Flatten gal took : 5 ms
[2023-03-17 08:41:08] [INFO ] Flatten gal took : 5 ms
[2023-03-17 08:41:08] [INFO ] Input system was already deterministic with 49 transitions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 56/56 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 61 transition count 54
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 61 transition count 54
Applied a total of 4 rules in 2 ms. Remains 61 /63 variables (removed 2) and now considering 54/56 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 61/63 places, 54/56 transitions.
[2023-03-17 08:41:08] [INFO ] Flatten gal took : 4 ms
[2023-03-17 08:41:08] [INFO ] Flatten gal took : 4 ms
[2023-03-17 08:41:08] [INFO ] Input system was already deterministic with 54 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 63/63 places, 56/56 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 63 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 62 transition count 55
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 62 transition count 54
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 4 place count 61 transition count 54
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 6 place count 59 transition count 52
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 59 transition count 52
Applied a total of 8 rules in 7 ms. Remains 59 /63 variables (removed 4) and now considering 52/56 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 59/63 places, 52/56 transitions.
[2023-03-17 08:41:08] [INFO ] Flatten gal took : 3 ms
[2023-03-17 08:41:08] [INFO ] Flatten gal took : 4 ms
[2023-03-17 08:41:08] [INFO ] Input system was already deterministic with 52 transitions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 56/56 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 61 transition count 54
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 61 transition count 54
Applied a total of 4 rules in 2 ms. Remains 61 /63 variables (removed 2) and now considering 54/56 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 61/63 places, 54/56 transitions.
[2023-03-17 08:41:08] [INFO ] Flatten gal took : 3 ms
[2023-03-17 08:41:08] [INFO ] Flatten gal took : 4 ms
[2023-03-17 08:41:08] [INFO ] Input system was already deterministic with 54 transitions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 56/56 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 61 transition count 54
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 61 transition count 54
Applied a total of 4 rules in 2 ms. Remains 61 /63 variables (removed 2) and now considering 54/56 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 61/63 places, 54/56 transitions.
[2023-03-17 08:41:08] [INFO ] Flatten gal took : 5 ms
[2023-03-17 08:41:08] [INFO ] Flatten gal took : 4 ms
[2023-03-17 08:41:08] [INFO ] Input system was already deterministic with 54 transitions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 56/56 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 61 transition count 54
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 61 transition count 54
Applied a total of 4 rules in 2 ms. Remains 61 /63 variables (removed 2) and now considering 54/56 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 61/63 places, 54/56 transitions.
[2023-03-17 08:41:08] [INFO ] Flatten gal took : 4 ms
[2023-03-17 08:41:08] [INFO ] Flatten gal took : 5 ms
[2023-03-17 08:41:08] [INFO ] Input system was already deterministic with 54 transitions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 56/56 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 62 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 62 transition count 55
Applied a total of 2 rules in 2 ms. Remains 62 /63 variables (removed 1) and now considering 55/56 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 62/63 places, 55/56 transitions.
[2023-03-17 08:41:08] [INFO ] Flatten gal took : 4 ms
[2023-03-17 08:41:08] [INFO ] Flatten gal took : 4 ms
[2023-03-17 08:41:08] [INFO ] Input system was already deterministic with 55 transitions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 56/56 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 62 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 62 transition count 55
Applied a total of 2 rules in 2 ms. Remains 62 /63 variables (removed 1) and now considering 55/56 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 62/63 places, 55/56 transitions.
[2023-03-17 08:41:08] [INFO ] Flatten gal took : 4 ms
[2023-03-17 08:41:08] [INFO ] Flatten gal took : 4 ms
[2023-03-17 08:41:08] [INFO ] Input system was already deterministic with 55 transitions.
[2023-03-17 08:41:08] [INFO ] Flatten gal took : 5 ms
[2023-03-17 08:41:08] [INFO ] Flatten gal took : 5 ms
[2023-03-17 08:41:08] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-17 08:41:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 63 places, 56 transitions and 192 arcs took 1 ms.
Total runtime 5100 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=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 63 NrTr: 56 NrArc: 192)

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

net check time: 0m 0.000sec

init dd package: 0m 3.549sec


RS generation: 0m 0.014sec


-> reachability set: #nodes 371 (3.7e+02) #states 31,745 (4)



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

checking: EG [EF [EX [EF [[[p9<=1 & 1<=p9] & [p54<=1 & 1<=p54]]]]]]
normalized: EG [E [true U EX [E [true U [[p54<=1 & 1<=p54] & [p9<=1 & 1<=p9]]]]]]

abstracting: (1<=p9)
states: 15,872 (4)
abstracting: (p9<=1)
states: 31,745 (4)
abstracting: (1<=p54)
states: 1,024 (3)
abstracting: (p54<=1)
states: 31,745 (4)
..............
EG iterations: 13
-> the formula is TRUE

FORMULA Parking-PT-104-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.039sec

checking: EG [EF [[[p1<=0 & 0<=p1] | [p52<=0 & 0<=p52]]]]
normalized: EG [E [true U [[p52<=0 & 0<=p52] | [p1<=0 & 0<=p1]]]]

abstracting: (0<=p1)
states: 31,745 (4)
abstracting: (p1<=0)
states: 15,873 (4)
abstracting: (0<=p52)
states: 31,745 (4)
abstracting: (p52<=0)
states: 30,721 (4)

EG iterations: 0
-> the formula is TRUE

FORMULA Parking-PT-104-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EF [AX [[AF [[p43<=1 & 1<=p43]] & [p36<=0 & 0<=p36]]]]
normalized: E [true U ~ [EX [~ [[[p36<=0 & 0<=p36] & ~ [EG [~ [[p43<=1 & 1<=p43]]]]]]]]]

abstracting: (1<=p43)
states: 512
abstracting: (p43<=1)
states: 31,745 (4)
...........
EG iterations: 11
abstracting: (0<=p36)
states: 31,745 (4)
abstracting: (p36<=0)
states: 31,233 (4)
.-> the formula is TRUE

FORMULA Parking-PT-104-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.018sec

checking: AX [EF [[[p4<=1 & 1<=p4] & [p48<=1 & 1<=p48]]]]
normalized: ~ [EX [~ [E [true U [[p48<=1 & 1<=p48] & [p4<=1 & 1<=p4]]]]]]

abstracting: (1<=p4)
states: 15,872 (4)
abstracting: (p4<=1)
states: 31,745 (4)
abstracting: (1<=p48)
states: 1,024 (3)
abstracting: (p48<=1)
states: 31,745 (4)
.-> the formula is TRUE

FORMULA Parking-PT-104-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.112sec

checking: AG [E [EF [AX [[p4<=1 & 1<=p4]]] U [[p15<=1 & 1<=p15] & [p46<=1 & 1<=p46]]]]
normalized: ~ [E [true U ~ [E [E [true U ~ [EX [~ [[p4<=1 & 1<=p4]]]]] U [[p46<=1 & 1<=p46] & [p15<=1 & 1<=p15]]]]]]

abstracting: (1<=p15)
states: 15,872 (4)
abstracting: (p15<=1)
states: 31,745 (4)
abstracting: (1<=p46)
states: 1,024 (3)
abstracting: (p46<=1)
states: 31,745 (4)
abstracting: (1<=p4)
states: 15,872 (4)
abstracting: (p4<=1)
states: 31,745 (4)
.-> the formula is FALSE

FORMULA Parking-PT-104-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.015sec

checking: AF [[AG [AF [[p35<=1 & 1<=p35]]] & [AX [AF [[p59<=0 & 0<=p59]]] | EF [[p43<=0 & 0<=p43]]]]]
normalized: ~ [EG [~ [[[E [true U [p43<=0 & 0<=p43]] | ~ [EX [EG [~ [[p59<=0 & 0<=p59]]]]]] & ~ [E [true U EG [~ [[p35<=1 & 1<=p35]]]]]]]]]

abstracting: (1<=p35)
states: 512
abstracting: (p35<=1)
states: 31,745 (4)
...........
EG iterations: 11
abstracting: (0<=p59)
states: 31,745 (4)
abstracting: (p59<=0)
states: 25,089 (4)
.........................
EG iterations: 25
.abstracting: (0<=p43)
states: 31,745 (4)
abstracting: (p43<=0)
states: 31,233 (4)

EG iterations: 0
-> the formula is FALSE

FORMULA Parking-PT-104-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.047sec

checking: EF [[AF [[AX [[[p22<=1 & 1<=p22] & [p61<=1 & 1<=p61]]] & [p8<=1 & 1<=p8]]] | [p20<=1 & 1<=p20]]]
normalized: E [true U [~ [EG [~ [[[p8<=1 & 1<=p8] & ~ [EX [~ [[[p61<=1 & 1<=p61] & [p22<=1 & 1<=p22]]]]]]]]] | [p20<=1 & 1<=p20]]]

abstracting: (1<=p20)
states: 768
abstracting: (p20<=1)
states: 31,745 (4)
abstracting: (1<=p22)
states: 1,024 (3)
abstracting: (p22<=1)
states: 31,745 (4)
abstracting: (1<=p61)
states: 9,728 (3)
abstracting: (p61<=1)
states: 31,745 (4)
.abstracting: (1<=p8)
states: 15,872 (4)
abstracting: (p8<=1)
states: 31,745 (4)

EG iterations: 0
-> the formula is TRUE

FORMULA Parking-PT-104-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: AX [EX [E [EG [[[p39<=1 & 1<=p39] & [p57<=1 & 1<=p57]]] U EX [[[p45<=1 & 1<=p45] & [p62<=1 & 1<=p62]]]]]]
normalized: ~ [EX [~ [EX [E [EG [[[p57<=1 & 1<=p57] & [p39<=1 & 1<=p39]]] U EX [[[p62<=1 & 1<=p62] & [p45<=1 & 1<=p45]]]]]]]]

abstracting: (1<=p45)
states: 1,024 (3)
abstracting: (p45<=1)
states: 31,745 (4)
abstracting: (1<=p62)
states: 9,728 (3)
abstracting: (p62<=1)
states: 31,745 (4)
.abstracting: (1<=p39)
states: 26,624 (4)
abstracting: (p39<=1)
states: 31,745 (4)
abstracting: (1<=p57)
states: 1,024 (3)
abstracting: (p57<=1)
states: 31,745 (4)
............
EG iterations: 12
..-> the formula is FALSE

FORMULA Parking-PT-104-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: EG [[EG [[AF [[[p22<=1 & 1<=p22] & [p61<=1 & 1<=p61]]] | [[p32<=0 & 0<=p32] | [p58<=0 & 0<=p58]]]] | [EG [AF [[[p8<=1 & 1<=p8] & [p49<=1 & 1<=p49]]]] | [p8<=1 & 1<=p8]]]]
normalized: EG [[[[p8<=1 & 1<=p8] | EG [~ [EG [~ [[[p49<=1 & 1<=p49] & [p8<=1 & 1<=p8]]]]]]] | EG [[[[p58<=0 & 0<=p58] | [p32<=0 & 0<=p32]] | ~ [EG [~ [[[p61<=1 & 1<=p61] & [p22<=1 & 1<=p22]]]]]]]]]

abstracting: (1<=p22)
states: 1,024 (3)
abstracting: (p22<=1)
states: 31,745 (4)
abstracting: (1<=p61)
states: 9,728 (3)
abstracting: (p61<=1)
states: 31,745 (4)
.............
EG iterations: 13
abstracting: (0<=p32)
states: 31,745 (4)
abstracting: (p32<=0)
states: 30,977 (4)
abstracting: (0<=p58)
states: 31,745 (4)
abstracting: (p58<=0)
states: 1,025 (3)
.
EG iterations: 1
abstracting: (1<=p8)
states: 15,872 (4)
abstracting: (p8<=1)
states: 31,745 (4)
abstracting: (1<=p49)
states: 1,024 (3)
abstracting: (p49<=1)
states: 31,745 (4)
.
EG iterations: 1
...........
EG iterations: 11
abstracting: (1<=p8)
states: 15,872 (4)
abstracting: (p8<=1)
states: 31,745 (4)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Parking-PT-104-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.016sec

checking: AF [AX [[[AF [[[p24<=0 & 0<=p24] | [p57<=0 & 0<=p57]]] & ~ [A [[[p9<=1 & 1<=p9] & [p54<=1 & 1<=p54]] U [p62<=1 & 1<=p62]]]] & [[p29<=1 & 1<=p29] & [[p62<=1 & 1<=p62] & [p16<=1 & 1<=p16]]]]]]
normalized: ~ [EG [EX [~ [[[[[p16<=1 & 1<=p16] & [p62<=1 & 1<=p62]] & [p29<=1 & 1<=p29]] & [~ [[~ [EG [~ [[p62<=1 & 1<=p62]]]] & ~ [E [~ [[p62<=1 & 1<=p62]] U [~ [[[p54<=1 & 1<=p54] & [p9<=1 & 1<=p9]]] & ~ [[p62<=1 & 1<=p62]]]]]]] & ~ [EG [~ [[[p57<=0 & 0<=p57] | [p24<=0 & 0<=p24]]]]]]]]]]]

abstracting: (0<=p24)
states: 31,745 (4)
abstracting: (p24<=0)
states: 5,633 (3)
abstracting: (0<=p57)
states: 31,745 (4)
abstracting: (p57<=0)
states: 30,721 (4)
............
EG iterations: 12
abstracting: (1<=p62)
states: 9,728 (3)
abstracting: (p62<=1)
states: 31,745 (4)
abstracting: (1<=p9)
states: 15,872 (4)
abstracting: (p9<=1)
states: 31,745 (4)
abstracting: (1<=p54)
states: 1,024 (3)
abstracting: (p54<=1)
states: 31,745 (4)
abstracting: (1<=p62)
states: 9,728 (3)
abstracting: (p62<=1)
states: 31,745 (4)
abstracting: (1<=p62)
states: 9,728 (3)
abstracting: (p62<=1)
states: 31,745 (4)
.........................
EG iterations: 25
abstracting: (1<=p29)
states: 512
abstracting: (p29<=1)
states: 31,745 (4)
abstracting: (1<=p62)
states: 9,728 (3)
abstracting: (p62<=1)
states: 31,745 (4)
abstracting: (1<=p16)
states: 15,872 (4)
abstracting: (p16<=1)
states: 31,745 (4)
......................
EG iterations: 21
-> the formula is FALSE

FORMULA Parking-PT-104-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.106sec

checking: AF [[~ [A [[~ [AF [[p20<=1 & 1<=p20]]] | EG [[[p5<=1 & 1<=p5] & [p53<=1 & 1<=p53]]]] U E [[[p10<=1 & 1<=p10] | [p35<=1 & 1<=p35]] U EF [[p28<=1 & 1<=p28]]]]] & [AG [A [AG [[p35<=1 & 1<=p35]] U [[p56<=1 & 1<=p56] & [p57<=1 & 1<=p57]]]] & [AX [[p20<=1 & 1<=p20]] | EX [[p20<=1 & 1<=p20]]]]]]
normalized: ~ [EG [~ [[[[EX [[p20<=1 & 1<=p20]] | ~ [EX [~ [[p20<=1 & 1<=p20]]]]] & ~ [E [true U ~ [[~ [EG [~ [[[p57<=1 & 1<=p57] & [p56<=1 & 1<=p56]]]]] & ~ [E [~ [[[p57<=1 & 1<=p57] & [p56<=1 & 1<=p56]]] U [E [true U ~ [[p35<=1 & 1<=p35]]] & ~ [[[p57<=1 & 1<=p57] & [p56<=1 & 1<=p56]]]]]]]]]]] & ~ [[~ [EG [~ [E [[[p35<=1 & 1<=p35] | [p10<=1 & 1<=p10]] U E [true U [p28<=1 & 1<=p28]]]]]] & ~ [E [~ [E [[[p35<=1 & 1<=p35] | [p10<=1 & 1<=p10]] U E [true U [p28<=1 & 1<=p28]]]] U [~ [[EG [[[p53<=1 & 1<=p53] & [p5<=1 & 1<=p5]]] | EG [~ [[p20<=1 & 1<=p20]]]]] & ~ [E [[[p35<=1 & 1<=p35] | [p10<=1 & 1<=p10]] U E [true U [p28<=1 & 1<=p28]]]]]]]]]]]]]

abstracting: (1<=p28)
states: 768
abstracting: (p28<=1)
states: 31,745 (4)
abstracting: (1<=p10)
states: 15,872 (4)
abstracting: (p10<=1)
states: 31,745 (4)
abstracting: (1<=p35)
states: 512
abstracting: (p35<=1)
states: 31,745 (4)
abstracting: (1<=p20)
states: 768
abstracting: (p20<=1)
states: 31,745 (4)
.
EG iterations: 1
abstracting: (1<=p5)
states: 15,872 (4)
abstracting: (p5<=1)
states: 31,745 (4)
abstracting: (1<=p53)
states: 1,024 (3)
abstracting: (p53<=1)
states: 31,745 (4)
...........
EG iterations: 11
abstracting: (1<=p28)
states: 768
abstracting: (p28<=1)
states: 31,745 (4)
abstracting: (1<=p10)
states: 15,872 (4)
abstracting: (p10<=1)
states: 31,745 (4)
abstracting: (1<=p35)
states: 512
abstracting: (p35<=1)
states: 31,745 (4)
abstracting: (1<=p28)
states: 768
abstracting: (p28<=1)
states: 31,745 (4)
abstracting: (1<=p10)
states: 15,872 (4)
abstracting: (p10<=1)
states: 31,745 (4)
abstracting: (1<=p35)
states: 512
abstracting: (p35<=1)
states: 31,745 (4)
.
EG iterations: 1
abstracting: (1<=p56)
states: 22,528 (4)
abstracting: (p56<=1)
states: 31,745 (4)
abstracting: (1<=p57)
states: 1,024 (3)
abstracting: (p57<=1)
states: 31,745 (4)
abstracting: (1<=p35)
states: 512
abstracting: (p35<=1)
states: 31,745 (4)
abstracting: (1<=p56)
states: 22,528 (4)
abstracting: (p56<=1)
states: 31,745 (4)
abstracting: (1<=p57)
states: 1,024 (3)
abstracting: (p57<=1)
states: 31,745 (4)
abstracting: (1<=p56)
states: 22,528 (4)
abstracting: (p56<=1)
states: 31,745 (4)
abstracting: (1<=p57)
states: 1,024 (3)
abstracting: (p57<=1)
states: 31,745 (4)
............
EG iterations: 12
abstracting: (1<=p20)
states: 768
abstracting: (p20<=1)
states: 31,745 (4)
.abstracting: (1<=p20)
states: 768
abstracting: (p20<=1)
states: 31,745 (4)
.
EG iterations: 0
-> the formula is FALSE

FORMULA Parking-PT-104-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.040sec

checking: AF [[[EG [AF [[p14<=1 & 1<=p14]]] & [~ [A [[[p4<=1 & 1<=p4] & [p48<=1 & 1<=p48]] U [p35<=1 & 1<=p35]]] & A [[[p30<=1 & 1<=p30] & [p61<=1 & 1<=p61]] U [p12<=1 & 1<=p12]]]] & [[p16<=0 & 0<=p16] & [[[p5<=0 & 0<=p5] | [p53<=0 & 0<=p53]] & [[p21<=0 & 0<=p21] | [p62<=0 & 0<=p62]]]]]]
normalized: ~ [EG [~ [[[[[[p62<=0 & 0<=p62] | [p21<=0 & 0<=p21]] & [[p53<=0 & 0<=p53] | [p5<=0 & 0<=p5]]] & [p16<=0 & 0<=p16]] & [[[~ [EG [~ [[p12<=1 & 1<=p12]]]] & ~ [E [~ [[p12<=1 & 1<=p12]] U [~ [[[p61<=1 & 1<=p61] & [p30<=1 & 1<=p30]]] & ~ [[p12<=1 & 1<=p12]]]]]] & ~ [[~ [EG [~ [[p35<=1 & 1<=p35]]]] & ~ [E [~ [[p35<=1 & 1<=p35]] U [~ [[[p48<=1 & 1<=p48] & [p4<=1 & 1<=p4]]] & ~ [[p35<=1 & 1<=p35]]]]]]]] & EG [~ [EG [~ [[p14<=1 & 1<=p14]]]]]]]]]]

abstracting: (1<=p14)
states: 15,872 (4)
abstracting: (p14<=1)
states: 31,745 (4)
...........
EG iterations: 11
.....................
EG iterations: 21
abstracting: (1<=p35)
states: 512
abstracting: (p35<=1)
states: 31,745 (4)
abstracting: (1<=p4)
states: 15,872 (4)
abstracting: (p4<=1)
states: 31,745 (4)
abstracting: (1<=p48)
states: 1,024 (3)
abstracting: (p48<=1)
states: 31,745 (4)
abstracting: (1<=p35)
states: 512
abstracting: (p35<=1)
states: 31,745 (4)
abstracting: (1<=p35)
states: 512
abstracting: (p35<=1)
states: 31,745 (4)
...........
EG iterations: 11
abstracting: (1<=p12)
states: 15,872 (4)
abstracting: (p12<=1)
states: 31,745 (4)
abstracting: (1<=p30)
states: 1,024 (3)
abstracting: (p30<=1)
states: 31,745 (4)
abstracting: (1<=p61)
states: 9,728 (3)
abstracting: (p61<=1)
states: 31,745 (4)
abstracting: (1<=p12)
states: 15,872 (4)
abstracting: (p12<=1)
states: 31,745 (4)
abstracting: (1<=p12)
states: 15,872 (4)
abstracting: (p12<=1)
states: 31,745 (4)
...........
EG iterations: 11
abstracting: (0<=p16)
states: 31,745 (4)
abstracting: (p16<=0)
states: 15,873 (4)
abstracting: (0<=p5)
states: 31,745 (4)
abstracting: (p5<=0)
states: 15,873 (4)
abstracting: (0<=p53)
states: 31,745 (4)
abstracting: (p53<=0)
states: 30,721 (4)
abstracting: (0<=p21)
states: 31,745 (4)
abstracting: (p21<=0)
states: 31,233 (4)
abstracting: (0<=p62)
states: 31,745 (4)
abstracting: (p62<=0)
states: 22,017 (4)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Parking-PT-104-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.059sec

checking: AX [[E [[AF [[[p2<=1 & 1<=p2] & [p19<=1 & 1<=p19]]] & EF [[[p40<=1 & 1<=p40] & [p58<=1 & 1<=p58]]]] U [[p6<=1 & 1<=p6] & [p26<=1 & 1<=p26]]] & [EX [~ [E [[p35<=1 & 1<=p35] U [p35<=1 & 1<=p35]]]] | [EG [[[p9<=0 & 0<=p9] | [p54<=0 & 0<=p54]]] & [[p6<=0 & 0<=p6] | [[p32<=0 & 0<=p32] | [p58<=0 & 0<=p58]]]]]]]
normalized: ~ [EX [~ [[[[[[[p58<=0 & 0<=p58] | [p32<=0 & 0<=p32]] | [p6<=0 & 0<=p6]] & EG [[[p54<=0 & 0<=p54] | [p9<=0 & 0<=p9]]]] | EX [~ [E [[p35<=1 & 1<=p35] U [p35<=1 & 1<=p35]]]]] & E [[E [true U [[p58<=1 & 1<=p58] & [p40<=1 & 1<=p40]]] & ~ [EG [~ [[[p19<=1 & 1<=p19] & [p2<=1 & 1<=p2]]]]]] U [[p26<=1 & 1<=p26] & [p6<=1 & 1<=p6]]]]]]]

abstracting: (1<=p6)
states: 15,872 (4)
abstracting: (p6<=1)
states: 31,745 (4)
abstracting: (1<=p26)
states: 768
abstracting: (p26<=1)
states: 31,745 (4)
abstracting: (1<=p2)
states: 15,872 (4)
abstracting: (p2<=1)
states: 31,745 (4)
abstracting: (1<=p19)
states: 768
abstracting: (p19<=1)
states: 31,745 (4)
.
EG iterations: 1
abstracting: (1<=p40)
states: 768
abstracting: (p40<=1)
states: 31,745 (4)
abstracting: (1<=p58)
states: 30,720 (4)
abstracting: (p58<=1)
states: 31,745 (4)
abstracting: (1<=p35)
states: 512
abstracting: (p35<=1)
states: 31,745 (4)
abstracting: (1<=p35)
states: 512
abstracting: (p35<=1)
states: 31,745 (4)
.abstracting: (0<=p9)
states: 31,745 (4)
abstracting: (p9<=0)
states: 15,873 (4)
abstracting: (0<=p54)
states: 31,745 (4)
abstracting: (p54<=0)
states: 30,721 (4)
.............
EG iterations: 13
abstracting: (0<=p6)
states: 31,745 (4)
abstracting: (p6<=0)
states: 15,873 (4)
abstracting: (0<=p32)
states: 31,745 (4)
abstracting: (p32<=0)
states: 30,977 (4)
abstracting: (0<=p58)
states: 31,745 (4)
abstracting: (p58<=0)
states: 1,025 (3)
.-> the formula is FALSE

FORMULA Parking-PT-104-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.059sec

checking: A [[[[p9<=1 & 1<=p9] & [p54<=1 & 1<=p54]] | [[p35<=1 & 1<=p35] & AG [[EX [[[p45<=1 & 1<=p45] & [p62<=1 & 1<=p62]]] & [A [[[p21<=1 & 1<=p21] & [p62<=1 & 1<=p62]] U [p59<=1 & 1<=p59]] | [[p21<=1 & 1<=p21] & [p62<=1 & 1<=p62]]]]]]] U [EF [AX [[p43<=1 & 1<=p43]]] | [EX [EX [AX [[[p3<=1 & 1<=p3] & [p23<=1 & 1<=p23]]]]] & ~ [E [~ [[p20<=1 & 1<=p20]] U [AX [[p36<=1 & 1<=p36]] & ~ [[p43<=1 & 1<=p43]]]]]]]]
normalized: [~ [EG [~ [[[~ [E [~ [[p20<=1 & 1<=p20]] U [~ [[p43<=1 & 1<=p43]] & ~ [EX [~ [[p36<=1 & 1<=p36]]]]]]] & EX [EX [~ [EX [~ [[[p23<=1 & 1<=p23] & [p3<=1 & 1<=p3]]]]]]]] | E [true U ~ [EX [~ [[p43<=1 & 1<=p43]]]]]]]]] & ~ [E [~ [[[~ [E [~ [[p20<=1 & 1<=p20]] U [~ [[p43<=1 & 1<=p43]] & ~ [EX [~ [[p36<=1 & 1<=p36]]]]]]] & EX [EX [~ [EX [~ [[[p23<=1 & 1<=p23] & [p3<=1 & 1<=p3]]]]]]]] | E [true U ~ [EX [~ [[p43<=1 & 1<=p43]]]]]]] U [~ [[[~ [E [true U ~ [[[[[p62<=1 & 1<=p62] & [p21<=1 & 1<=p21]] | [~ [EG [~ [[p59<=1 & 1<=p59]]]] & ~ [E [~ [[p59<=1 & 1<=p59]] U [~ [[[p62<=1 & 1<=p62] & [p21<=1 & 1<=p21]]] & ~ [[p59<=1 & 1<=p59]]]]]]] & EX [[[p62<=1 & 1<=p62] & [p45<=1 & 1<=p45]]]]]]] & [p35<=1 & 1<=p35]] | [[p54<=1 & 1<=p54] & [p9<=1 & 1<=p9]]]] & ~ [[[~ [E [~ [[p20<=1 & 1<=p20]] U [~ [[p43<=1 & 1<=p43]] & ~ [EX [~ [[p36<=1 & 1<=p36]]]]]]] & EX [EX [~ [EX [~ [[[p23<=1 & 1<=p23] & [p3<=1 & 1<=p3]]]]]]]] | E [true U ~ [EX [~ [[p43<=1 & 1<=p43]]]]]]]]]]]

abstracting: (1<=p43)
states: 512
abstracting: (p43<=1)
states: 31,745 (4)
.abstracting: (1<=p3)
states: 15,872 (4)
abstracting: (p3<=1)
states: 31,745 (4)
abstracting: (1<=p23)
states: 1,024 (3)
abstracting: (p23<=1)
states: 31,745 (4)
...abstracting: (1<=p36)
states: 512
abstracting: (p36<=1)
states: 31,745 (4)
.abstracting: (1<=p43)
states: 512
abstracting: (p43<=1)
states: 31,745 (4)
abstracting: (1<=p20)
states: 768
abstracting: (p20<=1)
states: 31,745 (4)
abstracting: (1<=p9)
states: 15,872 (4)
abstracting: (p9<=1)
states: 31,745 (4)
abstracting: (1<=p54)
states: 1,024 (3)
abstracting: (p54<=1)
states: 31,745 (4)
abstracting: (1<=p35)
states: 512
abstracting: (p35<=1)
states: 31,745 (4)
abstracting: (1<=p45)
states: 1,024 (3)
abstracting: (p45<=1)
states: 31,745 (4)
abstracting: (1<=p62)
states: 9,728 (3)
abstracting: (p62<=1)
states: 31,745 (4)
.abstracting: (1<=p59)
states: 6,656 (3)
abstracting: (p59<=1)
states: 31,745 (4)
abstracting: (1<=p21)
states: 512
abstracting: (p21<=1)
states: 31,745 (4)
abstracting: (1<=p62)
states: 9,728 (3)
abstracting: (p62<=1)
states: 31,745 (4)
abstracting: (1<=p59)
states: 6,656 (3)
abstracting: (p59<=1)
states: 31,745 (4)
abstracting: (1<=p59)
states: 6,656 (3)
abstracting: (p59<=1)
states: 31,745 (4)
.
EG iterations: 1
abstracting: (1<=p21)
states: 512
abstracting: (p21<=1)
states: 31,745 (4)
abstracting: (1<=p62)
states: 9,728 (3)
abstracting: (p62<=1)
states: 31,745 (4)
abstracting: (1<=p43)
states: 512
abstracting: (p43<=1)
states: 31,745 (4)
.abstracting: (1<=p3)
states: 15,872 (4)
abstracting: (p3<=1)
states: 31,745 (4)
abstracting: (1<=p23)
states: 1,024 (3)
abstracting: (p23<=1)
states: 31,745 (4)
...abstracting: (1<=p36)
states: 512
abstracting: (p36<=1)
states: 31,745 (4)
.abstracting: (1<=p43)
states: 512
abstracting: (p43<=1)
states: 31,745 (4)
abstracting: (1<=p20)
states: 768
abstracting: (p20<=1)
states: 31,745 (4)
abstracting: (1<=p43)
states: 512
abstracting: (p43<=1)
states: 31,745 (4)
.abstracting: (1<=p3)
states: 15,872 (4)
abstracting: (p3<=1)
states: 31,745 (4)
abstracting: (1<=p23)
states: 1,024 (3)
abstracting: (p23<=1)
states: 31,745 (4)
...abstracting: (1<=p36)
states: 512
abstracting: (p36<=1)
states: 31,745 (4)
.abstracting: (1<=p43)
states: 512
abstracting: (p43<=1)
states: 31,745 (4)
abstracting: (1<=p20)
states: 768
abstracting: (p20<=1)
states: 31,745 (4)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Parking-PT-104-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.028sec

checking: E [[[p60<=1 & 1<=p60] | [EG [~ [[[[[p2<=1 & 1<=p2] & [p19<=1 & 1<=p19]] | [p35<=1 & 1<=p35]] & EF [[[p39<=1 & 1<=p39] & [p57<=1 & 1<=p57]]]]]] & [p0<=1 & 1<=p0]]] U E [[[p62<=1 & 1<=p62] & [p36<=1 & 1<=p36]] U [A [EF [[[p22<=1 & 1<=p22] & [p61<=1 & 1<=p61]]] U AX [[p28<=1 & 1<=p28]]] & [~ [[[p43<=1 & 1<=p43] | [[p6<=1 & 1<=p6] & [p27<=1 & 1<=p27]]]] | [[p13<=1 & 1<=p13] & [p55<=1 & 1<=p55]]]]]]
normalized: E [[[[p0<=1 & 1<=p0] & EG [~ [[E [true U [[p57<=1 & 1<=p57] & [p39<=1 & 1<=p39]]] & [[p35<=1 & 1<=p35] | [[p19<=1 & 1<=p19] & [p2<=1 & 1<=p2]]]]]]] | [p60<=1 & 1<=p60]] U E [[[p36<=1 & 1<=p36] & [p62<=1 & 1<=p62]] U [[[[p55<=1 & 1<=p55] & [p13<=1 & 1<=p13]] | ~ [[[[p27<=1 & 1<=p27] & [p6<=1 & 1<=p6]] | [p43<=1 & 1<=p43]]]] & [~ [EG [EX [~ [[p28<=1 & 1<=p28]]]]] & ~ [E [EX [~ [[p28<=1 & 1<=p28]]] U [~ [E [true U [[p61<=1 & 1<=p61] & [p22<=1 & 1<=p22]]]] & EX [~ [[p28<=1 & 1<=p28]]]]]]]]]]

abstracting: (1<=p28)
states: 768
abstracting: (p28<=1)
states: 31,745 (4)
.abstracting: (1<=p22)
states: 1,024 (3)
abstracting: (p22<=1)
states: 31,745 (4)
abstracting: (1<=p61)
states: 9,728 (3)
abstracting: (p61<=1)
states: 31,745 (4)
abstracting: (1<=p28)
states: 768
abstracting: (p28<=1)
states: 31,745 (4)
.abstracting: (1<=p28)
states: 768
abstracting: (p28<=1)
states: 31,745 (4)
......................
EG iterations: 21
abstracting: (1<=p43)
states: 512
abstracting: (p43<=1)
states: 31,745 (4)
abstracting: (1<=p6)
states: 15,872 (4)
abstracting: (p6<=1)
states: 31,745 (4)
abstracting: (1<=p27)
states: 768
abstracting: (p27<=1)
states: 31,745 (4)
abstracting: (1<=p13)
states: 15,872 (4)
abstracting: (p13<=1)
states: 31,745 (4)
abstracting: (1<=p55)
states: 1,024 (3)
abstracting: (p55<=1)
states: 31,745 (4)
abstracting: (1<=p62)
states: 9,728 (3)
abstracting: (p62<=1)
states: 31,745 (4)
abstracting: (1<=p36)
states: 512
abstracting: (p36<=1)
states: 31,745 (4)
abstracting: (1<=p60)
states: 5,632 (3)
abstracting: (p60<=1)
states: 31,745 (4)
abstracting: (1<=p2)
states: 15,872 (4)
abstracting: (p2<=1)
states: 31,745 (4)
abstracting: (1<=p19)
states: 768
abstracting: (p19<=1)
states: 31,745 (4)
abstracting: (1<=p35)
states: 512
abstracting: (p35<=1)
states: 31,745 (4)
abstracting: (1<=p39)
states: 26,624 (4)
abstracting: (p39<=1)
states: 31,745 (4)
abstracting: (1<=p57)
states: 1,024 (3)
abstracting: (p57<=1)
states: 31,745 (4)
.
EG iterations: 1
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 31,745 (4)
-> the formula is FALSE

FORMULA Parking-PT-104-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.029sec

totally nodes used: 356220 (3.6e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 448328 1184419 1632747
used/not used/entry size/cache size: 1513949 65594915 16 1024MB
basic ops cache: hits/miss/sum: 75283 194952 270235
used/not used/entry size/cache size: 375614 16401602 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: 1247 3868 5115
used/not used/entry size/cache size: 3867 8384741 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 66763635
1 334891
2 9713
3 597
4 28
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 5.720sec


BK_STOP 1679042475405

--------------------
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 CTLFireability -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.000sec


iterations count:895 (15), effective:108 (1)

initing FirstDep: 0m 0.000sec


iterations count:583 (10), effective:56 (1)

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

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

iterations count:504 (9), effective:49 (0)

iterations count:2309 (41), effective:262 (4)

iterations count:368 (6), effective:43 (0)

iterations count:573 (10), effective:56 (1)

iterations count:259 (4), effective:17 (0)

iterations count:63 (1), effective:2 (0)

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

iterations count:597 (10), effective:56 (1)

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

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

iterations count:604 (10), effective:56 (1)

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

iterations count:604 (10), effective:56 (1)

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

iterations count:116 (2), effective:7 (0)

iterations count:604 (10), effective:56 (1)

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

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

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

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

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

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

iterations count:2142 (38), effective:237 (4)

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

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

iterations count:450 (8), effective:45 (0)

iterations count:453 (8), effective:45 (0)

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

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

iterations count:450 (8), effective:45 (0)

iterations count:453 (8), effective:45 (0)

iterations count:450 (8), effective:45 (0)

iterations count:453 (8), effective:45 (0)

iterations count:595 (10), effective:56 (1)

iterations count:382 (6), effective:31 (0)

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

iterations count:599 (10), effective:56 (1)

iterations count:56 (1), effective:0 (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="Parking-PT-104"
export BK_EXAMINATION="CTLFireability"
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 Parking-PT-104, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r266-smll-167863540900410"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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