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.r176-tajo-158987871500201.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 PhilosophersDyn-COL-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987871500201
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 204K
-rw-r--r-- 1 mcc users 3.8K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_pt
-rw-r--r-- 1 mcc users 3 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 32K Apr 27 15:14 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 PhilosophersDyn-COL-10-00
FORMULA_NAME PhilosophersDyn-COL-10-01
FORMULA_NAME PhilosophersDyn-COL-10-02
FORMULA_NAME PhilosophersDyn-COL-10-03
FORMULA_NAME PhilosophersDyn-COL-10-04
FORMULA_NAME PhilosophersDyn-COL-10-05
FORMULA_NAME PhilosophersDyn-COL-10-06
FORMULA_NAME PhilosophersDyn-COL-10-07
FORMULA_NAME PhilosophersDyn-COL-10-08
FORMULA_NAME PhilosophersDyn-COL-10-09
FORMULA_NAME PhilosophersDyn-COL-10-10
FORMULA_NAME PhilosophersDyn-COL-10-11
FORMULA_NAME PhilosophersDyn-COL-10-12
FORMULA_NAME PhilosophersDyn-COL-10-13
FORMULA_NAME PhilosophersDyn-COL-10-14
FORMULA_NAME PhilosophersDyn-COL-10-15

=== Now, execution of the tool begins

BK_START 1591134261899

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 21:44:23] [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-02 21:44:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 21:44:23] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-06-02 21:44:24] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 544 ms
[2020-06-02 21:44:24] [INFO ] sort/places :
Neighbourhood->Neighbourhood,
Philosopher->Outside,Think,Forks,WaitLeft,WaitRight,HasLeft,HasRight,

[2020-06-02 21:44:24] [INFO ] Imported 8 HL places and 7 HL transitions for a total of 170 PT places and 2320.0 transition bindings in 32 ms.
[2020-06-02 21:44:24] [INFO ] Computed order based on color domains.
[2020-06-02 21:44:24] [INFO ] Unfolded HLPN to a Petri net with 170 places and 2310 transitions in 42 ms.
[2020-06-02 21:44:24] [INFO ] Unfolded HLPN properties in 1 ms.
Ensure Unique test removed 45 transitions
Reduce redundant transitions removed 45 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 88 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 11906 resets, run finished after 1317 ms. (steps per millisecond=75 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0]
[2020-06-02 21:44:25] [INFO ] Flow matrix only has 1905 transitions (discarded 360 similar events)
// Phase 1: matrix 1905 rows 170 cols
[2020-06-02 21:44:25] [INFO ] Computed 39 place invariants in 54 ms
[2020-06-02 21:44:26] [INFO ] [Real]Absence check using 30 positive place invariants in 24 ms returned sat
[2020-06-02 21:44:26] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 5 ms returned sat
[2020-06-02 21:44:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 21:44:26] [INFO ] [Real]Absence check using state equation in 663 ms returned sat
[2020-06-02 21:44:26] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2020-06-02 21:44:27] [INFO ] [Real]Added 1030 Read/Feed constraints in 342 ms returned sat
[2020-06-02 21:44:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 21:44:27] [INFO ] [Nat]Absence check using 30 positive place invariants in 23 ms returned sat
[2020-06-02 21:44:27] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 7 ms returned sat
[2020-06-02 21:44:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 21:44:28] [INFO ] [Nat]Absence check using state equation in 624 ms returned sat
[2020-06-02 21:44:28] [INFO ] [Nat]Added 1030 Read/Feed constraints in 779 ms returned sat
[2020-06-02 21:44:29] [INFO ] Deduced a trap composed of 69 places in 374 ms
[2020-06-02 21:44:29] [INFO ] Deduced a trap composed of 40 places in 367 ms
[2020-06-02 21:44:30] [INFO ] Deduced a trap composed of 75 places in 444 ms
[2020-06-02 21:44:30] [INFO ] Deduced a trap composed of 53 places in 362 ms
[2020-06-02 21:44:31] [INFO ] Deduced a trap composed of 64 places in 308 ms
[2020-06-02 21:44:31] [INFO ] Deduced a trap composed of 79 places in 291 ms
[2020-06-02 21:44:31] [INFO ] Deduced a trap composed of 86 places in 322 ms
[2020-06-02 21:44:32] [INFO ] Deduced a trap composed of 65 places in 321 ms
[2020-06-02 21:44:32] [INFO ] Deduced a trap composed of 70 places in 328 ms
[2020-06-02 21:44:33] [INFO ] Deduced a trap composed of 68 places in 365 ms
[2020-06-02 21:44:33] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4340 ms
[2020-06-02 21:44:33] [INFO ] Computed and/alt/rep : 2220/268350/1860 causal constraints in 665 ms.
[2020-06-02 21:44:47] [INFO ] Added : 100 causal constraints over 20 iterations in 14202 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-02 21:44:47] [INFO ] [Real]Absence check using 30 positive place invariants in 6 ms returned unsat
[2020-06-02 21:44:47] [INFO ] [Real]Absence check using 30 positive place invariants in 19 ms returned sat
[2020-06-02 21:44:47] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 5 ms returned unsat
[2020-06-02 21:44:47] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned unsat
[2020-06-02 21:44:47] [INFO ] [Real]Absence check using 30 positive place invariants in 6 ms returned unsat
[2020-06-02 21:44:47] [INFO ] [Real]Absence check using 30 positive place invariants in 13 ms returned sat
[2020-06-02 21:44:47] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 5 ms returned sat
[2020-06-02 21:44:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 21:44:48] [INFO ] [Real]Absence check using state equation in 905 ms returned sat
[2020-06-02 21:44:48] [INFO ] [Real]Added 1030 Read/Feed constraints in 262 ms returned sat
[2020-06-02 21:44:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 21:44:48] [INFO ] [Nat]Absence check using 30 positive place invariants in 28 ms returned sat
[2020-06-02 21:44:48] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 16 ms returned sat
[2020-06-02 21:44:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 21:44:49] [INFO ] [Nat]Absence check using state equation in 917 ms returned sat
[2020-06-02 21:44:50] [INFO ] [Nat]Added 1030 Read/Feed constraints in 979 ms returned sat
[2020-06-02 21:44:51] [INFO ] Deduced a trap composed of 40 places in 429 ms
[2020-06-02 21:44:52] [INFO ] Deduced a trap composed of 60 places in 485 ms
[2020-06-02 21:44:52] [INFO ] Deduced a trap composed of 59 places in 377 ms
[2020-06-02 21:44:53] [INFO ] Deduced a trap composed of 66 places in 390 ms
[2020-06-02 21:44:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2480 ms
[2020-06-02 21:44:53] [INFO ] Computed and/alt/rep : 2220/268350/1860 causal constraints in 402 ms.
[2020-06-02 21:45:08] [INFO ] Added : 105 causal constraints over 21 iterations in 15531 ms. Result :unknown
[2020-06-02 21:45:08] [INFO ] [Real]Absence check using 30 positive place invariants in 19 ms returned sat
[2020-06-02 21:45:08] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 6 ms returned sat
[2020-06-02 21:45:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 21:45:09] [INFO ] [Real]Absence check using state equation in 793 ms returned unsat
[2020-06-02 21:45:09] [INFO ] [Real]Absence check using 30 positive place invariants in 11 ms returned sat
[2020-06-02 21:45:09] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 5 ms returned sat
[2020-06-02 21:45:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 21:45:10] [INFO ] [Real]Absence check using state equation in 1149 ms returned sat
[2020-06-02 21:45:11] [INFO ] [Real]Added 1030 Read/Feed constraints in 295 ms returned sat
[2020-06-02 21:45:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 21:45:11] [INFO ] [Nat]Absence check using 30 positive place invariants in 22 ms returned sat
[2020-06-02 21:45:11] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 7 ms returned sat
[2020-06-02 21:45:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 21:45:12] [INFO ] [Nat]Absence check using state equation in 887 ms returned sat
[2020-06-02 21:45:12] [INFO ] [Nat]Added 1030 Read/Feed constraints in 699 ms returned sat
[2020-06-02 21:45:13] [INFO ] Computed and/alt/rep : 2220/268350/1860 causal constraints in 288 ms.
[2020-06-02 21:45:31] [INFO ] Added : 115 causal constraints over 23 iterations in 18336 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-02 21:45:31] [INFO ] [Real]Absence check using 30 positive place invariants in 12 ms returned sat
[2020-06-02 21:45:31] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 4 ms returned sat
[2020-06-02 21:45:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 21:45:32] [INFO ] [Real]Absence check using state equation in 785 ms returned sat
[2020-06-02 21:45:32] [INFO ] [Real]Added 1030 Read/Feed constraints in 341 ms returned sat
[2020-06-02 21:45:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 21:45:32] [INFO ] [Nat]Absence check using 30 positive place invariants in 22 ms returned sat
[2020-06-02 21:45:32] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 7 ms returned sat
[2020-06-02 21:45:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 21:45:33] [INFO ] [Nat]Absence check using state equation in 739 ms returned sat
[2020-06-02 21:45:34] [INFO ] [Nat]Added 1030 Read/Feed constraints in 751 ms returned sat
[2020-06-02 21:45:34] [INFO ] Deduced a trap composed of 69 places in 450 ms
[2020-06-02 21:45:35] [INFO ] Deduced a trap composed of 40 places in 483 ms
[2020-06-02 21:45:36] [INFO ] Deduced a trap composed of 75 places in 478 ms
[2020-06-02 21:45:36] [INFO ] Deduced a trap composed of 53 places in 437 ms
[2020-06-02 21:45:37] [INFO ] Deduced a trap composed of 64 places in 440 ms
[2020-06-02 21:45:37] [INFO ] Deduced a trap composed of 79 places in 420 ms
[2020-06-02 21:45:38] [INFO ] Deduced a trap composed of 86 places in 399 ms
[2020-06-02 21:45:38] [INFO ] Deduced a trap composed of 65 places in 389 ms
[2020-06-02 21:45:38] [INFO ] Deduced a trap composed of 70 places in 374 ms
[2020-06-02 21:45:39] [INFO ] Deduced a trap composed of 68 places in 358 ms
[2020-06-02 21:45:39] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 5314 ms
[2020-06-02 21:45:39] [INFO ] Computed and/alt/rep : 2220/268350/1860 causal constraints in 383 ms.
[2020-06-02 21:45:52] [INFO ] Added : 100 causal constraints over 20 iterations in 13150 ms. Result :unknown
Successfully simplified 5 atomic propositions for a total of 6 simplifications.
[2020-06-02 21:45:53] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-02 21:45:53] [INFO ] Flatten gal took : 563 ms
FORMULA PhilosophersDyn-COL-10-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-10-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-10-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-10-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-10-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-02 21:45:53] [INFO ] Applying decomposition
[2020-06-02 21:45:53] [INFO ] Flatten gal took : 163 ms
[2020-06-02 21:45:53] [INFO ] Decomposing Gal with order
[2020-06-02 21:45:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-02 21:45:54] [INFO ] Removed a total of 9970 redundant transitions.
[2020-06-02 21:45:54] [INFO ] Flatten gal took : 369 ms
[2020-06-02 21:45:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 72 ms.
[2020-06-02 21:45:54] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2020-06-02 21:45:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 18 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ PhilosophersDyn-COL-10 @ 3570 seconds
check_solution: Constraint R12 = 9.82696250997e-311 is above its equality of -1
check_solution: Constraint R13 = 1.22120857796e-310 is above its equality of -1
check_solution: Constraint R14 = 1.34704292842e-310 is above its equality of -1
check_solution: Constraint R15 = 1.34916492421e-310 is above its equality of -1
check_solution: Constraint R16 = 1.35128692e-310 is above its equality of -1
check_solution: Constraint R17 = 1.35340891579e-310 is above its equality of -1
check_solution: Constraint R18 = 1.35553091158e-310 is above its equality of -1
check_solution: Constraint R19 = 1.36635309012e-310 is above its equality of -1
check_solution: Constraint R20 = 1.3858754514e-310 is above its equality of -1
check_solution: Constraint R159 = 1.9068254182e-310 is above its equality of -1

Seriously low accuracy found ||*|| = 1 (rel. error 1)

FORMULA PhilosophersDyn-COL-10-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3529
rslt: Output for LTLCardinality @ PhilosophersDyn-COL-10

{
"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": "Tue Jun 2 21:45:54 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 320
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "F ((G ((3 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139)) AND F ((2 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149))))",
"processed_size": 167,
"rewrites": 117
},
"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": "ltl preserving/insertion"
},
"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": 353
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 60,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 40,
"visible_transitions": 0
},
"processed": "X ((X (G ((p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 <= 2))) OR (F ((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119)) OR ((p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160 <= 2) AND (p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + 1 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119)))))",
"processed_size": 467,
"rewrites": 117
},
"result":
{
"edges": 45,
"markings": 46,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"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": 392
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "G (F ((2 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119)))",
"processed_size": 82,
"rewrites": 117
},
"result":
{
"edges": 6,
"markings": 6,
"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": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 441
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "G (F ((1 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160)))",
"processed_size": 82,
"rewrites": 117
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 504
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "F (G ((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + 1 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119)))",
"processed_size": 152,
"rewrites": 117
},
"result":
{
"edges": 7,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 588
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 4,
"G": 4,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 120,
"taut": 0,
"tconj": 4,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 30,
"visible_transitions": 0
},
"processed": "G (((p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149) OR (F ((p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149)) AND F (G ((F ((G ((1 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139)) AND (p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + 1 <= p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150))) AND (F ((p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149)) OR (G ((1 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139)) AND (p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + 1 <= p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150)))))))))",
"processed_size": 928,
"rewrites": 117
},
"result":
{
"edges": 3195,
"markings": 1212,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 19
},
"compoundnumber": 5,
"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": 706
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 100,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 40,
"visible_transitions": 0
},
"processed": "G (F ((G ((F (((p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129) AND (p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p100 <= 1))) AND ((p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129) OR ((p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129) AND (p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p100 <= 1))))) OR (p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129))))",
"processed_size": 757,
"rewrites": 117
},
"result":
{
"edges": 9,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 882
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 882
},
"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": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "(2 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139)",
"processed_size": 74,
"rewrites": 117
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1176
},
"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": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "(2 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139)",
"processed_size": 74,
"rewrites": 117
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1765
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "(p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= 1)",
"processed_size": 74,
"rewrites": 119
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 20
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1176
},
"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": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "(p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= 0)",
"processed_size": 74,
"rewrites": 117
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 8,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1765
},
"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": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "G ((p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139))",
"processed_size": 144,
"rewrites": 117
},
"result":
{
"edges": 2062,
"markings": 759,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"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": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1764
},
"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": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "(2 <= p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p100)",
"processed_size": 74,
"rewrites": 119
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2045
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3529
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 30,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 30,
"visible_transitions": 0
},
"processed": "G (((p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149) AND (2 <= p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p100)))",
"processed_size": 225,
"rewrites": 117
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"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": false
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3529
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "G ((p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 <= 1))",
"processed_size": 78,
"rewrites": 117
},
"result":
{
"edges": 33,
"markings": 24,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"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": false
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 98288,
"runtime": 41.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(** OR ((G(**) AND F(**)) OR **)) : G((** OR (F(**) AND F(G((F((G(**) AND **)) AND (F(**) OR (G(**) AND **)))))))) : (G(**) AND ((* R *) OR **)) : (F((G(**) AND F(**))) AND (X(G(**)) OR F(**))) : F(G(*)) : G(F((G((F(**) AND (** OR **))) OR *))) : G(F(**)) : G(F(**)) : (G(*) AND F((G(*) OR (* AND *)))) : X((X(G(*)) OR (F(*) OR **))) : (G(**) OR F(*))"
},
"net":
{
"arcs": 17110,
"conflict_clusters": 1,
"places": 170,
"places_significant": 131,
"singleton_clusters": 0,
"transitions": 2265
},
"result":
{
"preliminary_value": "no no no no no no no no no yes no ",
"value": "no no no no no no no no no yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 2435/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 5440
lola: finding significant places
lola: 170 places, 2265 transitions, 131 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: (p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p39 + p29 + p19 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99)
lola: ((G ((p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139)) U (2 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139)) OR (2 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139)) : NOT(F (NOT((F (G ((F ((p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149)) U (G ((1 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139)) AND (p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + 1 <= p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150))))) U (p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149))))) : (G ((p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139)) AND (NOT(((p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160) U (p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139))) OR (p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= 0))) : (F ((G ((3 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139)) AND F ((2 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149)))) AND (X (G ((p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139))) OR F ((2 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149)))) : F (NOT(X (G (F ((p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139)))))) : NOT(G (F (G ((NOT(G (((p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129) U ((p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129) AND (p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p100 <= 1))))) AND (p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + 1 <= p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150)))))) : NOT(X (X (X (((0 <= 0) U F (X (G (NOT(X (X ((1 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160)))))))))))) : G (F (((0 <= 0) U (2 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119)))) : (NOT(F ((2 <= p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150))) AND NOT(G (((p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139) U ((p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139)))))) : X (((NOT(X (F ((3 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129)))) OR NOT(G ((p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + 1 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139)))) OR ((p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160 <= 2) AND (p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + 1 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119)))) : (G (((p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149) AND (2 <= p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p100))) OR NOT(G ((2 <= p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p100))))
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:300
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:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 320 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((G ((3 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139)) AND F ((2 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149)))) AND (X (G ((p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139))) OR F ((2 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 320 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G ((3 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139)) AND F ((2 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((3 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139)) AND F ((2 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149))))
lola: processed formula length: 167
lola: 117 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 9 markings, 9 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (G ((p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 <= 2))) OR (F ((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119)) OR ((p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160 <= 2) AND (p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + 1 <= p110 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (G ((p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 <= 2))) OR (F ((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119)) OR ((p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160 <= 2) AND (p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + 1 <= p110 ... (shortened)
lola: processed formula length: 467
lola: 117 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 46 markings, 45 edges
lola: ========================================
lola: subprocess 2 will run for 392 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((2 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((2 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119)))
lola: processed formula length: 82
lola: 117 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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 3 will run for 441 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((1 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((1 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160)))
lola: processed formula length: 82
lola: 117 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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 4 will run for 504 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + 1 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119)))
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 ((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + 1 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119)))
lola: processed formula length: 152
lola: 117 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: 6 markings, 7 edges
lola: ========================================
lola: subprocess 5 will run for 588 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149) OR (F ((p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149)) AND F (G ((F ((G ((1 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139)) AND (p140 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149) OR (F ((p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149)) AND F (G ((F ((G ((1 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139)) AND (p140 + ... (shortened)
lola: processed formula length: 928
lola: 117 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 19 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: 1212 markings, 3195 edges
lola: ========================================
lola: subprocess 6 will run for 706 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((F (((p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129) AND (p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p100 <= 1))) AND ((p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129) OR ((p110 + p111 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((F (((p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129) AND (p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p100 <= 1))) AND ((p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129) OR ((p110 + p111 ... (shortened)
lola: processed formula length: 757
lola: 117 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 8 markings, 9 edges
lola: ========================================
lola: subprocess 7 will run for 882 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((2 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139) OR ((G ((p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139)) AND F ((2 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139))) OR (2 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 882 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139)
lola: processed formula length: 74
lola: 117 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: subprocess 8 will run for 1176 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139)
lola: processed formula length: 74
lola: 117 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: subprocess 9 will run for 1765 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((2 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139))
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: (p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= 1)
lola: processed formula length: 74
lola: 119 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: 7 markings, 6 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 1176 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139)) AND (((p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160 + 1 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129) R (p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + 1 <= p169 + p168 + p167 + p166... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 1176 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= 0)
lola: processed formula length: 74
lola: 117 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 1765 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139))
lola: processed formula length: 144
lola: 117 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: 759 markings, 2062 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 1764 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (((p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149) AND (2 <= p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p100))) OR F ((p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p100 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 1764 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p100 <= 1))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (2 <= p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p100)
lola: processed formula length: 74
lola: 119 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: 5 markings, 4 edges
lola: ========================================
lola: subprocess 10 will run for 3529 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149) AND (2 <= p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p100)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149) AND (2 <= p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p100)))
lola: processed formula length: 225
lola: 117 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: 6 markings, 6 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 3529 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 <= 1)) AND F ((G (((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + 1 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129))) OR ((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + 1 <= p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150) AND ((p130 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 3529 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 <= 1))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 <= 1))
lola: processed formula length: 78
lola: 117 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: 24 markings, 33 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no no no yes no
lola:
preliminary result: no no no no no no no no no yes no
lola: memory consumption: 98288 KB
lola: time consumption: 41 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="PhilosophersDyn-COL-10"
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 PhilosophersDyn-COL-10, 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 r176-tajo-158987871500201"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-COL-10.tgz
mv PhilosophersDyn-COL-10 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 ;