Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.0M
-rw-r--r-- 1 mcc users 3.6K Apr 7 20:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 7 20:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 6 22:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 6 22:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 14 12:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 14 12:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 6 05:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Apr 6 05:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 5 12:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 5 12:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 6 20:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 6 20:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 2.9M 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 JoinFreeModules-PT-0500-00
FORMULA_NAME JoinFreeModules-PT-0500-01
FORMULA_NAME JoinFreeModules-PT-0500-02
FORMULA_NAME JoinFreeModules-PT-0500-03
FORMULA_NAME JoinFreeModules-PT-0500-04
FORMULA_NAME JoinFreeModules-PT-0500-05
FORMULA_NAME JoinFreeModules-PT-0500-06
FORMULA_NAME JoinFreeModules-PT-0500-07
FORMULA_NAME JoinFreeModules-PT-0500-08
FORMULA_NAME JoinFreeModules-PT-0500-09
FORMULA_NAME JoinFreeModules-PT-0500-10
FORMULA_NAME JoinFreeModules-PT-0500-11
FORMULA_NAME JoinFreeModules-PT-0500-12
FORMULA_NAME JoinFreeModules-PT-0500-13
FORMULA_NAME JoinFreeModules-PT-0500-14
FORMULA_NAME JoinFreeModules-PT-0500-15

=== Now, execution of the tool begins

BK_START 1591208308955

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 18:18:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 18:18:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 18:18:31] [INFO ] Load time of PNML (sax parser for PT used): 240 ms
[2020-06-03 18:18:31] [INFO ] Transformed 2501 places.
[2020-06-03 18:18:31] [INFO ] Transformed 4001 transitions.
[2020-06-03 18:18:31] [INFO ] Parsed PT model containing 2501 places and 4001 transitions in 294 ms.
Reduce places removed 1 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 93 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100373 steps, including 0 resets, run finished after 2292 ms. (steps per millisecond=43 ) properties seen :[0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 4001 rows 2500 cols
[2020-06-03 18:18:34] [INFO ] Computed 500 place invariants in 77 ms
[2020-06-03 18:18:35] [INFO ] [Real]Absence check using 500 positive place invariants in 1039 ms returned sat
[2020-06-03 18:18:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:18:54] [INFO ] [Real]Absence check using state equation in 18451 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 18:18:54] [INFO ] [Real]Absence check using 500 positive place invariants in 448 ms returned sat
[2020-06-03 18:18:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:19:14] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (= s2140 (- (+ 2 t3427 (* 3 t3429) (* 2 t3431)) (+ (* 3 t3425) (* 3 t3430))))") while checking expression at index 1
[2020-06-03 18:19:16] [INFO ] [Real]Absence check using 500 positive place invariants in 1816 ms returned sat
[2020-06-03 18:19:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:19:34] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:19:34] [INFO ] [Real]Absence check using state equation in 18001 ms returned (error "Failed to check-sat")
[2020-06-03 18:19:36] [INFO ] [Real]Absence check using 500 positive place invariants in 1821 ms returned sat
[2020-06-03 18:19:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:19:54] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:19:54] [INFO ] [Real]Absence check using state equation in 18031 ms returned (error "Failed to check-sat")
[2020-06-03 18:19:55] [INFO ] [Real]Absence check using 500 positive place invariants in 908 ms returned sat
[2020-06-03 18:19:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:20:14] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:20:14] [INFO ] [Real]Absence check using state equation in 18767 ms returned (error "Failed to check-sat")
[2020-06-03 18:20:15] [INFO ] [Real]Absence check using 500 positive place invariants in 716 ms returned sat
[2020-06-03 18:20:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:20:34] [INFO ] [Real]Absence check using state equation in 18969 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 18:20:36] [INFO ] [Real]Absence check using 500 positive place invariants in 1921 ms returned sat
[2020-06-03 18:20:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:20:54] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:20:54] [INFO ] [Real]Absence check using state equation in 17655 ms returned (error "Failed to check-sat")
[2020-06-03 18:20:56] [INFO ] [Real]Absence check using 500 positive place invariants in 1451 ms returned sat
[2020-06-03 18:20:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:21:14] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:21:14] [INFO ] [Real]Absence check using state equation in 18204 ms returned (error "Failed to check-sat")
[2020-06-03 18:21:15] [INFO ] [Real]Absence check using 500 positive place invariants in 522 ms returned sat
[2020-06-03 18:21:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:21:34] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:21:34] [INFO ] [Real]Absence check using state equation in 19315 ms returned unknown
[2020-06-03 18:21:34] [INFO ] [Real]Absence check using 500 positive place invariants in 429 ms returned sat
[2020-06-03 18:21:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:21:54] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:21:54] [INFO ] [Real]Absence check using state equation in 19446 ms returned (error "Failed to check-sat")
[2020-06-03 18:21:55] [INFO ] [Real]Absence check using 500 positive place invariants in 1102 ms returned sat
[2020-06-03 18:21:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:22:14] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:22:14] [INFO ] [Real]Absence check using state equation in 18754 ms returned (error "Failed to check-sat")
[2020-06-03 18:22:16] [INFO ] [Real]Absence check using 500 positive place invariants in 1365 ms returned sat
[2020-06-03 18:22:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:22:34] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:22:34] [INFO ] [Real]Absence check using state equation in 18393 ms returned unknown
[2020-06-03 18:22:35] [INFO ] [Real]Absence check using 500 positive place invariants in 453 ms returned sat
[2020-06-03 18:22:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:22:54] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:22:54] [INFO ] [Real]Absence check using state equation in 19406 ms returned (error "Failed to check-sat")
[2020-06-03 18:22:56] [INFO ] [Real]Absence check using 500 positive place invariants in 1191 ms returned sat
[2020-06-03 18:22:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:23:14] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:23:14] [INFO ] [Real]Absence check using state equation in 18456 ms returned (error "Failed to check-sat")
[2020-06-03 18:23:16] [INFO ] [Real]Absence check using 500 positive place invariants in 1582 ms returned sat
[2020-06-03 18:23:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:23:34] [INFO ] [Real]Absence check using state equation in 18283 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 18:23:35] [INFO ] [Real]Absence check using 500 positive place invariants in 831 ms returned sat
[2020-06-03 18:23:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:23:54] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:23:54] [INFO ] [Real]Absence check using state equation in 18838 ms returned (error "Failed to check-sat")
[2020-06-03 18:23:55] [INFO ] [Real]Absence check using 500 positive place invariants in 972 ms returned sat
[2020-06-03 18:23:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:24:14] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:24:14] [INFO ] [Real]Absence check using state equation in 18928 ms returned (error "Failed to check-sat")
[2020-06-03 18:24:16] [INFO ] [Real]Absence check using 500 positive place invariants in 1185 ms returned sat
[2020-06-03 18:24:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:24:34] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:24:34] [INFO ] [Real]Absence check using state equation in 18646 ms returned (error "Failed to check-sat")
[2020-06-03 18:24:38] [INFO ] [Real]Absence check using 500 positive place invariants in 3163 ms returned sat
[2020-06-03 18:24:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:24:54] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:24:54] [INFO ] [Real]Absence check using state equation in 16516 ms returned (error "Failed to check-sat")
[2020-06-03 18:24:56] [INFO ] [Real]Absence check using 500 positive place invariants in 1231 ms returned sat
[2020-06-03 18:24:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:25:14] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:25:14] [INFO ] [Real]Absence check using state equation in 18418 ms returned (error "Failed to check-sat")
[2020-06-03 18:25:15] [INFO ] [Real]Absence check using 500 positive place invariants in 517 ms returned sat
[2020-06-03 18:25:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:25:34] [INFO ] [Real]Absence check using state equation in 19364 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 18:25:37] [INFO ] [Real]Absence check using 500 positive place invariants in 2244 ms returned sat
[2020-06-03 18:25:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:25:54] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:25:54] [INFO ] [Real]Absence check using state equation in 17417 ms returned (error "Failed to check-sat")
[2020-06-03 18:25:55] [INFO ] [Real]Absence check using 500 positive place invariants in 750 ms returned sat
[2020-06-03 18:25:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:26:14] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:26:14] [INFO ] [Real]Absence check using state equation in 19118 ms returned (error "Failed to check-sat")
[2020-06-03 18:26:16] [INFO ] [Real]Absence check using 500 positive place invariants in 1358 ms returned sat
[2020-06-03 18:26:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:26:34] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:26:34] [INFO ] [Real]Absence check using state equation in 18526 ms returned unknown
[2020-06-03 18:26:37] [INFO ] [Real]Absence check using 500 positive place invariants in 2003 ms returned sat
[2020-06-03 18:26:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:26:54] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:26:54] [INFO ] [Real]Absence check using state equation in 17652 ms returned unknown
[2020-06-03 18:26:56] [INFO ] [Real]Absence check using 500 positive place invariants in 971 ms returned sat
[2020-06-03 18:26:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:27:15] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:27:15] [INFO ] [Real]Absence check using state equation in 18790 ms returned (error "Failed to check-sat")
[2020-06-03 18:27:16] [INFO ] [Real]Absence check using 500 positive place invariants in 1549 ms returned sat
[2020-06-03 18:27:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:27:35] [INFO ] [Real]Absence check using state equation in 18294 ms returned sat
[2020-06-03 18:27:41] [INFO ] Deduced a trap composed of 3 places in 6658 ms
[2020-06-03 18:27:41] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s1855 s1858 s1859) 0)") while checking expression at index 26
[2020-06-03 18:27:44] [INFO ] [Real]Absence check using 500 positive place invariants in 1989 ms returned sat
[2020-06-03 18:27:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:28:01] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:28:01] [INFO ] [Real]Absence check using state equation in 17564 ms returned (error "Failed to check-sat")
[2020-06-03 18:28:04] [INFO ] [Real]Absence check using 500 positive place invariants in 2041 ms returned sat
[2020-06-03 18:28:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:28:21] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:28:21] [INFO ] [Real]Absence check using state equation in 17638 ms returned (error "Failed to check-sat")
[2020-06-03 18:28:24] [INFO ] [Real]Absence check using 500 positive place invariants in 2124 ms returned sat
[2020-06-03 18:28:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:28:41] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:28:41] [INFO ] [Real]Absence check using state equation in 17576 ms returned (error "Failed to check-sat")
[2020-06-03 18:28:44] [INFO ] [Real]Absence check using 500 positive place invariants in 1978 ms returned sat
[2020-06-03 18:28:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:29:01] [INFO ] [Real]Absence check using state equation in 17699 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 18:29:04] [INFO ] [Real]Absence check using 500 positive place invariants in 2105 ms returned sat
[2020-06-03 18:29:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:29:21] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:29:21] [INFO ] [Real]Absence check using state equation in 17604 ms returned (error "Failed to check-sat")
[2020-06-03 18:29:24] [INFO ] [Real]Absence check using 500 positive place invariants in 1865 ms returned sat
[2020-06-03 18:29:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:29:41] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:29:41] [INFO ] [Real]Absence check using state equation in 17835 ms returned (error "Failed to check-sat")
[2020-06-03 18:29:43] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-03 18:29:43] [INFO ] Flatten gal took : 806 ms
FORMULA JoinFreeModules-PT-0500-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0500-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0500-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0500-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 18:29:43] [INFO ] Flatten gal took : 370 ms
[2020-06-03 18:29:44] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 13 ms.
[2020-06-03 18:29:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 50 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ JoinFreeModules-PT-0500 @ 3570 seconds

FORMULA JoinFreeModules-PT-0500-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0500-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0500-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0500-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0500-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0500-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0500-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0500-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0500-01 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0500-04 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0500-09 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0500-06 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1762
rslt: Output for LTLFireability @ JoinFreeModules-PT-0500

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 18:29:45 2020
",
"timelimit": 3570
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 311
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 5,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (X (X (X (G ((X ((3 <= p998)) AND (3 <= p998)))))))",
"processed_size": 53,
"rewrites": 81
},
"result":
{
"edges": 1502,
"markings": 1502,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 348
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 2,
"X": 2,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 4,
"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": 3,
"visible_transitions": 0
},
"processed": "X ((((1 <= p412) U G ((3 <= p1668))) U X (((3 <= p1668) OR (2 <= p692)))))",
"processed_size": 75,
"rewrites": 81
},
"result":
{
"edges": 2004003,
"markings": 1005004,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 10
},
"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": 385
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 4,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((G ((X ((p2233 <= 3)) AND (F ((p2306 <= 1)) OR X (G ((p2233 <= 3)))))) AND (X ((4 <= p2233)) OR (2 <= p1581))))",
"processed_size": 114,
"rewrites": 81
},
"result":
{
"edges": 1502,
"markings": 1502,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 487
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (F (((G ((5 <= p2190)) OR (p1108 <= 2)) AND (((p422 <= 0) R (5 <= p2190)) OR (p422 <= 0)))))",
"processed_size": 94,
"rewrites": 81
},
"result":
{
"edges": 1509,
"markings": 1509,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 585
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 5,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((X (X (X ((X (G ((3 <= p2170))) AND F ((3 <= p218)))))) OR (5 <= p2340)))",
"processed_size": 76,
"rewrites": 81
},
"result":
{
"edges": 1502,
"markings": 1502,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 731
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((F (((5 <= p1624) OR (p574 <= 4))) U X (F ((5 <= p2059)))))",
"processed_size": 63,
"rewrites": 81
},
"result":
{
"edges": 1502,
"markings": 1502,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 975
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F ((2 <= p1481)))",
"processed_size": 20,
"rewrites": 81
},
"result":
{
"edges": 65,
"markings": 65,
"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": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1462
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F ((3 <= p473)))",
"processed_size": 19,
"rewrites": 81
},
"result":
{
"edges": 65,
"markings": 65,
"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": "fairness",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 3296,
"runtime": 1808.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X(X(X(X(G((X(**) AND **)))))) AND **) : X((G(*) AND (** AND F((** OR **))))) : G(F(**)) : F(G(((X(**) U **) AND (F(**) OR **)))) : X(((** U G(**)) U X(**))) : F((G(*) AND **)) : X((G((X(*) AND (F(*) OR X(G(*))))) AND (X(**) OR **))) : X((* R X(G(*)))) : X(F(((G(*) OR **) AND ((* R *) OR **)))) : G(F(**)) : X((X(X(X((X(G(**)) AND F(**))))) OR **)) : X((F(**) U X(F(**))))"
},
"net":
{
"arcs": 11500,
"conflict_clusters": 2001,
"places": 2500,
"places_significant": 2000,
"singleton_clusters": 0,
"transitions": 4001
},
"result":
{
"preliminary_value": "no unknown no unknown yes unknown no unknown no no no no ",
"value": "no unknown no unknown yes unknown no unknown no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 6501/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 80000
lola: finding significant places
lola: 2500 places, 4001 transitions, 2000 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLFireability.xml
lola: (G (X (G (X (X (X ((X ((3 <= p998)) AND (3 <= p998)))))))) AND (p998 <= 2)) : (X ((NOT(F ((4 <= p703))) AND (p703 <= 3))) AND F ((F (X ((2 <= p352))) OR X (F ((1 <= p2397)))))) : G (F ((2 <= p1481))) : F (G (((X ((p1054 <= 4)) U (2 <= p747)) AND (F ((2 <= p747)) OR (p747 <= 1))))) : X ((((1 <= p412) U G ((3 <= p1668))) U X (((3 <= p1668) OR (2 <= p692))))) : F ((NOT(F ((2 <= p1786))) AND (p1786 <= 1))) : X ((G (NOT((G ((2 <= p2306)) U X ((4 <= p2233))))) AND (X ((4 <= p2233)) OR (2 <= p1581)))) : NOT((X ((5 <= p449)) U X (F (X (((2 <= p32) U ((2 <= p32) AND (2 <= p646)))))))) : X (F (((NOT(F ((p2190 <= 4))) OR (p1108 <= 2)) AND (NOT(((1 <= p422) U (p2190 <= 4))) OR (p422 <= 0))))) : G (X (NOT(G (X (G (NOT(F (X ((3 <= p473)))))))))) : (X (X ((G (X (X (X ((3 <= p2170))))) AND X (F (X ((3 <= p218))))))) OR X ((5 <= p2340))) : (F (NOT(X (G (NOT(F (((5 <= p1624) OR (p574 <= 4)))))))) U F (X (X ((5 <= p2059)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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: 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:528
lola: rewrite Frontend/Parser/formula_rewrite.k:519
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:356
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:356
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:350
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: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:525
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 285 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (X (X (G ((X ((3 <= p998)) AND (3 <= p998))))))) AND (p998 <= 2))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 285 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p998 <= 2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p998 <= 2)
lola: processed formula length: 11
lola: 81 rewrites
lola: closed formula file LTLFireability.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 1 will run for 311 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (X (G ((X ((3 <= p998)) AND (3 <= p998)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (X (G ((X ((3 <= p998)) AND (3 <= p998)))))))
lola: processed formula length: 53
lola: 81 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1502 markings, 1502 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 311 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((p703 <= 3)) AND ((p703 <= 3) AND F (((2 <= p352) OR (1 <= p2397))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((p703 <= 3)) AND ((p703 <= 3) AND F (((2 <= p352) OR (1 <= p2397))))))
lola: processed formula length: 77
lola: 81 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 232343 markings, 331433 edges, 46469 markings/sec, 0 secs
lola: 464556 markings, 662641 edges, 46443 markings/sec, 5 secs
lola: 695772 markings, 993236 edges, 46243 markings/sec, 10 secs
lola: 924500 markings, 1319466 edges, 45746 markings/sec, 15 secs
lola: 1151316 markings, 1643476 edges, 45363 markings/sec, 20 secs
lola: 1372560 markings, 1958919 edges, 44249 markings/sec, 25 secs
lola: 1596157 markings, 2278356 edges, 44719 markings/sec, 30 secs
lola: 1818827 markings, 2596232 edges, 44534 markings/sec, 35 secs
lola: 2043204 markings, 2916784 edges, 44875 markings/sec, 40 secs
lola: 2268819 markings, 3239004 edges, 45123 markings/sec, 45 secs
lola: 2494275 markings, 3560630 edges, 45091 markings/sec, 50 secs
lola: 2717770 markings, 3879949 edges, 44699 markings/sec, 55 secs
lola: 2941179 markings, 4198719 edges, 44682 markings/sec, 60 secs
lola: 3034022 markings, 4331309 edges, 18569 markings/sec, 65 secs
lola: 3052674 markings, 4358417 edges, 3730 markings/sec, 70 secs
lola: 3088576 markings, 4408831 edges, 7180 markings/sec, 75 secs
lola: 3124373 markings, 4460253 edges, 7159 markings/sec, 80 secs
lola: 3162572 markings, 4514759 edges, 7640 markings/sec, 85 secs
lola: 3203231 markings, 4572451 edges, 8132 markings/sec, 90 secs
lola: 3235478 markings, 4618787 edges, 6449 markings/sec, 95 secs
lola: 3265946 markings, 4662011 edges, 6094 markings/sec, 100 secs
lola: 3316425 markings, 4734641 edges, 10096 markings/sec, 105 secs
lola: 3350817 markings, 4783613 edges, 6878 markings/sec, 110 secs
lola: 3393074 markings, 4844082 edges, 8451 markings/sec, 115 secs
lola: 3428250 markings, 4894139 edges, 7035 markings/sec, 120 secs
lola: 3472811 markings, 4957835 edges, 8912 markings/sec, 125 secs
lola: 3511619 markings, 5013225 edges, 7762 markings/sec, 130 secs
lola: 3575398 markings, 5103791 edges, 12756 markings/sec, 135 secs
lola: 3685993 markings, 5262012 edges, 22119 markings/sec, 140 secs
lola: 3765163 markings, 5375219 edges, 15834 markings/sec, 145 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 327 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((X ((p1054 <= 4)) U (2 <= p747)) AND (F ((2 <= p747)) OR (p747 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((X ((p1054 <= 4)) U (2 <= p747)) AND (F ((2 <= p747)) OR (p747 <= 1)))))
lola: processed formula length: 79
lola: 81 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 207531 markings, 295872 edges, 41506 markings/sec, 0 secs
lola: 430889 markings, 614951 edges, 44672 markings/sec, 5 secs
lola: 653403 markings, 932554 edges, 44503 markings/sec, 10 secs
lola: 876216 markings, 1250682 edges, 44563 markings/sec, 15 secs
lola: 1098659 markings, 1568158 edges, 44489 markings/sec, 20 secs
lola: 1320391 markings, 1884425 edges, 44346 markings/sec, 25 secs
lola: 1542080 markings, 2201359 edges, 44338 markings/sec, 30 secs
lola: 1759898 markings, 2512175 edges, 43564 markings/sec, 35 secs
lola: 1982264 markings, 2829519 edges, 44473 markings/sec, 40 secs
lola: 2202334 markings, 3143968 edges, 44014 markings/sec, 45 secs
lola: 2426369 markings, 3463656 edges, 44807 markings/sec, 50 secs
lola: 2650550 markings, 3783631 edges, 44836 markings/sec, 55 secs
lola: 2875639 markings, 4104908 edges, 45018 markings/sec, 60 secs
lola: 3058743 markings, 4367158 edges, 36621 markings/sec, 65 secs
lola: 3094219 markings, 4417245 edges, 7095 markings/sec, 70 secs
lola: 3119446 markings, 4452888 edges, 5045 markings/sec, 75 secs
lola: 3144926 markings, 4489497 edges, 5096 markings/sec, 80 secs
lola: 3191300 markings, 4555993 edges, 9275 markings/sec, 85 secs
lola: 3252382 markings, 4642765 edges, 12216 markings/sec, 90 secs
lola: 3290358 markings, 4696881 edges, 7595 markings/sec, 95 secs
lola: 3326004 markings, 4748047 edges, 7129 markings/sec, 100 secs
lola: 3376219 markings, 4819787 edges, 10043 markings/sec, 105 secs
lola: 3488827 markings, 4980257 edges, 22522 markings/sec, 110 secs
lola: 3538335 markings, 5051187 edges, 9902 markings/sec, 115 secs
lola: 3595533 markings, 5132857 edges, 11440 markings/sec, 120 secs
lola: 3642438 markings, 5199720 edges, 9381 markings/sec, 125 secs
lola: 3739673 markings, 5338466 edges, 19447 markings/sec, 130 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 348 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((1 <= p412) U G ((3 <= p1668))) U X (((3 <= p1668) OR (2 <= p692)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((1 <= p412) U G ((3 <= p1668))) U X (((3 <= p1668) OR (2 <= p692)))))
lola: processed formula length: 75
lola: 81 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 10 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: 222241 markings, 236046 edges, 44448 markings/sec, 0 secs
lola: 385253 markings, 431693 edges, 32602 markings/sec, 5 secs
lola: 537199 markings, 639006 edges, 30389 markings/sec, 10 secs
lola: 660194 markings, 833664 edges, 24599 markings/sec, 15 secs
lola: 756352 markings, 1010872 edges, 19232 markings/sec, 20 secs
lola: 837763 markings, 1192090 edges, 16282 markings/sec, 25 secs
lola: 897328 markings, 1354980 edges, 11913 markings/sec, 30 secs
lola: 945165 markings, 1524266 edges, 9567 markings/sec, 35 secs
lola: 977883 markings, 1688279 edges, 6544 markings/sec, 40 secs
lola: 1004852 markings, 1982620 edges, 5394 markings/sec, 45 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: 1005004 markings, 2004003 edges
lola: ========================================
lola: subprocess 4 will run for 385 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((X ((p2233 <= 3)) AND (F ((p2306 <= 1)) OR X (G ((p2233 <= 3)))))) AND (X ((4 <= p2233)) OR (2 <= p1581))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((X ((p2233 <= 3)) AND (F ((p2306 <= 1)) OR X (G ((p2233 <= 3)))))) AND (X ((4 <= p2233)) OR (2 <= p1581))))
lola: processed formula length: 114
lola: 81 rewrites
lola: closed formula file LTLFireability.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: 1502 markings, 1502 edges
lola: ========================================
lola: subprocess 5 will run for 440 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((p449 <= 4) R X (G (((p32 <= 1) OR (p646 <= 1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p449 <= 4) R X (G (((p32 <= 1) OR (p646 <= 1))))))
lola: processed formula length: 56
lola: 81 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 223485 markings, 318729 edges, 44697 markings/sec, 0 secs
lola: 450286 markings, 642264 edges, 45360 markings/sec, 5 secs
lola: 674747 markings, 963170 edges, 44892 markings/sec, 10 secs
lola: 891686 markings, 1272670 edges, 43388 markings/sec, 15 secs
lola: 1116608 markings, 1593953 edges, 44984 markings/sec, 20 secs
lola: 1340501 markings, 1913465 edges, 44779 markings/sec, 25 secs
lola: 1566768 markings, 2236470 edges, 45253 markings/sec, 30 secs
lola: 1791972 markings, 2558209 edges, 45041 markings/sec, 35 secs
lola: 2013071 markings, 2873335 edges, 44220 markings/sec, 40 secs
lola: 2233579 markings, 3188549 edges, 44102 markings/sec, 45 secs
lola: 2450548 markings, 3498251 edges, 43394 markings/sec, 50 secs
lola: 2675969 markings, 3820260 edges, 45084 markings/sec, 55 secs
lola: 2897827 markings, 4136717 edges, 44372 markings/sec, 60 secs
lola: 3058111 markings, 4365668 edges, 32057 markings/sec, 65 secs
lola: 3143399 markings, 4487289 edges, 17058 markings/sec, 70 secs
lola: 3206676 markings, 4577362 edges, 12655 markings/sec, 75 secs
lola: 3246289 markings, 4634343 edges, 7923 markings/sec, 80 secs
lola: 3282302 markings, 4685688 edges, 7203 markings/sec, 85 secs
lola: 3312394 markings, 4728719 edges, 6018 markings/sec, 90 secs
lola: 3358744 markings, 4794871 edges, 9270 markings/sec, 95 secs
lola: 3405406 markings, 4861193 edges, 9332 markings/sec, 100 secs
lola: 3440857 markings, 4912013 edges, 7090 markings/sec, 105 secs
lola: 3486074 markings, 4976562 edges, 9043 markings/sec, 110 secs
lola: 3520473 markings, 5025544 edges, 6880 markings/sec, 115 secs
lola: 3561154 markings, 5083593 edges, 8136 markings/sec, 120 secs
lola: 3611043 markings, 5154870 edges, 9978 markings/sec, 125 secs
lola: 3646142 markings, 5205084 edges, 7020 markings/sec, 130 secs
lola: 3679204 markings, 5252247 edges, 6612 markings/sec, 135 secs
lola: 3701449 markings, 5283920 edges, 4449 markings/sec, 140 secs
lola: 3747477 markings, 5349878 edges, 9206 markings/sec, 145 secs
lola: 3773310 markings, 5386531 edges, 5167 markings/sec, 150 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 487 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((G ((5 <= p2190)) OR (p1108 <= 2)) AND (((p422 <= 0) R (5 <= p2190)) OR (p422 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((G ((5 <= p2190)) OR (p1108 <= 2)) AND (((p422 <= 0) R (5 <= p2190)) OR (p422 <= 0)))))
lola: processed formula length: 94
lola: 81 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1509 markings, 1509 edges
lola: subprocess 7 will run for 585 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X ((X (X (X ((X (G ((3 <= p2170))) AND F ((3 <= p218)))))) OR (5 <= p2340)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (X (X ((X (G ((3 <= p2170))) AND F ((3 <= p218)))))) OR (5 <= p2340)))
lola: processed formula length: 76
lola: 81 rewrites
lola: closed formula file LTLFireability.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: 1502 markings, 1502 edges
lola: ========================================
lola: subprocess 8 will run for 731 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (((5 <= p1624) OR (p574 <= 4))) U X (F ((5 <= p2059)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (((5 <= p1624) OR (p574 <= 4))) U X (F ((5 <= p2059)))))
lola: processed formula length: 63
lola: 81 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1502 markings, 1502 edges
lola: ========================================
lola: subprocess 9 will run for 975 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((2 <= p1481)))
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 <= p1481)))
lola: processed formula length: 20
lola: 81 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 65 markings, 65 edges
lola: ========================================
lola: subprocess 10 will run for 1462 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((3 <= p473)))
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 ((3 <= p473)))
lola: processed formula length: 19
lola: 81 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 65 markings, 65 edges
lola: ========================================
lola: subprocess 11 will run for 2924 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G ((p1786 <= 1)) AND (p1786 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((p1786 <= 1)) AND (p1786 <= 1)))
lola: processed formula length: 39
lola: 81 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 184249 markings, 303057 edges, 36850 markings/sec, 0 secs
lola: 373878 markings, 615108 edges, 37926 markings/sec, 5 secs
lola: 568660 markings, 935889 edges, 38956 markings/sec, 10 secs
lola: 765934 markings, 1260527 edges, 39455 markings/sec, 15 secs
lola: 961523 markings, 1582565 edges, 39118 markings/sec, 20 secs
lola: 1156026 markings, 1902908 edges, 38901 markings/sec, 25 secs
lola: 1349740 markings, 2221697 edges, 38743 markings/sec, 30 secs
lola: 1541341 markings, 2537270 edges, 38320 markings/sec, 35 secs
lola: 1735394 markings, 2856736 edges, 38811 markings/sec, 40 secs
lola: 1925024 markings, 3168916 edges, 37926 markings/sec, 45 secs
lola: 2119946 markings, 3489911 edges, 38984 markings/sec, 50 secs
lola: 2307897 markings, 3799246 edges, 37590 markings/sec, 55 secs
lola: 2500328 markings, 4116116 edges, 38486 markings/sec, 60 secs
lola: 2692799 markings, 4432759 edges, 38494 markings/sec, 65 secs
lola: 2888817 markings, 4755517 edges, 39204 markings/sec, 70 secs
lola: 3080188 markings, 5070752 edges, 38274 markings/sec, 75 secs
lola: 3271870 markings, 5386251 edges, 38336 markings/sec, 80 secs
lola: 3457754 markings, 5692406 edges, 37177 markings/sec, 85 secs
lola: 3647474 markings, 6004726 edges, 37944 markings/sec, 90 secs
lola: 3834186 markings, 6312022 edges, 37342 markings/sec, 95 secs
lola: 4024388 markings, 6625248 edges, 38040 markings/sec, 100 secs
lola: 4210825 markings, 6932250 edges, 37287 markings/sec, 105 secs
lola: 4401636 markings, 7246408 edges, 38162 markings/sec, 110 secs
lola: 4590091 markings, 7556730 edges, 37691 markings/sec, 115 secs
lola: 4779045 markings, 7867690 edges, 37791 markings/sec, 120 secs
lola: 4970121 markings, 8182253 edges, 38215 markings/sec, 125 secs
lola: 5160699 markings, 8495979 edges, 38116 markings/sec, 130 secs
lola: 5348182 markings, 8804718 edges, 37497 markings/sec, 135 secs
lola: 5537959 markings, 9117285 edges, 37955 markings/sec, 140 secs
lola: 5727561 markings, 9429364 edges, 37920 markings/sec, 145 secs
lola: 5920123 markings, 9746421 edges, 38512 markings/sec, 150 secs
lola: 6109774 markings, 10058614 edges, 37930 markings/sec, 155 secs
lola: 6294967 markings, 10363364 edges, 37039 markings/sec, 160 secs
lola: 6485136 markings, 10676635 edges, 38034 markings/sec, 165 secs
lola: 6675868 markings, 10990496 edges, 38146 markings/sec, 170 secs
lola: 6868421 markings, 11307670 edges, 38511 markings/sec, 175 secs
lola: 7056574 markings, 11617226 edges, 37631 markings/sec, 180 secs
lola: 7245185 markings, 11927973 edges, 37722 markings/sec, 185 secs
lola: 7434097 markings, 12238944 edges, 37782 markings/sec, 190 secs
lola: 7623158 markings, 12550312 edges, 37812 markings/sec, 195 secs
lola: 7808632 markings, 12855631 edges, 37095 markings/sec, 200 secs
lola: 7997953 markings, 13167148 edges, 37864 markings/sec, 205 secs
lola: 8186602 markings, 13477730 edges, 37730 markings/sec, 210 secs
lola: 8374839 markings, 13787741 edges, 37647 markings/sec, 215 secs
lola: 8559754 markings, 14092102 edges, 36983 markings/sec, 220 secs
lola: 8747660 markings, 14401690 edges, 37581 markings/sec, 225 secs
lola: 8936106 markings, 14711962 edges, 37689 markings/sec, 230 secs
lola: 9123710 markings, 15020651 edges, 37521 markings/sec, 235 secs
lola: 9312205 markings, 15331112 edges, 37699 markings/sec, 240 secs
lola: 9502377 markings, 15644137 edges, 38034 markings/sec, 245 secs
lola: 9691685 markings, 15955729 edges, 37862 markings/sec, 250 secs
lola: 9880964 markings, 16267541 edges, 37856 markings/sec, 255 secs
lola: 10069712 markings, 16578195 edges, 37750 markings/sec, 260 secs
lola: 10258955 markings, 16889884 edges, 37849 markings/sec, 265 secs
lola: 10447086 markings, 17199501 edges, 37626 markings/sec, 270 secs
lola: 10637056 markings, 17512206 edges, 37994 markings/sec, 275 secs
lola: 10824583 markings, 17820937 edges, 37505 markings/sec, 280 secs
lola: 11011872 markings, 18129419 edges, 37458 markings/sec, 285 secs
lola: 11196575 markings, 18433459 edges, 36941 markings/sec, 290 secs
lola: 11384608 markings, 18742974 edges, 37607 markings/sec, 295 secs
lola: 11572041 markings, 19051472 edges, 37487 markings/sec, 300 secs
lola: 11760705 markings, 19362334 edges, 37733 markings/sec, 305 secs
lola: 11924480 markings, 19633181 edges, 32755 markings/sec, 310 secs
lola: 12085765 markings, 19897303 edges, 32257 markings/sec, 315 secs
lola: 12208332 markings, 20099251 edges, 24513 markings/sec, 320 secs
lola: 12364122 markings, 20355760 edges, 31158 markings/sec, 325 secs
lola: 12545689 markings, 20654453 edges, 36313 markings/sec, 330 secs
lola: 12721431 markings, 20944049 edges, 35148 markings/sec, 335 secs
lola: 12893985 markings, 21227940 edges, 34511 markings/sec, 340 secs
lola: 13012412 markings, 21422980 edges, 23685 markings/sec, 345 secs
lola: 13181060 markings, 21700896 edges, 33730 markings/sec, 350 secs
lola: 13348322 markings, 21976263 edges, 33452 markings/sec, 355 secs
lola: 13521994 markings, 22262136 edges, 34734 markings/sec, 360 secs
lola: 13695348 markings, 22547554 edges, 34671 markings/sec, 365 secs
lola: 13838181 markings, 22782582 edges, 28567 markings/sec, 370 secs
lola: 13970524 markings, 23000577 edges, 26469 markings/sec, 375 secs
lola: 14082653 markings, 23185132 edges, 22426 markings/sec, 380 secs
lola: 14183122 markings, 23350373 edges, 20094 markings/sec, 385 secs
lola: 14278178 markings, 23507077 edges, 19011 markings/sec, 390 secs
lola: 14351625 markings, 23627878 edges, 14689 markings/sec, 395 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: X ((G ((p703 <= 3)) AND ((p703 <= 3) AND F (((2 <= p352) OR (1 <= p2397))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((p703 <= 3)) AND ((p703 <= 3) AND F (((2 <= p352) OR (1 <= p2397))))))
lola: processed formula length: 77
lola: 81 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 204184 markings, 291129 edges, 40837 markings/sec, 0 secs
lola: 426202 markings, 607865 edges, 44404 markings/sec, 5 secs
lola: 650502 markings, 928593 edges, 44860 markings/sec, 10 secs
lola: 875278 markings, 1249039 edges, 44955 markings/sec, 15 secs
lola: 1099374 markings, 1569409 edges, 44819 markings/sec, 20 secs
lola: 1324109 markings, 1889769 edges, 44947 markings/sec, 25 secs
lola: 1546333 markings, 2207098 edges, 44445 markings/sec, 30 secs
lola: 1769468 markings, 2525555 edges, 44627 markings/sec, 35 secs
lola: 1989287 markings, 2839569 edges, 43964 markings/sec, 40 secs
lola: 2209648 markings, 3154524 edges, 44072 markings/sec, 45 secs
lola: 2432516 markings, 3472747 edges, 44574 markings/sec, 50 secs
lola: 2656353 markings, 3791861 edges, 44767 markings/sec, 55 secs
lola: 2878903 markings, 4109660 edges, 44510 markings/sec, 60 secs
lola: 3085010 markings, 4403751 edges, 41221 markings/sec, 65 secs
lola: 3252965 markings, 4643888 edges, 33591 markings/sec, 70 secs
lola: 3354309 markings, 4788607 edges, 20269 markings/sec, 75 secs
lola: 3461770 markings, 4941879 edges, 21492 markings/sec, 80 secs
lola: 3606198 markings, 5147984 edges, 28886 markings/sec, 85 secs
lola: 3739832 markings, 5338746 edges, 26727 markings/sec, 90 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: F (G (((X ((p1054 <= 4)) U (2 <= p747)) AND (F ((2 <= p747)) OR (p747 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((X ((p1054 <= 4)) U (2 <= p747)) AND (F ((2 <= p747)) OR (p747 <= 1)))))
lola: processed formula length: 79
lola: 81 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 206720 markings, 294527 edges, 41344 markings/sec, 0 secs
lola: 428669 markings, 611720 edges, 44390 markings/sec, 5 secs
lola: 649316 markings, 926519 edges, 44129 markings/sec, 10 secs
lola: 871568 markings, 1243664 edges, 44450 markings/sec, 15 secs
lola: 1090028 markings, 1555840 edges, 43692 markings/sec, 20 secs
lola: 1311091 markings, 1871476 edges, 44213 markings/sec, 25 secs
lola: 1534773 markings, 2191076 edges, 44736 markings/sec, 30 secs
lola: 1757298 markings, 2508748 edges, 44505 markings/sec, 35 secs
lola: 1978911 markings, 2824772 edges, 44323 markings/sec, 40 secs
lola: 2195791 markings, 3134761 edges, 43376 markings/sec, 45 secs
lola: 2415744 markings, 3448566 edges, 43991 markings/sec, 50 secs
lola: 2636149 markings, 3762915 edges, 44081 markings/sec, 55 secs
lola: 2856873 markings, 4078509 edges, 44145 markings/sec, 60 secs
lola: 3071099 markings, 4383938 edges, 42845 markings/sec, 65 secs
lola: 3205814 markings, 4576461 edges, 26943 markings/sec, 70 secs
lola: 3329021 markings, 4752211 edges, 24641 markings/sec, 75 secs
lola: 3513055 markings, 5014880 edges, 36807 markings/sec, 80 secs
lola: 3665981 markings, 5233072 edges, 30585 markings/sec, 85 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: X (((p449 <= 4) R X (G (((p32 <= 1) OR (p646 <= 1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p449 <= 4) R X (G (((p32 <= 1) OR (p646 <= 1))))))
lola: processed formula length: 56
lola: 81 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 193649 markings, 276066 edges, 38730 markings/sec, 0 secs
lola: 412572 markings, 588500 edges, 43785 markings/sec, 5 secs
lola: 629852 markings, 899186 edges, 43456 markings/sec, 10 secs
lola: 847851 markings, 1210020 edges, 43600 markings/sec, 15 secs
lola: 1067319 markings, 1523405 edges, 43894 markings/sec, 20 secs
lola: 1289854 markings, 1841046 edges, 44507 markings/sec, 25 secs
lola: 1512342 markings, 2158601 edges, 44498 markings/sec, 30 secs
lola: 1729132 markings, 2468433 edges, 43358 markings/sec, 35 secs
lola: 1952535 markings, 2787421 edges, 44681 markings/sec, 40 secs
lola: 2174608 markings, 3104420 edges, 44415 markings/sec, 45 secs
lola: 2397054 markings, 3421905 edges, 44489 markings/sec, 50 secs
lola: 2619633 markings, 3739622 edges, 44516 markings/sec, 55 secs
lola: 2841958 markings, 4056892 edges, 44465 markings/sec, 60 secs
lola: 3048634 markings, 4353287 edges, 41335 markings/sec, 65 secs
lola: 3196202 markings, 4563261 edges, 29514 markings/sec, 70 secs
lola: 3346478 markings, 4777259 edges, 30055 markings/sec, 75 secs
lola: 3517224 markings, 5020997 edges, 34149 markings/sec, 80 secs
lola: 3682007 markings, 5256538 edges, 32957 markings/sec, 85 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: F ((G ((p1786 <= 1)) AND (p1786 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((p1786 <= 1)) AND (p1786 <= 1)))
lola: processed formula length: 39
lola: 81 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 156990 markings, 258052 edges, 31398 markings/sec, 0 secs
lola: 329014 markings, 541336 edges, 34405 markings/sec, 5 secs
lola: 517926 markings, 852260 edges, 37782 markings/sec, 10 secs
lola: 709146 markings, 1167238 edges, 38244 markings/sec, 15 secs
lola: 901457 markings, 1483643 edges, 38462 markings/sec, 20 secs
lola: 1092095 markings, 1797656 edges, 38128 markings/sec, 25 secs
lola: 1281719 markings, 2109749 edges, 37925 markings/sec, 30 secs
lola: 1471090 markings, 2421603 edges, 37874 markings/sec, 35 secs
lola: 1660258 markings, 2733062 edges, 37834 markings/sec, 40 secs
lola: 1847332 markings, 3041068 edges, 37415 markings/sec, 45 secs
lola: 2036688 markings, 3352708 edges, 37871 markings/sec, 50 secs
lola: 2224844 markings, 3662443 edges, 37631 markings/sec, 55 secs
lola: 2416559 markings, 3977942 edges, 38343 markings/sec, 60 secs
lola: 2608647 markings, 4294345 edges, 38418 markings/sec, 65 secs
lola: 2800386 markings, 4609961 edges, 38348 markings/sec, 70 secs
lola: 2989404 markings, 4921327 edges, 37804 markings/sec, 75 secs
lola: 3178397 markings, 5232389 edges, 37799 markings/sec, 80 secs
lola: 3363830 markings, 5537652 edges, 37087 markings/sec, 85 secs
lola: 3554040 markings, 5850831 edges, 38042 markings/sec, 90 secs
lola: 3742388 markings, 6160954 edges, 37670 markings/sec, 95 secs
lola: 3931512 markings, 6472247 edges, 37825 markings/sec, 100 secs
lola: 4115948 markings, 6775950 edges, 36887 markings/sec, 105 secs
lola: 4304026 markings, 7085519 edges, 37616 markings/sec, 110 secs
lola: 4488006 markings, 7388617 edges, 36796 markings/sec, 115 secs
lola: 4674781 markings, 7696199 edges, 37355 markings/sec, 120 secs
lola: 4859394 markings, 8000170 edges, 36923 markings/sec, 125 secs
lola: 5045776 markings, 8306931 edges, 37276 markings/sec, 130 secs
lola: 5232029 markings, 8613537 edges, 37251 markings/sec, 135 secs
lola: 5420779 markings, 8924281 edges, 37750 markings/sec, 140 secs
lola: 5605892 markings, 9228862 edges, 37023 markings/sec, 145 secs
lola: 5794026 markings, 9538744 edges, 37627 markings/sec, 150 secs
lola: 5979590 markings, 9844273 edges, 37113 markings/sec, 155 secs
lola: 6163289 markings, 10146707 edges, 36740 markings/sec, 160 secs
lola: 6345937 markings, 10447520 edges, 36530 markings/sec, 165 secs
lola: 6531127 markings, 10752430 edges, 37038 markings/sec, 170 secs
lola: 6715299 markings, 11055450 edges, 36834 markings/sec, 175 secs
lola: 6907036 markings, 11371098 edges, 38347 markings/sec, 180 secs
lola: 7095062 markings, 11680804 edges, 37605 markings/sec, 185 secs
lola: 7288327 markings, 11999001 edges, 38653 markings/sec, 190 secs
lola: 7476128 markings, 12308021 edges, 37560 markings/sec, 195 secs
lola: 7665583 markings, 12620085 edges, 37891 markings/sec, 200 secs
lola: 7850880 markings, 12925187 edges, 37059 markings/sec, 205 secs
lola: 8036688 markings, 13231005 edges, 37162 markings/sec, 210 secs
lola: 8218431 markings, 13530165 edges, 36349 markings/sec, 215 secs
lola: 8409261 markings, 13844365 edges, 38166 markings/sec, 220 secs
lola: 8592920 markings, 14146842 edges, 36732 markings/sec, 225 secs
lola: 8779175 markings, 14453646 edges, 37251 markings/sec, 230 secs
lola: 8968612 markings, 14765350 edges, 37887 markings/sec, 235 secs
lola: 9154577 markings, 15071491 edges, 37193 markings/sec, 240 secs
lola: 9342781 markings, 15381348 edges, 37641 markings/sec, 245 secs
lola: 9528475 markings, 15687079 edges, 37139 markings/sec, 250 secs
lola: 9715910 markings, 15995833 edges, 37487 markings/sec, 255 secs
lola: 9900296 markings, 16299281 edges, 36877 markings/sec, 260 secs
lola: 10088593 markings, 16609318 edges, 37659 markings/sec, 265 secs
lola: 10274222 markings, 16914964 edges, 37126 markings/sec, 270 secs
lola: 10464148 markings, 17227606 edges, 37985 markings/sec, 275 secs
lola: 10649958 markings, 17533494 edges, 37162 markings/sec, 280 secs
lola: 10836164 markings, 17839918 edges, 37241 markings/sec, 285 secs
lola: 11021421 markings, 18145170 edges, 37051 markings/sec, 290 secs
lola: 11212110 markings, 18459003 edges, 38138 markings/sec, 295 secs
lola: 11401752 markings, 18771142 edges, 37928 markings/sec, 300 secs
lola: 11590364 markings, 19081671 edges, 37722 markings/sec, 305 secs
lola: 11777365 markings, 19389785 edges, 37400 markings/sec, 310 secs
lola: 11918507 markings, 19622103 edges, 28228 markings/sec, 315 secs
lola: 12015189 markings, 19781200 edges, 19336 markings/sec, 320 secs
lola: 12061159 markings, 19856737 edges, 9194 markings/sec, 325 secs
lola: 12095767 markings, 19913905 edges, 6922 markings/sec, 330 secs
lola: 12148010 markings, 19999874 edges, 10449 markings/sec, 335 secs
lola: 12236937 markings, 20146199 edges, 17785 markings/sec, 340 secs
lola: 12335028 markings, 20307743 edges, 19618 markings/sec, 345 secs
lola: 12432457 markings, 20468156 edges, 19486 markings/sec, 350 secs
lola: 12523514 markings, 20618109 edges, 18211 markings/sec, 355 secs
lola: 12624470 markings, 20784505 edges, 20191 markings/sec, 360 secs
lola: 12715683 markings, 20934568 edges, 18243 markings/sec, 365 secs
lola: 12789986 markings, 21056970 edges, 14861 markings/sec, 370 secs
lola: 12883997 markings, 21211575 edges, 18802 markings/sec, 375 secs
lola: 12935671 markings, 21296486 edges, 10335 markings/sec, 380 secs
lola: 12997084 markings, 21397848 edges, 12283 markings/sec, 385 secs
lola: 13088954 markings, 21548936 edges, 18374 markings/sec, 390 secs
lola: 13175915 markings, 21692401 edges, 17392 markings/sec, 395 secs
lola: 13288428 markings, 21877697 edges, 22503 markings/sec, 400 secs
lola: 13365844 markings, 22004958 edges, 15483 markings/sec, 405 secs
lola: 13465893 markings, 22169811 edges, 20010 markings/sec, 410 secs
lola: 13550909 markings, 22309718 edges, 17003 markings/sec, 415 secs
lola: 13649067 markings, 22471378 edges, 19632 markings/sec, 420 secs
lola: 13735969 markings, 22614507 edges, 17380 markings/sec, 425 secs
lola: 13826327 markings, 22763232 edges, 18072 markings/sec, 430 secs
lola: 13896439 markings, 22878530 edges, 14022 markings/sec, 435 secs
lola: 13981419 markings, 23018587 edges, 16996 markings/sec, 440 secs
lola: 14043773 markings, 23121024 edges, 12471 markings/sec, 445 secs
lola: 14141688 markings, 23282318 edges, 19583 markings/sec, 450 secs
lola: 14208211 markings, 23391736 edges, 13305 markings/sec, 455 secs
lola: 14275235 markings, 23502221 edges, 13405 markings/sec, 460 secs
lola: 14348360 markings, 23622646 edges, 14625 markings/sec, 465 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no unknown no unknown yes unknown no unknown no no no no
lola:
preliminary result: no unknown no unknown yes unknown no unknown no no no no
lola: memory consumption: 3296 KB
lola: time consumption: 1808 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
rslt: finished

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="JoinFreeModules-PT-0500"
export BK_EXAMINATION="LTLFireability"
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 JoinFreeModules-PT-0500, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r184-oct2-158987928600450"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-0500.tgz
mv JoinFreeModules-PT-0500 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;