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-158987899600067.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-309, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-ebro-158987899600067
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 840K
-rw-r--r-- 1 mcc users 4.1K Mar 30 01:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 30 01:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 28 16:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:13 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.1K Apr 8 14:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K 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.7K Mar 27 08:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 08:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 26 08:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 26 08:13 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 660K 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-309-CTLCardinality-00
FORMULA_NAME CloudReconfiguration-PT-309-CTLCardinality-01
FORMULA_NAME CloudReconfiguration-PT-309-CTLCardinality-02
FORMULA_NAME CloudReconfiguration-PT-309-CTLCardinality-03
FORMULA_NAME CloudReconfiguration-PT-309-CTLCardinality-04
FORMULA_NAME CloudReconfiguration-PT-309-CTLCardinality-05
FORMULA_NAME CloudReconfiguration-PT-309-CTLCardinality-06
FORMULA_NAME CloudReconfiguration-PT-309-CTLCardinality-07
FORMULA_NAME CloudReconfiguration-PT-309-CTLCardinality-08
FORMULA_NAME CloudReconfiguration-PT-309-CTLCardinality-09
FORMULA_NAME CloudReconfiguration-PT-309-CTLCardinality-10
FORMULA_NAME CloudReconfiguration-PT-309-CTLCardinality-11
FORMULA_NAME CloudReconfiguration-PT-309-CTLCardinality-12
FORMULA_NAME CloudReconfiguration-PT-309-CTLCardinality-13
FORMULA_NAME CloudReconfiguration-PT-309-CTLCardinality-14
FORMULA_NAME CloudReconfiguration-PT-309-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591139241895

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 23:07:25] [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-02 23:07:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 23:07:25] [INFO ] Load time of PNML (sax parser for PT used): 348 ms
[2020-06-02 23:07:25] [INFO ] Transformed 2585 places.
[2020-06-02 23:07:25] [INFO ] Transformed 3095 transitions.
[2020-06-02 23:07:25] [INFO ] Found NUPN structural information;
[2020-06-02 23:07:25] [INFO ] Parsed PT model containing 2585 places and 3095 transitions in 464 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 192 ms.
Incomplete random walk after 100000 steps, including 718 resets, run finished after 879 ms. (steps per millisecond=113 ) properties seen :[0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1]
// Phase 1: matrix 3095 rows 2585 cols
[2020-06-02 23:07:27] [INFO ] Computed 4 place invariants in 154 ms
[2020-06-02 23:07:28] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 135 ms returned sat
[2020-06-02 23:07:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:07:47] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 23:07:47] [INFO ] [Real]Absence check using state equation in 19224 ms returned (error "Failed to check-sat")
[2020-06-02 23:07:48] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 125 ms returned sat
[2020-06-02 23:07:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:08:07] [INFO ] [Real]Absence check using state equation in 18763 ms returned (error "Solver has unexpectedly terminated")
[2020-06-02 23:08:07] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 114 ms returned sat
[2020-06-02 23:08:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:08:27] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 23:08:27] [INFO ] [Real]Absence check using state equation in 19382 ms returned unknown
[2020-06-02 23:08:27] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 128 ms returned sat
[2020-06-02 23:08:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:08:47] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 23:08:47] [INFO ] [Real]Absence check using state equation in 19391 ms returned (error "Failed to check-sat")
[2020-06-02 23:08:48] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 178 ms returned sat
[2020-06-02 23:08:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:09:07] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 23:09:07] [INFO ] [Real]Absence check using state equation in 19373 ms returned (error "Failed to check-sat")
[2020-06-02 23:09:08] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 184 ms returned sat
[2020-06-02 23:09:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:09:27] [INFO ] [Real]Absence check using state equation in 19300 ms returned (error "Solver has unexpectedly terminated")
[2020-06-02 23:09:28] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 134 ms returned sat
[2020-06-02 23:09:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:09:47] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 23:09:47] [INFO ] [Real]Absence check using state equation in 19160 ms returned (error "Failed to check-sat")
[2020-06-02 23:09:48] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 114 ms returned sat
[2020-06-02 23:09:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:10:07] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 23:10:07] [INFO ] [Real]Absence check using state equation in 19321 ms returned unknown
[2020-06-02 23:10:08] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 144 ms returned sat
[2020-06-02 23:10:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:10:27] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 23:10:27] [INFO ] [Real]Absence check using state equation in 19358 ms returned (error "Failed to check-sat")
[2020-06-02 23:10:28] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 112 ms returned sat
[2020-06-02 23:10:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:10:47] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 23:10:47] [INFO ] [Real]Absence check using state equation in 19423 ms returned (error "Failed to check-sat")
[2020-06-02 23:10:48] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 115 ms returned sat
[2020-06-02 23:10:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:11:07] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 23:11:07] [INFO ] [Real]Absence check using state equation in 19400 ms returned (error "Failed to check-sat")
[2020-06-02 23:11:08] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 111 ms returned sat
[2020-06-02 23:11:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:11:27] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 23:11:27] [INFO ] [Real]Absence check using state equation in 19430 ms returned (error "Failed to check-sat")
[2020-06-02 23:11:28] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 143 ms returned sat
[2020-06-02 23:11:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:11:47] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 23:11:47] [INFO ] [Real]Absence check using state equation in 19339 ms returned unknown
[2020-06-02 23:11:48] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 154 ms returned sat
[2020-06-02 23:11:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:12:07] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 23:12:07] [INFO ] [Real]Absence check using state equation in 19362 ms returned (error "Failed to check-sat")
[2020-06-02 23:12:08] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 117 ms returned sat
[2020-06-02 23:12:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:12:27] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 23:12:27] [INFO ] [Real]Absence check using state equation in 19422 ms returned (error "Failed to check-sat")
[2020-06-02 23:12:28] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 113 ms returned sat
[2020-06-02 23:12:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:12:47] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 23:12:47] [INFO ] [Real]Absence check using state equation in 19398 ms returned unknown
[2020-06-02 23:12:48] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 112 ms returned sat
[2020-06-02 23:12:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:13:07] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 23:13:07] [INFO ] [Real]Absence check using state equation in 19407 ms returned (error "Failed to check-sat")
[2020-06-02 23:13:08] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 168 ms returned sat
[2020-06-02 23:13:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:13:27] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 23:13:27] [INFO ] [Real]Absence check using state equation in 19381 ms returned (error "Failed to check-sat")
[2020-06-02 23:13:28] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 143 ms returned sat
[2020-06-02 23:13:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:13:47] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 23:13:47] [INFO ] [Real]Absence check using state equation in 19400 ms returned (error "Failed to check-sat")
[2020-06-02 23:13:48] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 139 ms returned sat
[2020-06-02 23:13:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:14:07] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 23:14:07] [INFO ] [Real]Absence check using state equation in 19386 ms returned (error "Failed to check-sat")
[2020-06-02 23:14:08] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 110 ms returned sat
[2020-06-02 23:14:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:14:27] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 23:14:27] [INFO ] [Real]Absence check using state equation in 19426 ms returned (error "Failed to check-sat")
[2020-06-02 23:14:28] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 131 ms returned sat
[2020-06-02 23:14:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:14:47] [INFO ] [Real]Absence check using state equation in 19413 ms returned sat
[2020-06-02 23:14:48] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 21
[2020-06-02 23:14:50] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 112 ms returned sat
[2020-06-02 23:14:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:15:08] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 23:15:08] [INFO ] [Real]Absence check using state equation in 18263 ms returned (error "Failed to check-sat")
[2020-06-02 23:15:08] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 116 ms returned sat
[2020-06-02 23:15:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:15:28] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 23:15:28] [INFO ] [Real]Absence check using state equation in 19407 ms returned (error "Failed to check-sat")
[2020-06-02 23:15:28] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 114 ms returned sat
[2020-06-02 23:15:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:15:48] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 23:15:48] [INFO ] [Real]Absence check using state equation in 19590 ms returned (error "Failed to check-sat")
[2020-06-02 23:15:49] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-02 23:15:49] [INFO ] Flatten gal took : 549 ms
[2020-06-02 23:15:49] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-02 23:15:49] [INFO ] Flatten gal took : 225 ms
FORMULA CloudReconfiguration-PT-309-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-309-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-309-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-309-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-309-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-02 23:15:49] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 9 ms.
[2020-06-02 23:15:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 51 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ CloudReconfiguration-PT-309 @ 3570 seconds

FORMULA CloudReconfiguration-PT-309-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA CloudReconfiguration-PT-309-CTLCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

FORMULA CloudReconfiguration-PT-309-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA CloudReconfiguration-PT-309-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-309-CTLCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-309-CTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-309-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3469
rslt: Output for CTLCardinality @ CloudReconfiguration-PT-309

{
"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": "Tue Jun 2 23:15:50 2020
",
"timelimit": 3570
},
"child":
[

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 385
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((1 <= p144))",
"processed_size": 13,
"rewrites": 41
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 433
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G ((((p1705 <= 0)) OR ((1 <= p1196)) OR ((p2305 <= 0)) OR ((1 <= p2553)))))",
"processed_size": 81,
"rewrites": 43
},
"result":
{
"edges": 97,
"markings": 98,
"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": 4,
"problems": 4
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 495
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 5,
"adisj": 3,
"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": "A (((((p1615 <= 0)) OR ((1 <= p57)) OR ((p649 <= 0)) OR ((1 <= p253))) U (((1 <= p1661)) AND ((p388 <= 0)))))",
"processed_size": 112,
"rewrites": 46
},
"result":
{
"edges": 89,
"markings": 89,
"produced_by": "state space /ER",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 15
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "universal_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 433
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 3,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(((p1503 <= 0)) AND ((1 <= p1249)) AND ((p2375 <= 0)))",
"processed_size": 54,
"rewrites": 44
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 495
},
"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": 41
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 495
},
"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": "(((p2207 <= 0)) OR ((1 <= p726)))",
"processed_size": 34,
"rewrites": 41
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 578
},
"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 ((((p523 <= 0)) OR ((1 <= p2024)))))",
"processed_size": 42,
"rewrites": 43
},
"result":
{
"edges": 77,
"markings": 78,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 578
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"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": "E (F (((1 <= p1272))))",
"processed_size": 22,
"rewrites": 42
},
"result":
{
"edges": 35,
"markings": 36,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 693
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 1,
"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": "A (G ((((1 <= p2203)) OR ((p140 <= 0)) OR ((1 <= p1533)) OR ((p760 <= 0)) OR ((1 <= p1865)))))",
"processed_size": 98,
"rewrites": 43
},
"result":
{
"edges": 103,
"markings": 104,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 5,
"problems": 5
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 867
},
"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 <= p755)) AND ((p682 <= 0)))",
"processed_size": 33,
"rewrites": 45
},
"result":
{
"edges": 1190,
"markings": 1164,
"produced_by": "parallel",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1156
},
"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": "(((p806 <= 0)) OR ((1 <= p2548)))",
"processed_size": 34,
"rewrites": 41
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 8,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1734
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"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": "E (F ((((1 <= p2196)) AND ((p2405 <= 0)))))",
"processed_size": 43,
"rewrites": 42
},
"result":
{
"edges": 96,
"markings": 97,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 9,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1734
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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": "(((1 <= p1160)) AND ((p728 <= 0)))",
"processed_size": 34,
"rewrites": 41
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3469
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"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": "E (F ((((1 <= p1867)) AND ((p260 <= 0)))))",
"processed_size": 42,
"rewrites": 42
},
"result":
{
"edges": 62,
"markings": 63,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 10,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3469
},
"exit":
{
"localtimelimitreached": false
},
"result":
{
"edges": 117,
"markings": 115,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "deadlock preserving/insertion"
},
"treads": 1,
"type": "dfs"
},
"type": "deadlock",
"workflow": "search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 108076,
"runtime": 101.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(E(F(*)) OR **) : (DEADLOCK AND (** OR (A(X(**)) AND (** AND (** AND **))))) : (A(G(**)) AND (A(X(**)) AND **)) : (A(G(**)) OR (A((** U **)) OR (E(X(**)) AND **))) : (E(F(*)) AND **) : TRUE : E(F(A(G(**)))) : A(G(**)) : (A((** U **)) OR E(F(DEADLOCK))) : E(F(**)) : TRUE"
},
"net":
{
"arcs": 6463,
"conflict_clusters": 2448,
"places": 2585,
"places_significant": 2581,
"singleton_clusters": 0,
"transitions": 3095
},
"result":
{
"preliminary_value": "yes no no no yes yes yes no yes yes yes ",
"value": "yes no no no yes yes yes no yes yes yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 5680/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2585
lola: finding significant places
lola: 2585 places, 3095 transitions, 2581 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: (p260 <= 1)
lola: LP says that atomic proposition is always true: (p728 <= 1)
lola: LP says that atomic proposition is always true: (p954 <= 1)
lola: LP says that atomic proposition is always true: (p1148 <= 1)
lola: LP says that atomic proposition is always true: (p59 <= 1)
lola: LP says that atomic proposition is always true: (p1503 <= 1)
lola: LP says that atomic proposition is always true: (p2375 <= 1)
lola: LP says that atomic proposition is always true: (p2024 <= 1)
lola: LP says that atomic proposition is always true: (p2048 <= 1)
lola: LP says that atomic proposition is always true: (p726 <= 1)
lola: LP says that atomic proposition is always true: (p1196 <= 1)
lola: LP says that atomic proposition is always true: (p2553 <= 1)
lola: LP says that atomic proposition is always true: (p57 <= 1)
lola: LP says that atomic proposition is always true: (p253 <= 1)
lola: LP says that atomic proposition is always true: (p388 <= 1)
lola: LP says that atomic proposition is always true: (p1084 <= 1)
lola: LP says that atomic proposition is always true: (p144 <= 1)
lola: LP says that atomic proposition is always true: (p2405 <= 1)
lola: LP says that atomic proposition is always true: (p2548 <= 1)
lola: LP says that atomic proposition is always true: (p1662 <= 1)
lola: LP says that atomic proposition is always true: (p2559 <= 1)
lola: LP says that atomic proposition is always true: (p2032 <= 1)
lola: LP says that atomic proposition is always true: (p682 <= 1)
lola: LP says that atomic proposition is always true: (p2203 <= 1)
lola: LP says that atomic proposition is always true: (p1533 <= 1)
lola: LP says that atomic proposition is always true: (p1865 <= 1)
lola: LP says that atomic proposition is always true: (p2208 <= 1)
lola: LP says that atomic proposition is always true: (p2016 <= 1)
lola: LP says that atomic proposition is always true: (p1920 <= 1)
lola: LP says that atomic proposition is always true: (p1529 <= 1)
lola: LP says that atomic proposition is always true: (p1272 <= 1)
lola: (NOT(A (G ((((p1867 <= 0)) OR ((1 <= p260)))))) OR (((1 <= p1160)) AND ((p728 <= 0)))) : (A (X ((1 <= 0))) AND ((((p1464 <= 0)) OR ((1 <= p954)) OR (p1148 <= 0)) OR (((A (X ((((p1662 <= 0)) OR ((1 <= p59))))) AND ((p1503 <= 0))) AND ((1 <= p1249))) AND ((p2375 <= 0))))) : (A (G (E (G ((((p523 <= 0)) OR ((1 <= p2024))))))) AND (E (G ((1 <= 0))) OR (A (X ((((p1664 <= 0)) OR ((1 <= p2048))))) AND (((p2207 <= 0)) OR ((1 <= p726)))))) : ((A (G ((((p1705 <= 0)) OR ((1 <= p1196)) OR ((p2305 <= 0)) OR ((1 <= p2553))))) OR A (((((p1615 <= 0)) OR ((1 <= p57)) OR ((p649 <= 0)) OR ((1 <= p253))) U (((1 <= p1661)) AND ((p388 <= 0)))))) OR (E (X ((((p138 <= 0)) OR ((1 <= p1084))))) AND ((1 <= p144)))) : ((NOT(A (G ((((p2196 <= 0)) OR ((1 <= p2405)))))) AND (((p806 <= 0)) OR ((1 <= p2548)))) OR (((((A (((1 <= 0) U (1 <= 0))) AND ((1 <= p1544))) AND ((p1662 <= 0))) AND ((p2559 <= 0))) AND ((1 <= p2213))) AND ((p2032 <= 0)))) : E (G ((0 <= 0))) : E (F (A (G ((((p755 <= 0)) OR ((1 <= p682))))))) : A (G ((((1 <= p2203)) OR ((p140 <= 0)) OR ((1 <= p1533)) OR ((p760 <= 0)) OR ((1 <= p1865))))) : (A (((((p1744 <= 0)) OR ((1 <= p2208))) U ((1 <= p2016) AND (((p72 <= 0)) OR ((1 <= p1920)))))) OR E (F (A (X ((1 <= 0)))))) : (A ((((p1529 <= 0)) U (1 <= 0))) OR E (F (E (F (((1 <= p1272))))))) : A (X (E (G ((0 <= 0)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:458
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:121
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:401
lola: rewrite Frontend/Parser/formula_rewrite.k:122
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:136
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 315 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: 41 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 346 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: 41 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 2 will run for 385 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((((p1705 <= 0)) OR ((1 <= p1196)) OR ((p2305 <= 0)) OR ((1 <= p2553))))) OR (A (((((p1615 <= 0)) OR ((1 <= p57)) OR ((p649 <= 0)) OR ((1 <= p253))) U (((1 <= p1661)) AND ((p388 <= 0))))) OR (E (X ((((p138 <= 0)) OR ((1 <= p1084))))) AND ((1 <= p144)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 385 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p144))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p144))
lola: processed formula length: 13
lola: 41 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 3 will run for 433 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p1705 <= 0)) OR ((1 <= p1196)) OR ((p2305 <= 0)) OR ((1 <= p2553)))))
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 <= p1196)) OR ((p2305 <= 0)) OR ((1 <= p2553)))))
lola: processed formula length: 81
lola: 43 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 ((p1196 <= 0)) AND ((1 <= p2305)) AND ((p2553 <= 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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 98 markings, 97 edges
lola: ========================================
lola: subprocess 4 will run for 495 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((((p1615 <= 0)) OR ((1 <= p57)) OR ((p649 <= 0)) OR ((1 <= p253))) U (((1 <= p1661)) AND ((p388 <= 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 (((((p1615 <= 0)) OR ((1 <= p57)) OR ((p649 <= 0)) OR ((1 <= p253))) U (((1 <= p1661)) AND ((p388 <= 0)))))
lola: processed formula length: 112
lola: 46 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: (((p1615 <= 0)) OR ((1 <= p57)) OR ((p649 <= 0)) OR ((1 <= p253)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 4 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: 89 markings, 89 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 433 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (DEADLOCK AND ((((p1464 <= 0)) OR ((1 <= p954)) OR (p1148 <= 0)) OR (A (X ((((p1662 <= 0)) OR ((1 <= p59))))) AND (((p1503 <= 0)) AND (((1 <= p1249)) AND ((p2375 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 433 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p1503 <= 0)) AND (((1 <= p1249)) AND ((p2375 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: processed formula: (((p1503 <= 0)) AND ((1 <= p1249)) AND ((p2375 <= 0)))
lola: processed formula length: 54
lola: 44 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 495 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: 41 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 495 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((((p523 <= 0)) OR ((1 <= p2024))))) AND (A (X ((((p1664 <= 0)) OR ((1 <= p2048))))) AND (((p2207 <= 0)) OR ((1 <= p726)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 495 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p2207 <= 0)) OR ((1 <= p726)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p2207 <= 0)) OR ((1 <= p726)))
lola: processed formula length: 34
lola: 41 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 5 will run for 578 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p523 <= 0)) OR ((1 <= p2024)))))
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 ((((p523 <= 0)) OR ((1 <= p2024)))))
lola: processed formula length: 42
lola: 43 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 <= p523)) AND ((p2024 <= 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: 78 markings, 77 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 578 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p1272))))
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 <= p1272))))
lola: processed formula length: 22
lola: 42 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 <= p1272))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 36 markings, 35 edges
lola: ========================================
lola: subprocess 6 will run for 693 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= p2203)) OR ((p140 <= 0)) OR ((1 <= p1533)) OR ((p760 <= 0)) OR ((1 <= p1865)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((((1 <= p2203)) OR ((p140 <= 0)) OR ((1 <= p1533)) OR ((p760 <= 0)) OR ((1 <= p1865)))))
lola: processed formula length: 98
lola: 43 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: (((p2203 <= 0)) AND ((1 <= p140)) AND ((p1533 <= 0)) AND ((1 <= p760)) AND ((p1865 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 104 markings, 103 edges
lola: ========================================
lola: subprocess 7 will run for 867 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((((p755 <= 0)) OR ((1 <= p682)))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((1 <= p755)) AND ((p682 <= 0)))
lola: processed formula length: 33
lola: 45 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
lola: using tscc preserving stubborn set method (--stubborn)
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: 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 0
lola: formula 0: (((p755 <= 0)) OR ((1 <= p682)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (((1 <= p755)) AND ((p682 <= 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: yes
lola: produced by: parallel
lola: The predicate is possibly invariant.
lola: 1164 markings, 1190 edges
lola: ========================================
lola: subprocess 8 will run for 1156 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((((1 <= p2196)) AND ((p2405 <= 0))))) AND (((p806 <= 0)) OR ((1 <= p2548))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 1156 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p806 <= 0)) OR ((1 <= p2548)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p806 <= 0)) OR ((1 <= p2548)))
lola: processed formula length: 34
lola: 41 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 9 will run for 1734 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p2196)) AND ((p2405 <= 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 <= p2196)) AND ((p2405 <= 0)))))
lola: processed formula length: 43
lola: 42 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 <= p2196)) AND ((p2405 <= 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: 97 markings, 96 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 9 will run for 1734 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((((1 <= p1867)) AND ((p260 <= 0))))) OR (((1 <= p1160)) AND ((p728 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 1734 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p1160)) AND ((p728 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((1 <= p1160)) AND ((p728 <= 0)))
lola: processed formula length: 34
lola: 41 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 2 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 10 will run for 3469 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p1867)) AND ((p260 <= 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 <= p1867)) AND ((p260 <= 0)))))
lola: processed formula length: 42
lola: 42 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 <= p1867)) AND ((p260 <= 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: 63 markings, 62 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 3469 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (((((p1744 <= 0)) OR ((1 <= p2208))) U ((1 <= p2016) AND (((p72 <= 0)) OR ((1 <= p1920)))))) OR E (F (DEADLOCK)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 3469 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (DEADLOCK))
lola: ========================================
lola: SUBTASK
lola: checking reachability 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: yes
lola: produced by: state space
lola: The net has deadlock(s).
lola: 115 markings, 117 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no yes yes yes no yes yes yes
lola:
preliminary result: yes no no no yes yes yes no yes yes yes
lola: memory consumption: 108076 KB
lola: time consumption: 101 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="CloudReconfiguration-PT-309"
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-309, 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-158987899600067"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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