Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r182-oct2-158987913400132.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is BridgeAndVehicles-COL-V04P05N02, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987913400132
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 228K
-rw-r--r-- 1 mcc users 3.5K Mar 26 02:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 26 02:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 25 20:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 20:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Apr 8 14:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 8 14:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 25 17:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 25 17:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Mar 25 12:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 25 12:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 25 17:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 25 17:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 37K Mar 24 05:37 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1591128180237

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 20:03:02] [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-02 20:03:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 20:03:02] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-06-02 20:03:03] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 645 ms
[2020-06-02 20:03:03] [INFO ] sort/places :
sens->CONTROLEUR,CHOIX,VIDANGE,
compteur->COMPTEUR,
Dot->CAPACITE,SORTI_A,ROUTE_A,ATTENTE_A,SUR_PONT_A,SUR_PONT_B,ATTENTE_B,ROUTE_B,SORTI_B,
voitureA->NB_ATTENTE_A,
voitureB->NB_ATTENTE_B,

[2020-06-02 20:03:03] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 28 PT places and 346.0 transition bindings in 45 ms.
[2020-06-02 20:03:03] [INFO ] Computed order based on color domains.
[2020-06-02 20:03:03] [INFO ] Unfolded HLPN to a Petri net with 28 places and 52 transitions in 14 ms.
[2020-06-02 20:03:03] [INFO ] Unfolded HLPN properties in 1 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 41 ms.
Incomplete random walk after 100000 steps, including 2298 resets, run finished after 306 ms. (steps per millisecond=326 ) properties seen :[1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1]
[2020-06-02 20:03:03] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 28 cols
[2020-06-02 20:03:03] [INFO ] Computed 7 place invariants in 3 ms
[2020-06-02 20:03:03] [INFO ] [Real]Absence check using 7 positive place invariants in 14 ms returned unsat
[2020-06-02 20:03:03] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-02 20:03:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:03:03] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2020-06-02 20:03:03] [INFO ] State equation strengthened by 6 read => feed constraints.
[2020-06-02 20:03:03] [INFO ] [Real]Added 6 Read/Feed constraints in 2 ms returned sat
[2020-06-02 20:03:03] [INFO ] Computed and/alt/rep : 49/245/31 causal constraints in 14 ms.
[2020-06-02 20:03:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:03:03] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2020-06-02 20:03:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:03:03] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2020-06-02 20:03:03] [INFO ] [Nat]Added 6 Read/Feed constraints in 4 ms returned sat
[2020-06-02 20:03:03] [INFO ] Deduced a trap composed of 5 places in 70 ms
[2020-06-02 20:03:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2020-06-02 20:03:03] [INFO ] Computed and/alt/rep : 49/245/31 causal constraints in 3 ms.
[2020-06-02 20:03:03] [INFO ] Added : 27 causal constraints over 6 iterations in 59 ms. Result :sat
[2020-06-02 20:03:03] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2020-06-02 20:03:03] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2020-06-02 20:03:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:03:03] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2020-06-02 20:03:03] [INFO ] [Real]Added 6 Read/Feed constraints in 1 ms returned sat
[2020-06-02 20:03:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:03:03] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-06-02 20:03:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:03:03] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2020-06-02 20:03:03] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2020-06-02 20:03:03] [INFO ] Deduced a trap composed of 6 places in 50 ms
[2020-06-02 20:03:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 52 ms
[2020-06-02 20:03:04] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2020-06-02 20:03:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:03:04] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2020-06-02 20:03:04] [INFO ] [Real]Added 6 Read/Feed constraints in 1 ms returned sat
[2020-06-02 20:03:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:03:04] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-06-02 20:03:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:03:04] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2020-06-02 20:03:04] [INFO ] [Nat]Added 6 Read/Feed constraints in 9 ms returned sat
[2020-06-02 20:03:04] [INFO ] Deduced a trap composed of 6 places in 14 ms
[2020-06-02 20:03:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2020-06-02 20:03:04] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-06-02 20:03:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:03:04] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2020-06-02 20:03:04] [INFO ] [Real]Added 6 Read/Feed constraints in 1 ms returned sat
[2020-06-02 20:03:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:03:04] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-06-02 20:03:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:03:04] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2020-06-02 20:03:04] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2020-06-02 20:03:04] [INFO ] Deduced a trap composed of 6 places in 35 ms
[2020-06-02 20:03:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2020-06-02 20:03:04] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2020-06-02 20:03:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:03:04] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2020-06-02 20:03:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:03:04] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-02 20:03:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:03:04] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2020-06-02 20:03:04] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2020-06-02 20:03:04] [INFO ] Deduced a trap composed of 11 places in 392 ms
[2020-06-02 20:03:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 408 ms
[2020-06-02 20:03:04] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2020-06-02 20:03:04] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
Successfully simplified 8 atomic propositions for a total of 8 simplifications.
[2020-06-02 20:03:04] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-02 20:03:04] [INFO ] Flatten gal took : 73 ms
[2020-06-02 20:03:04] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-02 20:03:04] [INFO ] Flatten gal took : 21 ms
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-02 20:03:04] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 7 ms.
[2020-06-02 20:03:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ BridgeAndVehicles-COL-V04P05N02 @ 3570 seconds

FORMULA BridgeAndVehicles-COL-V04P05N02-CTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V04P05N02-CTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V04P05N02-CTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V04P05N02-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V04P05N02-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V04P05N02-CTLFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V04P05N02-CTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V04P05N02-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V04P05N02-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V04P05N02-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V04P05N02-CTLFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V04P05N02-CTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V04P05N02-CTLFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V04P05N02-CTLFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3565
rslt: Output for CTLFireability @ BridgeAndVehicles-COL-V04P05N02

{
"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": "Tue Jun 2 20:03:05 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 1,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(((1 <= p3) AND (1 <= p7)) OR ((1 <= p4) AND (1 <= p7)) OR ((1 <= p5) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p7)))",
"processed_size": 147,
"rewrites": 85
},
"result":
{
"edges": 1695,
"markings": 1080,
"produced_by": "state space /EXEG",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 33
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 10,
"problems": 5
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 5,
"adisj": 1,
"aneg": 0,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "EX(A((((1 <= p3) AND (1 <= p7)) OR ((1 <= p4) AND (1 <= p7)) OR ((1 <= p5) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p7))) U (1 <= p9)))",
"processed_size": 166,
"rewrites": 85
},
"net":
{
"conflict_clusters": 5,
"singleton_clusters": 0
},
"result":
{
"edges": 51,
"markings": 51,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"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": 3,
"visible_transitions": 0
},
"processed": "(((p21 <= 0) OR (p25 <= 0)) AND ((p22 <= 0) OR (p25 <= 0)))",
"processed_size": 61,
"rewrites": 86
},
"result":
{
"edges": 486,
"markings": 280,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 24
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 12,
"adisj": 1,
"aneg": 1,
"comp": 48,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 48,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "(((p4 <= 0) OR (p10 <= 0) OR (p20 <= 0) OR (p24 <= 0)) AND ((p4 <= 0) OR (p10 <= 0) OR (p20 <= 0) OR (p25 <= 0)) AND ((p5 <= 0) OR (p10 <= 0) OR (p20 <= 0) OR (p25 <= 0)) AND ((p4 <= 0) OR (p10 <= 0) OR (p20 <= 0) OR (p23 <= 0)) AND ((p5 <= 0) OR (p10 <= 0) OR (p20 <= 0) OR (p23 <= 0)) AND ((p5 <= 0) OR (p10 <= 0) OR (p20 <= 0) OR (p24 <= 0)) AND ((p2 <= 0) OR (p10 <= 0) OR (p20 <= 0) OR (p23 <= 0)) AND ((p2 <= 0) OR (p10 <= 0) OR (p20 <= 0) OR (p25 <= 0)) AND ((p2 <= 0) OR (p10 <= 0) OR (p20 <= 0) OR (p24 <= 0)) AND ((p3 <= 0) OR (p10 <= 0) OR (p20 <= 0) OR (p24 <= 0)) AND ((p3 <= 0) OR (p10 <= 0) OR (p20 <= 0) OR (p23 <= 0)) AND ((p3 <= 0) OR (p10 <= 0) OR (p20 <= 0) OR (p25 <= 0)))",
"processed_size": 729,
"rewrites": 86
},
"result":
{
"edges": 237,
"markings": 180,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 45
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 48,
"problems": 12
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 7,
"adisj": 1,
"aneg": 1,
"comp": 14,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "(((p3 <= 0) OR (p7 <= 0)) AND ((p4 <= 0) OR (p7 <= 0)) AND ((p5 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p7 <= 0)) AND ((p0 <= 4) OR (p27 <= 0)) AND ((p0 <= 4) OR (p26 <= 0)))",
"processed_size": 209,
"rewrites": 86
},
"result":
{
"edges": 897,
"markings": 454,
"produced_by": "tscc_search",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 896,
"problems": 128
},
"store":
{
"type": "dfs/tscc"
},
"type": "liveness",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"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": "AF(EG((p9 <= 0)))",
"processed_size": 17,
"rewrites": 85
},
"net":
{
"conflict_clusters": 5,
"singleton_clusters": 0
},
"result":
{
"edges": 14809,
"markings": 2793,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "EG((EF((((p0 <= 4) OR (p27 <= 0)) AND ((p0 <= 4) OR (p26 <= 0)))) AND (p15 <= 0)))",
"processed_size": 84,
"rewrites": 85
},
"net":
{
"conflict_clusters": 5,
"singleton_clusters": 0
},
"result":
{
"edges": 1991,
"markings": 576,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 6,
"adisj": 6,
"aneg": 1,
"comp": 20,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "EG((EF((((p3 <= 0) OR (p7 <= 0)) AND ((p4 <= 0) OR (p7 <= 0)) AND ((p5 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p7 <= 0)))) OR (((p3 <= 0) OR (p7 <= 0)) AND ((p4 <= 0) OR (p7 <= 0)) AND ((p5 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p7 <= 0)))))",
"processed_size": 308,
"rewrites": 85
},
"net":
{
"conflict_clusters": 5,
"singleton_clusters": 0
},
"result":
{
"edges": 146,
"markings": 51,
"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": 594
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 11,
"adisj": 2,
"aneg": 1,
"comp": 30,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 30,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "EG((AF((((p0 <= 0) OR (p2 <= 0) OR (p8 <= 0) OR (p19 <= 0)) AND ((p0 <= 0) OR (p5 <= 0) OR (p8 <= 0) OR (p19 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p8 <= 0) OR (p19 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p8 <= 0) OR (p19 <= 0)))) AND (((1 <= p21) AND (1 <= p25)) OR ((1 <= p22) AND (1 <= p25)) OR ((1 <= p3) AND (1 <= p7)) OR ((1 <= p4) AND (1 <= p7)) OR ((1 <= p5) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p7)))))",
"processed_size": 459,
"rewrites": 85
},
"net":
{
"conflict_clusters": 5,
"singleton_clusters": 0
},
"result":
{
"edges": 8714,
"markings": 2646,
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 14,
"adisj": 2,
"aneg": 2,
"comp": 52,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 52,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "E(EG((((p21 <= 0) OR (p25 <= 0)) AND ((p22 <= 0) OR (p25 <= 0)))) R AF((((p4 <= 0) OR (p10 <= 0) OR (p20 <= 0) OR (p24 <= 0)) AND ((p4 <= 0) OR (p10 <= 0) OR (p20 <= 0) OR (p25 <= 0)) AND ((p5 <= 0) OR (p10 <= 0) OR (p20 <= 0) OR (p25 <= 0)) AND ((p4 <= 0) OR (p10 <= 0) OR (p20 <= 0) OR (p23 <= 0)) AND ((p5 <= 0) OR (p10 <= 0) OR (p20 <= 0) OR (p23 <= 0)) AND ((p5 <= 0) OR (p10 <= 0) OR (p20 <= 0) OR (p24 <= 0)) AND ((p2 <= 0) OR (p10 <= 0) OR (p20 <= 0) OR (p23 <= 0)) AND ((p2 <= 0) OR (p10 <= 0) OR (p20 <= 0) OR (p25 <= 0)) AND ((p2 <= 0) OR (p10 <= 0) OR (p20 <= 0) OR (p24 <= 0)) AND ((p3 <= 0) OR (p10 <= 0) OR (p20 <= 0) OR (p24 <= 0)) AND ((p3 <= 0) OR (p10 <= 0) OR (p20 <= 0) OR (p23 <= 0)) AND ((p3 <= 0) OR (p10 <= 0) OR (p20 <= 0) OR (p25 <= 0)))))",
"processed_size": 804,
"rewrites": 86
},
"net":
{
"conflict_clusters": 5,
"singleton_clusters": 0
},
"result":
{
"edges": 753,
"markings": 396,
"produced_by": "CTL model checker",
"value": true
},
"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": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 7,
"adisj": 6,
"aneg": 0,
"comp": 30,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 30,
"taut": 0,
"tconj": 0,
"tdisj": 5,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "AG((EF((((p13 <= 0) OR (p17 <= 0)) AND ((p12 <= 0) OR (p17 <= 0)) AND ((p14 <= 0) OR (p17 <= 0)) AND ((p10 <= 0) OR (p17 <= 0)) AND ((p11 <= 0) OR (p17 <= 0)))) OR (EF((((1 <= p21) AND (1 <= p25)) OR ((1 <= p22) AND (1 <= p25)))) OR (((1 <= p0) AND (1 <= p13) AND (1 <= p16) AND (1 <= p20)) OR (((1 <= p0) AND (1 <= p11) AND (1 <= p16) AND (1 <= p20)) OR (((1 <= p0) AND (1 <= p14) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p16) AND (1 <= p20))))))))",
"processed_size": 484,
"rewrites": 86
},
"net":
{
"conflict_clusters": 5,
"singleton_clusters": 0
},
"result":
{
"edges": 11806,
"markings": 2874,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 13,
"adisj": 3,
"aneg": 0,
"comp": 35,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 35,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "AF((EG((((1 <= p3) AND (1 <= p7)) OR ((1 <= p4) AND (1 <= p7)) OR ((1 <= p5) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p7)))) AND ((((1 <= p0) AND (1 <= p2) AND (1 <= p8) AND (1 <= p19)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p8) AND (1 <= p19)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p8) AND (1 <= p19)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p8) AND (1 <= p19))) AND (AF((((1 <= p21) AND (1 <= p24)) OR ((1 <= p21) AND (1 <= p23)) OR ((1 <= p22) AND (1 <= p24)) OR ((1 <= p22) AND (1 <= p23)))) OR (1 <= p9)))))",
"processed_size": 546,
"rewrites": 86
},
"net":
{
"conflict_clusters": 5,
"singleton_clusters": 0
},
"result":
{
"edges": 5178,
"markings": 2615,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(((1 <= p21) AND (1 <= p25)) OR ((1 <= p22) AND (1 <= p25)))",
"processed_size": 60,
"rewrites": 84
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3565
},
"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": "(p9 <= 0)",
"processed_size": 9,
"rewrites": 86
},
"result":
{
"edges": 50,
"markings": 51,
"produced_by": "state space /EGEF",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation_of_reachability",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3565
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 0,
"aconj": 21,
"adisj": 11,
"aneg": 11,
"comp": 106,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 106,
"taut": 0,
"tconj": 0,
"tdisj": 10,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 18,
"visible_transitions": 0
},
"processed": "G ((G ((((p3 <= 0) OR (p7 <= 0)) AND ((p4 <= 0) OR (p7 <= 0)) AND ((p5 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p7 <= 0)))) OR (((1 <= p1) AND (1 <= p11) AND (1 <= p19) AND (1 <= p24)) OR (((1 <= p1) AND (1 <= p12) AND (1 <= p19) AND (1 <= p25)) OR (((1 <= p1) AND (1 <= p12) AND (1 <= p19) AND (1 <= p24)) OR (((1 <= p1) AND (1 <= p13) AND (1 <= p19) AND (1 <= p24)) OR (((1 <= p1) AND (1 <= p13) AND (1 <= p19) AND (1 <= p25)) OR (((1 <= p1) AND (1 <= p14) AND (1 <= p19) AND (1 <= p25)) OR (((1 <= p1) AND (1 <= p14) AND (1 <= p19) AND (1 <= p24)) OR (((1 <= p1) AND (1 <= p11) AND (1 <= p19) AND (1 <= p25)) OR ((((p0 <= 0) OR (p2 <= 0) OR (p8 <= 0) OR (p19 <= 0)) AND ((p0 <= 0) OR (p5 <= 0) OR (p8 <= 0) OR (p19 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p8 <= 0) OR (p19 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p8 <= 0) OR (p19 <= 0))) OR (((p4 <= 0) OR (p10 <= 0) OR (p20 <= 0) OR (p24 <= 0)) AND ((p4 <= 0) OR (p10 <= 0) OR (p20 <= 0) OR (p25 <= 0)) AND ((p5 <= 0) OR (p10 <= 0) OR (p20 <= 0) OR (p25 <= 0)) AND ((p4 <= 0) OR (p10 <= 0) OR (p20 <= 0) OR (p23 <= 0)) AND ((p5 <= 0) OR (p10 <= 0) OR (p20 <= 0) OR (p23 <= 0)) AND ((p5 <= 0) OR (p10 <= 0) OR (p20 <= 0) OR (p24 <= 0)) AND ((p2 <= 0) OR (p10 <= 0) OR (p20 <= 0) OR (p23 <= 0)) AND ((p2 <= 0) OR (p10 <= 0) OR (p20 <= 0) OR (p25 <= 0)) AND ((p2 <= 0) OR (p10 <= 0) OR (p20 <= 0) OR (p24 <= 0)) AND ((p3 <= 0) OR (p10 <= 0) OR (p20 <= 0) OR (p24 <= 0)) AND ((p3 <= 0) OR (p10 <= 0) OR (p20 <= 0) OR (p23 <= 0)) AND ((p3 <= 0) OR (p10 <= 0) OR (p20 <= 0) OR (p25 <= 0))))))))))))))",
"processed_size": 1625,
"rewrites": 111
},
"result":
{
"edges": 7164,
"markings": 2874,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "existential single path",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 90628,
"runtime": 5.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(F((E(G(**)) AND (** AND (A(F(**)) OR **))))) : A(F(E(G(*)))) : A(G((E(F(**)) OR (E(F(**)) OR (** OR (** OR (** OR **))))))) : (E(X(E(G(**)))) AND A(X((A(X(**)) OR **)))) : A(F(**)) : (E(X(E(F(**)))) OR E(X(A((** U **))))) : (E(G(E(F(**)))) OR (** OR **)) : E(G((E(F(*)) AND **))) : E(F((E(F(**)) AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND **)))))))))))) : E(G((A(F(*)) AND **))) : E((E(G(*)) R A(F(*)))) : A(F(**)) : A(G(E(F(*)))) : E(G((E(F(*)) OR **)))"
},
"net":
{
"arcs": 326,
"conflict_clusters": 5,
"places": 28,
"places_significant": 21,
"singleton_clusters": 0,
"transitions": 52
},
"result":
{
"preliminary_value": "no yes yes no no no yes no no no yes no yes yes ",
"value": "no yes yes no no no yes no no no yes no yes yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 80/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 896
lola: finding significant places
lola: 28 places, 52 transitions, 21 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLFireability.xml
lola: A (F (((E (G ((((1 <= p3) AND (1 <= p7)) OR ((1 <= p4) AND (1 <= p7)) OR ((1 <= p5) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p7))))) AND (((1 <= p0) AND (1 <= p2) AND (1 <= p8) AND (1 <= p19)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p8) AND (1 <= p19)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p8) AND (1 <= p19)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p8) AND (1 <= p19)))) AND (A (F ((((1 <= p21) AND (1 <= p24)) OR ((1 <= p21) AND (1 <= p23)) OR ((1 <= p22) AND (1 <= p24)) OR ((1 <= p22) AND (1 <= p23))))) OR (1 <= p9))))) : A (F (NOT(A (F ((1 <= p9)))))) : A (G ((((((E (F ((((p13 <= 0) OR (p17 <= 0)) AND ((p12 <= 0) OR (p17 <= 0)) AND ((p14 <= 0) OR (p17 <= 0)) AND ((p10 <= 0) OR (p17 <= 0)) AND ((p11 <= 0) OR (p17 <= 0))))) OR E (F ((((1 <= p21) AND (1 <= p25)) OR ((1 <= p22) AND (1 <= p25)))))) OR ((1 <= p0) AND (1 <= p13) AND (1 <= p16) AND (1 <= p20))) OR ((1 <= p0) AND (1 <= p11) AND (1 <= p16) AND (1 <= p20))) OR ((1 <= p0) AND (1 <= p14) AND (1 <= p16) AND (1 <= p20))) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p16) AND (1 <= p20))))) : (E (X (E (G ((((1 <= p3) AND (1 <= p7)) OR ((1 <= p4) AND (1 <= p7)) OR ((1 <= p5) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p7))))))) AND A (X ((A (X ((((1 <= p21) AND (1 <= p25)) OR ((1 <= p22) AND (1 <= p25))))) OR (((p1 <= 0) OR (p11 <= 0) OR (p19 <= 0) OR (p23 <= 0)) AND ((p1 <= 0) OR (p11 <= 0) OR (p19 <= 0) OR (p24 <= 0)) AND ((p1 <= 0) OR (p12 <= 0) OR (p19 <= 0) OR (p25 <= 0)) AND ((p1 <= 0) OR (p12 <= 0) OR (p19 <= 0) OR (p24 <= 0)) AND ((p1 <= 0) OR (p13 <= 0) OR (p19 <= 0) OR (p24 <= 0)) AND ((p1 <= 0) OR (p13 <= 0) OR (p19 <= 0) OR (p23 <= 0)) AND ((p1 <= 0) OR (p13 <= 0) OR (p19 <= 0) OR (p25 <= 0)) AND ((p1 <= 0) OR (p12 <= 0) OR (p19 <= 0) OR (p23 <= 0)) AND ((p1 <= 0) OR (p14 <= 0) OR (p19 <= 0) OR (p25 <= 0)) AND ((p1 <= 0) OR (p14 <= 0) OR (p19 <= 0) OR (p24 <= 0)) AND ((p1 <= 0) OR (p11 <= 0) OR (p19 <= 0) OR (p25 <= 0)) AND ((p1 <= 0) OR (p14 <= 0) OR (p19 <= 0) OR (p23 <= 0))))))) : A (F ((((1 <= p21) AND (1 <= p25)) OR ((1 <= p22) AND (1 <= p25))))) : E (X ((E (F (((1 <= p15) AND (1 <= p9)))) OR A (((((1 <= p3) AND (1 <= p7)) OR ((1 <= p4) AND (1 <= p7)) OR ((1 <= p5) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p7))) U (1 <= p9)))))) : ((E (G (E (F ((p9 <= 0))))) OR ((1 <= p21) AND (1 <= p25))) OR ((1 <= p22) AND (1 <= p25))) : E (G ((NOT(A (G ((((5 <= p0) AND (1 <= p27)) OR ((5 <= p0) AND (1 <= p26)))))) AND (p15 <= 0)))) : E (F (((((((((((E (F ((((1 <= p3) AND (1 <= p7)) OR ((1 <= p4) AND (1 <= p7)) OR ((1 <= p5) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p7))))) AND ((p1 <= 0) OR (p11 <= 0) OR (p19 <= 0) OR (p24 <= 0))) AND ((p1 <= 0) OR (p12 <= 0) OR (p19 <= 0) OR (p25 <= 0))) AND ((p1 <= 0) OR (p12 <= 0) OR (p19 <= 0) OR (p24 <= 0))) AND ((p1 <= 0) OR (p13 <= 0) OR (p19 <= 0) OR (p24 <= 0))) AND ((p1 <= 0) OR (p13 <= 0) OR (p19 <= 0) OR (p25 <= 0))) AND ((p1 <= 0) OR (p14 <= 0) OR (p19 <= 0) OR (p25 <= 0))) AND ((p1 <= 0) OR (p14 <= 0) OR (p19 <= 0) OR (p24 <= 0))) AND ((p1 <= 0) OR (p11 <= 0) OR (p19 <= 0) OR (p25 <= 0))) AND (((1 <= p0) AND (1 <= p2) AND (1 <= p8) AND (1 <= p19)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p8) AND (1 <= p19)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p8) AND (1 <= p19)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p8) AND (1 <= p19)))) AND (((1 <= p4) AND (1 <= p10) AND (1 <= p20) AND (1 <= p24)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p20) AND (1 <= p25)) OR ((1 <= p5) AND (1 <= p10) AND (1 <= p20) AND (1 <= p25)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p20) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p10) AND (1 <= p20) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p10) AND (1 <= p20) AND (1 <= p24)) OR ((1 <= p2) AND (1 <= p10) AND (1 <= p20) AND (1 <= p23)) OR ((1 <= p2) AND (1 <= p10) AND (1 <= p20) AND (1 <= p25)) OR ((1 <= p2) AND (1 <= p10) AND (1 <= p20) AND (1 <= p24)) OR ((1 <= p3) AND (1 <= p10) AND (1 <= p20) AND (1 <= p24)) OR ((1 <= p3) AND (1 <= p10) AND (1 <= p20) AND (1 <= p23)) OR ((1 <= p3) AND (1 <= p10) AND (1 <= p20) AND (1 <= p25)))))) : E (G ((NOT(E (G ((((1 <= p0) AND (1 <= p2) AND (1 <= p8) AND (1 <= p19)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p8) AND (1 <= p19)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p8) AND (1 <= p19)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p8) AND (1 <= p19)))))) AND (((1 <= p21) AND (1 <= p25)) OR ((1 <= p22) AND (1 <= p25)) OR ((1 <= p3) AND (1 <= p7)) OR ((1 <= p4) AND (1 <= p7)) OR ((1 <= p5) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p7)))))) : NOT(A ((A (F ((((1 <= p21) AND (1 <= p25)) OR ((1 <= p22) AND (1 <= p25))))) U E (G ((((1 <= p4) AND (1 <= p10) AND (1 <= p20) AND (1 <= p24)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p20) AND (1 <= p25)) OR ((1 <= p5) AND (1 <= p10) AND (1 <= p20) AND (1 <= p25)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p20) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p10) AND (1 <= p20) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p10) AND (1 <= p20) AND (1 <= p24)) OR ((1 <= p2) AND (1 <= p10) AND (1 <= p20) AND (1 <= p23)) OR ((1 <= p2) AND (1 <= p10) AND (1 <= p20) AND (1 <= p25)) OR ((1 <= p2) AND (1 <= p10) AND (1 <= p20) AND (1 <= p24)) OR ((1 <= p3) AND (1 <= p10) AND (1 <= p20) AND (1 <= p24)) OR ((1 <= p3) AND (1 <= p10) AND (1 <= p20) AND (1 <= p23)) OR ((1 <= p3) AND (1 <= p10) AND (1 <= p20) AND (1 <= p25)))))))) : A (F ((((1 <= p4) AND (1 <= p10) AND (1 <= p20) AND (1 <= p24)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p20) AND (1 <= p25)) OR ((1 <= p5) AND (1 <= p10) AND (1 <= p20) AND (1 <= p25)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p20) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p10) AND (1 <= p20) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p10) AND (1 <= p20) AND (1 <= p24)) OR ((1 <= p2) AND (1 <= p10) AND (1 <= p20) AND (1 <= p23)) OR ((1 <= p2) AND (1 <= p10) AND (1 <= p20) AND (1 <= p25)) OR ((1 <= p2) AND (1 <= p10) AND (1 <= p20) AND (1 <= p24)) OR ((1 <= p3) AND (1 <= p10) AND (1 <= p20) AND (1 <= p24)) OR ((1 <= p3) AND (1 <= p10) AND (1 <= p20) AND (1 <= p23)) OR ((1 <= p3) AND (1 <= p10) AND (1 <= p20) AND (1 <= p25))))) : NOT(E (F (A (G ((((1 <= p3) AND (1 <= p7)) OR ((1 <= p4) AND (1 <= p7)) OR ((1 <= p5) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p7)) OR ((5 <= p0) AND (1 <= p27)) OR ((5 <= p0) AND (1 <= p26)))))))) : E (G ((NOT(A (G ((((1 <= p3) AND (1 <= p7)) OR ((1 <= p4) AND (1 <= p7)) OR ((1 <= p5) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p7)))))) OR (((p3 <= 0) OR (p7 <= 0)) AND ((p4 <= 0) OR (p7 <= 0)) AND ((p5 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p7 <= 0))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:554
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k: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:338
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: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:332
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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (E (G ((((1 <= p3) AND (1 <= p7)) OR ((1 <= p4) AND (1 <= p7)) OR ((1 <= p5) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p7))))))) AND A (X ((A (X ((((1 <= p21) AND (1 <= p25)) OR ((1 <= p22) AND (1 <= p25))))) OR (((p1 <= 0) OR (p11 <= 0) OR (p19 <= 0) OR (p23 <= 0)) AND ((p1 <= 0) OR (p11 <= 0) OR (p19 <= 0) OR (p24 <= 0)) AND ((p1 <= 0) OR (p12 <= 0) OR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (G ((((1 <= p3) AND (1 <= p7)) OR ((1 <= p4) AND (1 <= p7)) OR ((1 <= p5) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p7)))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: rewrite Frontend/Parser/formula_rewrite.k:715
lola: processed formula: (((1 <= p3) AND (1 <= p7)) OR ((1 <= p4) AND (1 <= p7)) OR ((1 <= p5) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p7)))
lola: processed formula length: 147
lola: 85 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p3) AND (1 <= p7)) OR ((1 <= p4) AND (1 <= p7)) OR ((1 <= p5) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p7)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 10 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEG
lola: The predicate is not possibly preserved from any successor.
lola: 1080 markings, 1695 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (E (F (((1 <= p15) AND (1 <= p9)))))) OR E (X (A (((((1 <= p3) AND (1 <= p7)) OR ((1 <= p4) AND (1 <= p7)) OR ((1 <= p5) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p7))) U (1 <= p9))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F (((1 <= p15) AND (1 <= p9))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:623
lola: rewrite Frontend/Parser/formula_rewrite.k:714
lola: processed formula: ((1 <= p15) AND (1 <= p9))
lola: processed formula length: 26
lola: 85 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p15) AND (1 <= p9))
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-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEF
lola: The predicate is unreachable from any successor.
lola: 2462 markings, 4624 edges
lola: ========================================
lola: subprocess 2 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (((((1 <= p3) AND (1 <= p7)) OR ((1 <= p4) AND (1 <= p7)) OR ((1 <= p5) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p7))) U (1 <= p9)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(A((((1 <= p3) AND (1 <= p7)) OR ((1 <= p4) AND (1 <= p7)) OR ((1 <= p5) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p7))) U (1 <= p9)))
lola: processed formula length: 166
lola: 85 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 51 markings, 51 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p21) AND (1 <= p25)) OR ((1 <= p22) AND (1 <= p25)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p21 <= 0) OR (p25 <= 0)) AND ((p22 <= 0) OR (p25 <= 0)))
lola: processed formula length: 61
lola: 86 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p21) AND (1 <= p25)) OR ((1 <= p22) AND (1 <= p25)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 280 markings, 486 edges
lola: ========================================
lola: subprocess 3 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p4) AND (1 <= p10) AND (1 <= p20) AND (1 <= p24)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p20) AND (1 <= p25)) OR ((1 <= p5) AND (1 <= p10) AND (1 <= p20) AND (1 <= p25)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p20) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p10) AND (1 <= p20) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p10) AND (1 <= p20) AND (1 <= p24)) OR ((1 <= p2) AND (1 <= p10) A... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p4 <= 0) OR (p10 <= 0) OR (p20 <= 0) OR (p24 <= 0)) AND ((p4 <= 0) OR (p10 <= 0) OR (p20 <= 0) OR (p25 <= 0)) AND ((p5 <= 0) OR (p10 <= 0) OR (p20 <= 0) OR (p25 <= 0)) AND ((p4 <= 0) OR (p10 <= 0) OR (p20 <= 0) OR (p23 <= 0)) AND ((p5 <= 0) OR (p10 <= 0) OR (p20 <= 0) OR (p23 <= 0)) AND ((p5 <= 0) OR (p10 <= 0) OR (p20 <= 0) OR (p24 <= 0)) AND ((p2 <= 0) OR (p10 <= 0) OR (p2... (shortened)
lola: processed formula length: 729
lola: 86 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p4) AND (1 <= p10) AND (1 <= p20) AND (1 <= p24)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p20) AND (1 <= p25)) OR ((1 <= p5) AND (1 <= p10) AND (1 <= p20) AND (1 <= p25)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p20) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p10) AND (1 <= p20) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p10) AND (1 <= p20) AND (1 <= p24)) OR ((1 <= p2) AND (1 <= p10) AND (1 <= p20) AND (1 <= p23)) OR ((1 <= p2) AND (1 <= p10) AND (1 <= p20) AND (1 <= p25)) OR ((1 <= p2) AND (1 <= p10) AND (1 <= p20) AND (1 <= p24)) OR ((1 <= p3) AND (1 <= p10) AND (1 <= p20) AND (1 <= p24)) OR ((1 <= p3) AND (1 <= p10) AND (1 <= p20) AND (1 <= p23)) OR ((1 <= p3) AND (1 <= p10) AND (1 <= p20) AND (1 <= p25)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 48 literals and 12 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 180 markings, 237 edges
lola: state equation: write sara problem file to CTLFireability-3-0.sara
lola: ========================================
lola: subprocess 4 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((((p3 <= 0) OR (p7 <= 0)) AND ((p4 <= 0) OR (p7 <= 0)) AND ((p5 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p7 <= 0)) AND ((p0 <= 4) OR (p27 <= 0)) AND ((p0 <= 4) OR (p26 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: (((p3 <= 0) OR (p7 <= 0)) AND ((p4 <= 0) OR (p7 <= 0)) AND ((p5 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p7 <= 0)) AND ((p0 <= 4) OR (p27 <= 0)) AND ((p0 <= 4) OR (p26 <= 0)))
lola: processed formula length: 209
lola: 86 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
lola: using tscc preserving stubborn set method (--stubborn)
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:788
lola: state equation task get result rewrite finished id 0
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 0
lola: state equation task get result unparse finished++ id 1
lola: formula 0: (((1 <= p3) AND (1 <= p7)) OR ((1 <= p4) AND (1 <= p7)) OR ((1 <= p5) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p7)) OR ((5 <= p0) AND (1 <= p27)) OR ((5 <= p0) AND (1 <= p26)))
lola: formula 1: (((p3 <= 0) OR (p7 <= 0)) AND ((p4 <= 0) OR (p7 <= 0)) AND ((p5 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p7 <= 0)) AND ((p0 <= 4) OR (p27 <= 0)) AND ((p0 <= 4) OR (p26 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 14 literals and 7 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: tscc_search
lola: The predicate is live.
lola: 454 markings, 897 edges
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 896 literals and 128 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-4-0.sara
lola: ========================================
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-4-0.sara.
lola: subprocess 5 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (G ((p9 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(EG((p9 <= 0)))
lola: processed formula length: 17
lola: 85 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).
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 2793 markings, 14809 edges
lola: ========================================
lola: subprocess 6 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((E (F ((((p0 <= 4) OR (p27 <= 0)) AND ((p0 <= 4) OR (p26 <= 0))))) AND (p15 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((EF((((p0 <= 4) OR (p27 <= 0)) AND ((p0 <= 4) OR (p26 <= 0)))) AND (p15 <= 0)))
lola: processed formula length: 84
lola: 85 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: 576 markings, 1991 edges
lola: ========================================
lola: subprocess 7 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((E (F ((((p3 <= 0) OR (p7 <= 0)) AND ((p4 <= 0) OR (p7 <= 0)) AND ((p5 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p7 <= 0))))) OR (((p3 <= 0) OR (p7 <= 0)) AND ((p4 <= 0) OR (p7 <= 0)) AND ((p5 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p7 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((EF((((p3 <= 0) OR (p7 <= 0)) AND ((p4 <= 0) OR (p7 <= 0)) AND ((p5 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p7 <= 0)))) OR (((p3 <= 0) OR (p7 <= 0)) AND ((p4 <= 0) OR (p7 <= 0)) AND ((p5 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p7 <= 0)))))
lola: processed formula length: 308
lola: 85 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: 51 markings, 146 edges
lola: ========================================
sara: warning, failure of lp_solve (at job 29)
lola: subprocess 8 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((A (F ((((p0 <= 0) OR (p2 <= 0) OR (p8 <= 0) OR (p19 <= 0)) AND ((p0 <= 0) OR (p5 <= 0) OR (p8 <= 0) OR (p19 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p8 <= 0) OR (p19 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p8 <= 0) OR (p19 <= 0))))) AND (((1 <= p21) AND (1 <= p25)) OR ((1 <= p22) AND (1 <= p25)) OR ((1 <= p3) AND (1 <= p7)) OR ((1 <= p4) AND (1 <= p7)) OR ((1 <= p5) AND (1 <= p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((AF((((p0 <= 0) OR (p2 <= 0) OR (p8 <= 0) OR (p19 <= 0)) AND ((p0 <= 0) OR (p5 <= 0) OR (p8 <= 0) OR (p19 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p8 <= 0) OR (p19 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p8 <= 0) OR (p19 <= 0)))) AND (((1 <= p21) AND (1 <= p25)) OR ((1 <= p22) AND (1 <= p25)) OR ((1 <= p3) AND (1 <= p7)) OR ((1 <= p4) AND (1 <= p7)) OR ((1 <= p5) AND (1 <= p7)) OR ... (shortened)
lola: processed formula length: 459
lola: 85 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: 2646 markings, 8714 edges
lola: ========================================
lola: subprocess 9 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (G ((((p21 <= 0) OR (p25 <= 0)) AND ((p22 <= 0) OR (p25 <= 0))))) R A (F ((((p4 <= 0) OR (p10 <= 0) OR (p20 <= 0) OR (p24 <= 0)) AND ((p4 <= 0) OR (p10 <= 0) OR (p20 <= 0) OR (p25 <= 0)) AND ((p5 <= 0) OR (p10 <= 0) OR (p20 <= 0) OR (p25 <= 0)) AND ((p4 <= 0) OR (p10 <= 0) OR (p20 <= 0) OR (p23 <= 0)) AND ((p5 <= 0) OR (p10 <= 0) OR (p20 <= 0) OR (p23 <= 0)) AND ((p5 <= 0) O... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:810
lola: processed formula: E(EG((((p21 <= 0) OR (p25 <= 0)) AND ((p22 <= 0) OR (p25 <= 0)))) R AF((((p4 <= 0) OR (p10 <= 0) OR (p20 <= 0) OR (p24 <= 0)) AND ((p4 <= 0) OR (p10 <= 0) OR (p20 <= 0) OR (p25 <= 0)) AND ((p5 <= 0) OR (p10 <= 0) OR (p20 <= 0) OR (p25 <= 0)) AND ((p4 <= 0) OR (p10 <= 0) OR (p20 <= 0) OR (p23 <= 0)) AND ((p5 <= 0) OR (p10 <= 0) OR (p20 <= 0) OR (p23 <= 0)) AND ((p5 <= 0) OR (p10 <... (shortened)
lola: processed formula length: 804
lola: 86 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 396 markings, 753 edges
lola: ========================================
lola: subprocess 10 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((E (F ((((p13 <= 0) OR (p17 <= 0)) AND ((p12 <= 0) OR (p17 <= 0)) AND ((p14 <= 0) OR (p17 <= 0)) AND ((p10 <= 0) OR (p17 <= 0)) AND ((p11 <= 0) OR (p17 <= 0))))) OR (E (F ((((1 <= p21) AND (1 <= p25)) OR ((1 <= p22) AND (1 <= p25))))) OR (((1 <= p0) AND (1 <= p13) AND (1 <= p16) AND (1 <= p20)) OR (((1 <= p0) AND (1 <= p11) AND (1 <= p16) AND (1 <= p20)) OR (((1 <= p0) AND (1 <= p14) A... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG((EF((((p13 <= 0) OR (p17 <= 0)) AND ((p12 <= 0) OR (p17 <= 0)) AND ((p14 <= 0) OR (p17 <= 0)) AND ((p10 <= 0) OR (p17 <= 0)) AND ((p11 <= 0) OR (p17 <= 0)))) OR (EF((((1 <= p21) AND (1 <= p25)) OR ((1 <= p22) AND (1 <= p25)))) OR (((1 <= p0) AND (1 <= p13) AND (1 <= p16) AND (1 <= p20)) OR (((1 <= p0) AND (1 <= p11) AND (1 <= p16) AND (1 <= p20)) OR (((1 <= p0) AND (1 <= p14) AND (1 <= p1... (shortened)
lola: processed formula length: 484
lola: 86 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 2874 markings, 11806 edges
lola: ========================================
lola: subprocess 11 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((E (G ((((1 <= p3) AND (1 <= p7)) OR ((1 <= p4) AND (1 <= p7)) OR ((1 <= p5) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p7))))) AND ((((1 <= p0) AND (1 <= p2) AND (1 <= p8) AND (1 <= p19)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p8) AND (1 <= p19)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p8) AND (1 <= p19)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p8) AND (1 <= p19))... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((EG((((1 <= p3) AND (1 <= p7)) OR ((1 <= p4) AND (1 <= p7)) OR ((1 <= p5) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p7)))) AND ((((1 <= p0) AND (1 <= p2) AND (1 <= p8) AND (1 <= p19)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p8) AND (1 <= p19)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p8) AND (1 <= p19)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p8) AND (1 <= p19))) AND (... (shortened)
lola: processed formula length: 546
lola: 86 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: 2615 markings, 5178 edges
lola: ========================================
lola: subprocess 12 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (E (F ((p9 <= 0))))) OR (((1 <= p21) AND (1 <= p25)) OR ((1 <= p22) AND (1 <= p25))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p21) AND (1 <= p25)) OR ((1 <= p22) AND (1 <= p25)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: processed formula: (((1 <= p21) AND (1 <= p25)) OR ((1 <= p22) AND (1 <= p25)))
lola: processed formula length: 60
lola: 84 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 13 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((p9 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:593
lola: rewrite Frontend/Parser/formula_rewrite.k:628
lola: rewrite Frontend/Parser/formula_rewrite.k:731
lola: processed formula: (p9 <= 0)
lola: processed formula length: 9
lola: 86 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
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: (p9 <= 0)
lola: state equation task get result unparse finished id 1
lola: state equation task get result unparse finished++ id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: formula 0: (1 <= p9)
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-13-1.sara
lola: state equation: write sara problem file to CTLFireability-13-0.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
lola: Reachability of the predicate is possibly preserved.
lola: 51 markings, 50 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
sara: try reading problem file CTLFireability-13-1.sara.
lola: ...considering subproblem: E (F ((E (F ((((1 <= p3) AND (1 <= p7)) OR ((1 <= p4) AND (1 <= p7)) OR ((1 <= p5) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p7))))) AND (((p1 <= 0) OR (p11 <= 0) OR (p19 <= 0) OR (p24 <= 0)) AND (((p1 <= 0) OR (p12 <= 0) OR (p19 <= 0) OR (p25 <= 0)) AND (((p1 <= 0) OR (p12 <= 0) OR (p19 <= 0) OR (p24 <= 0)) AND (((p1 <= 0) OR (p13 <= 0) OR (p19 <= 0) OR (... (shortened)
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:661
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:666
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:666
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:666
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:666
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:666
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:666
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:666
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:666
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:666
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G ((((p3 <= 0) OR (p7 <= 0)) AND ((p4 <= 0) OR (p7 <= 0)) AND ((p5 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p7 <= 0)))) OR (((1 <= p1) AND (1 <= p11) AND (1 <= p19) AND (1 <= p24)) OR (((1 <= p1) AND (1 <= p12) AND (1 <= p19) AND (1 <= p25)) OR (((1 <= p1) AND (1 <= p12) AND (1 <= p19) AND (1 <= p24)) OR (((1 <= p1) AND (1 <= p13) AND (1 <= p19) AND (1 <= p24)) ... (shortened)
lola: processed formula length: 1625
lola: 111 rewrites
lola: closed formula file CTLFireability.xml
sara: place or transition ordering is non-deterministic
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola:
using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The existential single path CTL formula does not hold.
lola: 2874 markings, 7164 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes no no no yes no no no yes no yes yes
lola:
preliminary result: no yes yes no no no yes no no no yes no yes yes
lola: memory consumption: 90628 KB
lola: time consumption: 5 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
rslt: finished
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427356 kB
MemFree: 5860332 kB
After kill :
MemTotal: 16427356 kB
MemFree: 5860332 kB

--------------------
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="BridgeAndVehicles-COL-V04P05N02"
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 BridgeAndVehicles-COL-V04P05N02, 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 r182-oct2-158987913400132"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V04P05N02.tgz
mv BridgeAndVehicles-COL-V04P05N02 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 ;