Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r186-oct2-158987938700212.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 RobotManipulation-PT-01000, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-oct2-158987938700212
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 184K
-rw-r--r-- 1 mcc users 3.2K Apr 12 10:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 12 10:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Apr 11 12:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 24K Apr 11 12:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 14 12:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 14 12:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 10 16:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 10 16:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 9 22:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 9 22:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:38 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1591231073454

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 00:37:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 00:37:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 00:37:59] [INFO ] Load time of PNML (sax parser for PT used): 30 ms
[2020-06-04 00:37:59] [INFO ] Transformed 15 places.
[2020-06-04 00:37:59] [INFO ] Transformed 11 transitions.
[2020-06-04 00:37:59] [INFO ] Parsed PT model containing 15 places and 11 transitions in 73 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 23 ms.
Incomplete random walk after 100051 steps, including 0 resets, run finished after 71 ms. (steps per millisecond=1409 ) properties seen :[1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 11 rows 15 cols
[2020-06-04 00:38:00] [INFO ] Computed 6 place invariants in 14 ms
[2020-06-04 00:38:00] [INFO ] [Real]Absence check using 3 positive place invariants in 25 ms returned sat
[2020-06-04 00:38:00] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 25 ms returned sat
[2020-06-04 00:38:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 00:38:00] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2020-06-04 00:38:00] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 6 ms.
[2020-06-04 00:38:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 00:38:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2020-06-04 00:38:00] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 5 ms returned sat
[2020-06-04 00:38:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 00:38:00] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2020-06-04 00:38:00] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 2 ms.
[2020-06-04 00:38:00] [INFO ] Added : 8 causal constraints over 2 iterations in 16 ms. Result :sat
[2020-06-04 00:38:00] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-06-04 00:38:00] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-04 00:38:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 00:38:00] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2020-06-04 00:38:00] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 1 ms.
[2020-06-04 00:38:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 00:38:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-06-04 00:38:00] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-04 00:38:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 00:38:00] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2020-06-04 00:38:00] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 10 ms.
[2020-06-04 00:38:00] [INFO ] Added : 8 causal constraints over 2 iterations in 64 ms. Result :sat
[2020-06-04 00:38:00] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-06-04 00:38:00] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 5 ms returned sat
[2020-06-04 00:38:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 00:38:00] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2020-06-04 00:38:00] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 1 ms.
[2020-06-04 00:38:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 00:38:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2020-06-04 00:38:00] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-04 00:38:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 00:38:00] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2020-06-04 00:38:00] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 1 ms.
[2020-06-04 00:38:00] [INFO ] Added : 8 causal constraints over 2 iterations in 6 ms. Result :sat
[2020-06-04 00:38:00] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2020-06-04 00:38:00] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-04 00:38:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 00:38:00] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2020-06-04 00:38:00] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 1 ms.
[2020-06-04 00:38:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 00:38:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-06-04 00:38:00] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2020-06-04 00:38:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 00:38:00] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2020-06-04 00:38:00] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 1 ms.
[2020-06-04 00:38:00] [INFO ] Added : 8 causal constraints over 2 iterations in 7 ms. Result :sat
[2020-06-04 00:38:00] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-04 00:38:00] [INFO ] Flatten gal took : 31 ms
[2020-06-04 00:38:00] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-04 00:38:00] [INFO ] Flatten gal took : 4 ms
FORMULA RobotManipulation-PT-01000-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 00:38:00] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2020-06-04 00:38:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 0 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ RobotManipulation-PT-01000 @ 3570 seconds

FORMULA RobotManipulation-PT-01000-CTLFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-01000-CTLFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-01000-CTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-01000-CTLFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 0
rslt: Output for CTLFireability @ RobotManipulation-PT-01000

{
"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=CTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 00:38:01 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "AF(EG(((1 <= p12) AND (1 <= p7) AND (1 <= p11))))",
"processed_size": 49,
"rewrites": 35
},
"net":
{
"conflict_clusters": 9,
"singleton_clusters": 0
},
"result":
{
"edges": 4012,
"markings": 2006,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "AX(((1 <= p10) OR ((1 <= p3) AND (1 <= p5)) OR ((1 <= p12) AND (1 <= p1) AND (1 <= p5))))",
"processed_size": 91,
"rewrites": 34
},
"net":
{
"conflict_clusters": 9,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "AF(EX(((1 <= p8) OR ((1 <= p7) AND (1 <= p11)))))",
"processed_size": 50,
"rewrites": 35
},
"net":
{
"conflict_clusters": 9,
"singleton_clusters": 0
},
"result":
{
"edges": 4002,
"markings": 4003,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 3,
"E": 2,
"F": 1,
"G": 0,
"U": 2,
"X": 2,
"aconj": 5,
"adisj": 1,
"aneg": 1,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "(E((((p13 <= 0) OR (p14 <= 0)) AND (p8 <= 0)) U AF(((1 <= p3) AND (1 <= p5)))) OR (AX(((1 <= p1) AND (1 <= p5))) OR (AX((p10 <= 0)) AND E(((1 <= p1) AND (1 <= p5)) U ((1 <= p3) AND (1 <= p5))))))",
"processed_size": 196,
"rewrites": 38
},
"net":
{
"conflict_clusters": 9,
"singleton_clusters": 0
},
"result":
{
"edges": 14016,
"markings": 6010,
"produced_by": "CTL model checker",
"value": false
},
"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": 297
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((p7 <= 0) OR (p11 <= 0))",
"processed_size": 26,
"rewrites": 36
},
"result":
{
"edges": 4001,
"markings": 4002,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 37804,
"runtime": 3570.000000,
"signal": null,
"timelimitreached": true
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(A(F(E(G(*)))) OR **) : (E((** U **)) OR (E(G(*)) AND E(G(**)))) : ((A(X(E(X(**)))) AND A(X(**))) OR A(F(E(G(**))))) : (A(F(E(X(**)))) OR (E(X(**)) AND (** OR (** AND (E(F(**)) AND **))))) : (E((** U A(F(**)))) OR (A(X(**)) OR (A(X(*)) AND E((** U **))))) : (A(X((** OR A(G(**))))) OR A(F(**))) : (A((** U **)) OR A(F(**))) : (A(F(E((** U **)))) AND (A((** U **)) OR (** OR (** AND E(F(**)))))) : (A(F(**)) OR (A(F(**)) OR **)) : A(G(**)) : E(G(*)) : (E(G(**)) OR (A(G(**)) AND **)) : A((E(X(*)) R E(F(*)))) : (E((* R *)) AND ((A(F(**)) AND A((** U **))) OR **)) : (A(G(E(F(**)))) AND A(X(**)))"
},
"net":
{
"arcs": 34,
"conflict_clusters": 9,
"places": 15,
"places_significant": 9,
"singleton_clusters": 0,
"transitions": 11
},
"result":
{
"interim_value": "unknown unknown no yes no yes unknown unknown unknown unknown unknown unknown unknown unknown unknown ",
"preliminary_value": "unknown unknown no yes no yes unknown unknown unknown unknown unknown unknown unknown unknown unknown "
},
"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: 26/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 480
lola: finding significant places
lola: 15 places, 11 transitions, 9 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 CTLFireability.xml
lola: (NOT(E (G (A (F (((1 <= p13) AND (1 <= p14))))))) OR ((1 <= p13) AND (1 <= p14))) : (E ((((1 <= p1) AND (1 <= p5) AND (1 <= p10) AND (1 <= p2) AND (1 <= p9)) U ((1 <= p7) AND (1 <= p11) AND (1 <= p1) AND (1 <= p5) AND (((1 <= p7) AND (1 <= p11)) OR (1 <= p8))))) OR (NOT(A (F (((1 <= p12) AND (1 <= p13) AND (1 <= p14))))) AND E (G (((1 <= p12) OR ((1 <= p0) AND (1 <= p4)) OR (1 <= p8)))))) : (A (X ((E (X (((1 <= p0) AND (1 <= p4)))) AND ((1 <= p10) OR ((1 <= p3) AND (1 <= p5)) OR ((1 <= p12) AND (1 <= p1) AND (1 <= p5)))))) OR A (F (E (G (((1 <= p12) AND (1 <= p7) AND (1 <= p11))))))) : (A (F (E (X (((1 <= p8) OR ((1 <= p7) AND (1 <= p11))))))) OR (E (X ((((1 <= p8)) AND (1 <= p1) AND (1 <= p5)))) AND (((1 <= p2) AND (1 <= p9)) OR ((((1 <= p0) AND (1 <= p4) AND (1 <= p12)) AND E (F (((1 <= p3) AND (1 <= p5))))) AND ((1 <= p6) OR ((1 <= p13) AND (1 <= p14))))))) : ((E (((((p13 <= 0) OR (p14 <= 0)) AND (p8 <= 0)) U A (F (((1 <= p3) AND (1 <= p5)))))) OR A (X (((1 <= p1) AND (1 <= p5))))) OR (NOT(E (X ((1 <= p10)))) AND E ((((1 <= p1) AND (1 <= p5)) U ((1 <= p3) AND (1 <= p5)))))) : (A (X ((((p12 <= 0) AND ((p13 <= 0) OR (p14 <= 0))) OR A (G ((1 <= p7)))))) OR A ((((1 <= p7) AND (1 <= p11)) U A (F (((1 <= p7) AND (1 <= p11))))))) : (A ((((1 <= p0) AND (1 <= p4)) U (1 <= p10))) OR A (F (((1 <= p13) AND (1 <= p14))))) : (A (F (E ((((1 <= p3) AND (1 <= p5)) U (1 <= p7))))) AND ((A (((1 <= p10) U (1 <= p7))) OR (p7 <= 0)) OR (((1 <= p2) AND (1 <= p9)) AND E (F ((1 <= p6)))))) : ((A (F (((1 <= p0) AND (1 <= p4) AND (1 <= p7)))) OR A (F ((1 <= p7)))) OR ((1 <= p0) AND (1 <= p4))) : A (G (A (G (((1 <= p12) OR (p7 <= 0) OR ((1 <= p1) AND (1 <= p5))))))) : NOT(A (F (((1 <= p7) AND (1 <= p11))))) : (E (G ((((1 <= p13) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p9)) OR (1 <= p6) OR ((1 <= p7) AND (1 <= p11)) OR ((1 <= p6) AND ((p1 <= 0) OR (p5 <= 0)))))) OR (A (G ((1 <= p12))) AND ((p13 <= 0) OR (p14 <= 0)))) : NOT(E ((A (X ((1 <= p12))) U A (G ((1 <= p10)))))) : (NOT(A (((1 <= p8) U ((1 <= p1) AND (1 <= p5))))) AND ((A (F ((1 <= p7))) AND A (((1 <= p12) U ((1 <= p0) AND (1 <= p4))))) OR ((1 <= p6) AND ((p2 <= 0) OR (p9 <= 0) OR (1 <= p8) OR (p12 <= 0) OR ((1 <= p7) AND (1 <= p11)))))) : (A (G (E (F (((1 <= p8) OR (1 <= p10)))))) AND A (X ((((p12 <= 0) OR (p7 <= 0)) AND (p7 <= 0)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:470
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:389
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A (X (E (X (((1 <= p0) AND (1 <= p4)))))) AND A (X (((1 <= p10) OR ((1 <= p3) AND (1 <= p5)) OR ((1 <= p12) AND (1 <= p1) AND (1 <= p5)))))) OR A (F (E (G (((1 <= p12) AND (1 <= p7) AND (1 <= p11)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (G (((1 <= p12) AND (1 <= p7) AND (1 <= p11))))))
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(((1 <= p12) AND (1 <= p7) AND (1 <= p11))))
lola: processed formula length: 49
lola: 35 rewrites
lola: closed formula file CTLFireability.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: 2006 markings, 4012 edges
lola: ========================================
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((1 <= p10) OR ((1 <= p3) AND (1 <= p5)) OR ((1 <= p12) AND (1 <= p1) AND (1 <= p5)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(((1 <= p10) OR ((1 <= p3) AND (1 <= p5)) OR ((1 <= p12) AND (1 <= p1) AND (1 <= p5))))
lola: processed formula length: 91
lola: 34 rewrites
lola: closed formula file CTLFireability.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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (E (X (((1 <= p8) OR ((1 <= p7) AND (1 <= p11))))))) OR (E (X ((((1 <= p8)) AND (1 <= p1) AND (1 <= p5)))) AND (((1 <= p2) AND (1 <= p9)) OR (((1 <= p0) AND (1 <= p4) AND (1 <= p12)) AND (E (F (((1 <= p3) AND (1 <= p5)))) AND ((1 <= p6) OR ((1 <= p13) AND (1 <= p14))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p2) AND (1 <= p9))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p2) AND (1 <= p9))
lola: processed formula length: 25
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p6) OR ((1 <= p13) AND (1 <= p14)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p6) OR ((1 <= p13) AND (1 <= p14)))
lola: processed formula length: 43
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (X (((1 <= p8) OR ((1 <= p7) AND (1 <= p11)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(EX(((1 <= p8) OR ((1 <= p7) AND (1 <= p11)))))
lola: processed formula length: 50
lola: 35 rewrites
lola: closed formula file CTLFireability.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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 4003 markings, 4002 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (((((p13 <= 0) OR (p14 <= 0)) AND (p8 <= 0)) U A (F (((1 <= p3) AND (1 <= p5)))))) OR (A (X (((1 <= p1) AND (1 <= p5)))) OR (A (X ((p10 <= 0))) AND E ((((1 <= p1) AND (1 <= p5)) U ((1 <= p3) AND (1 <= p5)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: (E((((p13 <= 0) OR (p14 <= 0)) AND (p8 <= 0)) U AF(((1 <= p3) AND (1 <= p5)))) OR (AX(((1 <= p1) AND (1 <= p5))) OR (AX((p10 <= 0)) AND E(((1 <= p1) AND (1 <= p5)) U ((1 <= p3) AND (1 <= p5))))))
lola: processed formula length: 196
lola: 38 rewrites
lola: closed formula file CTLFireability.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 3 significant temporal operators and needs 13 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: 6010 markings, 14016 edges
lola: ========================================
lola: subprocess 3 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X ((((p12 <= 0) AND ((p13 <= 0) OR (p14 <= 0))) OR A (G ((1 <= p7)))))) OR A (F (((1 <= p7) AND (1 <= p11)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p7) AND (1 <= p11))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p7 <= 0) OR (p11 <= 0))
lola: processed formula length: 26
lola: 36 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p7) AND (1 <= p11))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-3-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 4002 markings, 4001 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((E (X ((p12 <= 0))) R E (F ((p10 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:815
lola: processed formula: A(EX((p12 <= 0)) R EF((p10 <= 0)))
lola: processed formula length: 34
lola: 36 rewrites
lola: closed formula file CTLFireability.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: 1738501 markings, 6029827 edges, 347700 markings/sec, 0 secs
lola: 3097099 markings, 11900455 edges, 271720 markings/sec, 5 secs
lola: 4464357 markings, 17423928 edges, 273452 markings/sec, 10 secs
lola: 5696627 markings, 22839155 edges, 246454 markings/sec, 15 secs
lola: 6810066 markings, 28047106 edges, 222688 markings/sec, 20 secs
lola: 7925147 markings, 33230081 edges, 223016 markings/sec, 25 secs
lola: 9000740 markings, 38319096 edges, 215119 markings/sec, 30 secs
lola: 10046532 markings, 43370287 edges, 209158 markings/sec, 35 secs
lola: 11085396 markings, 48395100 edges, 207773 markings/sec, 40 secs
lola: 12091530 markings, 53307685 edges, 201227 markings/sec, 45 secs
lola: 13094385 markings, 58243329 edges, 200571 markings/sec, 50 secs
lola: 14076385 markings, 63082817 edges, 196400 markings/sec, 55 secs
lola: 15083069 markings, 68010056 edges, 201337 markings/sec, 60 secs
lola: 16040487 markings, 72771979 edges, 191484 markings/sec, 65 secs
lola: 17000592 markings, 77520367 edges, 192021 markings/sec, 70 secs
lola: 17955308 markings, 82286373 edges, 190943 markings/sec, 75 secs
lola: 18882777 markings, 86954876 edges, 185494 markings/sec, 80 secs
lola: 19796791 markings, 91569951 edges, 182803 markings/sec, 85 secs
lola: 20708887 markings, 96176989 edges, 182419 markings/sec, 90 secs
lola: 21598722 markings, 100693240 edges, 177967 markings/sec, 95 secs
lola: 22506079 markings, 105261006 edges, 181471 markings/sec, 100 secs
lola: 23402502 markings, 109797829 edges, 179285 markings/sec, 105 secs
lola: 24279179 markings, 114293079 edges, 175335 markings/sec, 110 secs
lola: 25159709 markings, 118823029 edges, 176106 markings/sec, 115 secs
lola: 26078410 markings, 123471374 edges, 183740 markings/sec, 120 secs
lola: 26940033 markings, 127861206 edges, 172325 markings/sec, 125 secs
lola: 27877203 markings, 132560331 edges, 187434 markings/sec, 130 secs
lola: 28762378 markings, 137140431 edges, 177035 markings/sec, 135 secs
lola: 29655847 markings, 141750294 edges, 178694 markings/sec, 140 secs
lola: 30527667 markings, 146195106 edges, 174364 markings/sec, 145 secs
lola: 31388768 markings, 150665285 edges, 172220 markings/sec, 150 secs
lola: 32283594 markings, 155267874 edges, 178965 markings/sec, 155 secs
lola: 33161416 markings, 159773540 edges, 175564 markings/sec, 160 secs
lola: 34006658 markings, 164215156 edges, 169048 markings/sec, 165 secs
lola: 34785499 markings, 168288575 edges, 155768 markings/sec, 170 secs
lola: 35654693 markings, 172778971 edges, 173839 markings/sec, 175 secs
lola: 36525131 markings, 177267039 edges, 174088 markings/sec, 180 secs
lola: 37390338 markings, 181736653 edges, 173041 markings/sec, 185 secs
lola: 38234130 markings, 186161197 edges, 168758 markings/sec, 190 secs
lola: 39093553 markings, 190644787 edges, 171885 markings/sec, 195 secs
lola: 39779705 markings, 194272262 edges, 137230 markings/sec, 200 secs
lola: 40596665 markings, 198626549 edges, 163392 markings/sec, 205 secs
lola: 41468104 markings, 203166149 edges, 174288 markings/sec, 210 secs
lola: 42335067 markings, 207643617 edges, 173393 markings/sec, 215 secs
lola: 43168233 markings, 212057501 edges, 166633 markings/sec, 220 secs
lola: 44016025 markings, 216484277 edges, 169558 markings/sec, 225 secs
lola: 44866373 markings, 220969530 edges, 170070 markings/sec, 230 secs
lola: 45713418 markings, 225428442 edges, 169409 markings/sec, 235 secs
lola: 46526643 markings, 229759496 edges, 162645 markings/sec, 240 secs
lola: 47351157 markings, 234110359 edges, 164903 markings/sec, 245 secs
lola: 48155336 markings, 238398266 edges, 160836 markings/sec, 250 secs
lola: 48987680 markings, 242812384 edges, 166469 markings/sec, 255 secs
lola: 49827524 markings, 247215802 edges, 167969 markings/sec, 260 secs
lola: 50667515 markings, 251624038 edges, 167998 markings/sec, 265 secs
lola: 51500160 markings, 256038765 edges, 166529 markings/sec, 270 secs
lola: 52354256 markings, 260516382 edges, 170819 markings/sec, 275 secs
lola: 53169450 markings, 264834101 edges, 163039 markings/sec, 280 secs
lola: 53980034 markings, 269202832 edges, 162117 markings/sec, 285 secs
lola: 54789514 markings, 273535709 edges, 161896 markings/sec, 290 secs
lola: 55608379 markings, 277921423 edges, 163773 markings/sec, 295 secs
lola: 56437317 markings, 282290904 edges, 165788 markings/sec, 300 secs
lola: 57264646 markings, 286701733 edges, 165466 markings/sec, 305 secs
lola: 58085224 markings, 291051242 edges, 164116 markings/sec, 310 secs
lola: 58911350 markings, 295451708 edges, 165225 markings/sec, 315 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown no yes no yes unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 10557052 KB
lola: time consumption: 327 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (E (F (((1 <= p8) OR (1 <= p10)))))) AND A (X ((((p12 <= 0) OR (p7 <= 0)) AND (p7 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((1 <= p8) OR (1 <= p10))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: ((1 <= p8) OR (1 <= p10))
lola: processed formula length: 26
lola: 36 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p8 <= 0) AND (p10 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 1
lola: state equation: write sara problem file to CTLFireability-5-0.sara
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((1 <= p8) OR (1 <= p10))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-5-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-5-1.sara.

lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 4236709 markings, 7889869 edges, 847342 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 7928362 markings, 14985701 edges, 738331 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 11457874 markings, 21865987 edges, 705902 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 14860361 markings, 28527950 edges, 680497 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 18176092 markings, 35043547 edges, 663146 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 21392459 markings, 41436767 edges, 643273 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 24553293 markings, 47706719 edges, 632167 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 27513536 markings, 54083243 edges, 592049 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 29645785 markings, 60321963 edges, 426450 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 31454678 markings, 66145794 edges, 361779 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 33072925 markings, 71752150 edges, 323649 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 34578758 markings, 77114619 edges, 301167 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 36098792 markings, 82504705 edges, 304007 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 37533821 markings, 87787258 edges, 287006 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 38940762 markings, 93034123 edges, 281388 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 40335775 markings, 98184923 edges, 279003 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 41667878 markings, 103303564 edges, 266421 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 43019511 markings, 108447272 edges, 270327 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 44329544 markings, 113495360 edges, 262007 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 45602258 markings, 118413756 edges, 254543 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 46847998 markings, 123306736 edges, 249148 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 48096078 markings, 128112318 edges, 249616 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 49301910 markings, 132932692 edges, 241166 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 50533104 markings, 137763644 edges, 246239 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 51771565 markings, 142570346 edges, 247692 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 52980343 markings, 147374641 edges, 241756 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 54152816 markings, 152027759 edges, 234495 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 55351156 markings, 156813255 edges, 239668 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 56547714 markings, 161600387 edges, 239312 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 57723664 markings, 166373604 edges, 235190 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 58874420 markings, 171108980 edges, 230151 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 60046096 markings, 175877862 edges, 234335 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 61185361 markings, 180536886 edges, 227853 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 62335654 markings, 185256981 edges, 230059 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 63518630 markings, 189975533 edges, 236595 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 64659882 markings, 194700415 edges, 228250 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 65807061 markings, 199433928 edges, 229436 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 66935968 markings, 204121420 edges, 225781 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 68049100 markings, 208721301 edges, 222626 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 69131819 markings, 213222934 edges, 216544 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 70254476 markings, 217750636 edges, 224531 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 71345991 markings, 222274670 edges, 218303 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 72463591 markings, 226826901 edges, 223520 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 73527233 markings, 231309589 edges, 212728 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 74594852 markings, 235759728 edges, 213524 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 75688597 markings, 240242900 edges, 218749 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 76747291 markings, 244670290 edges, 211739 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 77800288 markings, 249114542 edges, 210599 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 78848529 markings, 253537182 edges, 209648 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 79913033 markings, 257979317 edges, 212901 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 80975043 markings, 262455629 edges, 212402 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 82068725 markings, 267048909 edges, 218736 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 83168952 markings, 271662071 edges, 220045 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 84266107 markings, 276218134 edges, 219431 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 85334148 markings, 280750482 edges, 213608 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 86425287 markings, 285267959 edges, 218228 markings/sec, 275 secs
lola: sara is running 280 secs || sara is running 280 secs || 87491705 markings, 289738527 edges, 213284 markings/sec, 280 secs
lola: sara is running 285 secs || sara is running 285 secs || 88509610 markings, 294083313 edges, 203581 markings/sec, 285 secs
lola: sara is running 290 secs || sara is running 290 secs || 89547632 markings, 298501362 edges, 207604 markings/sec, 290 secs
lola: sara is running 295 secs || sara is running 295 secs || 90604028 markings, 302981661 edges, 211279 markings/sec, 295 secs
lola: sara is running 300 secs || sara is running 300 secs || 91620552 markings, 307335846 edges, 203305 markings/sec, 300 secs
lola: sara is running 305 secs || sara is running 305 secs || 92677588 markings, 311779988 edges, 211407 markings/sec, 305 secs
lola: sara is running 310 secs || sara is running 310 secs || 93728756 markings, 316254690 edges, 210234 markings/sec, 310 secs
lola: sara is running 315 secs || sara is running 315 secs || 94763304 markings, 320634639 edges, 206910 markings/sec, 315 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown no yes no yes unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 10433792 KB
lola: time consumption: 651 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: unknown unknown no yes no yes unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: unknown unknown no yes no yes unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 10434124 KB
lola: time consumption: 652 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: time limit reached - aborting
lola:
preliminary result: unknown unknown no yes no yes unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola:
preliminary result: unknown unknown no yes no yes unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 37804 KB
lola: time consumption: 3570 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
rslt: finished
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427332 kB
MemFree: 16107756 kB
After kill :
MemTotal: 16427332 kB
MemFree: 16107756 kB

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RobotManipulation-PT-01000"
export BK_EXAMINATION="CTLFireability"
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 RobotManipulation-PT-01000, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r186-oct2-158987938700212"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RobotManipulation-PT-01000.tgz
mv RobotManipulation-PT-01000 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;