About the Execution of ITS-LoLa for ERK-PT-100000
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15742.540 | 3600000.00 | 13760.00 | 212.20 | FFTFFTTFFFFTFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2020-input.r178-tajo-158987883100922.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...............................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is ERK-PT-100000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987883100922
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 192K
-rw-r--r-- 1 mcc users 3.3K Mar 31 14:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 31 14:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 31 14:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 31 14:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 8 14:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Apr 8 14:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Mar 31 14:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 31 14:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 31 14:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 31 14:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 31 14:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 31 14:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 6.7K Mar 24 05:37 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ERK-PT-100000-00
FORMULA_NAME ERK-PT-100000-01
FORMULA_NAME ERK-PT-100000-02
FORMULA_NAME ERK-PT-100000-03
FORMULA_NAME ERK-PT-100000-04
FORMULA_NAME ERK-PT-100000-05
FORMULA_NAME ERK-PT-100000-06
FORMULA_NAME ERK-PT-100000-07
FORMULA_NAME ERK-PT-100000-08
FORMULA_NAME ERK-PT-100000-09
FORMULA_NAME ERK-PT-100000-10
FORMULA_NAME ERK-PT-100000-11
FORMULA_NAME ERK-PT-100000-12
FORMULA_NAME ERK-PT-100000-13
FORMULA_NAME ERK-PT-100000-14
FORMULA_NAME ERK-PT-100000-15
=== Now, execution of the tool begins
BK_START 1591251337640
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 06:15:39] [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-04 06:15:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 06:15:39] [INFO ] Load time of PNML (sax parser for PT used): 20 ms
[2020-06-04 06:15:39] [INFO ] Transformed 11 places.
[2020-06-04 06:15:39] [INFO ] Transformed 11 transitions.
[2020-06-04 06:15:39] [INFO ] Parsed PT model containing 11 places and 11 transitions in 52 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100001 steps, including 0 resets, run finished after 34 ms. (steps per millisecond=2941 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0]
// Phase 1: matrix 11 rows 11 cols
[2020-06-04 06:15:39] [INFO ] Computed 5 place invariants in 2 ms
[2020-06-04 06:15:39] [INFO ] [Real]Absence check using 5 positive place invariants in 15 ms returned sat
[2020-06-04 06:15:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:15:39] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2020-06-04 06:15:39] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 3 ms.
[2020-06-04 06:15:39] [INFO ] Added : 1 causal constraints over 1 iterations in 15 ms. Result :sat
[2020-06-04 06:15:39] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2020-06-04 06:15:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:15:39] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2020-06-04 06:15:39] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 16 ms.
[2020-06-04 06:15:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 06:15:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 8 ms returned sat
[2020-06-04 06:15:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 06:15:39] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2020-06-04 06:15:39] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2020-06-04 06:15:39] [INFO ] Added : 3 causal constraints over 2 iterations in 6 ms. Result :sat
[2020-06-04 06:15:39] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2020-06-04 06:15:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:15:39] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2020-06-04 06:15:39] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2020-06-04 06:15:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 06:15:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2020-06-04 06:15:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 06:15:39] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2020-06-04 06:15:39] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 2 ms.
[2020-06-04 06:15:39] [INFO ] Added : 6 causal constraints over 2 iterations in 12 ms. Result :sat
[2020-06-04 06:15:39] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2020-06-04 06:15:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:15:39] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2020-06-04 06:15:39] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2020-06-04 06:15:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 06:15:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 10 ms returned sat
[2020-06-04 06:15:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 06:15:39] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2020-06-04 06:15:39] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2020-06-04 06:15:39] [INFO ] Added : 3 causal constraints over 2 iterations in 12 ms. Result :sat
[2020-06-04 06:15:39] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2020-06-04 06:15:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:15:39] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2020-06-04 06:15:39] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 3 ms.
[2020-06-04 06:15:39] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
[2020-06-04 06:15:39] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2020-06-04 06:15:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:15:39] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2020-06-04 06:15:39] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2020-06-04 06:15:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 06:15:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2020-06-04 06:15:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 06:15:39] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2020-06-04 06:15:39] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 2 ms.
[2020-06-04 06:15:39] [INFO ] Added : 4 causal constraints over 2 iterations in 17 ms. Result :sat
[2020-06-04 06:15:39] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2020-06-04 06:15:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:15:39] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2020-06-04 06:15:39] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 0 ms.
[2020-06-04 06:15:39] [INFO ] Added : 1 causal constraints over 1 iterations in 27 ms. Result :sat
[2020-06-04 06:15:39] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2020-06-04 06:15:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:15:39] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2020-06-04 06:15:39] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 0 ms.
[2020-06-04 06:15:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 06:15:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2020-06-04 06:15:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 06:15:39] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2020-06-04 06:15:39] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2020-06-04 06:15:39] [INFO ] Added : 6 causal constraints over 2 iterations in 5 ms. Result :sat
[2020-06-04 06:15:39] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2020-06-04 06:15:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:15:39] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2020-06-04 06:15:39] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2020-06-04 06:15:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 06:15:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2020-06-04 06:15:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 06:15:39] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2020-06-04 06:15:39] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2020-06-04 06:15:39] [INFO ] Added : 4 causal constraints over 2 iterations in 4 ms. Result :sat
[2020-06-04 06:15:39] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2020-06-04 06:15:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:15:39] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2020-06-04 06:15:39] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 5 ms.
[2020-06-04 06:15:40] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
[2020-06-04 06:15:40] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2020-06-04 06:15:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:15:40] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2020-06-04 06:15:40] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 0 ms.
[2020-06-04 06:15:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 06:15:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2020-06-04 06:15:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 06:15:40] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2020-06-04 06:15:40] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2020-06-04 06:15:40] [INFO ] Added : 6 causal constraints over 2 iterations in 4 ms. Result :sat
[2020-06-04 06:15:40] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2020-06-04 06:15:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:15:40] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2020-06-04 06:15:40] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2020-06-04 06:15:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 06:15:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2020-06-04 06:15:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 06:15:40] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2020-06-04 06:15:40] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 0 ms.
[2020-06-04 06:15:40] [INFO ] Added : 4 causal constraints over 2 iterations in 6 ms. Result :sat
[2020-06-04 06:15:40] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2020-06-04 06:15:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:15:40] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2020-06-04 06:15:40] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2020-06-04 06:15:40] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
[2020-06-04 06:15:40] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2020-06-04 06:15:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:15:40] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2020-06-04 06:15:40] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2020-06-04 06:15:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 06:15:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2020-06-04 06:15:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 06:15:40] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2020-06-04 06:15:40] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2020-06-04 06:15:40] [INFO ] Added : 3 causal constraints over 2 iterations in 4 ms. Result :sat
[2020-06-04 06:15:40] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2020-06-04 06:15:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:15:40] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2020-06-04 06:15:40] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 3 ms.
[2020-06-04 06:15:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 06:15:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2020-06-04 06:15:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 06:15:40] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2020-06-04 06:15:40] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 0 ms.
[2020-06-04 06:15:40] [INFO ] Added : 3 causal constraints over 2 iterations in 3 ms. Result :sat
[2020-06-04 06:15:40] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2020-06-04 06:15:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:15:40] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2020-06-04 06:15:40] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2020-06-04 06:15:40] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
[2020-06-04 06:15:40] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2020-06-04 06:15:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:15:40] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2020-06-04 06:15:40] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2020-06-04 06:15:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 06:15:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2020-06-04 06:15:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 06:15:40] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2020-06-04 06:15:40] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2020-06-04 06:15:40] [INFO ] Added : 4 causal constraints over 2 iterations in 4 ms. Result :sat
[2020-06-04 06:15:40] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-04 06:15:40] [INFO ] Flatten gal took : 22 ms
FORMULA ERK-PT-100000-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-100000-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 06:15:40] [INFO ] Flatten gal took : 3 ms
[2020-06-04 06:15:40] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2020-06-04 06:15:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 0 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ ERK-PT-100000 @ 3570 seconds
FORMULA ERK-PT-100000-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ERK-PT-100000-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ERK-PT-100000-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ERK-PT-100000-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ERK-PT-100000-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ERK-PT-100000-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ERK-PT-100000-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ERK-PT-100000-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ERK-PT-100000-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ERK-PT-100000-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ERK-PT-100000-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ERK-PT-100000-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ERK-PT-100000-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ERK-PT-100000-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3564
rslt: Output for LTLFireability @ ERK-PT-100000
{
"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": "Thu Jun 4 06:15:41 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (G ((((1 <= p0) AND (1 <= p1)) AND (1 <= p5))))",
"processed_size": 49,
"rewrites": 64
},
"result":
{
"edges": 200005,
"markings": 200005,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 3,
"comp": 4,
"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": 3,
"visible_transitions": 0
},
"processed": "X (F ((((p5 <= 0)) AND (F (((p6 <= 0) AND (p4 <= 0))) OR G (((p5 <= 0)))))))",
"processed_size": 76,
"rewrites": 64
},
"result":
{
"edges": 400009,
"markings": 300010,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 2,
"X": 3,
"aconj": 4,
"adisj": 0,
"aneg": 2,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "X ((((X (X (((p9 <= 0) OR (p10 <= 0)))) U ((1 <= p7) AND (1 <= p8))) U ((1 <= p0) AND (1 <= p1))) OR (G ((p5 <= 0)) AND F (((1 <= p0) AND (1 <= p1))))))",
"processed_size": 153,
"rewrites": 64
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 16
},
"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": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (F ((G (F (((p9 <= 0) OR (p10 <= 0)))) OR (p4 <= 0))))",
"processed_size": 57,
"rewrites": 64
},
"result":
{
"edges": 400044,
"markings": 300033,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 1,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (F ((X ((p6 <= 0)) OR ((1 <= p9) AND (1 <= p10)))))",
"processed_size": 53,
"rewrites": 64
},
"result":
{
"edges": 9,
"markings": 8,
"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": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (X (F (((1 <= p7) AND (1 <= p8)))))",
"processed_size": 37,
"rewrites": 64
},
"result":
{
"edges": 9,
"markings": 8,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"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": 2,
"visible_transitions": 0
},
"processed": "G ((F ((1 <= p4)) AND (X ((1 <= p5)) OR (1 <= p4))))",
"processed_size": 52,
"rewrites": 64
},
"result":
{
"edges": 200006,
"markings": 200006,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 2,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((G (F ((1 <= p5))) OR X ((G (((1 <= p9) AND (1 <= p10))) OR F ((1 <= p5))))))",
"processed_size": 80,
"rewrites": 64
},
"result":
{
"edges": 200004,
"markings": 200004,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 3,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((X ((X (G ((1 <= p4))) OR ((1 <= p0) AND (1 <= p1)))) OR (1 <= p4)))",
"processed_size": 71,
"rewrites": 64
},
"result":
{
"edges": 5,
"markings": 6,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"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 (G ((X ((p5 <= 0)) AND (1 <= p5))))",
"processed_size": 37,
"rewrites": 64
},
"result":
{
"edges": 200006,
"markings": 200006,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 1,
"aneg": 4,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F (G ((X ((p4 <= 0)) R (F ((p2 <= 0)) AND (((p9 <= 0) OR (p10 <= 0)) R X (((p5 <= 0) AND ((p9 <= 0) OR (p10 <= 0)))))))))",
"processed_size": 123,
"rewrites": 64
},
"result":
{
"edges": 200009,
"markings": 200007,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(F (((1 <= p9) AND (1 <= p10) AND (1 <= p4))) U (F ((1 <= p4)) AND (1 <= p4)))",
"processed_size": 78,
"rewrites": 64
},
"result":
{
"edges": 100002,
"markings": 100002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 11,
"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": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 4,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((F ((G (((p7 <= 0) OR (p8 <= 0))) OR (((p5 <= 0) R ((p5 <= 0) AND ((p7 <= 0) OR (p8 <= 0)))) AND ((p7 <= 0) OR (p8 <= 0))))) AND F ((1 <= p6))))",
"processed_size": 150,
"rewrites": 64
},
"result":
{
"edges": 300005,
"markings": 300005,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 12,
"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": 3565
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3565
},
"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": "F (G ((p6 <= 0)))",
"processed_size": 17,
"rewrites": 64
},
"result":
{
"edges": 900004,
"markings": 800003,
"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": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},
{
"child":
[
{
"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": "F (G ((p6 <= 0)))",
"processed_size": 17,
"rewrites": 64
},
"result":
{
"edges": 900004,
"markings": 800003,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((F ((p5 <= 0)) AND (1 <= p5)) U (1 <= p4))",
"processed_size": 43,
"rewrites": 64
},
"result":
{
"edges": 300002,
"markings": 300002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 27252,
"runtime": 6.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(G((** AND **))) : X(F((* AND (F(*) OR G(*))))) : X((((X(X(*)) U **) U **) OR (G(*) AND F(**)))) : (((F(*) AND **) U **) OR F(G(**))) : X(F((G(F(**)) OR **))) : X(F((X(*) OR *))) : X(X(F(**))) : G((F(**) AND (X(**) OR **))) : (F(**) U (F(**) AND **)) : F((G(F(**)) OR X((G(**) OR F(**))))) : X((X((X(G(**)) OR **)) OR **)) : X(G((X(**) AND **))) : G((F((G(*) OR ((* R *) AND *))) AND F(**))) : F(G((X(*) R (F(*) AND (* R X(*))))))"
},
"net":
{
"arcs": 34,
"conflict_clusters": 7,
"places": 11,
"places_significant": 6,
"singleton_clusters": 0,
"transitions": 11
},
"result":
{
"preliminary_value": "no no yes no no yes yes no no no yes no no no ",
"value": "no no yes no no yes yes no no no yes 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: 22/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 352
lola: finding significant places
lola: 11 places, 11 transitions, 6 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLFireability.xml
lola: G (X ((G (((1 <= p0) AND (1 <= p1))) AND G ((1 <= p5))))) : X (F (NOT((G (((1 <= p6) OR (1 <= p4))) U ((1 <= p5)))))) : X ((NOT((((1 <= p7) AND (1 <= p8)) U F ((1 <= p5)))) U ((NOT(X (X (((1 <= p9) AND (1 <= p10))))) U ((1 <= p7) AND (1 <= p8))) U ((1 <= p0) AND (1 <= p1))))) : (((NOT(G ((1 <= p5))) AND (1 <= p5)) U (1 <= p4)) OR X (X (F (X (G ((p6 <= 0))))))) : X (F ((G (F (((p9 <= 0) OR (p10 <= 0)))) OR (p4 <= 0)))) : NOT(X (G ((X ((1 <= p6)) AND ((p9 <= 0) OR (p10 <= 0)))))) : F (X (F (X (((1 <= p7) AND (1 <= p8)))))) : G ((X ((1 <= p5)) U (1 <= p4))) : (F (((1 <= p9) AND (1 <= p10) AND (1 <= p4))) U (F ((1 <= p4)) AND (1 <= p4))) : F ((G (F ((1 <= p5))) OR X ((G (((1 <= p9) AND (1 <= p10))) OR F ((1 <= p5)))))) : X (((G (X (X ((1 <= p4)))) OR X (((1 <= p0) AND (1 <= p1)))) OR (1 <= p4))) : G (X ((X ((p5 <= 0)) AND (1 <= p5)))) : (NOT(F (G ((((1 <= p5) U ((1 <= p5) OR ((1 <= p7) AND (1 <= p8)))) U ((1 <= p7) AND (1 <= p8)))))) AND G (F ((1 <= p6)))) : F (G (NOT((X ((1 <= p4)) U (G ((1 <= p2)) OR (((1 <= p9) AND (1 <= p10)) U X (((1 <= p5) OR ((1 <= p9) AND (1 <= p10))))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((((1 <= p0) AND (1 <= p1)) AND (1 <= p5))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((1 <= p0) AND (1 <= p1)) AND (1 <= p5))))
lola: processed formula length: 49
lola: 64 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 200005 markings, 200005 edges
lola: ========================================
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((((p5 <= 0)) AND (F (((p6 <= 0) AND (p4 <= 0))) OR G (((p5 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((((p5 <= 0)) AND (F (((p6 <= 0) AND (p4 <= 0))) OR G (((p5 <= 0)))))))
lola: processed formula length: 76
lola: 64 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: 300010 markings, 400009 edges
lola: ========================================
lola: subprocess 2 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((X (X (((p9 <= 0) OR (p10 <= 0)))) U ((1 <= p7) AND (1 <= p8))) U ((1 <= p0) AND (1 <= p1))) OR (G ((p5 <= 0)) AND F (((1 <= p0) AND (1 <= p1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((X (X (((p9 <= 0) OR (p10 <= 0)))) U ((1 <= p7) AND (1 <= p8))) U ((1 <= p0) AND (1 <= p1))) OR (G ((p5 <= 0)) AND F (((1 <= p0) AND (1 <= p1))))))
lola: processed formula length: 153
lola: 64 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 16 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 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((G (F (((p9 <= 0) OR (p10 <= 0)))) OR (p4 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G (F (((p9 <= 0) OR (p10 <= 0)))) OR (p4 <= 0))))
lola: processed formula length: 57
lola: 64 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 300033 markings, 400044 edges
lola: ========================================
lola: subprocess 4 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((X ((p6 <= 0)) OR ((1 <= p9) AND (1 <= p10)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((X ((p6 <= 0)) OR ((1 <= p9) AND (1 <= p10)))))
lola: processed formula length: 53
lola: 64 rewrites
lola: closed formula file LTLFireability.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: 8 markings, 9 edges
lola: ========================================
lola: subprocess 5 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F (((1 <= p7) AND (1 <= p8)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F (((1 <= p7) AND (1 <= p8)))))
lola: processed formula length: 37
lola: 64 rewrites
lola: closed formula file LTLFireability.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: 8 markings, 9 edges
lola: ========================================
lola: subprocess 6 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((1 <= p4)) AND (X ((1 <= p5)) OR (1 <= p4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((1 <= p4)) AND (X ((1 <= p5)) OR (1 <= p4))))
lola: processed formula length: 52
lola: 64 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: 200006 markings, 200006 edges
lola: ========================================
lola: subprocess 7 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G (F ((1 <= p5))) OR X ((G (((1 <= p9) AND (1 <= p10))) OR F ((1 <= p5))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G (F ((1 <= p5))) OR X ((G (((1 <= p9) AND (1 <= p10))) OR F ((1 <= p5))))))
lola: processed formula length: 80
lola: 64 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: 200004 markings, 200004 edges
lola: ========================================
lola: subprocess 8 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X ((X (G ((1 <= p4))) OR ((1 <= p0) AND (1 <= p1)))) OR (1 <= p4)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X ((X (G ((1 <= p4))) OR ((1 <= p0) AND (1 <= p1)))) OR (1 <= p4)))
lola: processed formula length: 71
lola: 64 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: 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: 6 markings, 5 edges
lola: ========================================
lola: subprocess 9 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((X ((p5 <= 0)) AND (1 <= p5))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X ((p5 <= 0)) AND (1 <= p5))))
lola: processed formula length: 37
lola: 64 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: 200006 markings, 200006 edges
lola: ========================================
lola: subprocess 10 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X ((p4 <= 0)) R (F ((p2 <= 0)) AND (((p9 <= 0) OR (p10 <= 0)) R X (((p5 <= 0) AND ((p9 <= 0) OR (p10 <= 0)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X ((p4 <= 0)) R (F ((p2 <= 0)) AND (((p9 <= 0) OR (p10 <= 0)) R X (((p5 <= 0) AND ((p9 <= 0) OR (p10 <= 0)))))))))
lola: processed formula length: 123
lola: 64 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: add low 10
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: 200007 markings, 200009 edges
lola: ========================================
lola: subprocess 11 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p9) AND (1 <= p10) AND (1 <= p4))) U (F ((1 <= p4)) AND (1 <= p4)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F (((1 <= p9) AND (1 <= p10) AND (1 <= p4))) U (F ((1 <= p4)) AND (1 <= p4)))
lola: processed formula length: 78
lola: 64 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: 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: 100002 markings, 100002 edges
lola: ========================================
lola: subprocess 12 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((G (((p7 <= 0) OR (p8 <= 0))) OR (((p5 <= 0) R ((p5 <= 0) AND ((p7 <= 0) OR (p8 <= 0)))) AND ((p7 <= 0) OR (p8 <= 0))))) AND F ((1 <= p6))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((G (((p7 <= 0) OR (p8 <= 0))) OR (((p5 <= 0) R ((p5 <= 0) AND ((p7 <= 0) OR (p8 <= 0)))) AND ((p7 <= 0) OR (p8 <= 0))))) AND F ((1 <= p6))))
lola: processed formula length: 150
lola: 64 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: 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: 300005 markings, 300005 edges
lola: ========================================
lola: subprocess 13 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((F ((p5 <= 0)) AND (1 <= p5)) U (1 <= p4)) OR F (G ((p6 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p6 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((p6 <= 0)))
lola: processed formula length: 17
lola: 64 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: 800003 markings, 900004 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (((F ((p5 <= 0)) AND (1 <= p5)) U (1 <= p4)) OR F (G ((p6 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: F (G ((p6 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((p6 <= 0)))
lola: processed formula length: 17
lola: 64 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: 800003 markings, 900004 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((F ((p5 <= 0)) AND (1 <= p5)) U (1 <= p4))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((F ((p5 <= 0)) AND (1 <= p5)) U (1 <= p4))
lola: processed formula length: 43
lola: 64 rewrites
lola: closed formula file LTLFireability.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: 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: 300002 markings, 300002 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no no yes yes no no no yes no no no
lola:
preliminary result: no no yes no no yes yes no no no yes no no no
lola: memory consumption: 27252 KB
lola: time consumption: 6 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="ERK-PT-100000"
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 ERK-PT-100000, 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 r178-tajo-158987883100922"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ERK-PT-100000.tgz
mv ERK-PT-100000 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 '
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 ;