About the Execution of ITS-LoLa for MAPK-PT-05120
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15799.270 | 3600000.00 | 814290.00 | 14816.50 | FFFFTFFF?TTTTFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/local/x2003239/mcc2020-input.r174-csrt-158987852700073.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off 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 MAPK-PT-05120, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987852700073
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 204K
-rw-r--r-- 1 mcc users 3.9K Apr 8 13:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 8 13:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 7 16:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 7 16:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 14 12:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Apr 14 12:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 6 19:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 6 19:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 6 02:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 6 02:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 6 20:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 6 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 25K 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 MAPK-PT-05120-00
FORMULA_NAME MAPK-PT-05120-01
FORMULA_NAME MAPK-PT-05120-02
FORMULA_NAME MAPK-PT-05120-03
FORMULA_NAME MAPK-PT-05120-04
FORMULA_NAME MAPK-PT-05120-05
FORMULA_NAME MAPK-PT-05120-06
FORMULA_NAME MAPK-PT-05120-07
FORMULA_NAME MAPK-PT-05120-08
FORMULA_NAME MAPK-PT-05120-09
FORMULA_NAME MAPK-PT-05120-10
FORMULA_NAME MAPK-PT-05120-11
FORMULA_NAME MAPK-PT-05120-12
FORMULA_NAME MAPK-PT-05120-13
FORMULA_NAME MAPK-PT-05120-14
FORMULA_NAME MAPK-PT-05120-15
=== Now, execution of the tool begins
BK_START 1591129706659
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 20:28:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-02 20:28:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 20:28:30] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2020-06-02 20:28:30] [INFO ] Transformed 22 places.
[2020-06-02 20:28:30] [INFO ] Transformed 30 transitions.
[2020-06-02 20:28:30] [INFO ] Parsed PT model containing 22 places and 30 transitions in 135 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 39 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 101204 steps, including 0 resets, run finished after 98 ms. (steps per millisecond=1032 ) properties seen :[1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0]
// Phase 1: matrix 30 rows 22 cols
[2020-06-02 20:28:30] [INFO ] Computed 7 place invariants in 8 ms
[2020-06-02 20:28:30] [INFO ] [Real]Absence check using 7 positive place invariants in 25 ms returned sat
[2020-06-02 20:28:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:30] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2020-06-02 20:28:30] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 13 ms.
[2020-06-02 20:28:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:28:30] [INFO ] [Nat]Absence check using 7 positive place invariants in 30 ms returned sat
[2020-06-02 20:28:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:30] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2020-06-02 20:28:30] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 12 ms.
[2020-06-02 20:28:31] [INFO ] Added : 26 causal constraints over 6 iterations in 116 ms. Result :sat
[2020-06-02 20:28:31] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-02 20:28:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:31] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2020-06-02 20:28:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:28:31] [INFO ] [Nat]Absence check using 7 positive place invariants in 16 ms returned sat
[2020-06-02 20:28:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:31] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2020-06-02 20:28:31] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 11 ms.
[2020-06-02 20:28:31] [INFO ] Added : 27 causal constraints over 6 iterations in 67 ms. Result :sat
[2020-06-02 20:28:31] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-02 20:28:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:31] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2020-06-02 20:28:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:28:31] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-02 20:28:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:31] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2020-06-02 20:28:31] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 15 ms.
[2020-06-02 20:28:31] [INFO ] Added : 26 causal constraints over 6 iterations in 54 ms. Result :sat
[2020-06-02 20:28:31] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-06-02 20:28:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:31] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2020-06-02 20:28:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:28:31] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2020-06-02 20:28:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:31] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2020-06-02 20:28:31] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 6 ms.
[2020-06-02 20:28:31] [INFO ] Added : 26 causal constraints over 6 iterations in 50 ms. Result :sat
[2020-06-02 20:28:31] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-06-02 20:28:31] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
[2020-06-02 20:28:31] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-06-02 20:28:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:31] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2020-06-02 20:28:31] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 4 ms.
[2020-06-02 20:28:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:28:31] [INFO ] [Nat]Absence check using 7 positive place invariants in 44 ms returned sat
[2020-06-02 20:28:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:32] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2020-06-02 20:28:32] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2020-06-02 20:28:32] [INFO ] Added : 25 causal constraints over 5 iterations in 21 ms. Result :sat
[2020-06-02 20:28:32] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2020-06-02 20:28:32] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2020-06-02 20:28:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:32] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2020-06-02 20:28:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:28:32] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-02 20:28:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:32] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2020-06-02 20:28:32] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 3 ms.
[2020-06-02 20:28:32] [INFO ] Added : 25 causal constraints over 7 iterations in 31 ms. Result :sat
[2020-06-02 20:28:32] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2020-06-02 20:28:32] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-06-02 20:28:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:32] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2020-06-02 20:28:32] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 3 ms.
[2020-06-02 20:28:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:28:32] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-02 20:28:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:32] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2020-06-02 20:28:32] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 8 ms.
[2020-06-02 20:28:32] [INFO ] Added : 26 causal constraints over 6 iterations in 59 ms. Result :sat
[2020-06-02 20:28:32] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2020-06-02 20:28:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:32] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2020-06-02 20:28:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:28:32] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-02 20:28:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:32] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2020-06-02 20:28:32] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2020-06-02 20:28:32] [INFO ] Added : 25 causal constraints over 5 iterations in 21 ms. Result :sat
[2020-06-02 20:28:32] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-06-02 20:28:32] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-06-02 20:28:32] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-06-02 20:28:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:32] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2020-06-02 20:28:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:28:32] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-02 20:28:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:32] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2020-06-02 20:28:32] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2020-06-02 20:28:32] [INFO ] Added : 25 causal constraints over 7 iterations in 65 ms. Result :sat
[2020-06-02 20:28:32] [INFO ] [Real]Absence check using 7 positive place invariants in 33 ms returned unsat
[2020-06-02 20:28:32] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-02 20:28:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:32] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2020-06-02 20:28:32] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2020-06-02 20:28:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:28:32] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-02 20:28:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:32] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2020-06-02 20:28:32] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 5 ms.
[2020-06-02 20:28:32] [INFO ] Added : 25 causal constraints over 6 iterations in 32 ms. Result :sat
[2020-06-02 20:28:32] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-02 20:28:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:32] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2020-06-02 20:28:32] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2020-06-02 20:28:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:28:33] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2020-06-02 20:28:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:33] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2020-06-02 20:28:33] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2020-06-02 20:28:33] [INFO ] Added : 25 causal constraints over 6 iterations in 47 ms. Result :sat
[2020-06-02 20:28:33] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-02 20:28:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:33] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2020-06-02 20:28:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:28:33] [INFO ] [Nat]Absence check using 7 positive place invariants in 16 ms returned sat
[2020-06-02 20:28:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:33] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2020-06-02 20:28:33] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 3 ms.
[2020-06-02 20:28:33] [INFO ] Added : 26 causal constraints over 6 iterations in 167 ms. Result :sat
[2020-06-02 20:28:33] [INFO ] [Real]Absence check using 7 positive place invariants in 16 ms returned unsat
[2020-06-02 20:28:33] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2020-06-02 20:28:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:33] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2020-06-02 20:28:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:28:33] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-02 20:28:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:33] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2020-06-02 20:28:33] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 5 ms.
[2020-06-02 20:28:33] [INFO ] Added : 26 causal constraints over 6 iterations in 94 ms. Result :sat
[2020-06-02 20:28:33] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-02 20:28:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:33] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2020-06-02 20:28:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:28:33] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2020-06-02 20:28:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:33] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2020-06-02 20:28:33] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 3 ms.
[2020-06-02 20:28:33] [INFO ] Added : 26 causal constraints over 6 iterations in 56 ms. Result :sat
Successfully simplified 8 atomic propositions for a total of 11 simplifications.
[2020-06-02 20:28:34] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-06-02 20:28:34] [INFO ] Flatten gal took : 37 ms
FORMULA MAPK-PT-05120-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-05120-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-05120-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-05120-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-05120-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-05120-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-05120-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-02 20:28:34] [INFO ] Flatten gal took : 8 ms
[2020-06-02 20:28:34] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2020-06-02 20:28:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ MAPK-PT-05120 @ 3570 seconds
FORMULA MAPK-PT-05120-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-05120-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-05120-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-05120-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-05120-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-05120-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-05120-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-05120-08 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-05120-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2805
rslt: Output for LTLCardinality @ MAPK-PT-05120
{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Tue Jun 2 20:28:34 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((F ((p4 + 1 <= p12)) AND ((p6 + 1 <= p7) OR X ((p4 + 1 <= p12)))))",
"processed_size": 69,
"rewrites": 57
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 460
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (F (((p1 <= p17) AND (p13 <= p14))))",
"processed_size": 38,
"rewrites": 57
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 537
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 537
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((p0 + 1 <= p4))",
"processed_size": 18,
"rewrites": 57
},
"result":
{
"edges": 10242,
"markings": 10242,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 645
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p4 <= p17)",
"processed_size": 11,
"rewrites": 57
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 806
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (F ((p4 <= p17)))",
"processed_size": 19,
"rewrites": 57
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 645
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((p2 + 1 <= p18) OR (p6 <= 2))",
"processed_size": 31,
"rewrites": 59
},
"result":
{
"edges": 10242,
"markings": 10242,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 12
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 806
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((p8 + 1 <= p21)))",
"processed_size": 23,
"rewrites": 57
},
"result":
{
"edges": 26239987,
"markings": 13122555,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"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": 1064
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1063
},
"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": "(3 <= p21)",
"processed_size": 10,
"rewrites": 57
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1595
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((p7 <= 1)))",
"processed_size": 17,
"rewrites": 57
},
"result":
{
"edges": 68816729,
"markings": 34415404,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1568
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1568
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"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": 2,
"visible_transitions": 0
},
"processed": "F (G (((p1 <= 1) AND (p10 <= 0))))",
"processed_size": 34,
"rewrites": 57
},
"result":
{
"edges": 28175,
"markings": 20489,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3136
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3136
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p3 <= p21)",
"processed_size": 11,
"rewrites": 57
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 8,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},
{
"child":
[
{
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p3 <= p21)",
"processed_size": 11,
"rewrites": 57
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 2,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(((p6 <= 1) U (F (G ((F ((1 <= p14)) AND ((3 <= p8) OR (1 <= p14))))) OR G ((2 <= p6)))) U (1 <= p14))",
"processed_size": 102,
"rewrites": 57
},
"result":
{
"edges": 10242,
"markings": 10242,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 12
},
"compoundnumber": 11,
"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": 10,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3668,
"runtime": 765.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(G((F(*) AND (** OR X(*)))) AND X(X(X(F(**))))) : (F(G((* AND *))) AND G((F(**) OR **))) : G(F(*)) : F(**) : (F(G(*)) AND **) : (X(**) R ((* R *) OR *)) : X(F(**)) : (((** U (F(G((F(**) AND (** OR **)))) OR G(**))) U **) AND **) : (** AND (X(F(**)) OR G(*)))"
},
"net":
{
"arcs": 90,
"conflict_clusters": 12,
"places": 22,
"places_significant": 15,
"singleton_clusters": 0,
"transitions": 30
},
"result":
{
"preliminary_value": "no no no no no unknown yes no yes ",
"value": "no no no no no unknown yes no yes "
},
"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: 52/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 704
lola: finding significant places
lola: 22 places, 30 transitions, 15 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: (G (((p6 + 1 <= p7) U NOT(X ((p12 <= p4))))) AND X (F (X (((p12 <= p4) U X ((p12 <= p4))))))) : (NOT(G ((F ((2 <= p1)) OR F ((1 <= p10))))) AND G ((F ((p16 <= p3)) OR (p1 <= p15)))) : NOT(F (G ((p21 <= p8)))) : F (((p18 <= p2) AND (3 <= p6))) : (G (NOT(G (NOT(X ((((0 <= 0) U (0 <= 0)) U NOT(F ((2 <= p7))))))))) AND (3 <= p21)) : NOT((NOT(X (((1 <= 0) U (2 <= p4)))) U (((1 <= p18) U (p12 <= p15)) AND (2 <= p4)))) : X (F (((p1 <= p17) AND (p13 <= p14)))) : ((((p6 <= 1) U (F (G (((3 <= p8) U (1 <= p14)))) OR G ((2 <= p6)))) U (1 <= p14)) AND (p3 <= p21)) : ((p4 <= p17) AND (F (((0 <= 0) U X (((p11 <= p3) U (p4 <= p17))))) OR NOT(F ((p4 <= p0)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:519
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((F ((p4 + 1 <= p12)) AND ((p6 + 1 <= p7) OR X ((p4 + 1 <= p12))))) AND X (X (X (F ((p12 <= p4))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((p4 + 1 <= p12)) AND ((p6 + 1 <= p7) OR X ((p4 + 1 <= p12)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((p4 + 1 <= p12)) AND ((p6 + 1 <= p7) OR X ((p4 + 1 <= p12)))))
lola: processed formula length: 69
lola: 57 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((2 <= p4)) R (((p18 <= 0) R (p15 + 1 <= p12)) OR (p4 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X ((2 <= p4)) R (((p18 <= 0) R (p15 + 1 <= p12)) OR (p4 <= 1)))
lola: processed formula length: 64
lola: 57 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 2615354 markings, 4709869 edges, 523071 markings/sec, 0 secs
lola: 4747128 markings, 8548350 edges, 426355 markings/sec, 5 secs
lola: 6514232 markings, 11729730 edges, 353421 markings/sec, 10 secs
lola: 8017743 markings, 14435426 edges, 300702 markings/sec, 15 secs
lola: 9670144 markings, 17411042 edges, 330480 markings/sec, 20 secs
lola: 11149979 markings, 20074149 edges, 295967 markings/sec, 25 secs
lola: 12625129 markings, 22729564 edges, 295030 markings/sec, 30 secs
lola: 14016039 markings, 25233497 edges, 278182 markings/sec, 35 secs
lola: 15396259 markings, 27719501 edges, 276044 markings/sec, 40 secs
lola: 16710040 markings, 30082445 edges, 262756 markings/sec, 45 secs
lola: 18211275 markings, 32786474 edges, 300247 markings/sec, 50 secs
lola: 19604504 markings, 35293099 edges, 278646 markings/sec, 55 secs
lola: 21027132 markings, 37855854 edges, 284526 markings/sec, 60 secs
lola: 22410393 markings, 40343484 edges, 276652 markings/sec, 65 secs
lola: 23837287 markings, 42914511 edges, 285379 markings/sec, 70 secs
lola: 25243408 markings, 45444539 edges, 281224 markings/sec, 75 secs
lola: 26637642 markings, 47954050 edges, 278847 markings/sec, 80 secs
lola: 27998429 markings, 50405184 edges, 272157 markings/sec, 85 secs
lola: 29373893 markings, 52881694 edges, 275093 markings/sec, 90 secs
lola: 30682046 markings, 55235442 edges, 261631 markings/sec, 95 secs
lola: 32004830 markings, 57616004 edges, 264557 markings/sec, 100 secs
lola: 33285515 markings, 59920726 edges, 256137 markings/sec, 105 secs
lola: 34661740 markings, 62398681 edges, 275245 markings/sec, 110 secs
lola: 36047609 markings, 64892548 edges, 277174 markings/sec, 115 secs
lola: 37376254 markings, 67283464 edges, 265729 markings/sec, 120 secs
lola: 38635679 markings, 69554066 edges, 251885 markings/sec, 125 secs
lola: 39985887 markings, 71982665 edges, 270042 markings/sec, 130 secs
lola: 41255997 markings, 74269624 edges, 254022 markings/sec, 135 secs
lola: 42602160 markings, 76692507 edges, 269233 markings/sec, 140 secs
lola: 43940193 markings, 79102112 edges, 267607 markings/sec, 145 secs
lola: 45255544 markings, 81469229 edges, 263070 markings/sec, 150 secs
lola: 46571119 markings, 83836679 edges, 263115 markings/sec, 155 secs
lola: 47884055 markings, 86203233 edges, 262587 markings/sec, 160 secs
lola: 49184705 markings, 88544001 edges, 260130 markings/sec, 165 secs
lola: 50481056 markings, 90876598 edges, 259270 markings/sec, 170 secs
lola: 51769772 markings, 93196880 edges, 257743 markings/sec, 175 secs
lola: 53063301 markings, 95525058 edges, 258706 markings/sec, 180 secs
lola: 54382892 markings, 97898865 edges, 263918 markings/sec, 185 secs
lola: 55679206 markings, 100231477 edges, 259263 markings/sec, 190 secs
lola: 56933797 markings, 102492905 edges, 250918 markings/sec, 195 secs
lola: 58153449 markings, 104688336 edges, 243930 markings/sec, 200 secs
lola: 59349964 markings, 106839273 edges, 239303 markings/sec, 205 secs
lola: 60587673 markings, 109067544 edges, 247542 markings/sec, 210 secs
lola: 61848721 markings, 111336411 edges, 252210 markings/sec, 215 secs
lola: 63092589 markings, 113577149 edges, 248774 markings/sec, 220 secs
lola: 64339475 markings, 115822598 edges, 249377 markings/sec, 225 secs
lola: 65596704 markings, 118083090 edges, 251446 markings/sec, 230 secs
lola: 66849692 markings, 120340615 edges, 250598 markings/sec, 235 secs
lola: 68076149 markings, 122547913 edges, 245291 markings/sec, 240 secs
lola: 69301687 markings, 124753805 edges, 245108 markings/sec, 245 secs
lola: 70489474 markings, 126893931 edges, 237557 markings/sec, 250 secs
lola: 71709811 markings, 129086632 edges, 244067 markings/sec, 255 secs
lola: 72938229 markings, 131302300 edges, 245684 markings/sec, 260 secs
lola: 74673564 markings, 134943416 edges, 347067 markings/sec, 265 secs
lola: 77478517 markings, 141862610 edges, 560991 markings/sec, 270 secs
lola: 80288548 markings, 148824373 edges, 562006 markings/sec, 275 secs
lola: 82990779 markings, 155538382 edges, 540446 markings/sec, 280 secs
lola: 84842947 markings, 160138849 edges, 370434 markings/sec, 285 secs
lola: 86568450 markings, 164428502 edges, 345101 markings/sec, 290 secs
lola: 88828773 markings, 170049651 edges, 452065 markings/sec, 295 secs
lola: 90665176 markings, 174620698 edges, 367281 markings/sec, 300 secs
lola: 92366810 markings, 178855696 edges, 340327 markings/sec, 305 secs
lola: 94763921 markings, 184823800 edges, 479422 markings/sec, 310 secs
lola: 96818405 markings, 189940018 edges, 410897 markings/sec, 315 secs
lola: 98428927 markings, 193945936 edges, 322104 markings/sec, 320 secs
lola: 100467867 markings, 199027455 edges, 407788 markings/sec, 325 secs
lola: 102536933 markings, 204183710 edges, 413813 markings/sec, 330 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 460 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((p1 <= p17) AND (p13 <= p14))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((p1 <= p17) AND (p13 <= p14))))
lola: processed formula length: 38
lola: 57 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 3 will run for 537 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p4 <= p17) AND (X (F ((p4 <= p17))) OR G ((p0 + 1 <= p4))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 537 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p0 + 1 <= p4))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p0 + 1 <= p4))
lola: processed formula length: 18
lola: 57 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 10242 markings, 10242 edges
lola: ========================================
lola: subprocess 4 will run for 645 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p4 <= p17)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p4 <= p17)
lola: processed formula length: 11
lola: 57 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 806 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p4 <= p17)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p4 <= p17)))
lola: processed formula length: 19
lola: 57 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 645 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((p18 <= p2) AND (3 <= p6)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p2 + 1 <= p18) OR (p6 <= 2))
lola: processed formula length: 31
lola: 59 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 10242 markings, 10242 edges
lola: ========================================
lola: subprocess 5 will run for 806 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p8 + 1 <= p21)))
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 ((p8 + 1 <= p21)))
lola: processed formula length: 23
lola: 57 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 2550053 markings, 5098625 edges, 510011 markings/sec, 0 secs
lola: 4938651 markings, 9874723 edges, 477720 markings/sec, 5 secs
lola: 7012577 markings, 14021482 edges, 414785 markings/sec, 10 secs
lola: 8713108 markings, 17424019 edges, 340106 markings/sec, 15 secs
lola: 10566880 markings, 21129846 edges, 370754 markings/sec, 20 secs
lola: 12217159 markings, 24429920 edges, 330056 markings/sec, 25 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 13122555 markings, 26239987 edges
lola: ========================================
lola: subprocess 6 will run for 1064 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((p7 <= 1))) AND (3 <= p21))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 1063 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= p21)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p21)
lola: processed formula length: 10
lola: 57 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 1595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p7 <= 1)))
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 ((p7 <= 1)))
lola: processed formula length: 17
lola: 57 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 3263255 markings, 6513546 edges, 652651 markings/sec, 0 secs
lola: 6448419 markings, 12883337 edges, 637033 markings/sec, 5 secs
lola: 9612480 markings, 19213400 edges, 632812 markings/sec, 10 secs
lola: 12816699 markings, 25618771 edges, 640844 markings/sec, 15 secs
lola: 15999534 markings, 31985933 edges, 636567 markings/sec, 20 secs
lola: 19065092 markings, 38116872 edges, 613112 markings/sec, 25 secs
lola: 22144239 markings, 44275160 edges, 615829 markings/sec, 30 secs
lola: 25081037 markings, 50149932 edges, 587360 markings/sec, 35 secs
lola: 28102433 markings, 56191047 edges, 604279 markings/sec, 40 secs
lola: 31297452 markings, 62581208 edges, 639004 markings/sec, 45 secs
lola: 34415404 markings, 68816729 edges, 623590 markings/sec, 50 secs
lola: add low 26
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: 34415404 markings, 68816729 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 1568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G (((p1 <= 1) AND (p10 <= 0)))) AND G ((F ((p16 <= p3)) OR (p1 <= p15))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 1568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p1 <= 1) AND (p10 <= 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 (((p1 <= 1) AND (p10 <= 0))))
lola: processed formula length: 34
lola: 57 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 28
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: 20489 markings, 28175 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 3136 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((p6 <= 1) U (F (G ((F ((1 <= p14)) AND ((3 <= p8) OR (1 <= p14))))) OR G ((2 <= p6)))) U (1 <= p14)) AND (p3 <= p21))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 3136 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p3 <= p21)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p3 <= p21)
lola: processed formula length: 11
lola: 57 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: 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: (X ((2 <= p4)) R (((p18 <= 0) R (p15 + 1 <= p12)) OR (p4 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X ((2 <= p4)) R (((p18 <= 0) R (p15 + 1 <= p12)) OR (p4 <= 1)))
lola: processed formula length: 64
lola: 57 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 2856130 markings, 5143736 edges, 571226 markings/sec, 0 secs
lola: 5370732 markings, 9671155 edges, 502920 markings/sec, 5 secs
lola: 7295973 markings, 13136297 edges, 385048 markings/sec, 10 secs
lola: 8881993 markings, 15992199 edges, 317204 markings/sec, 15 secs
lola: 10409927 markings, 18741925 edges, 305587 markings/sec, 20 secs
lola: 11869090 markings, 21369651 edges, 291833 markings/sec, 25 secs
lola: 13322343 markings, 23984852 edges, 290651 markings/sec, 30 secs
lola: 14774020 markings, 26598227 edges, 290335 markings/sec, 35 secs
lola: 16216436 markings, 29194664 edges, 288483 markings/sec, 40 secs
lola: 17668886 markings, 31810230 edges, 290490 markings/sec, 45 secs
lola: 19090016 markings, 34367769 edges, 284226 markings/sec, 50 secs
lola: 20490755 markings, 36890784 edges, 280148 markings/sec, 55 secs
lola: 21896284 markings, 39420958 edges, 281106 markings/sec, 60 secs
lola: 23328880 markings, 41997749 edges, 286519 markings/sec, 65 secs
lola: 24747848 markings, 44553959 edges, 283794 markings/sec, 70 secs
lola: 26165010 markings, 47105950 edges, 283432 markings/sec, 75 secs
lola: 27591833 markings, 49671041 edges, 285365 markings/sec, 80 secs
lola: 29008376 markings, 52223892 edges, 283309 markings/sec, 85 secs
lola: 30417177 markings, 54759051 edges, 281760 markings/sec, 90 secs
lola: 31840359 markings, 57320329 edges, 284636 markings/sec, 95 secs
lola: 33250750 markings, 59860563 edges, 282078 markings/sec, 100 secs
lola: 34647229 markings, 62374510 edges, 279296 markings/sec, 105 secs
lola: 36028299 markings, 64859076 edges, 276214 markings/sec, 110 secs
lola: 37391029 markings, 67314647 edges, 272546 markings/sec, 115 secs
lola: 38756542 markings, 69768474 edges, 273103 markings/sec, 120 secs
lola: 40123586 markings, 72232603 edges, 273409 markings/sec, 125 secs
lola: 41441916 markings, 74603819 edges, 263666 markings/sec, 130 secs
lola: 42766235 markings, 76991270 edges, 264864 markings/sec, 135 secs
lola: 44093161 markings, 79379714 edges, 265385 markings/sec, 140 secs
lola: 45428168 markings, 81780006 edges, 267001 markings/sec, 145 secs
lola: 46754509 markings, 84166819 edges, 265268 markings/sec, 150 secs
lola: 48066768 markings, 86530999 edges, 262452 markings/sec, 155 secs
lola: 49376674 markings, 88887608 edges, 261981 markings/sec, 160 secs
lola: 50700193 markings, 91270257 edges, 264704 markings/sec, 165 secs
lola: 52017733 markings, 93642795 edges, 263508 markings/sec, 170 secs
lola: 53342825 markings, 96026162 edges, 265018 markings/sec, 175 secs
lola: 54640948 markings, 98365470 edges, 259625 markings/sec, 180 secs
lola: 55935053 markings, 100694481 edges, 258821 markings/sec, 185 secs
lola: 57220689 markings, 103006829 edges, 257127 markings/sec, 190 secs
lola: 58478207 markings, 105270631 edges, 251504 markings/sec, 195 secs
lola: 59737894 markings, 107539691 edges, 251937 markings/sec, 200 secs
lola: 60967997 markings, 109752395 edges, 246021 markings/sec, 205 secs
lola: 62196169 markings, 111963187 edges, 245634 markings/sec, 210 secs
lola: 63417095 markings, 114163396 edges, 244185 markings/sec, 215 secs
lola: 64599486 markings, 116291979 edges, 236478 markings/sec, 220 secs
lola: 65838182 markings, 118521226 edges, 247739 markings/sec, 225 secs
lola: 67039900 markings, 120684521 edges, 240344 markings/sec, 230 secs
lola: 68241037 markings, 122845600 edges, 240227 markings/sec, 235 secs
lola: 69469464 markings, 125057656 edges, 245685 markings/sec, 240 secs
lola: 70677929 markings, 127233286 edges, 241693 markings/sec, 245 secs
lola: 71923291 markings, 129474893 edges, 249072 markings/sec, 250 secs
lola: 73167275 markings, 131714248 edges, 248797 markings/sec, 255 secs
lola: 75359659 markings, 136624378 edges, 438477 markings/sec, 260 secs
lola: 78168157 markings, 143568371 edges, 561700 markings/sec, 265 secs
lola: 81009908 markings, 150617873 edges, 568350 markings/sec, 270 secs
lola: 83642445 markings, 157156596 edges, 526507 markings/sec, 275 secs
lola: 85532221 markings, 161854874 edges, 377955 markings/sec, 280 secs
lola: 87198088 markings, 165992538 edges, 333173 markings/sec, 285 secs
lola: 89146121 markings, 170840286 edges, 389607 markings/sec, 290 secs
lola: 91128829 markings, 175773176 edges, 396542 markings/sec, 295 secs
lola: 92988966 markings, 180403378 edges, 372027 markings/sec, 300 secs
lola: 95129712 markings, 185736868 edges, 428149 markings/sec, 305 secs
lola: 97448694 markings, 191510263 edges, 463796 markings/sec, 310 secs
lola: 99221438 markings, 195923461 edges, 354549 markings/sec, 315 secs
lola: 101432931 markings, 201431033 edges, 442299 markings/sec, 320 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: ((((p6 <= 1) U (F (G ((F ((1 <= p14)) AND ((3 <= p8) OR (1 <= p14))))) OR G ((2 <= p6)))) U (1 <= p14)) AND (p3 <= p21))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (p3 <= p21)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p3 <= p21)
lola: processed formula length: 11
lola: 57 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ...considering subproblem: (((p6 <= 1) U (F (G ((F ((1 <= p14)) AND ((3 <= p8) OR (1 <= p14))))) OR G ((2 <= p6)))) U (1 <= p14))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((p6 <= 1) U (F (G ((F ((1 <= p14)) AND ((3 <= p8) OR (1 <= p14))))) OR G ((2 <= p6)))) U (1 <= p14))
lola: processed formula length: 102
lola: 57 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 12 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: ========================================
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: 10242 markings, 10242 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no unknown yes no yes
lola:
preliminary result: no no no no no unknown yes no yes
lola: memory consumption: 3668 KB
lola: time consumption: 765 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished
--------------------
content from stderr:
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MAPK-PT-05120"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is MAPK-PT-05120, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r174-csrt-158987852700073"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MAPK-PT-05120.tgz
mv MAPK-PT-05120 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;