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

About the Execution of Marcie+red for DNAwalker-PT-04track28LL

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
11308.724 486377.00 499968.00 1927.50 TTFTTTTFTFTFFTTT 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-167814483400898.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-04track28LL, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814483400898
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 7.6K Feb 25 13:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 25 13:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 12:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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.7K Feb 25 15:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 13:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 25 13:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 25 13:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 25 13:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:54 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-04track28LL-CTLFireability-00
FORMULA_NAME DNAwalker-PT-04track28LL-CTLFireability-01
FORMULA_NAME DNAwalker-PT-04track28LL-CTLFireability-02
FORMULA_NAME DNAwalker-PT-04track28LL-CTLFireability-03
FORMULA_NAME DNAwalker-PT-04track28LL-CTLFireability-04
FORMULA_NAME DNAwalker-PT-04track28LL-CTLFireability-05
FORMULA_NAME DNAwalker-PT-04track28LL-CTLFireability-06
FORMULA_NAME DNAwalker-PT-04track28LL-CTLFireability-07
FORMULA_NAME DNAwalker-PT-04track28LL-CTLFireability-08
FORMULA_NAME DNAwalker-PT-04track28LL-CTLFireability-09
FORMULA_NAME DNAwalker-PT-04track28LL-CTLFireability-10
FORMULA_NAME DNAwalker-PT-04track28LL-CTLFireability-11
FORMULA_NAME DNAwalker-PT-04track28LL-CTLFireability-12
FORMULA_NAME DNAwalker-PT-04track28LL-CTLFireability-13
FORMULA_NAME DNAwalker-PT-04track28LL-CTLFireability-14
FORMULA_NAME DNAwalker-PT-04track28LL-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678498706085

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-04track28LL
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 01:38:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 01:38:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 01:38:27] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2023-03-11 01:38:27] [INFO ] Transformed 34 places.
[2023-03-11 01:38:27] [INFO ] Transformed 250 transitions.
[2023-03-11 01:38:27] [INFO ] Parsed PT model containing 34 places and 250 transitions and 728 arcs in 109 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Support contains 33 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 11 ms. Remains 34 /34 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-11 01:38:27] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
// Phase 1: matrix 247 rows 34 cols
[2023-03-11 01:38:27] [INFO ] Computed 0 place invariants in 6 ms
[2023-03-11 01:38:28] [INFO ] Dead Transitions using invariants and state equation in 479 ms found 0 transitions.
[2023-03-11 01:38:28] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-11 01:38:28] [INFO ] Invariant cache hit.
[2023-03-11 01:38:28] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-11 01:38:28] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-11 01:38:28] [INFO ] Invariant cache hit.
[2023-03-11 01:38:28] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-11 01:38:28] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2023-03-11 01:38:28] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-11 01:38:28] [INFO ] Invariant cache hit.
[2023-03-11 01:38:28] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 719 ms. Remains : 34/34 places, 250/250 transitions.
Support contains 33 out of 34 places after structural reductions.
[2023-03-11 01:38:28] [INFO ] Flatten gal took : 42 ms
[2023-03-11 01:38:28] [INFO ] Flatten gal took : 39 ms
[2023-03-11 01:38:28] [INFO ] Input system was already deterministic with 250 transitions.
Support contains 32 out of 34 places (down from 33) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 640 resets, run finished after 510 ms. (steps per millisecond=19 ) properties (out of 87) seen :79
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-11 01:38:29] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-11 01:38:29] [INFO ] Invariant cache hit.
[2023-03-11 01:38:29] [INFO ] After 213ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-11 01:38:31] [INFO ] After 1689ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :0
Fused 8 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 8 atomic propositions for a total of 16 simplifications.
[2023-03-11 01:38:31] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-11 01:38:31] [INFO ] Flatten gal took : 19 ms
FORMULA DNAwalker-PT-04track28LL-CTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-11 01:38:31] [INFO ] Flatten gal took : 11 ms
[2023-03-11 01:38:31] [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 2 ms. Remains 34 /34 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-11 01:38:31] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-11 01:38:31] [INFO ] Invariant cache hit.
[2023-03-11 01:38:31] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 88 ms. Remains : 34/34 places, 250/250 transitions.
[2023-03-11 01:38:31] [INFO ] Flatten gal took : 9 ms
[2023-03-11 01:38:31] [INFO ] Flatten gal took : 9 ms
[2023-03-11 01:38:31] [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 2 ms. Remains 34 /34 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-11 01:38:31] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-11 01:38:31] [INFO ] Invariant cache hit.
[2023-03-11 01:38:31] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 90 ms. Remains : 34/34 places, 250/250 transitions.
[2023-03-11 01:38:31] [INFO ] Flatten gal took : 9 ms
[2023-03-11 01:38:31] [INFO ] Flatten gal took : 10 ms
[2023-03-11 01:38:31] [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 2 ms. Remains 34 /34 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-11 01:38:31] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-11 01:38:31] [INFO ] Invariant cache hit.
[2023-03-11 01:38:31] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 85 ms. Remains : 34/34 places, 250/250 transitions.
[2023-03-11 01:38:31] [INFO ] Flatten gal took : 8 ms
[2023-03-11 01:38:31] [INFO ] Flatten gal took : 9 ms
[2023-03-11 01:38:31] [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 2 ms. Remains 34 /34 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-11 01:38:31] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-11 01:38:31] [INFO ] Invariant cache hit.
[2023-03-11 01:38:32] [INFO ] Dead Transitions using invariants and state equation in 107 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:38:32] [INFO ] Flatten gal took : 7 ms
[2023-03-11 01:38:32] [INFO ] Flatten gal took : 7 ms
[2023-03-11 01:38:32] [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:38:32] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-11 01:38:32] [INFO ] Invariant cache hit.
[2023-03-11 01:38:32] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 86 ms. Remains : 34/34 places, 250/250 transitions.
[2023-03-11 01:38:32] [INFO ] Flatten gal took : 12 ms
[2023-03-11 01:38:32] [INFO ] Flatten gal took : 7 ms
[2023-03-11 01:38:32] [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 2 ms. Remains 34 /34 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-11 01:38:32] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-11 01:38:32] [INFO ] Invariant cache hit.
[2023-03-11 01:38:32] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 85 ms. Remains : 34/34 places, 250/250 transitions.
[2023-03-11 01:38:32] [INFO ] Flatten gal took : 7 ms
[2023-03-11 01:38:32] [INFO ] Flatten gal took : 7 ms
[2023-03-11 01:38:32] [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 2 ms. Remains 34 /34 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-11 01:38:32] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-11 01:38:32] [INFO ] Invariant cache hit.
[2023-03-11 01:38:32] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 84 ms. Remains : 34/34 places, 250/250 transitions.
[2023-03-11 01:38:32] [INFO ] Flatten gal took : 10 ms
[2023-03-11 01:38:32] [INFO ] Flatten gal took : 7 ms
[2023-03-11 01:38:32] [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 10 ms. Remains 34 /34 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-11 01:38:32] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-11 01:38:32] [INFO ] Invariant cache hit.
[2023-03-11 01:38:32] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 93 ms. Remains : 34/34 places, 250/250 transitions.
[2023-03-11 01:38:32] [INFO ] Flatten gal took : 5 ms
[2023-03-11 01:38:32] [INFO ] Flatten gal took : 6 ms
[2023-03-11 01:38:32] [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:38:32] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-11 01:38:32] [INFO ] Invariant cache hit.
[2023-03-11 01:38:32] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 86 ms. Remains : 34/34 places, 250/250 transitions.
[2023-03-11 01:38:32] [INFO ] Flatten gal took : 5 ms
[2023-03-11 01:38:32] [INFO ] Flatten gal took : 6 ms
[2023-03-11 01:38:32] [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:38:32] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-11 01:38:32] [INFO ] Invariant cache hit.
[2023-03-11 01:38:32] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 82 ms. Remains : 34/34 places, 250/250 transitions.
[2023-03-11 01:38:32] [INFO ] Flatten gal took : 5 ms
[2023-03-11 01:38:32] [INFO ] Flatten gal took : 6 ms
[2023-03-11 01:38:32] [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:38:32] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-11 01:38:32] [INFO ] Invariant cache hit.
[2023-03-11 01:38:32] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 94 ms. Remains : 34/34 places, 250/250 transitions.
[2023-03-11 01:38:32] [INFO ] Flatten gal took : 5 ms
[2023-03-11 01:38:32] [INFO ] Flatten gal took : 6 ms
[2023-03-11 01:38:32] [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:38:32] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-11 01:38:32] [INFO ] Invariant cache hit.
[2023-03-11 01:38:33] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 82 ms. Remains : 34/34 places, 250/250 transitions.
[2023-03-11 01:38:33] [INFO ] Flatten gal took : 5 ms
[2023-03-11 01:38:33] [INFO ] Flatten gal took : 6 ms
[2023-03-11 01:38:33] [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:38:33] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-11 01:38:33] [INFO ] Invariant cache hit.
[2023-03-11 01:38:33] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 99 ms. Remains : 34/34 places, 250/250 transitions.
[2023-03-11 01:38:33] [INFO ] Flatten gal took : 5 ms
[2023-03-11 01:38:33] [INFO ] Flatten gal took : 5 ms
[2023-03-11 01:38:33] [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:38:33] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-11 01:38:33] [INFO ] Invariant cache hit.
[2023-03-11 01:38:33] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 84 ms. Remains : 34/34 places, 250/250 transitions.
[2023-03-11 01:38:33] [INFO ] Flatten gal took : 4 ms
[2023-03-11 01:38:33] [INFO ] Flatten gal took : 5 ms
[2023-03-11 01:38:33] [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 6 ms. Remains 34 /34 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-11 01:38:33] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-11 01:38:33] [INFO ] Invariant cache hit.
[2023-03-11 01:38:33] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 95 ms. Remains : 34/34 places, 250/250 transitions.
[2023-03-11 01:38:33] [INFO ] Flatten gal took : 5 ms
[2023-03-11 01:38:33] [INFO ] Flatten gal took : 5 ms
[2023-03-11 01:38:33] [INFO ] Input system was already deterministic with 250 transitions.
[2023-03-11 01:38:33] [INFO ] Flatten gal took : 6 ms
[2023-03-11 01:38:33] [INFO ] Flatten gal took : 6 ms
[2023-03-11 01:38:33] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-11 01:38:33] [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 5906 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.757sec


RS generation: 0m35.304sec


-> reachability set: #nodes 36135 (3.6e+04) #states 432,884,827 (8)



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

checking: EX [0<=0]
normalized: EX [0<=0]

abstracting: (0<=0)
states: 432,884,827 (8)
.-> the formula is TRUE

FORMULA DNAwalker-PT-04track28LL-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.077sec

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

abstracting: (p29<=1)
states: 421,559,521 (8)
abstracting: (p13<=0)
states: 215,260,560 (8)
.-> the formula is TRUE

FORMULA DNAwalker-PT-04track28LL-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m20.836sec

checking: EG [EF [EX [[p19<=0 | p21<=1]]]]
normalized: EG [E [true U EX [[p19<=0 | p21<=1]]]]

abstracting: (p21<=1)
states: 423,017,443 (8)
abstracting: (p19<=0)
states: 287,342,403 (8)
.............
EG iterations: 12
-> the formula is TRUE

FORMULA DNAwalker-PT-04track28LL-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.773sec

checking: AF [[EX [AF [[2<=p12 & 1<=p29]]] & [2<=p6 & 1<=p19]]]
normalized: ~ [EG [~ [[[2<=p6 & 1<=p19] & EX [~ [EG [~ [[2<=p12 & 1<=p29]]]]]]]]]

abstracting: (1<=p29)
states: 151,362,924 (8)
abstracting: (2<=p12)
states: 14,253,246 (7)
.........
EG iterations: 9
.abstracting: (1<=p19)
states: 145,542,424 (8)
abstracting: (2<=p6)
states: 13,056,804 (7)
.
EG iterations: 1
-> the formula is FALSE

FORMULA DNAwalker-PT-04track28LL-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.548sec

checking: AF [[AX [AX [[p2<=1 | p12<=0]]] | AF [[p20<=0 & p30<=0]]]]
normalized: ~ [EG [~ [[~ [EG [~ [[p20<=0 & p30<=0]]]] | ~ [EX [EX [~ [[p2<=1 | p12<=0]]]]]]]]]

abstracting: (p12<=0)
states: 280,226,148 (8)
abstracting: (p2<=1)
states: 423,560,071 (8)
..abstracting: (p30<=0)
states: 292,847,209 (8)
abstracting: (p20<=0)
states: 297,265,551 (8)
.............
EG iterations: 13
........................
EG iterations: 24
-> the formula is TRUE

FORMULA DNAwalker-PT-04track28LL-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m11.643sec

checking: ~ [A [~ [[1<=p25 & 2<=p24]] U ~ [[[1<=p2 & 2<=p6] | ~ [EX [[1<=p19 & 2<=p21]]]]]]]
normalized: ~ [[~ [EG [[~ [EX [[1<=p19 & 2<=p21]]] | [1<=p2 & 2<=p6]]]] & ~ [E [[~ [EX [[1<=p19 & 2<=p21]]] | [1<=p2 & 2<=p6]] U [[1<=p25 & 2<=p24] & [~ [EX [[1<=p19 & 2<=p21]]] | [1<=p2 & 2<=p6]]]]]]]

abstracting: (2<=p6)
states: 13,056,804 (7)
abstracting: (1<=p2)
states: 200,364,401 (8)
abstracting: (2<=p21)
states: 9,867,384 (6)
abstracting: (1<=p19)
states: 145,542,424 (8)
.abstracting: (2<=p24)
states: 16,773,930 (7)
abstracting: (1<=p25)
states: 230,366,482 (8)
abstracting: (2<=p6)
states: 13,056,804 (7)
abstracting: (1<=p2)
states: 200,364,401 (8)
abstracting: (2<=p21)
states: 9,867,384 (6)
abstracting: (1<=p19)
states: 145,542,424 (8)
.abstracting: (2<=p6)
states: 13,056,804 (7)
abstracting: (1<=p2)
states: 200,364,401 (8)
abstracting: (2<=p21)
states: 9,867,384 (6)
abstracting: (1<=p19)
states: 145,542,424 (8)
..........
EG iterations: 9
-> the formula is TRUE

FORMULA DNAwalker-PT-04track28LL-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m24.551sec

checking: EG [AF [[[[p14<=1 | p19<=0] & [p4<=1 | p14<=0]] | [2<=p3 & 1<=p5]]]]
normalized: EG [~ [EG [~ [[[2<=p3 & 1<=p5] | [[p4<=1 | p14<=0] & [p14<=1 | p19<=0]]]]]]]

abstracting: (p19<=0)
states: 287,342,403 (8)
abstracting: (p14<=1)
states: 418,412,755 (8)
abstracting: (p14<=0)
states: 230,549,984 (8)
abstracting: (p4<=1)
states: 421,883,623 (8)
abstracting: (1<=p5)
states: 163,713,208 (8)
abstracting: (2<=p3)
states: 9,324,756 (6)
.........
EG iterations: 9

EG iterations: 0
-> the formula is TRUE

FORMULA DNAwalker-PT-04track28LL-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.978sec

checking: [EF [[EG [[2<=p8 & 1<=p10]] & [2<=p13 & 1<=p29]]] & [AF [EX [[1<=p1 & 2<=p2]]] & AF [[p29<=1 | p31<=0]]]]
normalized: [[~ [EG [~ [EX [[1<=p1 & 2<=p2]]]]] & ~ [EG [~ [[p29<=1 | p31<=0]]]]] & E [true U [[2<=p13 & 1<=p29] & EG [[2<=p8 & 1<=p10]]]]]

abstracting: (1<=p10)
states: 114,987,472 (8)
abstracting: (2<=p8)
states: 8,926,353 (6)
......
EG iterations: 6
abstracting: (1<=p29)
states: 151,362,924 (8)
abstracting: (2<=p13)
states: 16,773,930 (7)
abstracting: (p31<=0)
states: 281,385,362 (8)
abstracting: (p29<=1)
states: 421,559,521 (8)
......
EG iterations: 6
abstracting: (2<=p2)
states: 9,324,756 (6)
abstracting: (1<=p1)
states: 211,714,679 (8)
.......
EG iterations: 6
-> the formula is FALSE

FORMULA DNAwalker-PT-04track28LL-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.160sec

checking: [EX [AX [[E [~ [[1<=p12 & 2<=p25]] U AF [[1<=p24 & 2<=p26]]] & AX [EF [[1<=p16 & 2<=p19]]]]]] & EG [EF [AX [[[1<=p7 & 2<=p14] | [1<=p10 & 2<=p12]]]]]]
normalized: [EX [~ [EX [~ [[~ [EX [~ [E [true U [1<=p16 & 2<=p19]]]]] & E [~ [[1<=p12 & 2<=p25]] U ~ [EG [~ [[1<=p24 & 2<=p26]]]]]]]]]] & EG [E [true U ~ [EX [~ [[[1<=p7 & 2<=p14] | [1<=p10 & 2<=p12]]]]]]]]

abstracting: (2<=p12)
states: 14,253,246 (7)
abstracting: (1<=p10)
states: 114,987,472 (8)
abstracting: (2<=p14)
states: 14,472,072 (7)
abstracting: (1<=p7)
states: 203,284,415 (8)
.
before gc: list nodes free: 1280439

after gc: idd nodes used:208366, unused:63791634; list nodes free:374224356

before gc: list nodes free: 26602547

after gc: idd nodes used:214793, unused:63785207; list nodes free:374195094
.
EG iterations: 1
abstracting: (2<=p26)
states: 17,083,836 (7)
abstracting: (1<=p24)
states: 216,069,395 (8)
.
EG iterations: 1
abstracting: (2<=p25)
states: 17,083,836 (7)
abstracting: (1<=p12)
states: 152,658,679 (8)
abstracting: (2<=p19)
states: 9,923,148 (6)
abstracting: (1<=p16)
states: 224,189,071 (8)
...-> the formula is TRUE

FORMULA DNAwalker-PT-04track28LL-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 4m21.396sec

checking: EF [[[EG [[p5<=1 | p6<=0]] & [~ [E [[2<=p5 & 1<=p8] U [1<=p4 & 2<=p12]]] | [2<=p6 & 1<=p16]]] & [[p3<=0 | p10<=1] & [p1<=0 | p4<=1]]]]
normalized: E [true U [[[p1<=0 | p4<=1] & [p3<=0 | p10<=1]] & [[[2<=p6 & 1<=p16] | ~ [E [[2<=p5 & 1<=p8] U [1<=p4 & 2<=p12]]]] & EG [[p5<=1 | p6<=0]]]]]

abstracting: (p6<=0)
states: 265,243,543 (8)
abstracting: (p5<=1)
states: 420,609,277 (8)
........
EG iterations: 8
abstracting: (2<=p12)
states: 14,253,246 (7)
abstracting: (1<=p4)
states: 160,170,881 (8)
abstracting: (1<=p8)
states: 117,416,623 (8)
abstracting: (2<=p5)
states: 12,275,550 (7)
abstracting: (1<=p16)
states: 224,189,071 (8)
abstracting: (2<=p6)
states: 13,056,804 (7)
abstracting: (p10<=1)
states: 422,723,989 (8)
abstracting: (p3<=0)
states: 232,520,426 (8)
abstracting: (p4<=1)
states: 421,883,623 (8)
abstracting: (p1<=0)
states: 221,170,148 (8)
-> the formula is TRUE

FORMULA DNAwalker-PT-04track28LL-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.972sec

checking: AF [AX [[[EX [[[p7<=0 | p15<=1] & [p6<=0 | p16<=1]]] & 2<=p12] & [1<=p25 & [[EG [[2<=p25 & 1<=p33]] & [[1<=p6 & 2<=p15] | [1<=p23 & 2<=p27]]] | [2<=p3 & [1<=p8 & [p7<=1 | p17<=0]]]]]]]]
normalized: ~ [EG [EX [~ [[[2<=p12 & EX [[[p6<=0 | p16<=1] & [p7<=0 | p15<=1]]]] & [1<=p25 & [[EG [[2<=p25 & 1<=p33]] & [[1<=p6 & 2<=p15] | [1<=p23 & 2<=p27]]] | [2<=p3 & [1<=p8 & [p7<=1 | p17<=0]]]]]]]]]]

abstracting: (p17<=0)
states: 196,208,296 (8)
abstracting: (p7<=1)
states: 418,412,755 (8)
abstracting: (1<=p8)
states: 117,416,623 (8)
abstracting: (2<=p3)
states: 9,324,756 (6)
abstracting: (2<=p27)
states: 15,080,076 (7)
abstracting: (1<=p23)
states: 432,884,827 (8)
abstracting: (2<=p15)
states: 14,758,488 (7)
abstracting: (1<=p6)
states: 167,641,284 (8)
abstracting: (1<=p33)
states: 432,884,827 (8)
abstracting: (2<=p25)
states: 17,083,836 (7)
........
EG iterations: 8
abstracting: (1<=p25)
states: 230,366,482 (8)
abstracting: (p15<=1)
states: 418,126,339 (8)
abstracting: (p7<=0)
states: 229,600,412 (8)
abstracting: (p16<=1)
states: 418,026,043 (8)
abstracting: (p6<=0)
states: 265,243,543 (8)
.abstracting: (2<=p12)
states: 14,253,246 (7)
....
before gc: list nodes free: 3396763

after gc: idd nodes used:453028, unused:63546972; list nodes free:372703064
.........
EG iterations: 12
-> the formula is FALSE

FORMULA DNAwalker-PT-04track28LL-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m16.619sec

checking: AF [[[AG [[2<=p6 & 1<=p15]] | [2<=p27 & [1<=p31 & [p12<=1 | p26<=0]]]] | [[AX [[1<=p5 & 2<=p19]] & [[EF [[p6<=1 | p16<=0]] | [2<=p2 & 1<=p4]] & [p30<=0 | [p23<=1 & [p4<=1 | p7<=0]]]]] | [EF [AG [[p3<=0 | p6<=1]]] & [p4<=0 | p5<=1]]]]]
normalized: ~ [EG [~ [[[[[p4<=0 | p5<=1] & E [true U ~ [E [true U ~ [[p3<=0 | p6<=1]]]]]] | [[[p30<=0 | [p23<=1 & [p4<=1 | p7<=0]]] & [[2<=p2 & 1<=p4] | E [true U [p6<=1 | p16<=0]]]] & ~ [EX [~ [[1<=p5 & 2<=p19]]]]]] | [[2<=p27 & [1<=p31 & [p12<=1 | p26<=0]]] | ~ [E [true U ~ [[2<=p6 & 1<=p15]]]]]]]]]

abstracting: (1<=p15)
states: 215,970,875 (8)
abstracting: (2<=p6)
states: 13,056,804 (7)
abstracting: (p26<=0)
states: 205,385,718 (8)
abstracting: (p12<=1)
states: 418,631,581 (8)
abstracting: (1<=p31)
states: 151,499,465 (8)
abstracting: (2<=p27)
states: 15,080,076 (7)
abstracting: (2<=p19)
states: 9,923,148 (6)
abstracting: (1<=p5)
states: 163,713,208 (8)
.abstracting: (p16<=0)
states: 208,695,756 (8)
abstracting: (p6<=1)
states: 419,828,023 (8)
abstracting: (1<=p4)
states: 160,170,881 (8)
abstracting: (2<=p2)
states: 9,324,756 (6)
abstracting: (p7<=0)
states: 229,600,412 (8)
abstracting: (p4<=1)
states: 421,883,623 (8)
abstracting: (p23<=1)
states: 394,058,917 (8)
abstracting: (p30<=0)
states: 292,847,209 (8)
abstracting: (p6<=1)
states: 419,828,023 (8)
abstracting: (p3<=0)
states: 232,520,426 (8)
abstracting: (p5<=1)
states: 420,609,277 (8)
abstracting: (p4<=0)
states: 272,713,946 (8)
........
EG iterations: 8
-> the formula is TRUE

FORMULA DNAwalker-PT-04track28LL-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m21.962sec

checking: EF [[EX [EG [[1<=p13 & 2<=p26]]] | [[[EX [[p10<=0 | p25<=1]] & 1<=p3] & [2<=p10 & [E [[2<=p27 & 1<=p29] U [2<=p12 & 1<=p24]] | [p6<=1 | p21<=0]]]] | [EF [[p14<=0 | p17<=1]] & [AG [[1<=p24 & 2<=p29]] & [EG [[p24<=0 | p27<=1]] | [AG [[p7<=1 | p21<=0]] & [p4<=1 | p12<=0]]]]]]]]
normalized: E [true U [[[[[[[p4<=1 | p12<=0] & ~ [E [true U ~ [[p7<=1 | p21<=0]]]]] | EG [[p24<=0 | p27<=1]]] & ~ [E [true U ~ [[1<=p24 & 2<=p29]]]]] & E [true U [p14<=0 | p17<=1]]] | [[2<=p10 & [[p6<=1 | p21<=0] | E [[2<=p27 & 1<=p29] U [2<=p12 & 1<=p24]]]] & [1<=p3 & EX [[p10<=0 | p25<=1]]]]] | EX [EG [[1<=p13 & 2<=p26]]]]]

abstracting: (2<=p26)
states: 17,083,836 (7)
abstracting: (1<=p13)
states: 217,624,267 (8)
........
EG iterations: 8
.abstracting: (p25<=1)
states: 415,800,991 (8)
abstracting: (p10<=0)
states: 317,897,355 (8)
.abstracting: (1<=p3)
states: 200,364,401 (8)
abstracting: (1<=p24)
states: 216,069,395 (8)
abstracting: (2<=p12)
states: 14,253,246 (7)
abstracting: (1<=p29)
states: 151,362,924 (8)
abstracting: (2<=p27)
states: 15,080,076 (7)
abstracting: (p21<=0)
states: 321,260,921 (8)
abstracting: (p6<=1)
states: 419,828,023 (8)
abstracting: (2<=p10)
states: 10,160,838 (7)
abstracting: (p17<=1)
states: 418,026,043 (8)
abstracting: (p14<=0)
states: 230,549,984 (8)
abstracting: (2<=p29)
states: 11,325,306 (7)
abstracting: (1<=p24)
states: 216,069,395 (8)
abstracting: (p27<=1)
states: 417,804,751 (8)
abstracting: (p24<=0)
states: 216,815,432 (8)
.
EG iterations: 1
abstracting: (p21<=0)
states: 321,260,921 (8)
abstracting: (p7<=1)
states: 418,412,755 (8)
abstracting: (p12<=0)
states: 280,226,148 (8)
abstracting: (p4<=1)
states: 421,883,623 (8)
-> the formula is TRUE

FORMULA DNAwalker-PT-04track28LL-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m12.458sec

checking: E [[E [E [~ [[[1<=p26 & 2<=p29] | [1<=p13 & 2<=p26]]] U ~ [AF [[1<=p10 & 2<=p26]]]] U [[1<=p8 & [2<=p24 & [[1<=p23 & 2<=p26] | [[1<=p8 & 2<=p12] | ~ [[2<=p26 & 1<=p28]]]]]] | AG [[1<=p14 & 2<=p15]]]] | [EG [[2<=p28 & AX [[2<=p4 & 1<=p8]]]] & ~ [EX [2<=p18]]]] U AG [[2<=p6 & 1<=p21]]]
normalized: E [[E [E [~ [[[1<=p13 & 2<=p26] | [1<=p26 & 2<=p29]]] U EG [~ [[1<=p10 & 2<=p26]]]] U [[1<=p8 & [2<=p24 & [[1<=p23 & 2<=p26] | [~ [[2<=p26 & 1<=p28]] | [1<=p8 & 2<=p12]]]]] | ~ [E [true U ~ [[1<=p14 & 2<=p15]]]]]] | [~ [EX [2<=p18]] & EG [[2<=p28 & ~ [EX [~ [[2<=p4 & 1<=p8]]]]]]]] U ~ [E [true U ~ [[2<=p6 & 1<=p21]]]]]

abstracting: (1<=p21)
states: 111,623,906 (8)
abstracting: (2<=p6)
states: 13,056,804 (7)
abstracting: (1<=p8)
states: 117,416,623 (8)
abstracting: (2<=p4)
states: 11,001,204 (7)
.abstracting: (2<=p28)
states: 37,818,888 (7)
.
EG iterations: 1
abstracting: (2<=p18)
states: 28,781,784 (7)
.abstracting: (2<=p15)
states: 14,758,488 (7)
abstracting: (1<=p14)
states: 202,334,843 (8)
abstracting: (2<=p12)
states: 14,253,246 (7)
abstracting: (1<=p8)
states: 117,416,623 (8)
abstracting: (1<=p28)
states: 432,884,827 (8)
abstracting: (2<=p26)
states: 17,083,836 (7)
abstracting: (2<=p26)
states: 17,083,836 (7)
abstracting: (1<=p23)
states: 432,884,827 (8)
abstracting: (2<=p24)
states: 16,773,930 (7)
abstracting: (1<=p8)
states: 117,416,623 (8)
abstracting: (2<=p26)
states: 17,083,836 (7)
abstracting: (1<=p10)
states: 114,987,472 (8)
.
EG iterations: 1
abstracting: (2<=p29)
states: 11,325,306 (7)
abstracting: (1<=p26)
states: 227,499,109 (8)
abstracting: (2<=p26)
states: 17,083,836 (7)
abstracting: (1<=p13)
states: 217,624,267 (8)
-> the formula is FALSE

FORMULA DNAwalker-PT-04track28LL-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m12.140sec

checking: E [[[EF [[1<=p21 & 2<=p15]] | [[[AF [[2<=p14 & 1<=p16]] | E [[1<=p2 & 2<=p4] U 2<=p28]] | [AX [[1<=p12 & 2<=p26]] | E [[1<=p4 & 2<=p6] U [1<=p15 & 2<=p16]]]] & [[AG [[1<=p19 & 2<=p21]] | AX [[1<=p24 & 2<=p31]]] & [EX [[1<=p3 & 2<=p10]] | [1<=p11 | [1<=p14 & 2<=p19]]]]]] | [[AF [E [[1<=p12 & 2<=p25] U [1<=p7 & 2<=p21]]] & [2<=p25 & 1<=p31]] | [AG [~ [[2<=p26 & 1<=p28]]] & EF [~ [[2<=p17 & 1<=p18]]]]]] U AF [~ [[[[1<=p2 & 2<=p3] & [1<=p1 & [2<=p3 & ~ [[2<=p10 & 1<=p12]]]]] | [EF [1<=p22] | AX [[2<=p5 & 1<=p7]]]]]]]
normalized: E [[[[E [true U ~ [[2<=p17 & 1<=p18]]] & ~ [E [true U [2<=p26 & 1<=p28]]]] | [[2<=p25 & 1<=p31] & ~ [EG [~ [E [[1<=p12 & 2<=p25] U [1<=p7 & 2<=p21]]]]]]] | [[[[[1<=p11 | [1<=p14 & 2<=p19]] | EX [[1<=p3 & 2<=p10]]] & [~ [EX [~ [[1<=p24 & 2<=p31]]]] | ~ [E [true U ~ [[1<=p19 & 2<=p21]]]]]] & [[E [[1<=p4 & 2<=p6] U [1<=p15 & 2<=p16]] | ~ [EX [~ [[1<=p12 & 2<=p26]]]]] | [E [[1<=p2 & 2<=p4] U 2<=p28] | ~ [EG [~ [[2<=p14 & 1<=p16]]]]]]] | E [true U [1<=p21 & 2<=p15]]]] U ~ [EG [[[~ [EX [~ [[2<=p5 & 1<=p7]]]] | E [true U 1<=p22]] | [[1<=p1 & [2<=p3 & ~ [[2<=p10 & 1<=p12]]]] & [1<=p2 & 2<=p3]]]]]]

abstracting: (2<=p3)
states: 9,324,756 (6)
abstracting: (1<=p2)
states: 200,364,401 (8)
abstracting: (1<=p12)
states: 152,658,679 (8)
abstracting: (2<=p10)
states: 10,160,838 (7)
abstracting: (2<=p3)
states: 9,324,756 (6)
abstracting: (1<=p1)
states: 211,714,679 (8)
abstracting: (1<=p22)
states: 101,756,522 (8)
abstracting: (1<=p7)
states: 203,284,415 (8)
abstracting: (2<=p5)
states: 12,275,550 (7)
........
EG iterations: 7
abstracting: (2<=p15)
states: 14,758,488 (7)
abstracting: (1<=p21)
states: 111,623,906 (8)
abstracting: (1<=p16)
states: 224,189,071 (8)
abstracting: (2<=p14)
states: 14,472,072 (7)
.......
EG iterations: 7
abstracting: (2<=p28)
states: 37,818,888 (7)
abstracting: (2<=p4)
states: 11,001,204 (7)
abstracting: (1<=p2)
states: 200,364,401 (8)
abstracting: (2<=p26)
states: 17,083,836 (7)
abstracting: (1<=p12)
states: 152,658,679 (8)
.abstracting: (2<=p16)
states: 14,858,784 (7)
abstracting: (1<=p15)
states: 215,970,875 (8)
abstracting: (2<=p6)
states: 13,056,804 (7)
abstracting: (1<=p4)
states: 160,170,881 (8)
abstracting: (2<=p21)
states: 9,867,384 (6)
abstracting: (1<=p19)
states: 145,542,424 (8)
abstracting: (2<=p31)
states: 11,189,454 (7)
abstracting: (1<=p24)
states: 216,069,395 (8)
.abstracting: (2<=p10)
states: 10,160,838 (7)
abstracting: (1<=p3)
states: 200,364,401 (8)
.abstracting: (2<=p19)
states: 9,923,148 (6)
abstracting: (1<=p14)
states: 202,334,843 (8)
abstracting: (1<=p11)
states: 104,826,634 (8)
abstracting: (2<=p21)
states: 9,867,384 (6)
abstracting: (1<=p7)
states: 203,284,415 (8)
abstracting: (2<=p25)
states: 17,083,836 (7)
abstracting: (1<=p12)
states: 152,658,679 (8)
.
EG iterations: 1
abstracting: (1<=p31)
states: 151,499,465 (8)
abstracting: (2<=p25)
states: 17,083,836 (7)
abstracting: (1<=p28)
states: 432,884,827 (8)
abstracting: (2<=p26)
states: 17,083,836 (7)
abstracting: (1<=p18)
states: 432,884,827 (8)
abstracting: (2<=p17)
states: 14,858,784 (7)
-> the formula is TRUE

FORMULA DNAwalker-PT-04track28LL-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m33.216sec

totally nodes used: 230613320 (2.3e+08)
number of garbage collections: 3
fire ops cache: hits/miss/sum: 526843416 490730804 1017574220
used/not used/entry size/cache size: 52715495 14393369 16 1024MB
basic ops cache: hits/miss/sum: 403292937 353611099 756904036
used/not used/entry size/cache size: 16697444 79772 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: 737713 702415 1440128
used/not used/entry size/cache size: 326969 8061639 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 38991304
1 20324172
2 5815513
3 1315521
4 333224
5 128717
6 81209
7 42117
8 22892
9 12826
>= 10 41369

Total processing time: 7m57.926sec


BK_STOP 1678499192462

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination 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

222 319 490 1117 1230 3672 3767 4207 4848 5819 5946 6238 7296 6522 6555 6366 7200 7013 6571 6852 7587 7430 7219 7273 6471 6417 6519 6612 7213 7486 7684 7472 8334 7875 7781 7823 6998
iterations count:3797141 (15188), effective:159012 (636)

initing FirstDep: 0m 0.000sec


iterations count:73281 (293), effective:2429 (9)

iterations count:25771 (103), effective:581 (2)

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

iterations count:31697 (126), effective:1141 (4)
17607 20450 23398 24452 42045 43243 40212 37691 35848 35717 35460 35500 35641 34966
iterations count:1486708 (5946), effective:55286 (221)

iterations count:38732 (154), effective:1329 (5)

iterations count:8895 (35), effective:168 (0)

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

iterations count:1171 (4), effective:23 (0)

iterations count:401 (1), effective:4 (0)

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

iterations count:5915 (23), effective:125 (0)

iterations count:4635 (18), effective:107 (0)

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

iterations count:347 (1), effective:7 (0)

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

iterations count:5172 (20), effective:105 (0)

iterations count:12501 (50), effective:381 (1)

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

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

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

iterations count:22394 (89), effective:795 (3)

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

iterations count:5078 (20), effective:102 (0)

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

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

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

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

iterations count:48622 (194), effective:1655 (6)

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

iterations count:272 (1), effective:2 (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-04track28LL"
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-04track28LL, 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-167814483400898"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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