Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r178-tajo-158987883100913.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is ERK-PT-010000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987883100913
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 176K
-rw-r--r-- 1 mcc users 3.3K Mar 31 14:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 31 14:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 31 14:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 31 14:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 8 14:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7K Apr 8 14:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 31 14:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 31 14:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 31 14:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 31 14:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 31 14:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 31 14:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 6.7K 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 ERK-PT-010000-00
FORMULA_NAME ERK-PT-010000-01
FORMULA_NAME ERK-PT-010000-02
FORMULA_NAME ERK-PT-010000-03
FORMULA_NAME ERK-PT-010000-04
FORMULA_NAME ERK-PT-010000-05
FORMULA_NAME ERK-PT-010000-06
FORMULA_NAME ERK-PT-010000-07
FORMULA_NAME ERK-PT-010000-08
FORMULA_NAME ERK-PT-010000-09
FORMULA_NAME ERK-PT-010000-10
FORMULA_NAME ERK-PT-010000-11
FORMULA_NAME ERK-PT-010000-12
FORMULA_NAME ERK-PT-010000-13
FORMULA_NAME ERK-PT-010000-14
FORMULA_NAME ERK-PT-010000-15

=== Now, execution of the tool begins

BK_START 1591251078979

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 06:11:21] [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-04 06:11:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 06:11:22] [INFO ] Load time of PNML (sax parser for PT used): 21 ms
[2020-06-04 06:11:22] [INFO ] Transformed 11 places.
[2020-06-04 06:11:22] [INFO ] Transformed 11 transitions.
[2020-06-04 06:11:22] [INFO ] Parsed PT model containing 11 places and 11 transitions in 55 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100010 steps, including 0 resets, run finished after 43 ms. (steps per millisecond=2325 ) properties seen :[1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0]
// Phase 1: matrix 11 rows 11 cols
[2020-06-04 06:11:22] [INFO ] Computed 5 place invariants in 2 ms
[2020-06-04 06:11:22] [INFO ] [Real]Absence check using 5 positive place invariants in 15 ms returned sat
[2020-06-04 06:11:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:11:22] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2020-06-04 06:11:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 06:11:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 11 ms returned sat
[2020-06-04 06:11:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 06:11:22] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2020-06-04 06:11:22] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 13 ms.
[2020-06-04 06:11:22] [INFO ] Added : 1 causal constraints over 1 iterations in 21 ms. Result :sat
[2020-06-04 06:11:22] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned unsat
[2020-06-04 06:11:22] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned unsat
[2020-06-04 06:11:22] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned unsat
[2020-06-04 06:11:22] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2020-06-04 06:11:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:11:22] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2020-06-04 06:11:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 06:11:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 9 ms returned sat
[2020-06-04 06:11:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 06:11:22] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2020-06-04 06:11:22] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2020-06-04 06:11:22] [INFO ] Added : 6 causal constraints over 2 iterations in 10 ms. Result :sat
[2020-06-04 06:11:22] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned unsat
[2020-06-04 06:11:22] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2020-06-04 06:11:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:11:22] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2020-06-04 06:11:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 06:11:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2020-06-04 06:11:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 06:11:22] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2020-06-04 06:11:22] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 2 ms.
[2020-06-04 06:11:22] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
[2020-06-04 06:11:22] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2020-06-04 06:11:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:11:22] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2020-06-04 06:11:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 06:11:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2020-06-04 06:11:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 06:11:22] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2020-06-04 06:11:22] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2020-06-04 06:11:22] [INFO ] Added : 6 causal constraints over 2 iterations in 6 ms. Result :sat
[2020-06-04 06:11:22] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2020-06-04 06:11:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:11:22] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2020-06-04 06:11:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 06:11:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2020-06-04 06:11:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 06:11:22] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2020-06-04 06:11:22] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 0 ms.
[2020-06-04 06:11:22] [INFO ] Added : 4 causal constraints over 2 iterations in 4 ms. Result :sat
[2020-06-04 06:11:22] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2020-06-04 06:11:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:11:22] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2020-06-04 06:11:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 06:11:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2020-06-04 06:11:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 06:11:22] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2020-06-04 06:11:22] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2020-06-04 06:11:22] [INFO ] Added : 6 causal constraints over 2 iterations in 7 ms. Result :sat
[2020-06-04 06:11:22] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned unsat
[2020-06-04 06:11:22] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned unsat
[2020-06-04 06:11:22] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned unsat
[2020-06-04 06:11:22] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2020-06-04 06:11:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:11:22] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2020-06-04 06:11:22] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 5 ms.
[2020-06-04 06:11:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 06:11:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2020-06-04 06:11:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 06:11:22] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2020-06-04 06:11:22] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 2 ms.
[2020-06-04 06:11:22] [INFO ] Added : 6 causal constraints over 2 iterations in 8 ms. Result :sat
[2020-06-04 06:11:22] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2020-06-04 06:11:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:11:22] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2020-06-04 06:11:22] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 2 ms.
[2020-06-04 06:11:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 06:11:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2020-06-04 06:11:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 06:11:22] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2020-06-04 06:11:22] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2020-06-04 06:11:22] [INFO ] Added : 6 causal constraints over 2 iterations in 6 ms. Result :sat
[2020-06-04 06:11:22] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned unsat
[2020-06-04 06:11:22] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2020-06-04 06:11:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:11:22] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2020-06-04 06:11:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 06:11:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2020-06-04 06:11:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 06:11:22] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2020-06-04 06:11:22] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 0 ms.
[2020-06-04 06:11:22] [INFO ] Added : 6 causal constraints over 2 iterations in 4 ms. Result :sat
[2020-06-04 06:11:22] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2020-06-04 06:11:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:11:22] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2020-06-04 06:11:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 06:11:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2020-06-04 06:11:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 06:11:22] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2020-06-04 06:11:22] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2020-06-04 06:11:22] [INFO ] Added : 6 causal constraints over 2 iterations in 6 ms. Result :sat
[2020-06-04 06:11:22] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned unsat
Successfully simplified 9 atomic propositions for a total of 12 simplifications.
[2020-06-04 06:11:22] [INFO ] Initial state reduction rules for CTL removed 11 formulas.
[2020-06-04 06:11:22] [INFO ] Flatten gal took : 19 ms
FORMULA ERK-PT-010000-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-010000-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-010000-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-010000-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-010000-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-010000-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-010000-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-010000-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-010000-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-010000-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-010000-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 06:11:22] [INFO ] Flatten gal took : 2 ms
[2020-06-04 06:11:22] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2020-06-04 06:11:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ ERK-PT-010000 @ 3570 seconds

FORMULA ERK-PT-010000-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-010000-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-010000-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-010000-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-010000-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3363
rslt: Output for LTLCardinality @ ERK-PT-010000

{
"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": "Thu Jun 4 06:11:23 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 841
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((1 <= p0) U X (F ((p7 <= p1))))",
"processed_size": 32,
"rewrites": 11
},
"result":
{
"edges": 20015,
"markings": 20015,
"produced_by": "LTL model checker",
"value": false
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 840
},
"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 ((p10 <= p0)))",
"processed_size": 19,
"rewrites": 11
},
"result":
{
"edges": 20005,
"markings": 20005,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1121
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"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": "F (G (((p0 <= 1))))",
"processed_size": 19,
"rewrites": 11
},
"result":
{
"edges": 20009,
"markings": 20008,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1681
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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 ((3 <= p7))",
"processed_size": 13,
"rewrites": 11
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"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": true
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1681
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (G ((F (G ((p8 <= 2))) OR (G (F ((p10 + 1 <= p3))) OR (p3 <= p10)))))",
"processed_size": 71,
"rewrites": 11
},
"result":
{
"edges": 20062,
"markings": 20038,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 3363
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3363
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(3 <= p4)",
"processed_size": 9,
"rewrites": 11
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"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": "G ((3 <= p6))",
"processed_size": 13,
"rewrites": 11
},
"result":
{
"edges": 30002,
"markings": 30002,
"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": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((2 <= p4) AND (3 <= p6)) U (3 <= p4))",
"processed_size": 39,
"rewrites": 11
},
"result":
{
"edges": 30002,
"markings": 30002,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 4,
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(3 <= p4)",
"processed_size": 9,
"rewrites": 11
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"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": "(p2 <= 1)",
"processed_size": 9,
"rewrites": 13
},
"result":
{
"edges": 20007,
"markings": 20007,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"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": "G ((3 <= p6))",
"processed_size": 13,
"rewrites": 11
},
"result":
{
"edges": 30002,
"markings": 30002,
"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"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((2 <= p4) AND (3 <= p6)) U (3 <= p4))",
"processed_size": 39,
"rewrites": 11
},
"result":
{
"edges": 30002,
"markings": 30002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 4256,
"runtime": 207.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "((** U X(F(**))) AND F(G(*))) : X(F(**)) : (X(**) OR F(G(**))) : ((** U **) OR (G(**) OR (F(**) OR **))) : X(G((F(G(**)) OR (G(F(**)) OR **))))"
},
"net":
{
"arcs": 34,
"conflict_clusters": 7,
"places": 11,
"places_significant": 6,
"singleton_clusters": 0,
"transitions": 11
},
"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: 22/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 352
lola: finding significant places
lola: 11 places, 11 transitions, 6 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: (p9 <= p0)
lola: (((1 <= p0) U F (X ((p7 <= p1)))) AND NOT(G (F ((p3 <= p4))))) : F (X ((p10 <= p0))) : (X ((3 <= p7)) OR ((p0 <= 1) U X (F (G (((p0 <= 1))))))) : ((((((2 <= p4) AND (3 <= p6)) U (3 <= p4)) OR G ((3 <= p6))) OR F ((2 <= p2))) OR (3 <= p4)) : X (G (((F (G ((p8 <= 2))) OR G (F ((p10 + 1 <= p3)))) OR (p3 <= p10))))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p0) U X (F ((p7 <= p1)))) AND F (G ((p4 + 1 <= p3))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p4 + 1 <= p3)))
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 ((p4 + 1 <= p3)))
lola: processed formula length: 22
lola: 11 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: 5180813 markings, 9667139 edges, 1036163 markings/sec, 0 secs
lola: 8788060 markings, 16420917 edges, 721449 markings/sec, 5 secs
lola: 12572653 markings, 23510799 edges, 756919 markings/sec, 10 secs
lola: 16272447 markings, 30442195 edges, 739959 markings/sec, 15 secs
lola: 19812412 markings, 37073919 edges, 707993 markings/sec, 20 secs
lola: 23369849 markings, 43737504 edges, 711487 markings/sec, 25 secs
lola: 26913583 markings, 50375733 edges, 708747 markings/sec, 30 secs
lola: 30613848 markings, 57310261 edges, 740053 markings/sec, 35 secs
lola: 34388932 markings, 64378810 edges, 755017 markings/sec, 40 secs
lola: 37795579 markings, 70762387 edges, 681329 markings/sec, 45 secs
lola: 41390579 markings, 77499014 edges, 719000 markings/sec, 50 secs
lola: 45038023 markings, 84331805 edges, 729489 markings/sec, 55 secs
lola: 48944028 markings, 91657462 edges, 781201 markings/sec, 60 secs
lola: 52801660 markings, 98881763 edges, 771526 markings/sec, 65 secs
lola: 56695424 markings, 106173238 edges, 778753 markings/sec, 70 secs
lola: 60375667 markings, 113072723 edges, 736049 markings/sec, 75 secs
lola: 64340455 markings, 120504657 edges, 792958 markings/sec, 80 secs
lola: 68244412 markings, 127817255 edges, 780791 markings/sec, 85 secs
lola: 71861150 markings, 134593659 edges, 723348 markings/sec, 90 secs
lola: 75503516 markings, 141420586 edges, 728473 markings/sec, 95 secs
lola: 79260106 markings, 148461025 edges, 751318 markings/sec, 100 secs
lola: 83404509 markings, 156224335 edges, 828881 markings/sec, 105 secs
lola: 87392967 markings, 163699688 edges, 797692 markings/sec, 110 secs
lola: 91458494 markings, 171320368 edges, 813105 markings/sec, 115 secs
lola: 95503467 markings, 178898835 edges, 808995 markings/sec, 120 secs
lola: 99423450 markings, 186241725 edges, 783997 markings/sec, 125 secs
lola: 102780123 markings, 192536703 edges, 671335 markings/sec, 130 secs
lola: 104519655 markings, 195796830 edges, 347906 markings/sec, 135 secs
lola: 107300458 markings, 201008973 edges, 556161 markings/sec, 140 secs
lola: 109894939 markings, 205868442 edges, 518896 markings/sec, 145 secs
lola: 112687646 markings, 211102481 edges, 558541 markings/sec, 150 secs
lola: 114677916 markings, 214830810 edges, 398054 markings/sec, 155 secs
lola: 117600932 markings, 220313265 edges, 584603 markings/sec, 160 secs
lola: 119401374 markings, 223687574 edges, 360088 markings/sec, 165 secs
lola: 121831104 markings, 228242910 edges, 485946 markings/sec, 170 secs
lola: 124493440 markings, 233234739 edges, 532467 markings/sec, 175 secs
lola: 125591217 markings, 235295782 edges, 219555 markings/sec, 180 secs
lola: 127170587 markings, 238254142 edges, 315874 markings/sec, 185 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 841 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p0) U X (F ((p7 <= p1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((1 <= p0) U X (F ((p7 <= p1))))
lola: processed formula length: 32
lola: 11 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: 20015 markings, 20015 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 840 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p10 <= p0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p10 <= p0)))
lola: processed formula length: 19
lola: 11 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 20005 markings, 20005 edges
lola: ========================================
lola: subprocess 2 will run for 1121 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((3 <= p7)) OR F (G (((p0 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 1121 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p0 <= 1))))
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 (((p0 <= 1))))
lola: processed formula length: 19
lola: 11 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: 20008 markings, 20009 edges
lola: ========================================
lola: subprocess 3 will run for 1681 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((3 <= p7))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((3 <= p7))
lola: processed formula length: 13
lola: 11 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: 3 markings, 2 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 1681 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((F (G ((p8 <= 2))) OR (G (F ((p10 + 1 <= p3))) OR (p3 <= p10)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F (G ((p8 <= 2))) OR (G (F ((p10 + 1 <= p3))) OR (p3 <= p10)))))
lola: processed formula length: 71
lola: 11 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: add low 4
lola: add low 9
lola: add low 4
lola: add low 9
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: 20038 markings, 20062 edges
lola: ========================================
lola: subprocess 4 will run for 3363 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((2 <= p4) AND (3 <= p6)) U (3 <= p4)) OR (G ((3 <= p6)) OR (F ((2 <= p2)) OR (3 <= p4))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 3363 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= p4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p4)
lola: processed formula length: 9
lola: 11 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: subprocess 6 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((3 <= p6))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((3 <= p6))
lola: processed formula length: 13
lola: 11 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: 30002 markings, 30002 edges
lola: ========================================
lola: subprocess 7 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((2 <= p4) AND (3 <= p6)) U (3 <= p4))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((2 <= p4) AND (3 <= p6)) U (3 <= p4))
lola: processed formula length: 39
lola: 11 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: 30002 markings, 30002 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((((2 <= p4) AND (3 <= p6)) U (3 <= p4)) OR (G ((3 <= p6)) OR (F ((2 <= p2)) OR (3 <= p4))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (3 <= p4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p4)
lola: processed formula length: 9
lola: 11 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: F ((2 <= p2))
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: (p2 <= 1)
lola: processed formula length: 9
lola: 13 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: 20007 markings, 20007 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G ((3 <= p6))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((3 <= p6))
lola: processed formula length: 13
lola: 11 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: 30002 markings, 30002 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (((2 <= p4) AND (3 <= p6)) U (3 <= p4))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((2 <= p4) AND (3 <= p6)) U (3 <= p4))
lola: processed formula length: 39
lola: 11 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: 30002 markings, 30002 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no no
lola:
preliminary result: no no yes no no
lola: memory consumption: 4256 KB
lola: time consumption: 207 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="ERK-PT-010000"
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 ERK-PT-010000, 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 r178-tajo-158987883100913"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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