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.r138-smll-167819420700450.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 DoubleExponent-PT-002, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-smll-167819420700450
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.7K Feb 26 13:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 26 13:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 13:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 13:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 13:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Feb 26 13:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 13:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 117K Feb 26 13:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 33K 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 DoubleExponent-PT-002-CTLFireability-00
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-01
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-02
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-03
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-04
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-05
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-06
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-07
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-08
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-09
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-10
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-11
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-12
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-13
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-14
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678840197648

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=DoubleExponent-PT-002
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-15 00:30:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-15 00:30:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 00:30:00] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2023-03-15 00:30:00] [INFO ] Transformed 110 places.
[2023-03-15 00:30:00] [INFO ] Transformed 98 transitions.
[2023-03-15 00:30:00] [INFO ] Parsed PT model containing 110 places and 98 transitions and 276 arcs in 209 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 22 ms.
Support contains 75 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 98/98 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 106 transition count 98
Applied a total of 4 rules in 29 ms. Remains 106 /110 variables (removed 4) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2023-03-15 00:30:01] [INFO ] Computed 11 place invariants in 18 ms
[2023-03-15 00:30:01] [INFO ] Implicit Places using invariants in 427 ms returned []
[2023-03-15 00:30:01] [INFO ] Invariant cache hit.
[2023-03-15 00:30:01] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 754 ms to find 0 implicit places.
[2023-03-15 00:30:01] [INFO ] Invariant cache hit.
[2023-03-15 00:30:02] [INFO ] Dead Transitions using invariants and state equation in 265 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 106/110 places, 98/98 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1061 ms. Remains : 106/110 places, 98/98 transitions.
Support contains 75 out of 106 places after structural reductions.
[2023-03-15 00:30:02] [INFO ] Flatten gal took : 62 ms
[2023-03-15 00:30:02] [INFO ] Flatten gal took : 22 ms
[2023-03-15 00:30:02] [INFO ] Input system was already deterministic with 98 transitions.
Incomplete random walk after 10000 steps, including 324 resets, run finished after 866 ms. (steps per millisecond=11 ) properties (out of 64) seen :29
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 28 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 26 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 31 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 54 ms. (steps per millisecond=18 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 23 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 80 ms. (steps per millisecond=12 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 27 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 30 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 28 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 28 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 28 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 27 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 26 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 35) seen :0
Running SMT prover for 35 properties.
[2023-03-15 00:30:04] [INFO ] Invariant cache hit.
[2023-03-15 00:30:05] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-15 00:30:05] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 7 ms returned sat
[2023-03-15 00:30:05] [INFO ] After 96ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:33
[2023-03-15 00:30:05] [INFO ] After 142ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:33
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-15 00:30:05] [INFO ] After 578ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:33
[2023-03-15 00:30:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 00:30:05] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 8 ms returned sat
[2023-03-15 00:30:06] [INFO ] After 427ms SMT Verify possible using state equation in natural domain returned unsat :11 sat :24
[2023-03-15 00:30:06] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 3 ms to minimize.
[2023-03-15 00:30:06] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2023-03-15 00:30:06] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 2 ms to minimize.
[2023-03-15 00:30:06] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 1 ms to minimize.
[2023-03-15 00:30:06] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 1 ms to minimize.
[2023-03-15 00:30:06] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 15 ms to minimize.
[2023-03-15 00:30:06] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2023-03-15 00:30:06] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 577 ms
[2023-03-15 00:30:07] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2023-03-15 00:30:07] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2023-03-15 00:30:07] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2023-03-15 00:30:07] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2023-03-15 00:30:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 234 ms
[2023-03-15 00:30:07] [INFO ] After 1578ms SMT Verify possible using trap constraints in natural domain returned unsat :11 sat :24
Attempting to minimize the solution found.
Minimization took 209 ms.
[2023-03-15 00:30:07] [INFO ] After 2207ms SMT Verify possible using all constraints in natural domain returned unsat :11 sat :24
Fused 35 Parikh solutions to 24 different solutions.
Parikh walk visited 0 properties in 304 ms.
Support contains 36 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 98/98 transitions.
Graph (complete) has 173 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 104 transition count 92
Reduce places removed 5 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 99 transition count 88
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 21 place count 95 transition count 88
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 21 place count 95 transition count 84
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 29 place count 91 transition count 84
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 41 place count 85 transition count 78
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 45 place count 83 transition count 78
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 46 place count 83 transition count 77
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 47 place count 82 transition count 77
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 49 place count 82 transition count 77
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 50 place count 81 transition count 76
Applied a total of 50 rules in 60 ms. Remains 81 /106 variables (removed 25) and now considering 76/98 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 81/106 places, 76/98 transitions.
Incomplete random walk after 10000 steps, including 493 resets, run finished after 580 ms. (steps per millisecond=17 ) properties (out of 24) seen :10
Incomplete Best-First random walk after 10000 steps, including 403 resets, run finished after 497 ms. (steps per millisecond=20 ) properties (out of 14) seen :4
Incomplete Best-First random walk after 10000 steps, including 440 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 416 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 421 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 428 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 413 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 408 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 419 resets, run finished after 428 ms. (steps per millisecond=23 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 424 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 403 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 76 rows 81 cols
[2023-03-15 00:30:10] [INFO ] Computed 10 place invariants in 4 ms
[2023-03-15 00:30:10] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 00:30:10] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-15 00:30:10] [INFO ] After 139ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:9
[2023-03-15 00:30:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-15 00:30:10] [INFO ] After 9ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-15 00:30:10] [INFO ] After 268ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-15 00:30:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 00:30:11] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-15 00:30:11] [INFO ] After 94ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-15 00:30:11] [INFO ] After 79ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-15 00:30:11] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2023-03-15 00:30:11] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2023-03-15 00:30:11] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 1 ms to minimize.
[2023-03-15 00:30:11] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 1 ms to minimize.
[2023-03-15 00:30:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 399 ms
[2023-03-15 00:30:11] [INFO ] After 625ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 130 ms.
[2023-03-15 00:30:11] [INFO ] After 937ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 178 ms.
Support contains 19 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 76/76 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 81 transition count 72
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 10 place count 77 transition count 70
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 75 transition count 70
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 12 place count 75 transition count 68
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 16 place count 73 transition count 68
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 30 place count 66 transition count 61
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 66 transition count 60
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 32 place count 65 transition count 60
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 34 place count 65 transition count 60
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 35 place count 64 transition count 59
Applied a total of 35 rules in 68 ms. Remains 64 /81 variables (removed 17) and now considering 59/76 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 64/81 places, 59/76 transitions.
Incomplete random walk after 10000 steps, including 716 resets, run finished after 752 ms. (steps per millisecond=13 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 554 resets, run finished after 295 ms. (steps per millisecond=33 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 557 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 563 resets, run finished after 335 ms. (steps per millisecond=29 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 536 resets, run finished after 276 ms. (steps per millisecond=36 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 547 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 539 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 541 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 544 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 562 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 551 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 10) seen :0
Finished probabilistic random walk after 619 steps, run visited all 10 properties in 38 ms. (steps per millisecond=16 )
Probabilistic random walk after 619 steps, saw 320 distinct states, run finished after 38 ms. (steps per millisecond=16 ) properties seen :10
Successfully simplified 11 atomic propositions for a total of 16 simplifications.
FORMULA DoubleExponent-PT-002-CTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-15 00:30:15] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-15 00:30:15] [INFO ] Flatten gal took : 11 ms
[2023-03-15 00:30:15] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA DoubleExponent-PT-002-CTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-CTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-CTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-15 00:30:15] [INFO ] Flatten gal took : 26 ms
[2023-03-15 00:30:15] [INFO ] Input system was already deterministic with 98 transitions.
Support contains 59 out of 106 places (down from 64) after GAL structural reductions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 173 edges and 106 vertex of which 104 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 105 transition count 73
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 81 transition count 73
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 48 place count 81 transition count 69
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 56 place count 77 transition count 69
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 82 place count 64 transition count 56
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 83 place count 63 transition count 55
Applied a total of 83 rules in 33 ms. Remains 63 /106 variables (removed 43) and now considering 55/98 (removed 43) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 34 ms. Remains : 63/106 places, 55/98 transitions.
[2023-03-15 00:30:15] [INFO ] Flatten gal took : 5 ms
[2023-03-15 00:30:15] [INFO ] Flatten gal took : 5 ms
[2023-03-15 00:30:15] [INFO ] Input system was already deterministic with 55 transitions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 21 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 106/106 places, 98/98 transitions.
[2023-03-15 00:30:15] [INFO ] Flatten gal took : 7 ms
[2023-03-15 00:30:15] [INFO ] Flatten gal took : 23 ms
[2023-03-15 00:30:15] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 4 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 106/106 places, 98/98 transitions.
[2023-03-15 00:30:15] [INFO ] Flatten gal took : 7 ms
[2023-03-15 00:30:15] [INFO ] Flatten gal took : 23 ms
[2023-03-15 00:30:15] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 105 transition count 77
Reduce places removed 20 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 21 rules applied. Total rules applied 41 place count 85 transition count 76
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 84 transition count 76
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 42 place count 84 transition count 71
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 52 place count 79 transition count 71
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 80 place count 65 transition count 57
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 81 place count 64 transition count 56
Applied a total of 81 rules in 38 ms. Remains 64 /106 variables (removed 42) and now considering 56/98 (removed 42) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38 ms. Remains : 64/106 places, 56/98 transitions.
[2023-03-15 00:30:15] [INFO ] Flatten gal took : 4 ms
[2023-03-15 00:30:15] [INFO ] Flatten gal took : 21 ms
[2023-03-15 00:30:15] [INFO ] Input system was already deterministic with 56 transitions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 3 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 106/106 places, 98/98 transitions.
[2023-03-15 00:30:15] [INFO ] Flatten gal took : 23 ms
[2023-03-15 00:30:15] [INFO ] Flatten gal took : 6 ms
[2023-03-15 00:30:15] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 2 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 106/106 places, 98/98 transitions.
[2023-03-15 00:30:15] [INFO ] Flatten gal took : 23 ms
[2023-03-15 00:30:15] [INFO ] Flatten gal took : 7 ms
[2023-03-15 00:30:15] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 2 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 106/106 places, 98/98 transitions.
[2023-03-15 00:30:15] [INFO ] Flatten gal took : 6 ms
[2023-03-15 00:30:15] [INFO ] Flatten gal took : 22 ms
[2023-03-15 00:30:15] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 2 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 106/106 places, 98/98 transitions.
[2023-03-15 00:30:15] [INFO ] Flatten gal took : 5 ms
[2023-03-15 00:30:15] [INFO ] Flatten gal took : 22 ms
[2023-03-15 00:30:15] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 2 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 106/106 places, 98/98 transitions.
[2023-03-15 00:30:15] [INFO ] Flatten gal took : 6 ms
[2023-03-15 00:30:15] [INFO ] Flatten gal took : 5 ms
[2023-03-15 00:30:15] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 2 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 106/106 places, 98/98 transitions.
[2023-03-15 00:30:15] [INFO ] Flatten gal took : 6 ms
[2023-03-15 00:30:15] [INFO ] Flatten gal took : 23 ms
[2023-03-15 00:30:15] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 1 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 106/106 places, 98/98 transitions.
[2023-03-15 00:30:15] [INFO ] Flatten gal took : 6 ms
[2023-03-15 00:30:15] [INFO ] Flatten gal took : 22 ms
[2023-03-15 00:30:15] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 17 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 106/106 places, 98/98 transitions.
[2023-03-15 00:30:16] [INFO ] Flatten gal took : 6 ms
[2023-03-15 00:30:16] [INFO ] Flatten gal took : 6 ms
[2023-03-15 00:30:16] [INFO ] Input system was already deterministic with 98 transitions.
[2023-03-15 00:30:16] [INFO ] Flatten gal took : 23 ms
[2023-03-15 00:30:16] [INFO ] Flatten gal took : 6 ms
[2023-03-15 00:30:16] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-15 00:30:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 106 places, 98 transitions and 272 arcs took 2 ms.
Total runtime 15455 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: 106 NrTr: 98 NrArc: 272)

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

net check time: 0m 0.000sec

init dd package: 0m 3.765sec


RS generation: 0m 0.447sec


-> reachability set: #nodes 2587 (2.6e+03) #states 3,708 (3)



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

checking: EF [AG [p20<=0]]
normalized: E [true U ~ [E [true U ~ [p20<=0]]]]

abstracting: (p20<=0)
states: 3,704 (3)
-> the formula is TRUE

FORMULA DoubleExponent-PT-002-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.107sec

checking: AX [AG [EF [[1<=p10 & 1<=p32]]]]
normalized: ~ [EX [E [true U ~ [E [true U [1<=p10 & 1<=p32]]]]]]

abstracting: (1<=p32)
states: 245
abstracting: (1<=p10)
states: 1,341 (3)
.-> the formula is FALSE

FORMULA DoubleExponent-PT-002-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.260sec

checking: EF [[AG [[AF [1<=p97] & p40<=0]] | EG [AX [1<=p39]]]]
normalized: E [true U [EG [~ [EX [~ [1<=p39]]]] | ~ [E [true U ~ [[p40<=0 & ~ [EG [~ [1<=p97]]]]]]]]]

abstracting: (1<=p97)
states: 10
..
EG iterations: 2
abstracting: (p40<=0)
states: 3,671 (3)
abstracting: (1<=p39)
states: 37
...
EG iterations: 2
-> the formula is TRUE

FORMULA DoubleExponent-PT-002-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.122sec

checking: AG [EF [[~ [A [1<=p33 U 1<=p100]] | [1<=p100 | [1<=p73 & 1<=p81]]]]]
normalized: ~ [E [true U ~ [E [true U [[1<=p100 | [1<=p73 & 1<=p81]] | ~ [[~ [EG [~ [1<=p100]]] & ~ [E [~ [1<=p100] U [~ [1<=p33] & ~ [1<=p100]]]]]]]]]]]

abstracting: (1<=p100)
states: 10
abstracting: (1<=p33)
states: 141
abstracting: (1<=p100)
states: 10
abstracting: (1<=p100)
states: 10
.....
EG iterations: 5
abstracting: (1<=p81)
states: 12
abstracting: (1<=p73)
states: 2,760 (3)
abstracting: (1<=p100)
states: 10
-> the formula is TRUE

FORMULA DoubleExponent-PT-002-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.027sec

checking: EX [EG [[p1<=0 | [p28<=0 | [EG [1<=p78] & AX [[p22<=0 | p31<=0]]]]]]]
normalized: EX [EG [[p1<=0 | [p28<=0 | [~ [EX [~ [[p22<=0 | p31<=0]]]] & EG [1<=p78]]]]]]

abstracting: (1<=p78)
states: 16
..
EG iterations: 2
abstracting: (p31<=0)
states: 3,641 (3)
abstracting: (p22<=0)
states: 3,634 (3)
.abstracting: (p28<=0)
states: 3,604 (3)
abstracting: (p1<=0)
states: 464
.
EG iterations: 1
.-> the formula is TRUE

FORMULA DoubleExponent-PT-002-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.029sec

checking: AX [EG [E [AF [~ [[1<=p22 & 1<=p38]]] U [AX [[1<=p8 & 1<=p44]] | [1<=p11 & 1<=p55]]]]]
normalized: ~ [EX [~ [EG [E [~ [EG [[1<=p22 & 1<=p38]]] U [[1<=p11 & 1<=p55] | ~ [EX [~ [[1<=p8 & 1<=p44]]]]]]]]]]

abstracting: (1<=p44)
states: 31
abstracting: (1<=p8)
states: 535
.abstracting: (1<=p55)
states: 184
abstracting: (1<=p11)
states: 908
abstracting: (1<=p38)
states: 37
abstracting: (1<=p22)
states: 74
..
EG iterations: 2

EG iterations: 0
.-> the formula is TRUE

FORMULA DoubleExponent-PT-002-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.106sec

checking: [EX [EF [AX [p49<=0]]] & ~ [A [[~ [AX [1<=p47]] | [AF [1<=p23] | AF [1<=p5]]] U [1<=p58 & 1<=p65]]]]
normalized: [~ [[~ [EG [~ [[1<=p58 & 1<=p65]]]] & ~ [E [~ [[1<=p58 & 1<=p65]] U [~ [[[~ [EG [~ [1<=p5]]] | ~ [EG [~ [1<=p23]]]] | EX [~ [1<=p47]]]] & ~ [[1<=p58 & 1<=p65]]]]]]] & EX [E [true U ~ [EX [~ [p49<=0]]]]]]

abstracting: (p49<=0)
states: 3,665 (3)
..abstracting: (1<=p65)
states: 4
abstracting: (1<=p58)
states: 2,974 (3)
abstracting: (1<=p47)
states: 43
.abstracting: (1<=p23)
states: 2
.......
EG iterations: 7
abstracting: (1<=p5)
states: 100
..........
EG iterations: 10
abstracting: (1<=p65)
states: 4
abstracting: (1<=p58)
states: 2,974 (3)
abstracting: (1<=p65)
states: 4
abstracting: (1<=p58)
states: 2,974 (3)
........
EG iterations: 8
-> the formula is TRUE

FORMULA DoubleExponent-PT-002-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.246sec

checking: [EF [AG [p7<=0]] & EF [[[AG [1<=p91] | [[1<=p22 & 1<=p38] | [1<=p8 & 1<=p44]]] & AX [[EX [1<=p69] | p97<=0]]]]]
normalized: [E [true U [~ [EX [~ [[p97<=0 | EX [1<=p69]]]]] & [[[1<=p8 & 1<=p44] | [1<=p22 & 1<=p38]] | ~ [E [true U ~ [1<=p91]]]]]] & E [true U ~ [E [true U ~ [p7<=0]]]]]

abstracting: (p7<=0)
states: 3,673 (3)
abstracting: (1<=p91)
states: 4
abstracting: (1<=p38)
states: 37
abstracting: (1<=p22)
states: 74
abstracting: (1<=p44)
states: 31
abstracting: (1<=p8)
states: 535
abstracting: (1<=p69)
states: 16
.abstracting: (p97<=0)
states: 3,698 (3)
.-> the formula is TRUE

FORMULA DoubleExponent-PT-002-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.293sec

checking: A [E [[AX [[[1<=p5 & 1<=p74] | 1<=p104]] | EG [[AG [[1<=p59 & 1<=p79]] | p78<=0]]] U AX [EX [p100<=0]]] U [1<=p45 & 1<=p95]]
normalized: [~ [EG [~ [[1<=p45 & 1<=p95]]]] & ~ [E [~ [[1<=p45 & 1<=p95]] U [~ [E [[EG [[p78<=0 | ~ [E [true U ~ [[1<=p59 & 1<=p79]]]]]] | ~ [EX [~ [[1<=p104 | [1<=p5 & 1<=p74]]]]]] U ~ [EX [~ [EX [p100<=0]]]]]] & ~ [[1<=p45 & 1<=p95]]]]]]

abstracting: (1<=p95)
states: 2,805 (3)
abstracting: (1<=p45)
states: 80
abstracting: (p100<=0)
states: 3,698 (3)
..abstracting: (1<=p74)
states: 1
abstracting: (1<=p5)
states: 100
abstracting: (1<=p104)
states: 80
.abstracting: (1<=p79)
states: 16
abstracting: (1<=p59)
states: 3,651 (3)
abstracting: (p78<=0)
states: 3,692 (3)
.................
EG iterations: 17
abstracting: (1<=p95)
states: 2,805 (3)
abstracting: (1<=p45)
states: 80
abstracting: (1<=p95)
states: 2,805 (3)
abstracting: (1<=p45)
states: 80
.
EG iterations: 1
-> the formula is FALSE

FORMULA DoubleExponent-PT-002-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.132sec

checking: EG [AF [[A [[p78<=0 & [1<=p40 | [1<=p13 & 1<=p84]]] U [EX [1<=p56] & 1<=p66]] & [[1<=p8 & 1<=p51] | [[1<=p9 & 1<=p88] | [1<=p63 & [1<=p52 & [p22<=0 | p38<=0]]]]]]]]
normalized: EG [~ [EG [~ [[[[1<=p8 & 1<=p51] | [[1<=p63 & [1<=p52 & [p22<=0 | p38<=0]]] | [1<=p9 & 1<=p88]]] & [~ [E [~ [[1<=p66 & EX [1<=p56]]] U [~ [[1<=p66 & EX [1<=p56]]] & ~ [[p78<=0 & [1<=p40 | [1<=p13 & 1<=p84]]]]]]] & ~ [EG [~ [[1<=p66 & EX [1<=p56]]]]]]]]]]]

abstracting: (1<=p56)
states: 43
.abstracting: (1<=p66)
states: 4

EG iterations: 0
abstracting: (1<=p84)
states: 3,060 (3)
abstracting: (1<=p13)
states: 2
abstracting: (1<=p40)
states: 37
abstracting: (p78<=0)
states: 3,692 (3)
abstracting: (1<=p56)
states: 43
.abstracting: (1<=p66)
states: 4
abstracting: (1<=p56)
states: 43
.abstracting: (1<=p66)
states: 4
abstracting: (1<=p88)
states: 2,468 (3)
abstracting: (1<=p9)
states: 5
abstracting: (p38<=0)
states: 3,671 (3)
abstracting: (p22<=0)
states: 3,634 (3)
abstracting: (1<=p52)
states: 1
abstracting: (1<=p63)
states: 1
abstracting: (1<=p51)
states: 6
abstracting: (1<=p8)
states: 535

EG iterations: 0
.
EG iterations: 1
-> the formula is FALSE

FORMULA DoubleExponent-PT-002-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.028sec

checking: EF [[[[[[p51<=0 | [EG [AX [1<=p80]] & [~ [A [1<=p21 U 1<=p104]] | [AF [p78<=0] | [[p60<=0 | p99<=0] & [p59<=0 | p79<=0]]]]]] | p8<=0] | [1<=p2 | 1<=p4]] & EF [[1<=p24 & 1<=p44]]] & AX [AG [p63<=0]]]]
normalized: E [true U [~ [EX [E [true U ~ [p63<=0]]]] & [E [true U [1<=p24 & 1<=p44]] & [[1<=p2 | 1<=p4] | [p8<=0 | [p51<=0 | [[[[[p59<=0 | p79<=0] & [p60<=0 | p99<=0]] | ~ [EG [~ [p78<=0]]]] | ~ [[~ [EG [~ [1<=p104]]] & ~ [E [~ [1<=p104] U [~ [1<=p21] & ~ [1<=p104]]]]]]] & EG [~ [EX [~ [1<=p80]]]]]]]]]]]

abstracting: (1<=p80)
states: 12
...
EG iterations: 2
abstracting: (1<=p104)
states: 80
abstracting: (1<=p21)
states: 4
abstracting: (1<=p104)
states: 80
abstracting: (1<=p104)
states: 80
.....
EG iterations: 5
abstracting: (p78<=0)
states: 3,692 (3)
..
EG iterations: 2
abstracting: (p99<=0)
states: 3,698 (3)
abstracting: (p60<=0)
states: 54
abstracting: (p79<=0)
states: 3,692 (3)
abstracting: (p59<=0)
states: 57
abstracting: (p51<=0)
states: 3,702 (3)
abstracting: (p8<=0)
states: 3,173 (3)
abstracting: (1<=p4)
states: 100
abstracting: (1<=p2)
states: 145
abstracting: (1<=p44)
states: 31
abstracting: (1<=p24)
states: 37
abstracting: (p63<=0)
states: 3,707 (3)
.-> the formula is TRUE

FORMULA DoubleExponent-PT-002-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.094sec

checking: AF [[E [[p40<=0 | AX [1<=p43]] U A [[~ [[1<=p73 & 1<=p89]] & EG [1<=p27]] U [EF [[1<=p1 & 1<=p105]] | [[1<=p6 & 1<=p38] | 1<=p19]]]] & AG [[E [[1<=p58 & 1<=p92] U [1<=p8 & 1<=p44]] & AG [1<=p34]]]]]
normalized: ~ [EG [~ [[~ [E [true U ~ [[~ [E [true U ~ [1<=p34]]] & E [[1<=p58 & 1<=p92] U [1<=p8 & 1<=p44]]]]]] & E [[p40<=0 | ~ [EX [~ [1<=p43]]]] U [~ [EG [~ [[[1<=p19 | [1<=p6 & 1<=p38]] | E [true U [1<=p1 & 1<=p105]]]]]] & ~ [E [~ [[[1<=p19 | [1<=p6 & 1<=p38]] | E [true U [1<=p1 & 1<=p105]]]] U [~ [[EG [1<=p27] & ~ [[1<=p73 & 1<=p89]]]] & ~ [[[1<=p19 | [1<=p6 & 1<=p38]] | E [true U [1<=p1 & 1<=p105]]]]]]]]]]]]]

abstracting: (1<=p105)
states: 145
abstracting: (1<=p1)
states: 3,244 (3)
abstracting: (1<=p38)
states: 37
abstracting: (1<=p6)
states: 1,715 (3)
abstracting: (1<=p19)
states: 1
abstracting: (1<=p89)
states: 4
abstracting: (1<=p73)
states: 2,760 (3)
abstracting: (1<=p27)
states: 104
..
EG iterations: 2
abstracting: (1<=p105)
states: 145
abstracting: (1<=p1)
states: 3,244 (3)
abstracting: (1<=p38)
states: 37
abstracting: (1<=p6)
states: 1,715 (3)
abstracting: (1<=p19)
states: 1
abstracting: (1<=p105)
states: 145
abstracting: (1<=p1)
states: 3,244 (3)
abstracting: (1<=p38)
states: 37
abstracting: (1<=p6)
states: 1,715 (3)
abstracting: (1<=p19)
states: 1
......
EG iterations: 6
abstracting: (1<=p43)
states: 31
.abstracting: (p40<=0)
states: 3,671 (3)
abstracting: (1<=p44)
states: 31
abstracting: (1<=p8)
states: 535
abstracting: (1<=p92)
states: 4
abstracting: (1<=p58)
states: 2,974 (3)
abstracting: (1<=p34)
states: 141

EG iterations: 0
-> the formula is FALSE

FORMULA DoubleExponent-PT-002-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.197sec

totally nodes used: 541408 (5.4e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1106290 3620844 4727134
used/not used/entry size/cache size: 4134346 62974518 16 1024MB
basic ops cache: hits/miss/sum: 86410 436001 522411
used/not used/entry size/cache size: 767199 16010017 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: 2333 18013 20346
used/not used/entry size/cache size: 18002 8370606 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 66663840
1 377220
2 56315
3 9458
4 1331
5 182
6 103
7 34
8 40
9 43
>= 10 298

Total processing time: 0m 7.923sec


BK_STOP 1678840225302

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:32411 (330), effective:3707 (37)

initing FirstDep: 0m 0.000sec


iterations count:601 (6), effective:44 (0)

iterations count:587 (5), effective:42 (0)

iterations count:1946 (19), effective:156 (1)

iterations count:1541 (15), effective:115 (1)

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

iterations count:1756 (17), effective:130 (1)

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

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

iterations count:1602 (16), effective:106 (1)

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

iterations count:1513 (15), effective:117 (1)

iterations count:2979 (30), effective:237 (2)

iterations count:1546 (15), effective:117 (1)

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

iterations count:3119 (31), effective:271 (2)

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

iterations count:172 (1), effective:11 (0)

iterations count:812 (8), effective:71 (0)

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

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

iterations count:707 (7), effective:49 (0)

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

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

iterations count:2587 (26), effective:218 (2)

iterations count:2587 (26), effective:218 (2)

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

iterations count:2587 (26), effective:218 (2)

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

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

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

iterations count:98 (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="DoubleExponent-PT-002"
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 DoubleExponent-PT-002, 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 r138-smll-167819420700450"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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