fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r170-smll-158987815700345
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for FlexibleBarrier-PT-14b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15740.650 3600000.00 380242.00 1095.60 FTTTFFFFFFTTFFFF normal

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.r170-smll-158987815700345.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 FlexibleBarrier-PT-14b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-smll-158987815700345
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 904K
-rw-r--r-- 1 mcc users 3.5K Apr 4 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 4 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 4 07:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K Apr 4 07:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 8 14:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 3 21:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 3 21:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 3 13:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 3 13:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 4 01:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 4 01:37 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 726K 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 FlexibleBarrier-PT-14b-00
FORMULA_NAME FlexibleBarrier-PT-14b-01
FORMULA_NAME FlexibleBarrier-PT-14b-02
FORMULA_NAME FlexibleBarrier-PT-14b-03
FORMULA_NAME FlexibleBarrier-PT-14b-04
FORMULA_NAME FlexibleBarrier-PT-14b-05
FORMULA_NAME FlexibleBarrier-PT-14b-06
FORMULA_NAME FlexibleBarrier-PT-14b-07
FORMULA_NAME FlexibleBarrier-PT-14b-08
FORMULA_NAME FlexibleBarrier-PT-14b-09
FORMULA_NAME FlexibleBarrier-PT-14b-10
FORMULA_NAME FlexibleBarrier-PT-14b-11
FORMULA_NAME FlexibleBarrier-PT-14b-12
FORMULA_NAME FlexibleBarrier-PT-14b-13
FORMULA_NAME FlexibleBarrier-PT-14b-14
FORMULA_NAME FlexibleBarrier-PT-14b-15

=== Now, execution of the tool begins

BK_START 1591373739308

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 16:15: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-05 16:15:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 16:15:41] [INFO ] Load time of PNML (sax parser for PT used): 297 ms
[2020-06-05 16:15:41] [INFO ] Transformed 2678 places.
[2020-06-05 16:15:41] [INFO ] Transformed 3085 transitions.
[2020-06-05 16:15:41] [INFO ] Found NUPN structural information;
[2020-06-05 16:15:41] [INFO ] Parsed PT model containing 2678 places and 3085 transitions in 374 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 86 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 1016 resets, run finished after 718 ms. (steps per millisecond=139 ) properties seen :[0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 1]
// Phase 1: matrix 3085 rows 2678 cols
[2020-06-05 16:15:42] [INFO ] Computed 16 place invariants in 217 ms
[2020-06-05 16:15:43] [INFO ] [Real]Absence check using 16 positive place invariants in 179 ms returned sat
[2020-06-05 16:15:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 16:16:03] [INFO ] [Real]Absence check using state equation in 19043 ms returned (error "Solver has unexpectedly terminated")
[2020-06-05 16:16:03] [INFO ] [Real]Absence check using 16 positive place invariants in 152 ms returned sat
[2020-06-05 16:16:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 16:16:22] [INFO ] [Real]Absence check using state equation in 19036 ms returned sat
[2020-06-05 16:16:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 16:16:30] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 16:16:34] [INFO ] [Nat]Absence check using 16 positive place invariants in 11119 ms returned unknown
[2020-06-05 16:16:35] [INFO ] [Real]Absence check using 16 positive place invariants in 156 ms returned sat
[2020-06-05 16:16:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 16:16:53] [INFO ] [Real]Absence check using state equation in 18448 ms returned sat
[2020-06-05 16:16:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 16:17:01] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 16:17:05] [INFO ] [Nat]Absence check using 16 positive place invariants in 10794 ms returned unknown
[2020-06-05 16:17:05] [INFO ] [Real]Absence check using 16 positive place invariants in 156 ms returned sat
[2020-06-05 16:17:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 16:17:25] [INFO ] [Real]Absence check using state equation in 19082 ms returned sat
[2020-06-05 16:17:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 16:17:32] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 16:17:36] [INFO ] [Nat]Absence check using 16 positive place invariants in 11094 ms returned unknown
[2020-06-05 16:17:37] [INFO ] [Real]Absence check using 16 positive place invariants in 157 ms returned sat
[2020-06-05 16:17:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 16:17:56] [INFO ] [Real]Absence check using state equation in 18849 ms returned sat
[2020-06-05 16:17:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 16:18:04] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 16:18:08] [INFO ] [Nat]Absence check using 16 positive place invariants in 11158 ms returned unknown
[2020-06-05 16:18:08] [INFO ] [Real]Absence check using 16 positive place invariants in 152 ms returned sat
[2020-06-05 16:18:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 16:18:27] [INFO ] [Real]Absence check using state equation in 19164 ms returned sat
[2020-06-05 16:18:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 16:18:29] [INFO ] [Nat]Absence check using 16 positive place invariants in 1039 ms returned unsat
[2020-06-05 16:18:30] [INFO ] [Real]Absence check using 16 positive place invariants in 155 ms returned sat
[2020-06-05 16:18:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 16:18:49] [INFO ] [Real]Absence check using state equation in 18596 ms returned sat
[2020-06-05 16:18:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 16:18:56] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 16:19:00] [INFO ] [Nat]Absence check using 16 positive place invariants in 10722 ms returned unknown
[2020-06-05 16:19:01] [INFO ] [Real]Absence check using 16 positive place invariants in 213 ms returned sat
[2020-06-05 16:19:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 16:19:19] [INFO ] [Real]Absence check using state equation in 18347 ms returned sat
[2020-06-05 16:19:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 16:19:27] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 16:19:31] [INFO ] [Nat]Absence check using 16 positive place invariants in 10983 ms returned unknown
[2020-06-05 16:19:32] [INFO ] [Real]Absence check using 16 positive place invariants in 253 ms returned sat
[2020-06-05 16:19:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 16:19:50] [INFO ] [Real]Absence check using state equation in 18133 ms returned sat
[2020-06-05 16:19:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 16:19:58] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 16:20:01] [INFO ] [Nat]Absence check using 16 positive place invariants in 10877 ms returned unknown
[2020-06-05 16:20:02] [INFO ] [Real]Absence check using 16 positive place invariants in 251 ms returned sat
[2020-06-05 16:20:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 16:20:21] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 16:20:21] [INFO ] [Real]Absence check using state equation in 19033 ms returned unknown
[2020-06-05 16:20:22] [INFO ] [Real]Absence check using 16 positive place invariants in 249 ms returned sat
[2020-06-05 16:20:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 16:20:41] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 16:20:41] [INFO ] [Real]Absence check using state equation in 19047 ms returned unknown
[2020-06-05 16:20:42] [INFO ] [Real]Absence check using 16 positive place invariants in 159 ms returned sat
[2020-06-05 16:20:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 16:21:01] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 16:21:01] [INFO ] [Real]Absence check using state equation in 19353 ms returned (error "Failed to check-sat")
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-05 16:21:02] [INFO ] Initial state reduction rules for CTL removed 10 formulas.
[2020-06-05 16:21:02] [INFO ] Flatten gal took : 308 ms
FORMULA FlexibleBarrier-PT-14b-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-14b-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-14b-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-14b-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-14b-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-14b-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-14b-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-14b-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-14b-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-14b-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-05 16:21:02] [INFO ] Applying decomposition
[2020-06-05 16:21:02] [INFO ] Flatten gal took : 232 ms
[2020-06-05 16:21:02] [INFO ] Decomposing Gal with order
[2020-06-05 16:21:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-05 16:21:03] [INFO ] Removed a total of 91 redundant transitions.
[2020-06-05 16:21:03] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-05 16:21:03] [INFO ] Flatten gal took : 682 ms
[2020-06-05 16:21:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 721 labels/synchronizations in 292 ms.
[2020-06-05 16:21:07] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA FlexibleBarrier-PT-14b-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-05 16:21:07] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2020-06-05 16:21:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 50 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ FlexibleBarrier-PT-14b @ 3570 seconds

FORMULA FlexibleBarrier-PT-14b-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-14b-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-14b-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-14b-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-14b-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3539
rslt: Output for LTLCardinality @ FlexibleBarrier-PT-14b

{
"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": "Fri Jun 5 16:21:08 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 707
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 2,
"aneg": 1,
"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": "X ((G ((((1 <= p2337)) AND ((p2253 <= 0)))) AND ((p672 <= 0))))",
"processed_size": 63,
"rewrites": 44
},
"result":
{
"edges": 24,
"markings": 24,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 0,
"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": 884
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"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 (X (F ((((p801 <= 0)) OR ((1 <= p1959))))))",
"processed_size": 46,
"rewrites": 44
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 1179
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1179
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "(((p553 <= 0)) OR ((1 <= p2038)))",
"processed_size": 34,
"rewrites": 46
},
"result":
{
"edges": 101,
"markings": 102,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1769
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 4,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((F ((((1 <= p1171)) AND ((p1788 <= 0)))) AND (X ((((p1171 <= 0)) OR ((1 <= p1788)))) OR (((1 <= p1171)) AND ((p1788 <= 0))))))",
"processed_size": 129,
"rewrites": 44
},
"result":
{
"edges": 23,
"markings": 23,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 3,
"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": 3539
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"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": "F (G ((((1 <= p9)) AND ((p2155 <= 0)))))",
"processed_size": 40,
"rewrites": 44
},
"result":
{
"edges": 104,
"markings": 103,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 80572,
"runtime": 31.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X((G(*) AND **)) : F(G(*)) : X(X(F(**))) : (F(*) AND X(F(**))) : G((F(**) AND (X((** OR **)) OR **)))"
},
"net":
{
"arcs": 7733,
"conflict_clusters": 2073,
"places": 2678,
"places_significant": 2662,
"singleton_clusters": 0,
"transitions": 3085
},
"result":
{
"preliminary_value": "no no yes no no ",
"value": "no no yes no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 5763/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2678
lola: finding significant places
lola: 2678 places, 3085 transitions, 2662 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: (p2253 <= 1)
lola: LP says that atomic proposition is always true: (p672 <= 1)
lola: LP says that atomic proposition is always true: (p2155 <= 1)
lola: LP says that atomic proposition is always true: (p1959 <= 1)
lola: LP says that atomic proposition is always true: (p2038 <= 1)
lola: LP says that atomic proposition is always true: (p2038 <= 1)
lola: LP says that atomic proposition is always true: (p2038 <= 1)
lola: LP says that atomic proposition is always true: (p1788 <= 1)
lola: LP says that atomic proposition is always true: (p1788 <= 1)
lola: X (((1 <= 0) U (NOT(F ((((p2337 <= 0)) OR ((1 <= p2253))))) AND ((p672 <= 0))))) : F (NOT(G (X (((0 <= 0) U (((p9 <= 0)) OR ((1 <= p2155)))))))) : F (X (X (((1 <= 0) U ((1 <= 0) U (((p801 <= 0)) OR ((1 <= p1959)))))))) : (NOT(G ((((p553 <= 0)) OR ((1 <= p2038))))) AND F ((((1 <= 0) U (((p553 <= 0)) OR ((1 <= p2038)))) U X ((((p553 <= 0)) OR ((1 <= p2038))))))) : NOT(F (NOT((X (((((0 <= 0) U (1 <= 0)) OR ((p1171 <= 0))) OR ((1 <= p1788)))) U (((1 <= p1171)) AND ((p1788 <= 0)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:185
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 707 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((((1 <= p2337)) AND ((p2253 <= 0)))) AND ((p672 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((((1 <= p2337)) AND ((p2253 <= 0)))) AND ((p672 <= 0))))
lola: processed formula length: 63
lola: 44 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 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: 24 markings, 24 edges
lola: ========================================
lola: subprocess 1 will run for 884 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((((p801 <= 0)) OR ((1 <= p1959))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((((p801 <= 0)) OR ((1 <= p1959))))))
lola: processed formula length: 46
lola: 44 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 2 will run for 1179 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((((1 <= p553)) AND ((p2038 <= 0)))) AND X (F ((((p553 <= 0)) OR ((1 <= p2038))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 1179 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((1 <= p553)) AND ((p2038 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (((p553 <= 0)) OR ((1 <= p2038)))
lola: processed formula length: 34
lola: 46 rewrites
lola: closed formula file LTLCardinality.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: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 102 markings, 101 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 1769 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((((1 <= p1171)) AND ((p1788 <= 0)))) AND (X ((((p1171 <= 0)) OR ((1 <= p1788)))) OR (((1 <= p1171)) AND ((p1788 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((((1 <= p1171)) AND ((p1788 <= 0)))) AND (X ((((p1171 <= 0)) OR ((1 <= p1788)))) OR (((1 <= p1171)) AND ((p1788 <= 0))))))
lola: processed formula length: 129
lola: 44 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 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: 23 markings, 23 edges
lola: ========================================
lola: subprocess 4 will run for 3539 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((1 <= p9)) AND ((p2155 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((((1 <= p9)) AND ((p2155 <= 0)))))
lola: processed formula length: 40
lola: 44 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: 103 markings, 104 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no no
lola:
preliminary result: no no yes no no
lola: memory consumption: 80572 KB
lola: time consumption: 31 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="FlexibleBarrier-PT-14b"
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 FlexibleBarrier-PT-14b, 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 r170-smll-158987815700345"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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