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.r182-oct2-158987914200667.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 CSRepetitions-PT-03, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987914200667
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 11K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 34K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 11K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 35K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 35K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.3K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_col
-rw-r--r-- 1 mcc users 3 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 71K Apr 27 15:14 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 CSRepetitions-PT-03-CTLCardinality-00
FORMULA_NAME CSRepetitions-PT-03-CTLCardinality-01
FORMULA_NAME CSRepetitions-PT-03-CTLCardinality-02
FORMULA_NAME CSRepetitions-PT-03-CTLCardinality-03
FORMULA_NAME CSRepetitions-PT-03-CTLCardinality-04
FORMULA_NAME CSRepetitions-PT-03-CTLCardinality-05
FORMULA_NAME CSRepetitions-PT-03-CTLCardinality-06
FORMULA_NAME CSRepetitions-PT-03-CTLCardinality-07
FORMULA_NAME CSRepetitions-PT-03-CTLCardinality-08
FORMULA_NAME CSRepetitions-PT-03-CTLCardinality-09
FORMULA_NAME CSRepetitions-PT-03-CTLCardinality-10
FORMULA_NAME CSRepetitions-PT-03-CTLCardinality-11
FORMULA_NAME CSRepetitions-PT-03-CTLCardinality-12
FORMULA_NAME CSRepetitions-PT-03-CTLCardinality-13
FORMULA_NAME CSRepetitions-PT-03-CTLCardinality-14
FORMULA_NAME CSRepetitions-PT-03-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591171273072

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 08:01:16] [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:01:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 08:01:16] [INFO ] Load time of PNML (sax parser for PT used): 36 ms
[2020-06-03 08:01:16] [INFO ] Transformed 58 places.
[2020-06-03 08:01:16] [INFO ] Transformed 81 transitions.
[2020-06-03 08:01:16] [INFO ] Parsed PT model containing 58 places and 81 transitions in 67 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 29 ms.
Incomplete random walk after 100000 steps, including 3336 resets, run finished after 437 ms. (steps per millisecond=228 ) properties seen :[1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0]
// Phase 1: matrix 81 rows 58 cols
[2020-06-03 08:01:16] [INFO ] Computed 12 place invariants in 3 ms
[2020-06-03 08:01:16] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned unsat
[2020-06-03 08:01:16] [INFO ] [Real]Absence check using 12 positive place invariants in 17 ms returned unsat
[2020-06-03 08:01:17] [INFO ] [Real]Absence check using 12 positive place invariants in 16 ms returned sat
[2020-06-03 08:01:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 08:01:17] [INFO ] [Real]Absence check using state equation in 35 ms returned unsat
[2020-06-03 08:01:17] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned unsat
[2020-06-03 08:01:17] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned unsat
[2020-06-03 08:01:17] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
[2020-06-03 08:01:17] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned unsat
[2020-06-03 08:01:17] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned unsat
[2020-06-03 08:01:17] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
[2020-06-03 08:01:17] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
[2020-06-03 08:01:17] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
Successfully simplified 11 atomic propositions for a total of 11 simplifications.
[2020-06-03 08:01:17] [INFO ] Initial state reduction rules for CTL removed 9 formulas.
[2020-06-03 08:01:17] [INFO ] Flatten gal took : 30 ms
[2020-06-03 08:01:17] [INFO ] Initial state reduction rules for CTL removed 9 formulas.
[2020-06-03 08:01:17] [INFO ] Flatten gal took : 12 ms
FORMULA CSRepetitions-PT-03-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-03-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-03-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-03-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-03-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-03-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-03-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-03-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-03-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 08:01:17] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2020-06-03 08:01:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ CSRepetitions-PT-03 @ 3570 seconds

FORMULA CSRepetitions-PT-03-CTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-PT-03-CTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-PT-03-CTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-PT-03-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-PT-03-CTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-PT-03-CTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-PT-03-CTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for CTLCardinality @ CSRepetitions-PT-03

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"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": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(p33 + p50 + p56 <= 0)",
"processed_size": 22,
"rewrites": 10
},
"result":
{
"edges": 16,
"markings": 15,
"produced_by": "state space /EXEF",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"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": 21,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "((p2 + p8 + p16 + p21 + p25 + p38 + p47 + p41 + p43 <= 0) OR (p33 + p50 + p56 + 1 <= p2 + p8 + p16 + p21 + p25 + p38 + p47 + p41 + p43))",
"processed_size": 137,
"rewrites": 8
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "E (((p33 + p50 + p56 <= p48) U (p48 <= p2 + p8 + p16 + p21 + p25 + p38 + p47 + p41 + p43)))",
"processed_size": 91,
"rewrites": 11
},
"result":
{
"edges": 2304,
"markings": 512,
"produced_by": "state space /EU",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 36
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "existential_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 18,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 18,
"visible_transitions": 0
},
"processed": "AX((p2 + p8 + p16 + p21 + p25 + p38 + p47 + p41 + p43 <= p0 + p5 + p10 + p13 + p17 + p44 + p37 + p49 + p31))",
"processed_size": 108,
"rewrites": 9
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"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": 27,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 27,
"visible_transitions": 0
},
"processed": "(p1 + p3 + p4 + p6 + p9 + p11 + p12 + p14 + p18 + p19 + p20 + p22 + p24 + p27 + p28 + p29 + p30 + p51 + p32 + p34 + p35 + p39 + p42 + p46 + p45 + p52 + p57 <= 0)",
"processed_size": 161,
"rewrites": 11
},
"result":
{
"edges": 14,
"markings": 15,
"produced_by": "state space /EXEG",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 27
},
"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": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "AG((EX((p9 <= p49)) OR ((p12 + 1 <= p35) AND (p9 + 1 <= p16))))",
"processed_size": 63,
"rewrites": 10
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 15,
"markings": 16,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 45,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 45,
"visible_transitions": 0
},
"processed": "A (G (((p1 + p3 + p4 + p6 + p9 + p11 + p12 + p14 + p18 + p19 + p20 + p22 + p24 + p27 + p28 + p29 + p30 + p51 + p32 + p34 + p35 + p39 + p42 + p46 + p45 + p52 + p57 <= 2) AND (p2 + p8 + p16 + p21 + p25 + p38 + p47 + p41 + p43 + 1 <= p7 + p15 + p23 + p26 + p40 + p36 + p53 + p54 + p55))))",
"processed_size": 285,
"rewrites": 10
},
"result":
{
"edges": 11,
"markings": 12,
"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": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"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": 13,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "((p48 + 1 <= p33 + p50 + p56) R F ((p2 + p8 + p16 + p21 + p25 + p38 + p47 + p41 + p43 <= 1)))",
"processed_size": 93,
"rewrites": 17
},
"result":
{
"edges": 18,
"markings": 19,
"produced_by": "LTL model checker",
"value": false
},
"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": 3567
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"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": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "(3 <= p2 + p8 + p16 + p21 + p25 + p38 + p47 + p41 + p43)",
"processed_size": 56,
"rewrites": 8
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 6,
"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": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "(3 <= p2 + p8 + p16 + p21 + p25 + p38 + p47 + p41 + p43)",
"processed_size": 56,
"rewrites": 8
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 36,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 36,
"visible_transitions": 0
},
"processed": "AF(EG((p2 + p8 + p16 + p21 + p25 + p38 + p47 + p41 + p43 <= p1 + p3 + p4 + p6 + p9 + p11 + p12 + p14 + p18 + p19 + p20 + p22 + p24 + p27 + p28 + p29 + p30 + p51 + p32 + p34 + p35 + p39 + p42 + p46 + p45 + p52 + p57)))",
"processed_size": 217,
"rewrites": 10
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 55233,
"markings": 32885,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 19844,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(** OR A(F(E(G(**))))) : E((** U E(G(**)))) : E(X(E(F(*)))) : (E((** U **)) AND (** OR A(X(*)))) : (A(X(A(F(**)))) AND A(X(**))) : A(G(**)) : A(G((E(X(**)) OR **)))"
},
"net":
{
"arcs": 279,
"conflict_clusters": 11,
"places": 58,
"places_significant": 46,
"singleton_clusters": 0,
"transitions": 81
},
"result":
{
"preliminary_value": "no no yes no no no no ",
"value": "no no yes no no no 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: 139/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1856
lola: finding significant places
lola: 58 places, 81 transitions, 46 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: ((3 <= p2 + p8 + p16 + p21 + p25 + p38 + p47 + p41 + p43) OR A (F (E (G ((p2 + p8 + p16 + p21 + p25 + p38 + p47 + p41 + p43 <= p1 + p3 + p4 + p6 + p9 + p11 + p12 + p14 + p18 + p19 + p20 + p22 + p24 + p27 + p28 + p29 + p30 + p51 + p32 + p34 + p35 + p39 + p42 + p46 + p45 + p52 + p57)))))) : E (((p33 + p50 + p56 <= p48) U E (G ((2 <= p2 + p8 + p16 + p21 + p25 + p38 + p47 + p41 + p43))))) : E (F (NOT(A (X ((1 <= p33 + p50 + p56)))))) : (E (((p33 + p50 + p56 <= p48) U (p48 <= p2 + p8 + p16 + p21 + p25 + p38 + p47 + p41 + p43))) AND (((p2 + p8 + p16 + p21 + p25 + p38 + p47 + p41 + p43 <= 0) OR (p33 + p50 + p56 + 1 <= p2 + p8 + p16 + p21 + p25 + p38 + p47 + p41 + p43)) OR NOT(E (X ((p2 + p8 + p16 + p21 + p25 + p38 + p47 + p41 + p43 <= p33 + p50 + p56)))))) : A (X ((A (F ((1 <= p1 + p3 + p4 + p6 + p9 + p11 + p12 + p14 + p18 + p19 + p20 + p22 + p24 + p27 + p28 + p29 + p30 + p51 + p32 + p34 + p35 + p39 + p42 + p46 + p45 + p52 + p57))) AND (p2 + p8 + p16 + p21 + p25 + p38 + p47 + p41 + p43 <= p0 + p5 + p10 + p13 + p17 + p44 + p37 + p49 + p31)))) : A (G (((p1 + p3 + p4 + p6 + p9 + p11 + p12 + p14 + p18 + p19 + p20 + p22 + p24 + p27 + p28 + p29 + p30 + p51 + p32 + p34 + p35 + p39 + p42 + p46 + p45 + p52 + p57 <= 2) AND (p2 + p8 + p16 + p21 + p25 + p38 + p47 + p41 + p43 + 1 <= p7 + p15 + p23 + p26 + p40 + p36 + p53 + p54 + p55)))) : A (G ((E (X ((p9 <= p49))) OR ((p12 + 1 <= p35) AND (p9 + 1 <= p16)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:395
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((p33 + p50 + p56 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:623
lola: rewrite Frontend/Parser/formula_rewrite.k:714
lola: processed formula: (p33 + p50 + p56 <= 0)
lola: processed formula length: 22
lola: 10 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /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: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p33 + p50 + p56 <= 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: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 15 markings, 16 edges
lola: state equation: write sara problem file to CTLCardinality-0.sara
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 1 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (((p33 + p50 + p56 <= p48) U (p48 <= p2 + p8 + p16 + p21 + p25 + p38 + p47 + p41 + p43))) AND (((p2 + p8 + p16 + p21 + p25 + p38 + p47 + p41 + p43 <= 0) OR (p33 + p50 + p56 + 1 <= p2 + p8 + p16 + p21 + p25 + p38 + p47 + p41 + p43)) OR A (X ((p33 + p50 + p56 + 1 <= p2 + p8 + p16 + p21 + p25 + p38 + p47 + p41 + p43)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 594 seconds at most (--localtimelimit=0)
lola: sara: try reading problem file CTLCardinality-0.sara.
========================================
lola: ...considering subproblem: ((p2 + p8 + p16 + p21 + p25 + p38 + p47 + p41 + p43 <= 0) OR (p33 + p50 + p56 + 1 <= p2 + p8 + p16 + p21 + p25 + p38 + p47 + p41 + p43))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p2 + p8 + p16 + p21 + p25 + p38 + p47 + p41 + p43 <= 0) OR (p33 + p50 + p56 + 1 <= p2 + p8 + p16 + p21 + p25 + p38 + p47 + p41 + p43))
lola: processed formula length: 137
lola: 8 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: ========================================
sara: error: :78: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: subprocess 2 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((p33 + p50 + p56 <= p48) U (p48 <= p2 + p8 + p16 + p21 + p25 + p38 + p47 + p41 + p43)))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E (((p33 + p50 + p56 <= p48) U (p48 <= p2 + p8 + p16 + p21 + p25 + p38 + p47 + p41 + p43)))
lola: processed formula length: 91
lola: 11 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p48 <= p2 + p8 + p16 + p21 + p25 + p38 + p47 + p41 + p43)
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-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-2-0.sara.
sara: error: :78: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: There is no path where Predicate Phi holds until Predicate Psi.
lola: 512 markings, 2304 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (A (F ((1 <= p1 + p3 + p4 + p6 + p9 + p11 + p12 + p14 + p18 + p19 + p20 + p22 + p24 + p27 + p28 + p29 + p30 + p51 + p32 + p34 + p35 + p39 + p42 + p46 + p45 + p52 + p57))))) AND A (X ((p2 + p8 + p16 + p21 + p25 + p38 + p47 + p41 + p43 <= p0 + p5 + p10 + p13 + p17 + p44 + p37 + p49 + p31))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((p2 + p8 + p16 + p21 + p25 + p38 + p47 + p41 + p43 <= p0 + p5 + p10 + p13 + p17 + p44 + p37 + p49 + p31)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((p2 + p8 + p16 + p21 + p25 + p38 + p47 + p41 + p43 <= p0 + p5 + p10 + p13 + p17 + p44 + p37 + p49 + p31))
lola: processed formula length: 108
lola: 9 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((1 <= p1 + p3 + p4 + p6 + p9 + p11 + p12 + p14 + p18 + p19 + p20 + p22 + p24 + p27 + p28 + p29 + p30 + p51 + p32 + p34 + p35 + p39 + p42 + p46 + p45 + p52 + p57)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:754
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p1 + p3 + p4 + p6 + p9 + p11 + p12 + p14 + p18 + p19 + p20 + p22 + p24 + p27 + p28 + p29 + p30 + p51 + p32 + p34 + p35 + p39 + p42 + p46 + p45 + p52 + p57 <= 0)
lola: processed formula length: 161
lola: 11 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p1 + p3 + p4 + p6 + p9 + p11 + p12 + p14 + p18 + p19 + p20 + p22 + p24 + p27 + p28 + p29 + p30 + p51 + p32 + p34 + p35 + p39 + p42 + p46 + p45 + p52 + p57)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEG
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate does not eventually occur from all successors.
lola: 15 markings, 14 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((E (X ((p9 <= p49))) OR ((p12 + 1 <= p35) AND (p9 + 1 <= p16)))))
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((p9 <= p49)) OR ((p12 + 1 <= p35) AND (p9 + 1 <= p16))))
lola: processed formula length: 63
lola: 10 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 16 markings, 15 edges
lola: ========================================
lola: subprocess 4 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p1 + p3 + p4 + p6 + p9 + p11 + p12 + p14 + p18 + p19 + p20 + p22 + p24 + p27 + p28 + p29 + p30 + p51 + p32 + p34 + p35 + p39 + p42 + p46 + p45 + p52 + p57 <= 2) AND (p2 + p8 + p16 + p21 + p25 + p38 + p47 + p41 + p43 + 1 <= p7 + p15 + p23 + p26 + p40 + p36 + p53 + p54 + p55))))
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 (((p1 + p3 + p4 + p6 + p9 + p11 + p12 + p14 + p18 + p19 + p20 + p22 + p24 + p27 + p28 + p29 + p30 + p51 + p32 + p34 + p35 + p39 + p42 + p46 + p45 + p52 + p57 <= 2) AND (p2 + p8 + p16 + p21 + p25 + p38 + p47 + p41 + p43 + 1 <= p7 + p15 + p23 + p26 + p40 + p36 + p53 + p54 + p55))))
lola: processed formula length: 285
lola: 10 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
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: ((3 <= p1 + p3 + p4 + p6 + p9 + p11 + p12 + p14 + p18 + p19 + p20 + p22 + p24 + p27 + p28 + p29 + p30 + p51 + p32 + p34 + p35 + p39 + p42 + p46 + p45 + p52 + p57) OR (p7 + p15 + p23 + p26 + p40 + p36 + p53 + p54 + p55 <= p2 + p8 + p16 + p21 + p25 + p38 + p47 + p41 + p43))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 12 markings, 11 edges
lola: ========================================
lola: subprocess 5 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((p33 + p50 + p56 <= p48) U E (G ((2 <= p2 + p8 + p16 + p21 + p25 + p38 + p47 + p41 + p43)))))
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: ((p48 + 1 <= p33 + p50 + p56) R F ((p2 + p8 + p16 + p21 + p25 + p38 + p47 + p41 + p43 <= 1)))
lola: processed formula length: 93
lola: 17 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: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The existential single path CTL formula does not hold.
lola: 19 markings, 18 edges
lola: ========================================
lola: subprocess 6 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((3 <= p2 + p8 + p16 + p21 + p25 + p38 + p47 + p41 + p43) OR A (F (E (G ((p2 + p8 + p16 + p21 + p25 + p38 + p47 + p41 + p43 <= p1 + p3 + p4 + p6 + p9 + p11 + p12 + p14 + p18 + p19 + p20 + p22 + p24 + p27 + p28 + p29 + p30 + p51 + p32 + p34 + p35 + p39 + p42 + p46 + p45 + p52 + p57))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= p2 + p8 + p16 + p21 + p25 + p38 + p47 + p41 + p43)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p2 + p8 + p16 + p21 + p25 + p38 + p47 + p41 + p43)
lola: processed formula length: 56
lola: 8 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: 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: ((3 <= p2 + p8 + p16 + p21 + p25 + p38 + p47 + p41 + p43) OR A (F (E (G ((p2 + p8 + p16 + p21 + p25 + p38 + p47 + p41 + p43 <= p1 + p3 + p4 + p6 + p9 + p11 + p12 + p14 + p18 + p19 + p20 + p22 + p24 + p27 + p28 + p29 + p30 + p51 + p32 + p34 + p35 + p39 + p42 + p46 + p45 + p52 + p57))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (3 <= p2 + p8 + p16 + p21 + p25 + p38 + p47 + p41 + p43)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p2 + p8 + p16 + p21 + p25 + p38 + p47 + p41 + p43)
lola: processed formula length: 56
lola: 8 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F (E (G ((p2 + p8 + p16 + p21 + p25 + p38 + p47 + p41 + p43 <= p1 + p3 + p4 + p6 + p9 + p11 + p12 + p14 + p18 + p19 + p20 + p22 + p24 + p27 + p28 + p29 + p30 + p51 + p32 + p34 + p35 + p39 + p42 + p46 + p45 + p52 + p57)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(EG((p2 + p8 + p16 + p21 + p25 + p38 + p47 + p41 + p43 <= p1 + p3 + p4 + p6 + p9 + p11 + p12 + p14 + p18 + p19 + p20 + p22 + p24 + p27 + p28 + p29 + p30 + p51 + p32 + p34 + p35 + p39 + p42 + p46 + p45 + p52 + p57)))
lola: processed formula length: 217
lola: 10 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 32885 markings, 55233 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no no no no
lola:
preliminary result: no no yes no no no no
lola: memory consumption: 19844 KB
lola: time consumption: 3 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="CSRepetitions-PT-03"
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 CSRepetitions-PT-03, 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 r182-oct2-158987914200667"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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