Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r132-tall-162075428500326.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-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 gold2020
Input is LamportFastMutEx-PT-3, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-162075428500326
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 820K
-rw-r--r-- 1 mcc users 44K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 247K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 40K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 205K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 7.4K Apr 26 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Apr 26 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 26 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 29K Apr 26 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.2K Mar 27 06:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 27 06:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Mar 25 07:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 32K Mar 25 07:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.0K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 77K May 5 16:51 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 LamportFastMutEx-PT-3-00
FORMULA_NAME LamportFastMutEx-PT-3-01
FORMULA_NAME LamportFastMutEx-PT-3-02
FORMULA_NAME LamportFastMutEx-PT-3-03
FORMULA_NAME LamportFastMutEx-PT-3-04
FORMULA_NAME LamportFastMutEx-PT-3-05
FORMULA_NAME LamportFastMutEx-PT-3-06
FORMULA_NAME LamportFastMutEx-PT-3-07
FORMULA_NAME LamportFastMutEx-PT-3-08
FORMULA_NAME LamportFastMutEx-PT-3-09
FORMULA_NAME LamportFastMutEx-PT-3-10
FORMULA_NAME LamportFastMutEx-PT-3-11
FORMULA_NAME LamportFastMutEx-PT-3-12
FORMULA_NAME LamportFastMutEx-PT-3-13
FORMULA_NAME LamportFastMutEx-PT-3-14
FORMULA_NAME LamportFastMutEx-PT-3-15

=== Now, execution of the tool begins

BK_START 1620931666026

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 18:47:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-13 18:47:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 18:47:48] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2021-05-13 18:47:48] [INFO ] Transformed 100 places.
[2021-05-13 18:47:48] [INFO ] Transformed 156 transitions.
[2021-05-13 18:47:48] [INFO ] Found NUPN structural information;
[2021-05-13 18:47:48] [INFO ] Completing missing partition info from NUPN : creating a component with [P_start_1_0, P_start_1_1, P_start_1_2, P_start_1_3, P_b_0_false, P_b_0_true, P_b_1_false, P_b_1_true, P_b_2_false, P_b_2_true, P_b_3_false, P_b_3_true, P_setx_3_0, P_setx_3_1, P_setx_3_2, P_setx_3_3, P_setbi_5_0, P_setbi_5_1, P_setbi_5_2, P_setbi_5_3, P_ify0_4_0, P_ify0_4_1, P_ify0_4_2, P_ify0_4_3, P_sety_9_0, P_sety_9_1, P_sety_9_2, P_sety_9_3, P_ifxi_10_0, P_ifxi_10_1, P_ifxi_10_2, P_ifxi_10_3, P_setbi_11_0, P_setbi_11_1, P_setbi_11_2, P_setbi_11_3, P_fordo_12_0, P_fordo_12_1, P_fordo_12_2, P_fordo_12_3, P_wait_0_0, P_wait_0_1, P_wait_0_2, P_wait_0_3, P_wait_1_0, P_wait_1_1, P_wait_1_2, P_wait_1_3, P_wait_2_0, P_wait_2_1, P_wait_2_2, P_wait_2_3, P_wait_3_0, P_wait_3_1, P_wait_3_2, P_wait_3_3, P_await_13_0, P_await_13_1, P_await_13_2, P_await_13_3, P_done_0_0, P_done_0_1, P_done_0_2, P_done_0_3, P_done_1_0, P_done_1_1, P_done_1_2, P_done_1_3, P_done_2_0, P_done_2_1, P_done_2_2, P_done_2_3, P_done_3_0, P_done_3_1, P_done_3_2, P_done_3_3, P_ifyi_15_0, P_ifyi_15_1, P_ifyi_15_2, P_ifyi_15_3, P_awaity_0, P_awaity_1, P_awaity_2, P_awaity_3, P_CS_21_0, P_CS_21_1, P_CS_21_2, P_CS_21_3, P_setbi_24_0, P_setbi_24_1, P_setbi_24_2, P_setbi_24_3]
[2021-05-13 18:47:48] [INFO ] Parsed PT model containing 100 places and 156 transitions in 127 ms.
Deduced a syphon composed of 29 places in 2 ms
Reduce places removed 29 places and 42 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 37 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 329 ms. (steps per millisecond=303 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1]
[2021-05-13 18:47:48] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
// Phase 1: matrix 96 rows 71 cols
[2021-05-13 18:47:48] [INFO ] Computed 17 place invariants in 5 ms
[2021-05-13 18:47:48] [INFO ] [Real]Absence check using 17 positive place invariants in 15 ms returned sat
[2021-05-13 18:47:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:47:48] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2021-05-13 18:47:48] [INFO ] State equation strengthened by 33 read => feed constraints.
[2021-05-13 18:47:48] [INFO ] [Real]Added 33 Read/Feed constraints in 6 ms returned sat
[2021-05-13 18:47:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:47:48] [INFO ] [Nat]Absence check using 17 positive place invariants in 25 ms returned sat
[2021-05-13 18:47:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:47:48] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2021-05-13 18:47:48] [INFO ] [Nat]Added 33 Read/Feed constraints in 34 ms returned sat
[2021-05-13 18:47:49] [INFO ] Deduced a trap composed of 8 places in 68 ms
[2021-05-13 18:47:49] [INFO ] Deduced a trap composed of 16 places in 48 ms
[2021-05-13 18:47:49] [INFO ] Deduced a trap composed of 12 places in 48 ms
[2021-05-13 18:47:49] [INFO ] Deduced a trap composed of 9 places in 55 ms
[2021-05-13 18:47:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 252 ms
[2021-05-13 18:47:49] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2021-05-13 18:47:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:47:49] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2021-05-13 18:47:49] [INFO ] [Real]Added 33 Read/Feed constraints in 7 ms returned sat
[2021-05-13 18:47:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:47:49] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2021-05-13 18:47:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:47:49] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2021-05-13 18:47:49] [INFO ] [Nat]Added 33 Read/Feed constraints in 21 ms returned sat
[2021-05-13 18:47:49] [INFO ] Deduced a trap composed of 18 places in 26 ms
[2021-05-13 18:47:49] [INFO ] Deduced a trap composed of 9 places in 62 ms
[2021-05-13 18:47:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 96 ms
[2021-05-13 18:47:49] [INFO ] [Real]Absence check using 17 positive place invariants in 8 ms returned sat
[2021-05-13 18:47:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:47:49] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2021-05-13 18:47:49] [INFO ] [Real]Added 33 Read/Feed constraints in 3 ms returned sat
[2021-05-13 18:47:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:47:49] [INFO ] [Nat]Absence check using 17 positive place invariants in 29 ms returned sat
[2021-05-13 18:47:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:47:49] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2021-05-13 18:47:49] [INFO ] [Nat]Added 33 Read/Feed constraints in 4 ms returned sat
[2021-05-13 18:47:49] [INFO ] Deduced a trap composed of 9 places in 21 ms
[2021-05-13 18:47:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2021-05-13 18:47:49] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2021-05-13 18:47:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:47:49] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2021-05-13 18:47:49] [INFO ] [Real]Added 33 Read/Feed constraints in 3 ms returned sat
[2021-05-13 18:47:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:47:49] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2021-05-13 18:47:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:47:49] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2021-05-13 18:47:49] [INFO ] [Nat]Added 33 Read/Feed constraints in 3 ms returned sat
[2021-05-13 18:47:49] [INFO ] Deduced a trap composed of 5 places in 18 ms
[2021-05-13 18:47:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2021-05-13 18:47:49] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2021-05-13 18:47:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:47:49] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2021-05-13 18:47:49] [INFO ] [Real]Added 33 Read/Feed constraints in 3 ms returned sat
[2021-05-13 18:47:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:47:49] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2021-05-13 18:47:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:47:49] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2021-05-13 18:47:49] [INFO ] [Nat]Added 33 Read/Feed constraints in 5 ms returned sat
[2021-05-13 18:47:49] [INFO ] Deduced a trap composed of 5 places in 42 ms
[2021-05-13 18:47:49] [INFO ] Deduced a trap composed of 5 places in 24 ms
[2021-05-13 18:47:49] [INFO ] Deduced a trap composed of 5 places in 25 ms
[2021-05-13 18:47:50] [INFO ] Deduced a trap composed of 6 places in 27 ms
[2021-05-13 18:47:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 142 ms
[2021-05-13 18:47:50] [INFO ] Computed and/alt/rep : 111/423/93 causal constraints in 7 ms.
[2021-05-13 18:47:50] [INFO ] Added : 15 causal constraints over 3 iterations in 43 ms. Result :unsat
[2021-05-13 18:47:50] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2021-05-13 18:47:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:47:50] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2021-05-13 18:47:50] [INFO ] [Real]Added 33 Read/Feed constraints in 3 ms returned sat
[2021-05-13 18:47:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:47:50] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2021-05-13 18:47:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:47:50] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2021-05-13 18:47:50] [INFO ] [Nat]Added 33 Read/Feed constraints in 8 ms returned sat
[2021-05-13 18:47:50] [INFO ] Deduced a trap composed of 5 places in 18 ms
[2021-05-13 18:47:50] [INFO ] Deduced a trap composed of 5 places in 20 ms
[2021-05-13 18:47:50] [INFO ] Deduced a trap composed of 8 places in 11 ms
[2021-05-13 18:47:50] [INFO ] Deduced a trap composed of 5 places in 24 ms
[2021-05-13 18:47:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 87 ms
[2021-05-13 18:47:50] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2021-05-13 18:47:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:47:50] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2021-05-13 18:47:50] [INFO ] [Real]Added 33 Read/Feed constraints in 3 ms returned sat
[2021-05-13 18:47:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:47:50] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2021-05-13 18:47:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:47:50] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2021-05-13 18:47:50] [INFO ] [Nat]Added 33 Read/Feed constraints in 3 ms returned sat
[2021-05-13 18:47:50] [INFO ] Deduced a trap composed of 23 places in 25 ms
[2021-05-13 18:47:50] [INFO ] Deduced a trap composed of 25 places in 22 ms
[2021-05-13 18:47:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 60 ms
[2021-05-13 18:47:50] [INFO ] Computed and/alt/rep : 111/423/93 causal constraints in 7 ms.
[2021-05-13 18:47:50] [INFO ] Added : 82 causal constraints over 17 iterations in 128 ms. Result :sat
[2021-05-13 18:47:50] [INFO ] Deduced a trap composed of 9 places in 22 ms
[2021-05-13 18:47:50] [INFO ] Deduced a trap composed of 12 places in 26 ms
[2021-05-13 18:47:50] [INFO ] Deduced a trap composed of 20 places in 19 ms
[2021-05-13 18:47:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 92 ms
Successfully simplified 6 atomic propositions for a total of 10 simplifications.
[2021-05-13 18:47:50] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2021-05-13 18:47:50] [INFO ] Flatten gal took : 89 ms
FORMULA LamportFastMutEx-PT-3-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-3-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-3-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-3-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-3-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-3-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-3-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 18:47:50] [INFO ] Applying decomposition
[2021-05-13 18:47:50] [INFO ] Flatten gal took : 12 ms
[2021-05-13 18:47:51] [INFO ] Decomposing Gal with order
[2021-05-13 18:47:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 18:47:51] [INFO ] Removed a total of 100 redundant transitions.
[2021-05-13 18:47:51] [INFO ] Flatten gal took : 65 ms
[2021-05-13 18:47:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 3 ms.
[2021-05-13 18:47:51] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 5 ms.
[2021-05-13 18:47:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ LamportFastMutEx-PT-3 @ 3570 seconds

FORMULA LamportFastMutEx-PT-3-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-PT-3-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-PT-3-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-PT-3-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-PT-3-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-PT-3-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-PT-3-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-PT-3-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-PT-3-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for LTLFireability @ LamportFastMutEx-PT-3

{
"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=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu May 13 18:47:52 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 16,
"adisj": 5,
"aneg": 0,
"comp": 36,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 36,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "(((((1 <= p4) AND (1 <= p19)) OR ((1 <= p6) AND (1 <= p17)) OR ((1 <= p6) AND (1 <= p18)) OR ((1 <= p4) AND (1 <= p17)) OR ((1 <= p6) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p18)) OR ((1 <= p5) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p18)) OR ((1 <= p3) AND (1 <= p19)) OR ((1 <= p5) AND (1 <= p18)) OR ((1 <= p5) AND (1 <= p19))) AND ((p7 <= 0) OR (p24 <= 0)) AND ((p7 <= 0) OR (p25 <= 0)) AND ((p7 <= 0) OR (p23 <= 0))) U X ((((1 <= p7) AND (1 <= p24)) OR ((1 <= p7) AND (1 <= p25)) OR ((1 <= p7) AND (1 <= p23)))))",
"processed_size": 563,
"rewrites": 122
},
"result":
{
"edges": 9,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 2,
"X": 1,
"aconj": 18,
"adisj": 6,
"aneg": 1,
"comp": 36,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 36,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "F (G ((F ((((1 <= p7) AND (1 <= p24)) OR ((1 <= p7) AND (1 <= p25)) OR ((1 <= p7) AND (1 <= p23)))) AND ((X ((((p7 <= 0) OR (p64 <= 0)) AND ((p7 <= 0) OR (p63 <= 0)) AND ((p7 <= 0) OR (p62 <= 0)))) AND (((1 <= p7) AND (1 <= p24)) OR ((1 <= p7) AND (1 <= p25)) OR ((1 <= p7) AND (1 <= p23)))) OR ((((1 <= p7) AND (1 <= p24)) OR ((1 <= p7) AND (1 <= p25)) OR ((1 <= p7) AND (1 <= p23))) U ((((1 <= p7) AND (1 <= p64)) OR ((1 <= p7) AND (1 <= p63)) OR ((1 <= p7) AND (1 <= p62))) U (((1 <= p7) AND (1 <= p24)) OR ((1 <= p7) AND (1 <= p25)) OR ((1 <= p7) AND (1 <= p23)))))))))",
"processed_size": 586,
"rewrites": 122
},
"result":
{
"edges": 15,
"markings": 14,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 12
},
"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": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 3,
"aconj": 15,
"adisj": 3,
"aneg": 0,
"comp": 24,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 24,
"taut": 0,
"tconj": 1,
"tdisj": 7,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "X ((X (G ((((1 <= p35)) OR ((1 <= p37)) OR ((1 <= p36))))) OR ((((1 <= p35)) OR ((1 <= p37)) OR ((1 <= p36))) AND (X (F ((((1 <= p7) AND (1 <= p64)) OR ((1 <= p7) AND (1 <= p63)) OR ((1 <= p7) AND (1 <= p62))))) OR (((1 <= p8) AND (1 <= p24)) OR (((1 <= p9) AND (1 <= p23)) OR (((1 <= p10) AND (1 <= p23)) OR (((1 <= p10) AND (1 <= p24)) OR (((1 <= p9) AND (1 <= p25)) OR ((1 <= p8) AND (1 <= p25)))))))))))",
"processed_size": 413,
"rewrites": 122
},
"result":
{
"edges": 10,
"markings": 10,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 594
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 12,
"adisj": 0,
"aneg": 0,
"comp": 24,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 24,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "(((1 <= p4) AND (1 <= p31)) OR ((1 <= p5) AND (1 <= p29)) OR ((1 <= p6) AND (1 <= p29)) OR ((1 <= p6) AND (1 <= p30)) OR ((1 <= p4) AND (1 <= p30)) OR ((1 <= p5) AND (1 <= p31)) OR ((1 <= p8) AND (1 <= p24)) OR ((1 <= p9) AND (1 <= p23)) OR ((1 <= p10) AND (1 <= p23)) OR ((1 <= p10) AND (1 <= p24)) OR ((1 <= p9) AND (1 <= p25)) OR ((1 <= p8) AND (1 <= p25)))",
"processed_size": 360,
"rewrites": 143
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 27,
"adisj": 3,
"aneg": 1,
"comp": 54,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 54,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "X ((G ((G ((((1 <= p4) AND (1 <= p31)) OR ((1 <= p5) AND (1 <= p29)) OR ((1 <= p6) AND (1 <= p29)) OR ((1 <= p3) AND (1 <= p30)) OR ((1 <= p6) AND (1 <= p30)) OR ((1 <= p3) AND (1 <= p31)) OR ((1 <= p3) AND (1 <= p29)) OR ((1 <= p4) AND (1 <= p30)) OR ((1 <= p5) AND (1 <= p31)))) AND (((1 <= p4) AND (1 <= p31)) OR ((1 <= p5) AND (1 <= p29)) OR ((1 <= p6) AND (1 <= p29)) OR ((1 <= p3) AND (1 <= p30)) OR ((1 <= p6) AND (1 <= p30)) OR ((1 <= p3) AND (1 <= p31)) OR ((1 <= p3) AND (1 <= p29)) OR ((1 <= p4) AND (1 <= p30)) OR ((1 <= p5) AND (1 <= p31))))) OR F ((((p8 <= 0) OR (p23 <= 0)) AND ((p8 <= 0) OR (p24 <= 0)) AND ((p9 <= 0) OR (p23 <= 0)) AND ((p10 <= 0) OR (p23 <= 0)) AND ((p10 <= 0) OR (p24 <= 0)) AND ((p9 <= 0) OR (p24 <= 0)) AND ((p10 <= 0) OR (p25 <= 0)) AND ((p9 <= 0) OR (p25 <= 0)) AND ((p8 <= 0) OR (p25 <= 0))))))",
"processed_size": 860,
"rewrites": 122
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 4,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 2,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "F ((X (G ((G (((1 <= p13) AND (1 <= p39) AND (1 <= p47))) OR (((p4 <= 0)) OR ((p30 <= 0)))))) AND (X (G (((1 <= p4) AND (1 <= p29)))) OR G (((1 <= p4) AND (1 <= p30))))))",
"processed_size": 170,
"rewrites": 122
},
"result":
{
"edges": 36504,
"markings": 5289,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 35
},
"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": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 0,
"aneg": 4,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G ((((((p6 <= 0) OR (p31 <= 0)) R ((p9 <= 0) OR (p65 <= 0))) AND G (((p35 <= 0)))) OR X (((p6 <= 0) OR (p31 <= 0)))))",
"processed_size": 120,
"rewrites": 122
},
"result":
{
"edges": 746,
"markings": 420,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((p7 <= 0) OR (p62 <= 0))",
"processed_size": 26,
"rewrites": 124
},
"result":
{
"edges": 10,
"markings": 10,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 28
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (((p7 <= 0) OR (p61 <= 0)))",
"processed_size": 30,
"rewrites": 122
},
"result":
{
"edges": 2501,
"markings": 1296,
"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": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 10,
"adisj": 4,
"aneg": 0,
"comp": 24,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 24,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "G (F ((G ((((1 <= p10) AND (1 <= p60)) OR ((1 <= p10) AND (1 <= p59)) OR ((1 <= p9) AND (1 <= p61)) OR ((1 <= p8) AND (1 <= p61)) OR ((1 <= p7) AND (1 <= p61)) OR ((1 <= p7) AND (1 <= p60)) OR ((1 <= p7) AND (1 <= p59)) OR ((1 <= p8) AND (1 <= p60)) OR ((1 <= p9) AND (1 <= p59)))) AND F ((((p9 <= 0) OR (p60 <= 0)) AND ((p10 <= 0) OR (p61 <= 0)) AND ((p8 <= 0) OR (p59 <= 0)))))))",
"processed_size": 392,
"rewrites": 122
},
"result":
{
"edges": 10,
"markings": 10,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 90148,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(** U X(**)) : G(F((G(**) AND F(**)))) : F(G((F(**) AND ((X(*) AND **) OR (** U (** U **)))))) : X((X(G(**)) OR (** AND (X(F(**)) OR (** OR (** OR (** OR (** OR (** OR **))))))))) : (X((G((G(**) AND **)) OR F(*))) OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR **)))))))))))) : F((X(G((G(**) OR (** OR **)))) AND (X(G(**)) OR G(**)))) : G((((* R *) AND G(*)) OR X(*))) : G(*) : F(**)"
},
"net":
{
"arcs": 480,
"conflict_clusters": 6,
"places": 71,
"places_significant": 54,
"singleton_clusters": 0,
"transitions": 114
},
"result":
{
"preliminary_value": "no no no no yes no no no no ",
"value": "no no no no yes no no 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: 185/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 71
lola: finding significant places
lola: 71 places, 114 transitions, 54 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 LTLFireability.xml
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p59 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p59 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p59 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p59 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p64 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p64 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p64 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p65 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: (((((1 <= p4) AND (1 <= p19)) OR ((1 <= p6) AND (1 <= p17)) OR ((1 <= p6) AND (1 <= p18)) OR ((1 <= p4) AND (1 <= p17)) OR ((1 <= p6) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p18)) OR ((1 <= p5) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p18)) OR ((1 <= p3) AND (1 <= p19)) OR ((1 <= p5) AND (1 <= p18)) OR ((1 <= p5) AND (1 <= p19))) AND ((p7 <= 0) OR (p24 <= 0)) AND ((p7 <= 0) OR (p25 <= 0)) AND ((p7 <= 0) OR (p23 <= 0))) U X ((((1 <= p7) AND (1 <= p24)) OR ((1 <= p7) AND (1 <= p25)) OR ((1 <= p7) AND (1 <= p23))))) : NOT(F (G (X (F (NOT(F ((G ((((1 <= p10) AND (1 <= p60)) OR ((1 <= p10) AND (1 <= p59)) OR ((1 <= p9) AND (1 <= p61)) OR ((1 <= p8) AND (1 <= p61)) OR ((1 <= p7) AND (1 <= p61)) OR ((1 <= p7) AND (1 <= p60)) OR ((1 <= p7) AND (1 <= p59)) OR ((1 <= p8) AND (1 <= p60)) OR ((1 <= p9) AND (1 <= p59)))) AND F ((((p9 <= 0) OR (p60 <= 0)) AND ((p10 <= 0) OR (p61 <= 0)) AND ((p8 <= 0) OR (p59 <= 0)))))))))))) : F (G (((NOT(X ((((1 <= p7) AND (1 <= p64)) OR ((1 <= p7) AND (1 <= p63)) OR ((1 <= p7) AND (1 <= p62))))) AND (((1 <= p7) AND (1 <= p24)) OR ((1 <= p7) AND (1 <= p25)) OR ((1 <= p7) AND (1 <= p23)))) U ((((1 <= p7) AND (1 <= p24)) OR ((1 <= p7) AND (1 <= p25)) OR ((1 <= p7) AND (1 <= p23))) U ((((1 <= p7) AND (1 <= p64)) OR ((1 <= p7) AND (1 <= p63)) OR ((1 <= p7) AND (1 <= p62))) U (((1 <= p7) AND (1 <= p24)) OR ((1 <= p7) AND (1 <= p25)) OR ((1 <= p7) AND (1 <= p23)))))))) : X ((G (X ((((1 <= p35)) OR ((1 <= p37)) OR ((1 <= p36))))) OR ((((1 <= p35)) OR ((1 <= p37)) OR ((1 <= p36))) AND ((((((X (F ((((1 <= p7) AND (1 <= p64)) OR ((1 <= p7) AND (1 <= p63)) OR ((1 <= p7) AND (1 <= p62))))) OR ((1 <= p8) AND (1 <= p24))) OR ((1 <= p9) AND (1 <= p23))) OR ((1 <= p10) AND (1 <= p23))) OR ((1 <= p10) AND (1 <= p24))) OR ((1 <= p9) AND (1 <= p25))) OR ((1 <= p8) AND (1 <= p25)))))) : (((((((((((((X (G ((G ((((1 <= p4) AND (1 <= p31)) OR ((1 <= p5) AND (1 <= p29)) OR ((1 <= p6) AND (1 <= p29)) OR ((1 <= p3) AND (1 <= p30)) OR ((1 <= p6) AND (1 <= p30)) OR ((1 <= p3) AND (1 <= p31)) OR ((1 <= p3) AND (1 <= p29)) OR ((1 <= p4) AND (1 <= p30)) OR ((1 <= p5) AND (1 <= p31)))) AND (((1 <= p4) AND (1 <= p31)) OR ((1 <= p5) AND (1 <= p29)) OR ((1 <= p6) AND (1 <= p29)) OR ((1 <= p3) AND (1 <= p30)) OR ((1 <= p6) AND (1 <= p30)) OR ((1 <= p3) AND (1 <= p31)) OR ((1 <= p3) AND (1 <= p29)) OR ((1 <= p4) AND (1 <= p30)) OR ((1 <= p5) AND (1 <= p31)))))) OR X (NOT(G ((((1 <= p8) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p24)) OR ((1 <= p9) AND (1 <= p23)) OR ((1 <= p10) AND (1 <= p23)) OR ((1 <= p10) AND (1 <= p24)) OR ((1 <= p9) AND (1 <= p24)) OR ((1 <= p10) AND (1 <= p25)) OR ((1 <= p9) AND (1 <= p25)) OR ((1 <= p8) AND (1 <= p25))))))) OR ((1 <= p4) AND (1 <= p31))) OR ((1 <= p5) AND (1 <= p29))) OR ((1 <= p6) AND (1 <= p29))) OR ((1 <= p6) AND (1 <= p30))) OR ((1 <= p4) AND (1 <= p30))) OR ((1 <= p5) AND (1 <= p31))) OR ((1 <= p8) AND (1 <= p24))) OR ((1 <= p9) AND (1 <= p23))) OR ((1 <= p10) AND (1 <= p23))) OR ((1 <= p10) AND (1 <= p24))) OR ((1 <= p9) AND (1 <= p25))) OR ((1 <= p8) AND (1 <= p25))) : F ((X (G (((G (((1 <= p13) AND (1 <= p39) AND (1 <= p47))) OR ((p4 <= 0))) OR ((p30 <= 0))))) AND (X (G (((1 <= p4) AND (1 <= p29)))) OR G (((1 <= p4) AND (1 <= p30)))))) : G (NOT(F ((((((1 <= p6) AND (1 <= p31)) U ((1 <= p9) AND (1 <= p65))) OR F (((1 <= p35)))) AND X (((1 <= p6) AND (1 <= p31))))))) : NOT(F (((1 <= p7) AND (1 <= p61)))) : F (F (((1 <= p7) AND (1 <= p62))))
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((((1 <= p4) AND (1 <= p19)) OR ((1 <= p6) AND (1 <= p17)) OR ((1 <= p6) AND (1 <= p18)) OR ((1 <= p4) AND (1 <= p17)) OR ((1 <= p6) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p18)) OR ((1 <= p5) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p18)) OR ((1 <= p3) AND (1 <= p19)) OR ((1 <= p5) AND (1 <= p18)) OR ((1 <= p5) AND (1 <= p19))) AND ((p7 <= 0) OR (p24 <= 0... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((((1 <= p4) AND (1 <= p19)) OR ((1 <= p6) AND (1 <= p17)) OR ((1 <= p6) AND (1 <= p18)) OR ((1 <= p4) AND (1 <= p17)) OR ((1 <= p6) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p18)) OR ((1 <= p5) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p18)) OR ((1 <= p3) AND (1 <= p19)) OR ((1 <= p5) AND (1 <= p18)) OR ((1 <= p5) AND (1 <= p19))) AND ((p7 <= 0) OR (p24 <= 0... (shortened)
lola: processed formula length: 563
lola: 122 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 9 markings, 9 edges
lola: ========================================
lola: subprocess 1 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((((1 <= p7) AND (1 <= p24)) OR ((1 <= p7) AND (1 <= p25)) OR ((1 <= p7) AND (1 <= p23)))) AND ((X ((((p7 <= 0) OR (p64 <= 0)) AND ((p7 <= 0) OR (p63 <= 0)) AND ((p7 <= 0) OR (p62 <= 0)))) AND (((1 <= p7) AND (1 <= p24)) OR ((1 <= p7) AND (1 <= p25)) OR ((1 <= p7) AND (1 <= p23)))) OR ((((1 <= p7) AND (1 <= p24)) OR ((1 <= p7) AND (1 <= p25)) OR ((1 <= p7) AND (1 <= p23))) U ((((... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((((1 <= p7) AND (1 <= p24)) OR ((1 <= p7) AND (1 <= p25)) OR ((1 <= p7) AND (1 <= p23)))) AND ((X ((((p7 <= 0) OR (p64 <= 0)) AND ((p7 <= 0) OR (p63 <= 0)) AND ((p7 <= 0) OR (p62 <= 0)))) AND (((1 <= p7) AND (1 <= p24)) OR ((1 <= p7) AND (1 <= p25)) OR ((1 <= p7) AND (1 <= p23)))) OR ((((1 <= p7) AND (1 <= p24)) OR ((1 <= p7) AND (1 <= p25)) OR ((1 <= p7) AND (1 <= p23))) U ((((... (shortened)
lola: processed formula length: 586
lola: 122 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 12 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: 14 markings, 15 edges
lola: ========================================
lola: subprocess 2 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (G ((((1 <= p35)) OR ((1 <= p37)) OR ((1 <= p36))))) OR ((((1 <= p35)) OR ((1 <= p37)) OR ((1 <= p36))) AND (X (F ((((1 <= p7) AND (1 <= p64)) OR ((1 <= p7) AND (1 <= p63)) OR ((1 <= p7) AND (1 <= p62))))) OR (((1 <= p8) AND (1 <= p24)) OR (((1 <= p9) AND (1 <= p23)) OR (((1 <= p10) AND (1 <= p23)) OR (((1 <= p10) AND (1 <= p24)) OR (((1 <= p9) AND (1 <= p25)) OR ((1 <= p8) AND (1 <= p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (G ((((1 <= p35)) OR ((1 <= p37)) OR ((1 <= p36))))) OR ((((1 <= p35)) OR ((1 <= p37)) OR ((1 <= p36))) AND (X (F ((((1 <= p7) AND (1 <= p64)) OR ((1 <= p7) AND (1 <= p63)) OR ((1 <= p7) AND (1 <= p62))))) OR (((1 <= p8) AND (1 <= p24)) OR (((1 <= p9) AND (1 <= p23)) OR (((1 <= p10) AND (1 <= p23)) OR (((1 <= p10) AND (1 <= p24)) OR (((1 <= p9) AND (1 <= p25)) OR ((1 <= p8) AND (1 <= p... (shortened)
lola: processed formula length: 413
lola: 122 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 10 markings, 10 edges
lola: ========================================
lola: subprocess 3 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((G ((G ((((1 <= p4) AND (1 <= p31)) OR ((1 <= p5) AND (1 <= p29)) OR ((1 <= p6) AND (1 <= p29)) OR ((1 <= p3) AND (1 <= p30)) OR ((1 <= p6) AND (1 <= p30)) OR ((1 <= p3) AND (1 <= p31)) OR ((1 <= p3) AND (1 <= p29)) OR ((1 <= p4) AND (1 <= p30)) OR ((1 <= p5) AND (1 <= p31)))) AND (((1 <= p4) AND (1 <= p31)) OR ((1 <= p5) AND (1 <= p29)) OR ((1 <= p6) AND (1 <= p29)) OR ((1 <= p3) A... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p4) AND (1 <= p31)) OR (((1 <= p5) AND (1 <= p29)) OR (((1 <= p6) AND (1 <= p29)) OR (((1 <= p6) AND (1 <= p30)) OR (((1 <= p4) AND (1 <= p30)) OR (((1 <= p5) AND (1 <= p31)) OR (((1 <= p8) AND (1 <= p24)) OR (((1 <= p9) AND (1 <= p23)) OR (((1 <= p10) AND (1 <= p23)) OR (((1 <= p10) AND (1 <= p24)) OR (((1 <= p9) AND (1 <= p25)) OR ((1 <= p8) AND (1 <= p25)))))))))))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: processed formula: (((1 <= p4) AND (1 <= p31)) OR ((1 <= p5) AND (1 <= p29)) OR ((1 <= p6) AND (1 <= p29)) OR ((1 <= p6) AND (1 <= p30)) OR ((1 <= p4) AND (1 <= p30)) OR ((1 <= p5) AND (1 <= p31)) OR ((1 <= p8) AND (1 <= p24)) OR ((1 <= p9) AND (1 <= p23)) OR ((1 <= p10) AND (1 <= p23)) OR ((1 <= p10) AND (1 <= p24)) OR ((1 <= p9) AND (1 <= p25)) OR ((1 <= p8) AND (1 <= p25)))
lola: processed formula length: 360
lola: 143 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 24 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((G ((((1 <= p4) AND (1 <= p31)) OR ((1 <= p5) AND (1 <= p29)) OR ((1 <= p6) AND (1 <= p29)) OR ((1 <= p3) AND (1 <= p30)) OR ((1 <= p6) AND (1 <= p30)) OR ((1 <= p3) AND (1 <= p31)) OR ((1 <= p3) AND (1 <= p29)) OR ((1 <= p4) AND (1 <= p30)) OR ((1 <= p5) AND (1 <= p31)))) AND (((1 <= p4) AND (1 <= p31)) OR ((1 <= p5) AND (1 <= p29)) OR ((1 <= p6) AND (1 <= p29)) OR ((1 <= p3) AN... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((G ((((1 <= p4) AND (1 <= p31)) OR ((1 <= p5) AND (1 <= p29)) OR ((1 <= p6) AND (1 <= p29)) OR ((1 <= p3) AND (1 <= p30)) OR ((1 <= p6) AND (1 <= p30)) OR ((1 <= p3) AND (1 <= p31)) OR ((1 <= p3) AND (1 <= p29)) OR ((1 <= p4) AND (1 <= p30)) OR ((1 <= p5) AND (1 <= p31)))) AND (((1 <= p4) AND (1 <= p31)) OR ((1 <= p5) AND (1 <= p29)) OR ((1 <= p6) AND (1 <= p29)) OR ((1 <= p3) AN... (shortened)
lola: processed formula length: 860
lola: 122 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: 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 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (G ((G (((1 <= p13) AND (1 <= p39) AND (1 <= p47))) OR (((p4 <= 0)) OR ((p30 <= 0)))))) AND (X (G (((1 <= p4) AND (1 <= p29)))) OR G (((1 <= p4) AND (1 <= p30))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (G ((G (((1 <= p13) AND (1 <= p39) AND (1 <= p47))) OR (((p4 <= 0)) OR ((p30 <= 0)))))) AND (X (G (((1 <= p4) AND (1 <= p29)))) OR G (((1 <= p4) AND (1 <= p30))))))
lola: processed formula length: 170
lola: 122 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 35 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 79
lola: add low 91
lola: add low 102
lola: add low 110
lola: add low 35
lola: add low 33
lola: add low 4
lola: add low 15
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: 5289 markings, 36504 edges
lola: ========================================
lola: subprocess 5 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((((p6 <= 0) OR (p31 <= 0)) R ((p9 <= 0) OR (p65 <= 0))) AND G (((p35 <= 0)))) OR X (((p6 <= 0) OR (p31 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((((p6 <= 0) OR (p31 <= 0)) R ((p9 <= 0) OR (p65 <= 0))) AND G (((p35 <= 0)))) OR X (((p6 <= 0) OR (p31 <= 0)))))
lola: processed formula length: 120
lola: 122 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 420 markings, 746 edges
lola: ========================================
lola: subprocess 6 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p7) AND (1 <= p62)))
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: ((p7 <= 0) OR (p62 <= 0))
lola: processed formula length: 26
lola: 124 rewrites
lola: closed formula file LTLFireability.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: 10 markings, 10 edges
lola: ========================================
lola: subprocess 7 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p7 <= 0) OR (p61 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p7 <= 0) OR (p61 <= 0)))
lola: processed formula length: 30
lola: 122 rewrites
lola: closed formula file LTLFireability.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: 1296 markings, 2501 edges
lola: ========================================
lola: subprocess 8 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((((1 <= p10) AND (1 <= p60)) OR ((1 <= p10) AND (1 <= p59)) OR ((1 <= p9) AND (1 <= p61)) OR ((1 <= p8) AND (1 <= p61)) OR ((1 <= p7) AND (1 <= p61)) OR ((1 <= p7) AND (1 <= p60)) OR ((1 <= p7) AND (1 <= p59)) OR ((1 <= p8) AND (1 <= p60)) OR ((1 <= p9) AND (1 <= p59)))) AND F ((((p9 <= 0) OR (p60 <= 0)) AND ((p10 <= 0) OR (p61 <= 0)) AND ((p8 <= 0) OR (p59 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((((1 <= p10) AND (1 <= p60)) OR ((1 <= p10) AND (1 <= p59)) OR ((1 <= p9) AND (1 <= p61)) OR ((1 <= p8) AND (1 <= p61)) OR ((1 <= p7) AND (1 <= p61)) OR ((1 <= p7) AND (1 <= p60)) OR ((1 <= p7) AND (1 <= p59)) OR ((1 <= p8) AND (1 <= p60)) OR ((1 <= p9) AND (1 <= p59)))) AND F ((((p9 <= 0) OR (p60 <= 0)) AND ((p10 <= 0) OR (p61 <= 0)) AND ((p8 <= 0) OR (p59 <= 0)))))))
lola: processed formula length: 392
lola: 122 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 10 markings, 10 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no yes no no no no
lola:
preliminary result: no no no no yes no no no no
lola: memory consumption: 90148 KB
lola: time consumption: 3 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.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="LamportFastMutEx-PT-3"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 gold2020"
echo " Input is LamportFastMutEx-PT-3, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r132-tall-162075428500326"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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