Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r174-csrt-158987853800819.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off 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 PhaseVariation-PT-D30CS010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987853800819
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 30M
-rw-r--r-- 1 mcc users 4.7K Apr 12 01:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 12 01:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Apr 11 00:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K Apr 11 00:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.6K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Apr 14 12:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Apr 14 12:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 10 08:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Apr 10 08:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Apr 9 13:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 9 13:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 10 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 10 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 9 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 30M Mar 24 05:37 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PhaseVariation-PT-D30CS010-CTLCardinality-00
FORMULA_NAME PhaseVariation-PT-D30CS010-CTLCardinality-01
FORMULA_NAME PhaseVariation-PT-D30CS010-CTLCardinality-02
FORMULA_NAME PhaseVariation-PT-D30CS010-CTLCardinality-03
FORMULA_NAME PhaseVariation-PT-D30CS010-CTLCardinality-04
FORMULA_NAME PhaseVariation-PT-D30CS010-CTLCardinality-05
FORMULA_NAME PhaseVariation-PT-D30CS010-CTLCardinality-06
FORMULA_NAME PhaseVariation-PT-D30CS010-CTLCardinality-07
FORMULA_NAME PhaseVariation-PT-D30CS010-CTLCardinality-08
FORMULA_NAME PhaseVariation-PT-D30CS010-CTLCardinality-09
FORMULA_NAME PhaseVariation-PT-D30CS010-CTLCardinality-10
FORMULA_NAME PhaseVariation-PT-D30CS010-CTLCardinality-11
FORMULA_NAME PhaseVariation-PT-D30CS010-CTLCardinality-12
FORMULA_NAME PhaseVariation-PT-D30CS010-CTLCardinality-13
FORMULA_NAME PhaseVariation-PT-D30CS010-CTLCardinality-14
FORMULA_NAME PhaseVariation-PT-D30CS010-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591171659908

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 08:07:42] [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 08:07:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 08:07:43] [INFO ] Load time of PNML (sax parser for PT used): 1133 ms
[2020-06-03 08:07:43] [INFO ] Transformed 2702 places.
[2020-06-03 08:07:43] [INFO ] Transformed 30977 transitions.
[2020-06-03 08:07:43] [INFO ] Parsed PT model containing 2702 places and 30977 transitions in 1380 ms.
Deduced a syphon composed of 2 places in 73 ms
Reduce places removed 2 places and 52 transitions.
Reduce places removed 1 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 209 ms.
Incomplete random walk after 100000 steps, including 393 resets, run finished after 8625 ms. (steps per millisecond=11 ) properties seen :[1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1]
[2020-06-03 08:07:52] [INFO ] Flow matrix only has 1799 transitions (discarded 29126 similar events)
// Phase 1: matrix 1799 rows 2699 cols
[2020-06-03 08:07:52] [INFO ] Computed 900 place invariants in 189 ms
[2020-06-03 08:07:54] [INFO ] [Real]Absence check using 900 positive place invariants in 1115 ms returned unsat
[2020-06-03 08:07:55] [INFO ] [Real]Absence check using 900 positive place invariants in 339 ms returned unsat
[2020-06-03 08:07:56] [INFO ] [Real]Absence check using 900 positive place invariants in 978 ms returned unsat
[2020-06-03 08:07:57] [INFO ] [Real]Absence check using 900 positive place invariants in 614 ms returned unsat
[2020-06-03 08:07:58] [INFO ] [Real]Absence check using 900 positive place invariants in 107 ms returned unsat
[2020-06-03 08:07:59] [INFO ] [Real]Absence check using 900 positive place invariants in 1109 ms returned unsat
[2020-06-03 08:08:00] [INFO ] [Real]Absence check using 900 positive place invariants in 653 ms returned unsat
[2020-06-03 08:08:01] [INFO ] [Real]Absence check using 900 positive place invariants in 431 ms returned unsat
[2020-06-03 08:08:02] [INFO ] [Real]Absence check using 900 positive place invariants in 1101 ms returned unsat
[2020-06-03 08:08:03] [INFO ] [Real]Absence check using 900 positive place invariants in 207 ms returned unsat
[2020-06-03 08:08:03] [INFO ] [Real]Absence check using 900 positive place invariants in 401 ms returned unsat
[2020-06-03 08:08:04] [INFO ] [Real]Absence check using 900 positive place invariants in 866 ms returned unsat
[2020-06-03 08:08:06] [INFO ] [Real]Absence check using 900 positive place invariants in 930 ms returned unsat
Successfully simplified 13 atomic propositions for a total of 13 simplifications.
[2020-06-03 08:08:08] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-06-03 08:08:08] [INFO ] Flatten gal took : 1711 ms
[2020-06-03 08:08:09] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-06-03 08:08:09] [INFO ] Flatten gal took : 1217 ms
FORMULA PhaseVariation-PT-D30CS010-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhaseVariation-PT-D30CS010-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhaseVariation-PT-D30CS010-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhaseVariation-PT-D30CS010-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhaseVariation-PT-D30CS010-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhaseVariation-PT-D30CS010-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhaseVariation-PT-D30CS010-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhaseVariation-PT-D30CS010-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 08:08:09] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2020-06-03 08:08:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 217 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ PhaseVariation-PT-D30CS010 @ 3570 seconds

FORMULA PhaseVariation-PT-D30CS010-CTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D30CS010-CTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D30CS010-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D30CS010-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D30CS010-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D30CS010-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D30CS010-CTLCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D30CS010-CTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3134
rslt: Output for CTLCardinality @ PhaseVariation-PT-D30CS010

{
"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 08:08:10 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 435
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 16
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 696
},
"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": "(p1926 + 1 <= p2224)",
"processed_size": 20,
"rewrites": 20
},
"result":
{
"edges": 639,
"markings": 640,
"produced_by": "state space /EFEG",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 36
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence_from_all_states",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 822
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"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": "((p2050 <= p330) OR (p1145 <= p723) OR (p828 <= p1759))",
"processed_size": 57,
"rewrites": 19
},
"result":
{
"edges": 490,
"markings": 491,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 199
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1080
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"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": "((p1706 + 1 <= p65) R F ((p987 <= 0)))",
"processed_size": 38,
"rewrites": 25
},
"result":
{
"edges": 901,
"markings": 901,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "existential single path",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1574
},
"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": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (F (((p67 + 1 <= p1671) AND (p1684 + 1 <= p2064))))",
"processed_size": 53,
"rewrites": 17
},
"result":
{
"edges": 9,
"markings": 10,
"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": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3149
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"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": "((p963 <= p1355) OR (1 <= p1474) OR (p541 <= 0))",
"processed_size": 50,
"rewrites": 16
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3149
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "((p468 <= p2187))",
"processed_size": 17,
"rewrites": 19
},
"result":
{
"edges": 900,
"markings": 901,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 71
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 719440,
"runtime": 436.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(A(F(*)) AND (** OR (E(G(*)) OR **))) : TRUE : (E(F(*)) AND (** OR A(G(**)))) : A(G(E(X(**)))) : A(F(*)) : E(G(**)) : A(G(A(F(**)))) : E((** U E(G(**))))"
},
"net":
{
"arcs": 214641,
"conflict_clusters": 1,
"places": 2699,
"places_significant": 1799,
"singleton_clusters": 0,
"transitions": 30925
},
"result":
{
"preliminary_value": "no yes yes no no yes no yes ",
"value": "no yes yes no no yes no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 33624/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 86368
lola: finding significant places
lola: 2699 places, 30925 transitions, 1799 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLCardinality.xml
lola: LP says that atomic proposition is always false: (2 <= p531)
lola: LP says that atomic proposition is always false: (3 <= p1616)
lola: (NOT(E (G (((p468 <= p2187))))) AND (((p1191 <= p916) OR NOT(A (F ((1 <= p2572))))) OR ((p144 + 1 <= p180) AND (p2457 + 1 <= p2055)))) : E (G ((0 <= 0))) : (NOT(A (G (((p1671 <= p67) OR (p2064 <= p1684))))) AND (((p963 <= p1355) OR (1 <= p1474) OR (p541 <= 0)) OR A (G ((1 <= p1255))))) : A (G (E (X ((p1165 <= 0))))) : NOT(E (G (((p2050 <= p330) OR (p1145 <= p723) OR (p828 <= p1759))))) : E (G ((p306 <= p83))) : A (G (A (F ((p2224 <= p1926))))) : E (((p65 <= p1706) U E (G ((1 <= p987)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 435 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 16 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 497 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((p1165 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(EX((p1165 <= 0)))
lola: processed formula length: 20
lola: 18 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 14 markings, 13 edges
lola: ========================================
lola: subprocess 2 will run for 580 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p306 <= p83)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((p306 <= p83)))
lola: processed formula length: 21
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 / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p83 + 1 <= p306)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 19 markings, 18 edges
lola: ========================================
lola: subprocess 3 will run for 696 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((p2224 <= p1926)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all states
lola: rewrite Frontend/Parser/formula_rewrite.k:599
lola: rewrite Frontend/Parser/formula_rewrite.k:634
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p1926 + 1 <= p2224)
lola: processed formula length: 20
lola: 20 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p2224 <= p1926)
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 started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (p1926 + 1 <= p2224)
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-3-0.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLCardinality-3-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-3-0.sara.
sara: try reading problem file CTLCardinality-3-1.sara.
lola: sara is running 0 secs || sara is running 0 secs || 207 markings, 206 edges, 41 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 220 markings, 219 edges, 3 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 232 markings, 231 edges, 2 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 242 markings, 241 edges, 2 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 252 markings, 251 edges, 2 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 261 markings, 260 edges, 2 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 269 markings, 268 edges, 2 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 278 markings, 277 edges, 2 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 287 markings, 286 edges, 2 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 296 markings, 295 edges, 2 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 305 markings, 304 edges, 2 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 315 markings, 314 edges, 2 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 325 markings, 324 edges, 2 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 335 markings, 334 edges, 2 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 345 markings, 344 edges, 2 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 353 markings, 352 edges, 2 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 364 markings, 363 edges, 2 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 373 markings, 372 edges, 2 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 381 markings, 380 edges, 2 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 389 markings, 388 edges, 2 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 397 markings, 396 edges, 2 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 405 markings, 404 edges, 2 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 414 markings, 413 edges, 2 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 423 markings, 422 edges, 2 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 432 markings, 431 edges, 2 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 441 markings, 440 edges, 2 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 449 markings, 448 edges, 2 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 458 markings, 457 edges, 2 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 466 markings, 465 edges, 2 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 475 markings, 474 edges, 2 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 484 markings, 483 edges, 2 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 493 markings, 492 edges, 2 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 503 markings, 502 edges, 2 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 514 markings, 513 edges, 2 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 528 markings, 527 edges, 3 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 547 markings, 546 edges, 4 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 584 markings, 583 edges, 7 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 620 markings, 619 edges, 7 markings/sec, 185 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: The predicate does not eventually occur from all states.
lola: 640 markings, 639 edges
lola: ========================================
lola: subprocess 4 will run for 822 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((p330 + 1 <= p2050) AND (p723 + 1 <= p1145) AND (p1759 + 1 <= p828))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: ((p2050 <= p330) OR (p1145 <= p723) OR (p828 <= p1759))
lola: processed formula length: 57
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 / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p330 + 1 <= p2050) AND (p723 + 1 <= p1145) AND (p1759 + 1 <= p828))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-4-0.sara.
lola: 185 markings, 184 edges, 37 markings/sec, 0 secs || sara is running 0 secs
sara: place or transition ordering is non-deterministic

lola: 204 markings, 203 edges, 4 markings/sec, 5 secs || sara is running 5 secs
lola: 222 markings, 221 edges, 4 markings/sec, 10 secs || sara is running 10 secs
lola: 237 markings, 236 edges, 3 markings/sec, 15 secs || sara is running 15 secs
lola: 255 markings, 254 edges, 4 markings/sec, 20 secs || sara is running 20 secs
lola: 273 markings, 272 edges, 4 markings/sec, 25 secs || sara is running 25 secs
lola: 321 markings, 320 edges, 10 markings/sec, 30 secs || sara is running 30 secs
lola: 394 markings, 393 edges, 15 markings/sec, 35 secs || sara is running 35 secs
lola: 476 markings, 475 edges, 16 markings/sec, 40 secs || sara is running 40 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 491 markings, 490 edges
lola: ========================================
lola: subprocess 5 will run for 1080 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((p65 <= p1706) U E (G ((1 <= p987)))))
lola: ========================================
lola: SUBTASK
lola: checking an existential CTL formula with single witness path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:658
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:663
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:662
lola: rewrite Frontend/Parser/formula_rewrite.k:668
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: ((p1706 + 1 <= p65) R F ((p987 <= 0)))
lola: processed formula length: 38
lola: 25 rewrites
lola: closed formula file CTLCardinality.xml
lola: the resulting Büchi automaton has 2 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: 88 markings, 87 edges, 18 markings/sec, 0 secs
lola: 123 markings, 122 edges, 7 markings/sec, 5 secs
lola: 155 markings, 154 edges, 6 markings/sec, 10 secs
lola: 177 markings, 176 edges, 4 markings/sec, 15 secs
lola: 191 markings, 190 edges, 3 markings/sec, 20 secs
lola: 205 markings, 204 edges, 3 markings/sec, 25 secs
lola: 216 markings, 215 edges, 2 markings/sec, 30 secs
lola: 225 markings, 224 edges, 2 markings/sec, 35 secs
lola: 235 markings, 234 edges, 2 markings/sec, 40 secs
lola: 245 markings, 244 edges, 2 markings/sec, 45 secs
lola: 256 markings, 255 edges, 2 markings/sec, 50 secs
lola: 266 markings, 265 edges, 2 markings/sec, 55 secs
lola: 277 markings, 276 edges, 2 markings/sec, 60 secs
lola: 288 markings, 287 edges, 2 markings/sec, 65 secs
lola: 302 markings, 301 edges, 3 markings/sec, 70 secs
lola: 316 markings, 315 edges, 3 markings/sec, 75 secs
lola: 332 markings, 331 edges, 3 markings/sec, 80 secs
lola: 351 markings, 350 edges, 4 markings/sec, 85 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The existential single path CTL formula holds.
lola: 901 markings, 901 edges
lola: ========================================
lola: subprocess 6 will run for 1574 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((p67 + 1 <= p1671) AND (p1684 + 1 <= p2064)))) AND (((p963 <= p1355) OR (1 <= p1474) OR (p541 <= 0)) OR A (G ((1 <= p1255)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 1574 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p67 + 1 <= p1671) AND (p1684 + 1 <= p2064))))
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 (((p67 + 1 <= p1671) AND (p1684 + 1 <= p2064))))
lola: processed formula length: 53
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: ((p67 + 1 <= p1671) AND (p1684 + 1 <= p2064))
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: 10 markings, 9 edges
lola: subprocess 7 will run for 3149 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p963 <= p1355) OR (1 <= p1474) OR (p541 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p963 <= p1355) OR (1 <= p1474) OR (p541 <= 0))
lola: processed formula length: 50
lola: 16 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 3 atomic propositions
lola: ========================================
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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 7 will run for 3149 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (((p2187 + 1 <= p468)))) AND ((p1191 <= p916) OR (E (G ((p2572 <= 0))) OR ((p144 + 1 <= p180) AND (p2457 + 1 <= p2055)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: ========================================
lola: RUNNING
lola: subprocess 7 will run for 3149 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((p2187 + 1 <= p468))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: ((p468 <= p2187))
lola: processed formula length: 17
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 / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p2187 + 1 <= p468))
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-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-7-0.sara.
lola: 717 markings, 716 edges, 143 markings/sec, 0 secs || sara is running 0 secs
lola: 763 markings, 762 edges, 9 markings/sec, 5 secs || sara is running 5 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 901 markings, 900 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes no no yes no yes
lola:
preliminary result: no yes yes no no yes no yes
lola: memory consumption: 719440 KB
lola: time consumption: 436 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="PhaseVariation-PT-D30CS010"
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 PhaseVariation-PT-D30CS010, 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 r174-csrt-158987853800819"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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