About the Execution of ITS-LoLa for DES-PT-01a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15747.420 | 3600000.00 | 1060728.00 | 1287.90 | ?F???FTF?FTTFFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2020-input.r180-ebro-158987899800196.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is DES-PT-01a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-ebro-158987899800196
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 204K
-rw-r--r-- 1 mcc users 3.4K Mar 30 01:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 30 01:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 28 16:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:15 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 3.4K Apr 8 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Apr 8 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K Mar 27 08:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13K Mar 27 08:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 26 08:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 26 08:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 32K 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 DES-PT-01a-CTLFireability-00
FORMULA_NAME DES-PT-01a-CTLFireability-01
FORMULA_NAME DES-PT-01a-CTLFireability-02
FORMULA_NAME DES-PT-01a-CTLFireability-03
FORMULA_NAME DES-PT-01a-CTLFireability-04
FORMULA_NAME DES-PT-01a-CTLFireability-05
FORMULA_NAME DES-PT-01a-CTLFireability-06
FORMULA_NAME DES-PT-01a-CTLFireability-07
FORMULA_NAME DES-PT-01a-CTLFireability-08
FORMULA_NAME DES-PT-01a-CTLFireability-09
FORMULA_NAME DES-PT-01a-CTLFireability-10
FORMULA_NAME DES-PT-01a-CTLFireability-11
FORMULA_NAME DES-PT-01a-CTLFireability-12
FORMULA_NAME DES-PT-01a-CTLFireability-13
FORMULA_NAME DES-PT-01a-CTLFireability-14
FORMULA_NAME DES-PT-01a-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1591167477820
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 06:58:01] [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 06:58:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 06:58:01] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2020-06-03 06:58:01] [INFO ] Transformed 119 places.
[2020-06-03 06:58:01] [INFO ] Transformed 76 transitions.
[2020-06-03 06:58:01] [INFO ] Found NUPN structural information;
[2020-06-03 06:58:01] [INFO ] Parsed PT model containing 119 places and 76 transitions in 185 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 39 ms.
Incomplete random walk after 100000 steps, including 4016 resets, run finished after 449 ms. (steps per millisecond=222 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0]
// Phase 1: matrix 62 rows 119 cols
[2020-06-03 06:58:02] [INFO ] Computed 59 place invariants in 17 ms
[2020-06-03 06:58:02] [INFO ] [Real]Absence check using 33 positive place invariants in 54 ms returned sat
[2020-06-03 06:58:02] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 18 ms returned sat
[2020-06-03 06:58:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:58:02] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2020-06-03 06:58:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-03 06:58:02] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2020-06-03 06:58:02] [INFO ] Computed and/alt/rep : 61/202/61 causal constraints in 52 ms.
[2020-06-03 06:58:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:58:02] [INFO ] [Nat]Absence check using 33 positive place invariants in 33 ms returned sat
[2020-06-03 06:58:02] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 14 ms returned sat
[2020-06-03 06:58:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:58:02] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2020-06-03 06:58:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2020-06-03 06:58:03] [INFO ] Computed and/alt/rep : 61/202/61 causal constraints in 11 ms.
[2020-06-03 06:58:03] [INFO ] Added : 52 causal constraints over 11 iterations in 229 ms. Result :unsat
[2020-06-03 06:58:03] [INFO ] [Real]Absence check using 33 positive place invariants in 18 ms returned sat
[2020-06-03 06:58:03] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 13 ms returned sat
[2020-06-03 06:58:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:58:03] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2020-06-03 06:58:03] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2020-06-03 06:58:03] [INFO ] Computed and/alt/rep : 61/202/61 causal constraints in 13 ms.
[2020-06-03 06:58:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:58:03] [INFO ] [Nat]Absence check using 33 positive place invariants in 20 ms returned sat
[2020-06-03 06:58:03] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 25 ms returned sat
[2020-06-03 06:58:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:58:03] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2020-06-03 06:58:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2020-06-03 06:58:03] [INFO ] Computed and/alt/rep : 61/202/61 causal constraints in 8 ms.
[2020-06-03 06:58:03] [INFO ] Added : 54 causal constraints over 11 iterations in 195 ms. Result :unsat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-06-03 06:58:04] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-03 06:58:04] [INFO ] Flatten gal took : 89 ms
[2020-06-03 06:58:04] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-03 06:58:04] [INFO ] Flatten gal took : 29 ms
FORMULA DES-PT-01a-CTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-01a-CTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 06:58:04] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 13 ms.
[2020-06-03 06:58:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ DES-PT-01a @ 3570 seconds
FORMULA DES-PT-01a-CTLFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-01a-CTLFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-01a-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-01a-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-01a-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-01a-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-01a-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-01a-CTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-01a-CTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 0
rslt: Output for CTLFireability @ DES-PT-01a
{
"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 06:58:04 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "AX(((p106 <= 0) OR (p108 <= 0)))",
"processed_size": 33,
"rewrites": 51
},
"net":
{
"conflict_clusters": 46,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"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": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"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": "AX(EG(((p56 <= 0) OR (p73 <= 0))))",
"processed_size": 35,
"rewrites": 52
},
"net":
{
"conflict_clusters": 46,
"singleton_clusters": 0
},
"result":
{
"edges": 25,
"markings": 26,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "EX(AG((((p56 <= 0) OR (p73 <= 0)) AND ((p62 <= 0) OR (p78 <= 0)))))",
"processed_size": 69,
"rewrites": 52
},
"net":
{
"conflict_clusters": 46,
"singleton_clusters": 0
},
"result":
{
"edges": 20288,
"markings": 5242,
"produced_by": "CTL model checker",
"value": false
},
"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": 297
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"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 <= p10) AND (1 <= p32))",
"processed_size": 27,
"rewrites": 54
},
"result":
{
"edges": 10,
"markings": 11,
"produced_by": "parallel",
"value": true
},
"task":
{
"compoundnumber": 2,
"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": true
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "EF(AX(AG(((1 <= p102) AND (1 <= p104)))))",
"processed_size": 41,
"rewrites": 53
},
"net":
{
"conflict_clusters": 46,
"singleton_clusters": 0
},
"result":
{
"edges": 52,
"markings": 27,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"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": 4,
"visible_transitions": 0
},
"processed": "AG(EX(((p107 <= 0) OR (p113 <= 0) OR (p23 <= 0) OR (p25 <= 0))))",
"processed_size": 67,
"rewrites": 52
},
"net":
{
"conflict_clusters": 46,
"singleton_clusters": 0
},
"result":
{
"edges": 26,
"markings": 27,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"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": "EX(AF(((1 <= p21) AND (1 <= p35))))",
"processed_size": 35,
"rewrites": 52
},
"net":
{
"conflict_clusters": 46,
"singleton_clusters": 0
},
"result":
{
"edges": 28,
"markings": 29,
"produced_by": "CTL model checker",
"value": false
},
"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": 1,
"E": 2,
"F": 2,
"G": 0,
"U": 0,
"X": 1,
"aconj": 5,
"adisj": 1,
"aneg": 0,
"comp": 14,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "EF((((1 <= p20) AND (1 <= p30) AND (((1 <= p26) AND (1 <= p31) AND (1 <= p33)) OR ((1 <= p10) AND (1 <= p32) AND (1 <= p50) AND (1 <= p67)))) AND (EX(((1 <= p1) AND (1 <= p37) AND (1 <= p39))) OR AF(((1 <= p10) AND (1 <= p32))))))",
"processed_size": 231,
"rewrites": 53
},
"net":
{
"conflict_clusters": 46,
"singleton_clusters": 0
},
"result":
{
"edges": 211280412,
"markings": 24377133,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 455
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 2,
"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": 9,
"visible_transitions": 0
},
"processed": "A (G (((p96 <= 0) OR (p105 <= 0) OR (p18 <= 0) OR (p92 <= 0) OR ((1 <= p116) AND (1 <= p118)) OR ((1 <= p21) AND ((p8 <= 0) OR (p28 <= 0) OR (p116 <= 0) OR (p118 <= 0))))))",
"processed_size": 180,
"rewrites": 52
},
"result":
{
"edges": 14,
"markings": 15,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 531
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"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": "((p21 <= 0))",
"processed_size": 12,
"rewrites": 53
},
"result":
{
"edges": 25,
"markings": 26,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"error": null,
"memory": 58492,
"runtime": 3570.000000,
"signal": null,
"timelimitreached": true
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(A(F(*)) AND ((E(F(**)) OR **) AND (A(G(**)) OR (** OR (** OR (** OR (** OR (** OR **)))))))) : A(F(**)) : (A(F((A(F(**)) AND (** AND **)))) AND A(G((E(F(**)) OR E(G(**)))))) : A(G(E(F(**)))) : ((A(F(**)) AND E((** U **))) OR (E(F(*)) AND (** AND (** AND **)))) : (A(X(E(G(*)))) AND A(X(**))) : A(G(**)) : E(G(E(F(*)))) : E(X(A(G(**)))) : (E(F(A(G(*)))) OR E(X(E(F(**))))) : E(F(A(X(A(G(**)))))) : A(G(E(X(*)))) : E(X(A(F(*)))) : E(F((** AND (E(X(**)) OR A(F(**))))))"
},
"net":
{
"arcs": 317,
"conflict_clusters": 46,
"places": 119,
"places_significant": 60,
"singleton_clusters": 0,
"transitions": 62
},
"result":
{
"interim_value": "unknown no unknown unknown unknown yes no unknown no yes yes no no yes ",
"preliminary_value": "unknown no unknown unknown unknown yes no unknown no 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: 181/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 119
lola: finding significant places
lola: 119 places, 62 transitions, 60 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLFireability.xml
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p76 <= 1)
lola: LP says that atomic proposition is always true: (p103 <= 1)
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p103 <= 1)
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: LP says that atomic proposition is always true: (p57 <= 1)
lola: LP says that atomic proposition is always true: (p59 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p115 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p116 <= 1)
lola: LP says that atomic proposition is always true: (p118 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: LP says that atomic proposition is always true: (p57 <= 1)
lola: LP says that atomic proposition is always true: (p59 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p114 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p115 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p114 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p116 <= 1)
lola: LP says that atomic proposition is always true: (p118 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p73 <= 1)
lola: LP says that atomic proposition is always true: (p106 <= 1)
lola: LP says that atomic proposition is always true: (p108 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p105 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p116 <= 1)
lola: LP says that atomic proposition is always true: (p118 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p116 <= 1)
lola: LP says that atomic proposition is always true: (p118 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p73 <= 1)
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: LP says that atomic proposition is always true: (p78 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p74 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: LP says that atomic proposition is always true: (p104 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: ((NOT(E (G (((p60 <= 0) OR ((1 <= p13) AND (1 <= p98) AND (1 <= p38) AND (1 <= p110)) OR (p76 <= 0))))) AND (E (F ((((1 <= p103) AND (1 <= p113)) OR ((1 <= p103) AND (1 <= p113))))) OR ((1 <= p40) AND (1 <= p45) AND (1 <= p47) AND (1 <= p49) AND (1 <= p51) AND (1 <= p53) AND (1 <= p55) AND (1 <= p57) AND (1 <= p59)))) AND ((((((A (G (((1 <= p26) AND (1 <= p31) AND (1 <= p33) AND (1 <= p5) AND (1 <= p7) AND (1 <= p11) AND (1 <= p12) AND (1 <= p14) AND (1 <= p16)))) OR ((p100 <= 0))) OR ((p115 <= 0))) OR ((p46 <= 0))) OR ((p63 <= 0))) OR ((1 <= p15) AND (1 <= p109))) OR ((1 <= p21) AND (1 <= p35)))) : A (F (((1 <= p21)))) : (A (F (((A (F (((1 <= p6) AND (1 <= p19)))) AND ((1 <= p116))) AND ((1 <= p118))))) AND A (G ((E (F (((1 <= p38) AND (1 <= p110)))) OR E (G (((1 <= p40) AND (1 <= p45) AND (1 <= p47) AND (1 <= p49) AND (1 <= p51) AND (1 <= p53) AND (1 <= p55) AND (1 <= p57) AND (1 <= p59)))))))) : A (G (E (F (((p18 <= 0) OR (p92 <= 0) OR (p2 <= 0) OR (p114 <= 0)))))) : ((A (F (((1 <= p41) AND (1 <= p43) AND (1 <= p100)))) AND E ((((1 <= p1) AND (1 <= p37) AND (1 <= p39)) U ((p100 <= 0) OR (p115 <= 0))))) OR (((NOT(A (G (((1 <= p44) AND (1 <= p61))))) AND ((1 <= p2))) AND ((1 <= p114))) AND ((p42 <= 0) OR (p112 <= 0) OR (p3 <= 0) OR (p34 <= 0) OR ((1 <= p116) AND (1 <= p118))))) : A (X ((NOT(A (F (((1 <= p56) AND (1 <= p73))))) AND ((p106 <= 0) OR (p108 <= 0))))) : A (G (((p96 <= 0) OR (p105 <= 0) OR (p18 <= 0) OR (p92 <= 0) OR ((1 <= p116) AND (1 <= p118)) OR ((1 <= p21) AND ((p8 <= 0) OR (p28 <= 0) OR (p116 <= 0) OR (p118 <= 0)))))) : NOT(A (F (A (G ((((1 <= p10)) OR ((1 <= p13) AND (1 <= p98)))))))) : E (X (A (G ((((p56 <= 0) OR (p73 <= 0)) AND ((p62 <= 0) OR (p78 <= 0))))))) : E (F ((NOT(E (F (((1 <= p10) AND (1 <= p32))))) OR E (X (((1 <= p74) AND (1 <= p90))))))) : E (F (A (X (A (G (((1 <= p102) AND (1 <= p104)))))))) : NOT(E (F (A (X (((1 <= p107) AND (1 <= p113) AND (1 <= p23) AND (1 <= p25))))))) : NOT(A (X (E (G (((p21 <= 0) OR (p35 <= 0))))))) : E (F ((((1 <= p20) AND (1 <= p30) AND (((1 <= p26) AND (1 <= p31) AND (1 <= p33)) OR ((1 <= p10) AND (1 <= p32) AND (1 <= p50) AND (1 <= p67)))) AND (E (X (((1 <= p1) AND (1 <= p37) AND (1 <= p39)))) OR A (F (((1 <= p10) AND (1 <= p32))))))))
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: rewrite Frontend/Parser/formula_rewrite.k:323
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:548
lola: rewrite Frontend/Parser/formula_rewrite.k:395
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (E (G (((p56 <= 0) OR (p73 <= 0)))))) AND A (X (((p106 <= 0) OR (p108 <= 0)))))
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: A (X (((p106 <= 0) OR (p108 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(((p106 <= 0) OR (p108 <= 0)))
lola: processed formula length: 33
lola: 51 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (G (((p56 <= 0) OR (p73 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EG(((p56 <= 0) OR (p73 <= 0))))
lola: processed formula length: 35
lola: 52 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 26 markings, 25 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (G ((((p56 <= 0) OR (p73 <= 0)) AND ((p62 <= 0) OR (p78 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(AG((((p56 <= 0) OR (p73 <= 0)) AND ((p62 <= 0) OR (p78 <= 0)))))
lola: processed formula length: 69
lola: 52 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 5242 markings, 20288 edges
lola: ========================================
lola: subprocess 2 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (A (G (((p10 <= 0) OR (p32 <= 0)))))) OR E (X (E (F (((1 <= p74) AND (1 <= p90)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((p10 <= 0) OR (p32 <= 0))))))
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 <= p10) AND (1 <= p32))
lola: processed formula length: 27
lola: 54 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
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: ((p10 <= 0) OR (p32 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 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:788
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((1 <= p10) AND (1 <= p32))
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: write sara problem file to CTLFireability-2-0.sara
lola: SUBRESULT
lola: lola: result: yes
lola: state equation: calling and running sara
produced by: parallel
lola: The predicate is possibly invariant.
lola: 11 markings, 10 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X (A (G (((1 <= p102) AND (1 <= p104))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(AX(AG(((1 <= p102) AND (1 <= p104)))))
lola: processed formula length: 41
lola: 53 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 27 markings, 52 edges
lola: ========================================
sara: try reading problem file CTLFireability-2-0.sara.
lola: subprocess 4 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X (((p107 <= 0) OR (p113 <= 0) OR (p23 <= 0) OR (p25 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(EX(((p107 <= 0) OR (p113 <= 0) OR (p23 <= 0) OR (p25 <= 0))))
lola: processed formula length: 67
lola: 52 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 27 markings, 26 edges
sara: error: :607: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: ========================================
lola: subprocess 5 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (F (((1 <= p21) AND (1 <= p35))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(AF(((1 <= p21) AND (1 <= p35))))
lola: processed formula length: 35
lola: 52 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 29 markings, 28 edges
lola: ========================================
lola: subprocess 6 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p20) AND (1 <= p30) AND (((1 <= p26) AND (1 <= p31) AND (1 <= p33)) OR ((1 <= p10) AND (1 <= p32) AND (1 <= p50) AND (1 <= p67)))) AND (E (X (((1 <= p1) AND (1 <= p37) AND (1 <= p39)))) OR A (F (((1 <= p10) AND (1 <= p32))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((((1 <= p20) AND (1 <= p30) AND (((1 <= p26) AND (1 <= p31) AND (1 <= p33)) OR ((1 <= p10) AND (1 <= p32) AND (1 <= p50) AND (1 <= p67)))) AND (EX(((1 <= p1) AND (1 <= p37) AND (1 <= p39))) OR AF(((1 <= p10) AND (1 <= p32))))))
lola: processed formula length: 231
lola: 53 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 406121 markings, 3158726 edges, 81224 markings/sec, 0 secs
lola: 799323 markings, 6046780 edges, 78640 markings/sec, 5 secs
lola: 1208271 markings, 9125526 edges, 81790 markings/sec, 10 secs
lola: 1558676 markings, 11940293 edges, 70081 markings/sec, 15 secs
lola: 1908588 markings, 14753565 edges, 69982 markings/sec, 20 secs
lola: 2253035 markings, 17762655 edges, 68889 markings/sec, 25 secs
lola: 2593885 markings, 20669041 edges, 68170 markings/sec, 30 secs
lola: 2930760 markings, 23564379 edges, 67375 markings/sec, 35 secs
lola: 3258120 markings, 26450621 edges, 65472 markings/sec, 40 secs
lola: 3572929 markings, 29232399 edges, 62962 markings/sec, 45 secs
lola: 3901258 markings, 32104326 edges, 65666 markings/sec, 50 secs
lola: 4246305 markings, 35005984 edges, 69009 markings/sec, 55 secs
lola: 4608117 markings, 37913259 edges, 72362 markings/sec, 60 secs
lola: 4954205 markings, 40770933 edges, 69218 markings/sec, 65 secs
lola: 5306159 markings, 43650023 edges, 70391 markings/sec, 70 secs
lola: 5632014 markings, 46565203 edges, 65171 markings/sec, 75 secs
lola: 5959818 markings, 49401480 edges, 65561 markings/sec, 80 secs
lola: 6255389 markings, 52054910 edges, 59114 markings/sec, 85 secs
lola: 6573396 markings, 54892219 edges, 63601 markings/sec, 90 secs
lola: 6901258 markings, 57826857 edges, 65572 markings/sec, 95 secs
lola: 7245174 markings, 60740602 edges, 68783 markings/sec, 100 secs
lola: 7596072 markings, 63554425 edges, 70180 markings/sec, 105 secs
lola: 7936088 markings, 66322071 edges, 68003 markings/sec, 110 secs
lola: 8282289 markings, 69196178 edges, 69240 markings/sec, 115 secs
lola: 8615404 markings, 72061842 edges, 66623 markings/sec, 120 secs
lola: 8923888 markings, 74867671 edges, 61697 markings/sec, 125 secs
lola: 9225456 markings, 77551525 edges, 60314 markings/sec, 130 secs
lola: 9543067 markings, 80369776 edges, 63522 markings/sec, 135 secs
lola: 9852448 markings, 83222295 edges, 61876 markings/sec, 140 secs
lola: 10170982 markings, 86154546 edges, 63707 markings/sec, 145 secs
lola: 10468839 markings, 88993953 edges, 59571 markings/sec, 150 secs
lola: 10773321 markings, 91698255 edges, 60896 markings/sec, 155 secs
lola: 11073643 markings, 94531364 edges, 60064 markings/sec, 160 secs
lola: 11392944 markings, 97349192 edges, 63860 markings/sec, 165 secs
lola: 11667792 markings, 100179650 edges, 54970 markings/sec, 170 secs
lola: 11949210 markings, 102930627 edges, 56284 markings/sec, 175 secs
lola: 12213195 markings, 105520927 edges, 52797 markings/sec, 180 secs
lola: 12478817 markings, 108249892 edges, 53124 markings/sec, 185 secs
lola: 12758874 markings, 111032378 edges, 56011 markings/sec, 190 secs
lola: 13080628 markings, 113937354 edges, 64351 markings/sec, 195 secs
lola: 13401587 markings, 116821621 edges, 64192 markings/sec, 200 secs
lola: 13707835 markings, 119680531 edges, 61250 markings/sec, 205 secs
lola: 14035570 markings, 122451551 edges, 65547 markings/sec, 210 secs
lola: 14339687 markings, 125197570 edges, 60823 markings/sec, 215 secs
lola: 14646983 markings, 128110194 edges, 61459 markings/sec, 220 secs
lola: 14975988 markings, 130974241 edges, 65801 markings/sec, 225 secs
lola: 15298269 markings, 133802771 edges, 64456 markings/sec, 230 secs
lola: 15589475 markings, 136707073 edges, 58241 markings/sec, 235 secs
lola: 15858503 markings, 139589301 edges, 53806 markings/sec, 240 secs
lola: 16144076 markings, 142441757 edges, 57115 markings/sec, 245 secs
lola: 16439710 markings, 145207362 edges, 59127 markings/sec, 250 secs
lola: 16708664 markings, 147911080 edges, 53791 markings/sec, 255 secs
lola: 16984830 markings, 150656285 edges, 55233 markings/sec, 260 secs
lola: 17269774 markings, 153496904 edges, 56989 markings/sec, 265 secs
lola: 17558123 markings, 156380163 edges, 57670 markings/sec, 270 secs
lola: 17832584 markings, 159258803 edges, 54892 markings/sec, 275 secs
lola: 18112067 markings, 162108449 edges, 55897 markings/sec, 280 secs
lola: 18485851 markings, 164999683 edges, 74757 markings/sec, 285 secs
lola: 18846263 markings, 167806372 edges, 72082 markings/sec, 290 secs
lola: 19203956 markings, 170493127 edges, 71539 markings/sec, 295 secs
lola: 19566052 markings, 173312370 edges, 72419 markings/sec, 300 secs
lola: 19914034 markings, 176116341 edges, 69596 markings/sec, 305 secs
lola: 20234092 markings, 178883945 edges, 64012 markings/sec, 310 secs
lola: 20544582 markings, 181470034 edges, 62098 markings/sec, 315 secs
lola: 20868166 markings, 184213129 edges, 64717 markings/sec, 320 secs
lola: 21206160 markings, 187007219 edges, 67599 markings/sec, 325 secs
lola: 21608374 markings, 189779005 edges, 80443 markings/sec, 330 secs
lola: 21965619 markings, 192591049 edges, 71449 markings/sec, 335 secs
lola: 22349968 markings, 195378280 edges, 76870 markings/sec, 340 secs
lola: 22720466 markings, 198201284 edges, 74100 markings/sec, 345 secs
lola: 23050838 markings, 201014476 edges, 66074 markings/sec, 350 secs
lola: 23400090 markings, 203773312 edges, 69850 markings/sec, 355 secs
lola: 23760152 markings, 206576681 edges, 72012 markings/sec, 360 secs
lola: 24137722 markings, 209365937 edges, 75514 markings/sec, 365 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 24377133 markings, 211280412 edges
lola: ========================================
lola: subprocess 7 will run for 455 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p96 <= 0) OR (p105 <= 0) OR (p18 <= 0) OR (p92 <= 0) OR ((1 <= p116) AND (1 <= p118)) OR ((1 <= p21) AND ((p8 <= 0) OR (p28 <= 0) OR (p116 <= 0) OR (p118 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p96 <= 0) OR (p105 <= 0) OR (p18 <= 0) OR (p92 <= 0) OR ((1 <= p116) AND (1 <= p118)) OR ((1 <= p21) AND ((p8 <= 0) OR (p28 <= 0) OR (p116 <= 0) OR (p118 <= 0))))))
lola: processed formula length: 180
lola: 52 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 15 markings, 14 edges
lola: ========================================
lola: subprocess 8 will run for 531 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p21))))
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))
lola: processed formula length: 12
lola: 53 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 26 markings, 25 edges
lola: ========================================
lola: subprocess 9 will run for 638 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((p18 <= 0) OR (p92 <= 0) OR (p2 <= 0) OR (p114 <= 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: ((p18 <= 0) OR (p92 <= 0) OR (p2 <= 0) OR (p114 <= 0))
lola: processed formula length: 57
lola: 53 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
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:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p18) AND (1 <= p92) AND (1 <= p2) AND (1 <= p114))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-9-0.sara
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: ((p18 <= 0) OR (p92 <= 0) OR (p2 <= 0) OR (p114 <= 0))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 4 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-9-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-9-1.sara.
sara: error: :607: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: sara is running 0 secs || sara is running 0 secs || 442493 markings, 3434920 edges, 88499 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 888360 markings, 6731971 edges, 89173 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 1317504 markings, 10049517 edges, 85829 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 1714266 markings, 13211220 edges, 79352 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 2118709 markings, 16559249 edges, 80889 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 2492390 markings, 19815216 edges, 74736 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 2862958 markings, 23028480 edges, 74114 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 3234824 markings, 26241210 edges, 74373 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 3582779 markings, 29325329 edges, 69591 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 3964394 markings, 32567542 edges, 76323 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 4343180 markings, 35855193 edges, 75757 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 4737954 markings, 38973957 edges, 78955 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 5130746 markings, 42183873 edges, 78558 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 5513283 markings, 45372510 edges, 76507 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 5852476 markings, 48518455 edges, 67839 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 6193547 markings, 51507453 edges, 68214 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 6540570 markings, 54615071 edges, 69405 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 6903360 markings, 57844118 edges, 72558 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 7278930 markings, 61031314 edges, 75114 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 7661689 markings, 64095062 edges, 76552 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 8016746 markings, 67063401 edges, 71011 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 8402883 markings, 70129093 edges, 77227 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 8734938 markings, 73230618 edges, 66411 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 9078690 markings, 76214691 edges, 68750 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 9404634 markings, 79126785 edges, 65189 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 9741326 markings, 82217282 edges, 67338 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 10076841 markings, 85303928 edges, 67103 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 10404352 markings, 88411504 edges, 65502 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 10739555 markings, 91391043 edges, 67041 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 11060270 markings, 94438340 edges, 64143 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 11411587 markings, 97519698 edges, 70263 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 11713211 markings, 100614645 edges, 60325 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 12025178 markings, 103625661 edges, 62393 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 12315414 markings, 106552469 edges, 58047 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 12622753 markings, 109595123 edges, 61468 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 12934265 markings, 112642032 edges, 62302 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 13294415 markings, 115847068 edges, 72030 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 13630625 markings, 118995165 edges, 67242 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 13989875 markings, 122060639 edges, 71850 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 14321399 markings, 125030720 edges, 66305 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 14654933 markings, 128195214 edges, 66707 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 15015634 markings, 131310858 edges, 72140 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 15365850 markings, 134469924 edges, 70043 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 15676561 markings, 137625715 edges, 62142 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 15973322 markings, 140744770 edges, 59352 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 16290243 markings, 143884204 edges, 63384 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 16590598 markings, 146821546 edges, 60071 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 16890679 markings, 149746101 edges, 60016 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 17204798 markings, 152810194 edges, 62824 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 17511344 markings, 155933991 edges, 61309 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 17814752 markings, 159044949 edges, 60682 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 18114728 markings, 162143917 edges, 59995 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 18514171 markings, 165212329 edges, 79889 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 18902370 markings, 168200419 edges, 77640 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 19284516 markings, 171157998 edges, 76429 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 19681832 markings, 174162833 edges, 79463 markings/sec, 275 secs
lola: sara is running 280 secs || sara is running 280 secs || 20029867 markings, 177161757 edges, 69607 markings/sec, 280 secs
lola: sara is running 285 secs || sara is running 285 secs || 20378199 markings, 180053965 edges, 69666 markings/sec, 285 secs
lola: sara is running 290 secs || sara is running 290 secs || 20717691 markings, 182934647 edges, 67898 markings/sec, 290 secs
lola: sara is running 295 secs || sara is running 295 secs || 21062396 markings, 185894499 edges, 68941 markings/sec, 295 secs
lola: sara is running 300 secs || sara is running 300 secs || 21489637 markings, 188911401 edges, 85448 markings/sec, 300 secs
lola: sara is running 305 secs || sara is running 305 secs || 21885907 markings, 191974684 edges, 79254 markings/sec, 305 secs
lola: sara is running 310 secs || sara is running 310 secs || 22307548 markings, 195090707 edges, 84328 markings/sec, 310 secs
lola: sara is running 315 secs || sara is running 315 secs || 22720555 markings, 198202179 edges, 82601 markings/sec, 315 secs
lola: sara is running 320 secs || sara is running 320 secs || 23090857 markings, 201323484 edges, 74060 markings/sec, 320 secs
lola: sara is running 325 secs || sara is running 325 secs || 23480310 markings, 204373362 edges, 77891 markings/sec, 325 secs
lola: sara is running 330 secs || sara is running 330 secs || 23878995 markings, 207469531 edges, 79737 markings/sec, 330 secs
lola: sara is running 335 secs || sara is running 335 secs || 24279970 markings, 210541168 edges, 80195 markings/sec, 335 secs
lola: sara is running 340 secs || sara is running 340 secs || 24639384 markings, 213492316 edges, 71883 markings/sec, 340 secs
lola: sara is running 345 secs || sara is running 345 secs || 25011730 markings, 216533079 edges, 74469 markings/sec, 345 secs
lola: sara is running 350 secs || sara is running 350 secs || 25426302 markings, 219569085 edges, 82914 markings/sec, 350 secs
lola: sara is running 355 secs || sara is running 355 secs || 25816827 markings, 222645504 edges, 78105 markings/sec, 355 secs
lola: sara is running 360 secs || sara is running 360 secs || 26173873 markings, 225678369 edges, 71409 markings/sec, 360 secs
lola: sara is running 365 secs || sara is running 365 secs || 26528642 markings, 228771002 edges, 70954 markings/sec, 365 secs
lola: sara is running 370 secs || sara is running 370 secs || 26894808 markings, 231827527 edges, 73233 markings/sec, 370 secs
lola: sara is running 375 secs || sara is running 375 secs || 27260174 markings, 234897658 edges, 73073 markings/sec, 375 secs
lola: sara is running 380 secs || sara is running 380 secs || 27593025 markings, 237929707 edges, 66570 markings/sec, 380 secs
lola: sara is running 385 secs || sara is running 385 secs || 27967165 markings, 241002567 edges, 74828 markings/sec, 385 secs
lola: sara is running 390 secs || sara is running 390 secs || 28287012 markings, 244005357 edges, 63969 markings/sec, 390 secs
lola: sara is running 395 secs || sara is running 395 secs || 28582729 markings, 246942482 edges, 59143 markings/sec, 395 secs
lola: sara is running 400 secs || sara is running 400 secs || 28894238 markings, 249864709 edges, 62302 markings/sec, 400 secs
lola: sara is running 405 secs || sara is running 405 secs || 29213586 markings, 252854936 edges, 63870 markings/sec, 405 secs
lola: sara is running 410 secs || sara is running 410 secs || 29597888 markings, 255848689 edges, 76860 markings/sec, 410 secs
lola: sara is running 415 secs || sara is running 415 secs || 29938348 markings, 258788165 edges, 68092 markings/sec, 415 secs
lola: sara is running 420 secs || sara is running 420 secs || 30303608 markings, 261841726 edges, 73052 markings/sec, 420 secs
lola: sara is running 425 secs || sara is running 425 secs || 30662685 markings, 264842540 edges, 71815 markings/sec, 425 secs
lola: sara is running 430 secs || sara is running 430 secs || 30995861 markings, 267873109 edges, 66635 markings/sec, 430 secs
lola: sara is running 435 secs || sara is running 435 secs || 31307280 markings, 270850229 edges, 62284 markings/sec, 435 secs
lola: sara is running 440 secs || sara is running 440 secs || 31654995 markings, 273863244 edges, 69543 markings/sec, 440 secs
lola: sara is running 445 secs || sara is running 445 secs || 32001220 markings, 276887253 edges, 69245 markings/sec, 445 secs
lola: sara is running 450 secs || sara is running 450 secs || 32352524 markings, 279879175 edges, 70261 markings/sec, 450 secs
lola: sara is running 455 secs || sara is running 455 secs || 32676304 markings, 282791282 edges, 64756 markings/sec, 455 secs
lola: sara is running 460 secs || sara is running 460 secs || 32980220 markings, 285748660 edges, 60783 markings/sec, 460 secs
lola: sara is running 465 secs || sara is running 465 secs || 33340006 markings, 288744516 edges, 71957 markings/sec, 465 secs
lola: sara is running 470 secs || sara is running 470 secs || 33672619 markings, 291671466 edges, 66523 markings/sec, 470 secs
lola: sara is running 475 secs || sara is running 475 secs || 34016551 markings, 294683371 edges, 68786 markings/sec, 475 secs
lola: sara is running 480 secs || sara is running 480 secs || 34318037 markings, 297601836 edges, 60297 markings/sec, 480 secs
lola: sara is running 485 secs || sara is running 485 secs || 34629773 markings, 300619297 edges, 62347 markings/sec, 485 secs
lola: sara is running 490 secs || sara is running 490 secs || 34948703 markings, 303606182 edges, 63786 markings/sec, 490 secs
lola: sara is running 495 secs || sara is running 495 secs || 35260307 markings, 306580849 edges, 62321 markings/sec, 495 secs
lola: sara is running 500 secs || sara is running 500 secs || 35565838 markings, 309536300 edges, 61106 markings/sec, 500 secs
lola: sara is running 505 secs || sara is running 505 secs || 35862084 markings, 312482470 edges, 59249 markings/sec, 505 secs
lola: sara is running 510 secs || sara is running 510 secs || 36180542 markings, 315437157 edges, 63692 markings/sec, 510 secs
lola: sara is running 515 secs || sara is running 515 secs || 36454870 markings, 318334719 edges, 54866 markings/sec, 515 secs
lola: sara is running 520 secs || sara is running 520 secs || 36715671 markings, 321164046 edges, 52160 markings/sec, 520 secs
lola: sara is running 525 secs || sara is running 525 secs || 36985474 markings, 323984159 edges, 53961 markings/sec, 525 secs
lola: sara is running 530 secs || sara is running 530 secs || 37265629 markings, 326897218 edges, 56031 markings/sec, 530 secs
lola: sara is running 535 secs || sara is running 535 secs || 37614640 markings, 329857626 edges, 69802 markings/sec, 535 secs
lola: sara is running 540 secs || sara is running 540 secs || 37974354 markings, 332912756 edges, 71943 markings/sec, 540 secs
lola: sara is running 545 secs || sara is running 545 secs || 38322713 markings, 335999595 edges, 69672 markings/sec, 545 secs
lola: sara is running 550 secs || sara is running 550 secs || 38645032 markings, 338995346 edges, 64464 markings/sec, 550 secs
lola: sara is running 555 secs || sara is running 555 secs || 38961778 markings, 342108504 edges, 63349 markings/sec, 555 secs
lola: sara is running 560 secs || sara is running 560 secs || 39348034 markings, 345199965 edges, 77251 markings/sec, 560 secs
lola: sara is running 565 secs || sara is running 565 secs || 39704576 markings, 348202809 edges, 71308 markings/sec, 565 secs
lola: sara is running 570 secs || sara is running 570 secs || 40058630 markings, 351143481 edges, 70811 markings/sec, 570 secs
lola: sara is running 575 secs || sara is running 575 secs || 40418576 markings, 354186003 edges, 71989 markings/sec, 575 secs
lola: sara is running 580 secs || sara is running 580 secs || 40775275 markings, 357293718 edges, 71340 markings/sec, 580 secs
lola: sara is running 585 secs || sara is running 585 secs || 41153257 markings, 360424951 edges, 75596 markings/sec, 585 secs
lola: sara is running 590 secs || sara is running 590 secs || 41530886 markings, 363512229 edges, 75526 markings/sec, 590 secs
lola: sara is running 595 secs || sara is running 595 secs || 41899261 markings, 366607396 edges, 73675 markings/sec, 595 secs
lola: sara is running 600 secs || sara is running 600 secs || 42249812 markings, 369611856 edges, 70110 markings/sec, 600 secs
lola: sara is running 605 secs || sara is running 605 secs || 42606191 markings, 372702973 edges, 71276 markings/sec, 605 secs
lola: sara is running 610 secs || sara is running 610 secs || 42949715 markings, 375715952 edges, 68705 markings/sec, 610 secs
lola: sara is running 615 secs || sara is running 615 secs || 43297997 markings, 378707486 edges, 69656 markings/sec, 615 secs
lola: sara is running 620 secs || sara is running 620 secs || 43606002 markings, 381634322 edges, 61601 markings/sec, 620 secs
lola: sara is running 625 secs || sara is running 625 secs || 43889643 markings, 384495290 edges, 56728 markings/sec, 625 secs
lola: sara is running 630 secs || sara is running 630 secs || 44173618 markings, 387323836 edges, 56795 markings/sec, 630 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown no unknown unknown unknown yes no unknown no yes yes no no yes
lola: memory consumption: 1801944 KB
lola: time consumption: 1017 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: time limit reached - aborting
lola:
preliminary result: unknown no unknown unknown unknown yes no unknown no yes yes no no yes
lola:
preliminary result: unknown no unknown unknown unknown yes no unknown no yes yes no no yes
lola: memory consumption: 58492 KB
lola: time consumption: 3570 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: 16427488 kB
MemFree: 16087936 kB
After kill :
MemTotal: 16427488 kB
MemFree: 16087936 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="DES-PT-01a"
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 DES-PT-01a, 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 r180-ebro-158987899800196"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-01a.tgz
mv DES-PT-01a 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 '
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 ;