About the Execution of ITS-LoLa for PolyORBLF-PT-S02J04T08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15740.150 | 3600000.00 | 3721452.00 | 578.00 | FFT?TTF??FTFFTTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2020-input.r176-tajo-158987871800420.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is PolyORBLF-PT-S02J04T08, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987871800420
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 8.1K Apr 12 05:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 12 05:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 11 04:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 11 04:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.7K Apr 14 12:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 36K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 14 12:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 28K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 10 12:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 31K Apr 10 12:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 9 17:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 9 17:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 10 22:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.1K Apr 10 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 1.2M Mar 24 05:37 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 PolyORBLF-PT-S02J04T08-CTLFireability-00
FORMULA_NAME PolyORBLF-PT-S02J04T08-CTLFireability-01
FORMULA_NAME PolyORBLF-PT-S02J04T08-CTLFireability-02
FORMULA_NAME PolyORBLF-PT-S02J04T08-CTLFireability-03
FORMULA_NAME PolyORBLF-PT-S02J04T08-CTLFireability-04
FORMULA_NAME PolyORBLF-PT-S02J04T08-CTLFireability-05
FORMULA_NAME PolyORBLF-PT-S02J04T08-CTLFireability-06
FORMULA_NAME PolyORBLF-PT-S02J04T08-CTLFireability-07
FORMULA_NAME PolyORBLF-PT-S02J04T08-CTLFireability-08
FORMULA_NAME PolyORBLF-PT-S02J04T08-CTLFireability-09
FORMULA_NAME PolyORBLF-PT-S02J04T08-CTLFireability-10
FORMULA_NAME PolyORBLF-PT-S02J04T08-CTLFireability-11
FORMULA_NAME PolyORBLF-PT-S02J04T08-CTLFireability-12
FORMULA_NAME PolyORBLF-PT-S02J04T08-CTLFireability-13
FORMULA_NAME PolyORBLF-PT-S02J04T08-CTLFireability-14
FORMULA_NAME PolyORBLF-PT-S02J04T08-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1591152106543
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 02:41:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 02:41:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 02:41:48] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2020-06-03 02:41:48] [INFO ] Transformed 614 places.
[2020-06-03 02:41:48] [INFO ] Transformed 1242 transitions.
[2020-06-03 02:41:48] [INFO ] Parsed PT model containing 614 places and 1242 transitions in 144 ms.
[2020-06-03 02:41:48] [INFO ] Reduced 32 identical enabling conditions.
[2020-06-03 02:41:48] [INFO ] Reduced 8 identical enabling conditions.
[2020-06-03 02:41:48] [INFO ] Reduced 88 identical enabling conditions.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 51 ms.
Incomplete random walk after 100000 steps, including 19 resets, run finished after 1508 ms. (steps per millisecond=66 ) properties seen :[0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1]
[2020-06-03 02:41:49] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
// Phase 1: matrix 1098 rows 614 cols
[2020-06-03 02:41:49] [INFO ] Computed 50 place invariants in 90 ms
[2020-06-03 02:41:50] [INFO ] [Real]Absence check using 16 positive place invariants in 40 ms returned sat
[2020-06-03 02:41:50] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 27 ms returned unsat
[2020-06-03 02:41:50] [INFO ] [Real]Absence check using 16 positive place invariants in 20 ms returned sat
[2020-06-03 02:41:50] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 49 ms returned sat
[2020-06-03 02:41:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:41:52] [INFO ] [Real]Absence check using state equation in 2526 ms returned sat
[2020-06-03 02:41:52] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:41:52] [INFO ] [Nat]Absence check using 16 positive place invariants in 28 ms returned sat
[2020-06-03 02:41:53] [INFO ] [Nat]Absence check using 16 positive and 34 generalized place invariants in 51 ms returned sat
[2020-06-03 02:41:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:42:00] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 02:42:03] [INFO ] [Nat]Absence check using state equation in 10482 ms returned unknown
[2020-06-03 02:42:03] [INFO ] [Real]Absence check using 16 positive place invariants in 24 ms returned sat
[2020-06-03 02:42:03] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 43 ms returned unsat
[2020-06-03 02:42:03] [INFO ] [Real]Absence check using 16 positive place invariants in 20 ms returned sat
[2020-06-03 02:42:03] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 37 ms returned unsat
[2020-06-03 02:42:03] [INFO ] [Real]Absence check using 16 positive place invariants in 23 ms returned sat
[2020-06-03 02:42:03] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 39 ms returned unsat
[2020-06-03 02:42:04] [INFO ] [Real]Absence check using 16 positive place invariants in 19 ms returned sat
[2020-06-03 02:42:04] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 25 ms returned unsat
[2020-06-03 02:42:04] [INFO ] [Real]Absence check using 16 positive place invariants in 16 ms returned sat
[2020-06-03 02:42:04] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 21 ms returned unsat
[2020-06-03 02:42:04] [INFO ] [Real]Absence check using 16 positive place invariants in 24 ms returned sat
[2020-06-03 02:42:04] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 28 ms returned unsat
[2020-06-03 02:42:04] [INFO ] [Real]Absence check using 16 positive place invariants in 20 ms returned sat
[2020-06-03 02:42:04] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 29 ms returned unsat
[2020-06-03 02:42:04] [INFO ] [Real]Absence check using 16 positive place invariants in 24 ms returned sat
[2020-06-03 02:42:04] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 27 ms returned unsat
[2020-06-03 02:42:04] [INFO ] [Real]Absence check using 16 positive place invariants in 25 ms returned sat
[2020-06-03 02:42:04] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 40 ms returned unsat
[2020-06-03 02:42:04] [INFO ] [Real]Absence check using 16 positive place invariants in 20 ms returned sat
[2020-06-03 02:42:04] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 26 ms returned unsat
[2020-06-03 02:42:04] [INFO ] [Real]Absence check using 16 positive place invariants in 24 ms returned sat
[2020-06-03 02:42:04] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 38 ms returned unsat
[2020-06-03 02:42:05] [INFO ] [Real]Absence check using 16 positive place invariants in 21 ms returned sat
[2020-06-03 02:42:05] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 33 ms returned unsat
[2020-06-03 02:42:05] [INFO ] [Real]Absence check using 16 positive place invariants in 24 ms returned sat
[2020-06-03 02:42:05] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 40 ms returned unsat
[2020-06-03 02:42:05] [INFO ] [Real]Absence check using 16 positive place invariants in 24 ms returned sat
[2020-06-03 02:42:05] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 26 ms returned unsat
[2020-06-03 02:42:05] [INFO ] [Real]Absence check using 16 positive place invariants in 24 ms returned sat
[2020-06-03 02:42:05] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 30 ms returned unsat
[2020-06-03 02:42:05] [INFO ] [Real]Absence check using 16 positive place invariants in 21 ms returned sat
[2020-06-03 02:42:05] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 38 ms returned unsat
[2020-06-03 02:42:05] [INFO ] [Real]Absence check using 16 positive place invariants in 22 ms returned sat
[2020-06-03 02:42:05] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 35 ms returned unsat
[2020-06-03 02:42:05] [INFO ] [Real]Absence check using 16 positive place invariants in 25 ms returned sat
[2020-06-03 02:42:05] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 42 ms returned unsat
[2020-06-03 02:42:06] [INFO ] [Real]Absence check using 16 positive place invariants in 20 ms returned sat
[2020-06-03 02:42:06] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 37 ms returned unsat
[2020-06-03 02:42:06] [INFO ] [Real]Absence check using 16 positive place invariants in 23 ms returned sat
[2020-06-03 02:42:06] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 38 ms returned unsat
[2020-06-03 02:42:06] [INFO ] [Real]Absence check using 16 positive place invariants in 20 ms returned sat
[2020-06-03 02:42:06] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 39 ms returned unsat
[2020-06-03 02:42:06] [INFO ] [Real]Absence check using 16 positive place invariants in 19 ms returned sat
[2020-06-03 02:42:06] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 37 ms returned unsat
[2020-06-03 02:42:06] [INFO ] [Real]Absence check using 16 positive place invariants in 20 ms returned sat
[2020-06-03 02:42:06] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 26 ms returned unsat
[2020-06-03 02:42:06] [INFO ] [Real]Absence check using 16 positive place invariants in 19 ms returned sat
[2020-06-03 02:42:06] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 25 ms returned unsat
[2020-06-03 02:42:06] [INFO ] [Real]Absence check using 16 positive place invariants in 24 ms returned sat
[2020-06-03 02:42:06] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 28 ms returned unsat
[2020-06-03 02:42:06] [INFO ] [Real]Absence check using 16 positive place invariants in 24 ms returned sat
[2020-06-03 02:42:06] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 41 ms returned unsat
[2020-06-03 02:42:07] [INFO ] [Real]Absence check using 16 positive place invariants in 24 ms returned sat
[2020-06-03 02:42:07] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 40 ms returned unsat
[2020-06-03 02:42:07] [INFO ] [Real]Absence check using 16 positive place invariants in 18 ms returned sat
[2020-06-03 02:42:07] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 24 ms returned unsat
[2020-06-03 02:42:07] [INFO ] [Real]Absence check using 16 positive place invariants in 23 ms returned sat
[2020-06-03 02:42:07] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 48 ms returned unsat
[2020-06-03 02:42:07] [INFO ] [Real]Absence check using 16 positive place invariants in 20 ms returned sat
[2020-06-03 02:42:07] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 36 ms returned unsat
[2020-06-03 02:42:07] [INFO ] [Real]Absence check using 16 positive place invariants in 25 ms returned sat
[2020-06-03 02:42:07] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 28 ms returned unsat
[2020-06-03 02:42:07] [INFO ] [Real]Absence check using 16 positive place invariants in 24 ms returned sat
[2020-06-03 02:42:07] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 29 ms returned unsat
[2020-06-03 02:42:07] [INFO ] [Real]Absence check using 16 positive place invariants in 26 ms returned sat
[2020-06-03 02:42:07] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 17 ms returned unsat
[2020-06-03 02:42:07] [INFO ] [Real]Absence check using 16 positive place invariants in 18 ms returned unsat
[2020-06-03 02:42:08] [INFO ] [Real]Absence check using 16 positive place invariants in 58 ms returned unsat
[2020-06-03 02:42:08] [INFO ] [Real]Absence check using 16 positive place invariants in 27 ms returned sat
[2020-06-03 02:42:08] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 50 ms returned unsat
[2020-06-03 02:42:08] [INFO ] [Real]Absence check using 16 positive place invariants in 19 ms returned sat
[2020-06-03 02:42:08] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 37 ms returned unsat
[2020-06-03 02:42:08] [INFO ] [Real]Absence check using 16 positive place invariants in 23 ms returned sat
[2020-06-03 02:42:08] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 13 ms returned unsat
[2020-06-03 02:42:08] [INFO ] [Real]Absence check using 16 positive place invariants in 23 ms returned sat
[2020-06-03 02:42:08] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 28 ms returned unsat
[2020-06-03 02:42:08] [INFO ] [Real]Absence check using 16 positive place invariants in 22 ms returned sat
[2020-06-03 02:42:08] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 65 ms returned unsat
[2020-06-03 02:42:08] [INFO ] [Real]Absence check using 16 positive place invariants in 22 ms returned sat
[2020-06-03 02:42:08] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 41 ms returned unsat
[2020-06-03 02:42:09] [INFO ] [Real]Absence check using 16 positive place invariants in 13 ms returned unsat
Successfully simplified 43 atomic propositions for a total of 43 simplifications.
[2020-06-03 02:42:09] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-03 02:42:09] [INFO ] Flatten gal took : 196 ms
[2020-06-03 02:42:09] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-03 02:42:09] [INFO ] Flatten gal took : 89 ms
FORMULA PolyORBLF-PT-S02J04T08-CTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T08-CTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T08-CTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 02:42:09] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 10 ms.
[2020-06-03 02:42:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 14 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ PolyORBLF-PT-S02J04T08 @ 3570 seconds
check_solution: Variable C4 = -0.280831964343 is below its lower bound 0
check_solution: Variable C314 = -0.428495067654 is below its lower bound 0
check_solution: Variable C623 = -0.493578672409 is below its lower bound 0
check_solution: Variable C624 = -0.137410311453 is below its lower bound 0
check_solution: Variable C933 = -0.885342597962 is below its lower bound 0
check_solution: Variable C934 = -0.934077467223 is below its lower bound 0
check_solution: Variable C1243 = -0.0817571878434 is below its lower bound 0
check_solution: Variable C1244 = -0.116640318308 is below its lower bound 0
check_solution: Constraint R19 = 3.15540774205e-311 is above its equality of -1
check_solution: Constraint R51 = 1.52147098305e-311 is above its equality of -1
Seriously low accuracy found ||*|| = 10 (rel. error 12.2313)
check_solution: Variable C1417 = -0.34375 is below its lower bound 0
check_solution: Constraint R19 = 4.0721099237e-311 is above its equality of -1
check_solution: Constraint R51 = 1.30927140367e-311 is above its equality of -1
check_solution: Constraint R92 = 3.80473845422e-311 is above its equality of -1
check_solution: Constraint R116 = 4.30340746462e-311 is above its equality of -1
check_solution: Constraint R139 = 3.5373669842e-311 is above its equality of -1
check_solution: Constraint R156 = 3.97662011311e-311 is above its equality of -1
check_solution: Constraint R164 = 3.68166269816e-311 is above its equality of -1
check_solution: Constraint R199 = 4.9209082401e-311 is above its equality of -1
check_solution: Constraint R324 = 4.67051273683e-311 is above its equality of -1
Seriously low accuracy found ||*|| = 10 (rel. error 2.90909)
check_solution: Variable C1409 = -1 is below its lower bound 0
check_solution: Variable C1415 = -0.881917103688 is below its lower bound 0
check_solution: Constraint R19 = 1.13102375682e-311 is above its equality of -1
check_solution: Constraint R51 = 6.83282644987e-312 is above its equality of -1
check_solution: Constraint R92 = 3.81959242401e-312 is above its equality of -1
check_solution: Constraint R116 = 7.7877245538e-312 is above its equality of -1
check_solution: Constraint R139 = 1.29441743277e-311 is above its equality of -1
check_solution: Constraint R156 = 8.70018274488e-313 is above its equality of -1
check_solution: Constraint R164 = 5.8142684684e-312 is above its equality of -1
check_solution: Constraint R199 = 1.14799972301e-311 is above its equality of -1
Seriously low accuracy found ||*|| = 10 (rel. error 1.06789)
check_solution: Variable C1118 = -5 is below its lower bound 0
check_solution: Variable C1119 = -1 is below its lower bound 0
check_solution: Variable C1120 = -2 is below its lower bound 0
check_solution: Variable C1123 = -3 is below its lower bound 0
check_solution: Variable C1124 = -10 is below its lower bound 0
check_solution: Variable C1125 = -70 is below its lower bound 0
check_solution: Variable C1126 = -19 is below its lower bound 0
check_solution: Variable C1127 = -50 is below its lower bound 0
check_solution: Variable C1128 = -9 is below its lower bound 0
check_solution: Variable C1129 = -15 is below its lower bound 0
Seriously low accuracy found ||*|| = 1210 (rel. error 1210)
check_solution: Variable C3 = -0.82523330854 is below its lower bound 0
check_solution: Variable C63 = -0.0652838852285 is below its lower bound 0
check_solution: Variable C75 = -0.26443312682 is below its lower bound 0
check_solution: Variable C82 = -0.222742422503 is below its lower bound 0
check_solution: Variable C92 = -0.0737025052964 is below its lower bound 0
check_solution: Variable C100 = -0.505212703274 is below its lower bound 0
check_solution: Variable C107 = -0.0776164767599 is below its lower bound 0
check_solution: Variable C123 = -0.631778507464 is below its lower bound 0
check_solution: Variable C126 = -0.236899066689 is below its lower bound 0
check_solution: Variable C134 = -0.0245426707399 is below its lower bound 0
Seriously low accuracy found ||*|| = 10 (rel. error 28.4633)
FORMULA PolyORBLF-PT-S02J04T08-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S02J04T08-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S02J04T08-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S02J04T08-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S02J04T08-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S02J04T08-CTLFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S02J04T08-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S02J04T08-CTLFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S02J04T08-CTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S02J04T08-CTLFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 0
rslt: Output for CTLFireability @ PolyORBLF-PT-S02J04T08
{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=CTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 02:42:09 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 25
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 179
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 28
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 28
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "AX(EG(((p208 <= 0) OR (p231 <= 0) OR (p519 <= 0))))",
"processed_size": 53,
"rewrites": 181
},
"net":
{
"conflict_clusters": 243,
"singleton_clusters": 0
},
"result":
{
"edges": 1250,
"markings": 1249,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 30
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((1 <= p130) AND (1 <= p211) AND (1 <= p248))",
"processed_size": 45,
"rewrites": 182
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /EXEG",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 50
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 30
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 30
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((1 <= p55) OR (p538 <= 0) OR (p612 <= 0))",
"processed_size": 44,
"rewrites": 179
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 33
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p53)",
"processed_size": 10,
"rewrites": 179
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 37
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((1 <= p161) AND (1 <= p193) AND (1 <= p245) AND (1 <= p399) AND (1 <= p544))",
"processed_size": 77,
"rewrites": 179
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 41
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((p309 <= 0) OR (p566 <= 0))",
"processed_size": 29,
"rewrites": 182
},
"result":
{
"edges": 303,
"markings": 303,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 65
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 33
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "EF(AX(EG((2 <= p141))))",
"processed_size": 23,
"rewrites": 182
},
"net":
{
"conflict_clusters": 243,
"singleton_clusters": 0
},
"result":
{
"edges": 119609,
"markings": 58423,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 37
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F ((1 <= p285)))",
"processed_size": 19,
"rewrites": 180
},
"result":
{
"edges": 45,
"markings": 46,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 41
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 2,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "EG((AG(((1 <= p52) AND (1 <= p134) AND (1 <= p208))) OR DEADLOCK))",
"processed_size": 66,
"rewrites": 181
},
"net":
{
"conflict_clusters": 243,
"singleton_clusters": 0
},
"result":
{
"edges": 1,
"markings": 1,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 48
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "E(AF((((1 <= p51) AND (1 <= p570)) OR ((1 <= p192) AND (1 <= p253)))) U ((1 <= p91) AND (1 <= p220) AND (1 <= p555)))",
"processed_size": 118,
"rewrites": 181
},
"net":
{
"conflict_clusters": 243,
"singleton_clusters": 0
},
"result":
{
"edges": 87060,
"markings": 51888,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 58
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 8,
"aneg": 0,
"comp": 24,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 24,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 17,
"visible_transitions": 0
},
"processed": "EG((EF((((p112 <= 0) OR (p602 <= 0)) AND ((p112 <= 0) OR (p147 <= 0)) AND ((p33 <= 0) OR (p112 <= 0)) AND ((p112 <= 0) OR (p316 <= 0)) AND ((p112 <= 0) OR (p249 <= 0)) AND ((p42 <= 0) OR (p112 <= 0)) AND ((p112 <= 0) OR (p613 <= 0)) AND ((p112 <= 0) OR (p522 <= 0)))) OR ((p307 <= 1) AND (p356 <= 1) AND (p465 <= 1) AND (p89 <= 1) AND (p78 <= 1) AND (p361 <= 1) AND (p551 <= 1) AND (p141 <= 1))))",
"processed_size": 404,
"rewrites": 181
},
"net":
{
"conflict_clusters": 243,
"singleton_clusters": 0
},
"result":
{
"edges": 2424,
"markings": 1212,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 73
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 73
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 8,
"adisj": 2,
"aneg": 0,
"comp": 32,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 32,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 18,
"visible_transitions": 0
},
"processed": "E ((((1 <= p406) OR (1 <= p536) OR (1 <= p293) OR (1 <= p375) OR (1 <= p448) OR (1 <= p102) OR (1 <= p40) OR (1 <= p168)) U (((1 <= p245) AND (1 <= p397) AND (1 <= p594)) OR ((1 <= p245) AND (1 <= p348) AND (1 <= p397)) OR ((1 <= p4) AND (1 <= p245) AND (1 <= p397)) OR ((1 <= p245) AND (1 <= p367) AND (1 <= p397)) OR ((1 <= p88) AND (1 <= p245) AND (1 <= p397)) OR ((1 <= p245) AND (1 <= p295) AND (1 <= p397)) OR ((1 <= p209) AND (1 <= p245) AND (1 <= p397)) OR ((1 <= p180) AND (1 <= p245) AND (1 <= p397)))))",
"processed_size": 527,
"rewrites": 182
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /EU",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 8
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 24,
"problems": 8
},
"type": "existential_until",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 97
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 16,
"adisj": 1,
"aneg": 0,
"comp": 32,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 32,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 18,
"visible_transitions": 0
},
"processed": "AF(EG((((1 <= p364) AND (1 <= p456)) OR ((1 <= p79) AND (1 <= p456)) OR ((1 <= p456) AND (1 <= p588)) OR ((1 <= p176) AND (1 <= p456)) OR ((1 <= p314) AND (1 <= p456)) OR ((1 <= p246) AND (1 <= p456)) OR ((1 <= p113) AND (1 <= p456)) OR ((1 <= p456) AND (1 <= p512)) OR ((1 <= p68) AND (1 <= p309)) OR ((1 <= p309) AND (1 <= p487)) OR ((1 <= p309) AND (1 <= p330)) OR ((1 <= p309) AND (1 <= p566)) OR ((1 <= p202) AND (1 <= p309)) OR ((1 <= p137) AND (1 <= p309)) OR ((1 <= p309) AND (1 <= p556)) OR ((1 <= p309) AND (1 <= p365)))))",
"processed_size": 547,
"rewrites": 181
},
"net":
{
"conflict_clusters": 243,
"singleton_clusters": 0
},
"result":
{
"edges": 2873,
"markings": 1578,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 97
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 97
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 16,
"adisj": 2,
"aneg": 0,
"comp": 32,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 32,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 25,
"visible_transitions": 0
},
"processed": "A (((((1 <= p70) AND (1 <= p331)) OR ((1 <= p455) AND (1 <= p535)) OR ((1 <= p104) AND (1 <= p569)) OR ((1 <= p69) AND (1 <= p426)) OR ((1 <= p34) AND (1 <= p256)) OR ((1 <= p146) AND (1 <= p185)) OR ((1 <= p131) AND (1 <= p457)) OR ((1 <= p283) AND (1 <= p389))) U (((1 <= p310) AND (1 <= p567)) OR ((1 <= p415) AND (1 <= p567)) OR ((1 <= p170) AND (1 <= p567)) OR ((1 <= p21) AND (1 <= p567)) OR ((1 <= p109) AND (1 <= p567)) OR ((1 <= p407) AND (1 <= p567)) OR ((1 <= p274) AND (1 <= p567)) OR ((1 <= p232) AND (1 <= p567)))))",
"processed_size": 543,
"rewrites": 184
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /ER",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 120
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 16,
"problems": 8
},
"type": "universal_until",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 195
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 41,
"adisj": 9,
"aneg": 0,
"comp": 96,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 96,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 50,
"visible_transitions": 0
},
"processed": "EG(((((p51 <= 0) OR (p586 <= 1)) AND ((p403 <= 0) OR (p586 <= 1)) AND ((p508 <= 0) OR (p586 <= 1)) AND ((p481 <= 0) OR (p586 <= 1)) AND ((p277 <= 0) OR (p586 <= 1)) AND ((p30 <= 0) OR (p586 <= 1)) AND ((p72 <= 0) OR (p586 <= 1)) AND ((p192 <= 0) OR (p586 <= 1))) AND EF((((1 <= p37) AND (1 <= p58)) OR ((1 <= p58) AND (1 <= p402)) OR ((1 <= p58) AND (1 <= p469)) OR ((1 <= p58) AND (1 <= p341)) OR ((1 <= p58) AND (1 <= p73)) OR ((1 <= p58) AND (1 <= p524)) OR ((1 <= p58) AND (1 <= p589)) OR ((1 <= p58) AND (1 <= p461)) OR ((1 <= p13) AND (1 <= p58)) OR ((1 <= p58) AND (1 <= p200)) OR ((1 <= p58) AND (1 <= p224)) OR ((1 <= p58) AND (1 <= p90)) OR ((1 <= p58) AND (1 <= p345)) OR ((1 <= p58) AND (1 <= p280)) OR ((1 <= p58) AND (1 <= p600)) OR ((1 <= p58) AND (1 <= p470)) OR ((1 <= p58) AND (1 <= p221)) OR ((1 <= p58) AND (1 <= p534)) OR ((1 <= p58) AND (1 <= p93)) OR ((1 <= p1) AND (1 <= p58)) OR ((1 <= p58) AND (1 <= p435)) OR ((1 <= p58) AND (1 <= p498)) OR ((1 <= p58) AND (1 <= p437)) OR ((1 <= p58) AND (1 <= p114)) OR ((1 <= p58) AND (1 <= p242)) OR ((1 <= p58) AND (1 <= p369)) OR ((1 <= p58) AND (1 <= p491)) OR ((1 <= p58) AND (1 <= p167)) OR ((1 <= p58) AND (1 <= p486)) OR ((1 <= p58) AND (1 <= p298)) OR ((1 <= p58) AND (1 <= p581)) OR ((1 <= p58) AND (1 <= p580)) OR ((1 <= p58) AND (1 <= p453)) OR ((1 <= p58) AND (1 <= p261)) OR ((1 <= p58) AND (1 <= p379)) OR ((1 <= p58) AND (1 <= p380)) OR ((1 <= p50) AND (1 <= p58)) OR ((1 <= p58) AND (1 <= p187)) OR ((1 <= p58) AND (1 <= p374)) OR ((1 <= p16) AND (1 <= p58))))))",
"processed_size": 1589,
"rewrites": 181
},
"net":
{
"conflict_clusters": 243,
"singleton_clusters": 0
},
"result":
{
"edges": 106837,
"markings": 55286,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 194
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 194
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p111) AND (1 <= p357) AND (1 <= p544))))",
"processed_size": 53,
"rewrites": 180
},
"result":
{
"edges": 65,
"markings": 66,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 1466420,
"runtime": 3570.000000,
"signal": null,
"timelimitreached": true
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(E((** U **)) OR A(F(E(G(**))))) : (A((** U **)) OR E(G((** AND E(F(**)))))) : ((E(F(**)) OR (E(F(**)) OR (E(F(**)) OR (E(F(**)) OR (E(F(**)) OR (E(F(**)) OR (E(F(**)) OR (E(F(**)) OR E(F(**)))))))))) AND A(G(E(F(**))))) : E(G((E(F(**)) OR **))) : (A(G(*)) OR (A(F(**)) AND (E(G(*)) OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR **)))))))))))))))))) : E(F((** AND (** AND **)))) : E(G((A(G(**)) OR DEADLOCK))) : E(F(**)) : (** OR ((A(F(**)) AND **) OR (** AND (A(X(**)) AND **)))) : E((A(F(**)) U **)) : (A(X(A(F(*)))) AND A(X(E(G(**))))) : TRUE : E(F(A(X(E(G(**))))))"
},
"net":
{
"arcs": 4836,
"conflict_clusters": 243,
"places": 614,
"places_significant": 564,
"singleton_clusters": 0,
"transitions": 1114
},
"result":
{
"interim_value": "no yes unknown yes unknown unknown no yes no no yes yes yes ",
"preliminary_value": "no yes unknown yes unknown unknown no yes no no yes yes yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 1728/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 19648
lola: finding significant places
lola: 614 places, 1114 transitions, 564 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLFireability.xml
lola: (E ((((1 <= p406) OR (1 <= p536) OR (1 <= p293) OR (1 <= p375) OR (1 <= p448) OR (1 <= p102) OR (1 <= p40) OR (1 <= p168)) U (((1 <= p245) AND (1 <= p397) AND (1 <= p594)) OR ((1 <= p245) AND (1 <= p348) AND (1 <= p397)) OR ((1 <= p4) AND (1 <= p245) AND (1 <= p397)) OR ((1 <= p245) AND (1 <= p367) AND (1 <= p397)) OR ((1 <= p88) AND (1 <= p245) AND (1 <= p397)) OR ((1 <= p245) AND (1 <= p295) AND (1 <= p397)) OR ((1 <= p209) AND (1 <= p245) AND (1 <= p397)) OR ((1 <= p180) AND (1 <= p245) AND (1 <= p397))))) OR A (F (E (G ((((1 <= p364) AND (1 <= p456)) OR ((1 <= p79) AND (1 <= p456)) OR ((1 <= p456) AND (1 <= p588)) OR ((1 <= p176) AND (1 <= p456)) OR ((1 <= p314) AND (1 <= p456)) OR ((1 <= p246) AND (1 <= p456)) OR ((1 <= p113) AND (1 <= p456)) OR ((1 <= p456) AND (1 <= p512)) OR ((1 <= p68) AND (1 <= p309)) OR ((1 <= p309) AND (1 <= p487)) OR ((1 <= p309) AND (1 <= p330)) OR ((1 <= p309) AND (1 <= p566)) OR ((1 <= p202) AND (1 <= p309)) OR ((1 <= p137) AND (1 <= p309)) OR ((1 <= p309) AND (1 <= p556)) OR ((1 <= p309) AND (1 <= p365)))))))) : (A (((((1 <= p70) AND (1 <= p331)) OR ((1 <= p455) AND (1 <= p535)) OR ((1 <= p104) AND (1 <= p569)) OR ((1 <= p69) AND (1 <= p426)) OR ((1 <= p34) AND (1 <= p256)) OR ((1 <= p146) AND (1 <= p185)) OR ((1 <= p131) AND (1 <= p457)) OR ((1 <= p283) AND (1 <= p389))) U (((1 <= p310) AND (1 <= p567)) OR ((1 <= p415) AND (1 <= p567)) OR ((1 <= p170) AND (1 <= p567)) OR ((1 <= p21) AND (1 <= p567)) OR ((1 <= p109) AND (1 <= p567)) OR ((1 <= p407) AND (1 <= p567)) OR ((1 <= p274) AND (1 <= p567)) OR ((1 <= p232) AND (1 <= p567))))) OR E (G (((((p51 <= 0) OR (p586 <= 1)) AND ((p403 <= 0) OR (p586 <= 1)) AND ((p508 <= 0) OR (p586 <= 1)) AND ((p481 <= 0) OR (p586 <= 1)) AND ((p277 <= 0) OR (p586 <= 1)) AND ((p30 <= 0) OR (p586 <= 1)) AND ((p72 <= 0) OR (p586 <= 1)) AND ((p192 <= 0) OR (p586 <= 1))) AND E (F ((((1 <= p37) AND (1 <= p58)) OR ((1 <= p58) AND (1 <= p402)) OR ((1 <= p58) AND (1 <= p469)) OR ((1 <= p58) AND (1 <= p341)) OR ((1 <= p58) AND (1 <= p73)) OR ((1 <= p58) AND (1 <= p524)) OR ((1 <= p58) AND (1 <= p589)) OR ((1 <= p58) AND (1 <= p461)) OR ((1 <= p13) AND (1 <= p58)) OR ((1 <= p58) AND (1 <= p200)) OR ((1 <= p58) AND (1 <= p224)) OR ((1 <= p58) AND (1 <= p90)) OR ((1 <= p58) AND (1 <= p345)) OR ((1 <= p58) AND (1 <= p280)) OR ((1 <= p58) AND (1 <= p600)) OR ((1 <= p58) AND (1 <= p470)) OR ((1 <= p58) AND (1 <= p221)) OR ((1 <= p58) AND (1 <= p534)) OR ((1 <= p58) AND (1 <= p93)) OR ((1 <= p1) AND (1 <= p58)) OR ((1 <= p58) AND (1 <= p435)) OR ((1 <= p58) AND (1 <= p498)) OR ((1 <= p58) AND (1 <= p437)) OR ((1 <= p58) AND (1 <= p114)) OR ((1 <= p58) AND (1 <= p242)) OR ((1 <= p58) AND (1 <= p369)) OR ((1 <= p58) AND (1 <= p491)) OR ((1 <= p58) AND (1 <= p167)) OR ((1 <= p58) AND (1 <= p486)) OR ((1 <= p58) AND (1 <= p298)) OR ((1 <= p58) AND (1 <= p581)) OR ((1 <= p58) AND (1 <= p580)) OR ((1 <= p58) AND (1 <= p453)) OR ((1 <= p58) AND (1 <= p261)) OR ((1 <= p58) AND (1 <= p379)) OR ((1 <= p58) AND (1 <= p380)) OR ((1 <= p50) AND (1 <= p58)) OR ((1 <= p58) AND (1 <= p187)) OR ((1 <= p58) AND (1 <= p374)) OR ((1 <= p16) AND (1 <= p58))))))))) : (E (F (((((((((E (F ((((1 <= p51) AND (2 <= p586)) OR ((1 <= p403) AND (2 <= p586)) OR ((1 <= p508) AND (2 <= p586)) OR ((1 <= p481) AND (2 <= p586)) OR ((1 <= p277) AND (2 <= p586)) OR ((1 <= p30) AND (2 <= p586)) OR ((1 <= p72) AND (2 <= p586)) OR ((1 <= p192) AND (2 <= p586))))) OR ((1 <= p111) AND (1 <= p346) AND (1 <= p544))) OR ((1 <= p111) AND (1 <= p132) AND (1 <= p544))) OR ((1 <= p111) AND (1 <= p544) AND (1 <= p546))) OR ((1 <= p111) AND (1 <= p468) AND (1 <= p544))) OR ((1 <= p111) AND (1 <= p273) AND (1 <= p544))) OR ((1 <= p18) AND (1 <= p111) AND (1 <= p544))) OR ((1 <= p111) AND (1 <= p191) AND (1 <= p544))) OR ((1 <= p111) AND (1 <= p357) AND (1 <= p544))))) AND A (G (E (F (((p96 <= 0) AND (p230 <= 0) AND (p322 <= 0) AND (p38 <= 0) AND (p233 <= 0) AND (p514 <= 0) AND (p381 <= 0) AND (p427 <= 0))))))) : E (G ((E (F ((((p112 <= 0) OR (p602 <= 0)) AND ((p112 <= 0) OR (p147 <= 0)) AND ((p33 <= 0) OR (p112 <= 0)) AND ((p112 <= 0) OR (p316 <= 0)) AND ((p112 <= 0) OR (p249 <= 0)) AND ((p42 <= 0) OR (p112 <= 0)) AND ((p112 <= 0) OR (p613 <= 0)) AND ((p112 <= 0) OR (p522 <= 0))))) OR ((p307 <= 1) AND (p356 <= 1) AND (p465 <= 1) AND (p89 <= 1) AND (p78 <= 1) AND (p361 <= 1) AND (p551 <= 1) AND (p141 <= 1))))) : (NOT(E (F (E (F (((1 <= p391) OR (1 <= p178) OR (1 <= p484) OR (1 <= p279) OR (1 <= p219) OR (1 <= p24) OR (1 <= p593) OR (1 <= p349))))))) OR (A (F (((1 <= p227) OR (1 <= p35) OR (1 <= p133) OR (1 <= p447) OR (1 <= p332) OR (1 <= p366) OR (1 <= p548) OR (1 <= p190)))) AND ((((((((((((((((NOT(A (F ((((1 <= p17) AND (1 <= p507)) OR ((1 <= p105) AND (1 <= p507)) OR ((1 <= p193) AND (1 <= p507)) OR ((1 <= p507) AND (1 <= p521)) OR ((1 <= p408) AND (1 <= p507)) OR ((1 <= p443) AND (1 <= p507)) OR ((1 <= p472) AND (1 <= p507)) OR ((1 <= p428) AND (1 <= p507)) OR ((1 <= p222) AND (1 <= p507)) OR ((1 <= p95) AND (1 <= p507)) OR ((1 <= p417) AND (1 <= p507)) OR ((1 <= p507) AND (1 <= p538)) OR ((1 <= p165) AND (1 <= p507)) OR ((1 <= p289) AND (1 <= p507)) OR ((1 <= p454) AND (1 <= p507)) OR ((1 <= p507) AND (1 <= p608)) OR ((1 <= p433) AND (1 <= p507)) OR ((1 <= p378) AND (1 <= p507)) OR ((1 <= p9) AND (1 <= p507)) OR ((1 <= p507) AND (1 <= p554)) OR ((1 <= p445) AND (1 <= p507)) OR ((1 <= p244) AND (1 <= p507)) OR ((1 <= p318) AND (1 <= p507)) OR ((1 <= p103) AND (1 <= p507)) OR ((1 <= p250) AND (1 <= p507)) OR ((1 <= p507) AND (1 <= p562)) OR ((1 <= p343) AND (1 <= p507)) OR ((1 <= p507) AND (1 <= p560)) OR ((1 <= p358) AND (1 <= p507)) OR ((1 <= p6) AND (1 <= p507)) OR ((1 <= p23) AND (1 <= p507)) OR ((1 <= p351) AND (1 <= p507)) OR ((1 <= p478) AND (1 <= p507)) OR ((1 <= p265) AND (1 <= p507)) OR ((1 <= p3) AND (1 <= p507)) OR ((1 <= p223) AND (1 <= p507)) OR ((1 <= p206) AND (1 <= p507)) OR ((1 <= p92) AND (1 <= p507)) OR ((1 <= p376) AND (1 <= p507)) OR ((1 <= p507) AND (1 <= p574)))))) OR (1 <= p553)) OR (1 <= p160)) OR (1 <= p353)) OR (1 <= p199)) OR (1 <= p36)) OR (1 <= p320)) OR (1 <= p609)) OR (1 <= p269)) OR (1 <= p490)) OR (1 <= p438)) OR (1 <= p83)) OR (1 <= p405)) OR (1 <= p432)) OR (1 <= p54)) OR (1 <= p155)) OR (1 <= p216)))) : E (F (((E (((1 <= 0) U ((1 <= p253) AND (1 <= p481)))) AND (1 <= p184)) AND (1 <= p392)))) : E (G ((A (G (((1 <= p52) AND (1 <= p134) AND (1 <= p208)))) OR A (X ((1 <= 0)))))) : E ((((1 <= p30) AND (1 <= p340) AND ((p161 <= 0) OR (p562 <= 0) OR (p58 <= 0) OR (p114 <= 0))) U E (F ((1 <= p285))))) : (((1 <= p53) OR (A (F (((1 <= p309) AND (1 <= p566)))) AND ((1 <= p55) OR (p538 <= 0) OR (p612 <= 0)))) OR ((((1 <= p161) AND (1 <= p193) AND (1 <= p245) AND (1 <= p399) AND (1 <= p544)) AND A (X (((1 <= p198) AND (1 <= p290))))) AND (((1 <= p14) AND (7 <= p20) AND (2 <= p220) AND (1 <= p270)) OR ((1 <= p58) AND (1 <= p345)) OR ((4 <= p62) AND (6 <= p20) AND (1 <= p166) AND (3 <= p220) AND (1 <= p270))))) : E ((A (F ((((1 <= p51) AND (1 <= p570)) OR ((1 <= p192) AND (1 <= p253))))) U ((1 <= p91) AND (1 <= p220) AND (1 <= p555)))) : A (X ((NOT(E (G (((1 <= p130) AND (1 <= p211) AND (1 <= p248))))) AND E (G (((p208 <= 0) OR (p231 <= 0) OR (p519 <= 0))))))) : E (G ((0 <= 0))) : E (F (A (X (E (G ((2 <= p141)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:548
lola: rewrite Frontend/Parser/formula_rewrite.k:401
lola: rewrite Frontend/Parser/formula_rewrite.k:548
lola: rewrite Frontend/Parser/formula_rewrite.k:548
lola: rewrite Frontend/Parser/formula_rewrite.k:548
lola: rewrite Frontend/Parser/formula_rewrite.k:548
lola: rewrite Frontend/Parser/formula_rewrite.k:548
lola: rewrite Frontend/Parser/formula_rewrite.k:548
lola: rewrite Frontend/Parser/formula_rewrite.k:548
lola: rewrite Frontend/Parser/formula_rewrite.k:401
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:183
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:473
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 25 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 179 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 28 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (A (F (((p130 <= 0) OR (p211 <= 0) OR (p248 <= 0)))))) AND A (X (E (G (((p208 <= 0) OR (p231 <= 0) OR (p519 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 28 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (G (((p208 <= 0) OR (p231 <= 0) OR (p519 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EG(((p208 <= 0) OR (p231 <= 0) OR (p519 <= 0))))
lola: processed formula length: 53
lola: 181 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1249 markings, 1250 edges
lola: ========================================
lola: subprocess 2 will run for 30 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (F (((p130 <= 0) OR (p211 <= 0) OR (p248 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:754
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: ((1 <= p130) AND (1 <= p211) AND (1 <= p248))
lola: processed formula length: 45
lola: 182 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEG
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: The predicate eventually occurs from all successors.
lola: state equation task get result unparse finished++ id 0
lola: 0 markings, 0 edges
lola: formula 0: ((p130 <= 0) OR (p211 <= 0) OR (p248 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 30 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p53) OR ((A (F (((1 <= p309) AND (1 <= p566)))) AND ((1 <= p55) OR (p538 <= 0) OR (p612 <= 0))) OR (((1 <= p161) AND (1 <= p193) AND (1 <= p245) AND (1 <= p399) AND (1 <= p544)) AND (A (X (((1 <= p198) AND (1 <= p290)))) AND (((1 <= p14) AND (7 <= p20) AND (2 <= p220) AND (1 <= p270)) OR ((1 <= p58) AND (1 <= p345)) OR ((4 <= p62) AND (6 <= p20) AND (1 <= p166) AND (3 <= p220) AND (1 <=... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 30 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p55) OR (p538 <= 0) OR (p612 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p55) OR (p538 <= 0) OR (p612 <= 0))
lola: processed formula length: 44
lola: 179 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 33 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p53)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p53)
lola: processed formula length: 10
lola: 179 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 37 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p161) AND (1 <= p193) AND (1 <= p245) AND (1 <= p399) AND (1 <= p544))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p161) AND (1 <= p193) AND (1 <= p245) AND (1 <= p399) AND (1 <= p544))
lola: processed formula length: 77
lola: 179 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 5 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 41 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p309) AND (1 <= p566))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p309 <= 0) OR (p566 <= 0))
lola: processed formula length: 29
lola: 182 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p309) AND (1 <= p566))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 303 markings, 303 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 33 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X (E (G ((2 <= p141)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(AX(EG((2 <= p141))))
lola: processed formula length: 23
lola: 182 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 58423 markings, 119609 edges
lola: ========================================
lola: subprocess 4 will run for 37 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p285)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((1 <= p285)))
lola: processed formula length: 19
lola: 180 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p285)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 46 markings, 45 edges
lola: ========================================
lola: subprocess 5 will run for 41 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p253) AND (1 <= p481)) AND ((1 <= p184) AND (1 <= p392)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: processed formula: E (F ((((1 <= p253) AND (1 <= p481)) AND ((1 <= p184) AND (1 <= p392)))))
lola: processed formula length: 73
lola: 183 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p253) AND (1 <= p481)) AND ((1 <= p184) AND (1 <= p392)))
lola: state equation task get result unparse finished id 0
lola: state equation: Could not create input for sara: DNF too long or DEADLOCK predicate contained
lola: sara not yet started (preprocessing) || 179772 markings, 214292 edges, 35954 markings/sec, 0 secs
lola: sara not yet started (preprocessing) || 367554 markings, 439675 edges, 37556 markings/sec, 5 secs
lola: sara not yet started (preprocessing) || 541041 markings, 648592 edges, 34697 markings/sec, 10 secs
lola: sara not yet started (preprocessing) || 722009 markings, 867462 edges, 36194 markings/sec, 15 secs
lola: sara not yet started (preprocessing) || 909654 markings, 1096598 edges, 37529 markings/sec, 20 secs
lola: sara not yet started (preprocessing) || 1096875 markings, 1324469 edges, 37444 markings/sec, 25 secs
lola: sara not yet started (preprocessing) || 1283589 markings, 1552726 edges, 37343 markings/sec, 30 secs
lola: sara not yet started (preprocessing) || 1470047 markings, 1778540 edges, 37292 markings/sec, 35 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown yes no unknown yes yes yes
lola: memory consumption: 820560 KB
lola: time consumption: 3277 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 41 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((A (G (((1 <= p52) AND (1 <= p134) AND (1 <= p208)))) OR DEADLOCK)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((AG(((1 <= p52) AND (1 <= p134) AND (1 <= p208))) OR DEADLOCK))
lola: processed formula length: 66
lola: 181 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 1 edges
lola: ========================================
lola: subprocess 7 will run for 48 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((A (F ((((1 <= p51) AND (1 <= p570)) OR ((1 <= p192) AND (1 <= p253))))) U ((1 <= p91) AND (1 <= p220) AND (1 <= p555))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(AF((((1 <= p51) AND (1 <= p570)) OR ((1 <= p192) AND (1 <= p253)))) U ((1 <= p91) AND (1 <= p220) AND (1 <= p555)))
lola: processed formula length: 118
lola: 181 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 51888 markings, 87060 edges
lola: ========================================
lola: subprocess 8 will run for 58 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((E (F ((((p112 <= 0) OR (p602 <= 0)) AND ((p112 <= 0) OR (p147 <= 0)) AND ((p33 <= 0) OR (p112 <= 0)) AND ((p112 <= 0) OR (p316 <= 0)) AND ((p112 <= 0) OR (p249 <= 0)) AND ((p42 <= 0) OR (p112 <= 0)) AND ((p112 <= 0) OR (p613 <= 0)) AND ((p112 <= 0) OR (p522 <= 0))))) OR ((p307 <= 1) AND (p356 <= 1) AND (p465 <= 1) AND (p89 <= 1) AND (p78 <= 1) AND (p361 <= 1) AND (p551 <= 1) AND (p1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((EF((((p112 <= 0) OR (p602 <= 0)) AND ((p112 <= 0) OR (p147 <= 0)) AND ((p33 <= 0) OR (p112 <= 0)) AND ((p112 <= 0) OR (p316 <= 0)) AND ((p112 <= 0) OR (p249 <= 0)) AND ((p42 <= 0) OR (p112 <= 0)) AND ((p112 <= 0) OR (p613 <= 0)) AND ((p112 <= 0) OR (p522 <= 0)))) OR ((p307 <= 1) AND (p356 <= 1) AND (p465 <= 1) AND (p89 <= 1) AND (p78 <= 1) AND (p361 <= 1) AND (p551 <= 1) AND (p141 <= 1... (shortened)
lola: processed formula length: 404
lola: 181 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1212 markings, 2424 edges
lola: ========================================
lola: subprocess 9 will run for 73 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E ((((1 <= p406) OR (1 <= p536) OR (1 <= p293) OR (1 <= p375) OR (1 <= p448) OR (1 <= p102) OR (1 <= p40) OR (1 <= p168)) U (((1 <= p245) AND (1 <= p397) AND (1 <= p594)) OR ((1 <= p245) AND (1 <= p348) AND (1 <= p397)) OR ((1 <= p4) AND (1 <= p245) AND (1 <= p397)) OR ((1 <= p245) AND (1 <= p367) AND (1 <= p397)) OR ((1 <= p88) AND (1 <= p245) AND (1 <= p397)) OR ((1 <= p245) AND (1 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 73 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((1 <= p406) OR (1 <= p536) OR (1 <= p293) OR (1 <= p375) OR (1 <= p448) OR (1 <= p102) OR (1 <= p40) OR (1 <= p168)) U (((1 <= p245) AND (1 <= p397) AND (1 <= p594)) OR ((1 <= p245) AND (1 <= p348) AND (1 <= p397)) OR ((1 <= p4) AND (1 <= p245) AND (1 <= p397)) OR ((1 <= p245) AND (1 <= p367) AND (1 <= p397)) OR ((1 <= p88) AND (1 <= p245) AND (1 <= p397)) OR ((1 <= p245) AND (1 <... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E ((((1 <= p406) OR (1 <= p536) OR (1 <= p293) OR (1 <= p375) OR (1 <= p448) OR (1 <= p102) OR (1 <= p40) OR (1 <= p168)) U (((1 <= p245) AND (1 <= p397) AND (1 <= p594)) OR ((1 <= p245) AND (1 <= p348) AND (1 <= p397)) OR ((1 <= p4) AND (1 <= p245) AND (1 <= p397)) OR ((1 <= p245) AND (1 <= p367) AND (1 <= p397)) OR ((1 <= p88) AND (1 <= p245) AND (1 <= p397)) OR ((1 <= p245) AND (1 <... (shortened)
lola: processed formula length: 527
lola: 182 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: There is no path where Predicate Phi holds until Predicate Psi.
lola: 0 markings, 0 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p245) AND (1 <= p397) AND (1 <= p594)) OR ((1 <= p245) AND (1 <= p348) AND (1 <= p397)) OR ((1 <= p4) AND (1 <= p245) AND (1 <= p397)) OR ((1 <= p245) AND (1 <= p367) AND (1 <= p397)) OR ((1 <= p88) AND (1 <= p245) AND (1 <= p397)) OR ((1 <= p245) AND (1 <= p295) AND (1 <= p397)) OR ((1 <= p209) AND (1 <= p245) AND (1 <= p397)) OR ((1 <= p180) AND (1 <= p245) AND (1 <= p397)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 24 literals and 8 conjunctive subformulas
lola: ========================================
lola: subprocess 10 will run for 97 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (G ((((1 <= p364) AND (1 <= p456)) OR ((1 <= p79) AND (1 <= p456)) OR ((1 <= p456) AND (1 <= p588)) OR ((1 <= p176) AND (1 <= p456)) OR ((1 <= p314) AND (1 <= p456)) OR ((1 <= p246) AND (1 <= p456)) OR ((1 <= p113) AND (1 <= p456)) OR ((1 <= p456) AND (1 <= p512)) OR ((1 <= p68) AND (1 <= p309)) OR ((1 <= p309) AND (1 <= p487)) OR ((1 <= p309) AND (1 <= p330)) OR ((1 <= p309) AN... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(EG((((1 <= p364) AND (1 <= p456)) OR ((1 <= p79) AND (1 <= p456)) OR ((1 <= p456) AND (1 <= p588)) OR ((1 <= p176) AND (1 <= p456)) OR ((1 <= p314) AND (1 <= p456)) OR ((1 <= p246) AND (1 <= p456)) OR ((1 <= p113) AND (1 <= p456)) OR ((1 <= p456) AND (1 <= p512)) OR ((1 <= p68) AND (1 <= p309)) OR ((1 <= p309) AND (1 <= p487)) OR ((1 <= p309) AND (1 <= p330)) OR ((1 <= p309) AND (1 <... (shortened)
lola: processed formula length: 547
lola: 181 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1578 markings, 2873 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 97 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((p391 <= 0) AND (p178 <= 0) AND (p484 <= 0) AND (p279 <= 0) AND (p219 <= 0) AND (p24 <= 0) AND (p593 <= 0) AND (p349 <= 0)))) OR (A (F (((1 <= p227) OR (1 <= p35) OR (1 <= p133) OR (1 <= p447) OR (1 <= p332) OR (1 <= p366) OR (1 <= p548) OR (1 <= p190)))) AND (E (G ((((p17 <= 0) OR (p507 <= 0)) AND ((p105 <= 0) OR (p507 <= 0)) AND ((p193 <= 0) OR (p507 <= 0)) AND ((p507 <= 0) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 97 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p553) OR ((1 <= p160) OR ((1 <= p353) OR ((1 <= p199) OR ((1 <= p36) OR ((1 <= p320) OR ((1 <= p609) OR ((1 <= p269) OR ((1 <= p490) OR ((1 <= p438) OR ((1 <= p83) OR ((1 <= p405) OR ((1 <= p432) OR ((1 <= p54) OR ((1 <= p155) OR (1 <= p216))))))))))))))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: processed formula: ((1 <= p553) OR (1 <= p160) OR (1 <= p353) OR (1 <= p199) OR (1 <= p36) OR (1 <= p320) OR (1 <= p609) OR (1 <= p269) OR (1 <= p490) OR (1 <= p438) OR (1 <= p83) OR (1 <= p405) OR (1 <= p432) OR (1 <= p54) OR (1 <= p155) OR (1 <= p216))
lola: processed formula length: 235
lola: 208 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 16 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 146 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p227) OR (1 <= p35) OR (1 <= p133) OR (1 <= p447) OR (1 <= p332) OR (1 <= p366) OR (1 <= p548) OR (1 <= p190))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p227 <= 0) AND (p35 <= 0) AND (p133 <= 0) AND (p447 <= 0) AND (p332 <= 0) AND (p366 <= 0) AND (p548 <= 0) AND (p190 <= 0))
lola: processed formula length: 124
lola: 182 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p227) OR (1 <= p35) OR (1 <= p133) OR (1 <= p447) OR (1 <= p332) OR (1 <= p366) OR (1 <= p548) OR (1 <= p190))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-11-0.sara.
sara: place or transition ordering is non-deterministic
lola: 161218 markings, 203496 edges, 32244 markings/sec, 0 secs || sara is running 0 secs
lola: 319008 markings, 405717 edges, 31558 markings/sec, 5 secs || sara is running 5 secs
lola: 485642 markings, 617612 edges, 33327 markings/sec, 10 secs || sara is running 10 secs
lola: 651188 markings, 829332 edges, 33109 markings/sec, 15 secs || sara is running 15 secs
lola: 835013 markings, 1044533 edges, 36765 markings/sec, 20 secs || sara is running 20 secs
lola: 996346 markings, 1248787 edges, 32267 markings/sec, 25 secs || sara is running 25 secs
lola: 1160581 markings, 1456779 edges, 32847 markings/sec, 30 secs || sara is running 30 secs
lola: 1318983 markings, 1659544 edges, 31680 markings/sec, 35 secs || sara is running 35 secs
lola: 1465040 markings, 1842599 edges, 29211 markings/sec, 40 secs || sara is running 40 secs
lola: 1617032 markings, 2039994 edges, 30398 markings/sec, 45 secs || sara is running 45 secs
lola: 1770378 markings, 2241295 edges, 30669 markings/sec, 50 secs || sara is running 50 secs
lola: 1937260 markings, 2453023 edges, 33376 markings/sec, 55 secs || sara is running 55 secs
lola: 2102800 markings, 2663828 edges, 33108 markings/sec, 60 secs || sara is running 60 secs
lola: 2266663 markings, 2863011 edges, 32773 markings/sec, 65 secs || sara is running 65 secs
lola: 2418591 markings, 3053041 edges, 30386 markings/sec, 70 secs || sara is running 70 secs
lola: 2567510 markings, 3237494 edges, 29784 markings/sec, 75 secs || sara is running 75 secs
lola: 2723808 markings, 3437995 edges, 31260 markings/sec, 80 secs || sara is running 80 secs
lola: 2874387 markings, 3627839 edges, 30116 markings/sec, 85 secs || sara is running 85 secs
lola: 3027910 markings, 3825426 edges, 30705 markings/sec, 90 secs || sara is running 90 secs
lola: local time limit reached - aborting
lola: lola: caught signal User defined signal 1 - aborting LoLA
preliminary result: no unknown unknown yes unknown unknown no yes no no yes yes yes
lola:
preliminary result: no unknown unknown yes unknown unknown no yes no no yes yes yes
lola: memory consumption: 907340 KB
lola: time consumption: 3375 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: no unknown unknown yes unknown unknown no yes no no yes yes yes
lola: memory consumption: 907340 KB
lola: time consumption: 3375 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 97 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (((((1 <= p70) AND (1 <= p331)) OR ((1 <= p455) AND (1 <= p535)) OR ((1 <= p104) AND (1 <= p569)) OR ((1 <= p69) AND (1 <= p426)) OR ((1 <= p34) AND (1 <= p256)) OR ((1 <= p146) AND (1 <= p185)) OR ((1 <= p131) AND (1 <= p457)) OR ((1 <= p283) AND (1 <= p389))) U (((1 <= p310) AND (1 <= p567)) OR ((1 <= p415) AND (1 <= p567)) OR ((1 <= p170) AND (1 <= p567)) OR ((1 <= p21) AND (1 <= p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 97 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((((1 <= p70) AND (1 <= p331)) OR ((1 <= p455) AND (1 <= p535)) OR ((1 <= p104) AND (1 <= p569)) OR ((1 <= p69) AND (1 <= p426)) OR ((1 <= p34) AND (1 <= p256)) OR ((1 <= p146) AND (1 <= p185)) OR ((1 <= p131) AND (1 <= p457)) OR ((1 <= p283) AND (1 <= p389))) U (((1 <= p310) AND (1 <= p567)) OR ((1 <= p415) AND (1 <= p567)) OR ((1 <= p170) AND (1 <= p567)) OR ((1 <= p21) AND (1 <= p5... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (((((1 <= p70) AND (1 <= p331)) OR ((1 <= p455) AND (1 <= p535)) OR ((1 <= p104) AND (1 <= p569)) OR ((1 <= p69) AND (1 <= p426)) OR ((1 <= p34) AND (1 <= p256)) OR ((1 <= p146) AND (1 <= p185)) OR ((1 <= p131) AND (1 <= p457)) OR ((1 <= p283) AND (1 <= p389))) U (((1 <= p310) AND (1 <= p567)) OR ((1 <= p415) AND (1 <= p567)) OR ((1 <= p170) AND (1 <= p567)) OR ((1 <= p21) AND (1 <= p5... (shortened)
lola: processed formula length: 543
lola: 184 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: 1
lola: state equation task get result unparse finished++ id 0
lola: SUBRESULT
lola: formula 0: (((1 <= p70) AND (1 <= p331)) OR ((1 <= p455) AND (1 <= p535)) OR ((1 <= p104) AND (1 <= p569)) OR ((1 <= p69) AND (1 <= p426)) OR ((1 <= p34) AND (1 <= p256)) OR ((1 <= p146) AND (1 <= p185)) OR ((1 <= p131) AND (1 <= p457)) OR ((1 <= p283) AND (1 <= p389)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 16 literals and 8 conjunctive subformulas
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 195 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((((p51 <= 0) OR (p586 <= 1)) AND ((p403 <= 0) OR (p586 <= 1)) AND ((p508 <= 0) OR (p586 <= 1)) AND ((p481 <= 0) OR (p586 <= 1)) AND ((p277 <= 0) OR (p586 <= 1)) AND ((p30 <= 0) OR (p586 <= 1)) AND ((p72 <= 0) OR (p586 <= 1)) AND ((p192 <= 0) OR (p586 <= 1))) AND E (F ((((1 <= p37) AND (1 <= p58)) OR ((1 <= p58) AND (1 <= p402)) OR ((1 <= p58) AND (1 <= p469)) OR ((1 <= p58) AND (... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(((((p51 <= 0) OR (p586 <= 1)) AND ((p403 <= 0) OR (p586 <= 1)) AND ((p508 <= 0) OR (p586 <= 1)) AND ((p481 <= 0) OR (p586 <= 1)) AND ((p277 <= 0) OR (p586 <= 1)) AND ((p30 <= 0) OR (p586 <= 1)) AND ((p72 <= 0) OR (p586 <= 1)) AND ((p192 <= 0) OR (p586 <= 1))) AND EF((((1 <= p37) AND (1 <= p58)) OR ((1 <= p58) AND (1 <= p402)) OR ((1 <= p58) AND (1 <= p469)) OR ((1 <= p58) AND (1 <= p... (shortened)
lola: processed formula length: 1589
lola: 181 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 55286 markings, 106837 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 194 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((E (F ((((1 <= p51) AND (2 <= p586)) OR ((1 <= p403) AND (2 <= p586)) OR ((1 <= p508) AND (2 <= p586)) OR ((1 <= p481) AND (2 <= p586)) OR ((1 <= p277) AND (2 <= p586)) OR ((1 <= p30) AND (2 <= p586)) OR ((1 <= p72) AND (2 <= p586)) OR ((1 <= p192) AND (2 <= p586))))) OR (E (F (((1 <= p111) AND (1 <= p346) AND (1 <= p544)))) OR (E (F (((1 <= p111) AND (1 <= p132) AND (1 <= p544)))) OR (E (... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 194 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p111) AND (1 <= p357) AND (1 <= p544))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p111) AND (1 <= p357) AND (1 <= p544))))
lola: processed formula length: 53
lola: 180 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p111) AND (1 <= p357) AND (1 <= p544))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 66 markings, 65 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p253) AND (1 <= p481)) AND ((1 <= p184) AND (1 <= p392)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: processed formula: E (F ((((1 <= p253) AND (1 <= p481)) AND ((1 <= p184) AND (1 <= p392)))))
lola: processed formula length: 73
lola: 183 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p253) AND (1 <= p481)) AND ((1 <= p184) AND (1 <= p392)))
lola: state equation task get result unparse finished id 0
lola: state equation: Could not create input for sara: DNF too long or DEADLOCK predicate contained
lola: sara not yet started (preprocessing) || 177396 markings, 211631 edges, 35479 markings/sec, 0 secs
lola: sara not yet started (preprocessing) || 354778 markings, 424136 edges, 35476 markings/sec, 5 secs
lola: sara not yet started (preprocessing) || 538048 markings, 644878 edges, 36654 markings/sec, 10 secs
lola: sara not yet started (preprocessing) || 725899 markings, 872316 edges, 37570 markings/sec, 15 secs
lola: sara not yet started (preprocessing) || 912657 markings, 1100272 edges, 37352 markings/sec, 20 secs
lola: sara not yet started (preprocessing) || 1099342 markings, 1327516 edges, 37337 markings/sec, 25 secs
lola: sara not yet started (preprocessing) || 1285148 markings, 1554538 edges, 37161 markings/sec, 30 secs
lola: sara not yet started (preprocessing) || 1471560 markings, 1780311 edges, 37282 markings/sec, 35 secs
lola: sara not yet started (preprocessing) || 1658047 markings, 2006232 edges, 37297 markings/sec, 40 secs
lola: sara not yet started (preprocessing) || 1844214 markings, 2232201 edges, 37233 markings/sec, 45 secs
lola: sara not yet started (preprocessing) || 2029909 markings, 2458661 edges, 37139 markings/sec, 50 secs
lola: sara not yet started (preprocessing) || 2215079 markings, 2684958 edges, 37034 markings/sec, 55 secs
lola: sara not yet started (preprocessing) || 2393103 markings, 2902246 edges, 35605 markings/sec, 60 secs
lola: sara not yet started (preprocessing) || 2569806 markings, 3118924 edges, 35341 markings/sec, 65 secs
lola: sara not yet started (preprocessing) || 2754850 markings, 3343574 edges, 37009 markings/sec, 70 secs
lola: sara not yet started (preprocessing) || 2939577 markings, 3569289 edges, 36945 markings/sec, 75 secs
lola: sara not yet started (preprocessing) || 3124335 markings, 3795238 edges, 36952 markings/sec, 80 secs
lola: sara not yet started (preprocessing) || 3309239 markings, 4022471 edges, 36981 markings/sec, 85 secs
lola: sara not yet started (preprocessing) || 3493873 markings, 4247830 edges, 36927 markings/sec, 90 secs
lola: sara not yet started (preprocessing) || 3664303 markings, 4455730 edges, 34086 markings/sec, 95 secs
lola: sara not yet started (preprocessing) || 3835973 markings, 4664835 edges, 34334 markings/sec, 100 secs
lola: sara not yet started (preprocessing) || 4015283 markings, 4883217 edges, 35862 markings/sec, 105 secs
lola: sara not yet started (preprocessing) || 4193588 markings, 5101208 edges, 35661 markings/sec, 110 secs
lola: sara not yet started (preprocessing) || 4350930 markings, 5294229 edges, 31468 markings/sec, 115 secs
lola: sara not yet started (preprocessing) || 4514561 markings, 5494491 edges, 32726 markings/sec, 120 secs
lola: sara not yet started (preprocessing) || 4697786 markings, 5718950 edges, 36645 markings/sec, 125 secs
lola: sara not yet started (preprocessing) || 4881433 markings, 5944044 edges, 36729 markings/sec, 130 secs
lola: sara not yet started (preprocessing) || 5065040 markings, 6167813 edges, 36721 markings/sec, 135 secs
lola: sara not yet started (preprocessing) || 5248593 markings, 6392820 edges, 36711 markings/sec, 140 secs
lola: sara not yet started (preprocessing) || 5431919 markings, 6619190 edges, 36665 markings/sec, 145 secs
lola: sara not yet started (preprocessing) || 5615552 markings, 6843654 edges, 36727 markings/sec, 150 secs
lola: sara not yet started (preprocessing) || 5799392 markings, 7067763 edges, 36768 markings/sec, 155 secs
lola: sara not yet started (preprocessing) || 5982890 markings, 7292884 edges, 36700 markings/sec, 160 secs
lola: sara not yet started (preprocessing) || 6166846 markings, 7517523 edges, 36791 markings/sec, 165 secs
lola: sara not yet started (preprocessing) || 6350505 markings, 7743554 edges, 36732 markings/sec, 170 secs
lola: sara not yet started (preprocessing) || 6534208 markings, 7967168 edges, 36741 markings/sec, 175 secs
lola: sara not yet started (preprocessing) || 6717490 markings, 8192198 edges, 36656 markings/sec, 180 secs
lola: sara not yet started (preprocessing) || 6901140 markings, 8416803 edges, 36730 markings/sec, 185 secs
lola: time limit reached - aborting
lola:
preliminary result: no yes unknown yes unknown unknown no yes no no yes yes yes
lola:
preliminary result: no yes unknown yes unknown unknown no yes no no yes yes yes
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: no yes unknown yes unknown unknown no yes no no yes yes yes
lola: memory consumption: 1466420 KB
lola: time consumption: 3570 seconds
lola: print data as JSON (--json)
lola: memory consumption: 1466420 KB
lola: time consumption: 3570 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
rslt: finished
--------------------
content from stderr:
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="PolyORBLF-PT-S02J04T08"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# 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-4028"
echo " Executing tool itslola"
echo " Input is PolyORBLF-PT-S02J04T08, 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 r176-tajo-158987871800420"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S02J04T08.tgz
mv PolyORBLF-PT-S02J04T08 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 '
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 ;