About the Execution of ITS-LoLa for PolyORBLF-PT-S06J04T08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15744.210 | 3600000.00 | 718192.00 | 228.40 | FTTTTFFTTFFFFFTF | 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-158987872000523.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 PolyORBLF-PT-S06J04T08, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987872000523
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 21M
-rw-r--r-- 1 mcc users 6.9K Apr 12 05:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 12 05:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 57K Apr 11 05:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 193K Apr 11 05:28 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 15K Apr 14 12:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 14 12:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 10 12:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 54K Apr 10 12:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 252K Apr 9 18:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 796K Apr 9 18:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.1K Apr 10 22:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.5K 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 10 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 19M 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 PolyORBLF-PT-S06J04T08-CTLCardinality-00
FORMULA_NAME PolyORBLF-PT-S06J04T08-CTLCardinality-01
FORMULA_NAME PolyORBLF-PT-S06J04T08-CTLCardinality-02
FORMULA_NAME PolyORBLF-PT-S06J04T08-CTLCardinality-03
FORMULA_NAME PolyORBLF-PT-S06J04T08-CTLCardinality-04
FORMULA_NAME PolyORBLF-PT-S06J04T08-CTLCardinality-05
FORMULA_NAME PolyORBLF-PT-S06J04T08-CTLCardinality-06
FORMULA_NAME PolyORBLF-PT-S06J04T08-CTLCardinality-07
FORMULA_NAME PolyORBLF-PT-S06J04T08-CTLCardinality-08
FORMULA_NAME PolyORBLF-PT-S06J04T08-CTLCardinality-09
FORMULA_NAME PolyORBLF-PT-S06J04T08-CTLCardinality-10
FORMULA_NAME PolyORBLF-PT-S06J04T08-CTLCardinality-11
FORMULA_NAME PolyORBLF-PT-S06J04T08-CTLCardinality-12
FORMULA_NAME PolyORBLF-PT-S06J04T08-CTLCardinality-13
FORMULA_NAME PolyORBLF-PT-S06J04T08-CTLCardinality-14
FORMULA_NAME PolyORBLF-PT-S06J04T08-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1591160710114
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 05:05:12] [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-03 05:05:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 05:05:14] [INFO ] Load time of PNML (sax parser for PT used): 1038 ms
[2020-06-03 05:05:14] [INFO ] Transformed 810 places.
[2020-06-03 05:05:14] [INFO ] Transformed 14014 transitions.
[2020-06-03 05:05:14] [INFO ] Parsed PT model containing 810 places and 14014 transitions in 1187 ms.
Ensure Unique test removed 10760 transitions
Reduce redundant transitions removed 10760 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 394 ms.
Incomplete random walk after 100000 steps, including 651 resets, run finished after 1323 ms. (steps per millisecond=75 ) properties seen :[0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0]
[2020-06-03 05:05:15] [INFO ] Flow matrix only has 3206 transitions (discarded 48 similar events)
// Phase 1: matrix 3206 rows 810 cols
[2020-06-03 05:05:16] [INFO ] Computed 58 place invariants in 387 ms
[2020-06-03 05:05:16] [INFO ] [Real]Absence check using 17 positive place invariants in 41 ms returned unsat
[2020-06-03 05:05:17] [INFO ] [Real]Absence check using 17 positive place invariants in 59 ms returned sat
[2020-06-03 05:05:17] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 190 ms returned unsat
[2020-06-03 05:05:17] [INFO ] [Real]Absence check using 17 positive place invariants in 27 ms returned unsat
[2020-06-03 05:05:17] [INFO ] [Real]Absence check using 17 positive place invariants in 29 ms returned sat
[2020-06-03 05:05:17] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 96 ms returned unsat
[2020-06-03 05:05:17] [INFO ] [Real]Absence check using 17 positive place invariants in 25 ms returned sat
[2020-06-03 05:05:17] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 47 ms returned unsat
[2020-06-03 05:05:18] [INFO ] [Real]Absence check using 17 positive place invariants in 27 ms returned sat
[2020-06-03 05:05:18] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 69 ms returned unsat
[2020-06-03 05:05:18] [INFO ] [Real]Absence check using 17 positive place invariants in 15 ms returned unsat
[2020-06-03 05:05:18] [INFO ] [Real]Absence check using 17 positive place invariants in 21 ms returned sat
[2020-06-03 05:05:18] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 71 ms returned sat
[2020-06-03 05:05:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:05:31] [INFO ] [Real]Absence check using state equation in 12833 ms returned sat
[2020-06-03 05:05:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:05:31] [INFO ] [Nat]Absence check using 17 positive place invariants in 69 ms returned sat
[2020-06-03 05:05:31] [INFO ] [Nat]Absence check using 17 positive and 41 generalized place invariants in 82 ms returned sat
[2020-06-03 05:05:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:05:44] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 05:05:45] [INFO ] [Nat]Absence check using state equation in 13484 ms returned sat
[2020-06-03 05:05:45] [INFO ] State equation strengthened by 232 read => feed constraints.
[2020-06-03 05:05:45] [INFO ] [Nat]Added 232 Read/Feed constraints in 478 ms returned sat
[2020-06-03 05:05:46] [INFO ] Deduced a trap composed of 86 places in 347 ms
[2020-06-03 05:05:46] [INFO ] Deduced a trap composed of 86 places in 225 ms
[2020-06-03 05:05:46] [INFO ] Deduced a trap composed of 85 places in 144 ms
[2020-06-03 05:05:47] [INFO ] Deduced a trap composed of 86 places in 128 ms
[2020-06-03 05:05:47] [INFO ] Deduced a trap composed of 87 places in 122 ms
[2020-06-03 05:05:47] [INFO ] Deduced a trap composed of 85 places in 122 ms
[2020-06-03 05:05:48] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2720 ms
[2020-06-03 05:05:48] [INFO ] Computed and/alt/rep : 3248/59090/3200 causal constraints in 307 ms.
[2020-06-03 05:05:51] [INFO ] Added : 10 causal constraints over 2 iterations in 3032 ms. Result :(error "Failed to check-sat")
[2020-06-03 05:05:51] [INFO ] [Real]Absence check using 17 positive place invariants in 29 ms returned sat
[2020-06-03 05:05:51] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 44 ms returned unsat
[2020-06-03 05:05:51] [INFO ] [Real]Absence check using 17 positive place invariants in 30 ms returned sat
[2020-06-03 05:05:51] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 90 ms returned sat
[2020-06-03 05:05:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:06:03] [INFO ] [Real]Absence check using state equation in 12071 ms returned sat
[2020-06-03 05:06:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:06:04] [INFO ] [Nat]Absence check using 17 positive place invariants in 39 ms returned sat
[2020-06-03 05:06:04] [INFO ] [Nat]Absence check using 17 positive and 41 generalized place invariants in 96 ms returned sat
[2020-06-03 05:06:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:06:23] [INFO ] [Nat]Absence check using state equation in 19785 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 05:06:24] [INFO ] [Real]Absence check using 17 positive place invariants in 26 ms returned sat
[2020-06-03 05:06:24] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 50 ms returned unsat
[2020-06-03 05:06:24] [INFO ] [Real]Absence check using 17 positive place invariants in 26 ms returned sat
[2020-06-03 05:06:24] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 70 ms returned unsat
[2020-06-03 05:06:24] [INFO ] [Real]Absence check using 17 positive place invariants in 18 ms returned unsat
[2020-06-03 05:06:24] [INFO ] [Real]Absence check using 17 positive place invariants in 17 ms returned unsat
[2020-06-03 05:06:24] [INFO ] [Real]Absence check using 17 positive place invariants in 16 ms returned unsat
[2020-06-03 05:06:24] [INFO ] [Real]Absence check using 17 positive place invariants in 27 ms returned sat
[2020-06-03 05:06:24] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 21 ms returned unsat
[2020-06-03 05:06:25] [INFO ] [Real]Absence check using 17 positive place invariants in 25 ms returned sat
[2020-06-03 05:06:25] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 39 ms returned unsat
Successfully simplified 15 atomic propositions for a total of 15 simplifications.
[2020-06-03 05:06:25] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-06-03 05:06:25] [INFO ] Flatten gal took : 455 ms
[2020-06-03 05:06:26] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-06-03 05:06:26] [INFO ] Flatten gal took : 272 ms
FORMULA PolyORBLF-PT-S06J04T08-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T08-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T08-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T08-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T08-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T08-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T08-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T08-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 05:06:26] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2020-06-03 05:06:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 37 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ PolyORBLF-PT-S06J04T08 @ 3570 seconds
FORMULA PolyORBLF-PT-S06J04T08-CTLCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S06J04T08-CTLCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S06J04T08-CTLCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S06J04T08-CTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S06J04T08-CTLCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S06J04T08-CTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S06J04T08-CTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S06J04T08-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3200
rslt: Output for CTLCardinality @ PolyORBLF-PT-S06J04T08
{
"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",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 05:06:26 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 430
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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((3 <= p139 + p141 + p228 + p262 + p468 + p643 + p801 + p562))",
"processed_size": 64,
"rewrites": 20
},
"net":
{
"conflict_clusters": 307,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 492
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 56,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 56,
"visible_transitions": 0
},
"processed": "(p6 + p119 + p120 + p122 + p129 + p157 + p167 + p169 + p194 + p224 + p237 + p242 + p244 + p281 + p295 + p316 + p399 + p402 + p424 + p435 + p449 + p453 + p478 + p505 + p521 + p540 + p568 + p575 + p578 + p612 + p616 + p618 + p624 + p631 + p665 + p675 + p711 + p59 + p752 + p770 + p53 + p798 + p802 + p803 + p50 + p34 + p87 + p92 <= p183 + p333 + p386 + p547 + p603 + p623 + p744 + p11)",
"processed_size": 383,
"rewrites": 21
},
"result":
{
"edges": 92,
"markings": 93,
"produced_by": "state space /EXEG",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 56
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 574
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 13,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "E (F ((p422 + p496 + p596 + p686 + p19 + 1 <= p2 + p150 + p223 + p304 + p398 + p522 + p595 + p26)))",
"processed_size": 99,
"rewrites": 20
},
"result":
{
"edges": 2799794,
"markings": 1787963,
"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": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 640
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"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": 14,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "A (G ((p178 + p302 + p427 + p454 + p556 + p654 + p765 + p83 <= p230 + p300 + p328 + p584 + p652 + p67)))",
"processed_size": 104,
"rewrites": 21
},
"result":
{
"edges": 79,
"markings": 80,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 800
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p520 <= p49)",
"processed_size": 13,
"rewrites": 22
},
"result":
{
"edges": 93,
"markings": 94,
"produced_by": "state space /EFEG",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability_of_possible_preservation",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1067
},
"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": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "E (G ((p230 + p300 + p328 + p584 + p652 + p67 <= p403)))",
"processed_size": 56,
"rewrites": 20
},
"result":
{
"edges": 16662,
"markings": 5297,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 176
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1600
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 13,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "E (G ((p8 + p152 + p334 + p462 + p607 + p620 + p789 + p48 <= p149 + p311 + p772 + p28 + p62)))",
"processed_size": 94,
"rewrites": 20
},
"result":
{
"edges": 4501,
"markings": 2661,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 96
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3200
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3200
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p149)",
"processed_size": 11,
"rewrites": 19
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((p729 <= p292)))",
"processed_size": 22,
"rewrites": 21
},
"result":
{
"edges": 11,
"markings": 12,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p149)",
"processed_size": 11,
"rewrites": 19
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (G ((p351 <= p101)))",
"processed_size": 22,
"rewrites": 20
},
"result":
{
"edges": 93,
"markings": 94,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 96
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 90056,
"runtime": 370.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(G(**)) : E(G(*)) : E(F(*)) : A(G(**)) : A(X(**)) : E(X(E(G(**)))) : E(F(E(G(**)))) : (A(G(**)) OR (E(G(**)) OR **))"
},
"net":
{
"arcs": 19908,
"conflict_clusters": 307,
"places": 810,
"places_significant": 752,
"singleton_clusters": 0,
"transitions": 3254
},
"result":
{
"preliminary_value": "yes yes yes no no yes yes yes ",
"value": "yes yes yes no no yes 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: 4064/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 25920
lola: finding significant places
lola: 810 places, 3254 transitions, 752 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: E (G ((p230 + p300 + p328 + p584 + p652 + p67 <= p403))) : NOT(A (F ((p149 + p311 + p772 + p28 + p62 + 1 <= p8 + p152 + p334 + p462 + p607 + p620 + p789 + p48)))) : NOT(A (G ((p2 + p150 + p223 + p304 + p398 + p522 + p595 + p26 <= p422 + p496 + p596 + p686 + p19)))) : E (((1 <= 0) U A (G ((p178 + p302 + p427 + p454 + p556 + p654 + p765 + p83 <= p230 + p300 + p328 + p584 + p652 + p67))))) : (A (X ((3 <= p139 + p141 + p228 + p262 + p468 + p643 + p801 + p562))) OR E ((((p5 + p138 + p145 + p297 + p360 + p489 + p601 + p728 <= p335) OR (3 <= p128 + p303 + p357 + p502 + p608 + p742 + p759 + p17)) U (1 <= 0)))) : (E (X (E (G ((p6 + p119 + p120 + p122 + p129 + p157 + p167 + p169 + p194 + p224 + p237 + p242 + p244 + p281 + p295 + p316 + p399 + p402 + p424 + p435 + p449 + p453 + p478 + p505 + p521 + p540 + p568 + p575 + p578 + p612 + p616 + p618 + p624 + p631 + p665 + p675 + p711 + p59 + p752 + p770 + p53 + p798 + p802 + p803 + p50 + p34 + p87 + p92 <= p183 + p333 + p386 + p547 + p603 + p623 + p744 + p11))))) OR E (G (E (G ((1 <= 0)))))) : E (F (E (G ((p520 <= p49))))) : ((A (G ((p729 <= p292))) OR E (G ((p351 <= p101)))) OR (1 <= p149))
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:183
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 430 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((3 <= p139 + p141 + p228 + p262 + p468 + p643 + p801 + p562)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((3 <= p139 + p141 + p228 + p262 + p468 + p643 + p801 + p562))
lola: processed formula length: 64
lola: 20 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 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: subprocess 1 will run for 492 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (G ((p6 + p119 + p120 + p122 + p129 + p157 + p167 + p169 + p194 + p224 + p237 + p242 + p244 + p281 + p295 + p316 + p399 + p402 + p424 + p435 + p449 + p453 + p478 + p505 + p521 + p540 + p568 + p575 + p578 + p612 + p616 + p618 + p624 + p631 + p665 + p675 + p711 + p59 + p752 + p770 + p53 + p798 + p802 + p803 + p50 + p34 + p87 + p92 <= p183 + p333 + p386 + p547 + p603 + p623 + p744 + p11)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: rewrite Frontend/Parser/formula_rewrite.k:715
lola: processed formula: (p6 + p119 + p120 + p122 + p129 + p157 + p167 + p169 + p194 + p224 + p237 + p242 + p244 + p281 + p295 + p316 + p399 + p402 + p424 + p435 + p449 + p453 + p478 + p505 + p521 + p540 + p568 + p575 + p578 + p612 + p616 + p618 + p624 + p631 + p665 + p675 + p711 + p59 + p752 + p770 + p53 + p798 + p802 + p803 + p50 + p34 + p87 + p92 <= p183 + p333 + p386 + p547 + p603 + p623 + p744 + p11)
lola: processed formula length: 383
lola: 21 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 /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p6 + p119 + p120 + p122 + p129 + p157 + p167 + p169 + p194 + p224 + p237 + p242 + p244 + p281 + p295 + p316 + p399 + p402 + p424 + p435 + p449 + p453 + p478 + p505 + p521 + p540 + p568 + p575 + p578 + p612 + p616 + p618 + p624 + p631 + p665 + p675 + p711 + p59 + p752 + p770 + p53 + p798 + p802 + p803 + p50 + p34 + p87 + p92 <= p183 + p333 + p386 + p547 + p603 + p623 + p744 + p11)
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 /EXEG
lola: The predicate is possibly preserved from some successor.
lola: 93 markings, 92 edges
lola: ========================================
lola: subprocess 2 will run for 574 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p422 + p496 + p596 + p686 + p19 + 1 <= p2 + p150 + p223 + p304 + p398 + p522 + p595 + p26)))
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 ((p422 + p496 + p596 + p686 + p19 + 1 <= p2 + p150 + p223 + p304 + p398 + p522 + p595 + p26)))
lola: processed formula length: 99
lola: 20 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: (p422 + p496 + p596 + p686 + p19 + 1 <= p2 + p150 + p223 + p304 + p398 + p522 + p595 + p26)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-2-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 36710 markings, 48091 edges, 7342 markings/sec, 0 secs
lola: sara is running 5 secs || 72983 markings, 92593 edges, 7255 markings/sec, 5 secs
lola: sara is running 10 secs || 107723 markings, 142436 edges, 6948 markings/sec, 10 secs
lola: sara is running 15 secs || 142289 markings, 199085 edges, 6913 markings/sec, 15 secs
lola: sara is running 20 secs || 177600 markings, 248362 edges, 7062 markings/sec, 20 secs
lola: sara is running 25 secs || 214889 markings, 302252 edges, 7458 markings/sec, 25 secs
lola: sara is running 30 secs || 251859 markings, 352769 edges, 7394 markings/sec, 30 secs
lola: sara is running 35 secs || 289243 markings, 402998 edges, 7477 markings/sec, 35 secs
lola: sara is running 40 secs || 326900 markings, 452093 edges, 7531 markings/sec, 40 secs
lola: sara is running 45 secs || 361011 markings, 499278 edges, 6822 markings/sec, 45 secs
lola: sara is running 50 secs || 395145 markings, 547243 edges, 6827 markings/sec, 50 secs
lola: sara is running 55 secs || 428076 markings, 595123 edges, 6586 markings/sec, 55 secs
lola: sara is running 60 secs || 462637 markings, 644180 edges, 6912 markings/sec, 60 secs
lola: sara is running 65 secs || 499136 markings, 699289 edges, 7300 markings/sec, 65 secs
lola: sara is running 70 secs || 534099 markings, 747446 edges, 6993 markings/sec, 70 secs
lola: sara is running 75 secs || 567441 markings, 792930 edges, 6668 markings/sec, 75 secs
lola: sara is running 80 secs || 605193 markings, 844463 edges, 7550 markings/sec, 80 secs
lola: sara is running 85 secs || 643661 markings, 894354 edges, 7694 markings/sec, 85 secs
lola: sara is running 90 secs || 681556 markings, 945547 edges, 7579 markings/sec, 90 secs
lola: sara is running 95 secs || 719352 markings, 998333 edges, 7559 markings/sec, 95 secs
lola: sara is running 100 secs || 757043 markings, 1051519 edges, 7538 markings/sec, 100 secs
lola: sara is running 105 secs || 794764 markings, 1105899 edges, 7544 markings/sec, 105 secs
lola: sara is running 110 secs || 832362 markings, 1162650 edges, 7520 markings/sec, 110 secs
lola: sara is running 115 secs || 870493 markings, 1214677 edges, 7626 markings/sec, 115 secs
lola: sara is running 120 secs || 908645 markings, 1266744 edges, 7630 markings/sec, 120 secs
lola: sara is running 125 secs || 946215 markings, 1318402 edges, 7514 markings/sec, 125 secs
lola: sara is running 130 secs || 983311 markings, 1378010 edges, 7419 markings/sec, 130 secs
lola: sara is running 135 secs || 1020541 markings, 1430288 edges, 7446 markings/sec, 135 secs
lola: sara is running 140 secs || 1057600 markings, 1486385 edges, 7412 markings/sec, 140 secs
lola: sara is running 145 secs || 1095566 markings, 1540724 edges, 7593 markings/sec, 145 secs
lola: sara is running 150 secs || 1133421 markings, 1597025 edges, 7571 markings/sec, 150 secs
lola: sara is running 155 secs || 1171024 markings, 1653692 edges, 7521 markings/sec, 155 secs
lola: sara is running 160 secs || 1208241 markings, 1712269 edges, 7443 markings/sec, 160 secs
lola: sara is running 165 secs || 1245642 markings, 1772857 edges, 7480 markings/sec, 165 secs
lola: sara is running 170 secs || 1283129 markings, 1831480 edges, 7497 markings/sec, 170 secs
lola: sara is running 175 secs || 1319667 markings, 1908074 edges, 7308 markings/sec, 175 secs
lola: sara is running 180 secs || 1356323 markings, 1983187 edges, 7331 markings/sec, 180 secs
lola: sara is running 185 secs || 1393579 markings, 2048864 edges, 7451 markings/sec, 185 secs
lola: sara is running 190 secs || 1430803 markings, 2117506 edges, 7445 markings/sec, 190 secs
lola: sara is running 195 secs || 1468400 markings, 2182361 edges, 7519 markings/sec, 195 secs
lola: sara is running 200 secs || 1505297 markings, 2251375 edges, 7379 markings/sec, 200 secs
lola: sara is running 205 secs || 1542269 markings, 2320297 edges, 7394 markings/sec, 205 secs
lola: sara is running 210 secs || 1579183 markings, 2389181 edges, 7383 markings/sec, 210 secs
lola: sara is running 215 secs || 1616050 markings, 2459582 edges, 7373 markings/sec, 215 secs
lola: sara is running 220 secs || 1652890 markings, 2530014 edges, 7368 markings/sec, 220 secs
lola: sara is running 225 secs || 1689585 markings, 2603834 edges, 7339 markings/sec, 225 secs
lola: sara is running 230 secs || 1726472 markings, 2673553 edges, 7377 markings/sec, 230 secs
lola: sara is running 235 secs || 1763187 markings, 2747799 edges, 7343 markings/sec, 235 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1787963 markings, 2799794 edges
lola: ========================================
lola: subprocess 3 will run for 640 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p178 + p302 + p427 + p454 + p556 + p654 + p765 + p83 <= p230 + p300 + p328 + p584 + p652 + p67)))
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 ((p178 + p302 + p427 + p454 + p556 + p654 + p765 + p83 <= p230 + p300 + p328 + p584 + p652 + p67)))
lola: processed formula length: 104
lola: 21 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: (p230 + p300 + p328 + p584 + p652 + p67 + 1 <= p178 + p302 + p427 + p454 + p556 + p654 + p765 + p83)
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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 80 markings, 79 edges
lola: ========================================
lola: subprocess 4 will run for 800 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((p520 <= p49)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:598
lola: rewrite Frontend/Parser/formula_rewrite.k:633
lola: rewrite Frontend/Parser/formula_rewrite.k:730
lola: processed formula: (p520 <= p49)
lola: processed formula length: 13
lola: 22 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 /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: 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: (p520 <= p49)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 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: (p49 + 1 <= p520)
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 /EFEG
lola: The predicate is possibly preserved from a reachable marking.
lola: 94 markings, 93 edges
lola: ========================================
lola: subprocess 5 will run for 1067 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p230 + p300 + p328 + p584 + p652 + p67 <= p403)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((p230 + p300 + p328 + p584 + p652 + p67 <= p403)))
lola: processed formula length: 56
lola: 20 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 / 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: (p403 + 1 <= p230 + p300 + p328 + p584 + p652 + p67)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to 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: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 5297 markings, 16662 edges
lola: ========================================
lola: subprocess 6 will run for 1600 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p8 + p152 + p334 + p462 + p607 + p620 + p789 + p48 <= p149 + p311 + p772 + p28 + p62)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((p8 + p152 + p334 + p462 + p607 + p620 + p789 + p48 <= p149 + p311 + p772 + p28 + p62)))
lola: processed formula length: 94
lola: 20 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 / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p149 + p311 + p772 + p28 + p62 + 1 <= p8 + p152 + p334 + p462 + p607 + p620 + p789 + p48)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-6-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 2661 markings, 4501 edges
lola: ========================================
lola: subprocess 7 will run for 3200 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((p729 <= p292))) OR (E (G ((p351 <= p101))) OR (1 <= p149)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 3200 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p149)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p149)
lola: processed formula length: 11
lola: 19 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: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p729 <= p292)))
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 ((p729 <= p292)))
lola: processed formula length: 22
lola: 21 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: (p292 + 1 <= p729)
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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 12 markings, 11 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (G ((p729 <= p292))) OR (E (G ((p351 <= p101))) OR (1 <= p149)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (1 <= p149)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p149)
lola: processed formula length: 11
lola: 19 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: ========================================
lola: ...considering subproblem: E (G ((p351 <= p101)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((p351 <= p101)))
lola: processed formula length: 22
lola: 20 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 / 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: (p101 + 1 <= p351)
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: 94 markings, 93 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes no no yes yes yes
lola:
preliminary result: yes yes yes no no yes yes yes
lola: memory consumption: 90056 KB
lola: time consumption: 370 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="PolyORBLF-PT-S06J04T08"
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 PolyORBLF-PT-S06J04T08, 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 r176-tajo-158987872000523"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S06J04T08.tgz
mv PolyORBLF-PT-S06J04T08 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 ;