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.r135-smll-167819414400458.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 lolaxred
Input is DoubleExponent-PT-003, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-smll-167819414400458
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 7.4K Feb 26 13:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 13:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 13:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 13:28 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.9K Feb 25 16:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:01 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:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Feb 26 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 13:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 13:29 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 50K 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-003-CTLFireability-00
FORMULA_NAME DoubleExponent-PT-003-CTLFireability-01
FORMULA_NAME DoubleExponent-PT-003-CTLFireability-02
FORMULA_NAME DoubleExponent-PT-003-CTLFireability-03
FORMULA_NAME DoubleExponent-PT-003-CTLFireability-04
FORMULA_NAME DoubleExponent-PT-003-CTLFireability-05
FORMULA_NAME DoubleExponent-PT-003-CTLFireability-06
FORMULA_NAME DoubleExponent-PT-003-CTLFireability-07
FORMULA_NAME DoubleExponent-PT-003-CTLFireability-08
FORMULA_NAME DoubleExponent-PT-003-CTLFireability-09
FORMULA_NAME DoubleExponent-PT-003-CTLFireability-10
FORMULA_NAME DoubleExponent-PT-003-CTLFireability-11
FORMULA_NAME DoubleExponent-PT-003-CTLFireability-12
FORMULA_NAME DoubleExponent-PT-003-CTLFireability-13
FORMULA_NAME DoubleExponent-PT-003-CTLFireability-14
FORMULA_NAME DoubleExponent-PT-003-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678329168919

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=lolaxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-003
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 02:32:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 02:32:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 02:32:53] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2023-03-09 02:32:53] [INFO ] Transformed 163 places.
[2023-03-09 02:32:53] [INFO ] Transformed 148 transitions.
[2023-03-09 02:32:53] [INFO ] Parsed PT model containing 163 places and 148 transitions and 417 arcs in 255 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 18 ms.
Support contains 92 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 148/148 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 159 transition count 148
Applied a total of 4 rules in 35 ms. Remains 159 /163 variables (removed 4) and now considering 148/148 (removed 0) transitions.
// Phase 1: matrix 148 rows 159 cols
[2023-03-09 02:32:53] [INFO ] Computed 16 place invariants in 39 ms
[2023-03-09 02:32:53] [INFO ] Implicit Places using invariants in 461 ms returned []
[2023-03-09 02:32:53] [INFO ] Invariant cache hit.
[2023-03-09 02:32:54] [INFO ] Implicit Places using invariants and state equation in 369 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 922 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 158/163 places, 148/148 transitions.
Applied a total of 0 rules in 12 ms. Remains 158 /158 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 970 ms. Remains : 158/163 places, 148/148 transitions.
Support contains 92 out of 158 places after structural reductions.
[2023-03-09 02:32:54] [INFO ] Flatten gal took : 79 ms
[2023-03-09 02:32:54] [INFO ] Flatten gal took : 31 ms
[2023-03-09 02:32:54] [INFO ] Input system was already deterministic with 148 transitions.
Incomplete random walk after 10000 steps, including 332 resets, run finished after 950 ms. (steps per millisecond=10 ) properties (out of 65) seen :19
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 48 ms. (steps per millisecond=20 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 28 resets, run finished after 54 ms. (steps per millisecond=18 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 52 ms. (steps per millisecond=19 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 46 ms. (steps per millisecond=21 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 42 ms. (steps per millisecond=23 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 46 ms. (steps per millisecond=21 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 46 ms. (steps per millisecond=21 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 31 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 47 ms. (steps per millisecond=21 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 27 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 54 ms. (steps per millisecond=18 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 24 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 30 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 21 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 27 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 27 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 27 resets, run finished after 42 ms. (steps per millisecond=23 ) properties (out of 46) 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 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 46) 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 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 26 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 37 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 30 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 27 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 28 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 46) seen :0
Running SMT prover for 46 properties.
// Phase 1: matrix 148 rows 158 cols
[2023-03-09 02:32:57] [INFO ] Computed 15 place invariants in 5 ms
[2023-03-09 02:32:58] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 02:32:58] [INFO ] [Real]Absence check using 2 positive and 13 generalized place invariants in 12 ms returned sat
[2023-03-09 02:32:58] [INFO ] After 138ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:45
[2023-03-09 02:32:58] [INFO ] Deduced a trap composed of 43 places in 132 ms of which 10 ms to minimize.
[2023-03-09 02:32:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2023-03-09 02:32:58] [INFO ] After 338ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:46
[2023-03-09 02:32:58] [INFO ] After 855ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:46
[2023-03-09 02:32:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-09 02:32:59] [INFO ] [Nat]Absence check using 2 positive and 13 generalized place invariants in 9 ms returned sat
[2023-03-09 02:33:00] [INFO ] After 978ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :40
[2023-03-09 02:33:00] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 2 ms to minimize.
[2023-03-09 02:33:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2023-03-09 02:33:00] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 2 ms to minimize.
[2023-03-09 02:33:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2023-03-09 02:33:01] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 3 ms to minimize.
[2023-03-09 02:33:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2023-03-09 02:33:01] [INFO ] After 2511ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :40
Attempting to minimize the solution found.
Minimization took 771 ms.
[2023-03-09 02:33:02] [INFO ] After 4041ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :40
Fused 46 Parikh solutions to 40 different solutions.
Parikh walk visited 0 properties in 1188 ms.
Support contains 62 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 148/148 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 158 transition count 140
Reduce places removed 8 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 13 rules applied. Total rules applied 21 place count 150 transition count 135
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 26 place count 145 transition count 135
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 26 place count 145 transition count 128
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 40 place count 138 transition count 128
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 60 place count 128 transition count 118
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 64 place count 126 transition count 118
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 68 place count 126 transition count 114
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 72 place count 122 transition count 114
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 74 place count 122 transition count 114
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 75 place count 121 transition count 113
Applied a total of 75 rules in 60 ms. Remains 121 /158 variables (removed 37) and now considering 113/148 (removed 35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 121/158 places, 113/148 transitions.
Incomplete random walk after 10000 steps, including 626 resets, run finished after 282 ms. (steps per millisecond=35 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1000 steps, including 49 resets, run finished after 50 ms. (steps per millisecond=20 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1000 steps, including 49 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1000 steps, including 43 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 40) seen :17
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 52 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 55 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 49 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 49 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 52 resets, run finished after 42 ms. (steps per millisecond=23 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 49 resets, run finished after 48 ms. (steps per millisecond=20 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 49 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 23) seen :0
Running SMT prover for 23 properties.
// Phase 1: matrix 113 rows 121 cols
[2023-03-09 02:33:05] [INFO ] Computed 15 place invariants in 9 ms
[2023-03-09 02:33:05] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 02:33:05] [INFO ] [Real]Absence check using 2 positive and 13 generalized place invariants in 9 ms returned sat
[2023-03-09 02:33:06] [INFO ] After 488ms SMT Verify possible using state equation in real domain returned unsat :0 sat :9 real:14
[2023-03-09 02:33:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 02:33:06] [INFO ] After 113ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :8 real:15
[2023-03-09 02:33:06] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 1 ms to minimize.
[2023-03-09 02:33:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2023-03-09 02:33:06] [INFO ] After 361ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :7 real:16
Attempting to minimize the solution found.
Minimization took 81 ms.
[2023-03-09 02:33:06] [INFO ] After 1269ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :7 real:16
[2023-03-09 02:33:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 02:33:06] [INFO ] [Nat]Absence check using 2 positive and 13 generalized place invariants in 9 ms returned sat
[2023-03-09 02:33:07] [INFO ] After 455ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :23
[2023-03-09 02:33:07] [INFO ] After 336ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :23
[2023-03-09 02:33:07] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2023-03-09 02:33:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2023-03-09 02:33:08] [INFO ] After 902ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :23
Attempting to minimize the solution found.
Minimization took 318 ms.
[2023-03-09 02:33:08] [INFO ] After 2002ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :23
Parikh walk visited 0 properties in 636 ms.
Support contains 40 out of 121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 113/113 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 121 transition count 108
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 116 transition count 107
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 115 transition count 107
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 12 place count 115 transition count 106
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 114 transition count 106
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 26 place count 108 transition count 100
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 30 place count 108 transition count 96
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 34 place count 104 transition count 96
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 37 place count 104 transition count 96
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 38 place count 103 transition count 95
Applied a total of 38 rules in 53 ms. Remains 103 /121 variables (removed 18) and now considering 95/113 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 103/121 places, 95/113 transitions.
Incomplete random walk after 10000 steps, including 974 resets, run finished after 350 ms. (steps per millisecond=28 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 63 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 72 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 72 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 60 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 73 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 75 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 65 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 69 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 81 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 64 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 73 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 68 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 70 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 60 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 64 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 71 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 71 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 71 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 67 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 73 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 65 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 23) seen :1
Incomplete Best-First random walk after 1000 steps, including 80 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 22) seen :0
Interrupted probabilistic random walk after 327148 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=1, 5=1, 6=1, 7=1, 9=1, 10=1, 11=1, 12=1, 14=1, 15=1, 16=1, 17=1, 18=1, 19=1, 20=1, 21=1}
Probabilistic random walk after 327148 steps, saw 163643 distinct states, run finished after 3002 ms. (steps per millisecond=108 ) properties seen :20
Running SMT prover for 2 properties.
// Phase 1: matrix 95 rows 103 cols
[2023-03-09 02:33:13] [INFO ] Computed 15 place invariants in 5 ms
[2023-03-09 02:33:13] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 02:33:13] [INFO ] [Real]Absence check using 2 positive and 13 generalized place invariants in 5 ms returned sat
[2023-03-09 02:33:13] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 02:33:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 02:33:13] [INFO ] [Nat]Absence check using 2 positive and 13 generalized place invariants in 9 ms returned sat
[2023-03-09 02:33:13] [INFO ] After 114ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 02:33:13] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-09 02:33:13] [INFO ] After 42ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 02:33:13] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2023-03-09 02:33:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2023-03-09 02:33:13] [INFO ] After 132ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-09 02:33:13] [INFO ] After 349ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 16 ms.
Support contains 6 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 95/95 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 103 transition count 87
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 95 transition count 87
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 16 place count 95 transition count 86
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 94 transition count 86
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 42 place count 82 transition count 74
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 2 with 4 rules applied. Total rules applied 46 place count 80 transition count 74
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 80 transition count 73
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 48 place count 79 transition count 73
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 53 place count 79 transition count 68
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 58 place count 74 transition count 68
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 64 place count 74 transition count 68
Applied a total of 64 rules in 49 ms. Remains 74 /103 variables (removed 29) and now considering 68/95 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 74/103 places, 68/95 transitions.
Incomplete random walk after 10000 steps, including 1149 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 917 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 795 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 485604 steps, run timeout after 3001 ms. (steps per millisecond=161 ) properties seen :{}
Probabilistic random walk after 485604 steps, saw 242920 distinct states, run finished after 3002 ms. (steps per millisecond=161 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 68 rows 74 cols
[2023-03-09 02:33:17] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-09 02:33:17] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-09 02:33:17] [INFO ] [Real]Absence check using 2 positive and 13 generalized place invariants in 6 ms returned sat
[2023-03-09 02:33:17] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 02:33:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 02:33:17] [INFO ] [Nat]Absence check using 2 positive and 13 generalized place invariants in 6 ms returned sat
[2023-03-09 02:33:17] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 02:33:17] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-09 02:33:17] [INFO ] After 41ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 02:33:17] [INFO ] After 73ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-09 02:33:17] [INFO ] After 210ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 9 ms.
Support contains 6 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 68/68 transitions.
Applied a total of 0 rules in 4 ms. Remains 74 /74 variables (removed 0) and now considering 68/68 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 74/74 places, 68/68 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 68/68 transitions.
Applied a total of 0 rules in 5 ms. Remains 74 /74 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2023-03-09 02:33:17] [INFO ] Invariant cache hit.
[2023-03-09 02:33:17] [INFO ] Implicit Places using invariants in 132 ms returned []
[2023-03-09 02:33:17] [INFO ] Invariant cache hit.
[2023-03-09 02:33:17] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-09 02:33:17] [INFO ] Implicit Places using invariants and state equation in 261 ms returned [41, 46, 64, 71]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 397 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 70/74 places, 68/68 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 70 transition count 66
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 68 transition count 66
Applied a total of 4 rules in 10 ms. Remains 68 /70 variables (removed 2) and now considering 66/68 (removed 2) transitions.
// Phase 1: matrix 66 rows 68 cols
[2023-03-09 02:33:17] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-09 02:33:18] [INFO ] Implicit Places using invariants in 134 ms returned []
[2023-03-09 02:33:18] [INFO ] Invariant cache hit.
[2023-03-09 02:33:18] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-09 02:33:18] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 68/74 places, 66/68 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 837 ms. Remains : 68/74 places, 66/68 transitions.
Incomplete random walk after 10000 steps, including 1274 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 962 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 849 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 479320 steps, run timeout after 3001 ms. (steps per millisecond=159 ) properties seen :{}
Probabilistic random walk after 479320 steps, saw 239746 distinct states, run finished after 3006 ms. (steps per millisecond=159 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-09 02:33:21] [INFO ] Invariant cache hit.
[2023-03-09 02:33:21] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 02:33:21] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 4 ms returned sat
[2023-03-09 02:33:21] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 02:33:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 02:33:21] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 5 ms returned sat
[2023-03-09 02:33:22] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 02:33:22] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-09 02:33:22] [INFO ] After 25ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 02:33:22] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-09 02:33:22] [INFO ] After 196ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 10 ms.
Support contains 6 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 66/66 transitions.
Applied a total of 0 rules in 4 ms. Remains 68 /68 variables (removed 0) and now considering 66/66 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 68/68 places, 66/66 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 66/66 transitions.
Applied a total of 0 rules in 2 ms. Remains 68 /68 variables (removed 0) and now considering 66/66 (removed 0) transitions.
[2023-03-09 02:33:22] [INFO ] Invariant cache hit.
[2023-03-09 02:33:22] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-09 02:33:22] [INFO ] Invariant cache hit.
[2023-03-09 02:33:22] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-09 02:33:22] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
[2023-03-09 02:33:22] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 02:33:22] [INFO ] Invariant cache hit.
[2023-03-09 02:33:22] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 369 ms. Remains : 68/68 places, 66/66 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 68 transition count 63
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 65 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 64 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 64 transition count 62
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 63 transition count 61
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 63 transition count 60
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 12 place count 62 transition count 60
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 62 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 61 transition count 59
Applied a total of 14 rules in 30 ms. Remains 61 /68 variables (removed 7) and now considering 59/66 (removed 7) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 59 rows 61 cols
[2023-03-09 02:33:22] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-09 02:33:22] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 02:33:22] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 5 ms returned sat
[2023-03-09 02:33:22] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 02:33:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 02:33:22] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 6 ms returned sat
[2023-03-09 02:33:22] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 02:33:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 02:33:22] [INFO ] After 19ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 02:33:22] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 0 ms to minimize.
[2023-03-09 02:33:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2023-03-09 02:33:22] [INFO ] After 106ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-09 02:33:22] [INFO ] After 267ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Successfully simplified 6 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA DoubleExponent-PT-003-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-09 02:33:22] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-09 02:33:22] [INFO ] Flatten gal took : 22 ms
[2023-03-09 02:33:22] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DoubleExponent-PT-003-CTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-CTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-09 02:33:22] [INFO ] Flatten gal took : 20 ms
[2023-03-09 02:33:23] [INFO ] Input system was already deterministic with 148 transitions.
Support contains 77 out of 158 places (down from 85) after GAL structural reductions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 261 edges and 158 vertex of which 156 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 148/148 transitions.
Applied a total of 0 rules in 4 ms. Remains 158 /158 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 158/158 places, 148/148 transitions.
[2023-03-09 02:33:23] [INFO ] Flatten gal took : 17 ms
[2023-03-09 02:33:23] [INFO ] Flatten gal took : 18 ms
[2023-03-09 02:33:23] [INFO ] Input system was already deterministic with 148 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 158/158 places, 148/148 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 157 transition count 111
Reduce places removed 36 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 37 rules applied. Total rules applied 73 place count 121 transition count 110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 120 transition count 110
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 74 place count 120 transition count 105
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 84 place count 115 transition count 105
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 124 place count 95 transition count 85
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 125 place count 94 transition count 84
Applied a total of 125 rules in 34 ms. Remains 94 /158 variables (removed 64) and now considering 84/148 (removed 64) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35 ms. Remains : 94/158 places, 84/148 transitions.
[2023-03-09 02:33:23] [INFO ] Flatten gal took : 11 ms
[2023-03-09 02:33:23] [INFO ] Flatten gal took : 11 ms
[2023-03-09 02:33:23] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 148/148 transitions.
Applied a total of 0 rules in 6 ms. Remains 158 /158 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 158/158 places, 148/148 transitions.
[2023-03-09 02:33:23] [INFO ] Flatten gal took : 17 ms
[2023-03-09 02:33:23] [INFO ] Flatten gal took : 18 ms
[2023-03-09 02:33:23] [INFO ] Input system was already deterministic with 148 transitions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 148/148 transitions.
Applied a total of 0 rules in 5 ms. Remains 158 /158 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 158/158 places, 148/148 transitions.
[2023-03-09 02:33:23] [INFO ] Flatten gal took : 16 ms
[2023-03-09 02:33:23] [INFO ] Flatten gal took : 17 ms
[2023-03-09 02:33:23] [INFO ] Input system was already deterministic with 148 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 158/158 places, 148/148 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 157 transition count 116
Reduce places removed 31 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 34 rules applied. Total rules applied 65 place count 126 transition count 113
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 68 place count 123 transition count 113
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 68 place count 123 transition count 106
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 82 place count 116 transition count 106
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 122 place count 96 transition count 86
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 125 place count 96 transition count 86
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 126 place count 95 transition count 85
Applied a total of 126 rules in 37 ms. Remains 95 /158 variables (removed 63) and now considering 85/148 (removed 63) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38 ms. Remains : 95/158 places, 85/148 transitions.
[2023-03-09 02:33:23] [INFO ] Flatten gal took : 9 ms
[2023-03-09 02:33:23] [INFO ] Flatten gal took : 11 ms
[2023-03-09 02:33:23] [INFO ] Input system was already deterministic with 85 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 158/158 places, 148/148 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 157 transition count 109
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 76 place count 119 transition count 109
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 76 place count 119 transition count 103
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 88 place count 113 transition count 103
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 130 place count 92 transition count 82
Applied a total of 130 rules in 23 ms. Remains 92 /158 variables (removed 66) and now considering 82/148 (removed 66) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 92/158 places, 82/148 transitions.
[2023-03-09 02:33:23] [INFO ] Flatten gal took : 9 ms
[2023-03-09 02:33:23] [INFO ] Flatten gal took : 9 ms
[2023-03-09 02:33:23] [INFO ] Input system was already deterministic with 82 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 158/158 places, 148/148 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 157 transition count 110
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 74 place count 120 transition count 110
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 74 place count 120 transition count 104
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 86 place count 114 transition count 104
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 130 place count 92 transition count 82
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 131 place count 91 transition count 81
Applied a total of 131 rules in 26 ms. Remains 91 /158 variables (removed 67) and now considering 81/148 (removed 67) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 91/158 places, 81/148 transitions.
[2023-03-09 02:33:23] [INFO ] Flatten gal took : 9 ms
[2023-03-09 02:33:23] [INFO ] Flatten gal took : 9 ms
[2023-03-09 02:33:23] [INFO ] Input system was already deterministic with 81 transitions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 148/148 transitions.
Applied a total of 0 rules in 5 ms. Remains 158 /158 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 158/158 places, 148/148 transitions.
[2023-03-09 02:33:23] [INFO ] Flatten gal took : 15 ms
[2023-03-09 02:33:23] [INFO ] Flatten gal took : 15 ms
[2023-03-09 02:33:23] [INFO ] Input system was already deterministic with 148 transitions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 148/148 transitions.
Applied a total of 0 rules in 5 ms. Remains 158 /158 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 158/158 places, 148/148 transitions.
[2023-03-09 02:33:23] [INFO ] Flatten gal took : 14 ms
[2023-03-09 02:33:23] [INFO ] Flatten gal took : 15 ms
[2023-03-09 02:33:23] [INFO ] Input system was already deterministic with 148 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 158/158 places, 148/148 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 157 transition count 110
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 74 place count 120 transition count 110
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 74 place count 120 transition count 104
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 86 place count 114 transition count 104
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 130 place count 92 transition count 82
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 131 place count 92 transition count 82
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 132 place count 91 transition count 81
Applied a total of 132 rules in 32 ms. Remains 91 /158 variables (removed 67) and now considering 81/148 (removed 67) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32 ms. Remains : 91/158 places, 81/148 transitions.
[2023-03-09 02:33:23] [INFO ] Flatten gal took : 8 ms
[2023-03-09 02:33:23] [INFO ] Flatten gal took : 9 ms
[2023-03-09 02:33:23] [INFO ] Input system was already deterministic with 81 transitions.
Finished random walk after 175 steps, including 18 resets, run visited all 1 properties in 1 ms. (steps per millisecond=175 )
FORMULA DoubleExponent-PT-003-CTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 148/148 transitions.
Applied a total of 0 rules in 5 ms. Remains 158 /158 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 158/158 places, 148/148 transitions.
[2023-03-09 02:33:23] [INFO ] Flatten gal took : 11 ms
[2023-03-09 02:33:23] [INFO ] Flatten gal took : 8 ms
[2023-03-09 02:33:23] [INFO ] Input system was already deterministic with 148 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 158/158 places, 148/148 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 157 transition count 109
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 76 place count 119 transition count 109
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 76 place count 119 transition count 103
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 88 place count 113 transition count 103
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 132 place count 91 transition count 81
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 133 place count 90 transition count 80
Applied a total of 133 rules in 13 ms. Remains 90 /158 variables (removed 68) and now considering 80/148 (removed 68) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 90/158 places, 80/148 transitions.
[2023-03-09 02:33:23] [INFO ] Flatten gal took : 5 ms
[2023-03-09 02:33:23] [INFO ] Flatten gal took : 5 ms
[2023-03-09 02:33:23] [INFO ] Input system was already deterministic with 80 transitions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 148/148 transitions.
Applied a total of 0 rules in 3 ms. Remains 158 /158 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 158/158 places, 148/148 transitions.
[2023-03-09 02:33:23] [INFO ] Flatten gal took : 8 ms
[2023-03-09 02:33:23] [INFO ] Flatten gal took : 8 ms
[2023-03-09 02:33:23] [INFO ] Input system was already deterministic with 148 transitions.
[2023-03-09 02:33:23] [INFO ] Flatten gal took : 7 ms
[2023-03-09 02:33:23] [INFO ] Flatten gal took : 8 ms
[2023-03-09 02:33:23] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-09 02:33:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 158 places, 148 transitions and 410 arcs took 2 ms.
Total runtime 30947 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DoubleExponent-PT-003
BK_EXAMINATION: CTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
CTLFireability

FORMULA DoubleExponent-PT-003-CTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-003-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-003-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-003-CTLFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-003-CTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-003-CTLFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-003-CTLFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-003-CTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-003-CTLFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-003-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-003-CTLFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-003-CTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678329256615

--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/CTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:553
lola: rewrite Frontend/Parser/formula_rewrite.k:553
lola: rewrite Frontend/Parser/formula_rewrite.k:475
lola: rewrite Frontend/Parser/formula_rewrite.k:478
lola: rewrite Frontend/Parser/formula_rewrite.k:317
lola: rewrite Frontend/Parser/formula_rewrite.k:322
lola: rewrite Frontend/Parser/formula_rewrite.k:328
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:314
lola: rewrite Frontend/Parser/formula_rewrite.k:322
lola: rewrite Frontend/Parser/formula_rewrite.k:328
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:322
lola: rewrite Frontend/Parser/formula_rewrite.k:331
lola: rewrite Frontend/Parser/formula_rewrite.k:322
lola: rewrite Frontend/Parser/formula_rewrite.k:328
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:250
lola: rewrite Frontend/Parser/formula_rewrite.k:322
lola: rewrite Frontend/Parser/formula_rewrite.k:328
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:322
lola: rewrite Frontend/Parser/formula_rewrite.k:334
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:250
lola: rewrite Frontend/Parser/formula_rewrite.k:322
lola: rewrite Frontend/Parser/formula_rewrite.k:337
lola: rewrite Frontend/Parser/formula_rewrite.k:317
lola: rewrite Frontend/Parser/formula_rewrite.k:314
lola: rewrite Frontend/Parser/formula_rewrite.k:325
lola: rewrite Frontend/Parser/formula_rewrite.k:331
lola: rewrite Frontend/Parser/formula_rewrite.k:299
lola: rewrite Frontend/Parser/formula_rewrite.k:314
lola: rewrite Frontend/Parser/formula_rewrite.k:317
lola: rewrite Frontend/Parser/formula_rewrite.k:325
lola: rewrite Frontend/Parser/formula_rewrite.k:331
lola: rewrite Frontend/Parser/formula_rewrite.k:299
lola: rewrite Frontend/Parser/formula_rewrite.k:325
lola: rewrite Frontend/Parser/formula_rewrite.k:328
lola: rewrite Frontend/Parser/formula_rewrite.k:325
lola: rewrite Frontend/Parser/formula_rewrite.k:331
lola: rewrite Frontend/Parser/formula_rewrite.k:299
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:322
lola: rewrite Frontend/Parser/formula_rewrite.k:337
lola: rewrite Frontend/Parser/formula_rewrite.k:317
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:325
lola: rewrite Frontend/Parser/formula_rewrite.k:331
lola: rewrite Frontend/Parser/formula_rewrite.k:299
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:314
lola: rewrite Frontend/Parser/formula_rewrite.k:325
lola: rewrite Frontend/Parser/formula_rewrite.k:328
lola: rewrite Frontend/Parser/formula_rewrite.k:325
lola: rewrite Frontend/Parser/formula_rewrite.k:334
lola: rewrite Frontend/Parser/formula_rewrite.k:299
lola: rewrite Frontend/Parser/formula_rewrite.k:317
lola: rewrite Frontend/Parser/formula_rewrite.k:314
lola: rewrite Frontend/Parser/formula_rewrite.k:325
lola: rewrite Frontend/Parser/formula_rewrite.k:328
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:325
lola: rewrite Frontend/Parser/formula_rewrite.k:334
lola: rewrite Frontend/Parser/formula_rewrite.k:325
lola: rewrite Frontend/Parser/formula_rewrite.k:337
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:314
lola: rewrite Frontend/Parser/formula_rewrite.k:322
lola: rewrite Frontend/Parser/formula_rewrite.k:337
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:314
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: RELEASE
lola: RELEASE
lola: RELEASE
lola: RELEASE
lola: rewrite Frontend/Parser/formula_rewrite.k:314
lola: rewrite Frontend/Parser/formula_rewrite.k:325
lola: rewrite Frontend/Parser/formula_rewrite.k:337
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:472
lola: RELEASE
lola: rewrite Frontend/Parser/formula_rewrite.k:314
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:314
lola: rewrite Frontend/Parser/formula_rewrite.k:322
lola: rewrite Frontend/Parser/formula_rewrite.k:328
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:322
lola: rewrite Frontend/Parser/formula_rewrite.k:331
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:317
lola: rewrite Frontend/Parser/formula_rewrite.k:325
lola: rewrite Frontend/Parser/formula_rewrite.k:328
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:322
lola: rewrite Frontend/Parser/formula_rewrite.k:337
lola: rewrite Frontend/Parser/formula_rewrite.k:322
lola: rewrite Frontend/Parser/formula_rewrite.k:331
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:325
lola: rewrite Frontend/Parser/formula_rewrite.k:337
lola: rewrite Frontend/Parser/formula_rewrite.k:325
lola: rewrite Frontend/Parser/formula_rewrite.k:337
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:317
lola: rewrite Frontend/Parser/formula_rewrite.k:299
lola: rewrite Frontend/Parser/formula_rewrite.k:317
lola: rewrite Frontend/Parser/formula_rewrite.k:325
lola: rewrite Frontend/Parser/formula_rewrite.k:331
lola: rewrite Frontend/Parser/formula_rewrite.k:299
lola: rewrite Frontend/Parser/formula_rewrite.k:325
lola: rewrite Frontend/Parser/formula_rewrite.k:328
lola: rewrite Frontend/Parser/formula_rewrite.k:299
lola: rewrite Frontend/Parser/formula_rewrite.k:314
lola: rewrite Frontend/Parser/formula_rewrite.k:325
lola: rewrite Frontend/Parser/formula_rewrite.k:334
lola: rewrite Frontend/Parser/formula_rewrite.k:325
lola: rewrite Frontend/Parser/formula_rewrite.k:331
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:314
lola: rewrite Frontend/Parser/formula_rewrite.k:322
lola: rewrite Frontend/Parser/formula_rewrite.k:331
lola: rewrite Frontend/Parser/formula_rewrite.k:299
lola: rewrite Frontend/Parser/formula_rewrite.k:325
lola: rewrite Frontend/Parser/formula_rewrite.k:340
lola: rewrite Frontend/Parser/formula_rewrite.k:325
lola: rewrite Frontend/Parser/formula_rewrite.k:328
lola: rewrite Frontend/Parser/formula_rewrite.k:299
lola: rewrite Frontend/Parser/formula_rewrite.k:299
lola: RELEASE
lola: RELEASE
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: LAUNCH task # 4 (type EXCL) for 3 DoubleExponent-PT-003-CTLFireability-01
lola: time limit : 240 sec
lola: memory limit: 32 pages
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:815
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:815
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:815
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:810
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:815
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:810
lola: rewrite Frontend/Parser/formula_rewrite.k:810
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: FINISHED task # 4 (type EXCL) for DoubleExponent-PT-003-CTLFireability-01
lola: result : false
lola: markings : 1633765
lola: fired transitions : 3270117
lola: time used : 5.000000
lola: memory pages used : 8
lola: LAUNCH task # 34 (type EXCL) for 33 DoubleExponent-PT-003-CTLFireability-15
lola: time limit : 326 sec
lola: memory limit: 32 pages
lola: FINISHED task # 34 (type EXCL) for DoubleExponent-PT-003-CTLFireability-15
lola: result : false
lola: markings : 162
lola: fired transitions : 223
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 28 (type EXCL) for 27 DoubleExponent-PT-003-CTLFireability-11
lola: time limit : 359 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-003-CTLFireability-01: CTL false CTL model checker
DoubleExponent-PT-003-CTLFireability-15: CTL false CTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-003-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-02: CTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-04: CTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-05: CTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-06: AFAG 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-07: CTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-08: CTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-11: CTL 0 0 1 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-13: EG 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
28 CTL EXCL 0/359 1/32 DoubleExponent-PT-003-CTLFireability-11 2804 m, 560 m/sec, 17083 t fired, .

Time elapsed: 5 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 12
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-003-CTLFireability-01: CTL false CTL model checker
DoubleExponent-PT-003-CTLFireability-15: CTL false CTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-003-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-02: CTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-04: CTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-05: CTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-06: AFAG 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-07: CTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-08: CTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-11: CTL 0 0 1 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-13: EG 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
28 CTL EXCL 5/359 3/32 DoubleExponent-PT-003-CTLFireability-11 412801 m, 81999 m/sec, 2500969 t fired, .

Time elapsed: 10 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 12
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-003-CTLFireability-01: CTL false CTL model checker
DoubleExponent-PT-003-CTLFireability-15: CTL false CTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-003-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-02: CTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-04: CTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-05: CTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-06: AFAG 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-07: CTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-08: CTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-11: CTL 0 0 1 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-13: EG 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
28 CTL EXCL 10/359 5/32 DoubleExponent-PT-003-CTLFireability-11 852222 m, 87884 m/sec, 5163315 t fired, .

Time elapsed: 15 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 12
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-003-CTLFireability-01: CTL false CTL model checker
DoubleExponent-PT-003-CTLFireability-15: CTL false CTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-003-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-02: CTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-04: CTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-05: CTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-06: AFAG 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-07: CTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-08: CTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-11: CTL 0 0 1 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-13: EG 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
28 CTL EXCL 15/359 7/32 DoubleExponent-PT-003-CTLFireability-11 1289382 m, 87432 m/sec, 7811822 t fired, .

Time elapsed: 20 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 12
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-003-CTLFireability-01: CTL false CTL model checker
DoubleExponent-PT-003-CTLFireability-15: CTL false CTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-003-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-02: CTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-04: CTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-05: CTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-06: AFAG 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-07: CTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-08: CTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-11: CTL 0 0 1 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-13: EG 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
28 CTL EXCL 20/359 10/32 DoubleExponent-PT-003-CTLFireability-11 1694014 m, 80926 m/sec, 10262976 t fired, .

Time elapsed: 25 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 12
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-003-CTLFireability-01: CTL false CTL model checker
DoubleExponent-PT-003-CTLFireability-15: CTL false CTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-003-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-02: CTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-04: CTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-05: CTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-06: AFAG 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-07: CTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-08: CTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-11: CTL 0 0 1 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-13: EG 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
28 CTL EXCL 25/359 12/32 DoubleExponent-PT-003-CTLFireability-11 2133161 m, 87829 m/sec, 12923599 t fired, .

Time elapsed: 30 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 12
lola: FINISHED task # 28 (type EXCL) for DoubleExponent-PT-003-CTLFireability-11
lola: result : true
lola: markings : 2385072
lola: fired transitions : 14448178
lola: time used : 28.000000
lola: memory pages used : 13
lola: LAUNCH task # 25 (type EXCL) for 24 DoubleExponent-PT-003-CTLFireability-08
lola: time limit : 396 sec
lola: memory limit: 32 pages
lola: FINISHED task # 25 (type EXCL) for DoubleExponent-PT-003-CTLFireability-08
lola: result : true
lola: markings : 186
lola: fired transitions : 191
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 22 (type EXCL) for 21 DoubleExponent-PT-003-CTLFireability-07
lola: time limit : 445 sec
lola: memory limit: 32 pages
lola: FINISHED task # 22 (type EXCL) for DoubleExponent-PT-003-CTLFireability-07
lola: result : false
lola: markings : 25
lola: fired transitions : 49
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 10 (type EXCL) for 9 DoubleExponent-PT-003-CTLFireability-03
lola: time limit : 509 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-003-CTLFireability-01: CTL false CTL model checker
DoubleExponent-PT-003-CTLFireability-07: CTL false CTL model checker
DoubleExponent-PT-003-CTLFireability-08: CTL true CTL model checker
DoubleExponent-PT-003-CTLFireability-11: CTL true CTL model checker
DoubleExponent-PT-003-CTLFireability-15: CTL false CTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-003-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-02: CTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-03: CTL 0 0 1 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-04: CTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-05: CTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-06: AFAG 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-13: EG 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 CTL EXCL 2/509 2/32 DoubleExponent-PT-003-CTLFireability-03 342689 m, 68537 m/sec, 991276 t fired, .

Time elapsed: 35 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 12
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-003-CTLFireability-01: CTL false CTL model checker
DoubleExponent-PT-003-CTLFireability-07: CTL false CTL model checker
DoubleExponent-PT-003-CTLFireability-08: CTL true CTL model checker
DoubleExponent-PT-003-CTLFireability-11: CTL true CTL model checker
DoubleExponent-PT-003-CTLFireability-15: CTL false CTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-003-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-02: CTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-03: CTL 0 0 1 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-04: CTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-05: CTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-06: AFAG 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-13: EG 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 CTL EXCL 7/509 7/32 DoubleExponent-PT-003-CTLFireability-03 1237782 m, 179018 m/sec, 3580698 t fired, .

Time elapsed: 40 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 12
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-003-CTLFireability-01: CTL false CTL model checker
DoubleExponent-PT-003-CTLFireability-07: CTL false CTL model checker
DoubleExponent-PT-003-CTLFireability-08: CTL true CTL model checker
DoubleExponent-PT-003-CTLFireability-11: CTL true CTL model checker
DoubleExponent-PT-003-CTLFireability-15: CTL false CTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-003-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-02: CTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-03: CTL 0 0 1 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-04: CTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-05: CTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-06: AFAG 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-13: EG 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 CTL EXCL 12/509 12/32 DoubleExponent-PT-003-CTLFireability-03 2133584 m, 179160 m/sec, 6172087 t fired, .

Time elapsed: 45 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 12
lola: FINISHED task # 10 (type EXCL) for DoubleExponent-PT-003-CTLFireability-03
lola: result : true
lola: markings : 2385070
lola: fired transitions : 6899117
lola: time used : 13.000000
lola: memory pages used : 13
lola: LAUNCH task # 7 (type EXCL) for 6 DoubleExponent-PT-003-CTLFireability-02
lola: time limit : 592 sec
lola: memory limit: 32 pages
lola: FINISHED task # 7 (type EXCL) for DoubleExponent-PT-003-CTLFireability-02
lola: result : true
lola: markings : 25
lola: fired transitions : 33
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 DoubleExponent-PT-003-CTLFireability-00
lola: time limit : 710 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for DoubleExponent-PT-003-CTLFireability-00
lola: result : false
lola: markings : 5887
lola: fired transitions : 6049
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 19 (type EXCL) for 18 DoubleExponent-PT-003-CTLFireability-06
lola: time limit : 888 sec
lola: memory limit: 32 pages
lola: FINISHED task # 19 (type EXCL) for DoubleExponent-PT-003-CTLFireability-06
lola: result : true
lola: markings : 1407343
lola: fired transitions : 1427275
lola: time used : 3.000000
lola: memory pages used : 7
lola: LAUNCH task # 31 (type EXCL) for 30 DoubleExponent-PT-003-CTLFireability-13
lola: time limit : 1183 sec
lola: memory limit: 32 pages
lola: FINISHED task # 31 (type EXCL) for DoubleExponent-PT-003-CTLFireability-13
lola: result : true
lola: markings : 8
lola: fired transitions : 7
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 16 (type EXCL) for 15 DoubleExponent-PT-003-CTLFireability-05
lola: time limit : 1775 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-003-CTLFireability-00: CTL false CTL model checker
DoubleExponent-PT-003-CTLFireability-01: CTL false CTL model checker
DoubleExponent-PT-003-CTLFireability-02: CTL true CTL model checker
DoubleExponent-PT-003-CTLFireability-03: CTL true CTL model checker
DoubleExponent-PT-003-CTLFireability-06: AFAG true CTL model checker
DoubleExponent-PT-003-CTLFireability-07: CTL false CTL model checker
DoubleExponent-PT-003-CTLFireability-08: CTL true CTL model checker
DoubleExponent-PT-003-CTLFireability-11: CTL true CTL model checker
DoubleExponent-PT-003-CTLFireability-13: EG true state space / EG
DoubleExponent-PT-003-CTLFireability-15: CTL false CTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-003-CTLFireability-04: CTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-003-CTLFireability-05: CTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
16 CTL EXCL 1/1775 4/32 DoubleExponent-PT-003-CTLFireability-05 683159 m, 136631 m/sec, 683164 t fired, .

Time elapsed: 50 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 12
lola: FINISHED task # 16 (type EXCL) for DoubleExponent-PT-003-CTLFireability-05
lola: result : true
lola: markings : 1407329
lola: fired transitions : 1407358
lola: time used : 2.000000
lola: memory pages used : 7
lola: LAUNCH task # 13 (type EXCL) for 12 DoubleExponent-PT-003-CTLFireability-04
lola: time limit : 3549 sec
lola: memory limit: 32 pages
lola: FINISHED task # 13 (type EXCL) for DoubleExponent-PT-003-CTLFireability-04
lola: result : false
lola: markings : 80
lola: fired transitions : 90
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-003-CTLFireability-00: CTL false CTL model checker
DoubleExponent-PT-003-CTLFireability-01: CTL false CTL model checker
DoubleExponent-PT-003-CTLFireability-02: CTL true CTL model checker
DoubleExponent-PT-003-CTLFireability-03: CTL true CTL model checker
DoubleExponent-PT-003-CTLFireability-04: CTL false CTL model checker
DoubleExponent-PT-003-CTLFireability-05: CTL true CTL model checker
DoubleExponent-PT-003-CTLFireability-06: AFAG true CTL model checker
DoubleExponent-PT-003-CTLFireability-07: CTL false CTL model checker
DoubleExponent-PT-003-CTLFireability-08: CTL true CTL model checker
DoubleExponent-PT-003-CTLFireability-11: CTL true CTL model checker
DoubleExponent-PT-003-CTLFireability-13: EG true state space / EG
DoubleExponent-PT-003-CTLFireability-15: CTL false CTL model checker


Time elapsed: 51 secs. Pages in use: 13

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-003"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is DoubleExponent-PT-003, 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 r135-smll-167819414400458"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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