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.r184-oct2-158987928900652.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 LamportFastMutEx-PT-3, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-oct2-158987928900652
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 368K
-rw-r--r-- 1 mcc users 5.0K Apr 30 13:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 30 13:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 30 13:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 28K Apr 30 13:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 30 13:04 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Apr 30 13:04 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 7.9K Apr 30 13:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 30 13:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 30 13:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 30 13:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 30 13:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 35K Apr 30 13:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 30 13:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 32K Apr 30 13:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 30 13:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.1K Apr 30 13:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 30 13:04 equiv_col
-rw-r--r-- 1 mcc users 2 Apr 30 13:04 instance
-rw-r--r-- 1 mcc users 6 Apr 30 13:04 iscolored
-rw-r--r-- 1 mcc users 75K Apr 30 13:04 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 LamportFastMutEx-PT-3-CTLFireability-00
FORMULA_NAME LamportFastMutEx-PT-3-CTLFireability-01
FORMULA_NAME LamportFastMutEx-PT-3-CTLFireability-02
FORMULA_NAME LamportFastMutEx-PT-3-CTLFireability-03
FORMULA_NAME LamportFastMutEx-PT-3-CTLFireability-04
FORMULA_NAME LamportFastMutEx-PT-3-CTLFireability-05
FORMULA_NAME LamportFastMutEx-PT-3-CTLFireability-06
FORMULA_NAME LamportFastMutEx-PT-3-CTLFireability-07
FORMULA_NAME LamportFastMutEx-PT-3-CTLFireability-08
FORMULA_NAME LamportFastMutEx-PT-3-CTLFireability-09
FORMULA_NAME LamportFastMutEx-PT-3-CTLFireability-10
FORMULA_NAME LamportFastMutEx-PT-3-CTLFireability-11
FORMULA_NAME LamportFastMutEx-PT-3-CTLFireability-12
FORMULA_NAME LamportFastMutEx-PT-3-CTLFireability-13
FORMULA_NAME LamportFastMutEx-PT-3-CTLFireability-14
FORMULA_NAME LamportFastMutEx-PT-3-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591218132992

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 21:02:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 21:02:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 21:02:15] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2020-06-03 21:02:15] [INFO ] Transformed 100 places.
[2020-06-03 21:02:15] [INFO ] Transformed 156 transitions.
[2020-06-03 21:02:15] [INFO ] Parsed PT model containing 100 places and 156 transitions in 118 ms.
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 42 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 63 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 182 ms. (steps per millisecond=549 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1]
[2020-06-03 21:02:15] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
// Phase 1: matrix 96 rows 71 cols
[2020-06-03 21:02:15] [INFO ] Computed 17 place invariants in 6 ms
[2020-06-03 21:02:15] [INFO ] [Real]Absence check using 17 positive place invariants in 21 ms returned sat
[2020-06-03 21:02:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:02:15] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2020-06-03 21:02:15] [INFO ] State equation strengthened by 33 read => feed constraints.
[2020-06-03 21:02:16] [INFO ] [Real]Added 33 Read/Feed constraints in 96 ms returned sat
[2020-06-03 21:02:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:02:16] [INFO ] [Nat]Absence check using 17 positive place invariants in 40 ms returned sat
[2020-06-03 21:02:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:02:16] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2020-06-03 21:02:16] [INFO ] [Nat]Added 33 Read/Feed constraints in 26 ms returned sat
[2020-06-03 21:02:16] [INFO ] Deduced a trap composed of 15 places in 106 ms
[2020-06-03 21:02:16] [INFO ] Deduced a trap composed of 9 places in 52 ms
[2020-06-03 21:02:16] [INFO ] Deduced a trap composed of 9 places in 57 ms
[2020-06-03 21:02:16] [INFO ] Deduced a trap composed of 9 places in 49 ms
[2020-06-03 21:02:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 349 ms
[2020-06-03 21:02:16] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2020-06-03 21:02:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:02:16] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2020-06-03 21:02:16] [INFO ] [Real]Added 33 Read/Feed constraints in 12 ms returned sat
[2020-06-03 21:02:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:02:16] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2020-06-03 21:02:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:02:16] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2020-06-03 21:02:16] [INFO ] [Nat]Added 33 Read/Feed constraints in 9 ms returned sat
[2020-06-03 21:02:16] [INFO ] Deduced a trap composed of 18 places in 26 ms
[2020-06-03 21:02:16] [INFO ] Deduced a trap composed of 8 places in 11 ms
[2020-06-03 21:02:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 45 ms
[2020-06-03 21:02:16] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2020-06-03 21:02:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:02:16] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2020-06-03 21:02:16] [INFO ] [Real]Added 33 Read/Feed constraints in 3 ms returned sat
[2020-06-03 21:02:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:02:16] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2020-06-03 21:02:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:02:16] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2020-06-03 21:02:16] [INFO ] [Nat]Added 33 Read/Feed constraints in 4 ms returned sat
[2020-06-03 21:02:16] [INFO ] Deduced a trap composed of 13 places in 32 ms
[2020-06-03 21:02:16] [INFO ] Deduced a trap composed of 11 places in 60 ms
[2020-06-03 21:02:17] [INFO ] Deduced a trap composed of 11 places in 50 ms
[2020-06-03 21:02:17] [INFO ] Deduced a trap composed of 10 places in 25 ms
[2020-06-03 21:02:17] [INFO ] Deduced a trap composed of 9 places in 35 ms
[2020-06-03 21:02:17] [INFO ] Deduced a trap composed of 12 places in 22 ms
[2020-06-03 21:02:17] [INFO ] Deduced a trap composed of 8 places in 22 ms
[2020-06-03 21:02:17] [INFO ] Deduced a trap composed of 9 places in 236 ms
[2020-06-03 21:02:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 531 ms
[2020-06-03 21:02:17] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2020-06-03 21:02:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:02:17] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2020-06-03 21:02:17] [INFO ] [Real]Added 33 Read/Feed constraints in 8 ms returned sat
[2020-06-03 21:02:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:02:17] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2020-06-03 21:02:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:02:17] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2020-06-03 21:02:17] [INFO ] [Nat]Added 33 Read/Feed constraints in 3 ms returned sat
[2020-06-03 21:02:17] [INFO ] Deduced a trap composed of 18 places in 29 ms
[2020-06-03 21:02:17] [INFO ] Deduced a trap composed of 10 places in 24 ms
[2020-06-03 21:02:17] [INFO ] Deduced a trap composed of 11 places in 19 ms
[2020-06-03 21:02:17] [INFO ] Deduced a trap composed of 12 places in 32 ms
[2020-06-03 21:02:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 119 ms
[2020-06-03 21:02:17] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2020-06-03 21:02:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:02:17] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2020-06-03 21:02:17] [INFO ] [Real]Added 33 Read/Feed constraints in 3 ms returned sat
[2020-06-03 21:02:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:02:17] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2020-06-03 21:02:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:02:17] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2020-06-03 21:02:17] [INFO ] [Nat]Added 33 Read/Feed constraints in 3 ms returned sat
[2020-06-03 21:02:17] [INFO ] Deduced a trap composed of 8 places in 48 ms
[2020-06-03 21:02:17] [INFO ] Deduced a trap composed of 9 places in 19 ms
[2020-06-03 21:02:17] [INFO ] Deduced a trap composed of 9 places in 14 ms
[2020-06-03 21:02:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 136 ms
Successfully simplified 5 atomic propositions for a total of 5 simplifications.
[2020-06-03 21:02:18] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-03 21:02:18] [INFO ] Flatten gal took : 95 ms
[2020-06-03 21:02:18] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-03 21:02:18] [INFO ] Flatten gal took : 10 ms
FORMULA LamportFastMutEx-PT-3-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-3-CTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-3-CTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-3-CTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-3-CTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 21:02:18] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 7 ms.
[2020-06-03 21:02:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ LamportFastMutEx-PT-3 @ 3570 seconds

FORMULA LamportFastMutEx-PT-3-CTLFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-PT-3-CTLFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA LamportFastMutEx-PT-3-CTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-PT-3-CTLFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

FORMULA LamportFastMutEx-PT-3-CTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-PT-3-CTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA LamportFastMutEx-PT-3-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3566
rslt: Output for CTLFireability @ LamportFastMutEx-PT-3

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 3,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 25,
"adisj": 3,
"aneg": 0,
"comp": 57,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 57,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 30,
"visible_transitions": 0
},
"processed": "EF((EG(((((1 <= p13) AND (1 <= p42) AND (1 <= p48)) OR ((1 <= p15) AND (1 <= p40) AND (1 <= p47)) OR ((1 <= p11) AND (1 <= p44) AND (1 <= p49)) OR ((1 <= p15) AND (1 <= p43) AND (1 <= p48)) OR ((1 <= p15) AND (1 <= p46) AND (1 <= p49)) OR ((1 <= p13) AND (1 <= p39) AND (1 <= p47)) OR ((1 <= p13) AND (1 <= p45) AND (1 <= p49)) OR ((1 <= p11) AND (1 <= p41) AND (1 <= p48)) OR ((1 <= p11) AND (1 <= p38) AND (1 <= p47))) AND (((1 <= p12) AND (1 <= p32)) OR ((1 <= p11) AND (1 <= p32)) OR ((1 <= p13) AND (1 <= p33)) OR ((1 <= p14) AND (1 <= p33)) OR ((1 <= p15) AND (1 <= p34)) OR ((1 <= p16) AND (1 <= p34))))) AND EX((((1 <= p9) AND (1 <= p60)) OR ((1 <= p10) AND (1 <= p61)) OR ((1 <= p8) AND (1 <= p59)) OR ((1 <= p12) AND (1 <= p20)) OR ((1 <= p11) AND (1 <= p20)) OR ((1 <= p13) AND (1 <= p21)) OR ((1 <= p14) AND (1 <= p21)) OR ((1 <= p15) AND (1 <= p22)) OR ((1 <= p16) AND (1 <= p22))))))",
"processed_size": 918,
"rewrites": 28
},
"net":
{
"conflict_clusters": 6,
"singleton_clusters": 0
},
"result":
{
"edges": 79262,
"markings": 19742,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 12,
"adisj": 2,
"aneg": 0,
"comp": 33,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 33,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 30,
"visible_transitions": 0
},
"processed": "EG((((1 <= p35) OR (1 <= p37) OR (1 <= p36) OR ((1 <= p47) AND (1 <= p50) AND (1 <= p51) AND (1 <= p52)) OR ((1 <= p48) AND (1 <= p53) AND (1 <= p54) AND (1 <= p55)) OR ((1 <= p49) AND (1 <= p56) AND (1 <= p57) AND (1 <= p58)) OR ((1 <= p4) AND (1 <= p29)) OR ((1 <= p5) AND (1 <= p30)) OR ((1 <= p6) AND (1 <= p31))) OR AF((((1 <= p15) AND (1 <= p70)) OR ((1 <= p11) AND (1 <= p68)) OR ((1 <= p16) AND (1 <= p70)) OR ((1 <= p14) AND (1 <= p69)) OR ((1 <= p12) AND (1 <= p68)) OR ((1 <= p13) AND (1 <= p69))))))",
"processed_size": 524,
"rewrites": 27
},
"net":
{
"conflict_clusters": 6,
"singleton_clusters": 0
},
"result":
{
"edges": 15761,
"markings": 6571,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 20,
"adisj": 6,
"aneg": 0,
"comp": 48,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 48,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 31,
"visible_transitions": 0
},
"processed": "AX((((1 <= p7) AND (1 <= p64)) OR ((1 <= p7) AND (1 <= p63)) OR ((1 <= p7) AND (1 <= p62)) OR (((p47 <= 0) OR (p50 <= 0) OR (p51 <= 0) OR (p52 <= 0)) AND ((p48 <= 0) OR (p53 <= 0) OR (p54 <= 0) OR (p55 <= 0)) AND ((p49 <= 0) OR (p56 <= 0) OR (p57 <= 0) OR (p58 <= 0))) OR ((((1 <= p12) AND (1 <= p20)) OR ((1 <= p11) AND (1 <= p20)) OR ((1 <= p13) AND (1 <= p21)) OR ((1 <= p14) AND (1 <= p21)) OR ((1 <= p15) AND (1 <= p22)) OR ((1 <= p16) AND (1 <= p22))) AND (((1 <= p10) AND (1 <= p60)) OR ((1 <= p10) AND (1 <= p59)) OR ((1 <= p9) AND (1 <= p61)) OR ((1 <= p8) AND (1 <= p61)) OR ((1 <= p7) AND (1 <= p61)) OR ((1 <= p7) AND (1 <= p60)) OR ((1 <= p7) AND (1 <= p59)) OR ((1 <= p8) AND (1 <= p60)) OR ((1 <= p9) AND (1 <= p59))))))",
"processed_size": 761,
"rewrites": 26
},
"net":
{
"conflict_clusters": 6,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 6,
"adisj": 1,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "EF(AX((((1 <= p15) AND (1 <= p70)) OR ((1 <= p11) AND (1 <= p68)) OR ((1 <= p16) AND (1 <= p70)) OR ((1 <= p14) AND (1 <= p69)) OR ((1 <= p12) AND (1 <= p68)) OR ((1 <= p13) AND (1 <= p69)))))",
"processed_size": 197,
"rewrites": 27
},
"net":
{
"conflict_clusters": 6,
"singleton_clusters": 0
},
"result":
{
"edges": 41,
"markings": 34,
"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": 445
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(((1 <= p9) AND (1 <= p60)) OR ((1 <= p10) AND (1 <= p61)) OR ((1 <= p8) AND (1 <= p59)))",
"processed_size": 91,
"rewrites": 28
},
"result":
{
"edges": 570,
"markings": 313,
"produced_by": "state space /EGEF",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 39
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 3
},
"type": "possible_preservation_of_reachability",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "((1 <= p8) AND (1 <= p25))",
"processed_size": 26,
"rewrites": 28
},
"result":
{
"edges": 422,
"markings": 332,
"produced_by": "tscc_search",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"store":
{
"type": "dfs/tscc"
},
"type": "liveness",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 12,
"adisj": 1,
"aneg": 1,
"comp": 24,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 24,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "(((p9 <= 0) OR (p26 <= 0)) AND ((p7 <= 0) OR (p27 <= 0)) AND ((p7 <= 0) OR (p28 <= 0)) AND ((p9 <= 0) OR (p27 <= 0)) AND ((p7 <= 0) OR (p26 <= 0)) AND ((p9 <= 0) OR (p28 <= 0)) AND ((p8 <= 0) OR (p28 <= 0)) AND ((p10 <= 0) OR (p26 <= 0)) AND ((p10 <= 0) OR (p27 <= 0)) AND ((p8 <= 0) OR (p26 <= 0)) AND ((p10 <= 0) OR (p28 <= 0)) AND ((p8 <= 0) OR (p27 <= 0)))",
"processed_size": 372,
"rewrites": 29
},
"result":
{
"edges": 66372,
"markings": 16548,
"produced_by": "state space /EFEG",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 51
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 24,
"problems": 12
},
"type": "eventual_occurrence_from_all_states",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 12,
"adisj": 1,
"aneg": 0,
"comp": 30,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 30,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 19,
"visible_transitions": 0
},
"processed": "(((1 <= p4) AND (1 <= p31)) OR ((1 <= p5) AND (1 <= p29)) OR ((1 <= p6) AND (1 <= p29)) OR ((1 <= p3) AND (1 <= p30)) OR ((1 <= p6) AND (1 <= p30)) OR ((1 <= p3) AND (1 <= p31)) OR ((1 <= p3) AND (1 <= p29)) OR ((1 <= p4) AND (1 <= p30)) OR ((1 <= p5) AND (1 <= p31)) OR ((1 <= p47) AND (1 <= p50) AND (1 <= p51) AND (1 <= p52)) OR ((1 <= p48) AND (1 <= p53) AND (1 <= p54) AND (1 <= p55)) OR ((1 <= p49) AND (1 <= p56) AND (1 <= p57) AND (1 <= p58)))",
"processed_size": 462,
"rewrites": 29
},
"result":
{
"edges": 48554,
"markings": 18294,
"produced_by": "parallel",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 30,
"problems": 12
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 35,
"adisj": 5,
"aneg": 1,
"comp": 81,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 81,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 34,
"visible_transitions": 0
},
"processed": "E (G ((((((1 <= p47) AND (1 <= p50) AND (1 <= p51) AND (1 <= p52)) OR ((1 <= p48) AND (1 <= p53) AND (1 <= p54) AND (1 <= p55)) OR ((1 <= p49) AND (1 <= p56) AND (1 <= p57) AND (1 <= p58))) AND ((p9 <= 0) OR (p26 <= 0)) AND ((p7 <= 0) OR (p27 <= 0)) AND ((p7 <= 0) OR (p28 <= 0)) AND ((p9 <= 0) OR (p27 <= 0)) AND ((p7 <= 0) OR (p26 <= 0)) AND ((p9 <= 0) OR (p28 <= 0)) AND ((p8 <= 0) OR (p28 <= 0)) AND ((p10 <= 0) OR (p26 <= 0)) AND ((p10 <= 0) OR (p27 <= 0)) AND ((p8 <= 0) OR (p26 <= 0)) AND ((p10 <= 0) OR (p28 <= 0)) AND ((p8 <= 0) OR (p27 <= 0)) AND ((p8 <= 0) OR (p23 <= 0)) AND ((p8 <= 0) OR (p24 <= 0)) AND ((p9 <= 0) OR (p23 <= 0)) AND ((p10 <= 0) OR (p23 <= 0)) AND ((p10 <= 0) OR (p24 <= 0)) AND ((p9 <= 0) OR (p24 <= 0)) AND ((p10 <= 0) OR (p25 <= 0)) AND ((p9 <= 0) OR (p25 <= 0)) AND ((p8 <= 0) OR (p25 <= 0))) OR (((p4 <= 0) OR (p29 <= 0)) AND ((p5 <= 0) OR (p30 <= 0)) AND ((p6 <= 0) OR (p31 <= 0)) AND (p35 <= 0) AND (p37 <= 0) AND (p36 <= 0) AND ((p10 <= 0) OR (p60 <= 0)) AND ((p10 <= 0) OR (p59 <= 0)) AND ((p9 <= 0) OR (p61 <= 0)) AND ((p8 <= 0) OR (p61 <= 0)) AND ((p7 <= 0) OR (p61 <= 0)) AND ((p7 <= 0) OR (p60 <= 0)) AND ((p7 <= 0) OR (p59 <= 0)) AND ((p8 <= 0) OR (p60 <= 0)) AND ((p9 <= 0) OR (p59 <= 0))))))",
"processed_size": 1273,
"rewrites": 26
},
"result":
{
"edges": 927,
"markings": 485,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 96
},
"threads": 1,
"type": "dfs"
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"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": "A (G (((1 <= p5) AND (1 <= p18))))",
"processed_size": 34,
"rewrites": 27
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3566
},
"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 <= p6) AND (1 <= p18))",
"processed_size": 26,
"rewrites": 25
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"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": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p10) AND (1 <= p61))))",
"processed_size": 35,
"rewrites": 26
},
"result":
{
"edges": 23,
"markings": 23,
"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": 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": 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": "((p10 <= 0) OR (p27 <= 0))",
"processed_size": 27,
"rewrites": 29
},
"result":
{
"edges": 58039,
"markings": 19692,
"produced_by": "parallel",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((1 <= p6) AND (1 <= p18))",
"processed_size": 26,
"rewrites": 25
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"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 <= p10) AND (1 <= p65))",
"processed_size": 27,
"rewrites": 25
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p10) AND (1 <= p61))))",
"processed_size": 35,
"rewrites": 26
},
"result":
{
"edges": 23,
"markings": 23,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((p10 <= 0) OR (p27 <= 0))",
"processed_size": 27,
"rewrites": 29
},
"result":
{
"edges": 58039,
"markings": 19692,
"produced_by": "parallel",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 72796,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(A(F(**)))) : E(F((E(G(**)) AND E(X(**))))) : (A(X(**)) AND E(G((** OR A(F(**)))))) : E(G(*)) : E(F(A(G(*)))) : E(F(A(X(**)))) : (E(X(**)) OR (E(G(E(F(**)))) OR (** OR (** OR **)))) : E(F(**)) : A(G(E(F(*)))) : (** OR (E(F(A(G(**)))) AND (E(F(**)) OR **))) : (E(F(**)) OR A(G(**)))"
},
"net":
{
"arcs": 480,
"conflict_clusters": 6,
"places": 71,
"places_significant": 54,
"singleton_clusters": 0,
"transitions": 114
},
"result":
{
"preliminary_value": "yes no yes no no yes yes yes no no yes ",
"value": "yes no yes no no yes yes yes no 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: 185/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 71
lola: finding significant places
lola: 71 places, 114 transitions, 54 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 (G (A (G (A (F ((((1 <= p9) AND (1 <= p26)) OR ((1 <= p7) AND (1 <= p27)) OR ((1 <= p7) AND (1 <= p28)) OR ((1 <= p9) AND (1 <= p27)) OR ((1 <= p7) AND (1 <= p26)) OR ((1 <= p9) AND (1 <= p28)) OR ((1 <= p8) AND (1 <= p28)) OR ((1 <= p10) AND (1 <= p26)) OR ((1 <= p10) AND (1 <= p27)) OR ((1 <= p8) AND (1 <= p26)) OR ((1 <= p10) AND (1 <= p28)) OR ((1 <= p8) AND (1 <= p27))))))))) : E (F ((E (G (((((1 <= p13) AND (1 <= p42) AND (1 <= p48)) OR ((1 <= p15) AND (1 <= p40) AND (1 <= p47)) OR ((1 <= p11) AND (1 <= p44) AND (1 <= p49)) OR ((1 <= p15) AND (1 <= p43) AND (1 <= p48)) OR ((1 <= p15) AND (1 <= p46) AND (1 <= p49)) OR ((1 <= p13) AND (1 <= p39) AND (1 <= p47)) OR ((1 <= p13) AND (1 <= p45) AND (1 <= p49)) OR ((1 <= p11) AND (1 <= p41) AND (1 <= p48)) OR ((1 <= p11) AND (1 <= p38) AND (1 <= p47))) AND (((1 <= p12) AND (1 <= p32)) OR ((1 <= p11) AND (1 <= p32)) OR ((1 <= p13) AND (1 <= p33)) OR ((1 <= p14) AND (1 <= p33)) OR ((1 <= p15) AND (1 <= p34)) OR ((1 <= p16) AND (1 <= p34)))))) AND E (X ((((1 <= p9) AND (1 <= p60)) OR ((1 <= p10) AND (1 <= p61)) OR ((1 <= p8) AND (1 <= p59)) OR ((1 <= p12) AND (1 <= p20)) OR ((1 <= p11) AND (1 <= p20)) OR ((1 <= p13) AND (1 <= p21)) OR ((1 <= p14) AND (1 <= p21)) OR ((1 <= p15) AND (1 <= p22)) OR ((1 <= p16) AND (1 <= p22)))))))) : (A (X ((((1 <= p7) AND (1 <= p64)) OR ((1 <= p7) AND (1 <= p63)) OR ((1 <= p7) AND (1 <= p62)) OR (((p47 <= 0) OR (p50 <= 0) OR (p51 <= 0) OR (p52 <= 0)) AND ((p48 <= 0) OR (p53 <= 0) OR (p54 <= 0) OR (p55 <= 0)) AND ((p49 <= 0) OR (p56 <= 0) OR (p57 <= 0) OR (p58 <= 0))) OR ((((1 <= p12) AND (1 <= p20)) OR ((1 <= p11) AND (1 <= p20)) OR ((1 <= p13) AND (1 <= p21)) OR ((1 <= p14) AND (1 <= p21)) OR ((1 <= p15) AND (1 <= p22)) OR ((1 <= p16) AND (1 <= p22))) AND (((1 <= p10) AND (1 <= p60)) OR ((1 <= p10) AND (1 <= p59)) OR ((1 <= p9) AND (1 <= p61)) OR ((1 <= p8) AND (1 <= p61)) OR ((1 <= p7) AND (1 <= p61)) OR ((1 <= p7) AND (1 <= p60)) OR ((1 <= p7) AND (1 <= p59)) OR ((1 <= p8) AND (1 <= p60)) OR ((1 <= p9) AND (1 <= p59))))))) AND E (G ((((1 <= p35) OR (1 <= p37) OR (1 <= p36) OR ((1 <= p47) AND (1 <= p50) AND (1 <= p51) AND (1 <= p52)) OR ((1 <= p48) AND (1 <= p53) AND (1 <= p54) AND (1 <= p55)) OR ((1 <= p49) AND (1 <= p56) AND (1 <= p57) AND (1 <= p58)) OR ((1 <= p4) AND (1 <= p29)) OR ((1 <= p5) AND (1 <= p30)) OR ((1 <= p6) AND (1 <= p31))) OR A (F ((((1 <= p15) AND (1 <= p70)) OR ((1 <= p11) AND (1 <= p68)) OR ((1 <= p16) AND (1 <= p70)) OR ((1 <= p14) AND (1 <= p69)) OR ((1 <= p12) AND (1 <= p68)) OR ((1 <= p13) AND (1 <= p69))))))))) : NOT(A (F ((((((p47 <= 0) OR (p50 <= 0) OR (p51 <= 0) OR (p52 <= 0)) AND ((p48 <= 0) OR (p53 <= 0) OR (p54 <= 0) OR (p55 <= 0)) AND ((p49 <= 0) OR (p56 <= 0) OR (p57 <= 0) OR (p58 <= 0))) OR ((1 <= p9) AND (1 <= p26)) OR ((1 <= p7) AND (1 <= p27)) OR ((1 <= p7) AND (1 <= p28)) OR ((1 <= p9) AND (1 <= p27)) OR ((1 <= p7) AND (1 <= p26)) OR ((1 <= p9) AND (1 <= p28)) OR ((1 <= p8) AND (1 <= p28)) OR ((1 <= p10) AND (1 <= p26)) OR ((1 <= p10) AND (1 <= p27)) OR ((1 <= p8) AND (1 <= p26)) OR ((1 <= p10) AND (1 <= p28)) OR ((1 <= p8) AND (1 <= p27)) OR ((1 <= p8) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p24)) OR ((1 <= p9) AND (1 <= p23)) OR ((1 <= p10) AND (1 <= p23)) OR ((1 <= p10) AND (1 <= p24)) OR ((1 <= p9) AND (1 <= p24)) OR ((1 <= p10) AND (1 <= p25)) OR ((1 <= p9) AND (1 <= p25)) OR ((1 <= p8) AND (1 <= p25))) AND (((1 <= p4) AND (1 <= p29)) OR ((1 <= p5) AND (1 <= p30)) OR ((1 <= p6) AND (1 <= p31)) OR (1 <= p35) OR (1 <= p37) OR (1 <= p36) OR ((1 <= p10) AND (1 <= p60)) OR ((1 <= p10) AND (1 <= p59)) OR ((1 <= p9) AND (1 <= p61)) OR ((1 <= p8) AND (1 <= p61)) OR ((1 <= p7) AND (1 <= p61)) OR ((1 <= p7) AND (1 <= p60)) OR ((1 <= p7) AND (1 <= p59)) OR ((1 <= p8) AND (1 <= p60)) OR ((1 <= p9) AND (1 <= p59))))))) : NOT(A (G (E (F ((((1 <= p4) AND (1 <= p31)) OR ((1 <= p5) AND (1 <= p29)) OR ((1 <= p6) AND (1 <= p29)) OR ((1 <= p3) AND (1 <= p30)) OR ((1 <= p6) AND (1 <= p30)) OR ((1 <= p3) AND (1 <= p31)) OR ((1 <= p3) AND (1 <= p29)) OR ((1 <= p4) AND (1 <= p30)) OR ((1 <= p5) AND (1 <= p31)) OR ((1 <= p47) AND (1 <= p50) AND (1 <= p51) AND (1 <= p52)) OR ((1 <= p48) AND (1 <= p53) AND (1 <= p54) AND (1 <= p55)) OR ((1 <= p49) AND (1 <= p56) AND (1 <= p57) AND (1 <= p58)))))))) : E (F (A (F (A (X ((((1 <= p15) AND (1 <= p70)) OR ((1 <= p11) AND (1 <= p68)) OR ((1 <= p16) AND (1 <= p70)) OR ((1 <= p14) AND (1 <= p69)) OR ((1 <= p12) AND (1 <= p68)) OR ((1 <= p13) AND (1 <= p69))))))))) : ((((E (X ((((1 <= p8) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p24)) OR ((1 <= p9) AND (1 <= p23)) OR ((1 <= p10) AND (1 <= p23)) OR ((1 <= p10) AND (1 <= p24)) OR ((1 <= p9) AND (1 <= p24)) OR ((1 <= p10) AND (1 <= p25)) OR ((1 <= p9) AND (1 <= p25)) OR ((1 <= p8) AND (1 <= p25))))) OR E (G (E (F ((((1 <= p9) AND (1 <= p60)) OR ((1 <= p10) AND (1 <= p61)) OR ((1 <= p8) AND (1 <= p59)))))))) OR (1 <= p35)) OR (1 <= p37)) OR (1 <= p36)) : E (F (((1 <= p9) AND (1 <= p61)))) : NOT(E (F (A (G (((p8 <= 0) OR (p25 <= 0))))))) : (((1 <= p10) AND (1 <= p65)) OR (E (F (A (G (((1 <= p10) AND (1 <= p27)))))) AND (E (F (((1 <= p10) AND (1 <= p61)))) OR ((1 <= p6) AND (1 <= p18))))) : (A (((1 <= 0) U E (F (((1 <= p11) AND (1 <= p68)))))) OR A (G (E (((1 <= 0) U ((1 <= p5) AND (1 <= p18)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:389
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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:455
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: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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:184
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:183
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((E (G (((((1 <= p13) AND (1 <= p42) AND (1 <= p48)) OR ((1 <= p15) AND (1 <= p40) AND (1 <= p47)) OR ((1 <= p11) AND (1 <= p44) AND (1 <= p49)) OR ((1 <= p15) AND (1 <= p43) AND (1 <= p48)) OR ((1 <= p15) AND (1 <= p46) AND (1 <= p49)) OR ((1 <= p13) AND (1 <= p39) AND (1 <= p47)) OR ((1 <= p13) AND (1 <= p45) AND (1 <= p49)) OR ((1 <= p11) AND (1 <= p41) AND (1 <= p48)) OR ((1 <= p1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((EG(((((1 <= p13) AND (1 <= p42) AND (1 <= p48)) OR ((1 <= p15) AND (1 <= p40) AND (1 <= p47)) OR ((1 <= p11) AND (1 <= p44) AND (1 <= p49)) OR ((1 <= p15) AND (1 <= p43) AND (1 <= p48)) OR ((1 <= p15) AND (1 <= p46) AND (1 <= p49)) OR ((1 <= p13) AND (1 <= p39) AND (1 <= p47)) OR ((1 <= p13) AND (1 <= p45) AND (1 <= p49)) OR ((1 <= p11) AND (1 <= p41) AND (1 <= p48)) OR ((1 <= p11) AND... (shortened)
lola: processed formula length: 918
lola: 28 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: 19742 markings, 79262 edges
lola: ========================================
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X ((((1 <= p7) AND (1 <= p64)) OR ((1 <= p7) AND (1 <= p63)) OR ((1 <= p7) AND (1 <= p62)) OR (((p47 <= 0) OR (p50 <= 0) OR (p51 <= 0) OR (p52 <= 0)) AND ((p48 <= 0) OR (p53 <= 0) OR (p54 <= 0) OR (p55 <= 0)) AND ((p49 <= 0) OR (p56 <= 0) OR (p57 <= 0) OR (p58 <= 0))) OR ((((1 <= p12) AND (1 <= p20)) OR ((1 <= p11) AND (1 <= p20)) OR ((1 <= p13) AND (1 <= p21)) OR ((1 <= p14) A... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((1 <= p35) OR (1 <= p37) OR (1 <= p36) OR ((1 <= p47) AND (1 <= p50) AND (1 <= p51) AND (1 <= p52)) OR ((1 <= p48) AND (1 <= p53) AND (1 <= p54) AND (1 <= p55)) OR ((1 <= p49) AND (1 <= p56) AND (1 <= p57) AND (1 <= p58)) OR ((1 <= p4) AND (1 <= p29)) OR ((1 <= p5) AND (1 <= p30)) OR ((1 <= p6) AND (1 <= p31))) OR A (F ((((1 <= p15) AND (1 <= p70)) OR ((1 <= p11) AND (1 <= p68)) O... (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((((1 <= p35) OR (1 <= p37) OR (1 <= p36) OR ((1 <= p47) AND (1 <= p50) AND (1 <= p51) AND (1 <= p52)) OR ((1 <= p48) AND (1 <= p53) AND (1 <= p54) AND (1 <= p55)) OR ((1 <= p49) AND (1 <= p56) AND (1 <= p57) AND (1 <= p58)) OR ((1 <= p4) AND (1 <= p29)) OR ((1 <= p5) AND (1 <= p30)) OR ((1 <= p6) AND (1 <= p31))) OR AF((((1 <= p15) AND (1 <= p70)) OR ((1 <= p11) AND (1 <= p68)) OR ((1... (shortened)
lola: processed formula length: 524
lola: 27 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 6571 markings, 15761 edges
lola: ========================================
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((((1 <= p7) AND (1 <= p64)) OR ((1 <= p7) AND (1 <= p63)) OR ((1 <= p7) AND (1 <= p62)) OR (((p47 <= 0) OR (p50 <= 0) OR (p51 <= 0) OR (p52 <= 0)) AND ((p48 <= 0) OR (p53 <= 0) OR (p54 <= 0) OR (p55 <= 0)) AND ((p49 <= 0) OR (p56 <= 0) OR (p57 <= 0) OR (p58 <= 0))) OR ((((1 <= p12) AND (1 <= p20)) OR ((1 <= p11) AND (1 <= p20)) OR ((1 <= p13) AND (1 <= p21)) OR ((1 <= p14) AN... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((((1 <= p7) AND (1 <= p64)) OR ((1 <= p7) AND (1 <= p63)) OR ((1 <= p7) AND (1 <= p62)) OR (((p47 <= 0) OR (p50 <= 0) OR (p51 <= 0) OR (p52 <= 0)) AND ((p48 <= 0) OR (p53 <= 0) OR (p54 <= 0) OR (p55 <= 0)) AND ((p49 <= 0) OR (p56 <= 0) OR (p57 <= 0) OR (p58 <= 0))) OR ((((1 <= p12) AND (1 <= p20)) OR ((1 <= p11) AND (1 <= p20)) OR ((1 <= p13) AND (1 <= p21)) OR ((1 <= p14) AND (... (shortened)
lola: processed formula length: 761
lola: 26 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((((1 <= p15) AND (1 <= p70)) OR ((1 <= p11) AND (1 <= p68)) OR ((1 <= p16) AND (1 <= p70)) OR ((1 <= p14) AND (1 <= p69)) OR ((1 <= p12) AND (1 <= p68)) OR ((1 <= p13) AND (1 <= p69)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(AX((((1 <= p15) AND (1 <= p70)) OR ((1 <= p11) AND (1 <= p68)) OR ((1 <= p16) AND (1 <= p70)) OR ((1 <= p14) AND (1 <= p69)) OR ((1 <= p12) AND (1 <= p68)) OR ((1 <= p13) AND (1 <= p69)))))
lola: processed formula length: 197
lola: 27 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: 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: 34 markings, 41 edges
lola: ========================================
lola: subprocess 3 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X ((((1 <= p8) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p24)) OR ((1 <= p9) AND (1 <= p23)) OR ((1 <= p10) AND (1 <= p23)) OR ((1 <= p10) AND (1 <= p24)) OR ((1 <= p9) AND (1 <= p24)) OR ((1 <= p10) AND (1 <= p25)) OR ((1 <= p9) AND (1 <= p25)) OR ((1 <= p8) AND (1 <= p25))))) OR (E (G (E (F ((((1 <= p9) AND (1 <= p60)) OR ((1 <= p10) AND (1 <= p61)) OR ((1 <= p8) AND (1 <= p59)))))))... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p35) OR ((1 <= p37) OR (1 <= p36)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: processed formula: ((1 <= p35) OR (1 <= p37) OR (1 <= p36))
lola: processed formula length: 40
lola: 28 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((((1 <= p9) AND (1 <= p60)) OR ((1 <= p10) AND (1 <= p61)) OR ((1 <= p8) AND (1 <= p59)))))))
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: (((1 <= p9) AND (1 <= p60)) OR ((1 <= p10) AND (1 <= p61)) OR ((1 <= p8) AND (1 <= p59)))
lola: processed formula length: 91
lola: 28 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 unparse finished++ id 0
lola: formula 0: (((p9 <= 0) OR (p60 <= 0)) AND ((p10 <= 0) OR (p61 <= 0)) AND ((p8 <= 0) OR (p59 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 24 literals and 8 conjunctive subformulas
lola: state equation 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 <= p9) AND (1 <= p60)) OR ((1 <= p10) AND (1 <= p61)) OR ((1 <= p8) AND (1 <= p59)))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-4-0.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLFireability-4-1.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: 313 markings, 570 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p9) AND (1 <= p61))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p9) AND (1 <= p61))))
lola: processed formula length: 34
lola: 26 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
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
sara: try reading problem file CTLFireability-4-0.sara.
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 <= p9) AND (1 <= p61))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 675 markings, 894 edges
sara: could not read problem information -- aborting [#01]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: ========================================
lola: subprocess 5 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((1 <= p8) AND (1 <= p25))))))
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: ((1 <= p8) AND (1 <= p25))
lola: processed formula length: 26
lola: 28 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: ((p8 <= 0) OR (p25 <= 0))
lola: state equation task get result unparse finished id 0
lola: formula 1: ((1 <= p8) AND (1 <= p25))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: tscc_search
lola: The predicate is not live.
lola: 332 markings, 422 edges
lola: ========================================
lola: subprocess 6 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((((1 <= p9) AND (1 <= p26)) OR ((1 <= p7) AND (1 <= p27)) OR ((1 <= p7) AND (1 <= p28)) OR ((1 <= p9) AND (1 <= p27)) OR ((1 <= p7) AND (1 <= p26)) OR ((1 <= p9) AND (1 <= p28)) OR ((1 <= p8) AND (1 <= p28)) OR ((1 <= p10) AND (1 <= p26)) OR ((1 <= p10) AND (1 <= p27)) OR ((1 <= p8) AND (1 <= p26)) OR ((1 <= p10) AND (1 <= p28)) OR ((1 <= p8) AND (1 <= p27)))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all states
lola: rewrite Frontend/Parser/formula_rewrite.k:599
lola: rewrite Frontend/Parser/formula_rewrite.k:634
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p9 <= 0) OR (p26 <= 0)) AND ((p7 <= 0) OR (p27 <= 0)) AND ((p7 <= 0) OR (p28 <= 0)) AND ((p9 <= 0) OR (p27 <= 0)) AND ((p7 <= 0) OR (p26 <= 0)) AND ((p9 <= 0) OR (p28 <= 0)) AND ((p8 <= 0) OR (p28 <= 0)) AND ((p10 <= 0) OR (p26 <= 0)) AND ((p10 <= 0) OR (p27 <= 0)) AND ((p8 <= 0) OR (p26 <= 0)) AND ((p10 <= 0) OR (p28 <= 0)) AND ((p8 <= 0) OR (p27 <= 0)))
lola: processed formula length: 372
lola: 29 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: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 <= p9) AND (1 <= p26)) OR ((1 <= p7) AND (1 <= p27)) OR ((1 <= p7) AND (1 <= p28)) OR ((1 <= p9) AND (1 <= p27)) OR ((1 <= p7) AND (1 <= p26)) OR ((1 <= p9) AND (1 <= p28)) OR ((1 <= p8) AND (1 <= p28)) OR ((1 <= p10) AND (1 <= p26)) OR ((1 <= p10) AND (1 <= p27)) OR ((1 <= p8) AND (1 <= p26)) OR ((1 <= p10) AND (1 <= p28)) OR ((1 <= p8) AND (1 <= p27)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 24 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-6-0.sara.
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (((p9 <= 0) OR (p26 <= 0)) AND ((p7 <= 0) OR (p27 <= 0)) AND ((p7 <= 0) OR (p28 <= 0)) AND ((p9 <= 0) OR (p27 <= 0)) AND ((p7 <= 0) OR (p26 <= 0)) AND ((p9 <= 0) OR (p28 <= 0)) AND ((p8 <= 0) OR (p28 <= 0)) AND ((p10 <= 0) OR (p26 <= 0)) AND ((p10 <= 0) OR (p27 <= 0)) AND ((p8 <= 0) OR (p26 <= 0)) AND ((p10 <= 0) OR (p28 <= 0)) AND ((p8 <= 0) OR (p27 <= 0)))
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EFEG
lola: The predicate eventually occurs from all states.
lola: 16548 markings, 66372 edges
lola: ========================================
lola: subprocess 7 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((((p4 <= 0) OR (p31 <= 0)) AND ((p5 <= 0) OR (p29 <= 0)) AND ((p6 <= 0) OR (p29 <= 0)) AND ((p3 <= 0) OR (p30 <= 0)) AND ((p6 <= 0) OR (p30 <= 0)) AND ((p3 <= 0) OR (p31 <= 0)) AND ((p3 <= 0) OR (p29 <= 0)) AND ((p4 <= 0) OR (p30 <= 0)) AND ((p5 <= 0) OR (p31 <= 0)) AND ((p47 <= 0) OR (p50 <= 0) OR (p51 <= 0) OR (p52 <= 0)) AND ((p48 <= 0) OR (p53 <= 0) OR (p54 <= 0) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (((1 <= p4) AND (1 <= p31)) OR ((1 <= p5) AND (1 <= p29)) OR ((1 <= p6) AND (1 <= p29)) OR ((1 <= p3) AND (1 <= p30)) OR ((1 <= p6) AND (1 <= p30)) OR ((1 <= p3) AND (1 <= p31)) OR ((1 <= p3) AND (1 <= p29)) OR ((1 <= p4) AND (1 <= p30)) OR ((1 <= p5) AND (1 <= p31)) OR ((1 <= p47) AND (1 <= p50) AND (1 <= p51) AND (1 <= p52)) OR ((1 <= p48) AND (1 <= p53) AND (1 <= p54) AND (1 <= p55)) ... (shortened)
lola: processed formula length: 462
lola: 29 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:700
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: rewrite Frontend/Parser/formula_rewrite.k:788
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: (((p4 <= 0) OR (p31 <= 0)) AND ((p5 <= 0) OR (p29 <= 0)) AND ((p6 <= 0) OR (p29 <= 0)) AND ((p3 <= 0) OR (p30 <= 0)) AND ((p6 <= 0) OR (p30 <= 0)) AND ((p3 <= 0) OR (p31 <= 0)) AND ((p3 <= 0) OR (p29 <= 0)) AND ((p4 <= 0) OR (p30 <= 0)) AND ((p5 <= 0) OR (p31 <= 0)) AND ((p47 <= 0) OR (p50 <= 0) OR (p51 <= 0) OR (p52 <= 0)) AND ((p48 <= 0) OR (p53 <= 0) OR (p54 <= 0) OR (p55 <= 0)) AND ((p49 <= 0) OR (p56 <= 0) OR (p57 <= 0) OR (p58 <= 0)))
lola: formula 1: (((1 <= p4) AND (1 <= p31)) OR ((1 <= p5) AND (1 <= p29)) OR ((1 <= p6) AND (1 <= p29)) OR ((1 <= p3) AND (1 <= p30)) OR ((1 <= p6) AND (1 <= p30)) OR ((1 <= p3) AND (1 <= p31)) OR ((1 <= p3) AND (1 <= p29)) OR ((1 <= p4) AND (1 <= p30)) OR ((1 <= p5) AND (1 <= p31)) OR ((1 <= p47) AND (1 <= p50) AND (1 <= p51) AND (1 <= p52)) OR ((1 <= p48) AND (1 <= p53) AND (1 <= p54) AND (1 <= p55)) OR ((1 <= p49) AND (1 <= p56) AND (1 <= p57) AND (1 <= p58)))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 30 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-7-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-7-1.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: parallel
lola: The predicate is not possibly invariant.
lola: 18294 markings, 48554 edges
lola: ========================================
lola: subprocess 8 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((((1 <= p47) AND (1 <= p50) AND (1 <= p51) AND (1 <= p52)) OR ((1 <= p48) AND (1 <= p53) AND (1 <= p54) AND (1 <= p55)) OR ((1 <= p49) AND (1 <= p56) AND (1 <= p57) AND (1 <= p58))) AND ((p9 <= 0) OR (p26 <= 0)) AND ((p7 <= 0) OR (p27 <= 0)) AND ((p7 <= 0) OR (p28 <= 0)) AND ((p9 <= 0) OR (p27 <= 0)) AND ((p7 <= 0) OR (p26 <= 0)) AND ((p9 <= 0) OR (p28 <= 0)) AND ((p8 <= 0) OR (p2... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((((1 <= p47) AND (1 <= p50) AND (1 <= p51) AND (1 <= p52)) OR ((1 <= p48) AND (1 <= p53) AND (1 <= p54) AND (1 <= p55)) OR ((1 <= p49) AND (1 <= p56) AND (1 <= p57) AND (1 <= p58))) AND ((p9 <= 0) OR (p26 <= 0)) AND ((p7 <= 0) OR (p27 <= 0)) AND ((p7 <= 0) OR (p28 <= 0)) AND ((p9 <= 0) OR (p27 <= 0)) AND ((p7 <= 0) OR (p26 <= 0)) AND ((p9 <= 0) OR (p28 <= 0)) AND ((p8 <= 0) OR (p2... (shortened)
lola: processed formula length: 1273
lola: 26 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((((p47 <= 0) OR (p50 <= 0) OR (p51 <= 0) OR (p52 <= 0)) AND ((p48 <= 0) OR (p53 <= 0) OR (p54 <= 0) OR (p55 <= 0)) AND ((p49 <= 0) OR (p56 <= 0) OR (p57 <= 0) OR (p58 <= 0))) OR ((1 <= p9) AND (1 <= p26)) OR ((1 <= p7) AND (1 <= p27)) OR ((1 <= p7) AND (1 <= p28)) OR ((1 <= p9) AND (1 <= p27)) OR ((1 <= p7) AND (1 <= p26)) OR ((1 <= p9) AND (1 <= p28)) OR ((1 <= p8) AND (1 <= p28)) OR ((1 <= p10) AND (1 <= p26)) OR ((1 <= p10) AND (1 <= p27)) OR ((1 <= p8) AND (1 <= p26)) OR ((1 <= p10) AND (1 <= p28)) OR ((1 <= p8) AND (1 <= p27)) OR ((1 <= p8) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p24)) OR ((1 <= p9) AND (1 <= p23)) OR ((1 <= p10) AND (1 <= p23)) OR ((1 <= p10) AND (1 <= p24)) OR ((1 <= p9) AND (1 <= p24)) OR ((1 <= p10) AND (1 <= p25)) OR ((1 <= p9) AND (1 <= p25)) OR ((1 <= p8) AND (1 <= p25))) AND (((1 <= p4) AND (1 <= p29)) OR ((1 <= p5) AND (1 <= p30)) OR ((1 <= p6) AND (1 <= p31)) OR (1 <= p35) OR (1 <= p37) OR (1 <= p36) OR ((1 <= p10) AND (1 <= p60)) OR ((1 <= p10) AND (1 <= p59)) OR ((1 <= p9) AND (1 <= p61)) OR ((1 <= p8) AND (1 <= p61)) OR ((1 <= p7) AND (1 <= p61)) OR ((1 <= p7) AND (1 <= p60)) OR ((1 <= p7) AND (1 <= p59)) OR ((1 <= p8) AND (1 <= p60)) OR ((1 <= p9) AND (1 <= p59))))
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 485 markings, 927 edges
lola: ========================================
lola: subprocess 9 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((1 <= p11) AND (1 <= p68)))) OR A (G (((1 <= p5) AND (1 <= p18)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p5) AND (1 <= p18))))
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 (((1 <= p5) AND (1 <= p18))))
lola: processed formula length: 34
lola: 27 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
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: ((p5 <= 0) OR (p18 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to CTLFireability-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-9-0.sara.
lola: ========================================
lola: subprocess 10 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p11) AND (1 <= p68))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p11) AND (1 <= p68))))
lola: processed formula length: 35
lola: 26 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p11) AND (1 <= p68))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
sara: place or transition ordering is non-deterministic
lola: state equation: write sara problem file to CTLFireability-10-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: 122 markings, 148 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p10) AND (1 <= p65)) OR (E (F (A (G (((1 <= p10) AND (1 <= p27)))))) AND (E (F (((1 <= p10) AND (1 <= p61)))) OR ((1 <= p6) AND (1 <= p18)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p6) AND (1 <= p18))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p6) AND (1 <= p18))
lola: processed formula length: 26
lola: 25 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p10) AND (1 <= p61))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p10) AND (1 <= p61))))
lola: processed formula length: 35
lola: 26 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
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: The predicate is reachable.
lola: 23 markings, 23 edges
lola: formula 0: ((1 <= p10) AND (1 <= p61))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: ========================================
lola: state equation: write sara problem file to CTLFireability-12-0.sara
lola: subprocess 13 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((1 <= p10) AND (1 <= p27))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p10 <= 0) OR (p27 <= 0))
lola: processed formula length: 27
lola: 29 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:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result started, id 1
lola: state equation task get result unparse finished++ id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: formula 0: ((1 <= p10) AND (1 <= p27))
lola: state equation task get result unparse finished id 0
lola: state equation task get result unparse finished++ id 1
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: formula 1: ((p10 <= 0) OR (p27 <= 0))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-13-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: write sara problem file to CTLFireability-13-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-13-1.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: state equation 1: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: parallel
lola: The predicate is not possibly invariant.
lola: 19692 markings, 58039 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (((1 <= p10) AND (1 <= p65)) OR (E (F (A (G (((1 <= p10) AND (1 <= p27)))))) AND (E (F (((1 <= p10) AND (1 <= p61)))) OR ((1 <= p6) AND (1 <= p18)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((1 <= p6) AND (1 <= p18))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p6) AND (1 <= p18))
lola: processed formula length: 26
lola: 25 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((1 <= p10) AND (1 <= p65))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p10) AND (1 <= p65))
lola: processed formula length: 27
lola: 25 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p10) AND (1 <= p61))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p10) AND (1 <= p61))))
lola: processed formula length: 35
lola: 26 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
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: The predicate is reachable.
lola: 23 markings, 23 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p10) AND (1 <= p61))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((1 <= p10) AND (1 <= p27))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p10 <= 0) OR (p27 <= 0))
lola: processed formula length: 27
lola: 29 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: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 <= p10) AND (1 <= p27))
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 task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((p10 <= 0) OR (p27 <= 0))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-14-1.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLFireability-14-0.sara
sara: try reading problem file CTLFireability-14-1.sara.
sara: place or transition ordering is non-deterministic

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 1: solution produced
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: parallel
lola: The predicate is not possibly invariant.
lola: 19692 markings, 58039 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes no no yes yes yes no no yes
lola:
preliminary result: yes no yes no no yes yes yes no no yes
lola: memory consumption: 72796 KB
lola: time consumption: 4 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="LamportFastMutEx-PT-3"
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 LamportFastMutEx-PT-3, 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 r184-oct2-158987928900652"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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