Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r186-oct2-158987938400059.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is RefineWMG-PT-010011, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-oct2-158987938400059
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 204K
-rw-r--r-- 1 mcc users 3.2K Apr 12 10:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 12 10:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 11 12:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 11 12:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 14 12:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 10 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 10 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 9 22:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Apr 9 22:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 24K Mar 24 05:38 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 n0-CTLCardinality-00
FORMULA_NAME n0-CTLCardinality-01
FORMULA_NAME n0-CTLCardinality-02
FORMULA_NAME n0-CTLCardinality-03
FORMULA_NAME n0-CTLCardinality-04
FORMULA_NAME n0-CTLCardinality-05
FORMULA_NAME n0-CTLCardinality-06
FORMULA_NAME n0-CTLCardinality-07
FORMULA_NAME n0-CTLCardinality-08
FORMULA_NAME n0-CTLCardinality-09
FORMULA_NAME n0-CTLCardinality-10
FORMULA_NAME n0-CTLCardinality-11
FORMULA_NAME n0-CTLCardinality-12
FORMULA_NAME n0-CTLCardinality-13
FORMULA_NAME n0-CTLCardinality-14
FORMULA_NAME n0-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591224191715

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 22:43:13] [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 22:43:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 22:43:14] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2020-06-03 22:43:14] [INFO ] Transformed 54 places.
[2020-06-03 22:43:14] [INFO ] Transformed 43 transitions.
[2020-06-03 22:43:14] [INFO ] Parsed PT model containing 54 places and 43 transitions in 104 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 34 ms.
Incomplete random walk after 100007 steps, including 0 resets, run finished after 223 ms. (steps per millisecond=448 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0]
// Phase 1: matrix 43 rows 54 cols
[2020-06-03 22:43:14] [INFO ] Computed 22 place invariants in 3 ms
[2020-06-03 22:43:14] [INFO ] [Real]Absence check using 22 positive place invariants in 15 ms returned unsat
[2020-06-03 22:43:14] [INFO ] [Real]Absence check using 22 positive place invariants in 43 ms returned sat
[2020-06-03 22:43:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:43:14] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2020-06-03 22:43:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:43:14] [INFO ] [Nat]Absence check using 22 positive place invariants in 16 ms returned sat
[2020-06-03 22:43:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:43:15] [INFO ] [Nat]Absence check using state equation in 207 ms returned sat
[2020-06-03 22:43:15] [INFO ] Computed and/alt/rep : 32/42/32 causal constraints in 6 ms.
[2020-06-03 22:43:15] [INFO ] Added : 18 causal constraints over 4 iterations in 72 ms. Result :sat
[2020-06-03 22:43:15] [INFO ] [Real]Absence check using 22 positive place invariants in 45 ms returned sat
[2020-06-03 22:43:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:43:15] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2020-06-03 22:43:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:43:15] [INFO ] [Nat]Absence check using 22 positive place invariants in 9 ms returned sat
[2020-06-03 22:43:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:43:15] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2020-06-03 22:43:15] [INFO ] Computed and/alt/rep : 32/42/32 causal constraints in 4 ms.
[2020-06-03 22:43:15] [INFO ] Added : 21 causal constraints over 5 iterations in 171 ms. Result :sat
[2020-06-03 22:43:15] [INFO ] [Real]Absence check using 22 positive place invariants in 5 ms returned sat
[2020-06-03 22:43:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:43:15] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2020-06-03 22:43:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:43:15] [INFO ] [Nat]Absence check using 22 positive place invariants in 11 ms returned sat
[2020-06-03 22:43:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:43:15] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2020-06-03 22:43:15] [INFO ] Computed and/alt/rep : 32/42/32 causal constraints in 5 ms.
[2020-06-03 22:43:15] [INFO ] Added : 24 causal constraints over 5 iterations in 30 ms. Result :sat
[2020-06-03 22:43:15] [INFO ] [Real]Absence check using 22 positive place invariants in 76 ms returned sat
[2020-06-03 22:43:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:43:15] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2020-06-03 22:43:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:43:15] [INFO ] [Nat]Absence check using 22 positive place invariants in 28 ms returned sat
[2020-06-03 22:43:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:43:15] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2020-06-03 22:43:15] [INFO ] Computed and/alt/rep : 32/42/32 causal constraints in 16 ms.
[2020-06-03 22:43:16] [INFO ] Added : 22 causal constraints over 5 iterations in 64 ms. Result :sat
[2020-06-03 22:43:16] [INFO ] [Real]Absence check using 22 positive place invariants in 15 ms returned sat
[2020-06-03 22:43:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:43:16] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2020-06-03 22:43:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:43:16] [INFO ] [Nat]Absence check using 22 positive place invariants in 10 ms returned sat
[2020-06-03 22:43:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:43:16] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2020-06-03 22:43:16] [INFO ] Computed and/alt/rep : 32/42/32 causal constraints in 2 ms.
[2020-06-03 22:43:16] [INFO ] Added : 21 causal constraints over 5 iterations in 22 ms. Result :sat
[2020-06-03 22:43:16] [INFO ] [Real]Absence check using 22 positive place invariants in 11 ms returned sat
[2020-06-03 22:43:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:43:16] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2020-06-03 22:43:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:43:16] [INFO ] [Nat]Absence check using 22 positive place invariants in 32 ms returned sat
[2020-06-03 22:43:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:43:16] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2020-06-03 22:43:16] [INFO ] Computed and/alt/rep : 32/42/32 causal constraints in 4 ms.
[2020-06-03 22:43:16] [INFO ] Added : 21 causal constraints over 5 iterations in 56 ms. Result :sat
[2020-06-03 22:43:16] [INFO ] [Real]Absence check using 22 positive place invariants in 5 ms returned sat
[2020-06-03 22:43:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:43:16] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2020-06-03 22:43:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:43:16] [INFO ] [Nat]Absence check using 22 positive place invariants in 6 ms returned sat
[2020-06-03 22:43:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:43:16] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2020-06-03 22:43:16] [INFO ] Computed and/alt/rep : 32/42/32 causal constraints in 3 ms.
[2020-06-03 22:43:16] [INFO ] Added : 22 causal constraints over 5 iterations in 47 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-03 22:43:17] [INFO ] Flatten gal took : 26 ms
[2020-06-03 22:43:17] [INFO ] Flatten gal took : 6 ms
[2020-06-03 22:43:17] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2020-06-03 22:43:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ RefineWMG-PT-010011 @ 3570 seconds

FORMULA n0-CTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-09 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2351
rslt: Output for CTLCardinality @ RefineWMG-PT-010011

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p26 + 1 <= p48)",
"processed_size": 16,
"rewrites": 19
},
"result":
{
"edges": 37,
"markings": 34,
"produced_by": "state space /EXEF",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 276
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((p5 <= p26)))",
"processed_size": 19,
"rewrites": 18
},
"result":
{
"edges": 64,
"markings": 65,
"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": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 301
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 2,
"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": 2,
"visible_transitions": 0
},
"processed": "E (F (((p7 <= p33) AND (2 <= p7))))",
"processed_size": 35,
"rewrites": 17
},
"result":
{
"edges": 15,
"markings": 14,
"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": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 332
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F ((p27 + 1 <= p28)))",
"processed_size": 24,
"rewrites": 17
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 6,
"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": 369
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 2,
"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": "E (F (((p12 <= 0) AND (p36 <= p35))))",
"processed_size": 37,
"rewrites": 17
},
"result":
{
"edges": 39,
"markings": 40,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 415
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "E (F (((3 <= p25) AND (2 <= p47) AND ((p9 <= p45) OR (p41 <= p14)))))",
"processed_size": 70,
"rewrites": 17
},
"result":
{
"edges": 20,
"markings": 21,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 474
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"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": "((p2 <= 0) OR (p24 <= 2))",
"processed_size": 26,
"rewrites": 16
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 9,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 589
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "((1 <= p21) OR (p30 + 1 <= p39) OR (p36 + 1 <= p23) OR ((p8 + 1 <= p7) AND (p26 <= 0)))",
"processed_size": 90,
"rewrites": 16
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 737
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"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": 3,
"visible_transitions": 0
},
"processed": "A (G (((p2 + 1 <= p36) OR (p34 + 1 <= p36))))",
"processed_size": 46,
"rewrites": 18
},
"result":
{
"edges": 29,
"markings": 30,
"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": 11,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 737
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G ((G ((1 <= p11)) OR (((p32 <= p15) OR (p50 <= p20)))))",
"processed_size": 57,
"rewrites": 18
},
"result":
{
"edges": 12435,
"markings": 8633,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "universal single path",
"workflow": "product automaton"
}
},

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2949
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"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": "E (F (((p29 <= 0) AND (p12 + 1 <= p1))))",
"processed_size": 40,
"rewrites": 17
},
"result":
{
"edges": 5,
"markings": 6,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 15,
"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": 14,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2948
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"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": "((1 <= p10) AND ((2 <= p24) OR ((p35 <= 2) AND (p23 <= 1))))",
"processed_size": 61,
"rewrites": 16
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F ((p26 <= p45)))",
"processed_size": 20,
"rewrites": 17
},
"result":
{
"edges": 36,
"markings": 37,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 17,
"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": 1
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F ((p50 + 1 <= p16)))",
"processed_size": 24,
"rewrites": 17
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 18,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p29 <= p49)",
"processed_size": 12,
"rewrites": 16
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 17,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 17,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"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": "((1 <= p10) AND ((2 <= p24) OR ((p35 <= 2) AND (p23 <= 1))))",
"processed_size": 61,
"rewrites": 16
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 18,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G ((1 <= p26)))",
"processed_size": 18,
"rewrites": 18
},
"result":
{
"edges": 96,
"markings": 97,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 19,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 18,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 4152,
"runtime": 1219.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(**)) : (** AND A(X(A(G(**))))) : A(G(**)) : E(F(*)) : E(F(*)) : (E(F(**)) AND (E((** U **)) OR **)) : (** OR (E(F(*)) AND (A(G(**)) AND E(F(**))))) : E(F(**)) : (A(G(**)) AND **) : E((A(X(**)) U A(G(**)))) : A(G((A(G(**)) OR **))) : (A(G(**)) AND A(G(**))) : E(F(**)) : (A(G(E(F(**)))) AND **) : E(F(**)) : (A(G(**)) AND **)"
},
"net":
{
"arcs": 128,
"conflict_clusters": 33,
"places": 54,
"places_significant": 32,
"singleton_clusters": 0,
"transitions": 43
},
"result":
{
"preliminary_value": "no no no yes yes yes no yes no unknown no no yes unknown yes no ",
"value": "no no no yes yes yes no yes no unknown no no yes unknown yes no "
},
"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: 97/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1728
lola: finding significant places
lola: 54 places, 43 transitions, 32 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: A (G ((p5 <= p26))) : ((2 <= p7) AND A (G (A (X ((p48 <= p26)))))) : A (G ((1 <= p52))) : NOT(A (G (((p33 + 1 <= p7) OR (p7 <= 1))))) : NOT(A (G (((1 <= p12) OR (p35 + 1 <= p36))))) : (E (F (((p29 <= 0) AND (p12 + 1 <= p1)))) AND (E (((3 <= p10) U (3 <= p15))) OR (A (X ((0 <= 0))) AND (p13 + 1 <= p37)))) : (((1 <= p10) AND ((2 <= p24) OR ((p35 <= 2) AND (p23 <= 1)))) OR ((NOT(A (G ((p16 <= p50)))) AND A (G ((1 <= p26)))) AND E (F ((p26 <= p45))))) : E (F ((2 <= p20))) : (A (G ((1 <= p27))) AND ((p2 <= 0) OR (p24 <= 2))) : E ((A (X ((2 <= p42))) U A (G ((p6 <= p1))))) : A (G ((A (G ((1 <= p11))) OR (((p32 <= p15) OR (p50 <= p20)))))) : A (G ((A (G ((1 <= p21))) AND ((3 <= p2) OR (p38 <= p1) OR (p21 + 1 <= p10))))) : E (F (((3 <= p25) AND (2 <= p47) AND ((p9 <= p45) OR (p41 <= p14))))) : (A (G (E (F ((3 <= p46))))) AND (p29 <= p49)) : E (F ((p27 + 1 <= p28))) : (A (G (((p2 + 1 <= p36) OR (p34 + 1 <= p36)))) AND ((1 <= p21) OR (p30 + 1 <= p39) OR (p36 + 1 <= p23) OR ((p8 + 1 <= p7) AND (p26 <= 0))))
lola: rewrite Frontend/Parser/formula_rewrite.k:398
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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:136
lola: rewrite Frontend/Parser/formula_rewrite.k:116
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:389
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((2 <= p7) AND A (X (A (G ((p48 <= p26))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= p7)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p7)
lola: processed formula length: 9
lola: 16 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 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 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G ((p48 <= p26)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:624
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p26 + 1 <= p48)
lola: processed formula length: 16
lola: 19 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p26 + 1 <= p48)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: result: no
lola: produced by: state space /EXEF
lola: The predicate is not invariant from successors.
lola: 34 markings, 37 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((A (X ((2 <= p42))) U A (G ((p6 <= p1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(AX((2 <= p42)) U AG((p6 <= p1)))
lola: processed formula length: 34
lola: 19 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2327118 markings, 5922819 edges, 465424 markings/sec, 0 secs
lola: 4527797 markings, 11523853 edges, 440136 markings/sec, 5 secs
lola: 6748445 markings, 17175712 edges, 444130 markings/sec, 10 secs
lola: 8913380 markings, 22685770 edges, 432987 markings/sec, 15 secs
lola: 11103064 markings, 28258816 edges, 437937 markings/sec, 20 secs
lola: 13246142 markings, 33713252 edges, 428616 markings/sec, 25 secs
lola: 15458569 markings, 39344178 edges, 442485 markings/sec, 30 secs
lola: 17644842 markings, 44908558 edges, 437255 markings/sec, 35 secs
lola: 19854246 markings, 50531794 edges, 441881 markings/sec, 40 secs
lola: 22036300 markings, 56085435 edges, 436411 markings/sec, 45 secs
lola: 24256185 markings, 61735346 edges, 443977 markings/sec, 50 secs
lola: 26504235 markings, 67456936 edges, 449610 markings/sec, 55 secs
lola: 28750088 markings, 73172948 edges, 449171 markings/sec, 60 secs
lola: 30921827 markings, 78700327 edges, 434348 markings/sec, 65 secs
lola: 33116563 markings, 84286231 edges, 438947 markings/sec, 70 secs
lola: 35289669 markings, 89817092 edges, 434621 markings/sec, 75 secs
lola: 37417902 markings, 95233749 edges, 425647 markings/sec, 80 secs
lola: 39557350 markings, 100678941 edges, 427890 markings/sec, 85 secs
lola: 41689525 markings, 106105613 edges, 426435 markings/sec, 90 secs
lola: 43833867 markings, 111563267 edges, 428868 markings/sec, 95 secs
lola: 45953974 markings, 116959232 edges, 424021 markings/sec, 100 secs
lola: 48052752 markings, 122300914 edges, 419756 markings/sec, 105 secs
lola: 50154511 markings, 127650190 edges, 420352 markings/sec, 110 secs
lola: 52279790 markings, 133059323 edges, 425056 markings/sec, 115 secs
lola: 54438869 markings, 138554476 edges, 431816 markings/sec, 120 secs
lola: 56661766 markings, 144212050 edges, 444579 markings/sec, 125 secs
lola: 58857185 markings, 149799701 edges, 439084 markings/sec, 130 secs
lola: 60466872 markings, 153896573 edges, 321937 markings/sec, 135 secs
lola: 60826177 markings, 154811065 edges, 71861 markings/sec, 140 secs
lola: 60835018 markings, 154833563 edges, 1768 markings/sec, 145 secs
lola: 60849445 markings, 154870280 edges, 2885 markings/sec, 150 secs
lola: 61384595 markings, 156233128 edges, 107030 markings/sec, 155 secs
lola: 62244519 markings, 158421221 edges, 171985 markings/sec, 160 secs
lola: 64009069 markings, 162913826 edges, 352910 markings/sec, 165 secs
lola: 65761759 markings, 167372798 edges, 350538 markings/sec, 170 secs
lola: 67661933 markings, 172209015 edges, 380035 markings/sec, 175 secs
lola: 67752420 markings, 172439314 edges, 18097 markings/sec, 180 secs
lola: 67752420 markings, 172439314 edges, 0 markings/sec, 185 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p20)))
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 ((2 <= p20)))
lola: processed formula length: 18
lola: 17 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: (2 <= p20)
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: 16 markings, 15 edges
lola: state equation: write sara problem file to CTLCardinality-2-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 3 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p52)))
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 <= p52)))
lola: processed formula length: 18
lola: 18 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: (p52 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 12 markings, 11 edges
lola: state equation: write sara problem file to CTLCardinality-3-0.sara
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 4 will run for 276 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p5 <= p26)))
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 ((p5 <= p26)))
lola: processed formula length: 19
lola: 18 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k: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: (p26 + 1 <= p5)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate is not invariant.
lola: 65 markings, 64 edges
lola: ========================================
lola: subprocess 5 will run for 301 seconds at most (--localtimelimit=0)
lola: ========================================
sara: try reading problem file CTLCardinality-3-0.sara.
sara: try reading problem file CTLCardinality-2-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: ...considering subproblem: E (F (((p7 <= p33) AND (2 <= p7))))
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 (((p7 <= p33) AND (2 <= p7))))
lola: processed formula length: 35
lola: 17 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: ((p7 <= p33) AND (2 <= p7))
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: 14 markings, 15 edges
lola: ========================================
lola: subprocess 6 will run for 332 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p27 + 1 <= p28)))
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 ((p27 + 1 <= p28)))
lola: processed formula length: 24
lola: 17 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: (p27 + 1 <= p28)
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: 7 markings, 6 edges
lola: state equation: write sara problem file to CTLCardinality-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-6-0.sara.
sara: place or transition ordering is non-deterministic

lola: ========================================
lola: subprocess 7 will run for 369 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p12 <= 0) AND (p36 <= p35))))
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 (((p12 <= 0) AND (p36 <= p35))))
lola: processed formula length: 37
lola: 17 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: ((p12 <= 0) AND (p36 <= p35))
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: write sara problem file to CTLCardinality-7-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 40 markings, 39 edges
lola: ========================================
lola: subprocess 8 will run for 415 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p25) AND (2 <= p47) AND ((p9 <= p45) OR (p41 <= p14)))))
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 (((3 <= p25) AND (2 <= p47) AND ((p9 <= p45) OR (p41 <= p14)))))
lola: processed formula length: 70
lola: 17 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: ((3 <= p25) AND (2 <= p47) AND ((p9 <= p45) OR (p41 <= p14)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 21 markings, 20 edges
lola: state equation: write sara problem file to CTLCardinality-8-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 9 will run for 474 seconds at most (--localtimelimit=0)
lola: ========================================
sara: try reading problem file CTLCardinality-8-0.sara.
sara: place or transition ordering is non-deterministic

lola: ...considering subproblem: (A (G ((1 <= p27))) AND ((p2 <= 0) OR (p24 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 474 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p2 <= 0) OR (p24 <= 2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p2 <= 0) OR (p24 <= 2))
lola: processed formula length: 26
lola: 16 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 10 will run for 553 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p27)))
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 <= p27)))
lola: processed formula length: 18
lola: 18 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p27 <= 0)
lola: state equation task get result unparse finished id 0
lola: The predicate is not invariant.
lola: 12 markings, 11 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 553 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (E (F ((3 <= p46))))) AND (p29 <= p49))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 553 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p29 <= p49)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p29 <= p49)
lola: processed formula length: 12
lola: 16 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 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 11 will run for 664 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((3 <= p46)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: (3 <= p46)
lola: processed formula length: 10
lola: 19 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
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:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p46 <= 2)
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-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-11-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (3 <= p46)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation 0: solution produced
lola: state equation: write sara problem file to CTLCardinality-11-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-11-1.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 5744154 markings, 8877310 edges, 1148831 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 11368193 markings, 17569008 edges, 1124808 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 16903864 markings, 26124135 edges, 1107134 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 22603325 markings, 34932389 edges, 1139892 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 28307692 markings, 43748226 edges, 1140873 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 34090510 markings, 52685313 edges, 1156564 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 39881640 markings, 61635241 edges, 1158226 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 45550232 markings, 70395783 edges, 1133718 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 51062429 markings, 78914640 edges, 1102439 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 56512734 markings, 87337835 edges, 1090061 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 61899469 markings, 95662785 edges, 1077347 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 67248934 markings, 103930147 edges, 1069893 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 72681047 markings, 112325236 edges, 1086423 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 78422517 markings, 121198413 edges, 1148294 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 83816988 markings, 129535323 edges, 1078894 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 89175513 markings, 137816682 edges, 1071705 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 94744416 markings, 146423160 edges, 1113781 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 100233979 markings, 154907033 edges, 1097913 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 105848833 markings, 163584530 edges, 1122971 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 107975438 markings, 166871107 edges, 425321 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 108688341 markings, 167972869 edges, 142581 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 110020608 markings, 170031826 edges, 266453 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 113398941 markings, 175252886 edges, 675667 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 115463353 markings, 178443340 edges, 412882 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 115656411 markings, 178741696 edges, 38612 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 115656411 markings, 178741696 edges, 0 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 118087810 markings, 182499318 edges, 486280 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 119539551 markings, 184742920 edges, 290348 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 119539551 markings, 184742920 edges, 0 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 119539551 markings, 184742920 edges, 0 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 119539551 markings, 184742920 edges, 0 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 120559301 markings, 186318900 edges, 203950 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 120982803 markings, 186973401 edges, 84700 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 122008088 markings, 188557930 edges, 205057 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 122100240 markings, 188700348 edges, 18430 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 122147371 markings, 188773176 edges, 9426 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 123960368 markings, 191575097 edges, 362599 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 123960368 markings, 191575097 edges, 0 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 124210432 markings, 191961549 edges, 50013 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 124707286 markings, 192729419 edges, 99371 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 124725965 markings, 192758280 edges, 3736 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 124753464 markings, 192800784 edges, 5500 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 125029771 markings, 193227806 edges, 55261 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 125349248 markings, 193721541 edges, 63895 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 126112117 markings, 194900519 edges, 152574 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 126119709 markings, 194912258 edges, 1518 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 126533786 markings, 195552193 edges, 82815 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 126638631 markings, 195714217 edges, 20969 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 127263207 markings, 196679476 edges, 124915 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 127263207 markings, 196679476 edges, 0 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 127295671 markings, 196729647 edges, 6493 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 127681268 markings, 197325566 edges, 77119 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 127806582 markings, 197519241 edges, 25063 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 128458483 markings, 198526718 edges, 130380 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 128925440 markings, 199248382 edges, 93391 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 132526640 markings, 204813874 edges, 720240 markings/sec, 275 secs
lola: sara is running 280 secs || sara is running 280 secs || 132768527 markings, 205187702 edges, 48377 markings/sec, 280 secs
lola: sara is running 285 secs || sara is running 285 secs || 132815231 markings, 205259881 edges, 9341 markings/sec, 285 secs
lola: sara is running 290 secs || sara is running 290 secs || 133141571 markings, 205764217 edges, 65268 markings/sec, 290 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 11 will run for 589 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((p2 + 1 <= p36) OR (p34 + 1 <= p36)))) AND ((1 <= p21) OR (p30 + 1 <= p39) OR (p36 + 1 <= p23) OR ((p8 + 1 <= p7) AND (p26 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 589 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p21) OR (p30 + 1 <= p39) OR (p36 + 1 <= p23) OR ((p8 + 1 <= p7) AND (p26 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p21) OR (p30 + 1 <= p39) OR (p36 + 1 <= p23) OR ((p8 + 1 <= p7) AND (p26 <= 0)))
lola: processed formula length: 90
lola: 16 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 5 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 12 will run for 737 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p2 + 1 <= p36) OR (p34 + 1 <= p36))))
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 (((p2 + 1 <= p36) OR (p34 + 1 <= p36))))
lola: processed formula length: 46
lola: 18 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 30 markings, 29 edges
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: ((p36 <= p2) AND (p36 <= p34))
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: write sara problem file to CTLCardinality-12-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 737 seconds at most (--localtimelimit=0)
lola: ========================================
sara: try reading problem file CTLCardinality-12-0.sara.
sara: place or transition ordering is non-deterministic

lola: ...considering subproblem: A (G ((A (G ((1 <= p11))) OR (((p32 <= p15) OR (p50 <= p20))))))
lola: ========================================
lola: SUBTASK
lola: checking a universal CTL formula with single counterexample path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G ((1 <= p11)) OR (((p32 <= p15) OR (p50 <= p20)))))
lola: processed formula length: 57
lola: 18 rewrites
lola: closed formula file CTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The universal single path CTL formula does not hold.
lola: 8633 markings, 12435 edges
lola: ========================================
lola: subprocess 13 will run for 983 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((1 <= p21))) AND A (G (((3 <= p2) OR (p38 <= p1) OR (p21 + 1 <= p10)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 983 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p21)))
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 <= p21)))
lola: processed formula length: 18
lola: 18 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: (p21 <= 0)
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-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-13-0.sara.
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 103 markings, 102 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 1474 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((p29 <= 0) AND (p12 + 1 <= p1)))) AND (E (((3 <= p10) U (3 <= p15))) OR (p13 + 1 <= p37)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1474 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p13 + 1 <= p37)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p13 + 1 <= p37)
lola: processed formula length: 16
lola: 16 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 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 15 will run for 2949 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p29 <= 0) AND (p12 + 1 <= p1))))
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 (((p29 <= 0) AND (p12 + 1 <= p1))))
lola: processed formula length: 40
lola: 17 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: ((p29 <= 0) AND (p12 + 1 <= p1))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: state equation: write sara problem file to CTLCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-15-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 15 will run for 2948 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p10) AND ((2 <= p24) OR ((p35 <= 2) AND (p23 <= 1)))) OR (E (F ((p50 + 1 <= p16))) AND (A (G ((1 <= p26))) AND E (F ((p26 <= p45))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2948 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p10) AND ((2 <= p24) OR ((p35 <= 2) AND (p23 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p10) AND ((2 <= p24) OR ((p35 <= 2) AND (p23 <= 1))))
lola: processed formula length: 61
lola: 16 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 4 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p26 <= p45)))
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 ((p26 <= p45)))
lola: processed formula length: 20
lola: 17 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: (p26 <= p45)
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: 37 markings, 36 edges
lola: state equation: write sara problem file to CTLCardinality-17-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-17-0.sara.
sara: place or transition ordering is non-deterministic

lola: ========================================
lola: subprocess 18 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p50 + 1 <= p16)))
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 ((p50 + 1 <= p16)))
lola: processed formula length: 24
lola: 17 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
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: (p50 + 1 <= p16)
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-18-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-18-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E ((A (X ((2 <= p42))) U A (G ((p6 <= p1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(AX((2 <= p42)) U AG((p6 <= p1)))
lola: processed formula length: 34
lola: 19 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2316283 markings, 5895237 edges, 463257 markings/sec, 0 secs
lola: 4524862 markings, 11516384 edges, 441716 markings/sec, 5 secs
lola: 6711834 markings, 17082531 edges, 437394 markings/sec, 10 secs
lola: 8881831 markings, 22605482 edges, 433999 markings/sec, 15 secs
lola: 11073406 markings, 28183334 edges, 438315 markings/sec, 20 secs
lola: 13158466 markings, 33490104 edges, 417012 markings/sec, 25 secs
lola: 15392581 markings, 39176236 edges, 446823 markings/sec, 30 secs
lola: 17603133 markings, 44802403 edges, 442110 markings/sec, 35 secs
lola: 19863382 markings, 50555050 edges, 452050 markings/sec, 40 secs
lola: 22074348 markings, 56182268 edges, 442193 markings/sec, 45 secs
lola: 24378631 markings, 62046986 edges, 460857 markings/sec, 50 secs
lola: 26671715 markings, 67883200 edges, 458617 markings/sec, 55 secs
lola: 28960369 markings, 73708136 edges, 457731 markings/sec, 60 secs
lola: 31143155 markings, 79263634 edges, 436557 markings/sec, 65 secs
lola: 33355695 markings, 84894859 edges, 442508 markings/sec, 70 secs
lola: 35539159 markings, 90452078 edges, 436693 markings/sec, 75 secs
lola: 37662555 markings, 95856423 edges, 424679 markings/sec, 80 secs
lola: 39792463 markings, 101277332 edges, 425982 markings/sec, 85 secs
lola: 41938523 markings, 106739349 edges, 429212 markings/sec, 90 secs
lola: 44072985 markings, 112171857 edges, 426892 markings/sec, 95 secs
lola: 46180027 markings, 117534565 edges, 421408 markings/sec, 100 secs
lola: 48349233 markings, 123055504 edges, 433841 markings/sec, 105 secs
lola: 50516726 markings, 128572076 edges, 433499 markings/sec, 110 secs
lola: 52703232 markings, 134137042 edges, 437301 markings/sec, 115 secs
lola: 54870324 markings, 139652591 edges, 433418 markings/sec, 120 secs
lola: 57104243 markings, 145338223 edges, 446784 markings/sec, 125 secs
lola: 59401988 markings, 151186302 edges, 459549 markings/sec, 130 secs
lola: 61559656 markings, 156692813 edges, 431534 markings/sec, 135 secs
lola: 62047014 markings, 157934190 edges, 97472 markings/sec, 140 secs
lola: 62471208 markings, 158997900 edges, 84839 markings/sec, 145 secs
lola: 62947659 markings, 160210527 edges, 95290 markings/sec, 150 secs
lola: 63401809 markings, 161366401 edges, 90830 markings/sec, 155 secs
lola: 63628827 markings, 161944203 edges, 45404 markings/sec, 160 secs
lola: 64157333 markings, 163289321 edges, 105701 markings/sec, 165 secs
lola: 65388858 markings, 166423717 edges, 246305 markings/sec, 170 secs
lola: 67128526 markings, 170851410 edges, 347934 markings/sec, 175 secs
lola: 68011276 markings, 173098141 edges, 176550 markings/sec, 180 secs
lola: 69109850 markings, 175894164 edges, 219715 markings/sec, 185 secs
lola: 70193401 markings, 178651954 edges, 216710 markings/sec, 190 secs
lola: 70193401 markings, 178651954 edges, 0 markings/sec, 195 secs
lola: 71435912 markings, 181814329 edges, 248502 markings/sec, 200 secs
lola: 72048436 markings, 183373269 edges, 122505 markings/sec, 205 secs
lola: 72676632 markings, 184972115 edges, 125639 markings/sec, 210 secs
lola: 72676632 markings, 184972115 edges, 0 markings/sec, 215 secs
lola: 72676632 markings, 184972115 edges, 0 markings/sec, 220 secs
lola: 73321534 markings, 186613474 edges, 128980 markings/sec, 225 secs
lola: 74673261 markings, 190053817 edges, 270345 markings/sec, 230 secs
lola: 74673261 markings, 190053817 edges, 0 markings/sec, 235 secs
lola: 75066583 markings, 191054871 edges, 78664 markings/sec, 240 secs
lola: 75497855 markings, 192152519 edges, 86254 markings/sec, 245 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (A (G (E (F ((3 <= p46))))) AND (p29 <= p49))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (p29 <= p49)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p29 <= p49)
lola: processed formula length: 12
lola: 16 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 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: ========================================
lola: ...considering subproblem: A (G (E (F ((3 <= p46)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: (3 <= p46)
lola: processed formula length: 10
lola: 19 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
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:787
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: state equation task get result unparse finished++ id 0
lola: formula 0: (p46 <= 2)
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 task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (3 <= p46)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-18-1.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLCardinality-18-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-18-0.sara.
sara: try reading problem file CTLCardinality-18-1.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: state equation 1: solution produced
lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 5735000 markings, 8863160 edges, 1147000 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 11496124 markings, 17766721 edges, 1152225 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 17199101 markings, 26580406 edges, 1140595 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 22991247 markings, 35531900 edges, 1158429 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 28694851 markings, 44346566 edges, 1140721 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 34505997 markings, 53327424 edges, 1162229 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 40373230 markings, 62394970 edges, 1173447 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 46073088 markings, 71203843 edges, 1139972 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 51657528 markings, 79834335 edges, 1116888 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 57121626 markings, 88278852 edges, 1092820 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 62519165 markings, 96620500 edges, 1079508 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 67933821 markings, 104988611 edges, 1082931 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 73493224 markings, 113580413 edges, 1111881 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 79280513 markings, 122524404 edges, 1157458 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 84900284 markings, 131209507 edges, 1123954 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 90510756 markings, 139880227 edges, 1122094 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 96215006 markings, 148695898 edges, 1140850 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 101711040 markings, 157189763 edges, 1099207 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 107355024 markings, 165912281 edges, 1128797 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 108052617 markings, 166990381 edges, 139519 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 108631056 markings, 167884333 edges, 115688 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 109818764 markings, 169719885 edges, 237542 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 109823270 markings, 169726841 edges, 901 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 109846701 markings, 169763056 edges, 4686 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 110655630 markings, 171013217 edges, 161786 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 111307776 markings, 172021083 edges, 130429 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 111911101 markings, 172953488 edges, 120665 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 111915888 markings, 172960894 edges, 957 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 112281043 markings, 173525216 edges, 73031 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 112845812 markings, 174398051 edges, 112954 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 113186867 markings, 174925130 edges, 68211 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 113313165 markings, 175120318 edges, 25260 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 113945849 markings, 176098104 edges, 126537 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 114572544 markings, 177066633 edges, 125339 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 114594318 markings, 177100289 edges, 4355 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 114833792 markings, 177470377 edges, 47895 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 115691775 markings, 178796341 edges, 171597 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 115934769 markings, 179171886 edges, 48599 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 116248239 markings, 179656338 edges, 62694 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 116869215 markings, 180616033 edges, 124195 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 117198976 markings, 181125660 edges, 65952 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 117563392 markings, 181688851 edges, 72883 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 117865600 markings, 182155898 edges, 60442 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 118303283 markings, 182832316 edges, 87537 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 118950062 markings, 183831893 edges, 129356 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 119184000 markings, 184193431 edges, 46788 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 119536275 markings, 184737859 edges, 70455 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 120467311 markings, 186176729 edges, 186207 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 122979697 markings, 190059507 edges, 502477 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 126634322 markings, 195707563 edges, 730925 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 126816354 markings, 195988882 edges, 36406 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 126816354 markings, 195988882 edges, 0 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 126993276 markings, 196262313 edges, 35384 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 131619298 markings, 203411614 edges, 925204 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 131661300 markings, 203476524 edges, 8400 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 131661300 markings, 203476524 edges, 0 markings/sec, 275 secs
lola: sara is running 280 secs || sara is running 280 secs || 131661300 markings, 203476524 edges, 0 markings/sec, 280 secs
lola: sara is running 285 secs || sara is running 285 secs || 131661300 markings, 203476524 edges, 0 markings/sec, 285 secs
lola: sara is running 290 secs || sara is running 290 secs || 131684126 markings, 203511805 edges, 4565 markings/sec, 290 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (((1 <= p10) AND ((2 <= p24) OR ((p35 <= 2) AND (p23 <= 1)))) OR (E (F ((p50 + 1 <= p16))) AND (A (G ((1 <= p26))) AND E (F ((p26 <= p45))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((1 <= p10) AND ((2 <= p24) OR ((p35 <= 2) AND (p23 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p10) AND ((2 <= p24) OR ((p35 <= 2) AND (p23 <= 1))))
lola: processed formula length: 61
lola: 16 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 4 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p26)))
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 <= p26)))
lola: processed formula length: 18
lola: 18 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: (p26 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 97 markings, 96 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no yes yes yes no yes no unknown no no yes unknown yes no
lola:
preliminary result: no no no yes yes yes no yes no unknown no no yes unknown yes no
lola: memory consumption: 4152 KB
lola: time consumption: 1219 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="RefineWMG-PT-010011"
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 RefineWMG-PT-010011, 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 r186-oct2-158987938400059"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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