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.r211-tajo-159033476900036.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 SatelliteMemory-PT-X65535Y2048, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033476900036
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 172K
-rw-r--r-- 1 mcc users 3.2K May 14 00:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 14 00:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 13 17:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 13 17:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 14 10:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 10:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 14 10:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.3K May 13 13:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 13 13:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 07:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 13 07:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 12 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rwxr-xr-x 1 mcc users 5.5K May 12 20:42 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 SatelliteMemory-PT-X65535Y2048-CTLFireability-00
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-CTLFireability-01
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-CTLFireability-02
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-CTLFireability-03
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-CTLFireability-04
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-CTLFireability-05
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-CTLFireability-06
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-CTLFireability-07
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-CTLFireability-08
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-CTLFireability-09
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-CTLFireability-10
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-CTLFireability-11
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-CTLFireability-12
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-CTLFireability-13
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-CTLFireability-14
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591284180889

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 15:23:03] [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 15:23:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 15:23:03] [INFO ] Load time of PNML (sax parser for PT used): 29 ms
[2020-06-04 15:23:03] [INFO ] Transformed 13 places.
[2020-06-04 15:23:03] [INFO ] Transformed 10 transitions.
[2020-06-04 15:23:03] [INFO ] Parsed PT model containing 13 places and 10 transitions in 99 ms.
Reduce places removed 1 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 20 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 209 ms. (steps per millisecond=478 ) properties seen :[1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1]
// Phase 1: matrix 10 rows 12 cols
[2020-06-04 15:23:03] [INFO ] Computed 6 place invariants in 2 ms
[2020-06-04 15:23:03] [INFO ] [Real]Absence check using 6 positive place invariants in 16 ms returned sat
[2020-06-04 15:23:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 15:23:03] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2020-06-04 15:23:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 15:23:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2020-06-04 15:23:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 15:23:03] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2020-06-04 15:23:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-04 15:23:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2020-06-04 15:23:03] [INFO ] Computed and/alt/rep : 8/13/8 causal constraints in 1 ms.
[2020-06-04 15:23:03] [INFO ] Added : 4 causal constraints over 1 iterations in 13 ms. Result :sat
[2020-06-04 15:23:03] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2020-06-04 15:23:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 15:23:03] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2020-06-04 15:23:03] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2020-06-04 15:23:03] [INFO ] Computed and/alt/rep : 8/13/8 causal constraints in 2 ms.
[2020-06-04 15:23:03] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
[2020-06-04 15:23:03] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2020-06-04 15:23:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 15:23:03] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2020-06-04 15:23:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 15:23:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2020-06-04 15:23:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 15:23:03] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2020-06-04 15:23:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2020-06-04 15:23:03] [INFO ] Computed and/alt/rep : 8/13/8 causal constraints in 2 ms.
[2020-06-04 15:23:03] [INFO ] Added : 7 causal constraints over 2 iterations in 12 ms. Result :sat
[2020-06-04 15:23:03] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2020-06-04 15:23:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 15:23:03] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2020-06-04 15:23:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 15:23:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2020-06-04 15:23:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 15:23:03] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2020-06-04 15:23:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2020-06-04 15:23:03] [INFO ] Computed and/alt/rep : 8/13/8 causal constraints in 2 ms.
[2020-06-04 15:23:03] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
[2020-06-04 15:23:03] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2020-06-04 15:23:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 15:23:03] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2020-06-04 15:23:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 15:23:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2020-06-04 15:23:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 15:23:03] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2020-06-04 15:23:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2020-06-04 15:23:03] [INFO ] Computed and/alt/rep : 8/13/8 causal constraints in 14 ms.
[2020-06-04 15:23:03] [INFO ] Added : 4 causal constraints over 1 iterations in 18 ms. Result :sat
[2020-06-04 15:23:03] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2020-06-04 15:23:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 15:23:03] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2020-06-04 15:23:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 15:23:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2020-06-04 15:23:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 15:23:03] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2020-06-04 15:23:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2020-06-04 15:23:03] [INFO ] Computed and/alt/rep : 8/13/8 causal constraints in 3 ms.
[2020-06-04 15:23:03] [INFO ] Added : 7 causal constraints over 2 iterations in 14 ms. Result :sat
[2020-06-04 15:23:03] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2020-06-04 15:23:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 15:23:03] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2020-06-04 15:23:03] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2020-06-04 15:23:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 15:23:04] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2020-06-04 15:23:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 15:23:04] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2020-06-04 15:23:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2020-06-04 15:23:04] [INFO ] Computed and/alt/rep : 8/13/8 causal constraints in 1 ms.
[2020-06-04 15:23:04] [INFO ] Added : 3 causal constraints over 1 iterations in 4 ms. Result :sat
[2020-06-04 15:23:04] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2020-06-04 15:23:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 15:23:04] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2020-06-04 15:23:04] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2020-06-04 15:23:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 15:23:04] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2020-06-04 15:23:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 15:23:04] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2020-06-04 15:23:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2020-06-04 15:23:04] [INFO ] Computed and/alt/rep : 8/13/8 causal constraints in 1 ms.
[2020-06-04 15:23:04] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
[2020-06-04 15:23:04] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2020-06-04 15:23:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 15:23:04] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2020-06-04 15:23:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 15:23:04] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2020-06-04 15:23:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 15:23:04] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2020-06-04 15:23:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2020-06-04 15:23:04] [INFO ] Computed and/alt/rep : 8/13/8 causal constraints in 0 ms.
[2020-06-04 15:23:04] [INFO ] Added : 7 causal constraints over 2 iterations in 9 ms. Result :sat
[2020-06-04 15:23:04] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2020-06-04 15:23:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 15:23:04] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2020-06-04 15:23:04] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2020-06-04 15:23:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 15:23:04] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2020-06-04 15:23:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 15:23:04] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2020-06-04 15:23:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2020-06-04 15:23:04] [INFO ] Computed and/alt/rep : 8/13/8 causal constraints in 1 ms.
[2020-06-04 15:23:04] [INFO ] Added : 4 causal constraints over 1 iterations in 4 ms. Result :sat
[2020-06-04 15:23:04] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-04 15:23:04] [INFO ] Flatten gal took : 24 ms
[2020-06-04 15:23:04] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-04 15:23:04] [INFO ] Flatten gal took : 4 ms
FORMULA SatelliteMemory-PT-X65535Y2048-CTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 15:23:04] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2020-06-04 15:23:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 0 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ SatelliteMemory-PT-X65535Y2048 @ 3570 seconds

FORMULA SatelliteMemory-PT-X65535Y2048-CTLFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X65535Y2048-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X65535Y2048-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X65535Y2048-CTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X65535Y2048-CTLFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X65535Y2048-CTLFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X65535Y2048-CTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X65535Y2048-CTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X65535Y2048-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X65535Y2048-CTLFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X65535Y2048-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X65535Y2048-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X65535Y2048-CTLFireability-02 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X65535Y2048-CTLFireability-07 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X65535Y2048-CTLFireability-06 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2638
rslt: Output for CTLFireability @ SatelliteMemory-PT-X65535Y2048

{
"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": "Thu Jun 4 15:23:04 2020
",
"timelimit": 3570
},
"child":
[

{
"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": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((1 <= p4) AND (1 <= p6) AND (1 <= p8))",
"processed_size": 39,
"rewrites": 44
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 262
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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": "EX(((p0 <= 0) OR (p8 <= 0)))",
"processed_size": 29,
"rewrites": 45
},
"net":
{
"conflict_clusters": 3,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"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": 284
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"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": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "A (G (((p11 <= 65534) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p7) AND (1 <= p10) AND (1 <= p0) AND (1 <= p8)))))",
"processed_size": 111,
"rewrites": 46
},
"result":
{
"edges": 8193,
"markings": 8194,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 12,
"problems": 6
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 262
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "EF(((65535 <= p11) AND (EX(((1 <= p4) AND (1 <= p6) AND (1 <= p8))) OR AX((65535 <= p11)))))",
"processed_size": 92,
"rewrites": 47
},
"net":
{
"conflict_clusters": 3,
"singleton_clusters": 0
},
"result":
{
"edges": 22528,
"markings": 16385,
"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": 284
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 310
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"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": "((1 <= p1) AND (1 <= p3) AND (1 <= p7) AND (1 <= p10))",
"processed_size": 54,
"rewrites": 44
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 341
},
"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": "(65535 <= p5)",
"processed_size": 13,
"rewrites": 47
},
"result":
{
"edges": 122881,
"markings": 122881,
"produced_by": "state space /EFEG",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability_of_possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 379
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"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": "EX((((p3 <= 0) OR (p9 <= 0)) AND ((p4 <= 0) OR (p6 <= 0) OR (p8 <= 0))))",
"processed_size": 75,
"rewrites": 45
},
"net":
{
"conflict_clusters": 3,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 6,
"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": 310
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"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 ((p11 <= 65534)))",
"processed_size": 22,
"rewrites": 46
},
"result":
{
"edges": 8193,
"markings": 8194,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 401
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 2,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "E(EF(((p0 <= 0) OR (p8 <= 0))) U ((65535 <= p5) AND (1 <= p3) AND (1 <= p9) AND ((1 <= p7) OR ((1 <= p4) AND (1 <= p6) AND (1 <= p8)))))",
"processed_size": 138,
"rewrites": 46
},
"net":
{
"conflict_clusters": 3,
"singleton_clusters": 0
},
"result":
{
"edges": 1441768,
"markings": 524280,
"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": 458
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 1,
"G": 1,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 2,
"aneg": 0,
"comp": 13,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 13,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "(A(EG((1 <= p2)) U ((p2 <= 0) OR ((65535 <= p11) AND (61439 <= p3) AND (61439 <= p5)))) OR (AF((((61439 <= p3) AND (4096 <= p6) AND (1 <= p4) AND (1 <= p6) AND (1 <= p8)) OR (65535 <= p5))) AND ((61439 <= p3) AND (61439 <= p5))))",
"processed_size": 231,
"rewrites": 47
},
"net":
{
"conflict_clusters": 3,
"singleton_clusters": 0
},
"result":
{
"edges": 614396,
"markings": 245757,
"produced_by": "CTL model checker",
"value": false
},
"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": 534
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 0,
"U": 2,
"X": 0,
"aconj": 5,
"adisj": 2,
"aneg": 0,
"comp": 17,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 17,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "A((((1 <= p4) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p8) AND (1 <= p1) AND (1 <= p3) AND (1 <= p7) AND (1 <= p10) AND ((1 <= p9) OR ((61439 <= p3) AND (4096 <= p6))))) U E(((1 <= p4) AND (1 <= p6) AND (1 <= p8)) U ((61439 <= p3) AND (61439 <= p5))))",
"processed_size": 265,
"rewrites": 46
},
"net":
{
"conflict_clusters": 3,
"singleton_clusters": 0
},
"result":
{
"edges": 8,
"markings": 4,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 641
},
"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": "((p0 <= 0) OR (p8 <= 0))",
"processed_size": 25,
"rewrites": 44
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 801
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F ((65535 <= p5)))",
"processed_size": 21,
"rewrites": 45
},
"result":
{
"edges": 122879,
"markings": 122880,
"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": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1030
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F ((65535 <= p11)))",
"processed_size": 22,
"rewrites": 45
},
"result":
{
"edges": 8193,
"markings": 8194,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1545
},
"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": "((61439 <= p3) AND (61439 <= p5))",
"processed_size": 33,
"rewrites": 47
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3090
},
"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": "((65535 <= p11) OR (1 <= p2))",
"processed_size": 30,
"rewrites": 47
},
"result":
{
"edges": 122879,
"markings": 122879,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3090
},
"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": "(65535 <= p5)",
"processed_size": 13,
"rewrites": 47
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F (((p3 <= 61438) OR (p5 <= 61438))))",
"processed_size": 41,
"rewrites": 45
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 16,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"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": "((1 <= p2) OR (65535 <= p11))",
"processed_size": 30,
"rewrites": 47
},
"result":
{
"edges": 122879,
"markings": 122879,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((1 <= p4) AND (1 <= p6) AND (1 <= p8))",
"processed_size": 39,
"rewrites": 44
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3340,
"runtime": 932.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E((E(F(**)) U **)) : (A((E(G(**)) U **)) OR (A(F(**)) AND (** AND **))) : (** AND A(G(E(X(*))))) : E(F(E(G(**)))) : A((** U E((** U **)))) : A(G(*)) : E(F((E(G(*)) AND *))) : E(F(A(G(A(F(**)))))) : (A(F(E(G(**)))) OR E(F(**))) : (A(G(**)) AND (E(X(**)) AND **)) : E(F((** AND (E(X(**)) OR A(X(**)))))) : (A(F(*)) AND (E(F(*)) AND (A((* R *)) OR (A(F(*)) AND **)))) : (E(F(**)) AND **) : (** AND (A(F(*)) AND A(F(*)))) : ((** OR E(F(E(G(**))))) AND (E(X(*)) OR **))"
},
"net":
{
"arcs": 38,
"conflict_clusters": 3,
"places": 12,
"places_significant": 6,
"singleton_clusters": 0,
"transitions": 10
},
"result":
{
"preliminary_value": "yes no unknown yes no no unknown unknown yes no yes no yes no yes ",
"value": "yes no unknown yes no no unknown unknown yes no 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: 22/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 384
lola: finding significant places
lola: 12 places, 10 transitions, 6 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLFireability.xml
lola: E ((E (F (((p0 <= 0) OR (p8 <= 0)))) U ((65535 <= p5) AND (1 <= p3) AND (1 <= p9) AND ((1 <= p7) OR ((1 <= p4) AND (1 <= p6) AND (1 <= p8)))))) : (A ((E (G ((1 <= p2))) U ((p2 <= 0) OR ((65535 <= p11) AND (61439 <= p3) AND (61439 <= p5))))) OR ((A (F ((((61439 <= p3) AND (4096 <= p6) AND (1 <= p4) AND (1 <= p6) AND (1 <= p8)) OR (65535 <= p5)))) AND (61439 <= p3)) AND (61439 <= p5))) : (((1 <= p4) AND (1 <= p6) AND (1 <= p8)) AND NOT(E (F (A (X (((61439 <= p3) AND (61439 <= p5)))))))) : E (F (E (G (E (G ((1 <= p7))))))) : A (((((1 <= p4) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p8) AND (1 <= p1) AND (1 <= p3) AND (1 <= p7) AND (1 <= p10) AND ((1 <= p9) OR ((61439 <= p3) AND (4096 <= p6))))) U E ((((1 <= p4) AND (1 <= p6) AND (1 <= p8)) U ((61439 <= p3) AND (61439 <= p5)))))) : A (G (NOT(E (F ((65535 <= p11)))))) : NOT(A (G ((A (F ((1 <= p2))) OR (1 <= p7))))) : E (F (A (G (A (F ((1 <= p7))))))) : (A (F (E (G (((1 <= p0) AND (1 <= p8)))))) OR A (((p11 <= 65534) U E (F ((65535 <= p11)))))) : ((A (G (((p11 <= 65534) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p7) AND (1 <= p10) AND (1 <= p0) AND (1 <= p8))))) AND E (X (((p0 <= 0) OR (p8 <= 0))))) AND ((p1 <= 0) OR (p3 <= 0) OR (p7 <= 0) OR (p10 <= 0))) : E (F (((65535 <= p11) AND (E (X (((1 <= p4) AND (1 <= p6) AND (1 <= p8)))) OR A (X ((65535 <= p11))))))) : ((NOT(E (G (((1 <= p2) OR (65535 <= p11))))) AND NOT(A (G (((61439 <= p3) AND (61439 <= p5)))))) AND (NOT(E ((((61439 <= p3) AND (4096 <= p6)) U ((1 <= p4) AND (1 <= p6) AND (1 <= p8))))) OR (NOT(E (G ((65535 <= p5)))) AND (((61439 <= p3) AND (61439 <= p5)) OR ((p7 <= 0) AND ((p3 <= 61438) OR (p5 <= 61438))))))) : (E (F ((65535 <= p5))) AND ((p0 <= 0) OR (p8 <= 0))) : ((((p11 <= 65534) AND (1 <= p4) AND (1 <= p6) AND (1 <= p8)) AND NOT(E (G (((65535 <= p11) OR (1 <= p2)))))) AND NOT(E (G (((61439 <= p3) AND (61439 <= p5)))))) : (((1 <= p7) OR E (F (E (G ((65535 <= p5)))))) AND (NOT(A (X ((((1 <= p3) AND (1 <= p9)) OR ((1 <= p4) AND (1 <= p6) AND (1 <= p8)))))) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p7) AND (1 <= p10))))
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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:461
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:389
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:452
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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: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:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:251
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p4) AND (1 <= p6) AND (1 <= p8)) AND A (G (E (X (((p3 <= 61438) OR (p5 <= 61438)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p4) AND (1 <= p6) AND (1 <= p8))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p4) AND (1 <= p6) AND (1 <= p8))
lola: processed formula length: 39
lola: 44 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 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X (((p3 <= 61438) OR (p5 <= 61438))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(EX(((p3 <= 61438) OR (p5 <= 61438))))
lola: processed formula length: 41
lola: 46 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: 5114677 markings, 8229816 edges, 1022935 markings/sec, 0 secs
lola: 9895173 markings, 15956919 edges, 956099 markings/sec, 5 secs
lola: 14769649 markings, 23924017 edges, 974895 markings/sec, 10 secs
lola: 19397283 markings, 31389776 edges, 925527 markings/sec, 15 secs
lola: 23942100 markings, 38818610 edges, 908963 markings/sec, 20 secs
lola: 28497651 markings, 46220022 edges, 911110 markings/sec, 25 secs
lola: 32989344 markings, 53481869 edges, 898339 markings/sec, 30 secs
lola: 37543418 markings, 60917064 edges, 910815 markings/sec, 35 secs
lola: 41927668 markings, 68065222 edges, 876850 markings/sec, 40 secs
lola: 46443062 markings, 75366447 edges, 903079 markings/sec, 45 secs
lola: 50958364 markings, 82689343 edges, 903060 markings/sec, 50 secs
lola: 55332068 markings, 89819059 edges, 874741 markings/sec, 55 secs
lola: 59782448 markings, 97079412 edges, 890076 markings/sec, 60 secs
lola: 64330324 markings, 104425648 edges, 909575 markings/sec, 65 secs
lola: 68619948 markings, 111384393 edges, 857925 markings/sec, 70 secs
lola: 73150902 markings, 118773888 edges, 906191 markings/sec, 75 secs
lola: 77232430 markings, 125392295 edges, 816306 markings/sec, 80 secs
lola: 81233629 markings, 131877852 edges, 800240 markings/sec, 85 secs
lola: 85980346 markings, 139652617 edges, 949343 markings/sec, 90 secs
lola: 90765206 markings, 147370790 edges, 956972 markings/sec, 95 secs
lola: 94700673 markings, 153782405 edges, 787093 markings/sec, 100 secs
lola: 97703083 markings, 158680268 edges, 600482 markings/sec, 105 secs
lola: 100603535 markings, 163411256 edges, 580090 markings/sec, 110 secs
lola: 103261622 markings, 167673532 edges, 531617 markings/sec, 115 secs
lola: 106065924 markings, 172272128 edges, 560860 markings/sec, 120 secs
lola: 108404346 markings, 176041916 edges, 467684 markings/sec, 125 secs
lola: 111366686 markings, 180878656 edges, 592468 markings/sec, 130 secs
lola: 113869651 markings, 184920107 edges, 500593 markings/sec, 135 secs
lola: 117138668 markings, 190247689 edges, 653803 markings/sec, 140 secs
lola: 118137972 markings, 191865400 edges, 199861 markings/sec, 145 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 1 will run for 243 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((p11 <= 65534) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p7) AND (1 <= p10) AND (1 <= p0) AND (1 <= p8))))) AND (E (X (((p0 <= 0) OR (p8 <= 0)))) AND ((p1 <= 0) OR (p3 <= 0) OR (p7 <= 0) OR (p10 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 243 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p1 <= 0) OR (p3 <= 0) OR (p7 <= 0) OR (p10 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p1 <= 0) OR (p3 <= 0) OR (p7 <= 0) OR (p10 <= 0))
lola: processed formula length: 54
lola: 44 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 4 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 262 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (((p0 <= 0) OR (p8 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(((p0 <= 0) OR (p8 <= 0)))
lola: processed formula length: 29
lola: 45 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 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 284 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p11 <= 65534) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p7) AND (1 <= p10) AND (1 <= p0) AND (1 <= p8)))))
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 (((p11 <= 65534) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p7) AND (1 <= p10) AND (1 <= p0) AND (1 <= p8)))))
lola: processed formula length: 111
lola: 46 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: ((65535 <= p11) AND ((p1 <= 0) OR (p3 <= 0) OR (p7 <= 0) OR (p10 <= 0) OR (p0 <= 0) OR (p8 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 12 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-3-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 8194 markings, 8193 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 262 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((65535 <= p11) AND (E (X (((1 <= p4) AND (1 <= p6) AND (1 <= p8)))) OR A (X ((65535 <= p11)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(((65535 <= p11) AND (EX(((1 <= p4) AND (1 <= p6) AND (1 <= p8))) OR AX((65535 <= p11)))))
lola: processed formula length: 92
lola: 47 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: 16385 markings, 22528 edges
lola: ========================================
lola: subprocess 3 will run for 284 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p7) OR E (F (E (G ((65535 <= p5)))))) AND (E (X ((((p3 <= 0) OR (p9 <= 0)) AND ((p4 <= 0) OR (p6 <= 0) OR (p8 <= 0))))) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p7) AND (1 <= p10))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 284 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p7)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p7)
lola: processed formula length: 9
lola: 44 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 310 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p1) AND (1 <= p3) AND (1 <= p7) AND (1 <= p10))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p1) AND (1 <= p3) AND (1 <= p7) AND (1 <= p10))
lola: processed formula length: 54
lola: 44 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 4 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 341 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((65535 <= p5)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:598
lola: rewrite Frontend/Parser/formula_rewrite.k:633
lola: rewrite Frontend/Parser/formula_rewrite.k:730
lola: processed formula: (65535 <= p5)
lola: processed formula length: 13
lola: 47 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 /EFEG)
lola: state space: using reachability graph (EFEG 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: 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 started, id 1
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p5 <= 65534)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (65535 <= p5)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-5-0.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLFireability-5-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-5-0.sara.
sara: try reading problem file CTLFireability-5-1.sara.
sara: place or transition ordering is non-deterministicsara:
place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EFEG
lola: The predicate is possibly preserved from a reachable marking.
lola: 122881 markings, 122881 edges
lola: ========================================
lola: subprocess 6 will run for 379 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((((p3 <= 0) OR (p9 <= 0)) AND ((p4 <= 0) OR (p6 <= 0) OR (p8 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX((((p3 <= 0) OR (p9 <= 0)) AND ((p4 <= 0) OR (p6 <= 0) OR (p8 <= 0))))
lola: processed formula length: 75
lola: 45 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 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 4 will run for 310 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p11 <= 65534)))
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 ((p11 <= 65534)))
lola: processed formula length: 22
lola: 46 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: (65535 <= p11)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-4-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 8194 markings, 8193 edges
lola: ========================================
lola: subprocess 5 will run for 341 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((1 <= p7)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:598
lola: rewrite Frontend/Parser/formula_rewrite.k:633
lola: rewrite Frontend/Parser/formula_rewrite.k:730
lola: processed formula: (1 <= p7)
lola: processed formula length: 9
lola: 47 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 /EFEG)
lola: state space: using reachability graph (EFEG 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: 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: state equation task get result unparse finished++ id 0
lola: formula 0: (p7 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (1 <= p7)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-5-0.sara
lola: state equation: write sara problem file to CTLFireability-5-1.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-5-0.sara.
sara: try reading problem file CTLFireability-5-1.sara.
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic

lola: state equation 1: solution produced
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EFEG
lola: The predicate is possibly preserved from a reachable marking.
lola: 245759 markings, 245759 edges
lola: ========================================
lola: subprocess 6 will run for 379 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (A (F ((1 <= p7)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(AG(AF((1 <= p7))))
lola: processed formula length: 21
lola: 47 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: 6692882 markings, 6693688 edges, 1338576 markings/sec, 0 secs
lola: 13383967 markings, 13385584 edges, 1338217 markings/sec, 5 secs
lola: 19738951 markings, 19741347 edges, 1270997 markings/sec, 10 secs
lola: 27319383 markings, 27322710 edges, 1516086 markings/sec, 15 secs
lola: 34772682 markings, 34776909 edges, 1490660 markings/sec, 20 secs
lola: 42234915 markings, 42240042 edges, 1492447 markings/sec, 25 secs
lola: 49610254 markings, 49616281 edges, 1475068 markings/sec, 30 secs
lola: 56971392 markings, 56978319 edges, 1472228 markings/sec, 35 secs
lola: 64248350 markings, 64256177 edges, 1455392 markings/sec, 40 secs
lola: 71750631 markings, 71759358 edges, 1500456 markings/sec, 45 secs
lola: 79134396 markings, 79144023 edges, 1476753 markings/sec, 50 secs
lola: 86507166 markings, 86517693 edges, 1474554 markings/sec, 55 secs
lola: 93793798 markings, 93805225 edges, 1457326 markings/sec, 60 secs
lola: 101163073 markings, 101175400 edges, 1473855 markings/sec, 65 secs
lola: 107924296 markings, 107937463 edges, 1352245 markings/sec, 70 secs
lola: 115082626 markings, 115096663 edges, 1431666 markings/sec, 75 secs
lola: 122280934 markings, 122295840 edges, 1439662 markings/sec, 80 secs
lola: 129357568 markings, 129373344 edges, 1415327 markings/sec, 85 secs
lola: 136887761 markings, 136904438 edges, 1506039 markings/sec, 90 secs
lola: 144201942 markings, 144219519 edges, 1462836 markings/sec, 95 secs
lola: 151368587 markings, 151387034 edges, 1433329 markings/sec, 100 secs
lola: 157989381 markings, 158008638 edges, 1324159 markings/sec, 105 secs
lola: 164658528 markings, 164678595 edges, 1333829 markings/sec, 110 secs
lola: 171452838 markings, 171473745 edges, 1358862 markings/sec, 115 secs
lola: 178178795 markings, 178200542 edges, 1345191 markings/sec, 120 secs
lola: 184720818 markings, 184743345 edges, 1308405 markings/sec, 125 secs
lola: 191083721 markings, 191107028 edges, 1272581 markings/sec, 130 secs
lola: 197926413 markings, 197950559 edges, 1368538 markings/sec, 135 secs
lola: 204676554 markings, 204701510 edges, 1350028 markings/sec, 140 secs
lola: 211376723 markings, 211402520 edges, 1340034 markings/sec, 145 secs
lola: 217689482 markings, 217716261 edges, 1262552 markings/sec, 150 secs
lola: 222732251 markings, 222759582 edges, 1008554 markings/sec, 155 secs
lola: 228132519 markings, 228160357 edges, 1080054 markings/sec, 160 secs
lola: 233456810 markings, 233485277 edges, 1064858 markings/sec, 165 secs
lola: 238706590 markings, 238735716 edges, 1049956 markings/sec, 170 secs
lola: 243850877 markings, 243880634 edges, 1028857 markings/sec, 175 secs
lola: 248527886 markings, 248558212 edges, 935402 markings/sec, 180 secs
lola: 253595661 markings, 253626588 edges, 1013555 markings/sec, 185 secs
lola: 259132099 markings, 259163737 edges, 1107288 markings/sec, 190 secs
lola: 263867602 markings, 263899788 edges, 947101 markings/sec, 195 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 401 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (F (((p0 <= 0) OR (p8 <= 0)))) U ((65535 <= p5) AND (1 <= p3) AND (1 <= p9) AND ((1 <= p7) OR ((1 <= p4) AND (1 <= p6) AND (1 <= p8))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(EF(((p0 <= 0) OR (p8 <= 0))) U ((65535 <= p5) AND (1 <= p3) AND (1 <= p9) AND ((1 <= p7) OR ((1 <= p4) AND (1 <= p6) AND (1 <= p8)))))
lola: processed formula length: 138
lola: 46 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: 524280 markings, 1441768 edges
lola: ========================================
lola: subprocess 8 will run for 458 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A ((E (G ((1 <= p2))) U ((p2 <= 0) OR ((65535 <= p11) AND (61439 <= p3) AND (61439 <= p5))))) OR (A (F ((((61439 <= p3) AND (4096 <= p6) AND (1 <= p4) AND (1 <= p6) AND (1 <= p8)) OR (65535 <= p5)))) AND ((61439 <= p3) AND (61439 <= p5))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: (A(EG((1 <= p2)) U ((p2 <= 0) OR ((65535 <= p11) AND (61439 <= p3) AND (61439 <= p5)))) OR (AF((((61439 <= p3) AND (4096 <= p6) AND (1 <= p4) AND (1 <= p6) AND (1 <= p8)) OR (65535 <= p5))) AND ((61439 <= p3) AND (61439 <= p5))))
lola: processed formula length: 231
lola: 47 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 245757 markings, 614396 edges
lola: ========================================
lola: subprocess 9 will run for 534 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((((1 <= p4) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p8) AND (1 <= p1) AND (1 <= p3) AND (1 <= p7) AND (1 <= p10) AND ((1 <= p9) OR ((61439 <= p3) AND (4096 <= p6))))) U E ((((1 <= p4) AND (1 <= p6) AND (1 <= p8)) U ((61439 <= p3) AND (61439 <= p5))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A((((1 <= p4) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p8) AND (1 <= p1) AND (1 <= p3) AND (1 <= p7) AND (1 <= p10) AND ((1 <= p9) OR ((61439 <= p3) AND (4096 <= p6))))) U E(((1 <= p4) AND (1 <= p6) AND (1 <= p8)) U ((61439 <= p3) AND (61439 <= p5))))
lola: processed formula length: 265
lola: 46 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: 4 markings, 8 edges
lola: ========================================
lola: subprocess 10 will run for 641 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((65535 <= p5))) AND ((p0 <= 0) OR (p8 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 641 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p0 <= 0) OR (p8 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p0 <= 0) OR (p8 <= 0))
lola: processed formula length: 25
lola: 44 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 11 will run for 801 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((65535 <= p5)))
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 ((65535 <= p5)))
lola: processed formula length: 21
lola: 45 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: (65535 <= p5)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-11-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 122880 markings, 122879 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 11 will run for 801 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((E (G ((p2 <= 0))) AND (p7 <= 0))))
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:659
lola: rewrite Frontend/Parser/formula_rewrite.k:662
lola: rewrite Frontend/Parser/formula_rewrite.k:674
lola: rewrite Frontend/Parser/formula_rewrite.k:674
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 ((1 <= p2)) OR (1 <= p7)))
lola: processed formula length: 32
lola: 54 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: 7170900 markings, 7171015 edges, 1434180 markings/sec, 0 secs
lola: 14585050 markings, 14585285 edges, 1482830 markings/sec, 5 secs
lola: 21993711 markings, 21994066 edges, 1481732 markings/sec, 10 secs
lola: 29312012 markings, 29312486 edges, 1463660 markings/sec, 15 secs
lola: 36718270 markings, 36718864 edges, 1481252 markings/sec, 20 secs
lola: 43663256 markings, 43663965 edges, 1388997 markings/sec, 25 secs
lola: 50908497 markings, 50909324 edges, 1449048 markings/sec, 30 secs
lola: 57313496 markings, 57314426 edges, 1281000 markings/sec, 35 secs
lola: 63849516 markings, 63850552 edges, 1307204 markings/sec, 40 secs
lola: 71464178 markings, 71465339 edges, 1522932 markings/sec, 45 secs
lola: 79067835 markings, 79069121 edges, 1520731 markings/sec, 50 secs
lola: 86617297 markings, 86618705 edges, 1509892 markings/sec, 55 secs
lola: 93899948 markings, 93901476 edges, 1456530 markings/sec, 60 secs
lola: 101159226 markings, 101160871 edges, 1451856 markings/sec, 65 secs
lola: 108368817 markings, 108370578 edges, 1441918 markings/sec, 70 secs
lola: 115520215 markings, 115522095 edges, 1430280 markings/sec, 75 secs
lola: 120852918 markings, 120858031 edges, 1066541 markings/sec, 80 secs
lola: 124439164 markings, 124441187 edges, 717249 markings/sec, 85 secs
lola: 128631260 markings, 128633370 edges, 838419 markings/sec, 90 secs
lola: 133063736 markings, 133065900 edges, 886495 markings/sec, 95 secs
lola: 137528284 markings, 137530522 edges, 892910 markings/sec, 100 secs
lola: 143115801 markings, 143118142 edges, 1117503 markings/sec, 105 secs
lola: 143470668 markings, 143473001 edges, 70973 markings/sec, 110 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 1030 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (E (G (((1 <= p0) AND (1 <= p8)))))) OR E (F ((65535 <= p11))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 1030 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((65535 <= p11)))
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 ((65535 <= p11)))
lola: processed formula length: 22
lola: 45 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: (65535 <= p11)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-12-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8194 markings, 8193 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 1545 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p11 <= 65534) AND (1 <= p4) AND (1 <= p6) AND (1 <= p8)) AND (A (F (((p11 <= 65534) AND (p2 <= 0)))) AND A (F (((p3 <= 61438) OR (p5 <= 61438))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1545 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((p3 <= 61438) OR (p5 <= 61438))))
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: ((61439 <= p3) AND (61439 <= p5))
lola: processed formula length: 33
lola: 47 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: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
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: ((p3 <= 61438) OR (p5 <= 61438))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: ========================================
lola: subprocess 14 will run for 3090 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((p11 <= 65534) AND (p2 <= 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: ((65535 <= p11) OR (1 <= p2))
lola: processed formula length: 30
lola: 47 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: ((p11 <= 65534) AND (p2 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-14-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 122879 markings, 122879 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 3090 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (((p2 <= 0) AND (p11 <= 65534)))) AND (E (F (((p3 <= 61438) OR (p5 <= 61438)))) AND (A ((((p3 <= 61438) OR (p6 <= 4095)) R ((p4 <= 0) OR (p6 <= 0) OR (p8 <= 0)))) OR (A (F ((p5 <= 65534))) AND (((61439 <= p3) AND (61439 <= p5)) OR ((p7 <= 0) AND ((p3 <= 61438) OR (p5 <= 61438))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 3090 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p5 <= 65534)))
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: (65535 <= p5)
lola: processed formula length: 13
lola: 47 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: (p5 <= 65534)
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 / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 16 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p3 <= 61438) OR (p5 <= 61438))))
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 (((p3 <= 61438) OR (p5 <= 61438))))
lola: processed formula length: 41
lola: 45 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p3 <= 61438) OR (p5 <= 61438))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to CTLFireability-16-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((p2 <= 0) AND (p11 <= 65534))))
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 <= p2) OR (65535 <= p11))
lola: processed formula length: 30
lola: 47 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: sara: try reading problem file CTLFireability-16-0.sara.
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
sara: place or transition ordering is non-deterministic

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: ((p2 <= 0) AND (p11 <= 65534))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 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: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 122879 markings, 122879 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (((1 <= p4) AND (1 <= p6) AND (1 <= p8)) AND A (G (E (X (((p3 <= 61438) OR (p5 <= 61438)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((1 <= p4) AND (1 <= p6) AND (1 <= p8))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p4) AND (1 <= p6) AND (1 <= p8))
lola: processed formula length: 39
lola: 44 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: ========================================
lola: ...considering subproblem: A (G (E (X (((p3 <= 61438) OR (p5 <= 61438))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(EX(((p3 <= 61438) OR (p5 <= 61438))))
lola: processed formula length: 41
lola: 46 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: 5383691 markings, 8665386 edges, 1076738 markings/sec, 0 secs
lola: 10419551 markings, 16858013 edges, 1007172 markings/sec, 5 secs
lola: 15509020 markings, 25109249 edges, 1017894 markings/sec, 10 secs
lola: 20567972 markings, 33307085 edges, 1011790 markings/sec, 15 secs
lola: 25445426 markings, 41248453 edges, 975491 markings/sec, 20 secs
lola: 30292369 markings, 49145182 edges, 969389 markings/sec, 25 secs
lola: 35299800 markings, 57252855 edges, 1001486 markings/sec, 30 secs
lola: 40317080 markings, 65391011 edges, 1003456 markings/sec, 35 secs
lola: 44820680 markings, 72734795 edges, 900720 markings/sec, 40 secs
lola: 49682437 markings, 80618774 edges, 972351 markings/sec, 45 secs
lola: 54543249 markings, 88565343 edges, 972162 markings/sec, 50 secs
lola: 59299220 markings, 96237309 edges, 951194 markings/sec, 55 secs
lola: 63981603 markings, 103902567 edges, 936477 markings/sec, 60 secs
lola: 68186726 markings, 110734560 edges, 841025 markings/sec, 65 secs
lola: 72552450 markings, 117807453 edges, 873145 markings/sec, 70 secs
lola: 76343202 markings, 123967215 edges, 758150 markings/sec, 75 secs
lola: 80687015 markings, 131044619 edges, 868763 markings/sec, 80 secs
lola: 84866650 markings, 137834714 edges, 835927 markings/sec, 85 secs
lola: 89273303 markings, 144985989 edges, 881331 markings/sec, 90 secs
lola: 93917272 markings, 152493706 edges, 928794 markings/sec, 95 secs
lola: 97283488 markings, 158009681 edges, 673243 markings/sec, 100 secs
lola: 100421638 markings, 163090211 edges, 627630 markings/sec, 105 secs
lola: 103670738 markings, 168382672 edges, 649820 markings/sec, 110 secs
lola: 106843042 markings, 173541005 edges, 634461 markings/sec, 115 secs
lola: 109985222 markings, 178646620 edges, 628436 markings/sec, 120 secs
lola: 113044545 markings, 183607234 edges, 611865 markings/sec, 125 secs
lola: 116648260 markings, 189456402 edges, 720743 markings/sec, 130 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (A (G (A (F ((1 <= p7)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(AG(AF((1 <= p7))))
lola: processed formula length: 21
lola: 47 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: 6143973 markings, 6144690 edges, 1228795 markings/sec, 0 secs
lola: 12727808 markings, 12729335 edges, 1316767 markings/sec, 5 secs
lola: 19457923 markings, 19460289 edges, 1346023 markings/sec, 10 secs
lola: 26455180 markings, 26458387 edges, 1399451 markings/sec, 15 secs
lola: 33203970 markings, 33208017 edges, 1349758 markings/sec, 20 secs
lola: 39954728 markings, 39959585 edges, 1350152 markings/sec, 25 secs
lola: 46904439 markings, 46910136 edges, 1389942 markings/sec, 30 secs
lola: 54315051 markings, 54321678 edges, 1482122 markings/sec, 35 secs
lola: 61676821 markings, 61684318 edges, 1472354 markings/sec, 40 secs
lola: 68715324 markings, 68723691 edges, 1407701 markings/sec, 45 secs
lola: 75266730 markings, 75275907 edges, 1310281 markings/sec, 50 secs
lola: 82070402 markings, 82080389 edges, 1360734 markings/sec, 55 secs
lola: 88985084 markings, 88995941 edges, 1382936 markings/sec, 60 secs
lola: 95952283 markings, 95963980 edges, 1393440 markings/sec, 65 secs
lola: 103425053 markings, 103437650 edges, 1494554 markings/sec, 70 secs
lola: 111109015 markings, 111122572 edges, 1536792 markings/sec, 75 secs
lola: 118575714 markings, 118590171 edges, 1493340 markings/sec, 80 secs
lola: 125785256 markings, 125800583 edges, 1441908 markings/sec, 85 secs
lola: 133631151 markings, 133647438 edges, 1569179 markings/sec, 90 secs
lola: 141167861 markings, 141185084 edges, 1507342 markings/sec, 95 secs
lola: 148951467 markings, 148969644 edges, 1556721 markings/sec, 100 secs
lola: 156047567 markings, 156066584 edges, 1419220 markings/sec, 105 secs
lola: 163760205 markings, 163780182 edges, 1542528 markings/sec, 110 secs
lola: 171437319 markings, 171458226 edges, 1535423 markings/sec, 115 secs
lola: 179027981 markings, 179049818 edges, 1518132 markings/sec, 120 secs
lola: 186620407 markings, 186643174 edges, 1518485 markings/sec, 125 secs
lola: 194379373 markings, 194403069 edges, 1551793 markings/sec, 130 secs
lola: 201810497 markings, 201835124 edges, 1486225 markings/sec, 135 secs
lola: 209385644 markings, 209411171 edges, 1515029 markings/sec, 140 secs
lola: 216377016 markings, 216403787 edges, 1398274 markings/sec, 145 secs
lola: 221669260 markings, 221696742 edges, 1058449 markings/sec, 150 secs
lola: 227652303 markings, 227680082 edges, 1196609 markings/sec, 155 secs
lola: 233366558 markings, 233395037 edges, 1142851 markings/sec, 160 secs
lola: 239238631 markings, 239267819 edges, 1174415 markings/sec, 165 secs
lola: 244546863 markings, 244576709 edges, 1061646 markings/sec, 170 secs
lola: 250014151 markings, 250044657 edges, 1093458 markings/sec, 175 secs
lola: 256252059 markings, 256283332 edges, 1247582 markings/sec, 180 secs
lola: 261759073 markings, 261791020 edges, 1101403 markings/sec, 185 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E (F ((E (G ((p2 <= 0))) AND (p7 <= 0))))
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:659
lola: rewrite Frontend/Parser/formula_rewrite.k:662
lola: rewrite Frontend/Parser/formula_rewrite.k:674
lola: rewrite Frontend/Parser/formula_rewrite.k:674
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 ((1 <= p2)) OR (1 <= p7)))
lola: processed formula length: 32
lola: 54 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: 7549550 markings, 7549670 edges, 1509910 markings/sec, 0 secs
lola: 14500186 markings, 14500419 edges, 1390127 markings/sec, 5 secs
lola: 21841592 markings, 21841945 edges, 1468281 markings/sec, 10 secs
lola: 29299344 markings, 29299819 edges, 1491550 markings/sec, 15 secs
lola: 36985345 markings, 36985944 edges, 1537200 markings/sec, 20 secs
lola: 44606521 markings, 44607244 edges, 1524235 markings/sec, 25 secs
lola: 52059639 markings, 52060484 edges, 1490624 markings/sec, 30 secs
lola: 58999782 markings, 59000741 edges, 1388029 markings/sec, 35 secs
lola: 66571139 markings, 66572254 edges, 1514271 markings/sec, 40 secs
lola: 74033518 markings, 74034722 edges, 1492476 markings/sec, 45 secs
lola: 81406430 markings, 81407753 edges, 1474582 markings/sec, 50 secs
lola: 88862042 markings, 88863487 edges, 1491122 markings/sec, 55 secs
lola: 96335889 markings, 96337454 edges, 1494769 markings/sec, 60 secs
lola: 103949008 markings, 103950697 edges, 1522624 markings/sec, 65 secs
lola: 111422967 markings, 111424778 edges, 1494792 markings/sec, 70 secs
lola: 117536713 markings, 117538782 edges, 1222749 markings/sec, 75 secs
lola: 122909652 markings, 122911847 edges, 1074588 markings/sec, 80 secs
lola: 125681984 markings, 125684027 edges, 554466 markings/sec, 85 secs
lola: 130817114 markings, 130819244 edges, 1027026 markings/sec, 90 secs
lola: 135007300 markings, 135009495 edges, 838037 markings/sec, 95 secs
lola: 138850879 markings, 138853137 edges, 768716 markings/sec, 100 secs
lola: 143138215 markings, 143140562 edges, 857467 markings/sec, 105 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: yes no unknown yes no no unknown unknown yes no yes no yes no yes
lola:
preliminary result: yes no unknown yes no no unknown unknown yes no yes no yes no yes
lola: memory consumption: 3340 KB
lola: time consumption: 932 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="SatelliteMemory-PT-X65535Y2048"
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 SatelliteMemory-PT-X65535Y2048, 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 r211-tajo-159033476900036"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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