Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r168-smll-158987806500284.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/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 CloudDeployment-PT-3a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-smll-158987806500284
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 268K
-rw-r--r-- 1 mcc users 2.9K Mar 30 01:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 30 01:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 28 15:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 28 15:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 8 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 27 08:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 08:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 26 07:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K Mar 26 07:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 97K 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 CloudDeployment-PT-3a-CTLFireability-00
FORMULA_NAME CloudDeployment-PT-3a-CTLFireability-01
FORMULA_NAME CloudDeployment-PT-3a-CTLFireability-02
FORMULA_NAME CloudDeployment-PT-3a-CTLFireability-03
FORMULA_NAME CloudDeployment-PT-3a-CTLFireability-04
FORMULA_NAME CloudDeployment-PT-3a-CTLFireability-05
FORMULA_NAME CloudDeployment-PT-3a-CTLFireability-06
FORMULA_NAME CloudDeployment-PT-3a-CTLFireability-07
FORMULA_NAME CloudDeployment-PT-3a-CTLFireability-08
FORMULA_NAME CloudDeployment-PT-3a-CTLFireability-09
FORMULA_NAME CloudDeployment-PT-3a-CTLFireability-10
FORMULA_NAME CloudDeployment-PT-3a-CTLFireability-11
FORMULA_NAME CloudDeployment-PT-3a-CTLFireability-12
FORMULA_NAME CloudDeployment-PT-3a-CTLFireability-13
FORMULA_NAME CloudDeployment-PT-3a-CTLFireability-14
FORMULA_NAME CloudDeployment-PT-3a-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591269926326

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 11:25:29] [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-04 11:25:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 11:25:29] [INFO ] Load time of PNML (sax parser for PT used): 141 ms
[2020-06-04 11:25:29] [INFO ] Transformed 104 places.
[2020-06-04 11:25:29] [INFO ] Transformed 308 transitions.
[2020-06-04 11:25:29] [INFO ] Found NUPN structural information;
[2020-06-04 11:25:29] [INFO ] Parsed PT model containing 104 places and 308 transitions in 232 ms.
Ensure Unique test removed 30 transitions
Reduce redundant transitions removed 30 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 52 ms.
Incomplete random walk after 100000 steps, including 2126 resets, run finished after 855 ms. (steps per millisecond=116 ) properties seen :[1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1]
[2020-06-04 11:25:30] [INFO ] Flow matrix only has 159 transitions (discarded 119 similar events)
// Phase 1: matrix 159 rows 104 cols
[2020-06-04 11:25:30] [INFO ] Computed 18 place invariants in 14 ms
[2020-06-04 11:25:30] [INFO ] [Real]Absence check using 0 positive and 18 generalized place invariants in 37 ms returned sat
[2020-06-04 11:25:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 11:25:30] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2020-06-04 11:25:30] [INFO ] State equation strengthened by 56 read => feed constraints.
[2020-06-04 11:25:30] [INFO ] [Real]Added 56 Read/Feed constraints in 27 ms returned sat
[2020-06-04 11:25:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 11:25:30] [INFO ] [Nat]Absence check using 0 positive and 18 generalized place invariants in 27 ms returned sat
[2020-06-04 11:25:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 11:25:31] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2020-06-04 11:25:31] [INFO ] [Nat]Added 56 Read/Feed constraints in 24 ms returned sat
[2020-06-04 11:25:31] [INFO ] Computed and/alt/rep : 277/1375/158 causal constraints in 37 ms.
[2020-06-04 11:25:31] [INFO ] Added : 104 causal constraints over 21 iterations in 608 ms. Result :sat
[2020-06-04 11:25:31] [INFO ] [Real]Absence check using 0 positive and 18 generalized place invariants in 18 ms returned sat
[2020-06-04 11:25:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 11:25:32] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2020-06-04 11:25:32] [INFO ] [Real]Added 56 Read/Feed constraints in 23 ms returned sat
[2020-06-04 11:25:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 11:25:32] [INFO ] [Nat]Absence check using 0 positive and 18 generalized place invariants in 18 ms returned sat
[2020-06-04 11:25:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 11:25:32] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2020-06-04 11:25:32] [INFO ] [Nat]Added 56 Read/Feed constraints in 20 ms returned sat
[2020-06-04 11:25:32] [INFO ] Computed and/alt/rep : 277/1375/158 causal constraints in 28 ms.
[2020-06-04 11:25:32] [INFO ] Added : 102 causal constraints over 21 iterations in 580 ms. Result :sat
[2020-06-04 11:25:32] [INFO ] [Real]Absence check using 0 positive and 18 generalized place invariants in 20 ms returned sat
[2020-06-04 11:25:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 11:25:33] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2020-06-04 11:25:33] [INFO ] [Real]Added 56 Read/Feed constraints in 21 ms returned sat
[2020-06-04 11:25:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 11:25:33] [INFO ] [Nat]Absence check using 0 positive and 18 generalized place invariants in 16 ms returned sat
[2020-06-04 11:25:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 11:25:33] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2020-06-04 11:25:33] [INFO ] [Nat]Added 56 Read/Feed constraints in 16 ms returned sat
[2020-06-04 11:25:33] [INFO ] Computed and/alt/rep : 277/1375/158 causal constraints in 37 ms.
[2020-06-04 11:25:33] [INFO ] Added : 103 causal constraints over 21 iterations in 426 ms. Result :sat
[2020-06-04 11:25:33] [INFO ] [Real]Absence check using 0 positive and 18 generalized place invariants in 11 ms returned sat
[2020-06-04 11:25:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 11:25:33] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2020-06-04 11:25:33] [INFO ] [Real]Added 56 Read/Feed constraints in 12 ms returned sat
[2020-06-04 11:25:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 11:25:33] [INFO ] [Nat]Absence check using 0 positive and 18 generalized place invariants in 22 ms returned sat
[2020-06-04 11:25:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 11:25:34] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2020-06-04 11:25:34] [INFO ] [Nat]Added 56 Read/Feed constraints in 23 ms returned sat
[2020-06-04 11:25:34] [INFO ] Computed and/alt/rep : 277/1375/158 causal constraints in 34 ms.
[2020-06-04 11:25:34] [INFO ] Added : 102 causal constraints over 21 iterations in 523 ms. Result :sat
[2020-06-04 11:25:34] [INFO ] [Real]Absence check using 0 positive and 18 generalized place invariants in 10 ms returned sat
[2020-06-04 11:25:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 11:25:34] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2020-06-04 11:25:34] [INFO ] [Real]Added 56 Read/Feed constraints in 19 ms returned sat
[2020-06-04 11:25:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 11:25:34] [INFO ] [Nat]Absence check using 0 positive and 18 generalized place invariants in 20 ms returned sat
[2020-06-04 11:25:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 11:25:35] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2020-06-04 11:25:35] [INFO ] [Nat]Added 56 Read/Feed constraints in 27 ms returned sat
[2020-06-04 11:25:35] [INFO ] Computed and/alt/rep : 277/1375/158 causal constraints in 17 ms.
[2020-06-04 11:25:35] [INFO ] Added : 98 causal constraints over 20 iterations in 364 ms. Result :sat
[2020-06-04 11:25:35] [INFO ] [Real]Absence check using 0 positive and 18 generalized place invariants in 16 ms returned sat
[2020-06-04 11:25:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 11:25:35] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2020-06-04 11:25:35] [INFO ] [Real]Added 56 Read/Feed constraints in 17 ms returned sat
[2020-06-04 11:25:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 11:25:35] [INFO ] [Nat]Absence check using 0 positive and 18 generalized place invariants in 14 ms returned sat
[2020-06-04 11:25:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 11:25:35] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2020-06-04 11:25:35] [INFO ] [Nat]Added 56 Read/Feed constraints in 14 ms returned sat
[2020-06-04 11:25:35] [INFO ] Computed and/alt/rep : 277/1375/158 causal constraints in 31 ms.
[2020-06-04 11:25:36] [INFO ] Added : 108 causal constraints over 22 iterations in 417 ms. Result :sat
[2020-06-04 11:25:36] [INFO ] [Real]Absence check using 0 positive and 18 generalized place invariants in 19 ms returned sat
[2020-06-04 11:25:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 11:25:36] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2020-06-04 11:25:36] [INFO ] [Real]Added 56 Read/Feed constraints in 13 ms returned sat
[2020-06-04 11:25:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 11:25:36] [INFO ] [Nat]Absence check using 0 positive and 18 generalized place invariants in 33 ms returned sat
[2020-06-04 11:25:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 11:25:36] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2020-06-04 11:25:36] [INFO ] [Nat]Added 56 Read/Feed constraints in 22 ms returned sat
[2020-06-04 11:25:36] [INFO ] Computed and/alt/rep : 277/1375/158 causal constraints in 31 ms.
[2020-06-04 11:25:37] [INFO ] Added : 103 causal constraints over 21 iterations in 397 ms. Result :sat
[2020-06-04 11:25:37] [INFO ] [Real]Absence check using 0 positive and 18 generalized place invariants in 17 ms returned sat
[2020-06-04 11:25:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 11:25:37] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2020-06-04 11:25:37] [INFO ] [Real]Added 56 Read/Feed constraints in 18 ms returned sat
[2020-06-04 11:25:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 11:25:37] [INFO ] [Nat]Absence check using 0 positive and 18 generalized place invariants in 13 ms returned sat
[2020-06-04 11:25:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 11:25:37] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2020-06-04 11:25:37] [INFO ] [Nat]Added 56 Read/Feed constraints in 16 ms returned sat
[2020-06-04 11:25:37] [INFO ] Computed and/alt/rep : 277/1375/158 causal constraints in 35 ms.
[2020-06-04 11:25:38] [INFO ] Added : 103 causal constraints over 22 iterations in 550 ms. Result :sat
[2020-06-04 11:25:38] [INFO ] Flatten gal took : 125 ms
[2020-06-04 11:25:38] [INFO ] Flatten gal took : 50 ms
[2020-06-04 11:25:38] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 17 ms.
[2020-06-04 11:25:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 7 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ CloudDeployment-PT-3a @ 3570 seconds

FORMULA CloudDeployment-PT-3a-CTLFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudDeployment-PT-3a-CTLFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudDeployment-PT-3a-CTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudDeployment-PT-3a-CTLFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudDeployment-PT-3a-CTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudDeployment-PT-3a-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudDeployment-PT-3a-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudDeployment-PT-3a-CTLFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudDeployment-PT-3a-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudDeployment-PT-3a-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudDeployment-PT-3a-CTLFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudDeployment-PT-3a-CTLFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudDeployment-PT-3a-CTLFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudDeployment-PT-3a-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudDeployment-PT-3a-CTLFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudDeployment-PT-3a-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3546
rslt: Output for CTLFireability @ CloudDeployment-PT-3a

{
"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",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 11:25:40 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "((p75 <= 0))",
"processed_size": 12,
"rewrites": 51
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 4,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "(((1 <= p19)) OR ((p2 <= 0)) OR ((p4 <= 0)) OR ((p28 <= 0)) OR ((p91 <= 0)))",
"processed_size": 76,
"rewrites": 58
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"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": "E (G (((1 <= p2) AND (1 <= p4) AND (1 <= p16) AND (1 <= p95) AND (1 <= p102))))",
"processed_size": 79,
"rewrites": 52
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 126
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 5,
"problems": 5
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"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": "E (F (((1 <= p45) AND (1 <= p7))))",
"processed_size": 34,
"rewrites": 52
},
"result":
{
"edges": 22,
"markings": 23,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "((p2 <= 0) OR (p32 <= 0))",
"processed_size": 26,
"rewrites": 51
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "EF(A(((1 <= p80)) U ((1 <= p30) AND (1 <= p32) AND (1 <= p45) AND (1 <= p95) AND (1 <= p102))))",
"processed_size": 95,
"rewrites": 53
},
"net":
{
"conflict_clusters": 28,
"singleton_clusters": 0
},
"result":
{
"edges": 1112242,
"markings": 56205,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 2,
"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": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 14,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "AG((AF(((p2 <= 0) OR (p4 <= 0) OR (p26 <= 0) OR (p95 <= 0) OR (p102 <= 0))) OR (EX(((1 <= p47))) OR ((1 <= p58) AND (1 <= p60) AND (1 <= p81) AND (1 <= p95) AND (1 <= p102) AND (1 <= p30) AND (1 <= p32) AND (1 <= p34)))))",
"processed_size": 225,
"rewrites": 54
},
"net":
{
"conflict_clusters": 28,
"singleton_clusters": 0
},
"result":
{
"edges": 3491172,
"markings": 172846,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 273
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "EF(A(((1 <= p11)) U ((1 <= p2) AND (1 <= p4) AND (1 <= p13) AND (1 <= p95) AND (1 <= p102))))",
"processed_size": 93,
"rewrites": 53
},
"net":
{
"conflict_clusters": 28,
"singleton_clusters": 0
},
"result":
{
"edges": 2066830,
"markings": 103659,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 296
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"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": "AX(AG(EF(((1 <= p81)))))",
"processed_size": 24,
"rewrites": 54
},
"net":
{
"conflict_clusters": 28,
"singleton_clusters": 0
},
"result":
{
"edges": 31445,
"markings": 1893,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 323
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 3,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "EX((EF(((1 <= p13))) AND (((p80 <= 0) OR (p30 <= 0) OR (p32 <= 0) OR (p50 <= 0) OR (p95 <= 0) OR (p102 <= 0)) OR EX(((1 <= p60) AND (1 <= p62))))))",
"processed_size": 152,
"rewrites": 54
},
"net":
{
"conflict_clusters": 28,
"singleton_clusters": 0
},
"result":
{
"edges": 1148,
"markings": 103,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 355
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"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 <= p58) AND (1 <= p60) AND (1 <= p75) AND (1 <= p95) AND (1 <= p102))",
"processed_size": 73,
"rewrites": 53
},
"result":
{
"edges": 9,
"markings": 10,
"produced_by": "state space /EXEF",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 5,
"problems": 5
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 395
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"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 <= p42))))",
"processed_size": 20,
"rewrites": 52
},
"result":
{
"edges": 9,
"markings": 10,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 7,
"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": 444
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 7,
"adisj": 0,
"aneg": 0,
"comp": 15,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 5,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "EF((A(((1 <= p58) AND (1 <= p60) AND (1 <= p73) AND (1 <= p95) AND (1 <= p102)) U ((1 <= p2) AND (1 <= p4) AND (1 <= p6) AND (1 <= p95) AND (1 <= p102))) AND (((1 <= p30)) AND (((1 <= p32)) AND (((1 <= p50)) AND (((1 <= p95)) AND ((1 <= p102))))))))",
"processed_size": 249,
"rewrites": 53
},
"net":
{
"conflict_clusters": 28,
"singleton_clusters": 0
},
"result":
{
"edges": 2649431,
"markings": 132263,
"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": 507
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 507
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"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 <= p48))",
"processed_size": 12,
"rewrites": 51
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 592
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"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 <= p67))))",
"processed_size": 20,
"rewrites": 52
},
"result":
{
"edges": 15,
"markings": 16,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 10,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 592
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"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": "(((1 <= p67)) OR ((1 <= p32) AND (1 <= p58)))",
"processed_size": 45,
"rewrites": 52
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 710
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"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": "E (F (((1 <= p58) AND (1 <= p60) AND (1 <= p72) AND (1 <= p95) AND (1 <= p102))))",
"processed_size": 81,
"rewrites": 52
},
"result":
{
"edges": 10,
"markings": 11,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 5,
"problems": 5
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 710
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 7,
"adisj": 3,
"aneg": 0,
"comp": 19,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 19,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "E ((((p58 <= 0) OR (p60 <= 0) OR (p81 <= 0) OR (p95 <= 0) OR (p102 <= 0) OR (p50 <= 0) OR ((1 <= p14))) U ((1 <= p58) AND (1 <= p60) AND (1 <= p69) AND (1 <= p95) AND (1 <= p102) AND (((1 <= p71)) OR ((1 <= p2)) OR ((1 <= p72))) AND (((1 <= p70)) OR ((1 <= p30) AND (1 <= p32) AND (1 <= p41))))))",
"processed_size": 305,
"rewrites": 54
},
"result":
{
"edges": 653811,
"markings": 35499,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 70
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 48,
"problems": 6
},
"type": "existential_until",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 888
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "G ((F (((p2 <= 0) OR (p4 <= 0) OR (p22 <= 0) OR (p95 <= 0) OR (p102 <= 0))) OR ((1 <= p60) AND (1 <= p67))))",
"processed_size": 112,
"rewrites": 53
},
"result":
{
"edges": 1824485,
"markings": 142856,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "universal single path",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1183
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 3,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "G ((((p32 <= 0) OR (p42 <= 0) OR (p80 <= 0) OR (p30 <= 0) OR (p53 <= 0) OR (p95 <= 0) OR (p102 <= 0) OR (p60 <= 0)) OR (((1 <= p17)) AND F (((p60 <= 0) OR (p73 <= 0))))))",
"processed_size": 178,
"rewrites": 63
},
"result":
{
"edges": 2626289,
"markings": 185142,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "existential single path",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1773
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "((1 <= p1) AND (1 <= p3) AND (1 <= p5) AND (1 <= p29) AND (1 <= p31) AND (1 <= p33) AND (1 <= p57) AND (1 <= p59) AND (1 <= p61) AND (1 <= p85))",
"processed_size": 144,
"rewrites": 51
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3547
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "A (G (((p8 <= 0))))",
"processed_size": 19,
"rewrites": 53
},
"result":
{
"edges": 11,
"markings": 12,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3547
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "((p58 <= 0) OR (p60 <= 0) OR (p80 <= 0) OR (p95 <= 0) OR (p102 <= 0) OR (p30 <= 0) OR (p32 <= 0) OR (p56 <= 0) OR (p94 <= 0) OR (p4 <= 0))",
"processed_size": 147,
"rewrites": 51
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 5,
"aneg": 0,
"comp": 20,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "((p58 <= 0) OR (p60 <= 0) OR (p67 <= 0) OR (p95 <= 0) OR (p102 <= 0) OR (((p48 <= 0)) AND ((p58 <= 0) OR (p60 <= 0) OR (p81 <= 0) OR (p95 <= 0) OR (p102 <= 0)) AND ((p30 <= 0) OR (p32 <= 0) OR (p56 <= 0) OR (p98 <= 0)) AND ((p2 <= 0) OR (p4 <= 0) OR (p16 <= 0) OR (p95 <= 0) OR (p102 <= 0))))",
"processed_size": 308,
"rewrites": 51
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 17,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "E ((((p81 <= 0)) R ((p58 <= 0) OR (p60 <= 0) OR (p73 <= 0) OR (p95 <= 0) OR (p102 <= 0))))",
"processed_size": 94,
"rewrites": 54
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /ER",
"value": true
},
"task":
{
"compoundnumber": 18,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 64
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 5,
"problems": 5
},
"type": "existential_release",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "((p58 <= 0) OR (p60 <= 0) OR (p80 <= 0) OR (p95 <= 0) OR (p102 <= 0) OR (p30 <= 0) OR (p32 <= 0) OR (p56 <= 0) OR (p94 <= 0) OR (p4 <= 0))",
"processed_size": 147,
"rewrites": 51
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 16,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"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": "A (G (((p58 <= 0) OR (p87 <= 0) OR (p43 <= 0))))",
"processed_size": 50,
"rewrites": 53
},
"result":
{
"edges": 35856,
"markings": 9873,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 16,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 95712,
"runtime": 23.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "((E(F(**)) OR (E(G(**)) OR E(X(**)))) AND ((A(X(**)) OR (A(G(**)) OR (** OR (** OR (** OR (** OR **)))))) AND (** OR E(X(A(G(**))))))) : (E(F(**)) OR (** OR **)) : (E(F(A((** U **)))) OR (E(X(**)) AND **)) : A(G((A(F(**)) OR (E(X(**)) OR **)))) : E((** U **)) : E(F(**)) : (E(X(**)) OR E(F(A((** U **))))) : A(X(A(G(E(F(**)))))) : A(G((A(F(**)) OR **))) : (A(G(**)) OR (** AND E((** U **)))) : (E(F(**)) OR **) : E(X((E(F(**)) AND (** OR E(X(**)))))) : E(F((** AND (** OR E(G(**)))))) : E(X(E(F(*)))) : (A(G(*)) AND (E((* R *)) AND (** AND (** OR A(G(*)))))) : E(F((A((** U **)) AND (** AND (** AND (** AND (** AND **)))))))"
},
"net":
{
"arcs": 1515,
"conflict_clusters": 28,
"places": 104,
"places_significant": 86,
"singleton_clusters": 0,
"transitions": 278
},
"result":
{
"preliminary_value": "yes yes yes no yes yes yes no no no yes yes no yes no yes ",
"value": "yes yes yes no yes yes yes no no no yes yes no yes no 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: 382/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 104
lola: finding significant places
lola: 104 places, 278 transitions, 86 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: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p75 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p80 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p81 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p81 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: LP says that atomic proposition is always true: (p81 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p57 <= 1)
lola: LP says that atomic proposition is always true: (p59 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p81 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p80 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p80 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p80 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p73 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p75 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p81 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p73 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p81 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p80 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p73 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: ((((E (F (((1 <= p45) AND (1 <= p7)))) OR E (G (((1 <= p2) AND (1 <= p4) AND (1 <= p16) AND (1 <= p95) AND (1 <= p102))))) OR E (X (((1 <= p58) AND (1 <= p60) AND (1 <= p69) AND (1 <= p95) AND (1 <= p102))))) AND ((((((A (X (((1 <= p17)))) OR A (G (((1 <= p71))))) OR ((1 <= p19))) OR ((p2 <= 0))) OR ((p4 <= 0))) OR ((p28 <= 0))) OR ((p91 <= 0)))) AND (((p75 <= 0)) OR E (X (A (G (((1 <= p58) AND (1 <= p60) AND (1 <= p72) AND (1 <= p95) AND (1 <= p102)))))))) : ((E (F (E (F (((1 <= p58) AND (1 <= p60) AND (1 <= p72) AND (1 <= p95) AND (1 <= p102)))))) OR ((1 <= p67))) OR ((1 <= p32) AND (1 <= p58))) : (E (F (A ((((1 <= p80)) U ((1 <= p30) AND (1 <= p32) AND (1 <= p45) AND (1 <= p95) AND (1 <= p102)))))) OR (E (X (((1 <= p43)))) AND ((p2 <= 0) OR (p32 <= 0)))) : A (G (((A (F (((p2 <= 0) OR (p4 <= 0) OR (p26 <= 0) OR (p95 <= 0) OR (p102 <= 0)))) OR E (X (((1 <= p47))))) OR ((1 <= p58) AND (1 <= p60) AND (1 <= p81) AND (1 <= p95) AND (1 <= p102) AND (1 <= p30) AND (1 <= p32) AND (1 <= p34))))) : E ((((p58 <= 0) OR (p60 <= 0) OR (p81 <= 0) OR (p95 <= 0) OR (p102 <= 0) OR (p50 <= 0) OR ((1 <= p14))) U ((1 <= p58) AND (1 <= p60) AND (1 <= p69) AND (1 <= p95) AND (1 <= p102) AND (((1 <= p71)) OR ((1 <= p2)) OR ((1 <= p72))) AND (((1 <= p70)) OR ((1 <= p30) AND (1 <= p32) AND (1 <= p41)))))) : E ((((((p11 <= 0)) OR E (X (((1 <= p71))))) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p26) AND (1 <= p95) AND (1 <= p102))) U E (F (((1 <= p42)))))) : (E (X (((1 <= p39)))) OR E (F (A ((((1 <= p11)) U ((1 <= p2) AND (1 <= p4) AND (1 <= p13) AND (1 <= p95) AND (1 <= p102))))))) : A (X (A (G (E (F (((1 <= p81)))))))) : A (G ((A (F (((p2 <= 0) OR (p4 <= 0) OR (p22 <= 0) OR (p95 <= 0) OR (p102 <= 0)))) OR ((1 <= p60) AND (1 <= p67))))) : (A (G (((p8 <= 0)))) OR (((1 <= p1) AND (1 <= p3) AND (1 <= p5) AND (1 <= p29) AND (1 <= p31) AND (1 <= p33) AND (1 <= p57) AND (1 <= p59) AND (1 <= p61) AND (1 <= p85)) AND E ((((1 <= p52) AND (1 <= p81)) U ((1 <= p58) AND (1 <= p60) AND (1 <= p80) AND (1 <= p95) AND (1 <= p102) AND (1 <= p7)))))) : (A ((((1 <= p23)) U E (F (((1 <= p67)))))) OR ((1 <= p48))) : E (X ((E (F (((1 <= p13)))) AND (((p80 <= 0) OR (p30 <= 0) OR (p32 <= 0) OR (p50 <= 0) OR (p95 <= 0) OR (p102 <= 0)) OR E (X (((1 <= p60) AND (1 <= p62)))))))) : E (F ((((1 <= p32) AND (1 <= p42) AND (1 <= p80) AND (1 <= p30) AND (1 <= p53) AND (1 <= p95) AND (1 <= p102) AND (1 <= p60)) AND (((p17 <= 0)) OR E (G (((1 <= p60) AND (1 <= p73)))))))) : NOT(A (X (A (G (((p58 <= 0) OR (p60 <= 0) OR (p75 <= 0) OR (p95 <= 0) OR (p102 <= 0))))))) : (((NOT(E (F (((1 <= p58) AND (1 <= p87) AND (1 <= p43))))) AND NOT(A ((((1 <= p81)) U ((1 <= p58) AND (1 <= p60) AND (1 <= p73) AND (1 <= p95) AND (1 <= p102)))))) AND ((p58 <= 0) OR (p60 <= 0) OR (p67 <= 0) OR (p95 <= 0) OR (p102 <= 0) OR (((p48 <= 0)) AND ((p58 <= 0) OR (p60 <= 0) OR (p81 <= 0) OR (p95 <= 0) OR (p102 <= 0)) AND ((p30 <= 0) OR (p32 <= 0) OR (p56 <= 0) OR (p98 <= 0)) AND ((p2 <= 0) OR (p4 <= 0) OR (p16 <= 0) OR (p95 <= 0) OR (p102 <= 0))))) AND (((p58 <= 0) OR (p60 <= 0) OR (p80 <= 0) OR (p95 <= 0) OR (p102 <= 0) OR (p30 <= 0) OR (p32 <= 0) OR (p56 <= 0) OR (p94 <= 0) OR (p4 <= 0)) OR NOT(E (F (((1 <= p32) AND (1 <= p36))))))) : E (F ((((((A ((((1 <= p58) AND (1 <= p60) AND (1 <= p73) AND (1 <= p95) AND (1 <= p102)) U ((1 <= p2) AND (1 <= p4) AND (1 <= p6) AND (1 <= p95) AND (1 <= p102)))) AND ((1 <= p30))) AND ((1 <= p32))) AND ((1 <= p50))) AND ((1 <= p95))) AND ((1 <= p102)))))
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:401
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:473
lola: rewrite Frontend/Parser/formula_rewrite.k:452
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:251
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:251
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:251
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((E (F (((1 <= p45) AND (1 <= p7)))) OR (E (G (((1 <= p2) AND (1 <= p4) AND (1 <= p16) AND (1 <= p95) AND (1 <= p102)))) OR E (X (((1 <= p58) AND (1 <= p60) AND (1 <= p69) AND (1 <= p95) AND (1 <= p102)))))) AND ((A (X (((1 <= p17)))) OR (A (G (((1 <= p71)))) OR (((1 <= p19)) OR (((p2 <= 0)) OR (((p4 <= 0)) OR (((p28 <= 0)) OR ((p91 <= 0)))))))) AND (((p75 <= 0)) OR E (X (A (G (((1 <= p58) AND (1 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p75 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p75 <= 0))
lola: processed formula length: 12
lola: 51 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 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 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p19)) OR (((p2 <= 0)) OR (((p4 <= 0)) OR (((p28 <= 0)) OR ((p91 <= 0))))))
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: processed formula: (((1 <= p19)) OR ((p2 <= 0)) OR ((p4 <= 0)) OR ((p28 <= 0)) OR ((p91 <= 0)))
lola: processed formula length: 76
lola: 58 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 5 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 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((1 <= p2) AND (1 <= p4) AND (1 <= p16) AND (1 <= p95) AND (1 <= p102))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((1 <= p2) AND (1 <= p4) AND (1 <= p16) AND (1 <= p95) AND (1 <= p102))))
lola: processed formula length: 79
lola: 52 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:787
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p2 <= 0) OR (p4 <= 0) OR (p16 <= 0) OR (p95 <= 0) OR (p102 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 5 conjunctive subformulas
lola: The predicate is not possibly preserved.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p45) AND (1 <= p7))))
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 <= p45) AND (1 <= p7))))
lola: processed formula length: 34
lola: 52 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 <= p45) AND (1 <= p7))
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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 23 markings, 22 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (A ((((1 <= p80)) U ((1 <= p30) AND (1 <= p32) AND (1 <= p45) AND (1 <= p95) AND (1 <= p102)))))) OR (E (X (((1 <= p43)))) AND ((p2 <= 0) OR (p32 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p2 <= 0) OR (p32 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p2 <= 0) OR (p32 <= 0))
lola: processed formula length: 26
lola: 51 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 2 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 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A ((((1 <= p80)) U ((1 <= p30) AND (1 <= p32) AND (1 <= p45) AND (1 <= p95) AND (1 <= p102))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(A(((1 <= p80)) U ((1 <= p30) AND (1 <= p32) AND (1 <= p45) AND (1 <= p95) AND (1 <= p102))))
lola: processed formula length: 95
lola: 53 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: 56205 markings, 1112242 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((A (F (((p2 <= 0) OR (p4 <= 0) OR (p26 <= 0) OR (p95 <= 0) OR (p102 <= 0)))) OR (E (X (((1 <= p47)))) OR ((1 <= p58) AND (1 <= p60) AND (1 <= p81) AND (1 <= p95) AND (1 <= p102) AND (1 <= p30) AND (1 <= p32) AND (1 <= p34))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG((AF(((p2 <= 0) OR (p4 <= 0) OR (p26 <= 0) OR (p95 <= 0) OR (p102 <= 0))) OR (EX(((1 <= p47))) OR ((1 <= p58) AND (1 <= p60) AND (1 <= p81) AND (1 <= p95) AND (1 <= p102) AND (1 <= p30) AND (1 <= p32) AND (1 <= p34)))))
lola: processed formula length: 225
lola: 54 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: 172846 markings, 3491172 edges
lola: ========================================
lola: subprocess 3 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (((1 <= p39)))) OR E (F (A ((((1 <= p11)) U ((1 <= p2) AND (1 <= p4) AND (1 <= p13) AND (1 <= p95) AND (1 <= p102)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A ((((1 <= p11)) U ((1 <= p2) AND (1 <= p4) AND (1 <= p13) AND (1 <= p95) AND (1 <= p102))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(A(((1 <= p11)) U ((1 <= p2) AND (1 <= p4) AND (1 <= p13) AND (1 <= p95) AND (1 <= p102))))
lola: processed formula length: 93
lola: 53 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: 103659 markings, 2066830 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G (E (F (((1 <= p81))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(AG(EF(((1 <= p81)))))
lola: processed formula length: 24
lola: 54 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: 1893 markings, 31445 edges
lola: ========================================
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((E (F (((1 <= p13)))) AND (((p80 <= 0) OR (p30 <= 0) OR (p32 <= 0) OR (p50 <= 0) OR (p95 <= 0) OR (p102 <= 0)) OR E (X (((1 <= p60) AND (1 <= p62))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX((EF(((1 <= p13))) AND (((p80 <= 0) OR (p30 <= 0) OR (p32 <= 0) OR (p50 <= 0) OR (p95 <= 0) OR (p102 <= 0)) OR EX(((1 <= p60) AND (1 <= p62))))))
lola: processed formula length: 152
lola: 54 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: 103 markings, 1148 edges
lola: ========================================
lola: subprocess 6 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F (((1 <= p58) AND (1 <= p60) AND (1 <= p75) AND (1 <= p95) AND (1 <= p102))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:623
lola: rewrite Frontend/Parser/formula_rewrite.k:714
lola: processed formula: ((1 <= p58) AND (1 <= p60) AND (1 <= p75) AND (1 <= p95) AND (1 <= p102))
lola: processed formula length: 73
lola: 53 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 /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--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:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 10 markings, 9 edges
lola: formula 0: ((1 <= p58) AND (1 <= p60) AND (1 <= p75) AND (1 <= p95) AND (1 <= p102))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p42))))
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 <= p42))))
lola: processed formula length: 20
lola: 52 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 <= p42))
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 10 markings, 9 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 8 will run for 444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((A ((((1 <= p58) AND (1 <= p60) AND (1 <= p73) AND (1 <= p95) AND (1 <= p102)) U ((1 <= p2) AND (1 <= p4) AND (1 <= p6) AND (1 <= p95) AND (1 <= p102)))) AND (((1 <= p30)) AND (((1 <= p32)) AND (((1 <= p50)) AND (((1 <= p95)) AND ((1 <= p102)))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((A(((1 <= p58) AND (1 <= p60) AND (1 <= p73) AND (1 <= p95) AND (1 <= p102)) U ((1 <= p2) AND (1 <= p4) AND (1 <= p6) AND (1 <= p95) AND (1 <= p102))) AND (((1 <= p30)) AND (((1 <= p32)) AND (((1 <= p50)) AND (((1 <= p95)) AND ((1 <= p102))))))))
lola: processed formula length: 249
lola: 53 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: 132263 markings, 2649431 edges
lola: ========================================
lola: subprocess 9 will run for 507 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((1 <= p67)))) OR ((1 <= p48)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 507 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p48))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p48))
lola: processed formula length: 12
lola: 51 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 10 will run for 592 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p67))))
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 <= p67))))
lola: processed formula length: 20
lola: 52 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 <= p67))
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: 16 markings, 15 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 592 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((1 <= p58) AND (1 <= p60) AND (1 <= p72) AND (1 <= p95) AND (1 <= p102)))) OR (((1 <= p67)) OR ((1 <= p32) AND (1 <= p58))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 592 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p67)) OR ((1 <= p32) AND (1 <= p58)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: processed formula: (((1 <= p67)) OR ((1 <= p32) AND (1 <= p58)))
lola: processed formula length: 45
lola: 52 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 3 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 710 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p58) AND (1 <= p60) AND (1 <= p72) AND (1 <= p95) AND (1 <= p102))))
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 <= p58) AND (1 <= p60) AND (1 <= p72) AND (1 <= p95) AND (1 <= p102))))
lola: processed formula length: 81
lola: 52 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 <= p58) AND (1 <= p60) AND (1 <= p72) AND (1 <= p95) AND (1 <= p102))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 11 markings, 10 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 11 will run for 710 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((p58 <= 0) OR (p60 <= 0) OR (p81 <= 0) OR (p95 <= 0) OR (p102 <= 0) OR (p50 <= 0) OR ((1 <= p14))) U ((1 <= p58) AND (1 <= p60) AND (1 <= p69) AND (1 <= p95) AND (1 <= p102) AND (((1 <= p71)) OR ((1 <= p2)) OR ((1 <= p72))) AND (((1 <= p70)) OR ((1 <= p30) AND (1 <= p32) AND (1 <= p41))))))
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 ((((p58 <= 0) OR (p60 <= 0) OR (p81 <= 0) OR (p95 <= 0) OR (p102 <= 0) OR (p50 <= 0) OR ((1 <= p14))) U ((1 <= p58) AND (1 <= p60) AND (1 <= p69) AND (1 <= p95) AND (1 <= p102) AND (((1 <= p71)) OR ((1 <= p2)) OR ((1 <= p72))) AND (((1 <= p70)) OR ((1 <= p30) AND (1 <= p32) AND (1 <= p41))))))
lola: processed formula length: 305
lola: 54 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: 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 <= p58) AND (1 <= p60) AND (1 <= p69) AND (1 <= p95) AND (1 <= p102) AND (((1 <= p71)) OR ((1 <= p2)) OR ((1 <= p72))) AND (((1 <= p70)) OR ((1 <= p30) AND (1 <= p32) AND (1 <= p41))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 48 literals and 6 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: error: :675: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 35499 markings, 653811 edges
lola: ========================================
lola: subprocess 12 will run for 888 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((A (F (((p2 <= 0) OR (p4 <= 0) OR (p22 <= 0) OR (p95 <= 0) OR (p102 <= 0)))) OR ((1 <= p60) AND (1 <= p67)))))
lola: ========================================
lola: SUBTASK
lola: checking a universal CTL formula with single counterexample path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (((p2 <= 0) OR (p4 <= 0) OR (p22 <= 0) OR (p95 <= 0) OR (p102 <= 0))) OR ((1 <= p60) AND (1 <= p67))))
lola: processed formula length: 112
lola: 53 rewrites
lola: closed formula file CTLFireability.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 insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The universal single path CTL formula does not hold.
lola: 142856 markings, 1824485 edges
lola: ========================================
lola: subprocess 13 will run for 1183 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p32) AND (1 <= p42) AND (1 <= p80) AND (1 <= p30) AND (1 <= p53) AND (1 <= p95) AND (1 <= p102) AND (1 <= p60)) AND (((p17 <= 0)) OR E (G (((1 <= p60) AND (1 <= p73))))))))
lola: ========================================
lola: SUBTASK
lola: checking an existential CTL formula with single witness path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:658
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:661
lola: rewrite Frontend/Parser/formula_rewrite.k:666
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:665
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:662
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p32 <= 0) OR (p42 <= 0) OR (p80 <= 0) OR (p30 <= 0) OR (p53 <= 0) OR (p95 <= 0) OR (p102 <= 0) OR (p60 <= 0)) OR (((1 <= p17)) AND F (((p60 <= 0) OR (p73 <= 0))))))
lola: processed formula length: 178
lola: 63 rewrites
lola: closed formula file CTLFireability.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: 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 existential single path CTL formula does not hold.
lola: 185142 markings, 2626289 edges
lola: ========================================
lola: subprocess 14 will run for 1773 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((p8 <= 0)))) OR (((1 <= p1) AND (1 <= p3) AND (1 <= p5) AND (1 <= p29) AND (1 <= p31) AND (1 <= p33) AND (1 <= p57) AND (1 <= p59) AND (1 <= p61) AND (1 <= p85)) AND E ((((1 <= p52) AND (1 <= p81)) U ((1 <= p58) AND (1 <= p60) AND (1 <= p80) AND (1 <= p95) AND (1 <= p102) AND (1 <= p7))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1773 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p1) AND (1 <= p3) AND (1 <= p5) AND (1 <= p29) AND (1 <= p31) AND (1 <= p33) AND (1 <= p57) AND (1 <= p59) AND (1 <= p61) AND (1 <= p85))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p1) AND (1 <= p3) AND (1 <= p5) AND (1 <= p29) AND (1 <= p31) AND (1 <= p33) AND (1 <= p57) AND (1 <= p59) AND (1 <= p61) AND (1 <= p85))
lola: processed formula length: 144
lola: 51 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 10 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 15 will run for 3547 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p8 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p8 <= 0))))
lola: processed formula length: 19
lola: 53 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:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p8))
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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 12 markings, 11 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: lola: ========================================
========================================
lola: subprocess 15 will run for 3547 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((p58 <= 0) OR (p87 <= 0) OR (p43 <= 0)))) AND (E ((((p81 <= 0)) R ((p58 <= 0) OR (p60 <= 0) OR (p73 <= 0) OR (p95 <= 0) OR (p102 <= 0)))) AND (((p58 <= 0) OR (p60 <= 0) OR (p67 <= 0) OR (p95 <= 0) OR (p102 <= 0) OR (((p48 <= 0)) AND ((p58 <= 0) OR (p60 <= 0) OR (p81 <= 0) OR (p95 <= 0) OR (p102 <= 0)) AND ((p30 <= 0) OR (p32 <= 0) OR (p56 <= 0) OR (p98 <= 0)) AND ((p2 <= ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3547 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p58 <= 0) OR (p60 <= 0) OR (p80 <= 0) OR (p95 <= 0) OR (p102 <= 0) OR (p30 <= 0) OR (p32 <= 0) OR (p56 <= 0) OR (p94 <= 0) OR (p4 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p58 <= 0) OR (p60 <= 0) OR (p80 <= 0) OR (p95 <= 0) OR (p102 <= 0) OR (p30 <= 0) OR (p32 <= 0) OR (p56 <= 0) OR (p94 <= 0) OR (p4 <= 0))
lola: processed formula length: 147
lola: 51 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 10 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: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p58 <= 0) OR (p60 <= 0) OR (p67 <= 0) OR (p95 <= 0) OR (p102 <= 0) OR (((p48 <= 0)) AND ((p58 <= 0) OR (p60 <= 0) OR (p81 <= 0) OR (p95 <= 0) OR (p102 <= 0)) AND ((p30 <= 0) OR (p32 <= 0) OR (p56 <= 0) OR (p98 <= 0)) AND ((p2 <= 0) OR (p4 <= 0) OR (p16 <= 0) OR (p95 <= 0) OR (p102 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p58 <= 0) OR (p60 <= 0) OR (p67 <= 0) OR (p95 <= 0) OR (p102 <= 0) OR (((p48 <= 0)) AND ((p58 <= 0) OR (p60 <= 0) OR (p81 <= 0) OR (p95 <= 0) OR (p102 <= 0)) AND ((p30 <= 0) OR (p32 <= 0) OR (p56 <= 0) OR (p98 <= 0)) AND ((p2 <= 0) OR (p4 <= 0) OR (p16 <= 0) OR (p95 <= 0) OR (p102 <= 0))))
lola: processed formula length: 308
lola: 51 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 20 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 18 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((p81 <= 0)) R ((p58 <= 0) OR (p60 <= 0) OR (p73 <= 0) OR (p95 <= 0) OR (p102 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking existential release
lola: rewrite Frontend/Parser/formula_rewrite.k:576
lola: rewrite Frontend/Parser/formula_rewrite.k:736
lola: rewrite Frontend/Parser/formula_rewrite.k:696
lola: processed formula: E ((((p81 <= 0)) R ((p58 <= 0) OR (p60 <= 0) OR (p73 <= 0) OR (p95 <= 0) OR (p102 <= 0))))
lola: processed formula length: 94
lola: 54 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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p58) AND (1 <= p60) AND (1 <= p73) AND (1 <= p95) AND (1 <= p102))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: 1
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: There is a path where Predicate Phi releases Predicate Psi.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (G (((p58 <= 0) OR (p87 <= 0) OR (p43 <= 0)))) AND (E ((((p81 <= 0)) R ((p58 <= 0) OR (p60 <= 0) OR (p73 <= 0) OR (p95 <= 0) OR (p102 <= 0)))) AND (((p58 <= 0) OR (p60 <= 0) OR (p67 <= 0) OR (p95 <= 0) OR (p102 <= 0) OR (((p48 <= 0)) AND ((p58 <= 0) OR (p60 <= 0) OR (p81 <= 0) OR (p95 <= 0) OR (p102 <= 0)) AND ((p30 <= 0) OR (p32 <= 0) OR (p56 <= 0) OR (p98 <= 0)) AND ((p2 <= ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((p58 <= 0) OR (p60 <= 0) OR (p80 <= 0) OR (p95 <= 0) OR (p102 <= 0) OR (p30 <= 0) OR (p32 <= 0) OR (p56 <= 0) OR (p94 <= 0) OR (p4 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p58 <= 0) OR (p60 <= 0) OR (p80 <= 0) OR (p95 <= 0) OR (p102 <= 0) OR (p30 <= 0) OR (p32 <= 0) OR (p56 <= 0) OR (p94 <= 0) OR (p4 <= 0))
lola: processed formula length: 147
lola: 51 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 10 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: ========================================
lola: ...considering subproblem: A (G (((p58 <= 0) OR (p87 <= 0) OR (p43 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G (((p58 <= 0) OR (p87 <= 0) OR (p43 <= 0))))
lola: processed formula length: 50
lola: 53 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:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p58) AND (1 <= p87) AND (1 <= p43))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-17-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-17-0.sara.
sara: error: :675: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 9873 markings, 35856 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes no yes yes yes no no no yes yes no yes no yes
lola:
preliminary result: yes yes yes no yes yes yes no no no yes yes no yes no yes
lola: memory consumption: 95712 KB
lola: time consumption: 23 seconds
lola: print data as JSON (--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="CloudDeployment-PT-3a"
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 CloudDeployment-PT-3a, 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 r168-smll-158987806500284"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CloudDeployment-PT-3a.tgz
mv CloudDeployment-PT-3a execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;