Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r174-csrt-158987853300474.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is ParamProductionCell-PT-1, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987853300474
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 356K
-rw-r--r-- 1 mcc users 3.8K Apr 13 14:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 13 14:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 13 14:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 13 14:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 13 12:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 13 12:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 13 14:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 13 14:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Apr 13 14:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 13 14:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 13 14:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 13 14:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 174K 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 ParamProductionCell-PT-1-00
FORMULA_NAME ParamProductionCell-PT-1-01
FORMULA_NAME ParamProductionCell-PT-1-02
FORMULA_NAME ParamProductionCell-PT-1-03
FORMULA_NAME ParamProductionCell-PT-1-04
FORMULA_NAME ParamProductionCell-PT-1-05
FORMULA_NAME ParamProductionCell-PT-1-06
FORMULA_NAME ParamProductionCell-PT-1-07
FORMULA_NAME ParamProductionCell-PT-1-08
FORMULA_NAME ParamProductionCell-PT-1-09
FORMULA_NAME ParamProductionCell-PT-1-10
FORMULA_NAME ParamProductionCell-PT-1-11
FORMULA_NAME ParamProductionCell-PT-1-12
FORMULA_NAME ParamProductionCell-PT-1-13
FORMULA_NAME ParamProductionCell-PT-1-14
FORMULA_NAME ParamProductionCell-PT-1-15

=== Now, execution of the tool begins

BK_START 1591150853662

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 02:20:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 02:20:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 02:20:56] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2020-06-03 02:20:56] [INFO ] Transformed 231 places.
[2020-06-03 02:20:56] [INFO ] Transformed 202 transitions.
[2020-06-03 02:20:56] [INFO ] Found NUPN structural information;
[2020-06-03 02:20:56] [INFO ] Parsed PT model containing 231 places and 202 transitions in 157 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 33 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 278 ms. (steps per millisecond=359 ) properties seen :[0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1]
// Phase 1: matrix 202 rows 231 cols
[2020-06-03 02:20:56] [INFO ] Computed 59 place invariants in 22 ms
[2020-06-03 02:20:56] [INFO ] [Real]Absence check using 35 positive place invariants in 64 ms returned sat
[2020-06-03 02:20:56] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 15 ms returned sat
[2020-06-03 02:20:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:20:57] [INFO ] [Real]Absence check using state equation in 315 ms returned sat
[2020-06-03 02:20:57] [INFO ] State equation strengthened by 68 read => feed constraints.
[2020-06-03 02:20:57] [INFO ] [Real]Added 68 Read/Feed constraints in 55 ms returned sat
[2020-06-03 02:20:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:20:57] [INFO ] [Nat]Absence check using 35 positive place invariants in 79 ms returned sat
[2020-06-03 02:20:57] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 11 ms returned sat
[2020-06-03 02:20:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:20:57] [INFO ] [Nat]Absence check using state equation in 237 ms returned sat
[2020-06-03 02:20:57] [INFO ] [Nat]Added 68 Read/Feed constraints in 15 ms returned sat
[2020-06-03 02:20:58] [INFO ] Deduced a trap composed of 7 places in 280 ms
[2020-06-03 02:20:58] [INFO ] Deduced a trap composed of 6 places in 249 ms
[2020-06-03 02:20:58] [INFO ] Deduced a trap composed of 5 places in 285 ms
[2020-06-03 02:20:58] [INFO ] Deduced a trap composed of 7 places in 133 ms
[2020-06-03 02:20:59] [INFO ] Deduced a trap composed of 7 places in 591 ms
[2020-06-03 02:20:59] [INFO ] Deduced a trap composed of 10 places in 96 ms
[2020-06-03 02:20:59] [INFO ] Deduced a trap composed of 78 places in 197 ms
[2020-06-03 02:20:59] [INFO ] Deduced a trap composed of 28 places in 89 ms
[2020-06-03 02:20:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 2088 ms
[2020-06-03 02:20:59] [INFO ] [Real]Absence check using 35 positive place invariants in 26 ms returned sat
[2020-06-03 02:20:59] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 11 ms returned sat
[2020-06-03 02:20:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:21:00] [INFO ] [Real]Absence check using state equation in 291 ms returned sat
[2020-06-03 02:21:00] [INFO ] [Real]Added 68 Read/Feed constraints in 45 ms returned sat
[2020-06-03 02:21:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:21:00] [INFO ] [Nat]Absence check using 35 positive place invariants in 34 ms returned sat
[2020-06-03 02:21:00] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 20 ms returned sat
[2020-06-03 02:21:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:21:00] [INFO ] [Nat]Absence check using state equation in 514 ms returned sat
[2020-06-03 02:21:00] [INFO ] [Nat]Added 68 Read/Feed constraints in 40 ms returned sat
[2020-06-03 02:21:01] [INFO ] Deduced a trap composed of 5 places in 105 ms
[2020-06-03 02:21:01] [INFO ] Deduced a trap composed of 5 places in 101 ms
[2020-06-03 02:21:01] [INFO ] Deduced a trap composed of 5 places in 115 ms
[2020-06-03 02:21:01] [INFO ] Deduced a trap composed of 8 places in 150 ms
[2020-06-03 02:21:01] [INFO ] Deduced a trap composed of 44 places in 99 ms
[2020-06-03 02:21:01] [INFO ] Deduced a trap composed of 7 places in 79 ms
[2020-06-03 02:21:01] [INFO ] Deduced a trap composed of 21 places in 79 ms
[2020-06-03 02:21:01] [INFO ] Deduced a trap composed of 54 places in 98 ms
[2020-06-03 02:21:02] [INFO ] Deduced a trap composed of 14 places in 102 ms
[2020-06-03 02:21:02] [INFO ] Deduced a trap composed of 83 places in 116 ms
[2020-06-03 02:21:02] [INFO ] Deduced a trap composed of 8 places in 98 ms
[2020-06-03 02:21:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 1328 ms
[2020-06-03 02:21:02] [INFO ] [Real]Absence check using 35 positive place invariants in 18 ms returned sat
[2020-06-03 02:21:02] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 10 ms returned sat
[2020-06-03 02:21:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:21:02] [INFO ] [Real]Absence check using state equation in 315 ms returned sat
[2020-06-03 02:21:02] [INFO ] [Real]Added 68 Read/Feed constraints in 38 ms returned sat
[2020-06-03 02:21:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:21:02] [INFO ] [Nat]Absence check using 35 positive place invariants in 27 ms returned sat
[2020-06-03 02:21:02] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 17 ms returned sat
[2020-06-03 02:21:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:21:03] [INFO ] [Nat]Absence check using state equation in 211 ms returned sat
[2020-06-03 02:21:03] [INFO ] [Nat]Added 68 Read/Feed constraints in 29 ms returned sat
[2020-06-03 02:21:03] [INFO ] Deduced a trap composed of 5 places in 160 ms
[2020-06-03 02:21:03] [INFO ] Deduced a trap composed of 8 places in 121 ms
[2020-06-03 02:21:03] [INFO ] Deduced a trap composed of 7 places in 109 ms
[2020-06-03 02:21:03] [INFO ] Deduced a trap composed of 5 places in 115 ms
[2020-06-03 02:21:04] [INFO ] Deduced a trap composed of 7 places in 584 ms
[2020-06-03 02:21:05] [INFO ] Deduced a trap composed of 10 places in 872 ms
[2020-06-03 02:21:05] [INFO ] Deduced a trap composed of 14 places in 93 ms
[2020-06-03 02:21:05] [INFO ] Deduced a trap composed of 50 places in 61 ms
[2020-06-03 02:21:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 2280 ms
[2020-06-03 02:21:05] [INFO ] [Real]Absence check using 35 positive place invariants in 34 ms returned sat
[2020-06-03 02:21:05] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 12 ms returned sat
[2020-06-03 02:21:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:21:05] [INFO ] [Real]Absence check using state equation in 207 ms returned sat
[2020-06-03 02:21:05] [INFO ] [Real]Added 68 Read/Feed constraints in 30 ms returned sat
[2020-06-03 02:21:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:21:05] [INFO ] [Nat]Absence check using 35 positive place invariants in 27 ms returned sat
[2020-06-03 02:21:05] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 15 ms returned sat
[2020-06-03 02:21:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:21:06] [INFO ] [Nat]Absence check using state equation in 239 ms returned sat
[2020-06-03 02:21:06] [INFO ] [Nat]Added 68 Read/Feed constraints in 32 ms returned sat
[2020-06-03 02:21:06] [INFO ] Deduced a trap composed of 7 places in 139 ms
[2020-06-03 02:21:06] [INFO ] Deduced a trap composed of 7 places in 100 ms
[2020-06-03 02:21:06] [INFO ] Deduced a trap composed of 7 places in 113 ms
[2020-06-03 02:21:06] [INFO ] Deduced a trap composed of 30 places in 110 ms
[2020-06-03 02:21:06] [INFO ] Deduced a trap composed of 24 places in 95 ms
[2020-06-03 02:21:07] [INFO ] Deduced a trap composed of 9 places in 292 ms
[2020-06-03 02:21:07] [INFO ] Deduced a trap composed of 6 places in 87 ms
[2020-06-03 02:21:07] [INFO ] Deduced a trap composed of 5 places in 101 ms
[2020-06-03 02:21:07] [INFO ] Deduced a trap composed of 32 places in 508 ms
[2020-06-03 02:21:07] [INFO ] Deduced a trap composed of 13 places in 75 ms
[2020-06-03 02:21:08] [INFO ] Deduced a trap composed of 79 places in 181 ms
[2020-06-03 02:21:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 1942 ms
[2020-06-03 02:21:08] [INFO ] [Real]Absence check using 35 positive place invariants in 50 ms returned sat
[2020-06-03 02:21:08] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 19 ms returned sat
[2020-06-03 02:21:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:21:08] [INFO ] [Real]Absence check using state equation in 316 ms returned sat
[2020-06-03 02:21:08] [INFO ] [Real]Added 68 Read/Feed constraints in 34 ms returned sat
[2020-06-03 02:21:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:21:08] [INFO ] [Nat]Absence check using 35 positive place invariants in 24 ms returned sat
[2020-06-03 02:21:08] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 9 ms returned sat
[2020-06-03 02:21:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:21:08] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2020-06-03 02:21:08] [INFO ] [Nat]Added 68 Read/Feed constraints in 12 ms returned sat
[2020-06-03 02:21:09] [INFO ] Deduced a trap composed of 7 places in 128 ms
[2020-06-03 02:21:09] [INFO ] Deduced a trap composed of 10 places in 110 ms
[2020-06-03 02:21:09] [INFO ] Deduced a trap composed of 24 places in 118 ms
[2020-06-03 02:21:09] [INFO ] Deduced a trap composed of 8 places in 111 ms
[2020-06-03 02:21:09] [INFO ] Deduced a trap composed of 7 places in 112 ms
[2020-06-03 02:21:09] [INFO ] Deduced a trap composed of 10 places in 97 ms
[2020-06-03 02:21:09] [INFO ] Deduced a trap composed of 11 places in 131 ms
[2020-06-03 02:21:09] [INFO ] Deduced a trap composed of 8 places in 89 ms
[2020-06-03 02:21:10] [INFO ] Deduced a trap composed of 22 places in 112 ms
[2020-06-03 02:21:10] [INFO ] Deduced a trap composed of 41 places in 96 ms
[2020-06-03 02:21:10] [INFO ] Deduced a trap composed of 92 places in 87 ms
[2020-06-03 02:21:10] [INFO ] Deduced a trap composed of 45 places in 97 ms
[2020-06-03 02:21:10] [INFO ] Deduced a trap composed of 5 places in 94 ms
[2020-06-03 02:21:10] [INFO ] Deduced a trap composed of 29 places in 99 ms
[2020-06-03 02:21:10] [INFO ] Deduced a trap composed of 44 places in 79 ms
[2020-06-03 02:21:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 15 trap constraints in 1822 ms
[2020-06-03 02:21:10] [INFO ] [Real]Absence check using 35 positive place invariants in 21 ms returned sat
[2020-06-03 02:21:10] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 10 ms returned sat
[2020-06-03 02:21:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:21:11] [INFO ] [Real]Absence check using state equation in 288 ms returned sat
[2020-06-03 02:21:11] [INFO ] [Real]Added 68 Read/Feed constraints in 57 ms returned sat
[2020-06-03 02:21:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:21:11] [INFO ] [Nat]Absence check using 35 positive place invariants in 69 ms returned sat
[2020-06-03 02:21:11] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 11 ms returned sat
[2020-06-03 02:21:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:21:11] [INFO ] [Nat]Absence check using state equation in 191 ms returned sat
[2020-06-03 02:21:11] [INFO ] [Nat]Added 68 Read/Feed constraints in 14 ms returned sat
[2020-06-03 02:21:11] [INFO ] Deduced a trap composed of 8 places in 123 ms
[2020-06-03 02:21:11] [INFO ] Deduced a trap composed of 5 places in 120 ms
[2020-06-03 02:21:11] [INFO ] Deduced a trap composed of 10 places in 74 ms
[2020-06-03 02:21:11] [INFO ] Deduced a trap composed of 10 places in 58 ms
[2020-06-03 02:21:11] [INFO ] Deduced a trap composed of 21 places in 53 ms
[2020-06-03 02:21:12] [INFO ] Deduced a trap composed of 25 places in 69 ms
[2020-06-03 02:21:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 587 ms
[2020-06-03 02:21:12] [INFO ] [Real]Absence check using 35 positive place invariants in 23 ms returned sat
[2020-06-03 02:21:12] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 10 ms returned sat
[2020-06-03 02:21:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:21:12] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2020-06-03 02:21:12] [INFO ] [Real]Added 68 Read/Feed constraints in 28 ms returned sat
[2020-06-03 02:21:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:21:12] [INFO ] [Nat]Absence check using 35 positive place invariants in 27 ms returned sat
[2020-06-03 02:21:12] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 10 ms returned sat
[2020-06-03 02:21:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:21:12] [INFO ] [Nat]Absence check using state equation in 193 ms returned sat
[2020-06-03 02:21:12] [INFO ] [Nat]Added 68 Read/Feed constraints in 13 ms returned sat
[2020-06-03 02:21:12] [INFO ] Deduced a trap composed of 6 places in 99 ms
[2020-06-03 02:21:12] [INFO ] Deduced a trap composed of 7 places in 85 ms
[2020-06-03 02:21:13] [INFO ] Deduced a trap composed of 5 places in 96 ms
[2020-06-03 02:21:13] [INFO ] Deduced a trap composed of 5 places in 85 ms
[2020-06-03 02:21:13] [INFO ] Deduced a trap composed of 26 places in 84 ms
[2020-06-03 02:21:13] [INFO ] Deduced a trap composed of 14 places in 93 ms
[2020-06-03 02:21:13] [INFO ] Deduced a trap composed of 24 places in 83 ms
[2020-06-03 02:21:13] [INFO ] Deduced a trap composed of 45 places in 104 ms
[2020-06-03 02:21:13] [INFO ] Deduced a trap composed of 34 places in 92 ms
[2020-06-03 02:21:13] [INFO ] Deduced a trap composed of 7 places in 91 ms
[2020-06-03 02:21:13] [INFO ] Deduced a trap composed of 38 places in 72 ms
[2020-06-03 02:21:13] [INFO ] Deduced a trap composed of 53 places in 72 ms
[2020-06-03 02:21:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 1221 ms
Successfully simplified 7 atomic propositions for a total of 8 simplifications.
[2020-06-03 02:21:14] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-03 02:21:14] [INFO ] Flatten gal took : 144 ms
FORMULA ParamProductionCell-PT-1-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 02:21:14] [INFO ] Applying decomposition
[2020-06-03 02:21:14] [INFO ] Flatten gal took : 24 ms
[2020-06-03 02:21:14] [INFO ] Decomposing Gal with order
[2020-06-03 02:21:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-03 02:21:14] [INFO ] Removed a total of 156 redundant transitions.
[2020-06-03 02:21:14] [INFO ] Flatten gal took : 363 ms
[2020-06-03 02:21:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 73 labels/synchronizations in 27 ms.
[2020-06-03 02:21:14] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 15 ms.
[2020-06-03 02:21:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ ParamProductionCell-PT-1 @ 3570 seconds

FORMULA ParamProductionCell-PT-1-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-1-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-1-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-1-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-1-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-1-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-1-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-1-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-1-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-1-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-1-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-1-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3564
rslt: Output for LTLFireability @ ParamProductionCell-PT-1

{
"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=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 02:21:15 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 1,
"aconj": 5,
"adisj": 0,
"aneg": 5,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (G ((F ((G (((p137 <= 0) OR (p141 <= 0))) AND ((p137 <= 0) OR (p141 <= 0)))) AND (((p137 <= 0) OR (p141 <= 0)) OR (G (((p137 <= 0) OR (p141 <= 0))) AND ((p137 <= 0) OR (p141 <= 0)))))))",
"processed_size": 192,
"rewrites": 99
},
"result":
{
"edges": 260,
"markings": 260,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 5,
"adisj": 0,
"aneg": 1,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 3,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "((F ((F (((1 <= p14) AND (1 <= p145))) AND (((1 <= p18)) AND ((1 <= p22))))) AND G (((1 <= p18) AND (1 <= p22)))) R X (((p96 <= 0) OR (p111 <= 0))))",
"processed_size": 149,
"rewrites": 99
},
"result":
{
"edges": 1227005,
"markings": 180404,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 20
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 5,
"adisj": 3,
"aneg": 0,
"comp": 13,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 13,
"taut": 0,
"tconj": 4,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X ((G (((1 <= p152) AND ((p96 <= 0) OR (p101 <= 0) OR (p161 <= 0)))) OR (G ((F (((p204 <= 0) OR (p215 <= 0))) AND (((1 <= p204) AND (1 <= p215)) OR ((p204 <= 0) OR (p215 <= 0))))) AND (((1 <= p96)) AND (((1 <= p101)) AND ((1 <= p161)))))))",
"processed_size": 243,
"rewrites": 99
},
"result":
{
"edges": 260,
"markings": 260,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 5,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (X (X (G ((G ((G (F (((1 <= p37)))) AND X (((1 <= p76) AND (1 <= p78) AND (1 <= p86))))) AND X (((1 <= p37))))))))",
"processed_size": 116,
"rewrites": 99
},
"result":
{
"edges": 260,
"markings": 260,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 1,
"aneg": 2,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (G (((((p211 <= 0) OR (p225 <= 0)) AND ((p24 <= 0) OR (p28 <= 0))) AND ((p211 <= 0) OR (p225 <= 0)))))",
"processed_size": 107,
"rewrites": 99
},
"result":
{
"edges": 260,
"markings": 260,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"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": "X (X (F (((p9 <= 0) OR (p89 <= 0)))))",
"processed_size": 38,
"rewrites": 99
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 5,
"aconj": 3,
"adisj": 0,
"aneg": 3,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (X (X (F ((X (((p115 <= 0) OR (p125 <= 0))) AND (F (((p115 <= 0) OR (p125 <= 0))) OR X (G (((p115 <= 0) OR (p125 <= 0))))))))))",
"processed_size": 132,
"rewrites": 99
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 712
},
"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": "((p44 <= 0) OR (p51 <= 0))",
"processed_size": 27,
"rewrites": 101
},
"result":
{
"edges": 275,
"markings": 274,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"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": "F (G (((p165 <= 0) OR (p175 <= 0))))",
"processed_size": 37,
"rewrites": 99
},
"result":
{
"edges": 165,
"markings": 164,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"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": "F (G (((p94 <= 0) OR (p105 <= 0))))",
"processed_size": 36,
"rewrites": 99
},
"result":
{
"edges": 165,
"markings": 164,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((G (((1 <= p1) AND (1 <= p60))) AND (((1 <= p93)) AND ((1 <= p115)))))",
"processed_size": 73,
"rewrites": 99
},
"result":
{
"edges": 314,
"markings": 314,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3564
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3564
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"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": "((1 <= p187) AND (1 <= p191))",
"processed_size": 29,
"rewrites": 99
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"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": "((1 <= p187) AND (1 <= p191))",
"processed_size": 29,
"rewrites": 99
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 2,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 0,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G ((F (((1 <= p7) AND (1 <= p36))) AND ((F (((1 <= p112) AND (1 <= p117) AND (1 <= p124))) AND F (G (((1 <= p7) AND (1 <= p36))))) OR ((1 <= p7) AND (1 <= p36)))))",
"processed_size": 163,
"rewrites": 99
},
"result":
{
"edges": 262,
"markings": 262,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 41360,
"runtime": 6.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(G((F((G(*) AND *)) AND (* OR (G(*) AND *))))) : ((F((F(**) AND (** AND **))) AND G(**)) R X(*)) : F(G(*)) : X((G(**) OR (G((F(**) AND (** OR **))) AND (** AND (** AND **))))) : F(**) : (G((F(**) AND ((F(**) AND F(G(**))) OR **))) OR **) : F(G(*)) : X(X(X(G((G((G(F(**)) AND X(**))) AND X(**)))))) : X(G((* AND *))) : X(X(F(*))) : X(X(X(F((X(*) AND (F(*) OR X(G(*)))))))) : F((G(**) AND (** AND **)))"
},
"net":
{
"arcs": 846,
"conflict_clusters": 59,
"places": 231,
"places_significant": 172,
"singleton_clusters": 0,
"transitions": 202
},
"result":
{
"preliminary_value": "no no no no yes no no no no yes yes no ",
"value": "no no no no yes no no no no yes yes no "
},
"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: 433/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 231
lola: finding significant places
lola: 231 places, 202 transitions, 172 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 LTLFireability.xml
lola: LP says that atomic proposition is always true: (p137 <= 1)
lola: LP says that atomic proposition is always true: (p141 <= 1)
lola: LP says that atomic proposition is always true: (p137 <= 1)
lola: LP says that atomic proposition is always true: (p141 <= 1)
lola: LP says that atomic proposition is always true: (p137 <= 1)
lola: LP says that atomic proposition is always true: (p141 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p145 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p165 <= 1)
lola: LP says that atomic proposition is always true: (p175 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p101 <= 1)
lola: LP says that atomic proposition is always true: (p161 <= 1)
lola: LP says that atomic proposition is always true: (p152 <= 1)
lola: LP says that atomic proposition is always true: (p204 <= 1)
lola: LP says that atomic proposition is always true: (p215 <= 1)
lola: LP says that atomic proposition is always true: (p204 <= 1)
lola: LP says that atomic proposition is always true: (p215 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p101 <= 1)
lola: LP says that atomic proposition is always true: (p161 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p147 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p117 <= 1)
lola: LP says that atomic proposition is always true: (p124 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p187 <= 1)
lola: LP says that atomic proposition is always true: (p191 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p105 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p76 <= 1)
lola: LP says that atomic proposition is always true: (p78 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p211 <= 1)
lola: LP says that atomic proposition is always true: (p225 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p211 <= 1)
lola: LP says that atomic proposition is always true: (p225 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p115 <= 1)
lola: LP says that atomic proposition is always true: (p125 <= 1)
lola: LP says that atomic proposition is always true: (p115 <= 1)
lola: LP says that atomic proposition is always true: (p125 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p115 <= 1)
lola: G ((NOT(X (((1 <= p137) AND (1 <= p141)))) U (NOT(F (X (((1 <= p137) AND (1 <= p141))))) AND NOT(X (((1 <= p137) AND (1 <= p141))))))) : NOT(((NOT(F (((F (((1 <= p14) AND (1 <= p145))) AND ((1 <= p18))) AND ((1 <= p22))))) OR NOT(G (((1 <= p18) AND (1 <= p22))))) U X (((1 <= p96) AND (1 <= p111))))) : NOT(X (X (G (F (((1 <= p165) AND (1 <= p175))))))) : X ((G (((1 <= p152) AND ((p96 <= 0) OR (p101 <= 0) OR (p161 <= 0)))) OR (((G ((((1 <= p204) AND (1 <= p215)) U ((p204 <= 0) OR (p215 <= 0)))) AND ((1 <= p96))) AND ((1 <= p101))) AND ((1 <= p161))))) : (G (NOT(F (G (((((1 <= p44) AND (1 <= p51)) U (1 <= 0)) AND X (((1 <= p147)))))))) U ((1 <= p44) AND (1 <= p51))) : (G (((F (((1 <= p112) AND (1 <= p117) AND (1 <= p124))) AND F (G (((1 <= p7) AND (1 <= p36))))) U ((1 <= p7) AND (1 <= p36)))) OR ((1 <= p187) AND (1 <= p191))) : F (NOT(((1 <= 0) U F (((1 <= p94) AND (1 <= p105)))))) : X (X (X (G ((G ((G (X (F (((1 <= p37))))) AND X (((1 <= p76) AND (1 <= p78) AND (1 <= p86))))) AND X (((1 <= p37)))))))) : (NOT(F (X (F ((((1 <= p211) AND (1 <= p225)) OR ((1 <= p24) AND (1 <= p28))))))) AND NOT(X (F (((1 <= p211) AND (1 <= p225)))))) : NOT(X (G (X (((1 <= p9) AND (1 <= p89)))))) : F (NOT(X (G (X (X ((G (((1 <= p115) AND (1 <= p125))) U X (((1 <= p115) AND (1 <= p125)))))))))) : F (((G (((1 <= p1) AND (1 <= p60))) AND ((1 <= p93))) AND ((1 <= p115))))
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((F ((G (((p137 <= 0) OR (p141 <= 0))) AND ((p137 <= 0) OR (p141 <= 0)))) AND (((p137 <= 0) OR (p141 <= 0)) OR (G (((p137 <= 0) OR (p141 <= 0))) AND ((p137 <= 0) OR (p141 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F ((G (((p137 <= 0) OR (p141 <= 0))) AND ((p137 <= 0) OR (p141 <= 0)))) AND (((p137 <= 0) OR (p141 <= 0)) OR (G (((p137 <= 0) OR (p141 <= 0))) AND ((p137 <= 0) OR (p141 <= 0)))))))
lola: processed formula length: 192
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 260 markings, 260 edges
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F ((F (((1 <= p14) AND (1 <= p145))) AND (((1 <= p18)) AND ((1 <= p22))))) AND G (((1 <= p18) AND (1 <= p22)))) R X (((p96 <= 0) OR (p111 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((F ((F (((1 <= p14) AND (1 <= p145))) AND (((1 <= p18)) AND ((1 <= p22))))) AND G (((1 <= p18) AND (1 <= p22)))) R X (((p96 <= 0) OR (p111 <= 0))))
lola: processed formula length: 149
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 20 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 180404 markings, 1227005 edges
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (((1 <= p152) AND ((p96 <= 0) OR (p101 <= 0) OR (p161 <= 0)))) OR (G ((F (((p204 <= 0) OR (p215 <= 0))) AND (((1 <= p204) AND (1 <= p215)) OR ((p204 <= 0) OR (p215 <= 0))))) AND (((1 <= p96)) AND (((1 <= p101)) AND ((1 <= p161)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (((1 <= p152) AND ((p96 <= 0) OR (p101 <= 0) OR (p161 <= 0)))) OR (G ((F (((p204 <= 0) OR (p215 <= 0))) AND (((1 <= p204) AND (1 <= p215)) OR ((p204 <= 0) OR (p215 <= 0))))) AND (((1 <= p96)) AND (((1 <= p101)) AND ((1 <= p161)))))))
lola: processed formula length: 243
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 10 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 260 markings, 260 edges
lola: ========================================
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (G ((G ((G (F (((1 <= p37)))) AND X (((1 <= p76) AND (1 <= p78) AND (1 <= p86))))) AND X (((1 <= p37))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (G ((G ((G (F (((1 <= p37)))) AND X (((1 <= p76) AND (1 <= p78) AND (1 <= p86))))) AND X (((1 <= p37))))))))
lola: processed formula length: 116
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 10 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 260 markings, 260 edges
lola: ========================================
lola: subprocess 4 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((((p211 <= 0) OR (p225 <= 0)) AND ((p24 <= 0) OR (p28 <= 0))) AND ((p211 <= 0) OR (p225 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((((p211 <= 0) OR (p225 <= 0)) AND ((p24 <= 0) OR (p28 <= 0))) AND ((p211 <= 0) OR (p225 <= 0)))))
lola: processed formula length: 107
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 260 markings, 260 edges
lola: ========================================
lola: subprocess 5 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F (((p9 <= 0) OR (p89 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F (((p9 <= 0) OR (p89 <= 0)))))
lola: processed formula length: 38
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3 markings, 2 edges
lola: subprocess 6 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (F ((X (((p115 <= 0) OR (p125 <= 0))) AND (F (((p115 <= 0) OR (p125 <= 0))) OR X (G (((p115 <= 0) OR (p125 <= 0))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (F ((X (((p115 <= 0) OR (p125 <= 0))) AND (F (((p115 <= 0) OR (p125 <= 0))) OR X (G (((p115 <= 0) OR (p125 <= 0))))))))))
lola: processed formula length: 132
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
lola: ========================================
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 7 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p44) AND (1 <= p51)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p44 <= 0) OR (p51 <= 0))
lola: processed formula length: 27
lola: 101 rewrites
lola: closed formula file LTLFireability.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: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 274 markings, 275 edges
lola: ========================================
lola: subprocess 8 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p165 <= 0) OR (p175 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((p165 <= 0) OR (p175 <= 0))))
lola: processed formula length: 37
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 165
lola: add low 164
lola: add low 163
lola: add low 170
lola: add low 171
lola: add low 169
lola: add low 168
lola: add low 120
lola: add low 0
lola: add low 121
lola: add low 10
lola: add low 11
lola: add low 9
lola: add low 8
lola: add low 6
lola: add low 7
lola: add low 5
lola: add low 4
lola: add low 1
lola: add low 60
lola: add low 61
lola: add low 93
lola: add low 101
lola: add low 102
lola: add low 100
lola: add low 99
lola: add low 110
lola: add low 111
lola: add low 109
lola: add low 108
lola: add low 107
lola: add low 114
lola: add low 115
lola: add low 113
lola: add low 112
lola: add low 66
lola: add low 2
lola: add low 62
lola: add low 63
lola: add low 14
lola: add low 67
lola: add low 15
lola: add low 13
lola: add low 12
lola: add low 3
lola: add low 70
lola: add low 81
lola: add low 82
lola: add low 80
lola: add low 79
lola: add low 86
lola: add low 87
lola: add low 85
lola: add low 84
lola: add low 83
lola: add low 90
lola: add low 91
lola: add low 89
lola: add low 88
lola: add low 64
lola: add low 65
lola: add low 36
lola: add low 37
lola: add low 42
lola: add low 43
lola: add low 41
lola: add low 40
lola: add low 46
lola: add low 47
lola: add low 45
lola: add low 44
lola: add low 38
lola: add low 172
lola: add low 39
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 164 markings, 165 edges
lola: ========================================
lola: subprocess 9 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p94 <= 0) OR (p105 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((p94 <= 0) OR (p105 <= 0))))
lola: processed formula length: 36
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 82
lola: add low 80
lola: add low 79
lola: add low 86
lola: add low 87
lola: add low 85
lola: add low 84
lola: add low 83
lola: add low 90
lola: add low 91
lola: add low 89
lola: add low 88
lola: add low 64
lola: add low 65
lola: add low 36
lola: add low 37
lola: add low 42
lola: add low 43
lola: add low 41
lola: add low 40
lola: add low 46
lola: add low 47
lola: add low 45
lola: add low 44
lola: add low 38
lola: add low 172
lola: add low 39
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 164 markings, 165 edges
lola: ========================================
lola: subprocess 10 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G (((1 <= p1) AND (1 <= p60))) AND (((1 <= p93)) AND ((1 <= p115)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G (((1 <= p1) AND (1 <= p60))) AND (((1 <= p93)) AND ((1 <= p115)))))
lola: processed formula length: 73
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 314 markings, 314 edges
lola: ========================================
lola: subprocess 11 will run for 3564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((F (((1 <= p7) AND (1 <= p36))) AND ((F (((1 <= p112) AND (1 <= p117) AND (1 <= p124))) AND F (G (((1 <= p7) AND (1 <= p36))))) OR ((1 <= p7) AND (1 <= p36))))) OR ((1 <= p187) AND (1 <= p191)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 3564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p187) AND (1 <= p191))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p187) AND (1 <= p191))
lola: processed formula length: 29
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 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: 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: (G ((F (((1 <= p7) AND (1 <= p36))) AND ((F (((1 <= p112) AND (1 <= p117) AND (1 <= p124))) AND F (G (((1 <= p7) AND (1 <= p36))))) OR ((1 <= p7) AND (1 <= p36))))) OR ((1 <= p187) AND (1 <= p191)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((1 <= p187) AND (1 <= p191))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p187) AND (1 <= p191))
lola: processed formula length: 29
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 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: ========================================
lola: ...considering subproblem: G ((F (((1 <= p7) AND (1 <= p36))) AND ((F (((1 <= p112) AND (1 <= p117) AND (1 <= p124))) AND F (G (((1 <= p7) AND (1 <= p36))))) OR ((1 <= p7) AND (1 <= p36)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (((1 <= p7) AND (1 <= p36))) AND ((F (((1 <= p112) AND (1 <= p117) AND (1 <= p124))) AND F (G (((1 <= p7) AND (1 <= p36))))) OR ((1 <= p7) AND (1 <= p36)))))
lola: processed formula length: 163
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 262 markings, 262 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no yes no no no no yes yes no
lola:
preliminary result: no no no no yes no no no no yes yes no
lola: memory consumption: 41360 KB
lola: time consumption: 6 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.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="ParamProductionCell-PT-1"
export BK_EXAMINATION="LTLFireability"
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 ParamProductionCell-PT-1, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r174-csrt-158987853300474"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ParamProductionCell-PT-1.tgz
mv ParamProductionCell-PT-1 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;