About the Execution of ITS-LoLa for PolyORBNT-PT-S05J30
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15740.750 | 3600000.00 | 3628499.00 | 693.30 | ?TFT?TFT?FTFFFFF | 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.r176-tajo-158987872200644.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 PolyORBNT-PT-S05J30, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987872200644
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 11K Apr 12 06:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Apr 12 06:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 11 05:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 28K Apr 11 05:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 11K Apr 14 12:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 35K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 41K Apr 14 12:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 137K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 10 12:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 46K Apr 10 12:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 9 18:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K Apr 9 18:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 10 22:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 10 22:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 1.7M 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 PolyORBNT-PT-S05J30-CTLFireability-00
FORMULA_NAME PolyORBNT-PT-S05J30-CTLFireability-01
FORMULA_NAME PolyORBNT-PT-S05J30-CTLFireability-02
FORMULA_NAME PolyORBNT-PT-S05J30-CTLFireability-03
FORMULA_NAME PolyORBNT-PT-S05J30-CTLFireability-04
FORMULA_NAME PolyORBNT-PT-S05J30-CTLFireability-05
FORMULA_NAME PolyORBNT-PT-S05J30-CTLFireability-06
FORMULA_NAME PolyORBNT-PT-S05J30-CTLFireability-07
FORMULA_NAME PolyORBNT-PT-S05J30-CTLFireability-08
FORMULA_NAME PolyORBNT-PT-S05J30-CTLFireability-09
FORMULA_NAME PolyORBNT-PT-S05J30-CTLFireability-10
FORMULA_NAME PolyORBNT-PT-S05J30-CTLFireability-11
FORMULA_NAME PolyORBNT-PT-S05J30-CTLFireability-12
FORMULA_NAME PolyORBNT-PT-S05J30-CTLFireability-13
FORMULA_NAME PolyORBNT-PT-S05J30-CTLFireability-14
FORMULA_NAME PolyORBNT-PT-S05J30-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1591171701946
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 08:08:23] [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 08:08:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 08:08:23] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2020-06-03 08:08:23] [INFO ] Transformed 489 places.
[2020-06-03 08:08:23] [INFO ] Transformed 1400 transitions.
[2020-06-03 08:08:23] [INFO ] Parsed PT model containing 489 places and 1400 transitions in 173 ms.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 35 ms.
Incomplete random walk after 100000 steps, including 6944 resets, run finished after 910 ms. (steps per millisecond=109 ) properties seen :[1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0]
[2020-06-03 08:08:24] [INFO ] Flow matrix only has 741 transitions (discarded 4 similar events)
// Phase 1: matrix 741 rows 489 cols
[2020-06-03 08:08:24] [INFO ] Computed 82 place invariants in 52 ms
[2020-06-03 08:08:25] [INFO ] [Real]Absence check using 58 positive place invariants in 38 ms returned sat
[2020-06-03 08:08:25] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 22 ms returned unsat
[2020-06-03 08:08:25] [INFO ] [Real]Absence check using 58 positive place invariants in 24 ms returned sat
[2020-06-03 08:08:25] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 15 ms returned unsat
[2020-06-03 08:08:25] [INFO ] [Real]Absence check using 58 positive place invariants in 29 ms returned sat
[2020-06-03 08:08:25] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 26 ms returned sat
[2020-06-03 08:08:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 08:08:26] [INFO ] [Real]Absence check using state equation in 921 ms returned sat
[2020-06-03 08:08:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-03 08:08:26] [INFO ] [Real]Added 1 Read/Feed constraints in 17 ms returned sat
[2020-06-03 08:08:26] [INFO ] Computed and/alt/rep : 739/14232/735 causal constraints in 108 ms.
[2020-06-03 08:08:26] [INFO ] Added : 6 causal constraints over 2 iterations in 231 ms. Result :sat
[2020-06-03 08:08:26] [INFO ] [Real]Absence check using 58 positive place invariants in 30 ms returned sat
[2020-06-03 08:08:26] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 27 ms returned sat
[2020-06-03 08:08:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 08:08:27] [INFO ] [Real]Absence check using state equation in 974 ms returned sat
[2020-06-03 08:08:27] [INFO ] [Real]Added 1 Read/Feed constraints in 16 ms returned sat
[2020-06-03 08:08:28] [INFO ] Computed and/alt/rep : 739/14232/735 causal constraints in 85 ms.
[2020-06-03 08:08:28] [INFO ] Added : 6 causal constraints over 2 iterations in 264 ms. Result :sat
[2020-06-03 08:08:28] [INFO ] [Real]Absence check using 58 positive place invariants in 37 ms returned sat
[2020-06-03 08:08:28] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 28 ms returned sat
[2020-06-03 08:08:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 08:08:29] [INFO ] [Real]Absence check using state equation in 1089 ms returned sat
[2020-06-03 08:08:29] [INFO ] [Real]Added 1 Read/Feed constraints in 15 ms returned sat
[2020-06-03 08:08:29] [INFO ] Computed and/alt/rep : 739/14232/735 causal constraints in 86 ms.
[2020-06-03 08:08:29] [INFO ] Added : 6 causal constraints over 2 iterations in 228 ms. Result :sat
[2020-06-03 08:08:30] [INFO ] [Real]Absence check using 58 positive place invariants in 30 ms returned sat
[2020-06-03 08:08:30] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 28 ms returned sat
[2020-06-03 08:08:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 08:08:31] [INFO ] [Real]Absence check using state equation in 1013 ms returned sat
[2020-06-03 08:08:31] [INFO ] [Real]Added 1 Read/Feed constraints in 6 ms returned sat
[2020-06-03 08:08:31] [INFO ] Computed and/alt/rep : 739/14232/735 causal constraints in 69 ms.
[2020-06-03 08:08:31] [INFO ] Added : 6 causal constraints over 2 iterations in 184 ms. Result :sat
[2020-06-03 08:08:31] [INFO ] [Real]Absence check using 58 positive place invariants in 26 ms returned sat
[2020-06-03 08:08:31] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 23 ms returned unsat
[2020-06-03 08:08:31] [INFO ] [Real]Absence check using 58 positive place invariants in 24 ms returned sat
[2020-06-03 08:08:31] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 18 ms returned unsat
[2020-06-03 08:08:31] [INFO ] [Real]Absence check using 58 positive place invariants in 22 ms returned sat
[2020-06-03 08:08:31] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 19 ms returned sat
[2020-06-03 08:08:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 08:08:32] [INFO ] [Real]Absence check using state equation in 986 ms returned sat
[2020-06-03 08:08:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 08:08:32] [INFO ] [Nat]Absence check using 58 positive place invariants in 37 ms returned sat
[2020-06-03 08:08:32] [INFO ] [Nat]Absence check using 58 positive and 24 generalized place invariants in 28 ms returned sat
[2020-06-03 08:08:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 08:08:34] [INFO ] [Nat]Absence check using state equation in 1392 ms returned sat
[2020-06-03 08:08:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 33 ms returned sat
[2020-06-03 08:08:34] [INFO ] Computed and/alt/rep : 739/14232/735 causal constraints in 67 ms.
[2020-06-03 08:08:36] [INFO ] Added : 80 causal constraints over 16 iterations in 2353 ms. Result :sat
[2020-06-03 08:08:36] [INFO ] Deduced a trap composed of 14 places in 244 ms
[2020-06-03 08:08:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 558 ms
[2020-06-03 08:08:37] [INFO ] [Real]Absence check using 58 positive place invariants in 38 ms returned sat
[2020-06-03 08:08:37] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 26 ms returned unsat
[2020-06-03 08:08:37] [INFO ] [Real]Absence check using 58 positive place invariants in 31 ms returned sat
[2020-06-03 08:08:37] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 2 ms returned unsat
[2020-06-03 08:08:37] [INFO ] [Real]Absence check using 58 positive place invariants in 37 ms returned sat
[2020-06-03 08:08:37] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 3 ms returned unsat
[2020-06-03 08:08:37] [INFO ] [Real]Absence check using 58 positive place invariants in 35 ms returned sat
[2020-06-03 08:08:37] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 2 ms returned unsat
[2020-06-03 08:08:37] [INFO ] [Real]Absence check using 58 positive place invariants in 36 ms returned sat
[2020-06-03 08:08:37] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 3 ms returned unsat
[2020-06-03 08:08:37] [INFO ] [Real]Absence check using 58 positive place invariants in 38 ms returned sat
[2020-06-03 08:08:37] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 31 ms returned unsat
[2020-06-03 08:08:37] [INFO ] [Real]Absence check using 58 positive place invariants in 37 ms returned sat
[2020-06-03 08:08:37] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 18 ms returned unsat
[2020-06-03 08:08:38] [INFO ] [Real]Absence check using 58 positive place invariants in 37 ms returned sat
[2020-06-03 08:08:38] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 3 ms returned unsat
[2020-06-03 08:08:38] [INFO ] [Real]Absence check using 58 positive place invariants in 36 ms returned sat
[2020-06-03 08:08:38] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 6 ms returned unsat
[2020-06-03 08:08:38] [INFO ] [Real]Absence check using 58 positive place invariants in 45 ms returned sat
[2020-06-03 08:08:38] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 3 ms returned unsat
[2020-06-03 08:08:38] [INFO ] [Real]Absence check using 58 positive place invariants in 28 ms returned sat
[2020-06-03 08:08:38] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 2 ms returned unsat
[2020-06-03 08:08:38] [INFO ] [Real]Absence check using 58 positive place invariants in 35 ms returned sat
[2020-06-03 08:08:38] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 4 ms returned unsat
Successfully simplified 16 atomic propositions for a total of 17 simplifications.
[2020-06-03 08:08:38] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-06-03 08:08:38] [INFO ] Flatten gal took : 138 ms
[2020-06-03 08:08:38] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-06-03 08:08:38] [INFO ] Flatten gal took : 79 ms
FORMULA PolyORBNT-PT-S05J30-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J30-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J30-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J30-CTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J30-CTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J30-CTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J30-CTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 08:08:38] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 10 ms.
[2020-06-03 08:08:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 10 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ PolyORBNT-PT-S05J30 @ 3570 seconds
FORMULA PolyORBNT-PT-S05J30-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBNT-PT-S05J30-CTLFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBNT-PT-S05J30-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBNT-PT-S05J30-CTLFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBNT-PT-S05J30-CTLFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBNT-PT-S05J30-CTLFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 0
rslt: Output for CTLFireability @ PolyORBNT-PT-S05J30
{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=CTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 08:08:39 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 19
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 21
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 21
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 3,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "EG((EX(((10 <= p200) AND (1 <= p470))) OR EF(((p3 <= 0) OR (p470 <= 0)))))",
"processed_size": 75,
"rewrites": 24
},
"net":
{
"conflict_clusters": 114,
"singleton_clusters": 0
},
"result":
{
"edges": 19,
"markings": 13,
"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": 24
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 24
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((1 <= p60) AND (1 <= p327) AND (1 <= p448))",
"processed_size": 44,
"rewrites": 21
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 28
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "AX((((1 <= p40) AND (1 <= p200)) OR ((6 <= p78) AND (1 <= p84) AND (1 <= p282) AND (1 <= p337) AND (1 <= p345) AND (1 <= p426))))",
"processed_size": 130,
"rewrites": 22
},
"net":
{
"conflict_clusters": 114,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 28
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (G ((p221 <= 0)))",
"processed_size": 19,
"rewrites": 22
},
"result":
{
"edges": 12,
"markings": 13,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 156
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 34
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 31,
"adisj": 1,
"aneg": 1,
"comp": 93,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 93,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 33,
"visible_transitions": 0
},
"processed": "(((p60 <= 0) OR (p404 <= 0) OR (p448 <= 0)) AND ((p28 <= 0) OR (p60 <= 0) OR (p448 <= 0)) AND ((p60 <= 0) OR (p81 <= 0) OR (p448 <= 0)) AND ((p60 <= 0) OR (p341 <= 0) OR (p448 <= 0)) AND ((p60 <= 0) OR (p121 <= 0) OR (p448 <= 0)) AND ((p54 <= 0) OR (p60 <= 0) OR (p448 <= 0)) AND ((p60 <= 0) OR (p384 <= 0) OR (p448 <= 0)) AND ((p60 <= 0) OR (p155 <= 0) OR (p448 <= 0)) AND ((p60 <= 0) OR (p85 <= 0) OR (p448 <= 0)) AND ((p60 <= 0) OR (p327 <= 0) OR (p448 <= 0)) AND ((p24 <= 0) OR (p60 <= 0) OR (p448 <= 0)) AND ((p0 <= 0) OR (p60 <= 0) OR (p448 <= 0)) AND ((p60 <= 0) OR (p95 <= 0) OR (p448 <= 0)) AND ((p60 <= 0) OR (p120 <= 0) OR (p448 <= 0)) AND ((p60 <= 0) OR (p417 <= 0) OR (p448 <= 0)) AND ((p60 <= 0) OR (p353 <= 0) OR (p448 <= 0)) AND ((p60 <= 0) OR (p230 <= 0) OR (p448 <= 0)) AND ((p60 <= 0) OR (p172 <= 0) OR (p448 <= 0)) AND ((p60 <= 0) OR (p128 <= 0) OR (p448 <= 0)) AND ((p60 <= 0) OR (p309 <= 0) OR (p448 <= 0)) AND ((p58 <= 0) OR (p60 <= 0) OR (p448 <= 0)) AND ((p60 <= 0) OR (p431 <= 0) OR (p448 <= 0)) AND ((p60 <= 0) OR (p269 <= 0) OR (p448 <= 0)) AND ((p60 <= 0) OR (p324 <= 0) OR (p448 <= 0)) AND ((p60 <= 0) OR (p225 <= 0) OR (p448 <= 0)) AND ((p60 <= 0) OR (p435 <= 0) OR (p448 <= 0)) AND ((p60 <= 0) OR (p108 <= 0) OR (p448 <= 0)) AND ((p60 <= 0) OR (p314 <= 0) OR (p448 <= 0)) AND ((p41 <= 0) OR (p60 <= 0) OR (p448 <= 0)) AND ((p60 <= 0) OR (p308 <= 0) OR (p448 <= 0)) AND ((p60 <= 0) OR (p423 <= 0) OR (p448 <= 0)))",
"processed_size": 1506,
"rewrites": 24
},
"result":
{
"edges": 12,
"markings": 13,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 217
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 93,
"problems": 31
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 43
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 160,
"aneg": 0,
"comp": 326,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 326,
"taut": 0,
"tconj": 5,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 194,
"visible_transitions": 0
},
"processed": "EG(((((p427 <= 0) OR (p434 <= 0)) AND ((p192 <= 0) OR (p298 <= 0)) AND ((p315 <= 0) OR (p437 <= 0)) AND ((p82 <= 0) OR (p333 <= 0)) AND ((p247 <= 0) OR (p447 <= 0)) AND ((p294 <= 0) OR (p419 <= 0)) AND ((p46 <= 0) OR (p434 <= 0)) AND ((p222 <= 0) OR (p434 <= 0)) AND ((p125 <= 0) OR (p322 <= 0)) AND ((p39 <= 0) OR (p340 <= 0)) AND ((p458 <= 0) OR (p462 <= 0)) AND ((p79 <= 0) OR (p303 <= 0)) AND ((p37 <= 0) OR (p267 <= 0)) AND ((p162 <= 0) OR (p434 <= 0)) AND ((p159 <= 0) OR (p425 <= 0)) AND ((p369 <= 0) OR (p462 <= 0)) AND ((p355 <= 0) OR (p400 <= 0)) AND ((p146 <= 0) OR (p303 <= 0)) AND ((p245 <= 0) OR (p383 <= 0)) AND ((p383 <= 0) OR (p467 <= 0)) AND ((p177 <= 0) OR (p462 <= 0)) AND ((p372 <= 0) OR (p383 <= 0)) AND ((p101 <= 0) OR (p477 <= 0)) AND ((p271 <= 0) OR (p349 <= 0)) AND ((p299 <= 0) OR (p315 <= 0)) AND ((p109 <= 0) OR (p253 <= 0)) AND ((p102 <= 0) OR (p154 <= 0)) AND ((p74 <= 0) OR (p82 <= 0)) AND ((p7 <= 0) OR (p387 <= 0)) AND ((p176 <= 0) OR (p192 <= 0)) AND ((p199 <= 0) OR (p425 <= 0)) AND ((p29 <= 0) OR (p339 <= 0)) AND ((p174 <= 0) OR (p193 <= 0)) AND ((p113 <= 0) OR (p163 <= 0)) AND ((p147 <= 0) OR (p355 <= 0)) AND ((p351 <= 0) OR (p396 <= 0)) AND ((p288 <= 0) OR (p464 <= 0)) AND ((p16 <= 0) OR (p110 <= 0)) AND ((p248 <= 0) OR (p271 <= 0)) AND ((p247 <= 0) OR (p444 <= 0)) AND ((p101 <= 0) OR (p316 <= 0)) AND ((p50 <= 0) OR (p109 <= 0)) AND ((p88 <= 0) OR (p355 <= 0)) AND ((p178 <= 0) OR (p247 <= 0)) AND ((p226 <= 0) OR (p355 <= 0)) AND ((p130 <= 0) OR (p340 <= 0)) AND ((p36 <= 0) OR (p163 <= 0)) AND ((p110 <= 0) OR (p336 <= 0)) AND ((p139 <= 0) OR (p158 <= 0)) AND ((p294 <= 0) OR (p428 <= 0)) AND ((p185 <= 0) OR (p343 <= 0)) AND ((p425 <= 0) OR (p433 <= 0)) AND ((p72 <= 0) OR (p139 <= 0)) AND ((p234 <= 0) OR (p434 <= 0)) AND ((p114 <= 0) OR (p267 <= 0)) AND ((p193 <= 0) OR (p471 <= 0)) AND ((p82 <= 0) OR (p231 <= 0)) AND ((p288 <= 0) OR (p370 <= 0)) AND ((p22 <= 0) OR (p270 <= 0)) AND ((p101 <= 0) OR (p287 <= 0)) AND ((p218 <= 0) OR (p219 <= 0)) AND ((p45 <= 0) OR (p82 <= 0)) AND ((p77 <= 0) OR (p411 <= 0)) AND ((p255 <= 0) OR (p340 <= 0)) AND ((p22 <= 0) OR (p103 <= 0)) AND ((p29 <= 0) OR (p485 <= 0)) AND ((p185 <= 0) OR (p441 <= 0)) AND ((p7 <= 0) OR (p187 <= 0)) AND ((p173 <= 0) OR (p247 <= 0)) AND ((p98 <= 0) OR (p101 <= 0)) AND ((p140 <= 0) OR (p294 <= 0)) AND ((p22 <= 0) OR (p473 <= 0)) AND ((p219 <= 0) OR (p380 <= 0)) AND ((p239 <= 0) OR (p271 <= 0)) AND ((p5 <= 0) OR (p154 <= 0)) AND ((p63 <= 0) OR (p77 <= 0)) AND ((p7 <= 0) OR (p438 <= 0)) AND ((p101 <= 0) OR (p394 <= 0)) AND ((p322 <= 0) OR (p399 <= 0)) AND ((p154 <= 0) OR (p251 <= 0)) AND ((p149 <= 0) OR (p246 <= 0)) AND ((p77 <= 0) OR (p273 <= 0)) AND ((p126 <= 0) OR (p322 <= 0)) AND ((p192 <= 0) OR (p227 <= 0)) AND ((p51 <= 0) OR (p303 <= 0)) AND ((p29 <= 0) OR (p283 <= 0)) AND ((p139 <= 0) OR (p386 <= 0)) AND ((p91 <= 0) OR (p303 <= 0)) AND ((p20 <= 0) OR (p149 <= 0)) AND ((p340 <= 0) OR (p436 <= 0)) AND ((p80 <= 0) OR (p149 <= 0)) AND ((p139 <= 0) OR (p216 <= 0)) AND ((p247 <= 0) OR (p376 <= 0)) AND ((p293 <= 0) OR (p322 <= 0)) AND ((p280 <= 0) OR (p396 <= 0)) AND ((p143 <= 0) OR (p267 <= 0)) AND ((p315 <= 0) OR (p406 <= 0)) AND ((p209 <= 0) OR (p425 <= 0)) AND ((p237 <= 0) OR (p288 <= 0)) AND ((p149 <= 0) OR (p401 <= 0)) AND ((p183 <= 0) OR (p271 <= 0)) AND ((p29 <= 0) OR (p189 <= 0)) AND ((p22 <= 0) OR (p145 <= 0)) AND ((p288 <= 0) OR (p442 <= 0)) AND ((p267 <= 0) OR (p405 <= 0)) AND ((p313 <= 0) OR (p322 <= 0)) AND ((p110 <= 0) OR (p296 <= 0)) AND ((p116 <= 0) OR (p149 <= 0)) AND ((p185 <= 0) OR (p454 <= 0)) AND ((p193 <= 0) OR (p204 <= 0)) AND ((p154 <= 0) OR (p398 <= 0)) AND ((p163 <= 0) OR (p390 <= 0)) AND ((p168 <= 0) OR (p383 <= 0)) AND ((p243 <= 0) OR (p462 <= 0)) AND ((p29 <= 0) OR (p429 <= 0)) AND ((p385 <= 0) OR (p462 <= 0)) AND ((p82 <= 0) OR (p395 <= 0)) AND ((p185 <= 0) OR (p276 <= 0)) AND ((p109 <= 0) OR (p367 <= 0)) AND ((p105 <= 0) OR (p110 <= 0)) AND ((p10 <= 0) OR (p355 <= 0)) AND ((p9 <= 0) OR (p396 <= 0)) AND ((p94 <= 0) OR (p110 <= 0)) AND ((p219 <= 0) OR (p350 <= 0)) AND ((p232 <= 0) OR (p396 <= 0)) AND ((p192 <= 0) OR (p443 <= 0)) AND ((p64 <= 0) OR (p139 <= 0)) AND ((p99 <= 0) OR (p109 <= 0)) AND ((p107 <= 0) OR (p315 <= 0)) AND ((p193 <= 0) OR (p486 <= 0)) AND ((p215 <= 0) OR (p219 <= 0)) AND ((p193 <= 0) OR (p291 <= 0)) AND ((p87 <= 0) OR (p294 <= 0)) AND ((p18 <= 0) OR (p185 <= 0)) AND ((p206 <= 0) OR (p288 <= 0)) AND ((p186 <= 0) OR (p396 <= 0)) AND ((p318 <= 0) OR (p383 <= 0)) AND ((p303 <= 0) OR (p378 <= 0)) AND ((p109 <= 0) OR (p331 <= 0)) AND ((p192 <= 0) OR (p463 <= 0)) AND ((p70 <= 0) OR (p267 <= 0)) AND ((p2 <= 0) OR (p271 <= 0)) AND ((p52 <= 0) OR (p425 <= 0)) AND ((p62 <= 0) OR (p294 <= 0)) AND ((p13 <= 0) OR (p219 <= 0)) AND ((p7 <= 0) OR (p201 <= 0)) AND ((p265 <= 0) OR (p340 <= 0)) AND ((p127 <= 0) OR (p315 <= 0)) AND ((p77 <= 0) OR (p153 <= 0)) AND ((p17 <= 0) OR (p163 <= 0)) AND ((p7 <= 0) OR (p449 <= 0)) AND ((p163 <= 0) OR (p263 <= 0)) AND ((p77 <= 0) OR (p92 <= 0)) AND ((p22 <= 0) OR (p97 <= 0)) AND ((p124 <= 0) OR (p154 <= 0))) OR (EF((1 <= p15)) AND (((p78 <= 8) OR (p156 <= 0) OR (p426 <= 0)) AND (((p78 <= 8) OR (p282 <= 0) OR (p426 <= 0)) AND (((p78 <= 8) OR (p337 <= 0) OR (p426 <= 0)) AND (((p78 <= 8) OR (p84 <= 0) OR (p426 <= 0)) AND ((p78 <= 8) OR (p345 <= 0) OR (p426 <= 0)))))))))",
"processed_size": 5479,
"rewrites": 23
},
"net":
{
"conflict_clusters": 114,
"singleton_clusters": 0
},
"result":
{
"edges": 12,
"markings": 13,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"error": null,
"memory": 555292,
"runtime": 3570.000000,
"signal": null,
"timelimitreached": true
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E((E(F(**)) U **)) : E(G((E(X(**)) OR E(F(*))))) : E(G((** OR (E(F(**)) AND (** AND (** AND (** AND (** AND **)))))))) : E(F((A(G(*)) AND (E(G(**)) OR **)))) : E(G(**)) : A(F(**)) : E(G(E(F(**)))) : TRUE : (A(X(**)) OR **)"
},
"net":
{
"arcs": 3959,
"conflict_clusters": 114,
"places": 489,
"places_significant": 407,
"singleton_clusters": 0,
"transitions": 745
},
"result":
{
"interim_value": "unknown yes yes unknown yes no unknown yes no ",
"preliminary_value": "unknown yes yes unknown yes no unknown yes no "
},
"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: 1234/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 15648
lola: finding significant places
lola: 489 places, 745 transitions, 407 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLFireability.xml
lola: E ((E (F ((((1 <= p203) AND (1 <= p213)) OR ((1 <= p25) AND (1 <= p78) AND (1 <= p371) AND (1 <= p445)) OR ((1 <= p78) AND (1 <= p233) AND (1 <= p421) AND (1 <= p445)) OR ((1 <= p69) AND (1 <= p78) AND (1 <= p307) AND (1 <= p445)) OR ((1 <= p78) AND (1 <= p134) AND (1 <= p262) AND (1 <= p445)) OR ((1 <= p78) AND (1 <= p214) AND (1 <= p445) AND (1 <= p475))))) U ((1 <= p19) AND (1 <= p213)))) : E (G ((E (X (((10 <= p200) AND (1 <= p470)))) OR NOT(A (G (((1 <= p3) AND (1 <= p470)))))))) : E (G (((((p427 <= 0) OR (p434 <= 0)) AND ((p192 <= 0) OR (p298 <= 0)) AND ((p315 <= 0) OR (p437 <= 0)) AND ((p82 <= 0) OR (p333 <= 0)) AND ((p247 <= 0) OR (p447 <= 0)) AND ((p294 <= 0) OR (p419 <= 0)) AND ((p46 <= 0) OR (p434 <= 0)) AND ((p222 <= 0) OR (p434 <= 0)) AND ((p125 <= 0) OR (p322 <= 0)) AND ((p39 <= 0) OR (p340 <= 0)) AND ((p458 <= 0) OR (p462 <= 0)) AND ((p79 <= 0) OR (p303 <= 0)) AND ((p37 <= 0) OR (p267 <= 0)) AND ((p162 <= 0) OR (p434 <= 0)) AND ((p159 <= 0) OR (p425 <= 0)) AND ((p369 <= 0) OR (p462 <= 0)) AND ((p355 <= 0) OR (p400 <= 0)) AND ((p146 <= 0) OR (p303 <= 0)) AND ((p245 <= 0) OR (p383 <= 0)) AND ((p383 <= 0) OR (p467 <= 0)) AND ((p177 <= 0) OR (p462 <= 0)) AND ((p372 <= 0) OR (p383 <= 0)) AND ((p101 <= 0) OR (p477 <= 0)) AND ((p271 <= 0) OR (p349 <= 0)) AND ((p299 <= 0) OR (p315 <= 0)) AND ((p109 <= 0) OR (p253 <= 0)) AND ((p102 <= 0) OR (p154 <= 0)) AND ((p74 <= 0) OR (p82 <= 0)) AND ((p7 <= 0) OR (p387 <= 0)) AND ((p176 <= 0) OR (p192 <= 0)) AND ((p199 <= 0) OR (p425 <= 0)) AND ((p29 <= 0) OR (p339 <= 0)) AND ((p174 <= 0) OR (p193 <= 0)) AND ((p113 <= 0) OR (p163 <= 0)) AND ((p147 <= 0) OR (p355 <= 0)) AND ((p351 <= 0) OR (p396 <= 0)) AND ((p288 <= 0) OR (p464 <= 0)) AND ((p16 <= 0) OR (p110 <= 0)) AND ((p248 <= 0) OR (p271 <= 0)) AND ((p247 <= 0) OR (p444 <= 0)) AND ((p101 <= 0) OR (p316 <= 0)) AND ((p50 <= 0) OR (p109 <= 0)) AND ((p88 <= 0) OR (p355 <= 0)) AND ((p178 <= 0) OR (p247 <= 0)) AND ((p226 <= 0) OR (p355 <= 0)) AND ((p130 <= 0) OR (p340 <= 0)) AND ((p36 <= 0) OR (p163 <= 0)) AND ((p110 <= 0) OR (p336 <= 0)) AND ((p139 <= 0) OR (p158 <= 0)) AND ((p294 <= 0) OR (p428 <= 0)) AND ((p185 <= 0) OR (p343 <= 0)) AND ((p425 <= 0) OR (p433 <= 0)) AND ((p72 <= 0) OR (p139 <= 0)) AND ((p234 <= 0) OR (p434 <= 0)) AND ((p114 <= 0) OR (p267 <= 0)) AND ((p193 <= 0) OR (p471 <= 0)) AND ((p82 <= 0) OR (p231 <= 0)) AND ((p288 <= 0) OR (p370 <= 0)) AND ((p22 <= 0) OR (p270 <= 0)) AND ((p101 <= 0) OR (p287 <= 0)) AND ((p218 <= 0) OR (p219 <= 0)) AND ((p45 <= 0) OR (p82 <= 0)) AND ((p77 <= 0) OR (p411 <= 0)) AND ((p255 <= 0) OR (p340 <= 0)) AND ((p22 <= 0) OR (p103 <= 0)) AND ((p29 <= 0) OR (p485 <= 0)) AND ((p185 <= 0) OR (p441 <= 0)) AND ((p7 <= 0) OR (p187 <= 0)) AND ((p173 <= 0) OR (p247 <= 0)) AND ((p98 <= 0) OR (p101 <= 0)) AND ((p140 <= 0) OR (p294 <= 0)) AND ((p22 <= 0) OR (p473 <= 0)) AND ((p219 <= 0) OR (p380 <= 0)) AND ((p239 <= 0) OR (p271 <= 0)) AND ((p5 <= 0) OR (p154 <= 0)) AND ((p63 <= 0) OR (p77 <= 0)) AND ((p7 <= 0) OR (p438 <= 0)) AND ((p101 <= 0) OR (p394 <= 0)) AND ((p322 <= 0) OR (p399 <= 0)) AND ((p154 <= 0) OR (p251 <= 0)) AND ((p149 <= 0) OR (p246 <= 0)) AND ((p77 <= 0) OR (p273 <= 0)) AND ((p126 <= 0) OR (p322 <= 0)) AND ((p192 <= 0) OR (p227 <= 0)) AND ((p51 <= 0) OR (p303 <= 0)) AND ((p29 <= 0) OR (p283 <= 0)) AND ((p139 <= 0) OR (p386 <= 0)) AND ((p91 <= 0) OR (p303 <= 0)) AND ((p20 <= 0) OR (p149 <= 0)) AND ((p340 <= 0) OR (p436 <= 0)) AND ((p80 <= 0) OR (p149 <= 0)) AND ((p139 <= 0) OR (p216 <= 0)) AND ((p247 <= 0) OR (p376 <= 0)) AND ((p293 <= 0) OR (p322 <= 0)) AND ((p280 <= 0) OR (p396 <= 0)) AND ((p143 <= 0) OR (p267 <= 0)) AND ((p315 <= 0) OR (p406 <= 0)) AND ((p209 <= 0) OR (p425 <= 0)) AND ((p237 <= 0) OR (p288 <= 0)) AND ((p149 <= 0) OR (p401 <= 0)) AND ((p183 <= 0) OR (p271 <= 0)) AND ((p29 <= 0) OR (p189 <= 0)) AND ((p22 <= 0) OR (p145 <= 0)) AND ((p288 <= 0) OR (p442 <= 0)) AND ((p267 <= 0) OR (p405 <= 0)) AND ((p313 <= 0) OR (p322 <= 0)) AND ((p110 <= 0) OR (p296 <= 0)) AND ((p116 <= 0) OR (p149 <= 0)) AND ((p185 <= 0) OR (p454 <= 0)) AND ((p193 <= 0) OR (p204 <= 0)) AND ((p154 <= 0) OR (p398 <= 0)) AND ((p163 <= 0) OR (p390 <= 0)) AND ((p168 <= 0) OR (p383 <= 0)) AND ((p243 <= 0) OR (p462 <= 0)) AND ((p29 <= 0) OR (p429 <= 0)) AND ((p385 <= 0) OR (p462 <= 0)) AND ((p82 <= 0) OR (p395 <= 0)) AND ((p185 <= 0) OR (p276 <= 0)) AND ((p109 <= 0) OR (p367 <= 0)) AND ((p105 <= 0) OR (p110 <= 0)) AND ((p10 <= 0) OR (p355 <= 0)) AND ((p9 <= 0) OR (p396 <= 0)) AND ((p94 <= 0) OR (p110 <= 0)) AND ((p219 <= 0) OR (p350 <= 0)) AND ((p232 <= 0) OR (p396 <= 0)) AND ((p192 <= 0) OR (p443 <= 0)) AND ((p64 <= 0) OR (p139 <= 0)) AND ((p99 <= 0) OR (p109 <= 0)) AND ((p107 <= 0) OR (p315 <= 0)) AND ((p193 <= 0) OR (p486 <= 0)) AND ((p215 <= 0) OR (p219 <= 0)) AND ((p193 <= 0) OR (p291 <= 0)) AND ((p87 <= 0) OR (p294 <= 0)) AND ((p18 <= 0) OR (p185 <= 0)) AND ((p206 <= 0) OR (p288 <= 0)) AND ((p186 <= 0) OR (p396 <= 0)) AND ((p318 <= 0) OR (p383 <= 0)) AND ((p303 <= 0) OR (p378 <= 0)) AND ((p109 <= 0) OR (p331 <= 0)) AND ((p192 <= 0) OR (p463 <= 0)) AND ((p70 <= 0) OR (p267 <= 0)) AND ((p2 <= 0) OR (p271 <= 0)) AND ((p52 <= 0) OR (p425 <= 0)) AND ((p62 <= 0) OR (p294 <= 0)) AND ((p13 <= 0) OR (p219 <= 0)) AND ((p7 <= 0) OR (p201 <= 0)) AND ((p265 <= 0) OR (p340 <= 0)) AND ((p127 <= 0) OR (p315 <= 0)) AND ((p77 <= 0) OR (p153 <= 0)) AND ((p17 <= 0) OR (p163 <= 0)) AND ((p7 <= 0) OR (p449 <= 0)) AND ((p163 <= 0) OR (p263 <= 0)) AND ((p77 <= 0) OR (p92 <= 0)) AND ((p22 <= 0) OR (p97 <= 0)) AND ((p124 <= 0) OR (p154 <= 0))) OR (((((E (F ((1 <= p15))) AND ((p78 <= 8) OR (p156 <= 0) OR (p426 <= 0))) AND ((p78 <= 8) OR (p282 <= 0) OR (p426 <= 0))) AND ((p78 <= 8) OR (p337 <= 0) OR (p426 <= 0))) AND ((p78 <= 8) OR (p84 <= 0) OR (p426 <= 0))) AND ((p78 <= 8) OR (p345 <= 0) OR (p426 <= 0)))))) : E (F ((NOT(E (F ((1 <= p362)))) AND (E (G ((1 <= p238))) OR (2 <= p289))))) : E (G ((p221 <= 0))) : A (((0 <= 0) U (((1 <= p60) AND (1 <= p404) AND (1 <= p448)) OR ((1 <= p28) AND (1 <= p60) AND (1 <= p448)) OR ((1 <= p60) AND (1 <= p81) AND (1 <= p448)) OR ((1 <= p60) AND (1 <= p341) AND (1 <= p448)) OR ((1 <= p60) AND (1 <= p121) AND (1 <= p448)) OR ((1 <= p54) AND (1 <= p60) AND (1 <= p448)) OR ((1 <= p60) AND (1 <= p384) AND (1 <= p448)) OR ((1 <= p60) AND (1 <= p155) AND (1 <= p448)) OR ((1 <= p60) AND (1 <= p85) AND (1 <= p448)) OR ((1 <= p60) AND (1 <= p327) AND (1 <= p448)) OR ((1 <= p24) AND (1 <= p60) AND (1 <= p448)) OR ((1 <= p0) AND (1 <= p60) AND (1 <= p448)) OR ((1 <= p60) AND (1 <= p95) AND (1 <= p448)) OR ((1 <= p60) AND (1 <= p120) AND (1 <= p448)) OR ((1 <= p60) AND (1 <= p417) AND (1 <= p448)) OR ((1 <= p60) AND (1 <= p353) AND (1 <= p448)) OR ((1 <= p60) AND (1 <= p230) AND (1 <= p448)) OR ((1 <= p60) AND (1 <= p172) AND (1 <= p448)) OR ((1 <= p60) AND (1 <= p128) AND (1 <= p448)) OR ((1 <= p60) AND (1 <= p309) AND (1 <= p448)) OR ((1 <= p58) AND (1 <= p60) AND (1 <= p448)) OR ((1 <= p60) AND (1 <= p431) AND (1 <= p448)) OR ((1 <= p60) AND (1 <= p269) AND (1 <= p448)) OR ((1 <= p60) AND (1 <= p324) AND (1 <= p448)) OR ((1 <= p60) AND (1 <= p225) AND (1 <= p448)) OR ((1 <= p60) AND (1 <= p435) AND (1 <= p448)) OR ((1 <= p60) AND (1 <= p108) AND (1 <= p448)) OR ((1 <= p60) AND (1 <= p314) AND (1 <= p448)) OR ((1 <= p41) AND (1 <= p60) AND (1 <= p448)) OR ((1 <= p60) AND (1 <= p308) AND (1 <= p448)) OR ((1 <= p60) AND (1 <= p423) AND (1 <= p448))))) : E (G (E (F (((1 <= p55) AND (1 <= p106) AND (1 <= p264)))))) : E (G ((0 <= 0))) : (A (X ((((1 <= p40) AND (1 <= p200)) OR ((6 <= p78) AND (1 <= p84) AND (1 <= p282) AND (1 <= p337) AND (1 <= p345) AND (1 <= p426))))) OR ((1 <= p60) AND (1 <= p327) AND (1 <= p448)))
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 19 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 21 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 21 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((E (X (((10 <= p200) AND (1 <= p470)))) OR E (F (((p3 <= 0) OR (p470 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((EX(((10 <= p200) AND (1 <= p470))) OR EF(((p3 <= 0) OR (p470 <= 0)))))
lola: processed formula length: 75
lola: 24 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 13 markings, 19 edges
lola: ========================================
lola: subprocess 2 will run for 24 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X ((((1 <= p40) AND (1 <= p200)) OR ((6 <= p78) AND (1 <= p84) AND (1 <= p282) AND (1 <= p337) AND (1 <= p345) AND (1 <= p426))))) OR ((1 <= p60) AND (1 <= p327) AND (1 <= p448)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 24 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p60) AND (1 <= p327) AND (1 <= p448))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p60) AND (1 <= p327) AND (1 <= p448))
lola: processed formula length: 44
lola: 21 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 3 will run for 28 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((((1 <= p40) AND (1 <= p200)) OR ((6 <= p78) AND (1 <= p84) AND (1 <= p282) AND (1 <= p337) AND (1 <= p345) AND (1 <= p426)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((((1 <= p40) AND (1 <= p200)) OR ((6 <= p78) AND (1 <= p84) AND (1 <= p282) AND (1 <= p337) AND (1 <= p345) AND (1 <= p426))))
lola: processed formula length: 130
lola: 22 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 28 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p221 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((p221 <= 0)))
lola: processed formula length: 19
lola: 22 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: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 <= p221)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 13 markings, 12 edges
lola: ========================================
lola: subprocess 4 will run for 34 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p60) AND (1 <= p404) AND (1 <= p448)) OR ((1 <= p28) AND (1 <= p60) AND (1 <= p448)) OR ((1 <= p60) AND (1 <= p81) AND (1 <= p448)) OR ((1 <= p60) AND (1 <= p341) AND (1 <= p448)) OR ((1 <= p60) AND (1 <= p121) AND (1 <= p448)) OR ((1 <= p54) AND (1 <= p60) AND (1 <= p448)) OR ((1 <= p60) AND (1 <= p384) AND (1 <= p448)) OR ((1 <= p60) AND (1 <= p155) AND (1 <= p448)) OR ((1 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p60 <= 0) OR (p404 <= 0) OR (p448 <= 0)) AND ((p28 <= 0) OR (p60 <= 0) OR (p448 <= 0)) AND ((p60 <= 0) OR (p81 <= 0) OR (p448 <= 0)) AND ((p60 <= 0) OR (p341 <= 0) OR (p448 <= 0)) AND ((p60 <= 0) OR (p121 <= 0) OR (p448 <= 0)) AND ((p54 <= 0) OR (p60 <= 0) OR (p448 <= 0)) AND ((p60 <= 0) OR (p384 <= 0) OR (p448 <= 0)) AND ((p60 <= 0) OR (p155 <= 0) OR (p448 <= 0)) AND ((p60 <= 0... (shortened)
lola: processed formula length: 1506
lola: 24 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k: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 <= p60) AND (1 <= p404) AND (1 <= p448)) OR ((1 <= p28) AND (1 <= p60) AND (1 <= p448)) OR ((1 <= p60) AND (1 <= p81) AND (1 <= p448)) OR ((1 <= p60) AND (1 <= p341) AND (1 <= p448)) OR ((1 <= p60) AND (1 <= p121) AND (1 <= p448)) OR ((1 <= p54) AND (1 <= p60) AND (1 <= p448)) OR ((1 <= p60) AND (1 <= p384) AND (1 <= p448)) OR ((1 <= p60) AND (1 <= p155) AND (1 <= p448)) OR ((1 <= p60) AND (1 <= p85) AND (1 <= p448)) OR ((1 <= p60) AND (1 <= p327) AND (1 <= p448)) OR ((1 <= p24) AND (1 <= p60) AND (1 <= p448)) OR ((1 <= p0) AND (1 <= p60) AND (1 <= p448)) OR ((1 <= p60) AND (1 <= p95) AND (1 <= p448)) OR ((1 <= p60) AND (1 <= p120) AND (1 <= p448)) OR ((1 <= p60) AND (1 <= p417) AND (1 <= p448)) OR ((1 <= p60) AND (1 <= p353) AND (1 <= p448)) OR ((1 <= p60) AND (1 <= p230) AND (1 <= p448)) OR ((1 <= p60) AND (1 <= p172) AND (1 <= p448)) OR ((1 <= p60) AND (1 <= p128) AND (1 <= p448)) OR ((1 <= p60) AND (1 <= p309) AND (1 <= p448)) OR ((1 <= p58) AND (1 <= p60) AND (1 <= p448)) OR ((1 <= p60) AND (1 <= p431) AND (1 <= p448)) OR ((1 <= p60) AND (1 <= p269) AND (1 <= p448)) OR ((1 <= p60) AND (1 <= p324) AND (1 <= p448)) OR ((1 <= p60) AND (1 <= p225) AND (1 <= p448)) OR ((1 <= p60) AND (1 <= p435) AND (1 <= p448)) OR ((1 <= p60) AND (1 <= p108) AND (1 <= p448)) OR ((1 <= p60) AND (1 <= p314) AND (1 <= p448)) OR ((1 <= p41) AND (1 <= p60) AND (1 <= p448)) OR ((1 <= p60) AND (1 <= p308) AND (1 <= p448)) OR ((1 <= p60) AND (1 <= p423) AND (1 <= p448)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 93 literals and 31 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 13 markings, 12 edges
lola: ========================================
lola: subprocess 5 will run for 43 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (F ((((1 <= p203) AND (1 <= p213)) OR ((1 <= p25) AND (1 <= p78) AND (1 <= p371) AND (1 <= p445)) OR ((1 <= p78) AND (1 <= p233) AND (1 <= p421) AND (1 <= p445)) OR ((1 <= p69) AND (1 <= p78) AND (1 <= p307) AND (1 <= p445)) OR ((1 <= p78) AND (1 <= p134) AND (1 <= p262) AND (1 <= p445)) OR ((1 <= p78) AND (1 <= p214) AND (1 <= p445) AND (1 <= p475))))) U ((1 <= p19) AND (1 <= p213))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(EF((((1 <= p203) AND (1 <= p213)) OR ((1 <= p25) AND (1 <= p78) AND (1 <= p371) AND (1 <= p445)) OR ((1 <= p78) AND (1 <= p233) AND (1 <= p421) AND (1 <= p445)) OR ((1 <= p69) AND (1 <= p78) AND (1 <= p307) AND (1 <= p445)) OR ((1 <= p78) AND (1 <= p134) AND (1 <= p262) AND (1 <= p445)) OR ((1 <= p78) AND (1 <= p214) AND (1 <= p445) AND (1 <= p475)))) U ((1 <= p19) AND (1 <= p213)))
lola: processed formula length: 392
lola: 23 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: 577733 markings, 1534635 edges, 115547 markings/sec, 0 secs
lola: 1125483 markings, 3056092 edges, 109550 markings/sec, 5 secs
lola: 1652176 markings, 4543805 edges, 105339 markings/sec, 10 secs
lola: 2109875 markings, 5842094 edges, 91540 markings/sec, 15 secs
lola: 2670215 markings, 7355253 edges, 112068 markings/sec, 20 secs
lola: 3179469 markings, 8768614 edges, 101851 markings/sec, 25 secs
lola: 3664614 markings, 10155883 edges, 97029 markings/sec, 30 secs
lola: 4158341 markings, 11560751 edges, 98745 markings/sec, 35 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown yes unknown unknown yes no unknown yes no
lola: memory consumption: 1074728 KB
lola: time consumption: 3440 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 43 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((A (G ((p362 <= 0))) AND (E (G ((1 <= p238))) OR (2 <= p289)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((AG((p362 <= 0)) AND (EG((1 <= p238)) OR (2 <= p289))))
lola: processed formula length: 58
lola: 24 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 538168 markings, 1413803 edges, 107634 markings/sec, 0 secs
lola: 1096301 markings, 2977012 edges, 111627 markings/sec, 5 secs
lola: 1641809 markings, 4514914 edges, 109102 markings/sec, 10 secs
lola: 2168357 markings, 6010292 edges, 105310 markings/sec, 15 secs
lola: 2742676 markings, 7584167 edges, 114864 markings/sec, 20 secs
lola: 3286621 markings, 9051689 edges, 108789 markings/sec, 25 secs
lola: 3806412 markings, 10533452 edges, 103958 markings/sec, 30 secs
lola: 4345002 markings, 12033407 edges, 107718 markings/sec, 35 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown yes unknown unknown yes no unknown yes no
lola: memory consumption: 1092296 KB
lola: time consumption: 3483 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 43 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((((p427 <= 0) OR (p434 <= 0)) AND ((p192 <= 0) OR (p298 <= 0)) AND ((p315 <= 0) OR (p437 <= 0)) AND ((p82 <= 0) OR (p333 <= 0)) AND ((p247 <= 0) OR (p447 <= 0)) AND ((p294 <= 0) OR (p419 <= 0)) AND ((p46 <= 0) OR (p434 <= 0)) AND ((p222 <= 0) OR (p434 <= 0)) AND ((p125 <= 0) OR (p322 <= 0)) AND ((p39 <= 0) OR (p340 <= 0)) AND ((p458 <= 0) OR (p462 <= 0)) AND ((p79 <= 0) OR (p303... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(((((p427 <= 0) OR (p434 <= 0)) AND ((p192 <= 0) OR (p298 <= 0)) AND ((p315 <= 0) OR (p437 <= 0)) AND ((p82 <= 0) OR (p333 <= 0)) AND ((p247 <= 0) OR (p447 <= 0)) AND ((p294 <= 0) OR (p419 <= 0)) AND ((p46 <= 0) OR (p434 <= 0)) AND ((p222 <= 0) OR (p434 <= 0)) AND ((p125 <= 0) OR (p322 <= 0)) AND ((p39 <= 0) OR (p340 <= 0)) AND ((p458 <= 0) OR (p462 <= 0)) AND ((p79 <= 0) OR (p303 <=... (shortened)
lola: processed formula length: 5479
lola: 23 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: 13 markings, 12 edges
lola: ========================================
lola: subprocess 8 will run for 86 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F (((1 <= p55) AND (1 <= p106) AND (1 <= p264))))))
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 <= p55) AND (1 <= p106) AND (1 <= p264))
lola: processed formula length: 44
lola: 24 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /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: 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 <= p55) AND (1 <= p106) AND (1 <= p264))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
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: ((p55 <= 0) OR (p106 <= 0) OR (p264 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-8-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-8-1.sara.
lola: state equation: write sara problem file to CTLFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-8-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced
lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 580771 markings, 1542409 edges, 116154 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 1156253 markings, 3139472 edges, 115096 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 1713385 markings, 4704223 edges, 111426 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 2257446 markings, 6242085 edges, 108812 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 2820948 markings, 7832413 edges, 112700 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 3343041 markings, 9224960 edges, 104419 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 3819484 markings, 10568324 edges, 95289 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 4296524 markings, 11910913 edges, 95408 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 4774662 markings, 13289612 edges, 95628 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 5259099 markings, 14631222 edges, 96887 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 5761189 markings, 16008622 edges, 100418 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 6296924 markings, 17521042 edges, 107147 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 6818952 markings, 18996317 edges, 104406 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 7348597 markings, 20476414 edges, 105929 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 7812594 markings, 21818105 edges, 92799 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 8292146 markings, 23196400 edges, 95910 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 8763264 markings, 24543553 edges, 94224 markings/sec, 80 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown yes yes unknown yes no unknown yes no
lola: memory consumption: 1310980 KB
lola: time consumption: 3570 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E ((E (F ((((1 <= p203) AND (1 <= p213)) OR ((1 <= p25) AND (1 <= p78) AND (1 <= p371) AND (1 <= p445)) OR ((1 <= p78) AND (1 <= p233) AND (1 <= p421) AND (1 <= p445)) OR ((1 <= p69) AND (1 <= p78) AND (1 <= p307) AND (1 <= p445)) OR ((1 <= p78) AND (1 <= p134) AND (1 <= p262) AND (1 <= p445)) OR ((1 <= p78) AND (1 <= p214) AND (1 <= p445) AND (1 <= p475))))) U ((1 <= p19) AND (1 <= p213))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: time limit reached - aborting
lola:
preliminary result: unknown yes yes unknown yes no unknown yes no
lola:
preliminary result: unknown yes yes unknown yes no unknown yes no
lola: memory consumption: 555292 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: 16427456 kB
MemFree: 15584848 kB
After kill :
MemTotal: 16427456 kB
MemFree: 15584864 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="PolyORBNT-PT-S05J30"
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 PolyORBNT-PT-S05J30, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r176-tajo-158987872200644"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S05J30.tgz
mv PolyORBNT-PT-S05J30 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 ;