Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r182-oct2-158987913700321.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is BridgeAndVehicles-PT-V20P10N50, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987913700321
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.7M
-rw-r--r-- 1 mcc users 7.7K Mar 26 02:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 26 02:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 60K Mar 25 20:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 180K Mar 25 20:55 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 7.8K Apr 8 14:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 35K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 78K Apr 8 14:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 230K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K Mar 25 17:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 25 17:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 129K Mar 25 12:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 376K Mar 25 12:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.0K Mar 25 17:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.5K Mar 25 17:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 2.5M 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 BridgeAndVehicles-PT-V20P10N50-00
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-01
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-02
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-03
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-04
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-05
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-06
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-07
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-08
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-09
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-10
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-11
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-12
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-13
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-14
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-15

=== Now, execution of the tool begins

BK_START 1591143580993

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 00:19:43] [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 00:19:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 00:19:43] [INFO ] Load time of PNML (sax parser for PT used): 185 ms
[2020-06-03 00:19:43] [INFO ] Transformed 108 places.
[2020-06-03 00:19:43] [INFO ] Transformed 2228 transitions.
[2020-06-03 00:19:43] [INFO ] Parsed PT model containing 108 places and 2228 transitions in 226 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 73 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 577 resets, run finished after 702 ms. (steps per millisecond=142 ) properties seen :[1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1]
[2020-06-03 00:19:44] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 108 cols
[2020-06-03 00:19:44] [INFO ] Computed 7 place invariants in 11 ms
[2020-06-03 00:19:44] [INFO ] [Real]Absence check using 7 positive place invariants in 12 ms returned unsat
[2020-06-03 00:19:44] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-03 00:19:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:19:44] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2020-06-03 00:19:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:19:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2020-06-03 00:19:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:19:44] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2020-06-03 00:19:44] [INFO ] State equation strengthened by 102 read => feed constraints.
[2020-06-03 00:19:44] [INFO ] [Nat]Added 102 Read/Feed constraints in 25 ms returned sat
[2020-06-03 00:19:45] [INFO ] Deduced a trap composed of 5 places in 196 ms
[2020-06-03 00:19:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 230 ms
[2020-06-03 00:19:45] [INFO ] Computed and/alt/rep : 2225/114389/287 causal constraints in 223 ms.
[2020-06-03 00:19:55] [INFO ] Added : 232 causal constraints over 47 iterations in 10299 ms. Result :sat
[2020-06-03 00:19:55] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-06-03 00:19:55] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2020-06-03 00:19:55] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2020-06-03 00:19:55] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2020-06-03 00:19:55] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-03 00:19:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:19:55] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2020-06-03 00:19:55] [INFO ] [Real]Added 102 Read/Feed constraints in 19 ms returned sat
[2020-06-03 00:19:55] [INFO ] Computed and/alt/rep : 2225/114389/287 causal constraints in 150 ms.
[2020-06-03 00:19:55] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:19:55] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-03 00:19:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:19:55] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2020-06-03 00:19:55] [INFO ] [Nat]Added 102 Read/Feed constraints in 20 ms returned sat
[2020-06-03 00:19:56] [INFO ] Computed and/alt/rep : 2225/114389/287 causal constraints in 199 ms.
[2020-06-03 00:20:06] [INFO ] Added : 243 causal constraints over 49 iterations in 10210 ms. Result :sat
[2020-06-03 00:20:06] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-06-03 00:20:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:20:06] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2020-06-03 00:20:06] [INFO ] [Real]Added 102 Read/Feed constraints in 28 ms returned sat
[2020-06-03 00:20:06] [INFO ] Computed and/alt/rep : 2225/114389/287 causal constraints in 80 ms.
[2020-06-03 00:20:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:20:06] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-03 00:20:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:20:06] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2020-06-03 00:20:06] [INFO ] [Nat]Added 102 Read/Feed constraints in 26 ms returned sat
[2020-06-03 00:20:06] [INFO ] Computed and/alt/rep : 2225/114389/287 causal constraints in 161 ms.
[2020-06-03 00:20:17] [INFO ] Added : 243 causal constraints over 49 iterations in 11341 ms. Result :sat
[2020-06-03 00:20:18] [INFO ] [Real]Absence check using 7 positive place invariants in 17 ms returned sat
[2020-06-03 00:20:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:20:18] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2020-06-03 00:20:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:20:18] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2020-06-03 00:20:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:20:18] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2020-06-03 00:20:18] [INFO ] [Nat]Added 102 Read/Feed constraints in 37 ms returned sat
[2020-06-03 00:20:18] [INFO ] Deduced a trap composed of 5 places in 138 ms
[2020-06-03 00:20:18] [INFO ] Deduced a trap composed of 56 places in 152 ms
[2020-06-03 00:20:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 333 ms
[2020-06-03 00:20:18] [INFO ] Computed and/alt/rep : 2225/114389/287 causal constraints in 131 ms.
[2020-06-03 00:20:21] [INFO ] Added : 173 causal constraints over 35 iterations in 2736 ms. Result :sat
[2020-06-03 00:20:21] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-06-03 00:20:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:20:21] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2020-06-03 00:20:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:20:21] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-03 00:20:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:20:21] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2020-06-03 00:20:21] [INFO ] [Nat]Added 102 Read/Feed constraints in 25 ms returned sat
[2020-06-03 00:20:21] [INFO ] Computed and/alt/rep : 2225/114389/287 causal constraints in 97 ms.
[2020-06-03 00:20:31] [INFO ] Added : 215 causal constraints over 43 iterations in 9632 ms. Result :unknown
[2020-06-03 00:20:31] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-03 00:20:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:20:31] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2020-06-03 00:20:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:20:31] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2020-06-03 00:20:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:20:31] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2020-06-03 00:20:31] [INFO ] [Nat]Added 102 Read/Feed constraints in 22 ms returned sat
[2020-06-03 00:20:31] [INFO ] Computed and/alt/rep : 2225/114389/287 causal constraints in 212 ms.
[2020-06-03 00:20:40] [INFO ] Added : 215 causal constraints over 43 iterations in 9266 ms. Result :unknown
Successfully simplified 5 atomic propositions for a total of 7 simplifications.
[2020-06-03 00:20:41] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-06-03 00:20:41] [INFO ] Flatten gal took : 309 ms
FORMULA BridgeAndVehicles-PT-V20P10N50-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N50-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N50-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N50-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N50-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N50-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 00:20:41] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-03 00:20:41] [INFO ] Flatten gal took : 137 ms
[2020-06-03 00:20:41] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BridgeAndVehicles-PT-V20P10N50-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 00:20:41] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 13 ms.
[2020-06-03 00:20:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 15 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ BridgeAndVehicles-PT-V20P10N50 @ 3570 seconds

FORMULA BridgeAndVehicles-PT-V20P10N50-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P10N50-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P10N50-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P10N50-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P10N50-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P10N50-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P10N50-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P10N50-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P10N50-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2564
rslt: Output for LTLCardinality @ BridgeAndVehicles-PT-V20P10N50

{
"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",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 00:20:42 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 393
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (G ((F ((p23 <= p49)) AND (X ((p24 <= p52)) OR ((p24 <= p52) OR (p23 <= p49))))))",
"processed_size": 83,
"rewrites": 38
},
"result":
{
"edges": 60268953,
"markings": 12260581,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 430
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 430
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p52 <= 0)",
"processed_size": 10,
"rewrites": 40
},
"result":
{
"edges": 62559,
"markings": 27972,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 21
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 491
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (G ((1 <= p55)))",
"processed_size": 18,
"rewrites": 38
},
"result":
{
"edges": 168,
"markings": 168,
"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": 573
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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 ((p56 <= p52)))",
"processed_size": 20,
"rewrites": 38
},
"result":
{
"edges": 168,
"markings": 168,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 491
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((F (G ((p54 + 1 <= p27))) AND X (G ((p46 <= p22)))))",
"processed_size": 55,
"rewrites": 38
},
"result":
{
"edges": 170,
"markings": 169,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 573
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 688
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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 ((p22 <= p25)))",
"processed_size": 20,
"rewrites": 38
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"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": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 688
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 7,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 1,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((F (G ((X (G ((p52 <= p0))) OR G ((p52 <= p0))))) AND G (((p95 <= p0) OR G ((X (G ((p52 <= p0))) OR G ((p52 <= p0))))))))",
"processed_size": 124,
"rewrites": 38
},
"result":
{
"edges": 397684072,
"markings": 58817749,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 16
},
"compoundnumber": 4,
"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": 711
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 2,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X (F ((X (F (((p91 <= p51) OR (3 <= p52)))) AND ((2 <= p0) AND ((p25 + 1 <= p23) OR (p51 + 1 <= p91))))))",
"processed_size": 107,
"rewrites": 38
},
"result":
{
"edges": 335,
"markings": 334,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 5,
"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": 948
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G ((p49 <= 2))",
"processed_size": 14,
"rewrites": 38
},
"result":
{
"edges": 168,
"markings": 168,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"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": 1423
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"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 ((p22 + 1 <= p25))",
"processed_size": 20,
"rewrites": 38
},
"result":
{
"edges": 1212,
"markings": 598,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"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": 2846
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2846
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p0 <= p24)",
"processed_size": 11,
"rewrites": 38
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p0 <= p24)",
"processed_size": 11,
"rewrites": 38
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((p0 <= p24)))",
"processed_size": 19,
"rewrites": 38
},
"result":
{
"edges": 58848689,
"markings": 12228309,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 81472,
"runtime": 1006.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(G(F(**)) OR **) : F(G((F(**) AND (X(**) OR (** OR **))))) : (X(G(**)) OR (X(G(**)) AND F(**))) : X((F(G(*)) AND X(G(**)))) : G(*) : (X(F(**)) AND (G(*) OR (G(*) OR (** OR **)))) : G(*) : X((F(G((X(G(*)) OR G(**)))) AND G((** OR G((X(G(*)) OR G(**))))))) : X(F((X(F(**)) AND (** AND **))))"
},
"net":
{
"arcs": 17190,
"conflict_clusters": 5,
"places": 108,
"places_significant": 101,
"singleton_clusters": 0,
"transitions": 2228
},
"result":
{
"preliminary_value": "yes yes no no no yes no yes no ",
"value": "yes yes no no no yes no yes 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: 2336/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 3456
lola: finding significant places
lola: 108 places, 2228 transitions, 101 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: (X (G (F ((p0 <= p24)))) OR (p0 <= p24)) : X (F (G (((X ((p24 <= p52)) OR (p24 <= p52)) U (p23 <= p49))))) : (G (X ((1 <= p55))) OR (X (G ((p56 <= p52))) AND F ((1 <= p52)))) : X ((NOT(G (F ((p27 <= p54)))) AND G (X ((p46 <= p22))))) : NOT(F (((1 <= 0) U (3 <= p49)))) : (F (X ((p22 <= p25))) AND (((NOT(F ((p23 + 1 <= p51))) OR NOT(F ((1 <= p83)))) OR (p83 <= 0)) OR (p50 + 1 <= p23))) : NOT(F (((p27 <= p25) U (p25 <= p22)))) : G (X (((p95 <= p0) U NOT(F ((X (F ((p0 + 1 <= p52))) AND NOT(G ((p52 <= p0))))))))) : X (F (((X (F (((p91 <= p51) OR (3 <= p52)))) AND (2 <= p0)) AND ((p25 + 1 <= p23) OR (p51 + 1 <= p91)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:434
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((p23 <= p49)) AND (X ((p24 <= p52)) OR ((p24 <= p52) OR (p23 <= p49))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((p23 <= p49)) AND (X ((p24 <= p52)) OR ((p24 <= p52) OR (p23 <= p49))))))
lola: processed formula length: 83
lola: 38 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: 639010 markings, 3923898 edges, 127802 markings/sec, 0 secs
lola: 1262600 markings, 7743898 edges, 124718 markings/sec, 5 secs
lola: 1910371 markings, 11422522 edges, 129554 markings/sec, 10 secs
lola: 2548908 markings, 15047812 edges, 127707 markings/sec, 15 secs
lola: 3236699 markings, 18495265 edges, 137558 markings/sec, 20 secs
lola: 3921561 markings, 21895616 edges, 136972 markings/sec, 25 secs
lola: 4604942 markings, 25269484 edges, 136676 markings/sec, 30 secs
lola: 5276783 markings, 28594955 edges, 134368 markings/sec, 35 secs
lola: 5947137 markings, 31915892 edges, 134071 markings/sec, 40 secs
lola: 6618640 markings, 35139338 edges, 134301 markings/sec, 45 secs
lola: 7336439 markings, 38243287 edges, 143560 markings/sec, 50 secs
lola: 8033165 markings, 41292550 edges, 139345 markings/sec, 55 secs
lola: 8698252 markings, 44604909 edges, 133017 markings/sec, 60 secs
lola: 9414821 markings, 47496571 edges, 143314 markings/sec, 65 secs
lola: 10079819 markings, 50508399 edges, 133000 markings/sec, 70 secs
lola: 10766203 markings, 53611785 edges, 137277 markings/sec, 75 secs
lola: 11433084 markings, 56328418 edges, 133376 markings/sec, 80 secs
lola: 12115393 markings, 59523305 edges, 136462 markings/sec, 85 secs
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: 12260581 markings, 60268953 edges
lola: ========================================
lola: subprocess 1 will run for 430 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((1 <= p55))) OR (X (G ((p56 <= p52))) AND F ((1 <= p52))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 430 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((1 <= p52))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p52 <= 0)
lola: processed formula length: 10
lola: 40 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: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 27972 markings, 62559 edges
lola: ========================================
lola: subprocess 2 will run for 491 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((1 <= p55)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((1 <= p55)))
lola: processed formula length: 18
lola: 38 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: 168 markings, 168 edges
lola: ========================================
lola: subprocess 3 will run for 573 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p56 <= p52)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p56 <= p52)))
lola: processed formula length: 20
lola: 38 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: 168 markings, 168 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 491 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (G ((p54 + 1 <= p27))) AND X (G ((p46 <= p22)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (G ((p54 + 1 <= p27))) AND X (G ((p46 <= p22)))))
lola: processed formula length: 55
lola: 38 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 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: 169 markings, 170 edges
lola: ========================================
lola: subprocess 3 will run for 573 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((p22 <= p25))) AND (G ((p51 <= p23)) OR (G ((p83 <= 0)) OR ((p83 <= 0) OR (p50 + 1 <= p23)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 573 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p83 <= 0) OR (p50 + 1 <= p23))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: processed formula: ((p83 <= 0) OR (p50 + 1 <= p23))
lola: processed formula length: 32
lola: 39 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 688 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p22 <= p25)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p22 <= p25)))
lola: processed formula length: 20
lola: 38 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: 4 markings, 3 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 688 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (G ((X (G ((p52 <= p0))) OR G ((p52 <= p0))))) AND G (((p95 <= p0) OR G ((X (G ((p52 <= p0))) OR G ((p52 <= p0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (G ((X (G ((p52 <= p0))) OR G ((p52 <= p0))))) AND G (((p95 <= p0) OR G ((X (G ((p52 <= p0))) OR G ((p52 <= p0))))))))
lola: processed formula length: 124
lola: 38 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 16 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: 854459 markings, 2809778 edges, 170892 markings/sec, 0 secs
lola: 1669307 markings, 5623384 edges, 162970 markings/sec, 5 secs
lola: 2479213 markings, 8427264 edges, 161981 markings/sec, 10 secs
lola: 3272042 markings, 11171497 edges, 158566 markings/sec, 15 secs
lola: 4050005 markings, 13927209 edges, 155593 markings/sec, 20 secs
lola: 4809732 markings, 16609676 edges, 151945 markings/sec, 25 secs
lola: 5568788 markings, 19293202 edges, 151811 markings/sec, 30 secs
lola: 6321519 markings, 21942670 edges, 150546 markings/sec, 35 secs
lola: 7079387 markings, 24601973 edges, 151574 markings/sec, 40 secs
lola: 7816427 markings, 27283678 edges, 147408 markings/sec, 45 secs
lola: 8512677 markings, 29765839 edges, 139250 markings/sec, 50 secs
lola: 9245688 markings, 32532796 edges, 146602 markings/sec, 55 secs
lola: 9851524 markings, 35570551 edges, 121167 markings/sec, 60 secs
lola: 10420719 markings, 38549735 edges, 113839 markings/sec, 65 secs
lola: 10992724 markings, 41625871 edges, 114401 markings/sec, 70 secs
lola: 11512283 markings, 44763958 edges, 103912 markings/sec, 75 secs
lola: 12082475 markings, 47642443 edges, 114038 markings/sec, 80 secs
lola: 12597805 markings, 50959409 edges, 103066 markings/sec, 85 secs
lola: 13164143 markings, 53795980 edges, 113268 markings/sec, 90 secs
lola: 13674557 markings, 57380411 edges, 102083 markings/sec, 95 secs
lola: 14229182 markings, 60237458 edges, 110925 markings/sec, 100 secs
lola: 14751813 markings, 63418778 edges, 104526 markings/sec, 105 secs
lola: 15225722 markings, 66970443 edges, 94782 markings/sec, 110 secs
lola: 15776452 markings, 69819078 edges, 110146 markings/sec, 115 secs
lola: 16301322 markings, 72833601 edges, 104974 markings/sec, 120 secs
lola: 16771541 markings, 76742771 edges, 94044 markings/sec, 125 secs
lola: 17226552 markings, 79808269 edges, 91002 markings/sec, 130 secs
lola: 17827920 markings, 82654353 edges, 120274 markings/sec, 135 secs
lola: 18329391 markings, 85873426 edges, 100294 markings/sec, 140 secs
lola: 18770735 markings, 89908699 edges, 88269 markings/sec, 145 secs
lola: 19233631 markings, 93229199 edges, 92579 markings/sec, 150 secs
lola: 19759252 markings, 96038324 edges, 105124 markings/sec, 155 secs
lola: 20294489 markings, 98769279 edges, 107047 markings/sec, 160 secs
lola: 20766788 markings, 102683752 edges, 94460 markings/sec, 165 secs
lola: 21208088 markings, 106620075 edges, 88260 markings/sec, 170 secs
lola: 21662812 markings, 110014668 edges, 90945 markings/sec, 175 secs
lola: 22154682 markings, 112824203 edges, 98374 markings/sec, 180 secs
lola: 22740122 markings, 115585935 edges, 117088 markings/sec, 185 secs
lola: 23205020 markings, 119017597 edges, 92980 markings/sec, 190 secs
lola: 23623998 markings, 123056006 edges, 83796 markings/sec, 195 secs
lola: 24057706 markings, 127038052 edges, 86742 markings/sec, 200 secs
lola: 24509451 markings, 130307707 edges, 90349 markings/sec, 205 secs
lola: 24981599 markings, 133074009 edges, 94430 markings/sec, 210 secs
lola: 25566578 markings, 135862518 edges, 116996 markings/sec, 215 secs
lola: 26055787 markings, 139018224 edges, 97842 markings/sec, 220 secs
lola: 26463515 markings, 143140677 edges, 81546 markings/sec, 225 secs
lola: 26883465 markings, 147083813 edges, 83990 markings/sec, 230 secs
lola: 27318511 markings, 150945288 edges, 87009 markings/sec, 235 secs
lola: 27760316 markings, 154166333 edges, 88361 markings/sec, 240 secs
lola: 28218549 markings, 156897665 edges, 91647 markings/sec, 245 secs
lola: 28792722 markings, 159645520 edges, 114835 markings/sec, 250 secs
lola: 29277219 markings, 162455104 edges, 96899 markings/sec, 255 secs
lola: 29703031 markings, 166475933 edges, 85162 markings/sec, 260 secs
lola: 30094646 markings, 170547223 edges, 78323 markings/sec, 265 secs
lola: 30511967 markings, 174459412 edges, 83464 markings/sec, 270 secs
lola: 30948220 markings, 178316034 edges, 87251 markings/sec, 275 secs
lola: 31383419 markings, 181506199 edges, 87040 markings/sec, 280 secs
lola: 31811508 markings, 184203076 edges, 85618 markings/sec, 285 secs
lola: 32386297 markings, 186977170 edges, 114958 markings/sec, 290 secs
lola: 32909138 markings, 189703222 edges, 104568 markings/sec, 295 secs
lola: 33362719 markings, 193527056 edges, 90716 markings/sec, 300 secs
lola: 33748414 markings, 197596292 edges, 77139 markings/sec, 305 secs
lola: 34137950 markings, 201715260 edges, 77907 markings/sec, 310 secs
lola: 34556644 markings, 205652180 edges, 83739 markings/sec, 315 secs
lola: 34990986 markings, 209576607 edges, 86868 markings/sec, 320 secs
lola: 35436926 markings, 212856347 edges, 89188 markings/sec, 325 secs
lola: 35847939 markings, 215550537 edges, 82203 markings/sec, 330 secs
lola: 36419471 markings, 218394929 edges, 114306 markings/sec, 335 secs
lola: 36985310 markings, 221105016 edges, 113168 markings/sec, 340 secs
lola: 37450896 markings, 224671624 edges, 93117 markings/sec, 345 secs
lola: 37831472 markings, 228614005 edges, 76115 markings/sec, 350 secs
lola: 38216435 markings, 232589994 edges, 76993 markings/sec, 355 secs
lola: 38604899 markings, 236673522 edges, 77693 markings/sec, 360 secs
lola: 39010181 markings, 240766831 edges, 81056 markings/sec, 365 secs
lola: 39442389 markings, 244596265 edges, 86442 markings/sec, 370 secs
lola: 39886314 markings, 248074283 edges, 88785 markings/sec, 375 secs
lola: 40306202 markings, 250909329 edges, 83978 markings/sec, 380 secs
lola: 40808961 markings, 253688064 edges, 100552 markings/sec, 385 secs
lola: 41386630 markings, 256458803 edges, 115534 markings/sec, 390 secs
lola: 41899036 markings, 259443005 edges, 102481 markings/sec, 395 secs
lola: 42317397 markings, 263259294 edges, 83672 markings/sec, 400 secs
lola: 42691614 markings, 267206485 edges, 74843 markings/sec, 405 secs
lola: 43067742 markings, 271193692 edges, 75226 markings/sec, 410 secs
lola: 43448235 markings, 275248188 edges, 76099 markings/sec, 415 secs
lola: 43848949 markings, 279290017 edges, 80143 markings/sec, 420 secs
lola: 44266710 markings, 283297976 edges, 83552 markings/sec, 425 secs
lola: 44702735 markings, 286943636 edges, 87205 markings/sec, 430 secs
lola: 45141192 markings, 290161758 edges, 87691 markings/sec, 435 secs
lola: 45551630 markings, 292862774 edges, 82088 markings/sec, 440 secs
lola: 46098543 markings, 295671277 edges, 109383 markings/sec, 445 secs
lola: 46669788 markings, 298400699 edges, 114249 markings/sec, 450 secs
lola: 47170140 markings, 301628342 edges, 100070 markings/sec, 455 secs
lola: 47565111 markings, 305407244 edges, 78994 markings/sec, 460 secs
lola: 47932510 markings, 309293090 edges, 73480 markings/sec, 465 secs
lola: 48304116 markings, 313217711 edges, 74321 markings/sec, 470 secs
lola: 48679030 markings, 317214104 edges, 74983 markings/sec, 475 secs
lola: 49060549 markings, 321274620 edges, 76304 markings/sec, 480 secs
lola: 49464480 markings, 325300346 edges, 80786 markings/sec, 485 secs
lola: 49882440 markings, 329321600 edges, 83592 markings/sec, 490 secs
lola: 50319427 markings, 332938929 edges, 87397 markings/sec, 495 secs
lola: 50757713 markings, 336164307 edges, 87657 markings/sec, 500 secs
lola: 51168807 markings, 338876435 edges, 82219 markings/sec, 505 secs
lola: 51682447 markings, 341597978 edges, 102728 markings/sec, 510 secs
lola: 52253799 markings, 344351244 edges, 114270 markings/sec, 515 secs
lola: 52783171 markings, 347383209 edges, 105874 markings/sec, 520 secs
lola: 53200014 markings, 351102098 edges, 83369 markings/sec, 525 secs
lola: 53562784 markings, 354996763 edges, 72554 markings/sec, 530 secs
lola: 53928516 markings, 358897910 edges, 73146 markings/sec, 535 secs
lola: 54299849 markings, 362815629 edges, 74267 markings/sec, 540 secs
lola: 54678825 markings, 366759304 edges, 75795 markings/sec, 545 secs
lola: 55066086 markings, 370783090 edges, 77452 markings/sec, 550 secs
lola: 55457349 markings, 374944165 edges, 78253 markings/sec, 555 secs
lola: 55875924 markings, 378986510 edges, 83715 markings/sec, 560 secs
lola: 56308309 markings, 382833916 edges, 86477 markings/sec, 565 secs
lola: 56751793 markings, 386336564 edges, 88697 markings/sec, 570 secs
lola: 57174828 markings, 389197668 edges, 84607 markings/sec, 575 secs
lola: 57605820 markings, 391879570 edges, 86198 markings/sec, 580 secs
lola: 58189323 markings, 394716724 edges, 116701 markings/sec, 585 secs
lola: 58773851 markings, 397484292 edges, 116906 markings/sec, 590 secs
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: 58817749 markings, 397684072 edges
lola: ========================================
lola: subprocess 5 will run for 711 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((X (F (((p91 <= p51) OR (3 <= p52)))) AND ((2 <= p0) AND ((p25 + 1 <= p23) OR (p51 + 1 <= p91))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((X (F (((p91 <= p51) OR (3 <= p52)))) AND ((2 <= p0) AND ((p25 + 1 <= p23) OR (p51 + 1 <= p91))))))
lola: processed formula length: 107
lola: 38 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: 334 markings, 335 edges
lola: ========================================
lola: subprocess 6 will run for 948 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p49 <= 2))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p49 <= 2))
lola: processed formula length: 14
lola: 38 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: 168 markings, 168 edges
lola: ========================================
lola: subprocess 7 will run for 1423 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p22 + 1 <= p25))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p22 + 1 <= p25))
lola: processed formula length: 20
lola: 38 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: 598 markings, 1212 edges
lola: ========================================
lola: subprocess 8 will run for 2846 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F ((p0 <= p24))) OR (p0 <= p24))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 2846 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p0 <= p24)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p0 <= p24)
lola: processed formula length: 11
lola: 38 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (G (F ((p0 <= p24))) OR (p0 <= p24))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (p0 <= p24)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p0 <= p24)
lola: processed formula length: 11
lola: 38 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (F ((p0 <= p24)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((p0 <= p24)))
lola: processed formula length: 19
lola: 38 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: 240955 markings, 752764 edges, 48191 markings/sec, 0 secs
lola: 497253 markings, 1609999 edges, 51260 markings/sec, 5 secs
lola: 771057 markings, 2557954 edges, 54761 markings/sec, 10 secs
lola: 1066562 markings, 3633507 edges, 59101 markings/sec, 15 secs
lola: 1336125 markings, 4594734 edges, 53913 markings/sec, 20 secs
lola: 1606465 markings, 5574727 edges, 54068 markings/sec, 25 secs
lola: 1883472 markings, 6598475 edges, 55401 markings/sec, 30 secs
lola: 2164448 markings, 7652885 edges, 56195 markings/sec, 35 secs
lola: 2404063 markings, 8527928 edges, 47923 markings/sec, 40 secs
lola: 2648643 markings, 9400932 edges, 48916 markings/sec, 45 secs
lola: 2954645 markings, 10595720 edges, 61200 markings/sec, 50 secs
lola: 3181265 markings, 11428004 edges, 45324 markings/sec, 55 secs
lola: 3443588 markings, 12399979 edges, 52465 markings/sec, 60 secs
lola: 3647834 markings, 13254528 edges, 40849 markings/sec, 65 secs
lola: 3846481 markings, 14134681 edges, 39729 markings/sec, 70 secs
lola: 4044287 markings, 15067440 edges, 39561 markings/sec, 75 secs
lola: 4246218 markings, 16047672 edges, 40386 markings/sec, 80 secs
lola: 4457762 markings, 17078487 edges, 42309 markings/sec, 85 secs
lola: 4668111 markings, 18183195 edges, 42070 markings/sec, 90 secs
lola: 4876786 markings, 19205953 edges, 41735 markings/sec, 95 secs
lola: 5087582 markings, 20231670 edges, 42159 markings/sec, 100 secs
lola: 5306980 markings, 21436116 edges, 43880 markings/sec, 105 secs
lola: 5508256 markings, 22342925 edges, 40255 markings/sec, 110 secs
lola: 5739178 markings, 23686581 edges, 46184 markings/sec, 115 secs
lola: 5946758 markings, 24644226 edges, 41516 markings/sec, 120 secs
lola: 6169835 markings, 25910056 edges, 44615 markings/sec, 125 secs
lola: 6375396 markings, 27003139 edges, 41112 markings/sec, 130 secs
lola: 6548865 markings, 27759226 edges, 34694 markings/sec, 135 secs
lola: 6799795 markings, 29301800 edges, 50186 markings/sec, 140 secs
lola: 6986815 markings, 30225402 edges, 37404 markings/sec, 145 secs
lola: 7163598 markings, 31022657 edges, 35357 markings/sec, 150 secs
lola: 7415508 markings, 32611497 edges, 50382 markings/sec, 155 secs
lola: 7606464 markings, 33590642 edges, 38191 markings/sec, 160 secs
lola: 7766287 markings, 34249946 edges, 31965 markings/sec, 165 secs
lola: 8006482 markings, 35753347 edges, 48039 markings/sec, 170 secs
lola: 8234181 markings, 37060753 edges, 45540 markings/sec, 175 secs
lola: 8404982 markings, 37831579 edges, 34160 markings/sec, 180 secs
lola: 8583645 markings, 38728023 edges, 35733 markings/sec, 185 secs
lola: 8830317 markings, 40295239 edges, 49334 markings/sec, 190 secs
lola: 9044581 markings, 41500041 edges, 42853 markings/sec, 195 secs
lola: 9213556 markings, 42256123 edges, 33795 markings/sec, 200 secs
lola: 9382293 markings, 43041450 edges, 33747 markings/sec, 205 secs
lola: 9623479 markings, 44591872 edges, 48237 markings/sec, 210 secs
lola: 9866700 markings, 46066520 edges, 48644 markings/sec, 215 secs
lola: 10032814 markings, 46880656 edges, 33223 markings/sec, 220 secs
lola: 10179374 markings, 47458672 edges, 29312 markings/sec, 225 secs
lola: 10390640 markings, 48691434 edges, 42253 markings/sec, 230 secs
lola: 10637024 markings, 50306537 edges, 49277 markings/sec, 235 secs
lola: 10866175 markings, 51626330 edges, 45830 markings/sec, 240 secs
lola: 11029004 markings, 52400493 edges, 32566 markings/sec, 245 secs
lola: 11165548 markings, 52926202 edges, 27309 markings/sec, 250 secs
lola: 11374903 markings, 54129832 edges, 41871 markings/sec, 255 secs
lola: 11616535 markings, 55677813 edges, 48326 markings/sec, 260 secs
lola: 11872768 markings, 57257443 edges, 51247 markings/sec, 265 secs
lola: 12032166 markings, 58058242 edges, 31880 markings/sec, 270 secs
lola: 12185677 markings, 58686252 edges, 30702 markings/sec, 275 secs
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: 12228309 markings, 58848689 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no no no yes no yes no
lola:
preliminary result: yes yes no no no yes no yes no
lola: memory consumption: 81472 KB
lola: time consumption: 1006 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="BridgeAndVehicles-PT-V20P10N50"
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 BridgeAndVehicles-PT-V20P10N50, 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 r182-oct2-158987913700321"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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