Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r180-ebro-158987899800155.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 CloudReconfiguration-PT-320, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-ebro-158987899800155
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 3.4K Mar 30 01:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 30 01:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 28 16:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 8 14:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 8 14:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 27 08:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 08:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 26 08:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K Mar 26 08:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 661K 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 CloudReconfiguration-PT-320-CTLCardinality-00
FORMULA_NAME CloudReconfiguration-PT-320-CTLCardinality-01
FORMULA_NAME CloudReconfiguration-PT-320-CTLCardinality-02
FORMULA_NAME CloudReconfiguration-PT-320-CTLCardinality-03
FORMULA_NAME CloudReconfiguration-PT-320-CTLCardinality-04
FORMULA_NAME CloudReconfiguration-PT-320-CTLCardinality-05
FORMULA_NAME CloudReconfiguration-PT-320-CTLCardinality-06
FORMULA_NAME CloudReconfiguration-PT-320-CTLCardinality-07
FORMULA_NAME CloudReconfiguration-PT-320-CTLCardinality-08
FORMULA_NAME CloudReconfiguration-PT-320-CTLCardinality-09
FORMULA_NAME CloudReconfiguration-PT-320-CTLCardinality-10
FORMULA_NAME CloudReconfiguration-PT-320-CTLCardinality-11
FORMULA_NAME CloudReconfiguration-PT-320-CTLCardinality-12
FORMULA_NAME CloudReconfiguration-PT-320-CTLCardinality-13
FORMULA_NAME CloudReconfiguration-PT-320-CTLCardinality-14
FORMULA_NAME CloudReconfiguration-PT-320-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591158486267

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 04:28:09] [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 04:28:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 04:28:09] [INFO ] Load time of PNML (sax parser for PT used): 329 ms
[2020-06-03 04:28:09] [INFO ] Transformed 2587 places.
[2020-06-03 04:28:09] [INFO ] Transformed 3099 transitions.
[2020-06-03 04:28:09] [INFO ] Found NUPN structural information;
[2020-06-03 04:28:09] [INFO ] Parsed PT model containing 2587 places and 3099 transitions in 435 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 180 ms.
Incomplete random walk after 100000 steps, including 892 resets, run finished after 705 ms. (steps per millisecond=141 ) properties seen :[0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1]
// Phase 1: matrix 3099 rows 2587 cols
[2020-06-03 04:28:11] [INFO ] Computed 4 place invariants in 146 ms
[2020-06-03 04:28:11] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 134 ms returned sat
[2020-06-03 04:28:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:28:31] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 04:28:31] [INFO ] [Real]Absence check using state equation in 19235 ms returned (error "Failed to check-sat")
[2020-06-03 04:28:32] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 122 ms returned sat
[2020-06-03 04:28:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:28:51] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 04:28:51] [INFO ] [Real]Absence check using state equation in 18924 ms returned (error "Failed to check-sat")
[2020-06-03 04:28:52] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 109 ms returned sat
[2020-06-03 04:28:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:29:11] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 04:29:11] [INFO ] [Real]Absence check using state equation in 18969 ms returned (error "Failed to check-sat")
[2020-06-03 04:29:11] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 128 ms returned sat
[2020-06-03 04:29:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:29:31] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 04:29:31] [INFO ] [Real]Absence check using state equation in 19368 ms returned unknown
[2020-06-03 04:29:32] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 114 ms returned sat
[2020-06-03 04:29:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:29:51] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 04:29:51] [INFO ] [Real]Absence check using state equation in 19256 ms returned (error "Failed to check-sat")
[2020-06-03 04:29:51] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 110 ms returned sat
[2020-06-03 04:29:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:30:11] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 04:30:11] [INFO ] [Real]Absence check using state equation in 19427 ms returned (error "Failed to check-sat")
[2020-06-03 04:30:12] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 110 ms returned sat
[2020-06-03 04:30:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:30:31] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 04:30:31] [INFO ] [Real]Absence check using state equation in 18473 ms returned (error "Failed to check-sat")
[2020-06-03 04:30:31] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 113 ms returned sat
[2020-06-03 04:30:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:30:51] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 04:30:51] [INFO ] [Real]Absence check using state equation in 19397 ms returned unknown
[2020-06-03 04:30:52] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 111 ms returned sat
[2020-06-03 04:30:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:31:11] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 04:31:11] [INFO ] [Real]Absence check using state equation in 19361 ms returned (error "Failed to check-sat")
[2020-06-03 04:31:12] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 109 ms returned sat
[2020-06-03 04:31:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:31:31] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 04:31:31] [INFO ] [Real]Absence check using state equation in 19393 ms returned (error "Failed to check-sat")
[2020-06-03 04:31:32] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-03 04:31:32] [INFO ] Flatten gal took : 535 ms
[2020-06-03 04:31:32] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-03 04:31:32] [INFO ] Flatten gal took : 241 ms
FORMULA CloudReconfiguration-PT-320-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-320-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-320-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 04:31:32] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 7 ms.
[2020-06-03 04:31:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 54 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ CloudReconfiguration-PT-320 @ 3570 seconds

FORMULA CloudReconfiguration-PT-320-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-320-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-320-CTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-320-CTLCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-320-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-320-CTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-320-CTLCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-320-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-320-CTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-320-CTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-320-CTLCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-320-CTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-320-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3302
rslt: Output for CTLCardinality @ CloudReconfiguration-PT-320

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=CTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 04:31:33 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 268
},
"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": "DEADLOCK",
"processed_size": 8,
"rewrites": 9
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 291
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 5,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((((p1548 <= 0)) OR ((1 <= p1285))) AND (((p1018 <= 0)) OR ((1 <= p354))))",
"processed_size": 76,
"rewrites": 12
},
"result":
{
"edges": 68,
"markings": 68,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 8
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 317
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(((p968 <= 0)) OR ((1 <= p655)) OR ((1 <= p2190)))",
"processed_size": 52,
"rewrites": 11
},
"result":
{
"edges": 76,
"markings": 76,
"produced_by": "state space /EXEG",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 349
},
"exit":
{
"localtimelimitreached": false
},
"result":
{
"edges": 79,
"markings": 79,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "deadlock preserving/insertion"
},
"treads": 1,
"type": "dfs"
},
"type": "nodeadlock",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 388
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (G ((((p114 <= 0)) OR ((1 <= p1274)) OR ((1 <= p2477)))))",
"processed_size": 61,
"rewrites": 11
},
"result":
{
"edges": 70,
"markings": 71,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 437
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((p388 <= 0))",
"processed_size": 13,
"rewrites": 12
},
"result":
{
"edges": 77,
"markings": 77,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 11
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 499
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"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": "E (G ((((p2556 <= 0)) OR ((1 <= p2092)))))",
"processed_size": 43,
"rewrites": 10
},
"result":
{
"edges": 77,
"markings": 77,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 582
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"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": "E (G ((((p1500 <= 0)) OR ((1 <= p1991)))))",
"processed_size": 43,
"rewrites": 10
},
"result":
{
"edges": 77,
"markings": 77,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 699
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (G ((((p701 <= 0)) OR ((1 <= p1077)) OR ((p130 <= 0)) OR ((1 <= p485)))))",
"processed_size": 78,
"rewrites": 10
},
"result":
{
"edges": 77,
"markings": 77,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 8
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 873
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 3,
"adisj": 3,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (((((p784 <= 0)) OR ((1 <= p1284))) U (((1 <= p2552)) AND ((p780 <= 0)))))",
"processed_size": 77,
"rewrites": 14
},
"result":
{
"edges": 77,
"markings": 77,
"produced_by": "state space /ER",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "universal_until",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1165
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 6,
"adisj": 2,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E ((((((p971 <= 0)) OR ((1 <= p389))) AND (((p174 <= 0)) OR ((1 <= p1066)))) U ((1 <= p1438))))",
"processed_size": 97,
"rewrites": 12
},
"result":
{
"edges": 5202988,
"markings": 1393603,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "existential_until",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1651
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "(((p905 <= 0)) OR ((1 <= p1520)))",
"processed_size": 34,
"rewrites": 13
},
"result":
{
"edges": 79,
"markings": 79,
"produced_by": "state space /EGEF",
"value": false
},
"task":
{
"compoundnumber": 11,
"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"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3302
},
"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 ((((p299 <= 0)) OR ((1 <= p589)))))",
"processed_size": 41,
"rewrites": 11
},
"result":
{
"edges": 71,
"markings": 72,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 12,
"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": 12,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 98224,
"runtime": 268.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(G(**)) : A(G(NODEADLOCK)) : A(F(A(G(**)))) : A(F(**)) : E(X(E(G(**)))) : E((** U **)) : E(G(**)) : A((** U **)) : (E(G(**)) AND A(G(**))) : A(G(**)) : (E(X(E(G(**)))) AND A(F(**))) : DEADLOCK : E(G(**))"
},
"net":
{
"arcs": 6479,
"conflict_clusters": 2448,
"places": 2587,
"places_significant": 2583,
"singleton_clusters": 0,
"transitions": 3099
},
"result":
{
"preliminary_value": "yes no no no yes yes yes no no no no no yes ",
"value": "yes no no no yes yes yes no no 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: 5686/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2587
lola: finding significant places
lola: 2587 places, 3099 transitions, 2583 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: (p1077 <= 1)
lola: LP says that atomic proposition is always true: (p485 <= 1)
lola: LP says that atomic proposition is always true: (p1520 <= 1)
lola: LP says that atomic proposition is always true: (p388 <= 1)
lola: LP says that atomic proposition is always true: (p655 <= 1)
lola: LP says that atomic proposition is always true: (p2190 <= 1)
lola: LP says that atomic proposition is always true: (p389 <= 1)
lola: LP says that atomic proposition is always true: (p1066 <= 1)
lola: LP says that atomic proposition is always true: (p1438 <= 1)
lola: LP says that atomic proposition is always true: (p2092 <= 1)
lola: LP says that atomic proposition is always true: (p1284 <= 1)
lola: LP says that atomic proposition is always true: (p780 <= 1)
lola: LP says that atomic proposition is always true: (p1710 <= 1)
lola: LP says that atomic proposition is always true: (p589 <= 1)
lola: LP says that atomic proposition is always true: (p1274 <= 1)
lola: LP says that atomic proposition is always true: (p2477 <= 1)
lola: LP says that atomic proposition is always true: (p585 <= 1)
lola: LP says that atomic proposition is always true: (p1285 <= 1)
lola: LP says that atomic proposition is always true: (p354 <= 1)
lola: LP says that atomic proposition is always true: (p1991 <= 1)
lola: E (G (E (G ((((p701 <= 0)) OR ((1 <= p1077)) OR ((p130 <= 0)) OR ((1 <= p485))))))) : A (G (E (X ((0 <= 0))))) : A (F (A (G ((((1 <= p905)) AND ((p1520 <= 0))))))) : (A (F (((1 <= p388)))) AND E (G ((0 <= 0)))) : E (X (E (G ((((p968 <= 0)) OR ((1 <= p655)) OR ((1 <= p2190))))))) : E ((((((p971 <= 0)) OR ((1 <= p389))) AND (((p174 <= 0)) OR ((1 <= p1066)))) U ((1 <= p1438)))) : E (G ((((p2556 <= 0)) OR ((1 <= p2092))))) : A (((((p784 <= 0)) OR ((1 <= p1284))) U (((1 <= p2552)) AND ((p780 <= 0))))) : (E (G ((((p899 <= 0)) OR ((1 <= p1710))))) AND A (G ((((p299 <= 0)) OR ((1 <= p589)))))) : A (G ((((p114 <= 0)) OR ((1 <= p1274)) OR ((1 <= p2477))))) : (E (X (E (G ((((p1852 <= 0)) OR ((1 <= p585))))))) AND A (F (((((1 <= p1548)) AND ((p1285 <= 0))) OR (((1 <= p1018)) AND ((p354 <= 0))))))) : A (X ((1 <= 0))) : E (G ((((p1500 <= 0)) OR ((1 <= p1991)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:461
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:130
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:115
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 268 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: DEADLOCK
lola: processed formula length: 8
lola: 9 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 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 1 will run for 291 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (E (G ((((p1852 <= 0)) OR ((1 <= p585))))))) AND A (F (((((1 <= p1548)) AND ((p1285 <= 0))) OR (((1 <= p1018)) AND ((p354 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 291 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((((1 <= p1548)) AND ((p1285 <= 0))) OR (((1 <= p1018)) AND ((p354 <= 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:787
lola: processed formula: ((((p1548 <= 0)) OR ((1 <= p1285))) AND (((p1018 <= 0)) OR ((1 <= p354))))
lola: processed formula length: 76
lola: 12 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / 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 <= p1548)) AND ((p1285 <= 0))) OR (((1 <= p1018)) AND ((p354 <= 0))))
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 / EG
lola: The predicate does not eventually occur.
lola: 68 markings, 68 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 317 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (G ((((p968 <= 0)) OR ((1 <= p655)) OR ((1 <= p2190)))))))
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: (((p968 <= 0)) OR ((1 <= p655)) OR ((1 <= p2190)))
lola: processed formula length: 52
lola: 11 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /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: (((p968 <= 0)) OR ((1 <= p655)) OR ((1 <= p2190)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEG
lola: The predicate is possibly preserved from some successor.
lola: 76 markings, 76 edges
lola: ========================================
lola: subprocess 3 will run for 349 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT DEADLOCK))
lola: ========================================
lola: SUBTASK
lola: checking absence of deadlocks
lola: Planning: workflow for deadlock check: search (--findpath=off,--siphontrap=off)
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 deadlock preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The net is not deadlock-free.
lola: 79 markings, 79 edges
lola: ========================================
lola: subprocess 4 will run for 388 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p114 <= 0)) OR ((1 <= p1274)) OR ((1 <= p2477)))))
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 ((((p114 <= 0)) OR ((1 <= p1274)) OR ((1 <= p2477)))))
lola: processed formula length: 61
lola: 11 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k: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 <= p114)) AND ((p1274 <= 0)) AND ((p2477 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 71 markings, 70 edges
lola: ========================================
lola: subprocess 5 will run for 437 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p388))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p388 <= 0))
lola: processed formula length: 13
lola: 12 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / 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 <= p388))
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 / EG
lola: The predicate does not eventually occur.
lola: 77 markings, 77 edges
lola: ========================================
lola: subprocess 6 will run for 499 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((p2556 <= 0)) OR ((1 <= p2092)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((p2556 <= 0)) OR ((1 <= p2092)))))
lola: processed formula length: 43
lola: 10 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: (((1 <= p2556)) AND ((p2092 <= 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: 77 markings, 77 edges
lola: ========================================
lola: subprocess 7 will run for 582 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((p1500 <= 0)) OR ((1 <= p1991)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((p1500 <= 0)) OR ((1 <= p1991)))))
lola: processed formula length: 43
lola: 10 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: (((1 <= p1500)) AND ((p1991 <= 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: 77 markings, 77 edges
lola: ========================================
lola: subprocess 8 will run for 699 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((p701 <= 0)) OR ((1 <= p1077)) OR ((p130 <= 0)) OR ((1 <= p485)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((p701 <= 0)) OR ((1 <= p1077)) OR ((p130 <= 0)) OR ((1 <= p485)))))
lola: processed formula length: 78
lola: 10 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: (((1 <= p701)) AND ((p1077 <= 0)) AND ((1 <= p130)) AND ((p485 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 77 markings, 77 edges
lola: ========================================
lola: subprocess 9 will run for 873 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((((p784 <= 0)) OR ((1 <= p1284))) U (((1 <= p2552)) AND ((p780 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (((((p784 <= 0)) OR ((1 <= p1284))) U (((1 <= p2552)) AND ((p780 <= 0)))))
lola: processed formula length: 77
lola: 14 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 /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl 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: (((p784 <= 0)) OR ((1 <= p1284)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: 1
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 77 markings, 77 edges
lola: ========================================
lola: subprocess 10 will run for 1165 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((((p971 <= 0)) OR ((1 <= p389))) AND (((p174 <= 0)) OR ((1 <= p1066)))) U ((1 <= p1438))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E ((((((p971 <= 0)) OR ((1 <= p389))) AND (((p174 <= 0)) OR ((1 <= p1066)))) U ((1 <= p1438))))
lola: processed formula length: 97
lola: 12 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p1438))
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-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-10-0.sara.
sara: error: :12033: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: sara is running 0 secs || 42101 markings, 126447 edges, 8420 markings/sec, 0 secs
lola: sara is running 5 secs || 79550 markings, 263217 edges, 7490 markings/sec, 5 secs
lola: sara is running 10 secs || 119847 markings, 394136 edges, 8059 markings/sec, 10 secs
lola: sara is running 15 secs || 159476 markings, 522046 edges, 7926 markings/sec, 15 secs
lola: sara is running 20 secs || 203756 markings, 646100 edges, 8856 markings/sec, 20 secs
lola: sara is running 25 secs || 240161 markings, 784477 edges, 7281 markings/sec, 25 secs
lola: sara is running 30 secs || 284194 markings, 909841 edges, 8807 markings/sec, 30 secs
lola: sara is running 35 secs || 320575 markings, 1048071 edges, 7276 markings/sec, 35 secs
lola: sara is running 40 secs || 363213 markings, 1177301 edges, 8528 markings/sec, 40 secs
lola: sara is running 45 secs || 401590 markings, 1309491 edges, 7675 markings/sec, 45 secs
lola: sara is running 50 secs || 441562 markings, 1436422 edges, 7994 markings/sec, 50 secs
lola: sara is running 55 secs || 482664 markings, 1557815 edges, 8220 markings/sec, 55 secs
lola: sara is running 60 secs || 526905 markings, 1680997 edges, 8848 markings/sec, 60 secs
lola: sara is running 65 secs || 565481 markings, 1813213 edges, 7715 markings/sec, 65 secs
lola: sara is running 70 secs || 607226 markings, 1942459 edges, 8349 markings/sec, 70 secs
lola: sara is running 75 secs || 644516 markings, 2081150 edges, 7458 markings/sec, 75 secs
lola: sara is running 80 secs || 682473 markings, 2208150 edges, 7591 markings/sec, 80 secs
lola: sara is running 85 secs || 718968 markings, 2343654 edges, 7299 markings/sec, 85 secs
lola: sara is running 90 secs || 751176 markings, 2485247 edges, 6442 markings/sec, 90 secs
lola: sara is running 95 secs || 784119 markings, 2627163 edges, 6589 markings/sec, 95 secs
lola: sara is running 100 secs || 817007 markings, 2769199 edges, 6578 markings/sec, 100 secs
lola: sara is running 105 secs || 852268 markings, 2905631 edges, 7052 markings/sec, 105 secs
lola: sara is running 110 secs || 886584 markings, 3040095 edges, 6863 markings/sec, 110 secs
lola: sara is running 115 secs || 922938 markings, 3177505 edges, 7271 markings/sec, 115 secs
lola: sara is running 120 secs || 949067 markings, 3327188 edges, 5226 markings/sec, 120 secs
lola: sara is running 125 secs || 985829 markings, 3458955 edges, 7352 markings/sec, 125 secs
lola: sara is running 130 secs || 1013246 markings, 3608351 edges, 5483 markings/sec, 130 secs
lola: sara is running 135 secs || 1047904 markings, 3744693 edges, 6932 markings/sec, 135 secs
lola: sara is running 140 secs || 1080568 markings, 3885009 edges, 6533 markings/sec, 140 secs
lola: sara is running 145 secs || 1112766 markings, 4024971 edges, 6440 markings/sec, 145 secs
lola: sara is running 150 secs || 1144388 markings, 4155238 edges, 6324 markings/sec, 150 secs
lola: sara is running 155 secs || 1177510 markings, 4288596 edges, 6624 markings/sec, 155 secs
lola: sara is running 160 secs || 1214189 markings, 4422081 edges, 7336 markings/sec, 160 secs
lola: sara is running 165 secs || 1245621 markings, 4565158 edges, 6286 markings/sec, 165 secs
lola: sara is running 170 secs || 1281722 markings, 4699551 edges, 7220 markings/sec, 170 secs
lola: sara is running 175 secs || 1316907 markings, 4836958 edges, 7037 markings/sec, 175 secs
lola: sara is running 180 secs || 1341699 markings, 4985267 edges, 4958 markings/sec, 180 secs
lola: sara is running 185 secs || 1372959 markings, 5119735 edges, 6252 markings/sec, 185 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 1393603 markings, 5202988 edges
lola: ========================================
lola: subprocess 11 will run for 1651 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((((1 <= p905)) AND ((p1520 <= 0)))))))
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: (((p905 <= 0)) OR ((1 <= p1520)))
lola: processed formula length: 34
lola: 13 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /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 unparse finished++ id 0
lola: formula 0: (((1 <= p905)) AND ((p1520 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (((p905 <= 0)) OR ((1 <= p1520)))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: The predicate is not eventually invariant.
lola: 79 markings, 79 edges
lola: state equation: write sara problem file to CTLCardinality-11-0.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLCardinality-11-1.sara
lola: subprocess 12 will run for 3302 seconds at most (--localtimelimit=0)
lola: sara: try reading problem file CTLCardinality-11-0.sara.
========================================
lola: ...considering subproblem: (E (G ((((p899 <= 0)) OR ((1 <= p1710))))) AND A (G ((((p299 <= 0)) OR ((1 <= p589))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: lola: RUNNING
========================================
lola: subprocess 12 will run for 3302 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p299 <= 0)) OR ((1 <= p589)))))
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 ((((p299 <= 0)) OR ((1 <= p589)))))
lola: processed formula length: 41
lola: 11 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k: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 <= p299)) AND ((p589 <= 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: 72 markings, 71 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no yes yes yes no no no no no yes
lola:
preliminary result: yes no no no yes yes yes no no no no no yes
lola: memory consumption: 98224 KB
lola: time consumption: 268 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
rslt: finished
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427456 kB
MemFree: 16045448 kB
After kill :
MemTotal: 16427456 kB
MemFree: 16045700 kB

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CloudReconfiguration-PT-320"
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 CloudReconfiguration-PT-320, 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 r180-ebro-158987899800155"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CloudReconfiguration-PT-320.tgz
mv CloudReconfiguration-PT-320 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 ;