About the Execution of ITS-LoLa for EnergyBus-PT-none
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15742.460 | 3600000.00 | 550662.00 | 145.40 | FFTTFTFFTTFFFFTT | 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.r178-tajo-158987883201003.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 EnergyBus-PT-none, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987883201003
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.4M
-rw-r--r-- 1 mcc users 3.0K Apr 13 13:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 13 13:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 13 13:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 13 13:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 8 15:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 15:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Apr 13 13:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Apr 13 13:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 13 13:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 13 13:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 13 13:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 13 13:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 3.2M 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 EnergyBus-PT-none-CTLCardinality-00
FORMULA_NAME EnergyBus-PT-none-CTLCardinality-01
FORMULA_NAME EnergyBus-PT-none-CTLCardinality-02
FORMULA_NAME EnergyBus-PT-none-CTLCardinality-03
FORMULA_NAME EnergyBus-PT-none-CTLCardinality-04
FORMULA_NAME EnergyBus-PT-none-CTLCardinality-05
FORMULA_NAME EnergyBus-PT-none-CTLCardinality-06
FORMULA_NAME EnergyBus-PT-none-CTLCardinality-07
FORMULA_NAME EnergyBus-PT-none-CTLCardinality-08
FORMULA_NAME EnergyBus-PT-none-CTLCardinality-09
FORMULA_NAME EnergyBus-PT-none-CTLCardinality-10
FORMULA_NAME EnergyBus-PT-none-CTLCardinality-11
FORMULA_NAME EnergyBus-PT-none-CTLCardinality-12
FORMULA_NAME EnergyBus-PT-none-CTLCardinality-13
FORMULA_NAME EnergyBus-PT-none-CTLCardinality-14
FORMULA_NAME EnergyBus-PT-none-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1591257720461
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 08:02:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 08:02:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 08:02:03] [INFO ] Load time of PNML (sax parser for PT used): 284 ms
[2020-06-04 08:02:03] [INFO ] Transformed 157 places.
[2020-06-04 08:02:03] [INFO ] Transformed 4430 transitions.
[2020-06-04 08:02:03] [INFO ] Found NUPN structural information;
[2020-06-04 08:02:03] [INFO ] Parsed PT model containing 157 places and 4430 transitions in 406 ms.
Deduced a syphon composed of 4 places in 19 ms
Reduce places removed 4 places and 825 transitions.
Ensure Unique test removed 1692 transitions
Reduce redundant transitions removed 1692 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 91 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 1247 ms. (steps per millisecond=80 ) properties seen :[1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1]
[2020-06-04 08:02:04] [INFO ] Flow matrix only has 647 transitions (discarded 1266 similar events)
// Phase 1: matrix 647 rows 153 cols
[2020-06-04 08:02:04] [INFO ] Computed 23 place invariants in 22 ms
[2020-06-04 08:02:04] [INFO ] [Real]Absence check using 21 positive place invariants in 28 ms returned sat
[2020-06-04 08:02:04] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 2 ms returned sat
[2020-06-04 08:02:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 08:02:05] [INFO ] [Real]Absence check using state equation in 328 ms returned sat
[2020-06-04 08:02:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 08:02:05] [INFO ] [Nat]Absence check using 21 positive place invariants in 20 ms returned sat
[2020-06-04 08:02:05] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-06-04 08:02:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 08:02:05] [INFO ] [Nat]Absence check using state equation in 287 ms returned sat
[2020-06-04 08:02:05] [INFO ] State equation strengthened by 468 read => feed constraints.
[2020-06-04 08:02:05] [INFO ] [Nat]Added 468 Read/Feed constraints in 120 ms returned sat
[2020-06-04 08:02:06] [INFO ] Deduced a trap composed of 9 places in 618 ms
[2020-06-04 08:02:06] [INFO ] Deduced a trap composed of 5 places in 42 ms
[2020-06-04 08:02:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 766 ms
[2020-06-04 08:02:06] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 212 ms.
[2020-06-04 08:02:25] [INFO ] Added : 360 causal constraints over 72 iterations in 18669 ms. Result :unknown
[2020-06-04 08:02:25] [INFO ] [Real]Absence check using 21 positive place invariants in 17 ms returned sat
[2020-06-04 08:02:25] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 5 ms returned sat
[2020-06-04 08:02:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 08:02:25] [INFO ] [Real]Absence check using state equation in 283 ms returned sat
[2020-06-04 08:02:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 08:02:25] [INFO ] [Nat]Absence check using 21 positive place invariants in 14 ms returned unsat
[2020-06-04 08:02:25] [INFO ] [Real]Absence check using 21 positive place invariants in 17 ms returned sat
[2020-06-04 08:02:25] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 2 ms returned sat
[2020-06-04 08:02:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 08:02:26] [INFO ] [Real]Absence check using state equation in 286 ms returned sat
[2020-06-04 08:02:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 08:02:26] [INFO ] [Nat]Absence check using 21 positive place invariants in 48 ms returned sat
[2020-06-04 08:02:26] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-06-04 08:02:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 08:02:26] [INFO ] [Nat]Absence check using state equation in 313 ms returned sat
[2020-06-04 08:02:26] [INFO ] [Nat]Added 468 Read/Feed constraints in 131 ms returned sat
[2020-06-04 08:02:27] [INFO ] Deduced a trap composed of 5 places in 644 ms
[2020-06-04 08:02:28] [INFO ] Deduced a trap composed of 4 places in 857 ms
[2020-06-04 08:02:28] [INFO ] Deduced a trap composed of 9 places in 460 ms
[2020-06-04 08:02:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2137 ms
[2020-06-04 08:02:28] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 134 ms.
[2020-06-04 08:02:46] [INFO ] Added : 405 causal constraints over 81 iterations in 17339 ms. Result :unknown
[2020-06-04 08:02:46] [INFO ] [Real]Absence check using 21 positive place invariants in 19 ms returned sat
[2020-06-04 08:02:46] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 2 ms returned sat
[2020-06-04 08:02:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 08:02:46] [INFO ] [Real]Absence check using state equation in 256 ms returned sat
[2020-06-04 08:02:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 08:02:46] [INFO ] [Nat]Absence check using 21 positive place invariants in 39 ms returned sat
[2020-06-04 08:02:46] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-06-04 08:02:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 08:02:46] [INFO ] [Nat]Absence check using state equation in 336 ms returned sat
[2020-06-04 08:02:46] [INFO ] [Nat]Added 468 Read/Feed constraints in 81 ms returned sat
[2020-06-04 08:02:47] [INFO ] Deduced a trap composed of 5 places in 154 ms
[2020-06-04 08:02:47] [INFO ] Deduced a trap composed of 9 places in 148 ms
[2020-06-04 08:02:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 410 ms
[2020-06-04 08:02:47] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 252 ms.
[2020-06-04 08:03:06] [INFO ] Added : 415 causal constraints over 83 iterations in 19097 ms. Result :unknown
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-04 08:03:07] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-06-04 08:03:07] [INFO ] Flatten gal took : 479 ms
[2020-06-04 08:03:07] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-06-04 08:03:07] [INFO ] Flatten gal took : 253 ms
FORMULA EnergyBus-PT-none-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 08:03:07] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2020-06-04 08:03:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 54 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ EnergyBus-PT-none @ 3570 seconds
FORMULA EnergyBus-PT-none-CTLCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA EnergyBus-PT-none-CTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA EnergyBus-PT-none-CTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA EnergyBus-PT-none-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA EnergyBus-PT-none-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA EnergyBus-PT-none-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA EnergyBus-PT-none-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA EnergyBus-PT-none-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3337
rslt: Output for CTLCardinality @ EnergyBus-PT-none
{
"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=CTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 08:03:08 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"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": 10
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"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": "EF(AX((((1 <= p41)) AND ((p134 <= 0)))))",
"processed_size": 40,
"rewrites": 12
},
"net":
{
"conflict_clusters": 70,
"singleton_clusters": 0
},
"result":
{
"edges": 4204,
"markings": 1491,
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p132)) AND ((p30 <= 0)))))",
"processed_size": 40,
"rewrites": 11
},
"result":
{
"edges": 52,
"markings": 53,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p62)) AND ((p0 <= 0)))))",
"processed_size": 38,
"rewrites": 11
},
"result":
{
"edges": 5,
"markings": 6,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"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": "A (G ((((1 <= p99)) OR ((p144 <= 0)) OR ((1 <= p16)))))",
"processed_size": 57,
"rewrites": 12
},
"result":
{
"edges": 122512,
"markings": 26597,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G ((((p36 <= 0)) OR ((1 <= p57)) OR ((p128 <= 0)) OR ((1 <= p60)))))",
"processed_size": 74,
"rewrites": 12
},
"result":
{
"edges": 28725921,
"markings": 6740785,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1668
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1668
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((1 <= p44))",
"processed_size": 12,
"rewrites": 10
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3337
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"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": "A (G ((((p98 <= 0)) OR ((1 <= p146)))))",
"processed_size": 40,
"rewrites": 12
},
"result":
{
"edges": 255,
"markings": 136,
"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"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3337
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 6,
"adisj": 2,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "E (((((p4 <= 0)) OR ((1 <= p62)) OR ((1 <= p145))) U ((1 <= p48) AND (((p131 <= 0)) OR ((1 <= p32))))))",
"processed_size": 106,
"rewrites": 13
},
"result":
{
"edges": 4794,
"markings": 1636,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 9
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "existential_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"error": null,
"memory": 51608,
"runtime": 233.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(A(X(*)))) : E(F(**)) : TRUE : (A(G(**)) OR **) : A(G(**)) : A(G(**)) : E(F(**)) : E((** U **))"
},
"net":
{
"arcs": 26064,
"conflict_clusters": 70,
"places": 153,
"places_significant": 130,
"singleton_clusters": 0,
"transitions": 1913
},
"result":
{
"preliminary_value": "yes yes yes no no no yes yes ",
"value": "yes yes yes no no no yes yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 2066/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 153
lola: finding significant places
lola: 153 places, 1913 transitions, 130 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 CTLCardinality.xml
lola: LP says that atomic proposition is always true: (p134 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p146 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p57 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: LP says that atomic proposition is always true: (p145 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: NOT(A (G (E (X ((((p41 <= 0)) OR ((1 <= p134)))))))) : E (F ((((1 <= p132)) AND ((p30 <= 0))))) : E (G ((0 <= 0))) : (A (G ((((p98 <= 0)) OR ((1 <= p146))))) OR ((1 <= p44))) : A (G (E (G ((((p36 <= 0)) OR ((1 <= p57)) OR ((p128 <= 0)) OR ((1 <= p60))))))) : A (G (E (G ((((1 <= p99)) OR ((p144 <= 0)) OR ((1 <= p16))))))) : E (F ((((1 <= p62)) AND ((p0 <= 0))))) : E (((((p4 <= 0)) OR ((1 <= p62)) OR ((1 <= p145))) U ((1 <= p48) AND (((p131 <= 0)) OR ((1 <= p32))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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: rewrite Frontend/Parser/formula_rewrite.k:458
lola: rewrite Frontend/Parser/formula_rewrite.k:458
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 445 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: 10 rewrites
lola: closed formula file CTLCardinality.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 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((((1 <= p41)) AND ((p134 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(AX((((1 <= p41)) AND ((p134 <= 0)))))
lola: processed formula length: 40
lola: 12 rewrites
lola: closed formula file CTLCardinality.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: 1491 markings, 4204 edges
lola: ========================================
lola: subprocess 2 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p132)) AND ((p30 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((1 <= p132)) AND ((p30 <= 0)))))
lola: processed formula length: 40
lola: 11 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p132)) AND ((p30 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 53 markings, 52 edges
lola: ========================================
lola: subprocess 3 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p62)) AND ((p0 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((1 <= p62)) AND ((p0 <= 0)))))
lola: processed formula length: 38
lola: 11 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p62)) AND ((p0 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: ========================================
lola: subprocess 4 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= p99)) OR ((p144 <= 0)) OR ((1 <= p16)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((((1 <= p99)) OR ((p144 <= 0)) OR ((1 <= p16)))))
lola: processed formula length: 57
lola: 12 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p99 <= 0)) AND ((1 <= p144)) AND ((p16 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-4-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 26597 markings, 122512 edges
lola: ========================================
lola: subprocess 5 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p36 <= 0)) OR ((1 <= p57)) OR ((p128 <= 0)) OR ((1 <= p60)))))
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 ((((p36 <= 0)) OR ((1 <= p57)) OR ((p128 <= 0)) OR ((1 <= p60)))))
lola: processed formula length: 74
lola: 12 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p36)) AND ((p57 <= 0)) AND ((1 <= p128)) AND ((p60 <= 0)))
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 CTLCardinality-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-5-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 145320 markings, 550398 edges, 29064 markings/sec, 0 secs
lola: sara is running 5 secs || 290864 markings, 1146898 edges, 29109 markings/sec, 5 secs
lola: sara is running 10 secs || 441334 markings, 1761370 edges, 30094 markings/sec, 10 secs
lola: sara is running 15 secs || 591936 markings, 2380457 edges, 30120 markings/sec, 15 secs
lola: sara is running 20 secs || 742728 markings, 2991986 edges, 30158 markings/sec, 20 secs
lola: sara is running 25 secs || 892377 markings, 3587643 edges, 29930 markings/sec, 25 secs
lola: sara is running 30 secs || 1040052 markings, 4211420 edges, 29535 markings/sec, 30 secs
lola: sara is running 35 secs || 1188642 markings, 4819420 edges, 29718 markings/sec, 35 secs
lola: sara is running 40 secs || 1337238 markings, 5423434 edges, 29719 markings/sec, 40 secs
lola: sara is running 45 secs || 1488774 markings, 5979111 edges, 30307 markings/sec, 45 secs
lola: sara is running 50 secs || 1632678 markings, 6495451 edges, 28781 markings/sec, 50 secs
lola: sara is running 55 secs || 1782376 markings, 7088206 edges, 29940 markings/sec, 55 secs
lola: sara is running 60 secs || 1933005 markings, 7672523 edges, 30126 markings/sec, 60 secs
lola: sara is running 65 secs || 2083947 markings, 8251723 edges, 30188 markings/sec, 65 secs
lola: sara is running 70 secs || 2236068 markings, 8830939 edges, 30424 markings/sec, 70 secs
lola: sara is running 75 secs || 2387355 markings, 9418384 edges, 30257 markings/sec, 75 secs
lola: sara is running 80 secs || 2533442 markings, 10066619 edges, 29217 markings/sec, 80 secs
lola: sara is running 85 secs || 2682926 markings, 10671003 edges, 29897 markings/sec, 85 secs
lola: sara is running 90 secs || 2836126 markings, 11242328 edges, 30640 markings/sec, 90 secs
lola: sara is running 95 secs || 2983363 markings, 11885866 edges, 29447 markings/sec, 95 secs
lola: sara is running 100 secs || 3128741 markings, 12551470 edges, 29076 markings/sec, 100 secs
lola: sara is running 105 secs || 3280457 markings, 13143019 edges, 30343 markings/sec, 105 secs
lola: sara is running 110 secs || 3424592 markings, 13811402 edges, 28827 markings/sec, 110 secs
lola: sara is running 115 secs || 3568654 markings, 14471487 edges, 28812 markings/sec, 115 secs
lola: sara is running 120 secs || 3718970 markings, 15079440 edges, 30063 markings/sec, 120 secs
lola: sara is running 125 secs || 3856366 markings, 15663420 edges, 27479 markings/sec, 125 secs
lola: sara is running 130 secs || 4000345 markings, 16310811 edges, 28796 markings/sec, 130 secs
lola: sara is running 135 secs || 4147487 markings, 16951722 edges, 29428 markings/sec, 135 secs
lola: sara is running 140 secs || 4296241 markings, 17598749 edges, 29751 markings/sec, 140 secs
lola: sara is running 145 secs || 4445591 markings, 18232011 edges, 29870 markings/sec, 145 secs
lola: sara is running 150 secs || 4595487 markings, 18868035 edges, 29979 markings/sec, 150 secs
lola: sara is running 155 secs || 4744849 markings, 19510040 edges, 29872 markings/sec, 155 secs
lola: sara is running 160 secs || 4896175 markings, 20131776 edges, 30265 markings/sec, 160 secs
lola: sara is running 165 secs || 5046993 markings, 20756472 edges, 30164 markings/sec, 165 secs
lola: sara is running 170 secs || 5197585 markings, 21385713 edges, 30118 markings/sec, 170 secs
lola: sara is running 175 secs || 5350108 markings, 22017074 edges, 30505 markings/sec, 175 secs
lola: sara is running 180 secs || 5499805 markings, 22680977 edges, 29939 markings/sec, 180 secs
lola: sara is running 185 secs || 5641161 markings, 23379366 edges, 28271 markings/sec, 185 secs
lola: sara is running 190 secs || 5777868 markings, 24130073 edges, 27341 markings/sec, 190 secs
lola: sara is running 195 secs || 5917650 markings, 24875154 edges, 27956 markings/sec, 195 secs
lola: sara is running 200 secs || 6053948 markings, 25662440 edges, 27260 markings/sec, 200 secs
lola: sara is running 205 secs || 6194548 markings, 26506975 edges, 28120 markings/sec, 205 secs
lola: sara is running 210 secs || 6344549 markings, 27125207 edges, 30000 markings/sec, 210 secs
lola: sara is running 215 secs || 6493427 markings, 27750807 edges, 29776 markings/sec, 215 secs
lola: sara is running 220 secs || 6643181 markings, 28354329 edges, 29951 markings/sec, 220 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6740785 markings, 28725921 edges
lola: ========================================
lola: subprocess 6 will run for 1668 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((((p98 <= 0)) OR ((1 <= p146))))) OR ((1 <= p44)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 1668 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p44))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p44))
lola: processed formula length: 12
lola: 10 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 3337 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p98 <= 0)) OR ((1 <= p146)))))
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 ((((p98 <= 0)) OR ((1 <= p146)))))
lola: processed formula length: 40
lola: 12 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p98)) AND ((p146 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 136 markings, 255 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 3337 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((((p4 <= 0)) OR ((1 <= p62)) OR ((1 <= p145))) U ((1 <= p48) AND (((p131 <= 0)) OR ((1 <= p32))))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E (((((p4 <= 0)) OR ((1 <= p62)) OR ((1 <= p145))) U ((1 <= p48) AND (((p131 <= 0)) OR ((1 <= p32))))))
lola: processed formula length: 106
lola: 13 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p48) AND (((p131 <= 0)) OR ((1 <= p32))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-7-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 1636 markings, 4794 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes no no no yes yes
lola:
preliminary result: yes yes yes no no no yes yes
lola: memory consumption: 51608 KB
lola: time consumption: 233 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
rslt: finished
--------------------
content from stderr:
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="EnergyBus-PT-none"
export BK_EXAMINATION="CTLCardinality"
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 EnergyBus-PT-none, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r178-tajo-158987883201003"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/EnergyBus-PT-none.tgz
mv EnergyBus-PT-none execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;