Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r180-ebro-158987900100337.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 DLCflexbar-PT-2a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-ebro-158987900100337
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 724K
-rw-r--r-- 1 mcc users 3.3K Mar 30 02:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 30 02:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 28 16:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 8 14:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 27 09:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 09:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 26 08:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 26 08:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 545K 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 DLCflexbar-PT-2a-00
FORMULA_NAME DLCflexbar-PT-2a-01
FORMULA_NAME DLCflexbar-PT-2a-02
FORMULA_NAME DLCflexbar-PT-2a-03
FORMULA_NAME DLCflexbar-PT-2a-04
FORMULA_NAME DLCflexbar-PT-2a-05
FORMULA_NAME DLCflexbar-PT-2a-06
FORMULA_NAME DLCflexbar-PT-2a-07
FORMULA_NAME DLCflexbar-PT-2a-08
FORMULA_NAME DLCflexbar-PT-2a-09
FORMULA_NAME DLCflexbar-PT-2a-10
FORMULA_NAME DLCflexbar-PT-2a-11
FORMULA_NAME DLCflexbar-PT-2a-12
FORMULA_NAME DLCflexbar-PT-2a-13
FORMULA_NAME DLCflexbar-PT-2a-14
FORMULA_NAME DLCflexbar-PT-2a-15

=== Now, execution of the tool begins

BK_START 1591203458124

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 16:57:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 16:57:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 16:57:41] [INFO ] Load time of PNML (sax parser for PT used): 301 ms
[2020-06-03 16:57:41] [INFO ] Transformed 353 places.
[2020-06-03 16:57:41] [INFO ] Transformed 2169 transitions.
[2020-06-03 16:57:41] [INFO ] Found NUPN structural information;
[2020-06-03 16:57:41] [INFO ] Parsed PT model containing 353 places and 2169 transitions in 414 ms.
Ensure Unique test removed 264 transitions
Reduce redundant transitions removed 264 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 76 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 1462 ms. (steps per millisecond=68 ) properties seen :[0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1]
[2020-06-03 16:57:43] [INFO ] Flow matrix only has 266 transitions (discarded 1639 similar events)
// Phase 1: matrix 266 rows 353 cols
[2020-06-03 16:57:43] [INFO ] Computed 196 place invariants in 27 ms
[2020-06-03 16:57:43] [INFO ] [Real]Absence check using 196 positive place invariants in 171 ms returned sat
[2020-06-03 16:57:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:57:44] [INFO ] [Real]Absence check using state equation in 698 ms returned sat
[2020-06-03 16:57:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:57:44] [INFO ] [Nat]Absence check using 196 positive place invariants in 87 ms returned unsat
[2020-06-03 16:57:44] [INFO ] [Real]Absence check using 196 positive place invariants in 122 ms returned sat
[2020-06-03 16:57:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:57:45] [INFO ] [Real]Absence check using state equation in 572 ms returned sat
[2020-06-03 16:57:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:57:46] [INFO ] [Nat]Absence check using 196 positive place invariants in 64 ms returned unsat
[2020-06-03 16:57:46] [INFO ] [Real]Absence check using 196 positive place invariants in 200 ms returned sat
[2020-06-03 16:57:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:57:47] [INFO ] [Real]Absence check using state equation in 717 ms returned sat
[2020-06-03 16:57:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:57:47] [INFO ] [Nat]Absence check using 196 positive place invariants in 60 ms returned unsat
[2020-06-03 16:57:47] [INFO ] [Real]Absence check using 196 positive place invariants in 230 ms returned sat
[2020-06-03 16:57:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:57:48] [INFO ] [Real]Absence check using state equation in 566 ms returned sat
[2020-06-03 16:57:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:57:48] [INFO ] [Nat]Absence check using 196 positive place invariants in 82 ms returned unsat
[2020-06-03 16:57:49] [INFO ] [Real]Absence check using 196 positive place invariants in 123 ms returned sat
[2020-06-03 16:57:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:57:49] [INFO ] [Real]Absence check using state equation in 611 ms returned sat
[2020-06-03 16:57:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:57:49] [INFO ] [Nat]Absence check using 196 positive place invariants in 62 ms returned unsat
[2020-06-03 16:57:50] [INFO ] [Real]Absence check using 196 positive place invariants in 324 ms returned sat
[2020-06-03 16:57:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:57:51] [INFO ] [Real]Absence check using state equation in 1045 ms returned sat
[2020-06-03 16:57:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:57:51] [INFO ] [Nat]Absence check using 196 positive place invariants in 59 ms returned unsat
[2020-06-03 16:57:51] [INFO ] [Real]Absence check using 196 positive place invariants in 115 ms returned sat
[2020-06-03 16:57:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:57:52] [INFO ] [Real]Absence check using state equation in 578 ms returned sat
[2020-06-03 16:57:52] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:57:52] [INFO ] [Nat]Absence check using 196 positive place invariants in 186 ms returned unsat
[2020-06-03 16:57:53] [INFO ] [Real]Absence check using 196 positive place invariants in 135 ms returned sat
[2020-06-03 16:57:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:57:53] [INFO ] [Real]Absence check using state equation in 694 ms returned sat
[2020-06-03 16:57:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:57:54] [INFO ] [Nat]Absence check using 196 positive place invariants in 101 ms returned unsat
[2020-06-03 16:57:54] [INFO ] [Real]Absence check using 196 positive place invariants in 133 ms returned sat
[2020-06-03 16:57:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:57:54] [INFO ] [Real]Absence check using state equation in 608 ms returned sat
[2020-06-03 16:57:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:57:55] [INFO ] [Nat]Absence check using 196 positive place invariants in 25 ms returned unsat
[2020-06-03 16:57:55] [INFO ] [Real]Absence check using 196 positive place invariants in 110 ms returned sat
[2020-06-03 16:57:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:57:55] [INFO ] [Real]Absence check using state equation in 532 ms returned sat
[2020-06-03 16:57:55] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:57:55] [INFO ] [Nat]Absence check using 196 positive place invariants in 25 ms returned unsat
[2020-06-03 16:57:56] [INFO ] [Real]Absence check using 196 positive place invariants in 128 ms returned sat
[2020-06-03 16:57:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:57:56] [INFO ] [Real]Absence check using state equation in 571 ms returned sat
[2020-06-03 16:57:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:57:56] [INFO ] [Nat]Absence check using 196 positive place invariants in 26 ms returned unsat
Successfully simplified 11 atomic propositions for a total of 13 simplifications.
[2020-06-03 16:57:57] [INFO ] Initial state reduction rules for CTL removed 9 formulas.
[2020-06-03 16:57:57] [INFO ] Flatten gal took : 286 ms
FORMULA DLCflexbar-PT-2a-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-2a-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-2a-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-2a-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-2a-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-2a-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-2a-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-2a-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-2a-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 16:57:57] [INFO ] Applying decomposition
[2020-06-03 16:57:57] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-03 16:57:57] [INFO ] Flatten gal took : 144 ms
[2020-06-03 16:57:57] [INFO ] Decomposing Gal with order
[2020-06-03 16:57:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-03 16:57:58] [INFO ] Removed a total of 2988 redundant transitions.
[2020-06-03 16:57:58] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-03 16:57:58] [INFO ] Flatten gal took : 367 ms
[2020-06-03 16:57:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 148 labels/synchronizations in 110 ms.
[2020-06-03 16:57:58] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DLCflexbar-PT-2a-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 16:57:58] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 5 ms.
[2020-06-03 16:57:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 45 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ DLCflexbar-PT-2a @ 3570 seconds

FORMULA DLCflexbar-PT-2a-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCflexbar-PT-2a-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCflexbar-PT-2a-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCflexbar-PT-2a-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCflexbar-PT-2a-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCflexbar-PT-2a-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3542
rslt: Output for LTLCardinality @ DLCflexbar-PT-2a

{
"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=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 16:57:59 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((((p26 <= 0)) OR ((1 <= p88))))",
"processed_size": 35,
"rewrites": 14
},
"result":
{
"edges": 61562,
"markings": 2265,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 712
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (F ((((p26 <= 0)) OR ((1 <= p88)))))",
"processed_size": 39,
"rewrites": 14
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 712
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 3,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (F ((X (G ((((1 <= p40)) AND ((p29 <= 0))))) OR G ((((p40 <= 0)) OR ((1 <= p29)))))))",
"processed_size": 88,
"rewrites": 14
},
"result":
{
"edges": 9672360,
"markings": 249232,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 885
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"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": "X (G ((((1 <= p7)) AND ((p73 <= 0)))))",
"processed_size": 38,
"rewrites": 14
},
"result":
{
"edges": 234,
"markings": 25,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1180
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F ((F (((1 <= p328))) AND ((p328 <= 0))))",
"processed_size": 41,
"rewrites": 14
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1771
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 3,
"U": 0,
"X": 0,
"aconj": 6,
"adisj": 3,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G (F ((G (F ((((p180 <= 0)) OR ((1 <= p149))))) OR G (((((p38 <= 0)) OR ((1 <= p15))) AND F ((((p180 <= 0)) OR ((1 <= p149)))))))))",
"processed_size": 134,
"rewrites": 14
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3542
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"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 <= p262)) AND ((p111 <= 0)))",
"processed_size": 33,
"rewrites": 14
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"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 <= p262)) AND ((p111 <= 0)))",
"processed_size": 33,
"rewrites": 14
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F ((F (G ((((p342 <= 0)) OR ((1 <= p150))))) AND ((1 <= p225)))))",
"processed_size": 69,
"rewrites": 14
},
"result":
{
"edges": 7355,
"markings": 283,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 36780,
"runtime": 28.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(G(**) OR X(F(**))) : (G(F((F(G(**)) AND **))) OR **) : X(F((X(G(**)) OR G(**)))) : G(F((G(F(**)) OR G((** AND F(**)))))) : X(G(*)) : F((F(*) AND *))"
},
"net":
{
"arcs": 7333,
"conflict_clusters": 66,
"places": 353,
"places_significant": 157,
"singleton_clusters": 0,
"transitions": 1905
},
"result":
{
"preliminary_value": "yes no no no no yes ",
"value": "yes no no no no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 2258/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 353
lola: finding significant places
lola: 353 places, 1905 transitions, 157 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 LTLCardinality.xml
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p150 <= 1)
lola: LP says that atomic proposition is always true: (p225 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p149 <= 1)
lola: LP says that atomic proposition is always true: (p73 <= 1)
lola: LP says that atomic proposition is always true: (p73 <= 1)
lola: LP says that atomic proposition is always true: (p328 <= 1)
lola: LP says that atomic proposition is always true: (p73 <= 1)
lola: LP says that atomic proposition is always true: (p328 <= 1)
lola: LP says that atomic proposition is always true: (p328 <= 1)
lola: (G ((((p26 <= 0)) OR ((1 <= p88)))) OR X (F ((((p26 <= 0)) OR ((1 <= p88)))))) : (G (F ((F (X (G ((((p342 <= 0)) OR ((1 <= p150)))))) AND ((1 <= p225))))) OR (((1 <= p262)) AND ((p111 <= 0)))) : X (F ((X (G ((((1 <= p40)) AND ((p29 <= 0))))) OR G ((((p40 <= 0)) OR ((1 <= p29))))))) : G (F ((G ((((p38 <= 0)) OR ((1 <= p15)))) U G (F ((((p180 <= 0)) OR ((1 <= p149)))))))) : X (NOT(F ((((p7 <= 0)) OR ((1 <= p73)))))) : (((X (((1 <= p73))) AND ((1 <= p328))) AND ((p73 <= 0))) U NOT(G ((G (((p328 <= 0))) OR ((1 <= p328))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((((p26 <= 0)) OR ((1 <= p88)))) OR X (F ((((p26 <= 0)) OR ((1 <= p88))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((p26 <= 0)) OR ((1 <= p88))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p26 <= 0)) OR ((1 <= p88))))
lola: processed formula length: 35
lola: 14 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 2265 markings, 61562 edges
lola: ========================================
lola: subprocess 1 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((((p26 <= 0)) OR ((1 <= p88)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((((p26 <= 0)) OR ((1 <= p88)))))
lola: processed formula length: 39
lola: 14 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 1 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((X (G ((((1 <= p40)) AND ((p29 <= 0))))) OR G ((((p40 <= 0)) OR ((1 <= p29)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((X (G ((((1 <= p40)) AND ((p29 <= 0))))) OR G ((((p40 <= 0)) OR ((1 <= p29)))))))
lola: processed formula length: 88
lola: 14 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 59455 markings, 2277730 edges, 11891 markings/sec, 0 secs
lola: 117105 markings, 4505231 edges, 11530 markings/sec, 5 secs
lola: 173335 markings, 6714739 edges, 11246 markings/sec, 10 secs
lola: 230016 markings, 8919359 edges, 11336 markings/sec, 15 secs
lola: add low 1315
lola: add low 1813
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 249232 markings, 9672360 edges
lola: ========================================
lola: subprocess 2 will run for 885 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((((1 <= p7)) AND ((p73 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((1 <= p7)) AND ((p73 <= 0)))))
lola: processed formula length: 38
lola: 14 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 25 markings, 234 edges
lola: ========================================
lola: subprocess 3 will run for 1180 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F (((1 <= p328))) AND ((p328 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F (((1 <= p328))) AND ((p328 <= 0))))
lola: processed formula length: 41
lola: 14 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 4 will run for 1771 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G (F ((((p180 <= 0)) OR ((1 <= p149))))) OR G (((((p38 <= 0)) OR ((1 <= p15))) AND F ((((p180 <= 0)) OR ((1 <= p149)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G (F ((((p180 <= 0)) OR ((1 <= p149))))) OR G (((((p38 <= 0)) OR ((1 <= p15))) AND F ((((p180 <= 0)) OR ((1 <= p149)))))))))
lola: processed formula length: 134
lola: 14 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 3 markings, 3 edges
lola: ========================================
lola: subprocess 5 will run for 3542 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F ((F (G ((((p342 <= 0)) OR ((1 <= p150))))) AND ((1 <= p225))))) OR (((1 <= p262)) AND ((p111 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 3542 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p262)) AND ((p111 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((1 <= p262)) AND ((p111 <= 0)))
lola: processed formula length: 33
lola: 14 rewrites
lola: closed formula file LTLCardinality.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: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (G (F ((F (G ((((p342 <= 0)) OR ((1 <= p150))))) AND ((1 <= p225))))) OR (((1 <= p262)) AND ((p111 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (((1 <= p262)) AND ((p111 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((1 <= p262)) AND ((p111 <= 0)))
lola: processed formula length: 33
lola: 14 rewrites
lola: closed formula file LTLCardinality.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: ========================================
lola: ...considering subproblem: G (F ((F (G ((((p342 <= 0)) OR ((1 <= p150))))) AND ((1 <= p225)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((F (G ((((p342 <= 0)) OR ((1 <= p150))))) AND ((1 <= p225)))))
lola: processed formula length: 69
lola: 14 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 283 markings, 7355 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no no yes
lola:
preliminary result: yes no no no no yes
lola: memory consumption: 36780 KB
lola: time consumption: 28 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DLCflexbar-PT-2a"
export BK_EXAMINATION="LTLCardinality"
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 DLCflexbar-PT-2a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r180-ebro-158987900100337"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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