Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r166-smll-158987787700468.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is AutoFlight-PT-12a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r166-smll-158987787700468
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 276K
-rw-r--r-- 1 mcc users 4.7K Mar 25 23:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 25 23:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 18:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 18:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 8 14:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 25 15:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 25 15:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 10:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 25 10:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 25 17:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 25 17:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 85K Mar 24 05:37 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1591495498660

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-07 02:05:01] [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-07 02:05:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-07 02:05:01] [INFO ] Load time of PNML (sax parser for PT used): 150 ms
[2020-06-07 02:05:01] [INFO ] Transformed 307 places.
[2020-06-07 02:05:01] [INFO ] Transformed 305 transitions.
[2020-06-07 02:05:01] [INFO ] Found NUPN structural information;
[2020-06-07 02:05:01] [INFO ] Parsed PT model containing 307 places and 305 transitions in 222 ms.
Ensure Unique test removed 60 transitions
Reduce redundant transitions removed 60 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 27 ms.
Incomplete random walk after 100000 steps, including 1885 resets, run finished after 618 ms. (steps per millisecond=161 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 245 rows 307 cols
[2020-06-07 02:05:02] [INFO ] Computed 76 place invariants in 15 ms
[2020-06-07 02:05:02] [INFO ] [Real]Absence check using 75 positive place invariants in 94 ms returned sat
[2020-06-07 02:05:02] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 3 ms returned sat
[2020-06-07 02:05:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-07 02:05:03] [INFO ] [Real]Absence check using state equation in 477 ms returned sat
[2020-06-07 02:05:03] [INFO ] State equation strengthened by 60 read => feed constraints.
[2020-06-07 02:05:03] [INFO ] [Real]Added 60 Read/Feed constraints in 16 ms returned sat
[2020-06-07 02:05:03] [INFO ] Computed and/alt/rep : 244/892/244 causal constraints in 57 ms.
[2020-06-07 02:05:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-07 02:05:03] [INFO ] [Nat]Absence check using 75 positive place invariants in 50 ms returned sat
[2020-06-07 02:05:03] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 2 ms returned sat
[2020-06-07 02:05:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-07 02:05:04] [INFO ] [Nat]Absence check using state equation in 334 ms returned sat
[2020-06-07 02:05:04] [INFO ] [Nat]Added 60 Read/Feed constraints in 27 ms returned sat
[2020-06-07 02:05:04] [INFO ] Computed and/alt/rep : 244/892/244 causal constraints in 23 ms.
[2020-06-07 02:05:05] [INFO ] Added : 198 causal constraints over 40 iterations in 1434 ms. Result :sat
[2020-06-07 02:05:05] [INFO ] Deduced a trap composed of 114 places in 207 ms
[2020-06-07 02:05:06] [INFO ] Deduced a trap composed of 123 places in 153 ms
[2020-06-07 02:05:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 512 ms
[2020-06-07 02:05:06] [INFO ] [Real]Absence check using 75 positive place invariants in 70 ms returned sat
[2020-06-07 02:05:06] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 19 ms returned unsat
[2020-06-07 02:05:06] [INFO ] [Real]Absence check using 75 positive place invariants in 56 ms returned unsat
[2020-06-07 02:05:06] [INFO ] [Real]Absence check using 75 positive place invariants in 38 ms returned sat
[2020-06-07 02:05:06] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 2 ms returned sat
[2020-06-07 02:05:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-07 02:05:07] [INFO ] [Real]Absence check using state equation in 454 ms returned sat
[2020-06-07 02:05:07] [INFO ] [Real]Added 60 Read/Feed constraints in 10 ms returned sat
[2020-06-07 02:05:07] [INFO ] Deduced a trap composed of 117 places in 123 ms
[2020-06-07 02:05:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
[2020-06-07 02:05:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-07 02:05:07] [INFO ] [Nat]Absence check using 75 positive place invariants in 64 ms returned sat
[2020-06-07 02:05:07] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 3 ms returned sat
[2020-06-07 02:05:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-07 02:05:08] [INFO ] [Nat]Absence check using state equation in 478 ms returned sat
[2020-06-07 02:05:08] [INFO ] [Nat]Added 60 Read/Feed constraints in 19 ms returned sat
[2020-06-07 02:05:08] [INFO ] Deduced a trap composed of 117 places in 135 ms
[2020-06-07 02:05:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2020-06-07 02:05:08] [INFO ] Computed and/alt/rep : 244/892/244 causal constraints in 31 ms.
[2020-06-07 02:05:10] [INFO ] Added : 244 causal constraints over 49 iterations in 2107 ms. Result :sat
[2020-06-07 02:05:10] [INFO ] Deduced a trap composed of 120 places in 96 ms
[2020-06-07 02:05:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
[2020-06-07 02:05:10] [INFO ] [Real]Absence check using 75 positive place invariants in 63 ms returned unsat
[2020-06-07 02:05:10] [INFO ] [Real]Absence check using 75 positive place invariants in 42 ms returned sat
[2020-06-07 02:05:10] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 6 ms returned unsat
[2020-06-07 02:05:10] [INFO ] [Real]Absence check using 75 positive place invariants in 47 ms returned sat
[2020-06-07 02:05:10] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 3 ms returned sat
[2020-06-07 02:05:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-07 02:05:11] [INFO ] [Real]Absence check using state equation in 358 ms returned sat
[2020-06-07 02:05:11] [INFO ] [Real]Added 60 Read/Feed constraints in 11 ms returned sat
[2020-06-07 02:05:11] [INFO ] Computed and/alt/rep : 244/892/244 causal constraints in 27 ms.
[2020-06-07 02:05:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-07 02:05:11] [INFO ] [Nat]Absence check using 75 positive place invariants in 74 ms returned sat
[2020-06-07 02:05:11] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 4 ms returned sat
[2020-06-07 02:05:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-07 02:05:12] [INFO ] [Nat]Absence check using state equation in 487 ms returned sat
[2020-06-07 02:05:12] [INFO ] [Nat]Added 60 Read/Feed constraints in 25 ms returned sat
[2020-06-07 02:05:12] [INFO ] Computed and/alt/rep : 244/892/244 causal constraints in 34 ms.
[2020-06-07 02:05:14] [INFO ] Added : 244 causal constraints over 49 iterations in 1979 ms. Result :sat
[2020-06-07 02:05:14] [INFO ] [Real]Absence check using 75 positive place invariants in 67 ms returned sat
[2020-06-07 02:05:14] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 3 ms returned sat
[2020-06-07 02:05:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-07 02:05:14] [INFO ] [Real]Absence check using state equation in 466 ms returned sat
[2020-06-07 02:05:14] [INFO ] [Real]Added 60 Read/Feed constraints in 13 ms returned sat
[2020-06-07 02:05:14] [INFO ] Computed and/alt/rep : 244/892/244 causal constraints in 27 ms.
[2020-06-07 02:05:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-07 02:05:15] [INFO ] [Nat]Absence check using 75 positive place invariants in 41 ms returned sat
[2020-06-07 02:05:15] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 2 ms returned sat
[2020-06-07 02:05:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-07 02:05:15] [INFO ] [Nat]Absence check using state equation in 294 ms returned sat
[2020-06-07 02:05:15] [INFO ] [Nat]Added 60 Read/Feed constraints in 11 ms returned sat
[2020-06-07 02:05:15] [INFO ] Computed and/alt/rep : 244/892/244 causal constraints in 27 ms.
[2020-06-07 02:05:17] [INFO ] Added : 243 causal constraints over 49 iterations in 1634 ms. Result :sat
[2020-06-07 02:05:17] [INFO ] [Real]Absence check using 75 positive place invariants in 61 ms returned unsat
Successfully simplified 5 atomic propositions for a total of 5 simplifications.
[2020-06-07 02:05:17] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-07 02:05:17] [INFO ] Flatten gal took : 92 ms
[2020-06-07 02:05:17] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-07 02:05:17] [INFO ] Flatten gal took : 37 ms
FORMULA AutoFlight-PT-12a-CTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-07 02:05:17] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2020-06-07 02:05:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 7 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ AutoFlight-PT-12a @ 3570 seconds

FORMULA AutoFlight-PT-12a-CTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-12a-CTLFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-12a-CTLFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 0
rslt: Output for CTLFireability @ AutoFlight-PT-12a

{
"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",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sun Jun 7 02:05:18 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 4,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "AF((EX(((1 <= p154))) AND (EG(((1 <= p77) AND (1 <= p132))) AND (EF(((1 <= p38))) OR EG(((1 <= p61)))))))",
"processed_size": 105,
"rewrites": 33
},
"net":
{
"conflict_clusters": 159,
"singleton_clusters": 0
},
"result":
{
"edges": 41,
"markings": 42,
"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
},
"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": 3,
"adisj": 4,
"aneg": 0,
"comp": 14,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "(((1 <= p77) AND (1 <= p194)) OR ((1 <= p45) AND (1 <= p270) AND (1 <= p9) AND ((p76 <= 0) OR (p295 <= 0) OR (p244 <= 0) OR (p305 <= 0))) OR (((p0 <= 0)) AND ((p84 <= 0) OR (p219 <= 0)) AND ((p43 <= 0) OR (p176 <= 0))))",
"processed_size": 224,
"rewrites": 31
},
"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": 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": "((p63 <= 0) OR (p216 <= 0))",
"processed_size": 28,
"rewrites": 31
},
"result":
{
"edges": 41,
"markings": 42,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"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": "AX((((1 <= p5)) OR ((1 <= p96) AND (1 <= p255))))",
"processed_size": 50,
"rewrites": 29
},
"net":
{
"conflict_clusters": 159,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 3,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "EG((AX((((1 <= p13)) OR ((1 <= p202)))) OR (((p6 <= 0)) OR ((p235 <= 0)))))",
"processed_size": 76,
"rewrites": 30
},
"net":
{
"conflict_clusters": 159,
"singleton_clusters": 0
},
"result":
{
"edges": 41,
"markings": 42,
"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"
}
}
],
"exit":
{
"error": null,
"memory": 4793084,
"runtime": 3570.000000,
"signal": null,
"timelimitreached": true
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(F((E(X(**)) AND (E(G(**)) AND (E(F(**)) OR E(G(**))))))) : (E(F(A((** U **)))) OR E(F((A(G(**)) AND (** AND **))))) : A(F(**)) : A((E(F(*)) U E(G(**)))) : E(G((A(F(**)) OR A(G(**))))) : (A(X(**)) OR (A(F(**)) OR (** OR (** OR **)))) : E(F(**)) : E(G((A(X(**)) OR (** OR **)))) : (E(F(A(X(**)))) OR (E(F(A(X(**)))) OR E(F(A(G(**)))))) : (E(F(DEADLOCK)) OR E(F(**))) : A(G(**)) : A(X(A(F(E(X(**)))))) : E((A(F(**)) U A((** U **)))) : (E(F(A(X(**)))) OR E(F((E(X(**)) AND (** AND **))))) : A(F(E(X(**))))"
},
"net":
{
"arcs": 860,
"conflict_clusters": 159,
"places": 307,
"places_significant": 231,
"singleton_clusters": 0,
"transitions": 245
},
"result":
{
"interim_value": "no unknown unknown unknown unknown no unknown yes unknown unknown unknown unknown unknown unknown unknown ",
"preliminary_value": "no unknown unknown unknown unknown no unknown yes 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: 552/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 307
lola: finding significant places
lola: 307 places, 245 transitions, 231 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: LP says that atomic proposition is always true: (p154 <= 1)
lola: LP says that atomic proposition is always true: (p77 <= 1)
lola: LP says that atomic proposition is always true: (p132 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: LP says that atomic proposition is always true: (p115 <= 1)
lola: LP says that atomic proposition is always true: (p296 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p172 <= 1)
lola: LP says that atomic proposition is always true: (p250 <= 1)
lola: LP says that atomic proposition is always true: (p305 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p220 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p259 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p270 <= 1)
lola: LP says that atomic proposition is always true: (p135 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p234 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p248 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p255 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p216 <= 1)
lola: LP says that atomic proposition is always true: (p77 <= 1)
lola: LP says that atomic proposition is always true: (p194 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p270 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p76 <= 1)
lola: LP says that atomic proposition is always true: (p295 <= 1)
lola: LP says that atomic proposition is always true: (p244 <= 1)
lola: LP says that atomic proposition is always true: (p305 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p84 <= 1)
lola: LP says that atomic proposition is always true: (p219 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p176 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p202 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p235 <= 1)
lola: LP says that atomic proposition is always true: (p239 <= 1)
lola: LP says that atomic proposition is always true: (p306 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p131 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p160 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p82 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p253 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p234 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p249 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p172 <= 1)
lola: LP says that atomic proposition is always true: (p121 <= 1)
lola: LP says that atomic proposition is always true: (p306 <= 1)
lola: A (F (((E (X (((1 <= p154)))) AND E (G (((1 <= p77) AND (1 <= p132))))) AND (E (F (((1 <= p38)))) OR E (G (((1 <= p61)))))))) : E (F ((A ((((1 <= p115) AND (1 <= p296)) U ((1 <= p15) AND (1 <= p172)))) OR ((A (G (((1 <= p250) AND (1 <= p305)))) AND ((p38 <= 0))) AND ((p4 <= 0) OR (p220 <= 0)))))) : A (F (((1 <= p16)))) : A ((NOT(A (G (((1 <= p0))))) U E (G (((1 <= p34) AND (1 <= p259)))))) : E (G ((A (F (((1 <= p45) AND (1 <= p270)))) OR A (G (((1 <= p135) AND (1 <= p10))))))) : (((((E (((((1 <= p3) AND (1 <= p234)) OR ((1 <= p91) AND (1 <= p248))) U (1 <= 0))) OR A (X ((((1 <= p5)) OR ((1 <= p96) AND (1 <= p255)))))) OR A (F (((1 <= p63) AND (1 <= p216))))) OR ((1 <= p77) AND (1 <= p194))) OR ((1 <= p45) AND (1 <= p270) AND (1 <= p9) AND ((p76 <= 0) OR (p295 <= 0) OR (p244 <= 0) OR (p305 <= 0)))) OR (((p0 <= 0)) AND ((p84 <= 0) OR (p219 <= 0)) AND ((p43 <= 0) OR (p176 <= 0)))) : E (F (A (F (A (F (((1 <= p23)))))))) : E (G (((A (X ((((1 <= p13)) OR ((1 <= p202))))) OR ((p6 <= 0))) OR ((p235 <= 0))))) : E (F (((A (X (((1 <= p239) AND (1 <= p306)))) OR A (X (((1 <= p70) AND (1 <= p131))))) OR A (G (((1 <= p21) AND (1 <= p160))))))) : E (F ((A (X ((1 <= 0))) OR E ((((1 <= p6)) U ((1 <= p5))))))) : A (G (((p37 <= 0) OR (p45 <= 0)))) : A (X (A (F (E (X (((1 <= p82)))))))) : E ((A (F (((p34 <= 0)))) U A ((((1 <= p47)) U ((1 <= p27) AND (1 <= p253)))))) : E (F ((A (X (((1 <= p3) AND (1 <= p234)))) OR ((E (X (((1 <= p93) AND (1 <= p249)))) AND ((1 <= p15))) AND ((1 <= p172)))))) : A (F (E (X (((1 <= p121) AND (1 <= p306))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:548
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:392
lola: rewrite Frontend/Parser/formula_rewrite.k:455
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:548
lola: rewrite Frontend/Parser/formula_rewrite.k:548
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:548
lola: rewrite Frontend/Parser/formula_rewrite.k:446
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:548
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 (F ((E (X (((1 <= p154)))) AND (E (G (((1 <= p77) AND (1 <= p132)))) AND (E (F (((1 <= p38)))) OR E (G (((1 <= p61)))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((EX(((1 <= p154))) AND (EG(((1 <= p77) AND (1 <= p132))) AND (EF(((1 <= p38))) OR EG(((1 <= p61)))))))
lola: processed formula length: 105
lola: 33 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 4 significant temporal operators and needs 17 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: 42 markings, 41 edges
lola: ========================================
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X ((((1 <= p5)) OR ((1 <= p96) AND (1 <= p255))))) OR (A (F (((1 <= p63) AND (1 <= p216)))) OR (((1 <= p77) AND (1 <= p194)) OR (((1 <= p45) AND (1 <= p270) AND (1 <= p9) AND ((p76 <= 0) OR (p295 <= 0) OR (p244 <= 0) OR (p305 <= 0))) OR (((p0 <= 0)) AND ((p84 <= 0) OR (p219 <= 0)) AND ((p43 <= 0) OR (p176 <= 0)))))))
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 <= p77) AND (1 <= p194)) OR (((1 <= p45) AND (1 <= p270) AND (1 <= p9) AND ((p76 <= 0) OR (p295 <= 0) OR (p244 <= 0) OR (p305 <= 0))) OR (((p0 <= 0)) AND ((p84 <= 0) OR (p219 <= 0)) AND ((p43 <= 0) OR (p176 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: processed formula: (((1 <= p77) AND (1 <= p194)) OR ((1 <= p45) AND (1 <= p270) AND (1 <= p9) AND ((p76 <= 0) OR (p295 <= 0) OR (p244 <= 0) OR (p305 <= 0))) OR (((p0 <= 0)) AND ((p84 <= 0) OR (p219 <= 0)) AND ((p43 <= 0) OR (p176 <= 0))))
lola: processed formula length: 224
lola: 31 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 14 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: A (F (((1 <= p63) AND (1 <= p216))))
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: ((p63 <= 0) OR (p216 <= 0))
lola: processed formula length: 28
lola: 31 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 <= p63) AND (1 <= p216))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 42 markings, 41 edges
lola: ========================================
lola: subprocess 3 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((((1 <= p5)) OR ((1 <= p96) AND (1 <= p255)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((((1 <= p5)) OR ((1 <= p96) AND (1 <= p255))))
lola: processed formula length: 50
lola: 29 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: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((A (X ((((1 <= p13)) OR ((1 <= p202))))) OR (((p6 <= 0)) OR ((p235 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((AX((((1 <= p13)) OR ((1 <= p202)))) OR (((p6 <= 0)) OR ((p235 <= 0)))))
lola: processed formula length: 76
lola: 30 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: 42 markings, 41 edges
lola: ========================================
lola: subprocess 3 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (A (X (((1 <= p239) AND (1 <= p306)))))) OR (E (F (A (X (((1 <= p70) AND (1 <= p131)))))) OR E (F (A (G (((1 <= p21) AND (1 <= p160))))))))
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: E (F (A (G (((1 <= p21) AND (1 <= p160))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p21 <= 0) OR (p160 <= 0))
lola: processed formula length: 28
lola: 32 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 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((p21 <= 0) OR (p160 <= 0))
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 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 <= p21) AND (1 <= p160))
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-1.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLFireability-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-3-1.sara.
sara: try reading problem file CTLFireability-3-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: state equation 0: solution produced
lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 288522 markings, 2179229 edges, 57704 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 574771 markings, 4309018 edges, 57250 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 834953 markings, 6408104 edges, 52036 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 1088244 markings, 8478100 edges, 50658 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 1328608 markings, 10541253 edges, 48073 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 1581187 markings, 12567766 edges, 50516 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 1805679 markings, 14550453 edges, 44898 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 2050819 markings, 16567770 edges, 49028 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 2272900 markings, 18594801 edges, 44416 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 2513457 markings, 20615881 edges, 48111 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 2760335 markings, 22511450 edges, 49376 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 3039405 markings, 24592669 edges, 55814 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 3307963 markings, 26663446 edges, 53712 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 3554769 markings, 28737678 edges, 49361 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 3783941 markings, 30756269 edges, 45834 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 4011515 markings, 32778399 edges, 45515 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 4227011 markings, 34715903 edges, 43099 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 4418580 markings, 36613142 edges, 38314 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 4642158 markings, 38567697 edges, 44716 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 4872211 markings, 40455692 edges, 46011 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 5110225 markings, 42444957 edges, 47603 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 5332649 markings, 44405852 edges, 44485 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 5557265 markings, 46386264 edges, 44923 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 5784158 markings, 48386396 edges, 45379 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 6023671 markings, 50392212 edges, 47903 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 6240676 markings, 52371315 edges, 43401 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 6451039 markings, 54289815 edges, 42073 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 6654728 markings, 56228090 edges, 40738 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 6903525 markings, 58193820 edges, 49759 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 7134188 markings, 60160716 edges, 46133 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 7339939 markings, 61982850 edges, 41150 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 7572951 markings, 63968594 edges, 46602 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 7802236 markings, 65979048 edges, 45857 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 8015145 markings, 67920059 edges, 42582 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 8218622 markings, 69845746 edges, 40695 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 8423066 markings, 71795486 edges, 40889 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 8638418 markings, 73740913 edges, 43070 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 8858786 markings, 75752788 edges, 44074 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 9061851 markings, 77552170 edges, 40613 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 9308556 markings, 79596029 edges, 49341 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 9545134 markings, 81618037 edges, 47316 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 9743639 markings, 83509945 edges, 39701 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 9937933 markings, 85401530 edges, 38859 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 10154126 markings, 87324213 edges, 43239 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 10354573 markings, 89227975 edges, 40089 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 10535456 markings, 91034655 edges, 36177 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 10731093 markings, 92890762 edges, 39127 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 10939128 markings, 94855357 edges, 41607 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 11144014 markings, 96841107 edges, 40977 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 11339518 markings, 98792937 edges, 39101 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 11552708 markings, 100696379 edges, 42638 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 11740769 markings, 102552586 edges, 37612 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 11928763 markings, 104413888 edges, 37599 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 12121430 markings, 106324560 edges, 38533 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 12330672 markings, 108236123 edges, 41848 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 12529897 markings, 110135179 edges, 39845 markings/sec, 275 secs
lola: sara is running 280 secs || sara is running 280 secs || 12726563 markings, 112050114 edges, 39333 markings/sec, 280 secs
lola: sara is running 285 secs || sara is running 285 secs || 12920113 markings, 113945669 edges, 38710 markings/sec, 285 secs
lola: sara is running 290 secs || sara is running 290 secs || 13133933 markings, 115902958 edges, 42764 markings/sec, 290 secs
lola: local time limit reached - aborting
lola:
preliminary result: no unknown unknown unknown unknown no unknown yes unknown unknown unknown unknown unknown unknown unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: no unknown unknown unknown unknown no unknown yes unknown unknown unknown unknown unknown unknown unknown
lola: local time limit reached - aborting
lola:
preliminary result: no unknown unknown unknown unknown no unknown yes unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 591684 KB
lola: time consumption: 302 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: memory consumption: 591684 KB
lola: time consumption: 302 seconds
lola: print data as JSON (--json)
lola: memory consumption: 592124 KB
lola: time consumption: 302 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.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: no unknown unknown unknown unknown no unknown yes unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 592124 KB
lola: time consumption: 302 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 2 - aborting LoLA
lola:
preliminary result: no unknown unknown unknown unknown no unknown yes unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 596396 KB
lola: time consumption: 305 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: no unknown unknown unknown unknown no unknown yes unknown unknown unknown unknown unknown unknown unknown
lola:
preliminary result: no unknown unknown unknown unknown no unknown yes unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 4793084 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: 16427364 kB
MemFree: 11330096 kB
After kill :
MemTotal: 16427364 kB
MemFree: 11328064 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="AutoFlight-PT-12a"
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 AutoFlight-PT-12a, 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 r166-smll-158987787700468"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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