Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r176-tajo-158987871900444.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is PolyORBLF-PT-S02J06T08, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987871900444
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 12K Apr 12 05:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 12 05:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 11 04:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 11 04:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 7.2K Apr 14 12:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 14 12:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.2K Apr 10 12:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 10 12:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 9 17:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 9 17:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.6K Apr 10 22:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.1K Apr 10 22:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 1.3M Mar 24 05:37 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBLF-PT-S02J06T08-CTLFireability-00
FORMULA_NAME PolyORBLF-PT-S02J06T08-CTLFireability-01
FORMULA_NAME PolyORBLF-PT-S02J06T08-CTLFireability-02
FORMULA_NAME PolyORBLF-PT-S02J06T08-CTLFireability-03
FORMULA_NAME PolyORBLF-PT-S02J06T08-CTLFireability-04
FORMULA_NAME PolyORBLF-PT-S02J06T08-CTLFireability-05
FORMULA_NAME PolyORBLF-PT-S02J06T08-CTLFireability-06
FORMULA_NAME PolyORBLF-PT-S02J06T08-CTLFireability-07
FORMULA_NAME PolyORBLF-PT-S02J06T08-CTLFireability-08
FORMULA_NAME PolyORBLF-PT-S02J06T08-CTLFireability-09
FORMULA_NAME PolyORBLF-PT-S02J06T08-CTLFireability-10
FORMULA_NAME PolyORBLF-PT-S02J06T08-CTLFireability-11
FORMULA_NAME PolyORBLF-PT-S02J06T08-CTLFireability-12
FORMULA_NAME PolyORBLF-PT-S02J06T08-CTLFireability-13
FORMULA_NAME PolyORBLF-PT-S02J06T08-CTLFireability-14
FORMULA_NAME PolyORBLF-PT-S02J06T08-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591153767469

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 03:09: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-03 03:09:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 03:09:29] [INFO ] Load time of PNML (sax parser for PT used): 119 ms
[2020-06-03 03:09:29] [INFO ] Transformed 690 places.
[2020-06-03 03:09:29] [INFO ] Transformed 1434 transitions.
[2020-06-03 03:09:29] [INFO ] Parsed PT model containing 690 places and 1434 transitions in 163 ms.
[2020-06-03 03:09:29] [INFO ] Reduced 32 identical enabling conditions.
[2020-06-03 03:09:29] [INFO ] Reduced 32 identical enabling conditions.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 40 ms.
Incomplete random walk after 100000 steps, including 14 resets, run finished after 1275 ms. (steps per millisecond=78 ) properties seen :[0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1]
[2020-06-03 03:09:30] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
// Phase 1: matrix 1290 rows 690 cols
[2020-06-03 03:09:30] [INFO ] Computed 54 place invariants in 75 ms
[2020-06-03 03:09:30] [INFO ] [Real]Absence check using 13 positive place invariants in 45 ms returned sat
[2020-06-03 03:09:30] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 21 ms returned unsat
[2020-06-03 03:09:31] [INFO ] [Real]Absence check using 13 positive place invariants in 31 ms returned sat
[2020-06-03 03:09:31] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 21 ms returned unsat
[2020-06-03 03:09:31] [INFO ] [Real]Absence check using 13 positive place invariants in 21 ms returned sat
[2020-06-03 03:09:31] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 67 ms returned sat
[2020-06-03 03:09:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:09:34] [INFO ] [Real]Absence check using state equation in 3564 ms returned sat
[2020-06-03 03:09:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:09:34] [INFO ] [Nat]Absence check using 13 positive place invariants in 26 ms returned sat
[2020-06-03 03:09:35] [INFO ] [Nat]Absence check using 13 positive and 41 generalized place invariants in 72 ms returned sat
[2020-06-03 03:09:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:09:39] [INFO ] [Nat]Absence check using state equation in 4787 ms returned sat
[2020-06-03 03:09:39] [INFO ] State equation strengthened by 104 read => feed constraints.
[2020-06-03 03:09:41] [INFO ] [Nat]Added 104 Read/Feed constraints in 1147 ms returned sat
[2020-06-03 03:09:41] [INFO ] Deduced a trap composed of 74 places in 163 ms
[2020-06-03 03:09:41] [INFO ] Deduced a trap composed of 73 places in 65 ms
[2020-06-03 03:09:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 685 ms
[2020-06-03 03:09:41] [INFO ] Computed and/alt/rep : 1304/21470/1288 causal constraints in 176 ms.
[2020-06-03 03:09:54] [INFO ] Added : 285 causal constraints over 57 iterations in 13206 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-03 03:09:55] [INFO ] [Real]Absence check using 13 positive place invariants in 36 ms returned sat
[2020-06-03 03:09:55] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 42 ms returned unsat
[2020-06-03 03:09:55] [INFO ] [Real]Absence check using 13 positive place invariants in 25 ms returned sat
[2020-06-03 03:09:55] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 25 ms returned unsat
[2020-06-03 03:09:55] [INFO ] [Real]Absence check using 13 positive place invariants in 25 ms returned sat
[2020-06-03 03:09:55] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 117 ms returned unsat
[2020-06-03 03:09:55] [INFO ] [Real]Absence check using 13 positive place invariants in 24 ms returned sat
[2020-06-03 03:09:55] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 56 ms returned unsat
[2020-06-03 03:09:55] [INFO ] [Real]Absence check using 13 positive place invariants in 22 ms returned sat
[2020-06-03 03:09:55] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 67 ms returned sat
[2020-06-03 03:09:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:09:58] [INFO ] [Real]Absence check using state equation in 3009 ms returned sat
[2020-06-03 03:09:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:09:59] [INFO ] [Nat]Absence check using 13 positive place invariants in 21 ms returned sat
[2020-06-03 03:09:59] [INFO ] [Nat]Absence check using 13 positive and 41 generalized place invariants in 59 ms returned sat
[2020-06-03 03:09:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:10:03] [INFO ] [Nat]Absence check using state equation in 4224 ms returned sat
[2020-06-03 03:10:06] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 03:10:09] [INFO ] [Nat]Added 104 Read/Feed constraints in 6030 ms returned unknown
[2020-06-03 03:10:09] [INFO ] [Real]Absence check using 13 positive place invariants in 38 ms returned sat
[2020-06-03 03:10:09] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 59 ms returned unsat
Successfully simplified 7 atomic propositions for a total of 7 simplifications.
[2020-06-03 03:10:09] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-03 03:10:09] [INFO ] Flatten gal took : 148 ms
[2020-06-03 03:10:09] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-03 03:10:09] [INFO ] Flatten gal took : 87 ms
FORMULA PolyORBLF-PT-S02J06T08-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T08-CTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T08-CTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T08-CTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 03:10:09] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2020-06-03 03:10:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 15 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ PolyORBLF-PT-S02J06T08 @ 3570 seconds
check_solution: Variable C1105 = -1 is below its lower bound 0
check_solution: Variable C1176 = -1.12199369107 is below its lower bound 0
check_solution: Variable C1203 = -0.749269758903 is below its lower bound 0
check_solution: Variable C1212 = -0.991388667094 is below its lower bound 0
check_solution: Variable C1227 = -1.04830393687 is below its lower bound 0
check_solution: Variable C1231 = -1.03506931337 is below its lower bound 0
check_solution: Variable C1233 = -0.987006116061 is below its lower bound 0
check_solution: Variable C1270 = -0.749269758903 is below its lower bound 0
check_solution: Variable C1288 = -0.991388667094 is below its lower bound 0
check_solution: Variable C1333 = -1.02386714806 is below its lower bound 0

Seriously low accuracy found ||*|| = 176.965 (rel. error 88.4827)
check_solution: Variable C34 = -1.17134015331 is below its lower bound 0
check_solution: Constraint R27 = -0.253982782364 is below its equality of 0
check_solution: Constraint R28 = -0.179452696876 is below its equality of 0
check_solution: Constraint R36 = 5.35167338588e-311 is above its equality of -1
check_solution: Constraint R63 = 2.86681631436e-311 is above its equality of -1
check_solution: Constraint R72 = 5.20949966742e-311 is above its equality of -1
check_solution: Constraint R87 = 5.0843019164e-311 is above its equality of -1
check_solution: Constraint R91 = 5.37925933136e-311 is above its equality of -1
check_solution: Constraint R93 = 4.82329643412e-311 is above its equality of -1
check_solution: Constraint R130 = 4.16547773895e-311 is above its equality of -1

Seriously low accuracy found ||*|| = 10 (rel. error 1.17134)
check_solution: Variable C141 = -0.574850559235 is below its lower bound 0
check_solution: Variable C837 = -0.563586235047 is below its lower bound 0
check_solution: Variable C1533 = -0.383233785629 is below its lower bound 0
check_solution: Constraint R36 = 5.3155994572e-311 is above its equality of -1
check_solution: Constraint R63 = 5.27740353285e-311 is above its equality of -1
check_solution: Constraint R72 = 4.94637218983e-311 is above its equality of -1
check_solution: Constraint R87 = 3.98510809622e-311 is above its equality of -1
check_solution: Constraint R91 = 3.50765904334e-311 is above its equality of -1
check_solution: Constraint R93 = 2.16655770372e-311 is above its equality of -1
check_solution: Constraint R130 = 3.69015068153e-311 is above its equality of -1

Seriously low accuracy found ||*|| = 10 (rel. error 5.7494)
check_solution: Variable C423 = -0.23274064064 is below its lower bound 0
check_solution: Variable C771 = -0.48121213913 is below its lower bound 0
check_solution: Variable C1119 = -0.665971279145 is below its lower bound 0
check_solution: Variable C1120 = -0.575187248517 is below its lower bound 0
check_solution: Variable C1467 = -0.0691062211991 is below its lower bound 0
check_solution: Variable C1815 = -0.702554225922 is below its lower bound 0
check_solution: Constraint R36 = 3.61163683717e-311 is above its equality of -1
check_solution: Constraint R63 = 3.41216923282e-311 is above its equality of -1
check_solution: Constraint R72 = 4.66593479869e-310 is above its equality of -1
check_solution: Constraint R87 = 4.85300437491e-311 is above its equality of -1

Seriously low accuracy found ||*|| = 10 (rel. error 14.4705)
check_solution: Variable C63 = -0.59315109253 is below its lower bound 0
check_solution: Variable C64 = -1.48535953421 is below its lower bound 0
check_solution: Variable C411 = -0.556411743164 is below its lower bound 0
check_solution: Variable C412 = -0.85418636325 is below its lower bound 0
check_solution: Variable C759 = -0.736759185791 is below its lower bound 0
check_solution: Variable C760 = -0.332538022013 is below its lower bound 0
check_solution: Variable C1107 = -1.92901611328 is below its lower bound 0
check_solution: Variable C1108 = -2.00084629797 is below its lower bound 0
check_solution: Variable C1455 = -0.699405193329 is below its lower bound 0
check_solution: Variable C1803 = -0.416666507721 is below its lower bound 0

Seriously low accuracy found ||*|| = 10 (rel. error 4.63195)
check_solution: Variable C183 = -0.121749699116 is below its lower bound 0
check_solution: Variable C184 = -1.40058763918 is below its lower bound 0
check_solution: Variable C880 = -0.660956977013 is below its lower bound 0
check_solution: Constraint R36 = 4.71719664384e-311 is above its equality of -1
check_solution: Constraint R63 = 2.8455963568e-311 is above its equality of -1
check_solution: Constraint R72 = 5.34318540272e-311 is above its equality of -1
check_solution: Constraint R87 = 3.23392158665e-311 is above its equality of -1
check_solution: Constraint R91 = 3.70076066062e-311 is above its equality of -1
check_solution: Constraint R93 = 4.28006551076e-311 is above its equality of -1
check_solution: Constraint R130 = 4.25672355774e-311 is above its equality of -1

Seriously low accuracy found ||*|| = 10 (rel. error 1.53169)
check_solution: Variable C40 = -0.601745414201 is below its lower bound 0
check_solution: Variable C736 = -0.601745414201 is below its lower bound 0
check_solution: Variable C1083 = -1.23487663269 is below its lower bound 0
check_solution: Variable C1432 = -0.227142303196 is below its lower bound 0
check_solution: Constraint R34 = 0.323014854376 is above its equality of 0
check_solution: Constraint R36 = 4.66594945068e-310 is above its equality of -1
check_solution: Constraint R63 = 3.67529671062e-311 is above its equality of -1
check_solution: Constraint R72 = 4.19730767572e-311 is above its equality of -1
check_solution: Constraint R87 = 5.51082306986e-311 is above its equality of -1
check_solution: Constraint R91 = 3.79412847477e-311 is above its equality of -1

Seriously low accuracy found ||*|| = 10 (rel. error 4.40253)
check_solution: Variable C201 = -0.331392526627 is below its lower bound 0
check_solution: Variable C202 = -0.998042366137 is below its lower bound 0
check_solution: Variable C549 = -1.23387050629 is below its lower bound 0
check_solution: Variable C897 = -0.224516868591 is below its lower bound 0
check_solution: Variable C1245 = -0.160218119621 is below its lower bound 0
check_solution: Variable C1593 = -0.524999618531 is below its lower bound 0
check_solution: Variable C1594 = -0.539728985281 is below its lower bound 0
check_solution: Variable C1941 = -1.7483215332 is below its lower bound 0
check_solution: Constraint R36 = 3.47582910672e-311 is above its equality of -1
check_solution: Constraint R63 = 3.64134477832e-311 is above its equality of -1

Seriously low accuracy found ||*|| = 10 (rel. error 1.90476)

FORMULA PolyORBLF-PT-S02J06T08-CTLFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S02J06T08-CTLFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S02J06T08-CTLFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S02J06T08-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S02J06T08-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S02J06T08-CTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S02J06T08-CTLFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S02J06T08-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S02J06T08-CTLFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S02J06T08-CTLFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S02J06T08-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S02J06T08-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1508
rslt: Output for CTLFireability @ PolyORBLF-PT-S02J06T08

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=CTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 03:10:10 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 126
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 23
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 137
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 23
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 151
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "EX(AX(EF(((10 <= p354) AND (1 <= p517) AND (1 <= p550)))))",
"processed_size": 58,
"rewrites": 26
},
"net":
{
"conflict_clusters": 261,
"singleton_clusters": 0
},
"result":
{
"edges": 259769,
"markings": 218076,
"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"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 167
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"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": "AX(EG(((1 <= p221) AND (1 <= p670))))",
"processed_size": 37,
"rewrites": 25
},
"net":
{
"conflict_clusters": 261,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "EF(((((6 <= p26) AND (2 <= p197) AND (2 <= p269) AND (1 <= p413) AND (1 <= p44) AND (1 <= p225)) OR (p174 <= 0) OR (p466 <= 0) OR (p534 <= 0)) AND AX(((1 <= p19) AND (1 <= p466) AND (1 <= p669)))))",
"processed_size": 200,
"rewrites": 25
},
"net":
{
"conflict_clusters": 261,
"singleton_clusters": 0
},
"result":
{
"edges": 8403,
"markings": 8280,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 4,
"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": 188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p112) AND (1 <= p182) AND (1 <= p293))))",
"processed_size": 53,
"rewrites": 24
},
"result":
{
"edges": 809,
"markings": 809,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 215
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 16,
"adisj": 1,
"aneg": 0,
"comp": 48,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 48,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 18,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p282) AND (1 <= p367) AND (1 <= p680)) OR ((1 <= p282) AND (1 <= p470) AND (1 <= p680)) OR ((1 <= p282) AND (1 <= p558) AND (1 <= p680)) OR ((1 <= p239) AND (1 <= p282) AND (1 <= p680)) OR ((1 <= p84) AND (1 <= p282) AND (1 <= p680)) OR ((1 <= p282) AND (1 <= p650) AND (1 <= p680)) OR ((1 <= p282) AND (1 <= p598) AND (1 <= p680)) OR ((1 <= p282) AND (1 <= p439) AND (1 <= p680)) OR ((1 <= p282) AND (1 <= p454) AND (1 <= p680)) OR ((1 <= p69) AND (1 <= p282) AND (1 <= p680)) OR ((1 <= p282) AND (1 <= p542) AND (1 <= p680)) OR ((1 <= p282) AND (1 <= p610) AND (1 <= p680)) OR ((1 <= p148) AND (1 <= p282) AND (1 <= p680)) OR ((1 <= p199) AND (1 <= p282) AND (1 <= p680)) OR ((1 <= p272) AND (1 <= p282) AND (1 <= p680)) OR ((1 <= p47) AND (1 <= p282) AND (1 <= p680)))))",
"processed_size": 802,
"rewrites": 24
},
"result":
{
"edges": 45,
"markings": 46,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 48,
"problems": 16
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 251
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 8,
"adisj": 1,
"aneg": 1,
"comp": 24,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 24,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "E (G ((((p207 <= 0) OR (p282 <= 0) OR (p451 <= 0)) AND ((p282 <= 0) OR (p395 <= 0) OR (p451 <= 0)) AND ((p242 <= 0) OR (p282 <= 0) OR (p451 <= 0)) AND ((p282 <= 0) OR (p451 <= 0) OR (p668 <= 0)) AND ((p7 <= 0) OR (p282 <= 0) OR (p451 <= 0)) AND ((p282 <= 0) OR (p338 <= 0) OR (p451 <= 0)) AND ((p282 <= 0) OR (p416 <= 0) OR (p451 <= 0)) AND ((p102 <= 0) OR (p282 <= 0) OR (p451 <= 0)))))",
"processed_size": 403,
"rewrites": 24
},
"result":
{
"edges": 36120,
"markings": 24611,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 80
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 24,
"problems": 8
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 301
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 1,
"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": 5,
"visible_transitions": 0
},
"processed": "EG(E(((p282 <= 0) OR (p338 <= 0) OR (p451 <= 0)) U ((1 <= p84) AND (1 <= p282) AND (1 <= p611))))",
"processed_size": 99,
"rewrites": 25
},
"net":
{
"conflict_clusters": 261,
"singleton_clusters": 0
},
"result":
{
"edges": 217137,
"markings": 114778,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 377
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 1,
"G": 0,
"U": 2,
"X": 0,
"aconj": 32,
"adisj": 3,
"aneg": 0,
"comp": 80,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 80,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 29,
"visible_transitions": 0
},
"processed": "E(EF((((1 <= p517) AND (1 <= p620)) OR ((1 <= p517) AND (1 <= p641)) OR ((1 <= p517) AND (1 <= p562)) OR ((1 <= p169) AND (1 <= p517)) OR ((1 <= p488) AND (1 <= p517)) OR ((1 <= p66) AND (1 <= p517)) OR ((1 <= p230) AND (1 <= p517)) OR ((1 <= p214) AND (1 <= p517)))) U A((((1 <= p619) AND (1 <= p680)) OR ((1 <= p455) AND (1 <= p680)) OR ((1 <= p246) AND (1 <= p680)) OR ((1 <= p77) AND (1 <= p680)) OR ((1 <= p637) AND (1 <= p680)) OR ((1 <= p435) AND (1 <= p680)) OR ((1 <= p166) AND (1 <= p680)) OR ((1 <= p326) AND (1 <= p680))) U (((9 <= p26) AND (1 <= p158) AND (1 <= p197)) OR ((9 <= p26) AND (1 <= p269) AND (1 <= p597)) OR ((9 <= p26) AND (1 <= p269) AND (1 <= p376)) OR ((9 <= p26) AND (1 <= p269) AND (1 <= p413)) OR ((9 <= p26) AND (1 <= p158) AND (1 <= p269)) OR ((9 <= p26) AND (1 <= p197) AND (1 <= p413)) OR ((9 <= p26) AND (1 <= p197) AND (1 <= p597)) OR ((9 <= p26) AND (1 <= p234) AND (1 <= p269)) OR ((9 <= p26) AND (1 <= p123) AND (1 <= p269)) OR ((9 <= p26) AND (1 <= p197) AND (1 <= p376)) OR ((9 <= p26) AND (1 <= p123) AND (1 <= p197)) OR ((9 <= p26) AND (1 <= p269) AND (1 <= p609)) OR ((9 <= p26) AND (1 <= p197) AND (1 <= p609)) OR ((9 <= p26) AND (1 <= p208) AND (1 <= p269)) OR ((9 <= p26) AND (1 <= p197) AND (1 <= p234)) OR ((9 <= p26) AND (1 <= p197) AND (1 <= p208)))))",
"processed_size": 1333,
"rewrites": 26
},
"net":
{
"conflict_clusters": 261,
"singleton_clusters": 0
},
"result":
{
"edges": 70,
"markings": 61,
"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": 502
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 502
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(3 <= p403)",
"processed_size": 11,
"rewrites": 23
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 754
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((1 <= p506) AND (1 <= p613))",
"processed_size": 29,
"rewrites": 26
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 48
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1508
},
"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 <= p270) AND (1 <= p536))))",
"processed_size": 37,
"rewrites": 24
},
"result":
{
"edges": 34,
"markings": 35,
"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": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 754
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((p357 <= 0) OR (p466 <= 0) OR (p669 <= 0))",
"processed_size": 45,
"rewrites": 23
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1508
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "AF(E(((1 <= p35) AND (1 <= p456)) U ((1 <= p298) AND (1 <= p486))))",
"processed_size": 67,
"rewrites": 25
},
"net":
{
"conflict_clusters": 261,
"singleton_clusters": 0
},
"result":
{
"edges": 702,
"markings": 351,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1508
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 2,
"aneg": 1,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "(((1 <= p166) AND (1 <= p611)) OR (((p55 <= 0) OR (p293 <= 0) OR (p466 <= 0)) AND ((p110 <= 0) OR (p183 <= 0))))",
"processed_size": 116,
"rewrites": 27
},
"result":
{
"edges": 351,
"markings": 351,
"produced_by": "state space /EGEF",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 107
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 14,
"problems": 4
},
"type": "eventual_invariance",
"workflow": "stateequation"
}
}
],
"exit":
{
"error": null,
"memory": 459588,
"runtime": 2062.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "TRUE : E(G(*)) : TRUE : E((E(F(**)) U A((** U **)))) : E(F(**)) : E(X(A(X(E(F(**)))))) : (E(F(**)) AND (** OR A(F(*)))) : (E(F((** AND A(X(**))))) OR (A(X(E(G(**)))) AND A(X(A(G(**)))))) : A(F(A(G(**)))) : E(G(E((** U **)))) : (A(F(E((** U **)))) AND **) : E(F(**))"
},
"net":
{
"arcs": 5668,
"conflict_clusters": 261,
"places": 690,
"places_significant": 636,
"singleton_clusters": 0,
"transitions": 1306
},
"result":
{
"preliminary_value": "yes no yes yes yes yes yes yes no yes no yes ",
"value": "yes no yes yes yes yes 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: 1996/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 22080
lola: finding significant places
lola: 690 places, 1306 transitions, 636 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: A (X (E (G ((0 <= 0))))) : NOT(A ((((1 <= p407) OR (1 <= p465) OR (1 <= p217) OR (1 <= p302) OR (1 <= p45) OR (1 <= p596) OR (1 <= p489) OR (1 <= p30)) U A (F ((((1 <= p207) AND (1 <= p282) AND (1 <= p451)) OR ((1 <= p282) AND (1 <= p395) AND (1 <= p451)) OR ((1 <= p242) AND (1 <= p282) AND (1 <= p451)) OR ((1 <= p282) AND (1 <= p451) AND (1 <= p668)) OR ((1 <= p7) AND (1 <= p282) AND (1 <= p451)) OR ((1 <= p282) AND (1 <= p338) AND (1 <= p451)) OR ((1 <= p282) AND (1 <= p416) AND (1 <= p451)) OR ((1 <= p102) AND (1 <= p282) AND (1 <= p451)))))))) : E (G ((0 <= 0))) : E ((E (F ((((1 <= p517) AND (1 <= p620)) OR ((1 <= p517) AND (1 <= p641)) OR ((1 <= p517) AND (1 <= p562)) OR ((1 <= p169) AND (1 <= p517)) OR ((1 <= p488) AND (1 <= p517)) OR ((1 <= p66) AND (1 <= p517)) OR ((1 <= p230) AND (1 <= p517)) OR ((1 <= p214) AND (1 <= p517))))) U A (((((1 <= p619) AND (1 <= p680)) OR ((1 <= p455) AND (1 <= p680)) OR ((1 <= p246) AND (1 <= p680)) OR ((1 <= p77) AND (1 <= p680)) OR ((1 <= p637) AND (1 <= p680)) OR ((1 <= p435) AND (1 <= p680)) OR ((1 <= p166) AND (1 <= p680)) OR ((1 <= p326) AND (1 <= p680))) U (((9 <= p26) AND (1 <= p158) AND (1 <= p197)) OR ((9 <= p26) AND (1 <= p269) AND (1 <= p597)) OR ((9 <= p26) AND (1 <= p269) AND (1 <= p376)) OR ((9 <= p26) AND (1 <= p269) AND (1 <= p413)) OR ((9 <= p26) AND (1 <= p158) AND (1 <= p269)) OR ((9 <= p26) AND (1 <= p197) AND (1 <= p413)) OR ((9 <= p26) AND (1 <= p197) AND (1 <= p597)) OR ((9 <= p26) AND (1 <= p234) AND (1 <= p269)) OR ((9 <= p26) AND (1 <= p123) AND (1 <= p269)) OR ((9 <= p26) AND (1 <= p197) AND (1 <= p376)) OR ((9 <= p26) AND (1 <= p123) AND (1 <= p197)) OR ((9 <= p26) AND (1 <= p269) AND (1 <= p609)) OR ((9 <= p26) AND (1 <= p197) AND (1 <= p609)) OR ((9 <= p26) AND (1 <= p208) AND (1 <= p269)) OR ((9 <= p26) AND (1 <= p197) AND (1 <= p234)) OR ((9 <= p26) AND (1 <= p197) AND (1 <= p208))))))) : E (F ((((1 <= p282) AND (1 <= p367) AND (1 <= p680)) OR ((1 <= p282) AND (1 <= p470) AND (1 <= p680)) OR ((1 <= p282) AND (1 <= p558) AND (1 <= p680)) OR ((1 <= p239) AND (1 <= p282) AND (1 <= p680)) OR ((1 <= p84) AND (1 <= p282) AND (1 <= p680)) OR ((1 <= p282) AND (1 <= p650) AND (1 <= p680)) OR ((1 <= p282) AND (1 <= p598) AND (1 <= p680)) OR ((1 <= p282) AND (1 <= p439) AND (1 <= p680)) OR ((1 <= p282) AND (1 <= p454) AND (1 <= p680)) OR ((1 <= p69) AND (1 <= p282) AND (1 <= p680)) OR ((1 <= p282) AND (1 <= p542) AND (1 <= p680)) OR ((1 <= p282) AND (1 <= p610) AND (1 <= p680)) OR ((1 <= p148) AND (1 <= p282) AND (1 <= p680)) OR ((1 <= p199) AND (1 <= p282) AND (1 <= p680)) OR ((1 <= p272) AND (1 <= p282) AND (1 <= p680)) OR ((1 <= p47) AND (1 <= p282) AND (1 <= p680))))) : E (X (A (X (E (F (((10 <= p354) AND (1 <= p517) AND (1 <= p550)))))))) : ((A (F (E (F (((1 <= p270) AND (1 <= p536)))))) AND E (F (E (G ((0 <= 0)))))) AND ((3 <= p403) OR NOT(E (G (((1 <= p506) AND (1 <= p613))))))) : (E (F (((((6 <= p26) AND (2 <= p197) AND (2 <= p269) AND (1 <= p413) AND (1 <= p44) AND (1 <= p225)) OR (p174 <= 0) OR (p466 <= 0) OR (p534 <= 0)) AND A (X (((1 <= p19) AND (1 <= p466) AND (1 <= p669))))))) OR (A (X (E (G (((1 <= p221) AND (1 <= p670)))))) AND A (G (A (X (((1 <= p357) AND (1 <= p373) AND (1 <= p646)))))))) : A (F (A (G ((((p166 <= 0) OR (p611 <= 0)) AND (((1 <= p55) AND (1 <= p293) AND (1 <= p466)) OR ((1 <= p110) AND (1 <= p183)))))))) : E (G (E ((((p282 <= 0) OR (p338 <= 0) OR (p451 <= 0)) U ((1 <= p84) AND (1 <= p282) AND (1 <= p611)))))) : (A (F (E ((((1 <= p35) AND (1 <= p456)) U ((1 <= p298) AND (1 <= p486)))))) AND ((p357 <= 0) OR (p466 <= 0) OR (p669 <= 0))) : A (((A (F ((1 <= p198))) AND (((1 <= p112) AND (1 <= p174) AND (1 <= p182)) OR ((1 <= p221) AND (1 <= p544)) OR ((1 <= p179) AND (10 <= p354) AND (1 <= p517) AND (1 <= p655)))) U E (F (((1 <= p112) AND (1 <= p182) AND (1 <= p293))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:136
lola: rewrite Frontend/Parser/formula_rewrite.k:470
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:449
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:398
lola: rewrite Frontend/Parser/formula_rewrite.k:452
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 126 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 23 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 137 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 23 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 151 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (X (E (F (((10 <= p354) AND (1 <= p517) AND (1 <= p550))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(AX(EF(((10 <= p354) AND (1 <= p517) AND (1 <= p550)))))
lola: processed formula length: 58
lola: 26 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: 218076 markings, 259769 edges
lola: ========================================
lola: subprocess 3 will run for 167 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((((6 <= p26) AND (2 <= p197) AND (2 <= p269) AND (1 <= p413) AND (1 <= p44) AND (1 <= p225)) OR (p174 <= 0) OR (p466 <= 0) OR (p534 <= 0)) AND A (X (((1 <= p19) AND (1 <= p466) AND (1 <= p669))))))) OR (A (X (E (G (((1 <= p221) AND (1 <= p670)))))) AND A (X (A (G (((1 <= p357) AND (1 <= p373) AND (1 <= p646))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 167 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (G (((1 <= p221) AND (1 <= p670))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EG(((1 <= p221) AND (1 <= p670))))
lola: processed formula length: 37
lola: 25 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((((6 <= p26) AND (2 <= p197) AND (2 <= p269) AND (1 <= p413) AND (1 <= p44) AND (1 <= p225)) OR (p174 <= 0) OR (p466 <= 0) OR (p534 <= 0)) AND A (X (((1 <= p19) AND (1 <= p466) AND (1 <= p669)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(((((6 <= p26) AND (2 <= p197) AND (2 <= p269) AND (1 <= p413) AND (1 <= p44) AND (1 <= p225)) OR (p174 <= 0) OR (p466 <= 0) OR (p534 <= 0)) AND AX(((1 <= p19) AND (1 <= p466) AND (1 <= p669)))))
lola: processed formula length: 200
lola: 25 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: 8280 markings, 8403 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p112) AND (1 <= p182) AND (1 <= p293))))
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 <= p112) AND (1 <= p182) AND (1 <= p293))))
lola: processed formula length: 53
lola: 24 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 <= p112) AND (1 <= p182) AND (1 <= p293))
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-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-4-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 809 markings, 809 edges
lola: ========================================
lola: subprocess 5 will run for 215 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p282) AND (1 <= p367) AND (1 <= p680)) OR ((1 <= p282) AND (1 <= p470) AND (1 <= p680)) OR ((1 <= p282) AND (1 <= p558) AND (1 <= p680)) OR ((1 <= p239) AND (1 <= p282) AND (1 <= p680)) OR ((1 <= p84) AND (1 <= p282) AND (1 <= p680)) OR ((1 <= p282) AND (1 <= p650) AND (1 <= p680)) OR ((1 <= p282) AND (1 <= p598) AND (1 <= p680)) OR ((1 <= p282) AND (1 <= p439) AND (1 <= p680)... (shortened)
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 <= p282) AND (1 <= p367) AND (1 <= p680)) OR ((1 <= p282) AND (1 <= p470) AND (1 <= p680)) OR ((1 <= p282) AND (1 <= p558) AND (1 <= p680)) OR ((1 <= p239) AND (1 <= p282) AND (1 <= p680)) OR ((1 <= p84) AND (1 <= p282) AND (1 <= p680)) OR ((1 <= p282) AND (1 <= p650) AND (1 <= p680)) OR ((1 <= p282) AND (1 <= p598) AND (1 <= p680)) OR ((1 <= p282) AND (1 <= p439) AND (1 <= p680)... (shortened)
lola: processed formula length: 802
lola: 24 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 <= p282) AND (1 <= p367) AND (1 <= p680)) OR ((1 <= p282) AND (1 <= p470) AND (1 <= p680)) OR ((1 <= p282) AND (1 <= p558) AND (1 <= p680)) OR ((1 <= p239) AND (1 <= p282) AND (1 <= p680)) OR ((1 <= p84) AND (1 <= p282) AND (1 <= p680)) OR ((1 <= p282) AND (1 <= p650) AND (1 <= p680)) OR ((1 <= p282) AND (1 <= p598) AND (1 <= p680)) OR ((1 <= p282) AND (1 <= p439) AND (1 <= p680)) OR ((1 <= p282) AND (1 <= p454) AND (1 <= p680)) OR ((1 <= p69) AND (1 <= p282) AND (1 <= p680)) OR ((1 <= p282) AND (1 <= p542) AND (1 <= p680)) OR ((1 <= p282) AND (1 <= p610) AND (1 <= p680)) OR ((1 <= p148) AND (1 <= p282) AND (1 <= p680)) OR ((1 <= p199) AND (1 <= p282) AND (1 <= p680)) OR ((1 <= p272) AND (1 <= p282) AND (1 <= p680)) OR ((1 <= p47) AND (1 <= p282) AND (1 <= p680)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 48 literals and 16 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 46 markings, 45 edges
lola: ========================================
lola: subprocess 6 will run for 251 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((p207 <= 0) OR (p282 <= 0) OR (p451 <= 0)) AND ((p282 <= 0) OR (p395 <= 0) OR (p451 <= 0)) AND ((p242 <= 0) OR (p282 <= 0) OR (p451 <= 0)) AND ((p282 <= 0) OR (p451 <= 0) OR (p668 <= 0)) AND ((p7 <= 0) OR (p282 <= 0) OR (p451 <= 0)) AND ((p282 <= 0) OR (p338 <= 0) OR (p451 <= 0)) AND ((p282 <= 0) OR (p416 <= 0) OR (p451 <= 0)) AND ((p102 <= 0) OR (p282 <= 0) OR (p451 <= 0))... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((p207 <= 0) OR (p282 <= 0) OR (p451 <= 0)) AND ((p282 <= 0) OR (p395 <= 0) OR (p451 <= 0)) AND ((p242 <= 0) OR (p282 <= 0) OR (p451 <= 0)) AND ((p282 <= 0) OR (p451 <= 0) OR (p668 <= 0)) AND ((p7 <= 0) OR (p282 <= 0) OR (p451 <= 0)) AND ((p282 <= 0) OR (p338 <= 0) OR (p451 <= 0)) AND ((p282 <= 0) OR (p416 <= 0) OR (p451 <= 0)) AND ((p102 <= 0) OR (p282 <= 0) OR (p451 <= 0))... (shortened)
lola: processed formula length: 403
lola: 24 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: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 <= p207) AND (1 <= p282) AND (1 <= p451)) OR ((1 <= p282) AND (1 <= p395) AND (1 <= p451)) OR ((1 <= p242) AND (1 <= p282) AND (1 <= p451)) OR ((1 <= p282) AND (1 <= p451) AND (1 <= p668)) OR ((1 <= p7) AND (1 <= p282) AND (1 <= p451)) OR ((1 <= p282) AND (1 <= p338) AND (1 <= p451)) OR ((1 <= p282) AND (1 <= p416) AND (1 <= p451)) OR ((1 <= p102) AND (1 <= p282) AND (1 <= p451)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 24 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-6-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 24611 markings, 36120 edges
lola: ========================================
lola: subprocess 7 will run for 301 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E ((((p282 <= 0) OR (p338 <= 0) OR (p451 <= 0)) U ((1 <= p84) AND (1 <= p282) AND (1 <= p611))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(E(((p282 <= 0) OR (p338 <= 0) OR (p451 <= 0)) U ((1 <= p84) AND (1 <= p282) AND (1 <= p611))))
lola: processed formula length: 99
lola: 25 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: 114778 markings, 217137 edges
lola: ========================================
lola: subprocess 8 will run for 377 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (F ((((1 <= p517) AND (1 <= p620)) OR ((1 <= p517) AND (1 <= p641)) OR ((1 <= p517) AND (1 <= p562)) OR ((1 <= p169) AND (1 <= p517)) OR ((1 <= p488) AND (1 <= p517)) OR ((1 <= p66) AND (1 <= p517)) OR ((1 <= p230) AND (1 <= p517)) OR ((1 <= p214) AND (1 <= p517))))) U A (((((1 <= p619) AND (1 <= p680)) OR ((1 <= p455) AND (1 <= p680)) OR ((1 <= p246) AND (1 <= p680)) OR ((1 <= p77... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(EF((((1 <= p517) AND (1 <= p620)) OR ((1 <= p517) AND (1 <= p641)) OR ((1 <= p517) AND (1 <= p562)) OR ((1 <= p169) AND (1 <= p517)) OR ((1 <= p488) AND (1 <= p517)) OR ((1 <= p66) AND (1 <= p517)) OR ((1 <= p230) AND (1 <= p517)) OR ((1 <= p214) AND (1 <= p517)))) U A((((1 <= p619) AND (1 <= p680)) OR ((1 <= p455) AND (1 <= p680)) OR ((1 <= p246) AND (1 <= p680)) OR ((1 <= p77) AND (1... (shortened)
lola: processed formula length: 1333
lola: 26 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 3 significant temporal operators and needs 13 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: 61 markings, 70 edges
lola: ========================================
lola: subprocess 9 will run for 502 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((1 <= p270) AND (1 <= p536)))) AND ((3 <= p403) OR A (F (((p506 <= 0) OR (p613 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 502 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= p403)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p403)
lola: processed formula length: 11
lola: 23 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 754 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((p506 <= 0) OR (p613 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: ((1 <= p506) AND (1 <= p613))
lola: processed formula length: 29
lola: 26 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p506 <= 0) OR (p613 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 1508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p270) AND (1 <= p536))))
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 <= p270) AND (1 <= p536))))
lola: processed formula length: 37
lola: 24 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 <= p270) AND (1 <= p536))
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: 35 markings, 34 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 754 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (E ((((1 <= p35) AND (1 <= p456)) U ((1 <= p298) AND (1 <= p486)))))) AND ((p357 <= 0) OR (p466 <= 0) OR (p669 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 754 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p357 <= 0) OR (p466 <= 0) OR (p669 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p357 <= 0) OR (p466 <= 0) OR (p669 <= 0))
lola: processed formula length: 45
lola: 23 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 1508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E ((((1 <= p35) AND (1 <= p456)) U ((1 <= p298) AND (1 <= p486))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(E(((1 <= p35) AND (1 <= p456)) U ((1 <= p298) AND (1 <= p486))))
lola: processed formula length: 67
lola: 25 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: 351 markings, 702 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 1508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((((p166 <= 0) OR (p611 <= 0)) AND (((1 <= p55) AND (1 <= p293) AND (1 <= p466)) OR ((1 <= p110) AND (1 <= p183))))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:594
lola: rewrite Frontend/Parser/formula_rewrite.k:629
lola: rewrite Frontend/Parser/formula_rewrite.k:758
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((1 <= p166) AND (1 <= p611)) OR (((p55 <= 0) OR (p293 <= 0) OR (p466 <= 0)) AND ((p110 <= 0) OR (p183 <= 0))))
lola: processed formula length: 116
lola: 27 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 /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
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: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 1
lola: state equation task get result unparse finished++ id 0
lola: formula 1: (((1 <= p166) AND (1 <= p611)) OR (((p55 <= 0) OR (p293 <= 0) OR (p466 <= 0)) AND ((p110 <= 0) OR (p183 <= 0))))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 14 literals and 7 conjunctive subformulas
lola: formula 0: (((p166 <= 0) OR (p611 <= 0)) AND (((1 <= p55) AND (1 <= p293) AND (1 <= p466)) OR ((1 <= p110) AND (1 <= p183))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 14 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: The predicate is not eventually invariant.
lola: 351 markings, 351 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes yes yes yes yes yes no yes no yes
lola:
preliminary result: yes no yes yes yes yes yes yes no yes no yes
lola: memory consumption: 459588 KB
lola: time consumption: 2062 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="PolyORBLF-PT-S02J06T08"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is PolyORBLF-PT-S02J06T08, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r176-tajo-158987871900444"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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