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.r211-tajo-159033477800691.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 ShieldPPPt-PT-030B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033477800691
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 744K
-rw-r--r-- 1 mcc users 3.7K May 14 01:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 14 01:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 19:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 19:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 14 10:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 10:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 14 10:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.6K May 13 14:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 13 14:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 13 08:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 08:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 569K May 12 20:42 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 ShieldPPPt-PT-030B-CTLCardinality-00
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-01
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-02
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-03
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-04
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-05
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-06
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-07
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-08
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-09
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-10
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-11
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-12
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-13
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-14
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591321128887

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 01:38:51] [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-05 01:38:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 01:38:51] [INFO ] Load time of PNML (sax parser for PT used): 150 ms
[2020-06-05 01:38:51] [INFO ] Transformed 2343 places.
[2020-06-05 01:38:51] [INFO ] Transformed 2133 transitions.
[2020-06-05 01:38:51] [INFO ] Found NUPN structural information;
[2020-06-05 01:38:51] [INFO ] Parsed PT model containing 2343 places and 2133 transitions in 307 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 105 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 614 ms. (steps per millisecond=162 ) properties seen :[1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1]
// Phase 1: matrix 2133 rows 2343 cols
[2020-06-05 01:38:52] [INFO ] Computed 331 place invariants in 65 ms
[2020-06-05 01:38:53] [INFO ] [Real]Absence check using 331 positive place invariants in 368 ms returned sat
[2020-06-05 01:38:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 01:39:03] [INFO ] [Real]Absence check using state equation in 10057 ms returned sat
[2020-06-05 01:39:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 01:39:04] [INFO ] [Nat]Absence check using 331 positive place invariants in 510 ms returned sat
[2020-06-05 01:39:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 01:39:13] [INFO ] [Nat]Absence check using state equation in 9525 ms returned sat
[2020-06-05 01:39:15] [INFO ] Deduced a trap composed of 17 places in 1430 ms
[2020-06-05 01:39:17] [INFO ] Deduced a trap composed of 18 places in 1800 ms
[2020-06-05 01:39:19] [INFO ] Deduced a trap composed of 20 places in 2245 ms
[2020-06-05 01:39:21] [INFO ] Deduced a trap composed of 19 places in 1588 ms
[2020-06-05 01:39:22] [INFO ] Deduced a trap composed of 21 places in 1135 ms
[2020-06-05 01:39:24] [INFO ] Deduced a trap composed of 21 places in 1474 ms
[2020-06-05 01:39:24] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2189 s2190 s2191 s2192 s2193 s2194 s2195 s2207 s2209 s2212 s2256 s2257 s2258 s2259 s2260 s2261 s2262 s2263 s2264) 0)") while checking expression at index 0
[2020-06-05 01:39:24] [INFO ] [Real]Absence check using 331 positive place invariants in 364 ms returned sat
[2020-06-05 01:39:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 01:39:43] [INFO ] [Real]Absence check using state equation in 18933 ms returned sat
[2020-06-05 01:39:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 01:39:44] [INFO ] [Nat]Absence check using 331 positive place invariants in 661 ms returned sat
[2020-06-05 01:39:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 01:39:53] [INFO ] [Nat]Absence check using state equation in 9221 ms returned sat
[2020-06-05 01:39:55] [INFO ] Deduced a trap composed of 22 places in 1198 ms
[2020-06-05 01:39:56] [INFO ] Deduced a trap composed of 21 places in 1122 ms
[2020-06-05 01:40:00] [INFO ] Deduced a trap composed of 28 places in 4251 ms
[2020-06-05 01:40:02] [INFO ] Deduced a trap composed of 22 places in 1703 ms
[2020-06-05 01:40:03] [INFO ] Deduced a trap composed of 30 places in 1225 ms
[2020-06-05 01:40:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s1265 s1266 s1267 s1268 s1269 s1270 s1290 s1397 s1398 s1399 s1400 s1401 s1402 s1403 s1404 s1405) 0)") while checking expression at index 1
[2020-06-05 01:40:05] [INFO ] [Real]Absence check using 331 positive place invariants in 783 ms returned sat
[2020-06-05 01:40:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 01:40:23] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 01:40:23] [INFO ] [Real]Absence check using state equation in 18705 ms returned (error "Failed to check-sat")
[2020-06-05 01:40:24] [INFO ] [Real]Absence check using 331 positive place invariants in 496 ms returned sat
[2020-06-05 01:40:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 01:40:34] [INFO ] [Real]Absence check using state equation in 9749 ms returned sat
[2020-06-05 01:40:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 01:40:35] [INFO ] [Nat]Absence check using 331 positive place invariants in 667 ms returned sat
[2020-06-05 01:40:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 01:40:54] [INFO ] [Nat]Absence check using state equation in 18882 ms returned sat
[2020-06-05 01:41:01] [INFO ] Deduced a trap composed of 24 places in 7232 ms
[2020-06-05 01:41:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s1760 s1761 s1762 s1763 s1764 s1765 s1766 s1767 s1768 s1804 s1805 s1806 s1807 s1808 s1809 s1810 s1822) 0)") while checking expression at index 3
[2020-06-05 01:41:04] [INFO ] [Real]Absence check using 331 positive place invariants in 1870 ms returned sat
[2020-06-05 01:41:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 01:41:18] [INFO ] [Real]Absence check using state equation in 14645 ms returned sat
[2020-06-05 01:41:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 01:41:19] [INFO ] [Nat]Absence check using 331 positive place invariants in 542 ms returned sat
[2020-06-05 01:41:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 01:41:30] [INFO ] [Nat]Absence check using state equation in 10171 ms returned sat
[2020-06-05 01:41:39] [INFO ] Deduced a trap composed of 22 places in 9601 ms
[2020-06-05 01:41:39] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2189 s2190 s2191 s2192 s2193 s2194 s2214 s2277 s2278 s2279 s2282 s2283 s2291 s2292 s2293 s2294 s2295 s2297 s2323 s2329) 0)") while checking expression at index 4
[2020-06-05 01:41:40] [INFO ] [Real]Absence check using 331 positive place invariants in 500 ms returned sat
[2020-06-05 01:41:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 01:41:56] [INFO ] [Real]Absence check using state equation in 16104 ms returned sat
[2020-06-05 01:41:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 01:41:57] [INFO ] [Nat]Absence check using 331 positive place invariants in 697 ms returned sat
[2020-06-05 01:41:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 01:42:13] [INFO ] [Nat]Absence check using state equation in 15133 ms returned sat
[2020-06-05 01:42:14] [INFO ] Deduced a trap composed of 23 places in 1535 ms
[2020-06-05 01:42:23] [INFO ] Deduced a trap composed of 24 places in 9280 ms
[2020-06-05 01:42:23] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s1727 s1728 s1729 s1730 s1731 s1732 s1752 s1859 s1860 s1861 s1862 s1863 s1864 s1865 s1866 s1867) 0)") while checking expression at index 5
[2020-06-05 01:42:24] [INFO ] [Real]Absence check using 331 positive place invariants in 464 ms returned sat
[2020-06-05 01:42:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 01:42:34] [INFO ] [Real]Absence check using state equation in 9395 ms returned sat
[2020-06-05 01:42:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 01:42:35] [INFO ] [Nat]Absence check using 331 positive place invariants in 733 ms returned sat
[2020-06-05 01:42:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 01:42:44] [INFO ] [Nat]Absence check using state equation in 9059 ms returned sat
[2020-06-05 01:42:45] [INFO ] Deduced a trap composed of 18 places in 1191 ms
[2020-06-05 01:42:57] [INFO ] Deduced a trap composed of 16 places in 11827 ms
[2020-06-05 01:42:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s2266 s2267 s2284 s2285 s2286 s2289 s2290 s2291 s2292 s2293 s2294 s2295 s2332 s2341 s2342) 0)") while checking expression at index 6
[2020-06-05 01:42:58] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-06-05 01:42:58] [INFO ] Flatten gal took : 195 ms
[2020-06-05 01:42:58] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-06-05 01:42:58] [INFO ] Flatten gal took : 79 ms
FORMULA ShieldPPPt-PT-030B-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-05 01:42:58] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2020-06-05 01:42:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 17 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ ShieldPPPt-PT-030B @ 3570 seconds

FORMULA ShieldPPPt-PT-030B-CTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-030B-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-030B-CTLCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-030B-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-030B-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-030B-CTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-030B-CTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-030B-CTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-030B-CTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3550
rslt: Output for CTLCardinality @ ShieldPPPt-PT-030B

{
"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": "Fri Jun 5 01:42:58 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 394
},
"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": 17
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 443
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "(((p572 <= 0)) OR ((1 <= p65)))",
"processed_size": 32,
"rewrites": 17
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 507
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "(((p226 <= 0)) OR ((1 <= p926)))",
"processed_size": 33,
"rewrites": 20
},
"result":
{
"edges": 1463,
"markings": 1464,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 591
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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": "EX(((1 <= p1342)))",
"processed_size": 18,
"rewrites": 18
},
"net":
{
"conflict_clusters": 1923,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 507
},
"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 <= p125)) AND ((p1483 <= 0)))))",
"processed_size": 42,
"rewrites": 18
},
"result":
{
"edges": 750,
"markings": 751,
"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": 591
},
"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 ((((p941 <= 0)) OR ((1 <= p864)))))",
"processed_size": 41,
"rewrites": 19
},
"result":
{
"edges": 666,
"markings": 667,
"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": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 710
},
"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 <= p1304)) AND ((p61 <= 0)))))",
"processed_size": 41,
"rewrites": 18
},
"result":
{
"edges": 594,
"markings": 595,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 887
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"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": "E (G ((((p2001 <= 0)) OR ((1 <= p530)))))",
"processed_size": 42,
"rewrites": 18
},
"result":
{
"edges": 4155,
"markings": 4136,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1183
},
"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 <= p1479))",
"processed_size": 14,
"rewrites": 17
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1775
},
"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 ((((p1295 <= 0)) OR ((1 <= p849)))))",
"processed_size": 42,
"rewrites": 19
},
"result":
{
"edges": 467,
"markings": 468,
"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": 1775
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1775
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 7,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "((((1 <= p2006)) AND ((p228 <= 0))) OR (((1 <= p1544)) AND ((p570 <= 0))) OR (((1 <= p1049)) AND ((p1428 <= 0))))",
"processed_size": 115,
"rewrites": 17
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3550
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 3,
"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 (((p1705 <= 0) OR (((1 <= p1570)) AND ((p2273 <= 0))))))",
"processed_size": 62,
"rewrites": 19
},
"result":
{
"edges": 339,
"markings": 340,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3550
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"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": "(((1 <= p2339)) AND ((p337 <= 0)))",
"processed_size": 34,
"rewrites": 21
},
"result":
{
"edges": 240,
"markings": 240,
"produced_by": "state space /EGEF",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_invariance",
"workflow": "stateequation"
}
}
],
"exit":
{
"error": null,
"memory": 61512,
"runtime": 20.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "TRUE : A(F(A(G(**)))) : E(F(**)) : (** OR A(G(**))) : E(G(*)) : (A(G(**)) OR **) : (A(F(*)) OR (E(X(**)) AND (A(X(**)) AND (E(X(**)) AND **)))) : A(G(**)) : E(F(**))"
},
"net":
{
"arcs": 5346,
"conflict_clusters": 1923,
"places": 2343,
"places_significant": 2012,
"singleton_clusters": 0,
"transitions": 2133
},
"result":
{
"preliminary_value": "yes no yes no yes no no no yes ",
"value": "yes no yes no yes no no no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 4476/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 74976
lola: finding significant places
lola: 2343 places, 2133 transitions, 2012 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: (p337 <= 1)
lola: LP says that atomic proposition is always true: (p1483 <= 1)
lola: LP says that atomic proposition is always true: (p1479 <= 1)
lola: LP says that atomic proposition is always true: (p849 <= 1)
lola: LP says that atomic proposition is always true: (p530 <= 1)
lola: LP says that atomic proposition is always true: (p2273 <= 1)
lola: LP says that atomic proposition is always true: (p1705 <= 1)
lola: LP says that atomic proposition is always true: (p228 <= 1)
lola: LP says that atomic proposition is always true: (p570 <= 1)
lola: LP says that atomic proposition is always true: (p1428 <= 1)
lola: LP says that atomic proposition is always true: (p926 <= 1)
lola: LP says that atomic proposition is always true: (p1342 <= 1)
lola: LP says that atomic proposition is always true: (p173 <= 1)
lola: LP says that atomic proposition is always true: (p710 <= 1)
lola: LP says that atomic proposition is always true: (p65 <= 1)
lola: LP says that atomic proposition is always true: (p864 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: E (G ((0 <= 0))) : A (F (A (G ((((p2339 <= 0)) OR ((1 <= p337))))))) : E (F ((((1 <= p125)) AND ((p1483 <= 0))))) : (((1 <= p1479)) OR A (G (E (G ((((p1295 <= 0)) OR ((1 <= p849)))))))) : NOT(A (F ((((1 <= p2001)) AND ((p530 <= 0)))))) : (A (G (((p1705 <= 0) OR (((1 <= p1570)) AND ((p2273 <= 0)))))) OR (NOT(E (X ((1 <= 0)))) AND ((((1 <= p2006)) AND ((p228 <= 0))) OR (((1 <= p1544)) AND ((p570 <= 0))) OR (((1 <= p1049)) AND ((p1428 <= 0)))))) : (NOT(E (G ((((p226 <= 0)) OR ((1 <= p926)))))) OR (((E (X (((1 <= p1342)))) AND A (X ((((p2005 <= 0)) OR ((1 <= p173)))))) AND E (X ((((p695 <= 0)) OR ((1 <= p710)))))) AND (((p572 <= 0)) OR ((1 <= p65))))) : A (G ((((p941 <= 0)) OR ((1 <= p864))))) : E (F ((((1 <= p1304)) AND ((p61 <= 0)))))
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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:133
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 394 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: 17 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 443 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((((1 <= p226)) AND ((p926 <= 0))))) OR (E (X (((1 <= p1342)))) AND (A (X ((((p2005 <= 0)) OR ((1 <= p173))))) AND (E (X ((((p695 <= 0)) OR ((1 <= p710))))) AND (((p572 <= 0)) OR ((1 <= p65)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 443 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p572 <= 0)) OR ((1 <= p65)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p572 <= 0)) OR ((1 <= p65)))
lola: processed formula length: 32
lola: 17 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 2 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 2 will run for 507 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p226)) AND ((p926 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (((p226 <= 0)) OR ((1 <= p926)))
lola: processed formula length: 33
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:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p226)) AND ((p926 <= 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 / EG
lola: The predicate does not eventually occur.
lola: 1464 markings, 1463 edges
lola: ========================================
lola: subprocess 3 will run for 591 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (((1 <= p1342))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(((1 <= p1342)))
lola: processed formula length: 18
lola: 18 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 507 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p125)) AND ((p1483 <= 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 <= p125)) AND ((p1483 <= 0)))))
lola: processed formula length: 42
lola: 18 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 <= p125)) AND ((p1483 <= 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: 751 markings, 750 edges
lola: ========================================
lola: subprocess 3 will run for 591 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p941 <= 0)) OR ((1 <= p864)))))
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 ((((p941 <= 0)) OR ((1 <= p864)))))
lola: processed formula length: 41
lola: 19 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 <= p941)) AND ((p864 <= 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: 667 markings, 666 edges
lola: ========================================
lola: subprocess 4 will run for 710 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p1304)) AND ((p61 <= 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 <= p1304)) AND ((p61 <= 0)))))
lola: processed formula length: 41
lola: 18 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 <= p1304)) AND ((p61 <= 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: 595 markings, 594 edges
lola: ========================================
lola: subprocess 5 will run for 887 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((p2001 <= 0)) OR ((1 <= p530)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((p2001 <= 0)) OR ((1 <= p530)))))
lola: processed formula length: 42
lola: 18 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: (((1 <= p2001)) AND ((p530 <= 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 / EG
lola: The predicate is possibly preserved.
lola: 4136 markings, 4155 edges
lola: ========================================
lola: subprocess 6 will run for 1183 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p1479)) OR A (G ((((p1295 <= 0)) OR ((1 <= p849))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 1183 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p1479))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p1479))
lola: processed formula length: 14
lola: 17 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 1775 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p1295 <= 0)) OR ((1 <= p849)))))
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 ((((p1295 <= 0)) OR ((1 <= p849)))))
lola: processed formula length: 42
lola: 19 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 <= p1295)) AND ((p849 <= 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: 468 markings, 467 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 7 will run for 1775 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((p1705 <= 0) OR (((1 <= p1570)) AND ((p2273 <= 0)))))) OR ((((1 <= p2006)) AND ((p228 <= 0))) OR (((1 <= p1544)) AND ((p570 <= 0))) OR (((1 <= p1049)) AND ((p1428 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 1775 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p2006)) AND ((p228 <= 0))) OR (((1 <= p1544)) AND ((p570 <= 0))) OR (((1 <= p1049)) AND ((p1428 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((((1 <= p2006)) AND ((p228 <= 0))) OR (((1 <= p1544)) AND ((p570 <= 0))) OR (((1 <= p1049)) AND ((p1428 <= 0))))
lola: processed formula length: 115
lola: 17 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 6 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 8 will run for 3550 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p1705 <= 0) OR (((1 <= p1570)) AND ((p2273 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p1705 <= 0) OR (((1 <= p1570)) AND ((p2273 <= 0))))))
lola: processed formula length: 62
lola: 19 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 <= p1705) AND (((p1570 <= 0)) OR ((1 <= p2273))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 340 markings, 339 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 3550 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((((p2339 <= 0)) OR ((1 <= p337)))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:594
lola: rewrite Frontend/Parser/formula_rewrite.k:629
lola: rewrite Frontend/Parser/formula_rewrite.k:758
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((1 <= p2339)) AND ((p337 <= 0)))
lola: processed formula length: 34
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 /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result started, id 1
lola: state equation task get result unparse finished++ id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: formula 0: (((p2339 <= 0)) OR ((1 <= p337)))
lola: state equation task get result unparse finished id 0
lola: state equation task get result unparse finished++ id 1
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: formula 1: (((1 <= p2339)) AND ((p337 <= 0)))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: The predicate is not eventually invariant.
lola: 240 markings, 240 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes no yes no no no yes
lola:
preliminary result: yes no yes no yes no no no yes
lola: memory consumption: 61512 KB
lola: time consumption: 20 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="ShieldPPPt-PT-030B"
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 ShieldPPPt-PT-030B, 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 r211-tajo-159033477800691"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-030B.tgz
mv ShieldPPPt-PT-030B 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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;