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.r135-tajo-158961408900115.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 win2019
Input is PolyORBLF-PT-S04J04T06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-tajo-158961408900115
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.1M
-rw-r--r-- 1 mcc users 9.0K Apr 12 05:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 12 05:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 11 04:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 11 04:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 12K Apr 14 12:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 47K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 14 12:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 31K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Apr 10 12:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 10 12:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 46K Apr 9 17:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 147K Apr 9 17:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.8K Apr 10 22:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.1K Apr 10 22:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 3.6M Mar 24 05:37 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBLF-PT-S04J04T06-00
FORMULA_NAME PolyORBLF-PT-S04J04T06-01
FORMULA_NAME PolyORBLF-PT-S04J04T06-02
FORMULA_NAME PolyORBLF-PT-S04J04T06-03
FORMULA_NAME PolyORBLF-PT-S04J04T06-04
FORMULA_NAME PolyORBLF-PT-S04J04T06-05
FORMULA_NAME PolyORBLF-PT-S04J04T06-06
FORMULA_NAME PolyORBLF-PT-S04J04T06-07
FORMULA_NAME PolyORBLF-PT-S04J04T06-08
FORMULA_NAME PolyORBLF-PT-S04J04T06-09
FORMULA_NAME PolyORBLF-PT-S04J04T06-10
FORMULA_NAME PolyORBLF-PT-S04J04T06-11
FORMULA_NAME PolyORBLF-PT-S04J04T06-12
FORMULA_NAME PolyORBLF-PT-S04J04T06-13
FORMULA_NAME PolyORBLF-PT-S04J04T06-14
FORMULA_NAME PolyORBLF-PT-S04J04T06-15

=== Now, execution of the tool begins

BK_START 1590270470661

info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ PolyORBLF-PT-S04J04T06 @ 3570 seconds
check_solution: Variable C288 = -0.0873689200683 is below its lower bound 0
check_solution: Variable C1409 = -0.526484012604 is below its lower bound 0
check_solution: Variable C1410 = -0.739698386175 is below its lower bound 0
check_solution: Variable C2157 = -0.0996409058571 is below its lower bound 0
check_solution: Variable C2158 = -0.117608949188 is below its lower bound 0
check_solution: Constraint R34 = 3.5522209557e-311 is above its equality of -1
check_solution: Constraint R35 = 5.51082307076e-311 is above its equality of -1
check_solution: Constraint R36 = 5.80790248171e-311 is above its equality of -1
check_solution: Constraint R37 = 5.81214647281e-311 is above its equality of -1
check_solution: Constraint R53 = 3.73683458907e-311 is above its equality of -10

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

FORMULA PolyORBLF-PT-S04J04T06-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S04J04T06-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S04J04T06-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S04J04T06-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S04J04T06-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S04J04T06-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S04J04T06-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S04J04T06-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S04J04T06-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S04J04T06-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S04J04T06-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S04J04T06-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S04J04T06-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S04J04T06-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S04J04T06-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S04J04T06-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2769
rslt: Output for LTLCardinality @ PolyORBLF-PT-S04J04T06

{
"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": "mcc2019",
"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": "Sat May 23 21:47:50 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 203
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 3,
"G": 3,
"U": 1,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 168,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 72,
"visible_transitions": 0
},
"processed": "A (((F (G (((1 <= DisablePollingE_5_4 + DisablePollingE_5_3 + DisablePollingE_5_2 + DisablePollingE_5_1 + DisablePollingE_1_1 + DisablePollingE_1_2 + DisablePollingE_1_3 + DisablePollingE_1_4 + DisablePollingE_2_1 + DisablePollingE_2_2 + DisablePollingE_2_3 + DisablePollingE_2_4 + DisablePollingE_4_4 + DisablePollingE_4_3 + DisablePollingE_4_2 + DisablePollingE_4_1 + DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_3_3 + DisablePollingE_3_4 + DisablePollingE_6_1 + DisablePollingE_6_2 + DisablePollingE_6_3 + DisablePollingE_6_4) AND X (F ((1 <= DisablePollingE_5_4 + DisablePollingE_5_3 + DisablePollingE_5_2 + DisablePollingE_5_1 + DisablePollingE_1_1 + DisablePollingE_1_2 + DisablePollingE_1_3 + DisablePollingE_1_4 + DisablePollingE_2_1 + DisablePollingE_2_2 + DisablePollingE_2_3 + DisablePollingE_2_4 + DisablePollingE_4_4 + DisablePollingE_4_3 + DisablePollingE_4_2 + DisablePollingE_4_1 + DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_3_3 + DisablePollingE_3_4 + DisablePollingE_6_1 + DisablePollingE_6_2 + DisablePollingE_6_3 + DisablePollingE_6_4)))))) AND G ((X ((1 <= DisablePollingE_5_4 + DisablePollingE_5_3 + DisablePollingE_5_2 + DisablePollingE_5_1 + DisablePollingE_1_1 + DisablePollingE_1_2 + DisablePollingE_1_3 + DisablePollingE_1_4 + DisablePollingE_2_1 + DisablePollingE_2_2 + DisablePollingE_2_3 + DisablePollingE_2_4 + DisablePollingE_4_4 + DisablePollingE_4_3 + DisablePollingE_4_2 + DisablePollingE_4_1 + DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_3_3 + DisablePollingE_3_4 + DisablePollingE_6_1 + DisablePollingE_6_2 + DisablePollingE_6_3 + DisablePollingE_6_4)) OR G (((1 <= DisablePollingE_5_4 + DisablePollingE_5_3 + DisablePollingE_5_2 + DisablePollingE_5_1 + DisablePollingE_1_1 + DisablePollingE_1_2 + DisablePollingE_1_3 + DisablePollingE_1_4 + DisablePollingE_2_1 + DisablePollingE_2_2 + DisablePollingE_2_3 + DisablePollingE_2_4 + DisablePollingE_4_4 + DisablePollingE_4_3 + DisablePollingE_4_2 + DisablePollingE_4_1 + DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_3_3 + DisablePollingE_3_4 + DisablePollingE_6_1 + DisablePollingE_6_2 + DisablePollingE_6_3 + DisablePollingE_6_4) AND X (F ((1 <= DisablePollingE_5_4 + DisablePollingE_5_3 + DisablePollingE_5_2 + DisablePollingE_5_1 + DisablePollingE_1_1 + DisablePollingE_1_2 + DisablePollingE_1_3 + DisablePollingE_1_4 + DisablePollingE_2_1 + DisablePollingE_2_2 + DisablePollingE_2_3 + DisablePollingE_2_4 + DisablePollingE_4_4 + DisablePollingE_4_3 + DisablePollingE_4_2 + DisablePollingE_4_1 + DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_3_3 + DisablePollingE_3_4 + DisablePollingE_6_1 + DisablePollingE_6_2 + DisablePollingE_6_3 + DisablePollingE_6_4)))))))) U (P_2579_1_1 + P_2579_1_2 + P_2579_1_3 + P_2579_1_4 + P_2579_2_1 + P_2579_2_2 + P_2579_2_3 + P_2579_2_4 + P_2579_3_1 + P_2579_3_2 + P_2579_3_3 + P_2579_3_4 + P_2579_4_1 + P_2579_4_2 + P_2579_4_3 + P_2579_4_4 + P_2579_5_1 + P_2579_5_2 + P_2579_5_3 + P_2579_5_4 + P_2579_6_1 + P_2579_6_2 + P_2579_6_3 + P_2579_6_4 <= P_1119_1_1 + P_1119_1_2 + P_1119_1_3 + P_1119_1_4 + P_1119_2_1 + P_1119_2_2 + P_1119_2_3 + P_1119_2_4 + P_1119_3_1 + P_1119_3_2 + P_1119_3_3 + P_1119_3_4 + P_1119_4_1 + P_1119_4_2 + P_1119_4_3 + P_1119_4_4 + P_1119_5_1 + P_1119_5_2 + P_1119_5_3 + P_1119_5_4 + P_1119_6_1 + P_1119_6_2 + P_1119_6_3 + P_1119_6_4)))",
"processed_size": 3356,
"rewrites": 118
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 11
},
"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": 217
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 2,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 85,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 56,
"visible_transitions": 0
},
"processed": "A (X (G ((((P_1717 <= ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + ScheduleTaskB_5 + ScheduleTaskB_6) U (P_1725_0 + P_1725_1 + P_1725_2 + P_1725_3 + P_1725_4 <= P_1119_1_1 + P_1119_1_2 + P_1119_1_3 + P_1119_1_4 + P_1119_2_1 + P_1119_2_2 + P_1119_2_3 + P_1119_2_4 + P_1119_3_1 + P_1119_3_2 + P_1119_3_3 + P_1119_3_4 + P_1119_4_1 + P_1119_4_2 + P_1119_4_3 + P_1119_4_4 + P_1119_5_1 + P_1119_5_2 + P_1119_5_3 + P_1119_5_4 + P_1119_6_1 + P_1119_6_2 + P_1119_6_3 + P_1119_6_4)) OR (G ((CreatedJobs_0_1 + CreatedJobs_0_2 + CreatedJobs_0_3 + CreatedJobs_0_4 + CreatedJobs_1_1 + CreatedJobs_1_2 + CreatedJobs_1_3 + CreatedJobs_1_4 + CreatedJobs_2_1 + CreatedJobs_2_2 + CreatedJobs_2_3 + CreatedJobs_2_4 + CreatedJobs_3_1 + CreatedJobs_3_2 + CreatedJobs_3_3 + CreatedJobs_3_4 + CreatedJobs_4_1 + CreatedJobs_4_2 + CreatedJobs_4_3 + CreatedJobs_4_4 <= 0)) AND F ((P_1725_0 + P_1725_1 + P_1725_2 + P_1725_3 + P_1725_4 <= P_1119_1_1 + P_1119_1_2 + P_1119_1_3 + P_1119_1_4 + P_1119_2_1 + P_1119_2_2 + P_1119_2_3 + P_1119_2_4 + P_1119_3_1 + P_1119_3_2 + P_1119_3_3 + P_1119_3_4 + P_1119_4_1 + P_1119_4_2 + P_1119_4_3 + P_1119_4_4 + P_1119_5_1 + P_1119_5_2 + P_1119_5_3 + P_1119_5_4 + P_1119_6_1 + P_1119_6_2 + P_1119_6_3 + P_1119_6_4)))))))",
"processed_size": 1253,
"rewrites": 118
},
"result":
{
"edges": 6845,
"markings": 2835,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 232
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "A (X (F ((P_1724_0 + P_1724_1 + P_1724_2 + P_1724_3 + P_1724_4 <= P_1712_0 + P_1712_1 + P_1712_2 + P_1712_3 + P_1712_4))))",
"processed_size": 122,
"rewrites": 118
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 250
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 73,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 43,
"visible_transitions": 0
},
"processed": "A ((((DisablePollingE_5_4 + DisablePollingE_5_3 + DisablePollingE_5_2 + DisablePollingE_5_1 + DisablePollingE_1_1 + DisablePollingE_1_2 + DisablePollingE_1_3 + DisablePollingE_1_4 + DisablePollingE_2_1 + DisablePollingE_2_2 + DisablePollingE_2_3 + DisablePollingE_2_4 + DisablePollingE_4_4 + DisablePollingE_4_3 + DisablePollingE_4_2 + DisablePollingE_4_1 + DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_3_3 + DisablePollingE_3_4 + DisablePollingE_6_1 + DisablePollingE_6_2 + DisablePollingE_6_3 + DisablePollingE_6_4 <= Check_Sources_E_1 + Check_Sources_E_2 + Check_Sources_E_3 + Check_Sources_E_4 + Check_Sources_E_5 + Check_Sources_E_6) OR F ((Perform_Work_E_1 + Perform_Work_E_2 + Perform_Work_E_3 + Perform_Work_E_4 + Perform_Work_E_5 + Perform_Work_E_6 <= Try_Check_Sources_B_1 + Try_Check_Sources_B_2 + Try_Check_Sources_B_3 + Try_Check_Sources_B_4 + Try_Check_Sources_B_5 + Try_Check_Sources_B_6))) U X (((3 <= JobCnt) OR X ((Check_Sources_E_1 + Check_Sources_E_2 + Check_Sources_E_3 + Check_Sources_E_4 + Check_Sources_E_5 + Check_Sources_E_6 + 1 <= DisablePollingE_5_4 + DisablePollingE_5_3 + DisablePollingE_5_2 + DisablePollingE_5_1 + DisablePollingE_1_1 + DisablePollingE_1_2 + DisablePollingE_1_3 + DisablePollingE_1_4 + DisablePollingE_2_1 + DisablePollingE_2_2 + DisablePollingE_2_3 + DisablePollingE_2_4 + DisablePollingE_4_4 + DisablePollingE_4_3 + DisablePollingE_4_2 + DisablePollingE_4_1 + DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_3_3 + DisablePollingE_3_4 + DisablePollingE_6_1 + DisablePollingE_6_2 + DisablePollingE_6_3 + DisablePollingE_6_4))))))",
"processed_size": 1604,
"rewrites": 118
},
"result":
{
"edges": 20970123,
"markings": 11399461,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 263
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "A (X (TRUE))",
"processed_size": 12,
"rewrites": 118
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 287
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (F (G ((X ((Insert_Source_E_6 + 1 <= QueueJobB_5_1)) AND F (((P_1158_6 <= 1) AND G ((Insert_Source_E_6 + 1 <= QueueJobB_5_1))))))))",
"processed_size": 133,
"rewrites": 118
},
"result":
{
"edges": 1080,
"markings": 1079,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 315
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (X (X (G ((F ((1 <= cSources)) AND ((FetchJobB_5 <= QueueJobB_1_0) OR G (F ((3 <= nyo_1)))))))))",
"processed_size": 98,
"rewrites": 118
},
"result":
{
"edges": 2021981,
"markings": 610825,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 6,
"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": 349
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (X (X ((F ((cIdleTasks + 1 <= P_1727)) AND (F ((P_1097 <= QueueJobE_5)) OR G (F ((cIdleTasks + 1 <= P_1727))))))))",
"processed_size": 116,
"rewrites": 118
},
"result":
{
"edges": 703,
"markings": 703,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 7,
"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": 393
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 4,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (X ((X (X (F ((QueueJobE_3 + 1 <= nyo_5)))) OR G (((P_1725_1 <= Abort_Check_Sources_B_4) AND X ((1 <= cPollingAbort)))))))",
"processed_size": 124,
"rewrites": 118
},
"result":
{
"edges": 985,
"markings": 958,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 8,
"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": 449
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "A (X (TRUE))",
"processed_size": 12,
"rewrites": 118
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 9,
"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": 524
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (((FetchJobB_2 <= cIsMonitoring) OR X (X (X (G ((FetchJobE_6_3 + 1 <= Insert_Source_B_5_2)))))))",
"processed_size": 98,
"rewrites": 118
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 10,
"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": 629
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((P_1725_4 <= P_1158_5)))",
"processed_size": 30,
"rewrites": 120
},
"result":
{
"edges": 10,
"markings": 11,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 787
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 32,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 32,
"visible_transitions": 0
},
"processed": "A (G (((Try_Check_Sources_B_1 + Try_Check_Sources_B_2 + Try_Check_Sources_B_3 + Try_Check_Sources_B_4 + Try_Check_Sources_B_5 + Try_Check_Sources_B_6 <= P_1093) OR (DisablePollingE_5_4 + DisablePollingE_5_3 + DisablePollingE_5_2 + DisablePollingE_5_1 + DisablePollingE_1_1 + DisablePollingE_1_2 + DisablePollingE_1_3 + DisablePollingE_1_4 + DisablePollingE_2_1 + DisablePollingE_2_2 + DisablePollingE_2_3 + DisablePollingE_2_4 + DisablePollingE_4_4 + DisablePollingE_4_3 + DisablePollingE_4_2 + DisablePollingE_4_1 + DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_3_3 + DisablePollingE_3_4 + DisablePollingE_6_1 + DisablePollingE_6_2 + DisablePollingE_6_3 + DisablePollingE_6_4 <= MarkerRead))))",
"processed_size": 709,
"rewrites": 120
},
"result":
{
"produced_by": "state equation",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 923
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (F (G (((ScheduleTaskE_Idle_1 + 1 <= cBlockedTasks) AND (P_1617_6 + 1 <= ScheduleTaskE_Idle_5)))))",
"processed_size": 100,
"rewrites": 118
},
"result":
{
"edges": 430,
"markings": 429,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 13,
"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": 1384
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 23,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 23,
"visible_transitions": 0
},
"processed": "A (((P_1724_0 + P_1724_1 + P_1724_2 + P_1724_3 + P_1724_4 <= QueueJobE_1 + QueueJobE_2 + QueueJobE_3 + QueueJobE_4 + QueueJobE_5 + QueueJobE_6) OR F ((ScheduleTaskE_Idle_1 + ScheduleTaskE_Idle_2 + ScheduleTaskE_Idle_3 + ScheduleTaskE_Idle_4 + ScheduleTaskE_Idle_5 + ScheduleTaskE_Idle_6 <= RunE_1 + RunE_2 + RunE_3 + RunE_4 + RunE_5 + RunE_6))))",
"processed_size": 345,
"rewrites": 118
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 14,
"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": 2769
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 50,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 40,
"visible_transitions": 0
},
"processed": "A ((((PlaceSources_4 + PlaceSources_3 + PlaceSources_2 + PlaceSources_1 + 1 <= NotifyEventJobQueuedE_1 + NotifyEventJobQueuedE_2 + NotifyEventJobQueuedE_3 + NotifyEventJobQueuedE_4 + NotifyEventJobQueuedE_5 + NotifyEventJobQueuedE_6) AND F ((nyo_1 + nyo_2 + nyo_3 + nyo_4 + nyo_5 + nyo_6 <= P_1119_1_1 + P_1119_1_2 + P_1119_1_3 + P_1119_1_4 + P_1119_2_1 + P_1119_2_2 + P_1119_2_3 + P_1119_2_4 + P_1119_3_1 + P_1119_3_2 + P_1119_3_3 + P_1119_3_4 + P_1119_4_1 + P_1119_4_2 + P_1119_4_3 + P_1119_4_4 + P_1119_5_1 + P_1119_5_2 + P_1119_5_3 + P_1119_5_4 + P_1119_6_1 + P_1119_6_2 + P_1119_6_3 + P_1119_6_4))) U G ((NotifyEventJobQueuedE_1 + NotifyEventJobQueuedE_2 + NotifyEventJobQueuedE_3 + NotifyEventJobQueuedE_4 + NotifyEventJobQueuedE_5 + NotifyEventJobQueuedE_6 <= PlaceSources_4 + PlaceSources_3 + PlaceSources_2 + PlaceSources_1))))",
"processed_size": 836,
"rewrites": 118
},
"result":
{
"edges": 524,
"markings": 524,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 15,
"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": 127552,
"runtime": 801.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(((F(G((** AND X(F(**))))) AND G((X(**) OR G((** AND X(F(**))))))) U **)) : A((** OR F(**))) : A(X(G(((** U **) OR (G(*) AND F(**)))))) : A(X(F(**))) : A(((* AND F(**)) U G(**))) : A(G(**)) : A(((** OR F(**)) U X((** OR X(**))))) : A(X(TRUE)) : A(F(G((X(*) AND F((* AND G(*))))))) : A(X(X(G((F(**) AND (** OR G(F(**)))))))) : A(F(G(*))) : A(X(X((F(*) AND (F(**) OR G(F(*))))))) : A(X((X(X(F(*))) OR G((** AND X(**)))))) : A(X(TRUE)) : A((** OR X(X(X(G(*)))))) : A(G(**))"
},
"net":
{
"arcs": 20754,
"conflict_clusters": 209,
"places": 554,
"places_significant": 504,
"singleton_clusters": 0,
"transitions": 2998
},
"result":
{
"preliminary_value": "yes yes no yes no yes yes yes no no no no no yes yes no ",
"value": "yes yes no yes no yes yes yes no no no no no yes 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: 3552/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 17728
lola: finding significant places
lola: 554 places, 2998 transitions, 504 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: A ((G ((X ((1 <= DisablePollingE_5_4 + DisablePollingE_5_3 + DisablePollingE_5_2 + DisablePollingE_5_1 + DisablePollingE_1_1 + DisablePollingE_1_2 + DisablePollingE_1_3 + DisablePollingE_1_4 + DisablePollingE_2_1 + DisablePollingE_2_2 + DisablePollingE_2_3 + DisablePollingE_2_4 + DisablePollingE_4_4 + DisablePollingE_4_3 + DisablePollingE_4_2 + DisablePollingE_4_1 + DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_3_3 + DisablePollingE_3_4 + DisablePollingE_6_1 + DisablePollingE_6_2 + DisablePollingE_6_3 + DisablePollingE_6_4)) U G (((1 <= DisablePollingE_5_4 + DisablePollingE_5_3 + DisablePollingE_5_2 + DisablePollingE_5_1 + DisablePollingE_1_1 + DisablePollingE_1_2 + DisablePollingE_1_3 + DisablePollingE_1_4 + DisablePollingE_2_1 + DisablePollingE_2_2 + DisablePollingE_2_3 + DisablePollingE_2_4 + DisablePollingE_4_4 + DisablePollingE_4_3 + DisablePollingE_4_2 + DisablePollingE_4_1 + DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_3_3 + DisablePollingE_3_4 + DisablePollingE_6_1 + DisablePollingE_6_2 + DisablePollingE_6_3 + DisablePollingE_6_4) AND X (F ((1 <= DisablePollingE_5_4 + DisablePollingE_5_3 + DisablePollingE_5_2 + DisablePollingE_5_1 + DisablePollingE_1_1 + DisablePollingE_1_2 + DisablePollingE_1_3 + DisablePollingE_1_4 + DisablePollingE_2_1 + DisablePollingE_2_2 + DisablePollingE_2_3 + DisablePollingE_2_4 + DisablePollingE_4_4 + DisablePollingE_4_3 + DisablePollingE_4_2 + DisablePollingE_4_1 + DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_3_3 + DisablePollingE_3_4 + DisablePollingE_6_1 + DisablePollingE_6_2 + DisablePollingE_6_3 + DisablePollingE_6_4))))))) U (P_2579_1_1 + P_2579_1_2 + P_2579_1_3 + P_2579_1_4 + P_2579_2_1 + P_2579_2_2 + P_2579_2_3 + P_2579_2_4 + P_2579_3_1 + P_2579_3_2 + P_2579_3_3 + P_2579_3_4 + P_2579_4_1 + P_2579_4_2 + P_2579_4_3 + P_2579_4_4 + P_2579_5_1 + P_2579_5_2 + P_2579_5_3 + P_2579_5_4 + P_2579_6_1 + P_2579_6_2 + P_2579_6_3 + P_2579_6_4 <= P_1119_1_1 + P_1119_1_2 + P_1119_1_3 + P_1119_1_4 + P_1119_2_1 + P_1119_2_2 + P_1119_2_3 + P_1119_2_4 + P_1119_3_1 + P_1119_3_2 + P_1119_3_3 + P_1119_3_4 + P_1119_4_1 + P_1119_4_2 + P_1119_4_3 + P_1119_4_4 + P_1119_5_1 + P_1119_5_2 + P_1119_5_3 + P_1119_5_4 + P_1119_6_1 + P_1119_6_2 + P_1119_6_3 + P_1119_6_4))) : A (((P_1724_0 + P_1724_1 + P_1724_2 + P_1724_3 + P_1724_4 <= QueueJobE_1 + QueueJobE_2 + QueueJobE_3 + QueueJobE_4 + QueueJobE_5 + QueueJobE_6) OR F ((ScheduleTaskE_Idle_1 + ScheduleTaskE_Idle_2 + ScheduleTaskE_Idle_3 + ScheduleTaskE_Idle_4 + ScheduleTaskE_Idle_5 + ScheduleTaskE_Idle_6 <= RunE_1 + RunE_2 + RunE_3 + RunE_4 + RunE_5 + RunE_6)))) : A (G (X (G ((NOT(F ((1 <= CreatedJobs_0_1 + CreatedJobs_0_2 + CreatedJobs_0_3 + CreatedJobs_0_4 + CreatedJobs_1_1 + CreatedJobs_1_2 + CreatedJobs_1_3 + CreatedJobs_1_4 + CreatedJobs_2_1 + CreatedJobs_2_2 + CreatedJobs_2_3 + CreatedJobs_2_4 + CreatedJobs_3_1 + CreatedJobs_3_2 + CreatedJobs_3_3 + CreatedJobs_3_4 + CreatedJobs_4_1 + CreatedJobs_4_2 + CreatedJobs_4_3 + CreatedJobs_4_4))) U (G ((0 <= TryAllocateOneTaskB_5 + TryAllocateOneTaskB_4 + TryAllocateOneTaskB_3 + TryAllocateOneTaskB_2 + TryAllocateOneTaskB_1 + TryAllocateOneTaskB_6)) AND ((P_1717 <= ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + ScheduleTaskB_5 + ScheduleTaskB_6) U (P_1725_0 + P_1725_1 + P_1725_2 + P_1725_3 + P_1725_4 <= P_1119_1_1 + P_1119_1_2 + P_1119_1_3 + P_1119_1_4 + P_1119_2_1 + P_1119_2_2 + P_1119_2_3 + P_1119_2_4 + P_1119_3_1 + P_1119_3_2 + P_1119_3_3 + P_1119_3_4 + P_1119_4_1 + P_1119_4_2 + P_1119_4_3 + P_1119_4_4 + P_1119_5_1 + P_1119_5_2 + P_1119_5_3 + P_1119_5_4 + P_1119_6_1 + P_1119_6_2 + P_1119_6_3 + P_1119_6_4)))))))) : A ((X ((0 <= Try_Check_Sources_E_1 + Try_Check_Sources_E_2 + Try_Check_Sources_E_3 + Try_Check_Sources_E_4 + Try_Check_Sources_E_5 + Try_Check_Sources_E_6)) AND (((0 <= Perform_Work_E_1 + Perform_Work_E_2 + Perform_Work_E_3 + Perform_Work_E_4 + Perform_Work_E_5 + Perform_Work_E_6) OR F (G ((0 <= Perform_Work_E_1 + Perform_Work_E_2 + Perform_Work_E_3 + Perform_Work_E_4 + Perform_Work_E_5 + Perform_Work_E_6)))) U X ((P_1724_0 + P_1724_1 + P_1724_2 + P_1724_3 + P_1724_4 <= P_1712_0 + P_1712_1 + P_1712_2 + P_1712_3 + P_1712_4))))) : A ((NOT(((NotifyEventJobQueuedE_1 + NotifyEventJobQueuedE_2 + NotifyEventJobQueuedE_3 + NotifyEventJobQueuedE_4 + NotifyEventJobQueuedE_5 + NotifyEventJobQueuedE_6 <= PlaceSources_4 + PlaceSources_3 + PlaceSources_2 + PlaceSources_1) OR NOT(F ((nyo_1 + nyo_2 + nyo_3 + nyo_4 + nyo_5 + nyo_6 <= P_1119_1_1 + P_1119_1_2 + P_1119_1_3 + P_1119_1_4 + P_1119_2_1 + P_1119_2_2 + P_1119_2_3 + P_1119_2_4 + P_1119_3_1 + P_1119_3_2 + P_1119_3_3 + P_1119_3_4 + P_1119_4_1 + P_1119_4_2 + P_1119_4_3 + P_1119_4_4 + P_1119_5_1 + P_1119_5_2 + P_1119_5_3 + P_1119_5_4 + P_1119_6_1 + P_1119_6_2 + P_1119_6_3 + P_1119_6_4))))) U G ((NotifyEventJobQueuedE_1 + NotifyEventJobQueuedE_2 + NotifyEventJobQueuedE_3 + NotifyEventJobQueuedE_4 + NotifyEventJobQueuedE_5 + NotifyEventJobQueuedE_6 <= PlaceSources_4 + PlaceSources_3 + PlaceSources_2 + PlaceSources_1)))) : A (G ((NOT(X (())) OR (G (X ((P_2579_1_1 + P_2579_1_2 + P_2579_1_3 + P_2579_1_4 + P_2579_2_1 + P_2579_2_2 + P_2579_2_3 + P_2579_2_4 + P_2579_3_1 + P_2579_3_2 + P_2579_3_3 + P_2579_3_4 + P_2579_4_1 + P_2579_4_2 + P_2579_4_3 + P_2579_4_4 + P_2579_5_1 + P_2579_5_2 + P_2579_5_3 + P_2579_5_4 + P_2579_6_1 + P_2579_6_2 + P_2579_6_3 + P_2579_6_4 + 1 <= 0))) U ((Try_Check_Sources_B_1 + Try_Check_Sources_B_2 + Try_Check_Sources_B_3 + Try_Check_Sources_B_4 + Try_Check_Sources_B_5 + Try_Check_Sources_B_6 <= P_1093) OR (DisablePollingE_5_4 + DisablePollingE_5_3 + DisablePollingE_5_2 + DisablePollingE_5_1 + DisablePollingE_1_1 + DisablePollingE_1_2 + DisablePollingE_1_3 + DisablePollingE_1_4 + DisablePollingE_2_1 + DisablePollingE_2_2 + DisablePollingE_2_3 + DisablePollingE_2_4 + DisablePollingE_4_4 + DisablePollingE_4_3 + DisablePollingE_4_2 + DisablePollingE_4_1 + DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_3_3 + DisablePollingE_3_4 + DisablePollingE_6_1 + DisablePollingE_6_2 + DisablePollingE_6_3 + DisablePollingE_6_4 <= MarkerRead)))))) : A ((((DisablePollingE_5_4 + DisablePollingE_5_3 + DisablePollingE_5_2 + DisablePollingE_5_1 + DisablePollingE_1_1 + DisablePollingE_1_2 + DisablePollingE_1_3 + DisablePollingE_1_4 + DisablePollingE_2_1 + DisablePollingE_2_2 + DisablePollingE_2_3 + DisablePollingE_2_4 + DisablePollingE_4_4 + DisablePollingE_4_3 + DisablePollingE_4_2 + DisablePollingE_4_1 + DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_3_3 + DisablePollingE_3_4 + DisablePollingE_6_1 + DisablePollingE_6_2 + DisablePollingE_6_3 + DisablePollingE_6_4 <= Check_Sources_E_1 + Check_Sources_E_2 + Check_Sources_E_3 + Check_Sources_E_4 + Check_Sources_E_5 + Check_Sources_E_6) OR F ((X ((3 <= JobCnt)) U (Perform_Work_E_1 + Perform_Work_E_2 + Perform_Work_E_3 + Perform_Work_E_4 + Perform_Work_E_5 + Perform_Work_E_6 <= Try_Check_Sources_B_1 + Try_Check_Sources_B_2 + Try_Check_Sources_B_3 + Try_Check_Sources_B_4 + Try_Check_Sources_B_5 + Try_Check_Sources_B_6)))) U X (((3 <= JobCnt) OR X ((Check_Sources_E_1 + Check_Sources_E_2 + Check_Sources_E_3 + Check_Sources_E_4 + Check_Sources_E_5 + Check_Sources_E_6 + 1 <= DisablePollingE_5_4 + DisablePollingE_5_3 + DisablePollingE_5_2 + DisablePollingE_5_1 + DisablePollingE_1_1 + DisablePollingE_1_2 + DisablePollingE_1_3 + DisablePollingE_1_4 + DisablePollingE_2_1 + DisablePollingE_2_2 + DisablePollingE_2_3 + DisablePollingE_2_4 + DisablePollingE_4_4 + DisablePollingE_4_3 + DisablePollingE_4_2 + DisablePollingE_4_1 + DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_3_3 + DisablePollingE_3_4 + DisablePollingE_6_1 + DisablePollingE_6_2 + DisablePollingE_6_3 + DisablePollingE_6_4)))))) : A (((F ((0 <= P_1717)) OR NOT(G (((Check_Sources_B_1 + Check_Sources_B_2 + Check_Sources_B_3 + Check_Sources_B_4 + Check_Sources_B_5 + Check_Sources_B_6 <= 1) AND ((JobCnt + 1 <= P_1095)))))) U X (X ((0 <= P_1717))))) : A (F (X (NOT(F ((X ((QueueJobB_5_1 <= Insert_Source_E_6)) OR G (((2 <= P_1158_6) OR F ((QueueJobB_5_1 <= Insert_Source_E_6)))))))))) : A (G (NOT(X (NOT(X ((F ((1 <= cSources)) AND ((FetchJobB_5 <= QueueJobB_1_0) OR G (F ((3 <= nyo_1))))))))))) : A (NOT(G (F (((cBlockedTasks <= ScheduleTaskE_Idle_1) OR (ScheduleTaskE_Idle_5 <= P_1617_6)))))) : A (NOT(X (X ((NOT(((0 <= P_2318_2) U (P_1097 <= QueueJobE_5))) U G ((P_1727 <= cIdleTasks))))))) : A (X ((X (X (NOT(G ((nyo_5 <= QueueJobE_3))))) OR G (((P_1725_1 <= Abort_Check_Sources_B_4) AND X ((1 <= cPollingAbort))))))) : A (F ((F ((0 <= TryAllocateOneTaskB_3)) U X (G ((0 <= TryAllocateOneTaskB_3)))))) : A (((FetchJobB_2 <= cIsMonitoring) OR X (G (NOT(X (F (((RunE_3 <= P_1724_4) U X ((Insert_Source_B_5_2 <= FetchJobE_6_3)))))))))) : A (G ((P_1725_4 <= P_1158_5)))
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:116
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:142
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:329
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:335
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 203 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((F (G (((1 <= DisablePollingE_5_4 + DisablePollingE_5_3 + DisablePollingE_5_2 + DisablePollingE_5_1 + DisablePollingE_1_1 + DisablePollingE_1_2 + DisablePollingE_1_3 + DisablePollingE_1_4 + DisablePollingE_2_1 + DisablePollingE_2_2 + DisablePollingE_2_3 + DisablePollingE_2_4 + DisablePollingE_4_4 + DisablePollingE_4_3 + DisablePollingE_4_2 + DisablePollingE_4_1 + DisablePollingE_3_1 + DisableP... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((F (G (((1 <= DisablePollingE_5_4 + DisablePollingE_5_3 + DisablePollingE_5_2 + DisablePollingE_5_1 + DisablePollingE_1_1 + DisablePollingE_1_2 + DisablePollingE_1_3 + DisablePollingE_1_4 + DisablePollingE_2_1 + DisablePollingE_2_2 + DisablePollingE_2_3 + DisablePollingE_2_4 + DisablePollingE_4_4 + DisablePollingE_4_3 + DisablePollingE_4_2 + DisablePollingE_4_1 + DisablePollingE_3_1 + DisableP... (shortened)
lola: processed formula length: 3356
lola: 118 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 11 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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 217 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((((P_1717 <= ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + ScheduleTaskB_5 + ScheduleTaskB_6) U (P_1725_0 + P_1725_1 + P_1725_2 + P_1725_3 + P_1725_4 <= P_1119_1_1 + P_1119_1_2 + P_1119_1_3 + P_1119_1_4 + P_1119_2_1 + P_1119_2_2 + P_1119_2_3 + P_1119_2_4 + P_1119_3_1 + P_1119_3_2 + P_1119_3_3 + P_1119_3_4 + P_1119_4_1 + P_1119_4_2 + P_1119_4_3 + P_1119_4_4 + P_11... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((((P_1717 <= ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + ScheduleTaskB_5 + ScheduleTaskB_6) U (P_1725_0 + P_1725_1 + P_1725_2 + P_1725_3 + P_1725_4 <= P_1119_1_1 + P_1119_1_2 + P_1119_1_3 + P_1119_1_4 + P_1119_2_1 + P_1119_2_2 + P_1119_2_3 + P_1119_2_4 + P_1119_3_1 + P_1119_3_2 + P_1119_3_3 + P_1119_3_4 + P_1119_4_1 + P_1119_4_2 + P_1119_4_3 + P_1119_4_4 + P_11... (shortened)
lola: processed formula length: 1253
lola: 118 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 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: 2835 markings, 6845 edges
lola: ========================================
lola: subprocess 2 will run for 232 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((P_1724_0 + P_1724_1 + P_1724_2 + P_1724_3 + P_1724_4 <= P_1712_0 + P_1712_1 + P_1712_2 + P_1712_3 + P_1712_4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((P_1724_0 + P_1724_1 + P_1724_2 + P_1724_3 + P_1724_4 <= P_1712_0 + P_1712_1 + P_1712_2 + P_1712_3 + P_1712_4))))
lola: processed formula length: 122
lola: 118 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 3 will run for 250 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((DisablePollingE_5_4 + DisablePollingE_5_3 + DisablePollingE_5_2 + DisablePollingE_5_1 + DisablePollingE_1_1 + DisablePollingE_1_2 + DisablePollingE_1_3 + DisablePollingE_1_4 + DisablePollingE_2_1 + DisablePollingE_2_2 + DisablePollingE_2_3 + DisablePollingE_2_4 + DisablePollingE_4_4 + DisablePollingE_4_3 + DisablePollingE_4_2 + DisablePollingE_4_1 + DisablePollingE_3_1 + DisablePollingE_3_2 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((DisablePollingE_5_4 + DisablePollingE_5_3 + DisablePollingE_5_2 + DisablePollingE_5_1 + DisablePollingE_1_1 + DisablePollingE_1_2 + DisablePollingE_1_3 + DisablePollingE_1_4 + DisablePollingE_2_1 + DisablePollingE_2_2 + DisablePollingE_2_3 + DisablePollingE_2_4 + DisablePollingE_4_4 + DisablePollingE_4_3 + DisablePollingE_4_2 + DisablePollingE_4_1 + DisablePollingE_3_1 + DisablePollingE_3_2 ... (shortened)
lola: processed formula length: 1604
lola: 118 rewrites
lola: closed formula file LTLCardinality.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: 573768 markings, 990452 edges, 114754 markings/sec, 0 secs
lola: 1163941 markings, 2032889 edges, 118035 markings/sec, 5 secs
lola: 1732233 markings, 3092815 edges, 113658 markings/sec, 10 secs
lola: 2310552 markings, 4123577 edges, 115664 markings/sec, 15 secs
lola: 2893615 markings, 5146902 edges, 116613 markings/sec, 20 secs
lola: 3463318 markings, 6208754 edges, 113941 markings/sec, 25 secs
lola: 3992307 markings, 7214875 edges, 105798 markings/sec, 30 secs
lola: 4450483 markings, 8340378 edges, 91635 markings/sec, 35 secs
lola: 5036274 markings, 9366404 edges, 117158 markings/sec, 40 secs
lola: 5621668 markings, 10388398 edges, 117079 markings/sec, 45 secs
lola: 6196834 markings, 11441624 edges, 115033 markings/sec, 50 secs
lola: 6780218 markings, 12480914 edges, 116677 markings/sec, 55 secs
lola: 7344914 markings, 13547656 edges, 112939 markings/sec, 60 secs
lola: 7939791 markings, 14540881 edges, 118975 markings/sec, 65 secs
lola: 8517315 markings, 15554383 edges, 115505 markings/sec, 70 secs
lola: 9084999 markings, 16604091 edges, 113537 markings/sec, 75 secs
lola: 9636954 markings, 17695127 edges, 110391 markings/sec, 80 secs
lola: 10226637 markings, 18678818 edges, 117937 markings/sec, 85 secs
lola: 10777909 markings, 19755508 edges, 110254 markings/sec, 90 secs
lola: 11326059 markings, 20849140 edges, 109630 markings/sec, 95 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 11399461 markings, 20970123 edges
lola: ========================================
lola: subprocess 4 will run for 263 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 118 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 5 will run for 287 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((X ((Insert_Source_E_6 + 1 <= QueueJobB_5_1)) AND F (((P_1158_6 <= 1) AND G ((Insert_Source_E_6 + 1 <= QueueJobB_5_1))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((X ((Insert_Source_E_6 + 1 <= QueueJobB_5_1)) AND F (((P_1158_6 <= 1) AND G ((Insert_Source_E_6 + 1 <= QueueJobB_5_1))))))))
lola: processed formula length: 133
lola: 118 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1079 markings, 1080 edges
lola: ========================================
lola: subprocess 6 will run for 315 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (G ((F ((1 <= cSources)) AND ((FetchJobB_5 <= QueueJobB_1_0) OR G (F ((3 <= nyo_1)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G ((F ((1 <= cSources)) AND ((FetchJobB_5 <= QueueJobB_1_0) OR G (F ((3 <= nyo_1)))))))))
lola: processed formula length: 98
lola: 118 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 377273 markings, 1203687 edges, 75455 markings/sec, 0 secs
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: 610825 markings, 2021981 edges
lola: ========================================
lola: subprocess 7 will run for 349 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X ((F ((cIdleTasks + 1 <= P_1727)) AND (F ((P_1097 <= QueueJobE_5)) OR G (F ((cIdleTasks + 1 <= P_1727))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X ((F ((cIdleTasks + 1 <= P_1727)) AND (F ((P_1097 <= QueueJobE_5)) OR G (F ((cIdleTasks + 1 <= P_1727))))))))
lola: processed formula length: 116
lola: 118 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 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: 703 markings, 703 edges
lola: ========================================
lola: subprocess 8 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((X (X (F ((QueueJobE_3 + 1 <= nyo_5)))) OR G (((P_1725_1 <= Abort_Check_Sources_B_4) AND X ((1 <= cPollingAbort)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((X (X (F ((QueueJobE_3 + 1 <= nyo_5)))) OR G (((P_1725_1 <= Abort_Check_Sources_B_4) AND X ((1 <= cPollingAbort)))))))
lola: processed formula length: 124
lola: 118 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 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: 958 markings, 985 edges
lola: ========================================
lola: subprocess 9 will run for 449 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 118 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 10 will run for 524 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((FetchJobB_2 <= cIsMonitoring) OR X (X (X (G ((FetchJobE_6_3 + 1 <= Insert_Source_B_5_2)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((FetchJobB_2 <= cIsMonitoring) OR X (X (X (G ((FetchJobE_6_3 + 1 <= Insert_Source_B_5_2)))))))
lola: processed formula length: 98
lola: 118 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 629 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((P_1725_4 <= P_1158_5)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((P_1725_4 <= P_1158_5)))
lola: processed formula length: 30
lola: 120 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)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (P_1158_5 + 1 <= P_1725_4)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 12 will run for 787 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((Try_Check_Sources_B_1 + Try_Check_Sources_B_2 + Try_Check_Sources_B_3 + Try_Check_Sources_B_4 + Try_Check_Sources_B_5 + Try_Check_Sources_B_6 <= P_1093) OR (DisablePollingE_5_4 + DisablePollingE_5_3 + DisablePollingE_5_2 + DisablePollingE_5_1 + DisablePollingE_1_1 + DisablePollingE_1_2 + DisablePollingE_1_3 + DisablePollingE_1_4 + DisablePollingE_2_1 + DisablePollingE_2_2 + DisablePolling... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((Try_Check_Sources_B_1 + Try_Check_Sources_B_2 + Try_Check_Sources_B_3 + Try_Check_Sources_B_4 + Try_Check_Sources_B_5 + Try_Check_Sources_B_6 <= P_1093) OR (DisablePollingE_5_4 + DisablePollingE_5_3 + DisablePollingE_5_2 + DisablePollingE_5_1 + DisablePollingE_1_1 + DisablePollingE_1_2 + DisablePollingE_1_3 + DisablePollingE_1_4 + DisablePollingE_2_1 + DisablePollingE_2_2 + DisablePolling... (shortened)
lola: processed formula length: 709
lola: 120 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)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((P_1093 + 1 <= Try_Check_Sources_B_1 + Try_Check_Sources_B_2 + Try_Check_Sources_B_3 + Try_Check_Sources_B_4 + Try_Check_Sources_B_5 + Try_Check_Sources_B_6) AND (MarkerRead + 1 <= DisablePollingE_5_4 + DisablePollingE_5_3 + DisablePollingE_5_2 + DisablePollingE_5_1 + DisablePollingE_1_1 + DisablePollingE_1_2 + DisablePollingE_1_3 + DisablePollingE_1_4 + DisablePollingE_2_1 + DisablePollingE_2_2 + DisablePollingE_2_3 + DisablePollingE_2_4 + DisablePollingE_4_4 + DisablePollingE_4_3 + DisablePollingE_4_2 + DisablePollingE_4_1 + DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_3_3 + DisablePollingE_3_4 + DisablePollingE_6_1 + DisablePollingE_6_2 + DisablePollingE_6_3 + DisablePollingE_6_4))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LTLCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file LTLCardinality-12-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 91522 markings, 97070 edges, 18304 markings/sec, 0 secs
lola: sara is running 5 secs || 186622 markings, 203795 edges, 19020 markings/sec, 5 secs
lola: sara is running 10 secs || 280560 markings, 312578 edges, 18788 markings/sec, 10 secs
lola: sara is running 15 secs || 366651 markings, 413149 edges, 17218 markings/sec, 15 secs
lola: sara is running 20 secs || 459947 markings, 522935 edges, 18659 markings/sec, 20 secs
lola: sara is running 25 secs || 552510 markings, 634157 edges, 18513 markings/sec, 25 secs
lola: sara is running 30 secs || 639437 markings, 738924 edges, 17385 markings/sec, 30 secs
lola: sara is running 35 secs || 731639 markings, 851571 edges, 18440 markings/sec, 35 secs
lola: sara is running 40 secs || 818614 markings, 957835 edges, 17395 markings/sec, 40 secs
lola: sara is running 45 secs || 910660 markings, 1072059 edges, 18409 markings/sec, 45 secs
lola: sara is running 50 secs || 1002089 markings, 1185328 edges, 18286 markings/sec, 50 secs
lola: sara is running 55 secs || 1093757 markings, 1298615 edges, 18334 markings/sec, 55 secs
lola: sara is running 60 secs || 1180372 markings, 1406562 edges, 17323 markings/sec, 60 secs
lola: sara is running 65 secs || 1267523 markings, 1516796 edges, 17430 markings/sec, 65 secs
lola: sara is running 70 secs || 1354329 markings, 1627728 edges, 17361 markings/sec, 70 secs
lola: sara is running 75 secs || 1442237 markings, 1739070 edges, 17582 markings/sec, 75 secs
lola: sara is running 80 secs || 1530523 markings, 1852236 edges, 17657 markings/sec, 80 secs
lola: sara is running 85 secs || 1617782 markings, 1964923 edges, 17452 markings/sec, 85 secs
lola: sara is running 90 secs || 1703942 markings, 2076601 edges, 17232 markings/sec, 90 secs
lola: sara is running 95 secs || 1791815 markings, 2191610 edges, 17575 markings/sec, 95 secs
lola: sara is running 100 secs || 1883897 markings, 2309967 edges, 18416 markings/sec, 100 secs
lola: sara is running 105 secs || 1975993 markings, 2431177 edges, 18419 markings/sec, 105 secs
lola: sara is running 110 secs || 2068620 markings, 2550935 edges, 18525 markings/sec, 110 secs
lola: sara is running 115 secs || 2160976 markings, 2672946 edges, 18471 markings/sec, 115 secs
lola: sara is running 120 secs || 2253744 markings, 2793912 edges, 18554 markings/sec, 120 secs
lola: sara is running 125 secs || 2345928 markings, 2916082 edges, 18437 markings/sec, 125 secs
lola: sara is running 130 secs || 2438408 markings, 3037016 edges, 18496 markings/sec, 130 secs
lola: sara is running 135 secs || 2525579 markings, 3151317 edges, 17434 markings/sec, 135 secs
lola: sara is running 140 secs || 2617728 markings, 3273718 edges, 18430 markings/sec, 140 secs
lola: sara is running 145 secs || 2706750 markings, 3390956 edges, 17804 markings/sec, 145 secs
lola: sara is running 150 secs || 2792730 markings, 3505251 edges, 17196 markings/sec, 150 secs
lola: sara is running 155 secs || 2882580 markings, 3625658 edges, 17970 markings/sec, 155 secs
lola: sara is running 160 secs || 2975211 markings, 3748190 edges, 18526 markings/sec, 160 secs
lola: sara is running 165 secs || 3067633 markings, 3871437 edges, 18484 markings/sec, 165 secs
lola: sara is running 170 secs || 3159991 markings, 3995195 edges, 18472 markings/sec, 170 secs
lola: sara is running 175 secs || 3251994 markings, 4119242 edges, 18401 markings/sec, 175 secs
lola: sara is running 180 secs || 3344166 markings, 4243239 edges, 18434 markings/sec, 180 secs
lola: sara is running 185 secs || 3437098 markings, 4367623 edges, 18586 markings/sec, 185 secs
lola: sara is running 190 secs || 3529927 markings, 4493551 edges, 18566 markings/sec, 190 secs
lola: sara is running 195 secs || 3622760 markings, 4618988 edges, 18567 markings/sec, 195 secs
lola: sara is running 200 secs || 3715682 markings, 4743087 edges, 18584 markings/sec, 200 secs
lola: sara is running 205 secs || 3808477 markings, 4866980 edges, 18559 markings/sec, 205 secs
lola: sara is running 210 secs || 3901140 markings, 4991827 edges, 18533 markings/sec, 210 secs
lola: sara is running 215 secs || 3994713 markings, 5117930 edges, 18715 markings/sec, 215 secs
lola: sara is running 220 secs || 4087330 markings, 5244352 edges, 18523 markings/sec, 220 secs
lola: sara is running 225 secs || 4179704 markings, 5369795 edges, 18475 markings/sec, 225 secs
lola: sara is running 230 secs || 4272354 markings, 5494067 edges, 18530 markings/sec, 230 secs
lola: sara is running 235 secs || 4365077 markings, 5619345 edges, 18545 markings/sec, 235 secs
lola: sara is running 240 secs || 4457915 markings, 5745922 edges, 18568 markings/sec, 240 secs
lola: sara is running 245 secs || 4548676 markings, 5869852 edges, 18152 markings/sec, 245 secs
lola: sara is running 250 secs || 4634025 markings, 5987555 edges, 17070 markings/sec, 250 secs
lola: sara is running 255 secs || 4724369 markings, 6112899 edges, 18069 markings/sec, 255 secs
lola: sara is running 260 secs || 4817445 markings, 6239952 edges, 18615 markings/sec, 260 secs
lola: sara is running 265 secs || 4910416 markings, 6366899 edges, 18594 markings/sec, 265 secs
lola: sara is running 270 secs || 5003356 markings, 6492993 edges, 18588 markings/sec, 270 secs
lola: sara is running 275 secs || 5096918 markings, 6618571 edges, 18712 markings/sec, 275 secs
lola: sara is running 280 secs || 5190232 markings, 6744273 edges, 18663 markings/sec, 280 secs
lola: sara is running 285 secs || 5282952 markings, 6872045 edges, 18544 markings/sec, 285 secs
lola: sara is running 290 secs || 5375582 markings, 6999227 edges, 18526 markings/sec, 290 secs
lola: sara is running 295 secs || 5467811 markings, 7127257 edges, 18446 markings/sec, 295 secs
lola: sara is running 300 secs || 5560647 markings, 7253817 edges, 18567 markings/sec, 300 secs
lola: sara is running 305 secs || 5654254 markings, 7380720 edges, 18721 markings/sec, 305 secs
lola: sara is running 310 secs || 5747091 markings, 7506682 edges, 18567 markings/sec, 310 secs
lola: sara is running 315 secs || 5839946 markings, 7636550 edges, 18571 markings/sec, 315 secs
lola: sara is running 320 secs || 5932907 markings, 7764771 edges, 18592 markings/sec, 320 secs
lola: sara is running 325 secs || 6025493 markings, 7892343 edges, 18517 markings/sec, 325 secs
lola: sara is running 330 secs || 6118948 markings, 8019785 edges, 18691 markings/sec, 330 secs
lola: sara is running 335 secs || 6212161 markings, 8147673 edges, 18643 markings/sec, 335 secs
lola: sara is running 340 secs || 6304932 markings, 8275187 edges, 18554 markings/sec, 340 secs
lola: sara is running 345 secs || 6386153 markings, 8388073 edges, 16244 markings/sec, 345 secs
lola: sara is running 350 secs || 6479807 markings, 8514374 edges, 18731 markings/sec, 350 secs
lola: sara is running 355 secs || 6574091 markings, 8642064 edges, 18857 markings/sec, 355 secs
lola: sara is running 360 secs || 6667387 markings, 8768320 edges, 18659 markings/sec, 360 secs
lola: sara is running 365 secs || 6761457 markings, 8899523 edges, 18814 markings/sec, 365 secs
lola: sara is running 370 secs || 6847140 markings, 9018117 edges, 17137 markings/sec, 370 secs

lola: sara is running 375 secs || 6938635 markings, 9143683 edges, 18299 markings/sec, 375 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 13 will run for 923 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G (((ScheduleTaskE_Idle_1 + 1 <= cBlockedTasks) AND (P_1617_6 + 1 <= ScheduleTaskE_Idle_5)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (((ScheduleTaskE_Idle_1 + 1 <= cBlockedTasks) AND (P_1617_6 + 1 <= ScheduleTaskE_Idle_5)))))
lola: processed formula length: 100
lola: 118 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: 429 markings, 430 edges
lola: ========================================
lola: subprocess 14 will run for 1384 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((P_1724_0 + P_1724_1 + P_1724_2 + P_1724_3 + P_1724_4 <= QueueJobE_1 + QueueJobE_2 + QueueJobE_3 + QueueJobE_4 + QueueJobE_5 + QueueJobE_6) OR F ((ScheduleTaskE_Idle_1 + ScheduleTaskE_Idle_2 + ScheduleTaskE_Idle_3 + ScheduleTaskE_Idle_4 + ScheduleTaskE_Idle_5 + ScheduleTaskE_Idle_6 <= RunE_1 + RunE_2 + RunE_3 + RunE_4 + RunE_5 + RunE_6))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((P_1724_0 + P_1724_1 + P_1724_2 + P_1724_3 + P_1724_4 <= QueueJobE_1 + QueueJobE_2 + QueueJobE_3 + QueueJobE_4 + QueueJobE_5 + QueueJobE_6) OR F ((ScheduleTaskE_Idle_1 + ScheduleTaskE_Idle_2 + ScheduleTaskE_Idle_3 + ScheduleTaskE_Idle_4 + ScheduleTaskE_Idle_5 + ScheduleTaskE_Idle_6 <= RunE_1 + RunE_2 + RunE_3 + RunE_4 + RunE_5 + RunE_6))))
lola: processed formula length: 345
lola: 118 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 2769 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((PlaceSources_4 + PlaceSources_3 + PlaceSources_2 + PlaceSources_1 + 1 <= NotifyEventJobQueuedE_1 + NotifyEventJobQueuedE_2 + NotifyEventJobQueuedE_3 + NotifyEventJobQueuedE_4 + NotifyEventJobQueuedE_5 + NotifyEventJobQueuedE_6) AND F ((nyo_1 + nyo_2 + nyo_3 + nyo_4 + nyo_5 + nyo_6 <= P_1119_1_1 + P_1119_1_2 + P_1119_1_3 + P_1119_1_4 + P_1119_2_1 + P_1119_2_2 + P_1119_2_3 + P_1119_2_4 + P_111... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((PlaceSources_4 + PlaceSources_3 + PlaceSources_2 + PlaceSources_1 + 1 <= NotifyEventJobQueuedE_1 + NotifyEventJobQueuedE_2 + NotifyEventJobQueuedE_3 + NotifyEventJobQueuedE_4 + NotifyEventJobQueuedE_5 + NotifyEventJobQueuedE_6) AND F ((nyo_1 + nyo_2 + nyo_3 + nyo_4 + nyo_5 + nyo_6 <= P_1119_1_1 + P_1119_1_2 + P_1119_1_3 + P_1119_1_4 + P_1119_2_1 + P_1119_2_2 + P_1119_2_3 + P_1119_2_4 + P_111... (shortened)
lola: processed formula length: 836
lola: 118 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 524 markings, 524 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no yes no yes yes yes no no no no no yes yes no
lola:
preliminary result: yes yes no yes no yes yes yes no no no no no yes yes no
lola: memory consumption: 127552 KB
lola: time consumption: 801 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1590271271850

--------------------
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="PolyORBLF-PT-S04J04T06"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="win2019"
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 win2019"
echo " Input is PolyORBLF-PT-S04J04T06, 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 r135-tajo-158961408900115"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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