fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r106-tall-167814483400906
Last Updated
May 14, 2023

About the Execution of Marcie+red for DNAwalker-PT-05track28LR

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
11073.336 645176.00 660888.00 2170.80 TFTTFFFFFTFTFTTF 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.r106-tall-167814483400906.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 DNAwalker-PT-05track28LR, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814483400906
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.8K Feb 25 13:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 13:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 12:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Feb 25 12:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 13:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Feb 25 13:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 25 13:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 13:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 12 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 108K 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 DNAwalker-PT-05track28LR-CTLFireability-00
FORMULA_NAME DNAwalker-PT-05track28LR-CTLFireability-01
FORMULA_NAME DNAwalker-PT-05track28LR-CTLFireability-02
FORMULA_NAME DNAwalker-PT-05track28LR-CTLFireability-03
FORMULA_NAME DNAwalker-PT-05track28LR-CTLFireability-04
FORMULA_NAME DNAwalker-PT-05track28LR-CTLFireability-05
FORMULA_NAME DNAwalker-PT-05track28LR-CTLFireability-06
FORMULA_NAME DNAwalker-PT-05track28LR-CTLFireability-07
FORMULA_NAME DNAwalker-PT-05track28LR-CTLFireability-08
FORMULA_NAME DNAwalker-PT-05track28LR-CTLFireability-09
FORMULA_NAME DNAwalker-PT-05track28LR-CTLFireability-10
FORMULA_NAME DNAwalker-PT-05track28LR-CTLFireability-11
FORMULA_NAME DNAwalker-PT-05track28LR-CTLFireability-12
FORMULA_NAME DNAwalker-PT-05track28LR-CTLFireability-13
FORMULA_NAME DNAwalker-PT-05track28LR-CTLFireability-14
FORMULA_NAME DNAwalker-PT-05track28LR-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678499045857

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=DNAwalker-PT-05track28LR
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 01:44:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 01:44:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 01:44:07] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2023-03-11 01:44:07] [INFO ] Transformed 34 places.
[2023-03-11 01:44:07] [INFO ] Transformed 250 transitions.
[2023-03-11 01:44:07] [INFO ] Parsed PT model containing 34 places and 250 transitions and 728 arcs in 188 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Support contains 29 out of 34 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 250/250 transitions.
Applied a total of 0 rules in 25 ms. Remains 34 /34 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-11 01:44:07] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
// Phase 1: matrix 247 rows 34 cols
[2023-03-11 01:44:07] [INFO ] Computed 0 place invariants in 14 ms
[2023-03-11 01:44:08] [INFO ] Dead Transitions using invariants and state equation in 243 ms found 0 transitions.
[2023-03-11 01:44:08] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-11 01:44:08] [INFO ] Invariant cache hit.
[2023-03-11 01:44:08] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-11 01:44:08] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-11 01:44:08] [INFO ] Invariant cache hit.
[2023-03-11 01:44:08] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-11 01:44:08] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2023-03-11 01:44:08] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-11 01:44:08] [INFO ] Invariant cache hit.
[2023-03-11 01:44:08] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 589 ms. Remains : 34/34 places, 250/250 transitions.
Support contains 29 out of 34 places after structural reductions.
[2023-03-11 01:44:08] [INFO ] Flatten gal took : 46 ms
[2023-03-11 01:44:08] [INFO ] Flatten gal took : 15 ms
[2023-03-11 01:44:08] [INFO ] Input system was already deterministic with 250 transitions.
Incomplete random walk after 10000 steps, including 645 resets, run finished after 427 ms. (steps per millisecond=23 ) properties (out of 52) seen :46
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-11 01:44:09] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-11 01:44:09] [INFO ] Invariant cache hit.
[2023-03-11 01:44:09] [INFO ] After 153ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 01:44:19] [INFO ] After 10314ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 8 out of 34 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 34/34 places, 250/250 transitions.
Graph (complete) has 240 edges and 34 vertex of which 33 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 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 33 transition count 233
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 23 place count 27 transition count 227
Applied a total of 23 rules in 21 ms. Remains 27 /34 variables (removed 7) and now considering 227/250 (removed 23) transitions.
// Phase 1: matrix 227 rows 27 cols
[2023-03-11 01:44:19] [INFO ] Computed 0 place invariants in 4 ms
[2023-03-11 01:44:20] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 27/34 places, 227/250 transitions.
Incomplete random walk after 10000 steps, including 896 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 112 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1731946 steps, run timeout after 3001 ms. (steps per millisecond=577 ) properties seen :{}
Probabilistic random walk after 1731946 steps, saw 415152 distinct states, run finished after 3003 ms. (steps per millisecond=576 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 01:44:23] [INFO ] Invariant cache hit.
[2023-03-11 01:44:23] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 01:44:32] [INFO ] After 9070ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 8 out of 27 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 227/227 transitions.
Applied a total of 0 rules in 8 ms. Remains 27 /27 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 27/27 places, 227/227 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 227/227 transitions.
Applied a total of 0 rules in 5 ms. Remains 27 /27 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2023-03-11 01:44:32] [INFO ] Invariant cache hit.
[2023-03-11 01:44:32] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-11 01:44:32] [INFO ] Invariant cache hit.
[2023-03-11 01:44:32] [INFO ] Implicit Places using invariants and state equation in 131 ms returned [16, 19, 26]
Discarding 3 places :
Drop transitions removed 14 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 15 transitions.
Implicit Place search using SMT with State Equation took 170 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 24/27 places, 212/227 transitions.
Applied a total of 0 rules in 5 ms. Remains 24 /24 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 180 ms. Remains : 24/27 places, 212/227 transitions.
Incomplete random walk after 10000 steps, including 596 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2096659 steps, run timeout after 3001 ms. (steps per millisecond=698 ) properties seen :{}
Probabilistic random walk after 2096659 steps, saw 499937 distinct states, run finished after 3001 ms. (steps per millisecond=698 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 212 rows 24 cols
[2023-03-11 01:44:35] [INFO ] Computed 0 place invariants in 11 ms
[2023-03-11 01:44:35] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 01:44:44] [INFO ] After 9052ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 8 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 212/212 transitions.
Applied a total of 0 rules in 4 ms. Remains 24 /24 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 24/24 places, 212/212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 212/212 transitions.
Applied a total of 0 rules in 4 ms. Remains 24 /24 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2023-03-11 01:44:44] [INFO ] Invariant cache hit.
[2023-03-11 01:44:44] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-11 01:44:44] [INFO ] Invariant cache hit.
[2023-03-11 01:44:44] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2023-03-11 01:44:44] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-11 01:44:44] [INFO ] Invariant cache hit.
[2023-03-11 01:44:44] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 227 ms. Remains : 24/24 places, 212/212 transitions.
Applied a total of 0 rules in 9 ms. Remains 24 /24 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-11 01:44:44] [INFO ] Invariant cache hit.
[2023-03-11 01:44:44] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 01:44:53] [INFO ] After 9051ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
FORMULA DNAwalker-PT-05track28LR-CTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-11 01:44:53] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-11 01:44:53] [INFO ] Flatten gal took : 13 ms
FORMULA DNAwalker-PT-05track28LR-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-11 01:44:53] [INFO ] Flatten gal took : 11 ms
[2023-03-11 01:44:53] [INFO ] Input system was already deterministic with 250 transitions.
Computed a total of 34 stabilizing places and 246 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 250/250 transitions.
Applied a total of 0 rules in 1 ms. Remains 34 /34 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-11 01:44:53] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
// Phase 1: matrix 247 rows 34 cols
[2023-03-11 01:44:53] [INFO ] Computed 0 place invariants in 2 ms
[2023-03-11 01:44:54] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 155 ms. Remains : 34/34 places, 250/250 transitions.
[2023-03-11 01:44:54] [INFO ] Flatten gal took : 10 ms
[2023-03-11 01:44:54] [INFO ] Flatten gal took : 9 ms
[2023-03-11 01:44:54] [INFO ] Input system was already deterministic with 250 transitions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 250/250 transitions.
Applied a total of 0 rules in 1 ms. Remains 34 /34 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-11 01:44:54] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-11 01:44:54] [INFO ] Invariant cache hit.
[2023-03-11 01:44:54] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 110 ms. Remains : 34/34 places, 250/250 transitions.
[2023-03-11 01:44:54] [INFO ] Flatten gal took : 9 ms
[2023-03-11 01:44:54] [INFO ] Flatten gal took : 10 ms
[2023-03-11 01:44:54] [INFO ] Input system was already deterministic with 250 transitions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 250/250 transitions.
Applied a total of 0 rules in 1 ms. Remains 34 /34 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-11 01:44:54] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-11 01:44:54] [INFO ] Invariant cache hit.
[2023-03-11 01:44:54] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 107 ms. Remains : 34/34 places, 250/250 transitions.
[2023-03-11 01:44:54] [INFO ] Flatten gal took : 10 ms
[2023-03-11 01:44:54] [INFO ] Flatten gal took : 8 ms
[2023-03-11 01:44:54] [INFO ] Input system was already deterministic with 250 transitions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 250/250 transitions.
Applied a total of 0 rules in 1 ms. Remains 34 /34 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-11 01:44:54] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-11 01:44:54] [INFO ] Invariant cache hit.
[2023-03-11 01:44:54] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 140 ms. Remains : 34/34 places, 250/250 transitions.
[2023-03-11 01:44:54] [INFO ] Flatten gal took : 8 ms
[2023-03-11 01:44:54] [INFO ] Flatten gal took : 8 ms
[2023-03-11 01:44:54] [INFO ] Input system was already deterministic with 250 transitions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 250/250 transitions.
Applied a total of 0 rules in 1 ms. Remains 34 /34 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-11 01:44:54] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-11 01:44:54] [INFO ] Invariant cache hit.
[2023-03-11 01:44:54] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71 ms. Remains : 34/34 places, 250/250 transitions.
[2023-03-11 01:44:54] [INFO ] Flatten gal took : 7 ms
[2023-03-11 01:44:54] [INFO ] Flatten gal took : 7 ms
[2023-03-11 01:44:54] [INFO ] Input system was already deterministic with 250 transitions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 250/250 transitions.
Applied a total of 0 rules in 1 ms. Remains 34 /34 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-11 01:44:54] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-11 01:44:54] [INFO ] Invariant cache hit.
[2023-03-11 01:44:54] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75 ms. Remains : 34/34 places, 250/250 transitions.
[2023-03-11 01:44:54] [INFO ] Flatten gal took : 7 ms
[2023-03-11 01:44:54] [INFO ] Flatten gal took : 6 ms
[2023-03-11 01:44:54] [INFO ] Input system was already deterministic with 250 transitions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 250/250 transitions.
Applied a total of 0 rules in 1 ms. Remains 34 /34 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-11 01:44:54] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-11 01:44:54] [INFO ] Invariant cache hit.
[2023-03-11 01:44:54] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 96 ms. Remains : 34/34 places, 250/250 transitions.
[2023-03-11 01:44:54] [INFO ] Flatten gal took : 6 ms
[2023-03-11 01:44:54] [INFO ] Flatten gal took : 7 ms
[2023-03-11 01:44:54] [INFO ] Input system was already deterministic with 250 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 34/34 places, 250/250 transitions.
Applied a total of 0 rules in 5 ms. Remains 34 /34 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-11 01:44:54] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-11 01:44:54] [INFO ] Invariant cache hit.
[2023-03-11 01:44:55] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 96 ms. Remains : 34/34 places, 250/250 transitions.
[2023-03-11 01:44:55] [INFO ] Flatten gal took : 6 ms
[2023-03-11 01:44:55] [INFO ] Flatten gal took : 6 ms
[2023-03-11 01:44:55] [INFO ] Input system was already deterministic with 250 transitions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 250/250 transitions.
Applied a total of 0 rules in 1 ms. Remains 34 /34 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-11 01:44:55] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-11 01:44:55] [INFO ] Invariant cache hit.
[2023-03-11 01:44:55] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 113 ms. Remains : 34/34 places, 250/250 transitions.
[2023-03-11 01:44:55] [INFO ] Flatten gal took : 6 ms
[2023-03-11 01:44:55] [INFO ] Flatten gal took : 5 ms
[2023-03-11 01:44:55] [INFO ] Input system was already deterministic with 250 transitions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 250/250 transitions.
Applied a total of 0 rules in 1 ms. Remains 34 /34 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-11 01:44:55] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-11 01:44:55] [INFO ] Invariant cache hit.
[2023-03-11 01:44:55] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 113 ms. Remains : 34/34 places, 250/250 transitions.
[2023-03-11 01:44:55] [INFO ] Flatten gal took : 5 ms
[2023-03-11 01:44:55] [INFO ] Flatten gal took : 5 ms
[2023-03-11 01:44:55] [INFO ] Input system was already deterministic with 250 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 34/34 places, 250/250 transitions.
Applied a total of 0 rules in 4 ms. Remains 34 /34 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-11 01:44:55] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-11 01:44:55] [INFO ] Invariant cache hit.
[2023-03-11 01:44:55] [INFO ] Dead Transitions using invariants and state equation in 183 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 189 ms. Remains : 34/34 places, 250/250 transitions.
[2023-03-11 01:44:55] [INFO ] Flatten gal took : 6 ms
[2023-03-11 01:44:55] [INFO ] Flatten gal took : 6 ms
[2023-03-11 01:44:55] [INFO ] Input system was already deterministic with 250 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 34/34 places, 250/250 transitions.
Applied a total of 0 rules in 4 ms. Remains 34 /34 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-11 01:44:55] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-11 01:44:55] [INFO ] Invariant cache hit.
[2023-03-11 01:44:55] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 81 ms. Remains : 34/34 places, 250/250 transitions.
[2023-03-11 01:44:55] [INFO ] Flatten gal took : 11 ms
[2023-03-11 01:44:55] [INFO ] Flatten gal took : 5 ms
[2023-03-11 01:44:55] [INFO ] Input system was already deterministic with 250 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 34/34 places, 250/250 transitions.
Applied a total of 0 rules in 4 ms. Remains 34 /34 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-11 01:44:55] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-11 01:44:55] [INFO ] Invariant cache hit.
[2023-03-11 01:44:55] [INFO ] Dead Transitions using invariants and state equation in 258 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 264 ms. Remains : 34/34 places, 250/250 transitions.
[2023-03-11 01:44:55] [INFO ] Flatten gal took : 5 ms
[2023-03-11 01:44:55] [INFO ] Flatten gal took : 5 ms
[2023-03-11 01:44:55] [INFO ] Input system was already deterministic with 250 transitions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 250/250 transitions.
Applied a total of 0 rules in 1 ms. Remains 34 /34 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-11 01:44:55] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-11 01:44:55] [INFO ] Invariant cache hit.
[2023-03-11 01:44:56] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 104 ms. Remains : 34/34 places, 250/250 transitions.
[2023-03-11 01:44:56] [INFO ] Flatten gal took : 5 ms
[2023-03-11 01:44:56] [INFO ] Flatten gal took : 5 ms
[2023-03-11 01:44:56] [INFO ] Input system was already deterministic with 250 transitions.
[2023-03-11 01:44:56] [INFO ] Flatten gal took : 6 ms
[2023-03-11 01:44:56] [INFO ] Flatten gal took : 6 ms
[2023-03-11 01:44:56] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-11 01:44:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 34 places, 250 transitions and 728 arcs took 1 ms.
Total runtime 48470 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: 34 NrTr: 250 NrArc: 728)

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

net check time: 0m 0.000sec

init dd package: 0m 2.765sec


RS generation: 2m25.494sec


-> reachability set: #nodes 20509 (2.1e+04) #states 435,340,831 (8)



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

checking: EF [AX [1<=0]]
normalized: E [true U ~ [EX [~ [1<=0]]]]

abstracting: (1<=0)
states: 0
.
before gc: list nodes free: 1838629

after gc: idd nodes used:31651, unused:63968349; list nodes free:358432907

before gc: list nodes free: 249032

after gc: idd nodes used:50647, unused:63949353; list nodes free:360446232
-> the formula is TRUE

FORMULA DNAwalker-PT-05track28LR-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m57.672sec

checking: AG [EF [p30<=1]]
normalized: ~ [E [true U ~ [E [true U p30<=1]]]]

abstracting: (p30<=1)
states: 394,642,723 (8)
-> the formula is FALSE

FORMULA DNAwalker-PT-05track28LR-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m23.643sec

checking: AF [AG [[1<=p1 & 2<=p3]]]
normalized: ~ [EG [E [true U ~ [[1<=p1 & 2<=p3]]]]]

abstracting: (2<=p3)
states: 9,375,948 (6)
abstracting: (1<=p1)
states: 212,891,037 (8)

EG iterations: 0
-> the formula is FALSE

FORMULA DNAwalker-PT-05track28LR-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.416sec

checking: EG [[p15<=1 | p22<=0]]
normalized: EG [[p15<=1 | p22<=0]]

abstracting: (p22<=0)
states: 259,972,554 (8)
abstracting: (p15<=1)
states: 421,156,615 (8)
.
EG iterations: 1
-> the formula is TRUE

FORMULA DNAwalker-PT-05track28LR-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.505sec

checking: A [AF [[1<=p24 & 2<=p8]] U EX [AG [EF [~ [[1<=p15 & 2<=p22]]]]]]
normalized: [~ [EG [~ [EX [~ [E [true U ~ [E [true U ~ [[1<=p15 & 2<=p22]]]]]]]]]] & ~ [E [~ [EX [~ [E [true U ~ [E [true U ~ [[1<=p15 & 2<=p22]]]]]]]] U [EG [~ [[1<=p24 & 2<=p8]]] & ~ [EX [~ [E [true U ~ [E [true U ~ [[1<=p15 & 2<=p22]]]]]]]]]]]]

abstracting: (2<=p22)
states: 13,331,628 (7)
abstracting: (1<=p15)
states: 228,704,101 (8)
.abstracting: (2<=p8)
states: 9,036,477 (6)
abstracting: (1<=p24)
states: 209,075,571 (8)
........
EG iterations: 8
abstracting: (2<=p22)
states: 13,331,628 (7)
abstracting: (1<=p15)
states: 228,704,101 (8)
.abstracting: (2<=p22)
states: 13,331,628 (7)
abstracting: (1<=p15)
states: 228,704,101 (8)
..
EG iterations: 1
-> the formula is TRUE

FORMULA DNAwalker-PT-05track28LR-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.875sec

checking: AF [[AG [EX [[1<=p26 & 2<=p32]]] & AX [AF [[2<=p12 & 1<=p28]]]]]
normalized: ~ [EG [~ [[~ [EX [EG [~ [[2<=p12 & 1<=p28]]]]] & ~ [E [true U ~ [EX [[1<=p26 & 2<=p32]]]]]]]]]

abstracting: (2<=p32)
states: 18,062,712 (7)
abstracting: (1<=p26)
states: 147,755,674 (8)
.abstracting: (1<=p28)
states: 112,926,616 (8)
abstracting: (2<=p12)
states: 14,419,926 (7)
........
EG iterations: 8
.
EG iterations: 0
-> the formula is FALSE

FORMULA DNAwalker-PT-05track28LR-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.264sec

checking: AX [AX [EF [[E [[1<=p3 & 2<=p8] U [1<=p5 & 2<=p7]] | [2<=p0 & 1<=p1]]]]]
normalized: ~ [EX [EX [~ [E [true U [[2<=p0 & 1<=p1] | E [[1<=p3 & 2<=p8] U [1<=p5 & 2<=p7]]]]]]]]

abstracting: (2<=p7)
states: 13,943,016 (7)
abstracting: (1<=p5)
states: 160,797,628 (8)
abstracting: (2<=p8)
states: 9,036,477 (6)
abstracting: (1<=p3)
states: 201,565,217 (8)
abstracting: (1<=p1)
states: 212,891,037 (8)
abstracting: (2<=p0)
states: 729
..-> the formula is FALSE

FORMULA DNAwalker-PT-05track28LR-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.283sec

checking: EF [[EG [[AG [[p15<=0 | p18<=1]] | [2<=p14 & 1<=p22]]] | [1<=p13 & 2<=p28]]]
normalized: E [true U [[1<=p13 & 2<=p28] | EG [[[2<=p14 & 1<=p22] | ~ [E [true U ~ [[p15<=0 | p18<=1]]]]]]]]

abstracting: (p18<=1)
states: 426,053,589 (8)
abstracting: (p15<=0)
states: 206,636,730 (8)
abstracting: (1<=p22)
states: 175,368,277 (8)
abstracting: (2<=p14)
states: 13,943,016 (7)
.
EG iterations: 1
abstracting: (2<=p28)
states: 10,980,108 (7)
abstracting: (1<=p13)
states: 210,317,571 (8)
-> the formula is TRUE

FORMULA DNAwalker-PT-05track28LR-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 9.976sec

checking: A [EX [~ [[AX [[[1<=p12 & 2<=p26] | [1<=p4 & 2<=p8]]] & [2<=p28 & 1<=p31]]]] U EG [[2<=p8 & 1<=p24]]]
normalized: [~ [EG [~ [EG [[2<=p8 & 1<=p24]]]]] & ~ [E [~ [EG [[2<=p8 & 1<=p24]]] U [~ [EX [~ [[[2<=p28 & 1<=p31] & ~ [EX [~ [[[1<=p4 & 2<=p8] | [1<=p12 & 2<=p26]]]]]]]]] & ~ [EG [[2<=p8 & 1<=p24]]]]]]]

abstracting: (1<=p24)
states: 209,075,571 (8)
abstracting: (2<=p8)
states: 9,036,477 (6)
.......
EG iterations: 7
abstracting: (2<=p26)
states: 12,073,932 (7)
abstracting: (1<=p12)
states: 152,226,477 (8)
abstracting: (2<=p8)
states: 9,036,477 (6)
abstracting: (1<=p4)
states: 161,374,473 (8)
.abstracting: (1<=p31)
states: 227,767,095 (8)
abstracting: (2<=p28)
states: 10,980,108 (7)
.abstracting: (1<=p24)
states: 209,075,571 (8)
abstracting: (2<=p8)
states: 9,036,477 (6)
.......
EG iterations: 7

before gc: list nodes free: 788684

after gc: idd nodes used:102684, unused:63897316; list nodes free:360130226

before gc: list nodes free: 6451464

after gc: idd nodes used:118674, unused:63881326; list nodes free:360052909
abstracting: (1<=p24)
states: 209,075,571 (8)
abstracting: (2<=p8)
states: 9,036,477 (6)
.......
EG iterations: 7

EG iterations: 0
-> the formula is FALSE

FORMULA DNAwalker-PT-05track28LR-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m 5.512sec

checking: AF [AX [[A [E [1<=p19 U [2<=p24 & 1<=p30]] U AF [[2<=p12 & 1<=p24]]] | [[1<=p5 & 2<=p7] | [2<=p14 & 1<=p23]]]]]
normalized: ~ [EG [EX [~ [[[[2<=p14 & 1<=p23] | [1<=p5 & 2<=p7]] | [~ [EG [EG [~ [[2<=p12 & 1<=p24]]]]] & ~ [E [EG [~ [[2<=p12 & 1<=p24]]] U [~ [E [1<=p19 U [2<=p24 & 1<=p30]]] & EG [~ [[2<=p12 & 1<=p24]]]]]]]]]]]]

abstracting: (1<=p24)
states: 209,075,571 (8)
abstracting: (2<=p12)
states: 14,419,926 (7)
.........
EG iterations: 9
abstracting: (1<=p30)
states: 435,340,831 (8)
abstracting: (2<=p24)
states: 17,597,826 (7)
abstracting: (1<=p19)
states: 141,804,963 (8)
abstracting: (1<=p24)
states: 209,075,571 (8)
abstracting: (2<=p12)
states: 14,419,926 (7)
.........
EG iterations: 9
abstracting: (1<=p24)
states: 209,075,571 (8)
abstracting: (2<=p12)
states: 14,419,926 (7)
.........
EG iterations: 9
.
EG iterations: 1
abstracting: (2<=p7)
states: 13,943,016 (7)
abstracting: (1<=p5)
states: 160,797,628 (8)
abstracting: (1<=p23)
states: 435,340,831 (8)
abstracting: (2<=p14)
states: 13,943,016 (7)
.............
EG iterations: 12
-> the formula is FALSE

FORMULA DNAwalker-PT-05track28LR-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m16.872sec

checking: AG [[AX [[p4<=0 | p12<=1]] | [AG [[1<=p12 & 2<=p13]] | EF [[[p5<=1 | p8<=0] | [[2<=p21 & 1<=p23] | [2<=p14 & 1<=p21]]]]]]]
normalized: ~ [E [true U ~ [[[E [true U [[[2<=p14 & 1<=p21] | [2<=p21 & 1<=p23]] | [p5<=1 | p8<=0]]] | ~ [E [true U ~ [[1<=p12 & 2<=p13]]]]] | ~ [EX [~ [[p4<=0 | p12<=1]]]]]]]]

abstracting: (p12<=1)
states: 420,920,905 (8)
abstracting: (p4<=0)
states: 273,966,358 (8)
.abstracting: (2<=p13)
states: 17,597,826 (7)
abstracting: (1<=p12)
states: 152,226,477 (8)
abstracting: (p8<=0)
states: 317,632,828 (8)
abstracting: (p5<=1)
states: 422,801,689 (8)
abstracting: (1<=p23)
states: 435,340,831 (8)
abstracting: (2<=p21)
states: 14,184,216 (7)
abstracting: (1<=p21)
states: 226,893,715 (8)
abstracting: (2<=p14)
states: 13,943,016 (7)
-> the formula is TRUE

FORMULA DNAwalker-PT-05track28LR-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.545sec

checking: EG [E [[EG [AF [[1<=p5 & 2<=p10]]] | [~ [A [[2<=p5 & 1<=p14] U 1<=p29]] & AX [EG [[2<=p12 & 1<=p24]]]]] U [A [E [[1<=p25 & 2<=p31] U [2<=p2 & 1<=p5]] U [[1<=p2 & 2<=p6] | AF [[2<=p13 & 1<=p31]]]] | [1<=p4 & 2<=p7]]]]
normalized: EG [E [[[~ [EX [~ [EG [[2<=p12 & 1<=p24]]]]] & ~ [[~ [EG [~ [1<=p29]]] & ~ [E [~ [1<=p29] U [~ [[2<=p5 & 1<=p14]] & ~ [1<=p29]]]]]]] | EG [~ [EG [~ [[1<=p5 & 2<=p10]]]]]] U [[1<=p4 & 2<=p7] | [~ [EG [~ [[~ [EG [~ [[2<=p13 & 1<=p31]]]] | [1<=p2 & 2<=p6]]]]] & ~ [E [~ [[~ [EG [~ [[2<=p13 & 1<=p31]]]] | [1<=p2 & 2<=p6]]] U [~ [E [[1<=p25 & 2<=p31] U [2<=p2 & 1<=p5]]] & ~ [[~ [EG [~ [[2<=p13 & 1<=p31]]]] | [1<=p2 & 2<=p6]]]]]]]]]]

abstracting: (2<=p6)
states: 13,009,572 (7)
abstracting: (1<=p2)
states: 201,565,217 (8)
abstracting: (1<=p31)
states: 227,767,095 (8)
abstracting: (2<=p13)
states: 17,597,826 (7)
.......
EG iterations: 7
abstracting: (1<=p5)
states: 160,797,628 (8)
abstracting: (2<=p2)
states: 9,375,948 (6)
abstracting: (2<=p31)
states: 18,062,712 (7)
abstracting: (1<=p25)
states: 222,064,603 (8)
abstracting: (2<=p6)
states: 13,009,572 (7)
abstracting: (1<=p2)
states: 201,565,217 (8)
abstracting: (1<=p31)
states: 227,767,095 (8)
abstracting: (2<=p13)
states: 17,597,826 (7)
.......
EG iterations: 7
abstracting: (2<=p6)
states: 13,009,572 (7)
abstracting: (1<=p2)
states: 201,565,217 (8)
abstracting: (1<=p31)
states: 227,767,095 (8)
abstracting: (2<=p13)
states: 17,597,826 (7)
.......
EG iterations: 7
......
EG iterations: 6
abstracting: (2<=p7)
states: 13,943,016 (7)
abstracting: (1<=p4)
states: 161,374,473 (8)
abstracting: (2<=p10)
states: 10,009,206 (7)
abstracting: (1<=p5)
states: 160,797,628 (8)
.....
EG iterations: 5
.......
EG iterations: 7
abstracting: (1<=p29)
states: 101,946,508 (8)
abstracting: (1<=p14)
states: 212,679,771 (8)
abstracting: (2<=p5)
states: 12,539,142 (7)
abstracting: (1<=p29)
states: 101,946,508 (8)
abstracting: (1<=p29)
states: 101,946,508 (8)
.
EG iterations: 1
abstracting: (1<=p24)
states: 209,075,571 (8)
abstracting: (2<=p12)
states: 14,419,926 (7)
........
EG iterations: 8
............
EG iterations: 11
-> the formula is FALSE

FORMULA DNAwalker-PT-05track28LR-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.873sec

checking: EG [[EX [EX [EG [[2<=p5 & 1<=p21]]]] & [[AX [[E [[1<=p24 & 2<=p31] U [2<=p7 & 1<=p15]] | [EF [[2<=p0 & 1<=p4]] | [1<=p4 & 2<=p10]]]] | EX [[1<=p6 & 2<=p22]]] | [AG [EX [[2<=p15 & 1<=p22]]] | [[p15<=0 | p16<=1] & [[p3<=1 | p4<=0] & [p16<=0 | p21<=1]]]]]]]
normalized: EG [[[[[[[p16<=0 | p21<=1] & [p3<=1 | p4<=0]] & [p15<=0 | p16<=1]] | ~ [E [true U ~ [EX [[2<=p15 & 1<=p22]]]]]] | [EX [[1<=p6 & 2<=p22]] | ~ [EX [~ [[[[1<=p4 & 2<=p10] | E [true U [2<=p0 & 1<=p4]]] | E [[1<=p24 & 2<=p31] U [2<=p7 & 1<=p15]]]]]]]] & EX [EX [EG [[2<=p5 & 1<=p21]]]]]]

abstracting: (1<=p21)
states: 226,893,715 (8)
abstracting: (2<=p5)
states: 12,539,142 (7)
........
EG iterations: 8
..abstracting: (1<=p15)
states: 228,704,101 (8)
abstracting: (2<=p7)
states: 13,943,016 (7)
abstracting: (2<=p31)
states: 18,062,712 (7)
abstracting: (1<=p24)
states: 209,075,571 (8)
abstracting: (1<=p4)
states: 161,374,473 (8)
abstracting: (2<=p0)
states: 729
abstracting: (2<=p10)
states: 10,009,206 (7)
abstracting: (1<=p4)
states: 161,374,473 (8)
.abstracting: (2<=p22)
states: 13,331,628 (7)
abstracting: (1<=p6)
states: 170,507,106 (8)
.abstracting: (1<=p22)
states: 175,368,277 (8)
abstracting: (2<=p15)
states: 14,184,216 (7)
.abstracting: (p16<=1)
states: 425,955,421 (8)
abstracting: (p15<=0)
states: 206,636,730 (8)
abstracting: (p4<=0)
states: 273,966,358 (8)
abstracting: (p3<=1)
states: 425,964,883 (8)
abstracting: (p21<=1)
states: 421,156,615 (8)
abstracting: (p16<=0)
states: 284,345,668 (8)
.
EG iterations: 1
-> the formula is FALSE

FORMULA DNAwalker-PT-05track28LR-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.242sec

checking: [AF [[2<=p14 & 1<=p15]] & [[EG [A [~ [A [[2<=p4 & 1<=p8] U [1<=p2 & 2<=p6]]] U [[[~ [[1<=p3 & 2<=p6]] & 1<=p18] & [2<=p21 & [1<=p15 & 2<=p18]]] | [2<=p8 & 1<=p24]]]] | EG [EX [[EF [[1<=p18 & 2<=p21]] & [1<=p5 & 2<=p14]]]]] | [EF [[[[p3<=0 | p4<=1] | [p1<=0 | p2<=1]] & [[p13<=0 | p32<=1] | [p6<=1 | p15<=0]]]] | AF [[p2<=1 | p3<=0]]]]]
normalized: [[[~ [EG [~ [[p2<=1 | p3<=0]]]] | E [true U [[[p6<=1 | p15<=0] | [p13<=0 | p32<=1]] & [[p1<=0 | p2<=1] | [p3<=0 | p4<=1]]]]] | [EG [EX [[[1<=p5 & 2<=p14] & E [true U [1<=p18 & 2<=p21]]]]] | EG [[~ [EG [~ [[[2<=p8 & 1<=p24] | [[2<=p21 & [1<=p15 & 2<=p18]] & [1<=p18 & ~ [[1<=p3 & 2<=p6]]]]]]]] & ~ [E [~ [[[2<=p8 & 1<=p24] | [[2<=p21 & [1<=p15 & 2<=p18]] & [1<=p18 & ~ [[1<=p3 & 2<=p6]]]]]] U [[~ [EG [~ [[1<=p2 & 2<=p6]]]] & ~ [E [~ [[1<=p2 & 2<=p6]] U [~ [[2<=p4 & 1<=p8]] & ~ [[1<=p2 & 2<=p6]]]]]] & ~ [[[2<=p8 & 1<=p24] | [[2<=p21 & [1<=p15 & 2<=p18]] & [1<=p18 & ~ [[1<=p3 & 2<=p6]]]]]]]]]]]]] & ~ [EG [~ [[2<=p14 & 1<=p15]]]]]

abstracting: (1<=p15)
states: 228,704,101 (8)
abstracting: (2<=p14)
states: 13,943,016 (7)
.......
EG iterations: 7
abstracting: (2<=p6)
states: 13,009,572 (7)
abstracting: (1<=p3)
states: 201,565,217 (8)
abstracting: (1<=p18)
states: 151,092,205 (8)
abstracting: (2<=p18)
states: 9,287,242 (6)
abstracting: (1<=p15)
states: 228,704,101 (8)
abstracting: (2<=p21)
states: 14,184,216 (7)
abstracting: (1<=p24)
states: 209,075,571 (8)
abstracting: (2<=p8)
states: 9,036,477 (6)
abstracting: (2<=p6)
states: 13,009,572 (7)
abstracting: (1<=p2)
states: 201,565,217 (8)
abstracting: (1<=p8)
states: 117,708,003 (8)
abstracting: (2<=p4)
states: 11,036,124 (7)
abstracting: (2<=p6)
states: 13,009,572 (7)
abstracting: (1<=p2)
states: 201,565,217 (8)
abstracting: (2<=p6)
states: 13,009,572 (7)
abstracting: (1<=p2)
states: 201,565,217 (8)
......
EG iterations: 6
abstracting: (2<=p6)
states: 13,009,572 (7)
abstracting: (1<=p3)
states: 201,565,217 (8)
abstracting: (1<=p18)
states: 151,092,205 (8)
abstracting: (2<=p18)
states: 9,287,242 (6)
abstracting: (1<=p15)
states: 228,704,101 (8)
abstracting: (2<=p21)
states: 14,184,216 (7)
abstracting: (1<=p24)
states: 209,075,571 (8)
abstracting: (2<=p8)
states: 9,036,477 (6)
abstracting: (2<=p6)
states: 13,009,572 (7)
abstracting: (1<=p3)
states: 201,565,217 (8)
abstracting: (1<=p18)
states: 151,092,205 (8)
abstracting: (2<=p18)
states: 9,287,242 (6)
abstracting: (1<=p15)
states: 228,704,101 (8)
abstracting: (2<=p21)
states: 14,184,216 (7)
abstracting: (1<=p24)
states: 209,075,571 (8)
abstracting: (2<=p8)
states: 9,036,477 (6)
........
EG iterations: 8
.........
EG iterations: 9
abstracting: (2<=p21)
states: 14,184,216 (7)
abstracting: (1<=p18)
states: 151,092,205 (8)
abstracting: (2<=p14)
states: 13,943,016 (7)
abstracting: (1<=p5)
states: 160,797,628 (8)
..............
EG iterations: 13
abstracting: (p4<=1)
states: 424,304,707 (8)
abstracting: (p3<=0)
states: 233,775,614 (8)
abstracting: (p2<=1)
states: 425,964,883 (8)
abstracting: (p1<=0)
states: 222,449,794 (8)
abstracting: (p32<=1)
states: 417,278,119 (8)
abstracting: (p13<=0)
states: 225,023,260 (8)
abstracting: (p15<=0)
states: 206,636,730 (8)
abstracting: (p6<=1)
states: 422,331,259 (8)
abstracting: (p3<=0)
states: 233,775,614 (8)
abstracting: (p2<=1)
states: 425,964,883 (8)
........
EG iterations: 8
-> the formula is FALSE

FORMULA DNAwalker-PT-05track28LR-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m12.283sec

totally nodes used: 298837157 (3.0e+08)
number of garbage collections: 4
fire ops cache: hits/miss/sum: 1169328513 924290955 2093619468
used/not used/entry size/cache size: 54973150 12135714 16 1024MB
basic ops cache: hits/miss/sum: 396003450 329798900 725802350
used/not used/entry size/cache size: 16618614 158602 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: 313550 314939 628489
used/not used/entry size/cache size: 199536 8189072 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 36838083
1 21205343
2 6684246
3 1669957
4 428245
5 141383
6 62740
7 28868
8 15219
9 9096
>= 10 25684

Total processing time: 9m53.989sec


BK_STOP 1678499691033

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

177 230 212 902 839 941 3801 4231 9731 9657 10687 11846 12679 9892 9791 12160 12939 13769 13452 14514 15167 15845 13625 13812 15631 16502 18258 18576 19789 18250 17802 17334 16352 18057 16912 17550 16807 17778 19167 19210 21642 21830 22381 22613 21962 22289 23385 22410 21754 20539 22814 22861 22680 21919 21686 20745 19499 17017 18883 18854 17676
iterations count:6130082 (24520), effective:246239 (984)

initing FirstDep: 0m 0.000sec

12668 14131 15712 16531 25493 27298 27597 31853 28794 32611 30235 32060 34136 35346 31383 26424
iterations count:1624933 (6499), effective:67459 (269)

iterations count:250 (1), effective:0 (0)
24320
iterations count:123399 (493), effective:3678 (14)

iterations count:385 (1), effective:5 (0)

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

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

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

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

iterations count:2568 (10), effective:36 (0)

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

iterations count:9456 (37), effective:167 (0)

iterations count:11033 (44), effective:193 (0)

iterations count:10920 (43), effective:217 (0)
12668 14131 15712 16531 25493 27298 27597 31853 28794 32611 30235 32060 34136 35346 31383 26424
iterations count:1624933 (6499), effective:67459 (269)

iterations count:28086 (112), effective:829 (3)

iterations count:1250 (5), effective:18 (0)

iterations count:621 (2), effective:5 (0)

iterations count:708 (2), effective:11 (0)

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

iterations count:532 (2), effective:5 (0)

iterations count:410 (1), effective:3 (0)

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

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

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

iterations count:595 (2), effective:21 (0)

iterations count:528 (2), effective:8 (0)

iterations count:8967 (35), effective:163 (0)

iterations count:10939 (43), effective:187 (0)

iterations count:250 (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="DNAwalker-PT-05track28LR"
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 DNAwalker-PT-05track28LR, 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 r106-tall-167814483400906"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DNAwalker-PT-05track28LR.tgz
mv DNAwalker-PT-05track28LR 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 ;