Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2021-input.r056-oct2-162038334800221.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is CloudOpsManagement-PT-02560by01280, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r056-oct2-162038334800221
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 360K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 109K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Mar 28 15:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 28 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 28 15:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Mar 23 03:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 03:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 22 12:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 12:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 13 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 16K May 5 16:51 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 CloudOpsManagement-PT-02560by01280-00
FORMULA_NAME CloudOpsManagement-PT-02560by01280-01
FORMULA_NAME CloudOpsManagement-PT-02560by01280-02
FORMULA_NAME CloudOpsManagement-PT-02560by01280-03
FORMULA_NAME CloudOpsManagement-PT-02560by01280-04
FORMULA_NAME CloudOpsManagement-PT-02560by01280-05
FORMULA_NAME CloudOpsManagement-PT-02560by01280-06
FORMULA_NAME CloudOpsManagement-PT-02560by01280-07
FORMULA_NAME CloudOpsManagement-PT-02560by01280-08
FORMULA_NAME CloudOpsManagement-PT-02560by01280-09
FORMULA_NAME CloudOpsManagement-PT-02560by01280-10
FORMULA_NAME CloudOpsManagement-PT-02560by01280-11
FORMULA_NAME CloudOpsManagement-PT-02560by01280-12
FORMULA_NAME CloudOpsManagement-PT-02560by01280-13
FORMULA_NAME CloudOpsManagement-PT-02560by01280-14
FORMULA_NAME CloudOpsManagement-PT-02560by01280-15

=== Now, execution of the tool begins

BK_START 1620903122206

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 10:52:03] [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]
[2021-05-13 10:52:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 10:52:03] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2021-05-13 10:52:03] [INFO ] Transformed 27 places.
[2021-05-13 10:52:03] [INFO ] Transformed 29 transitions.
[2021-05-13 10:52:03] [INFO ] Parsed PT model containing 27 places and 29 transitions in 100 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 59 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 102451 steps, including 0 resets, run finished after 73 ms. (steps per millisecond=1403 ) properties seen :[1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0]
// Phase 1: matrix 29 rows 27 cols
[2021-05-13 10:52:04] [INFO ] Computed 11 place invariants in 16 ms
[2021-05-13 10:52:04] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2021-05-13 10:52:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:52:04] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-13 10:52:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:52:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2021-05-13 10:52:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:52:04] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2021-05-13 10:52:04] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-13 10:52:04] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:52:04] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:52:04] [INFO ] Added : 25 causal constraints over 6 iterations in 46 ms. Result :sat
[2021-05-13 10:52:04] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned unsat
[2021-05-13 10:52:04] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2021-05-13 10:52:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:52:04] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-13 10:52:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:52:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:52:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:52:04] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2021-05-13 10:52:04] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-13 10:52:04] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:52:04] [INFO ] Added : 25 causal constraints over 6 iterations in 17 ms. Result :sat
[2021-05-13 10:52:04] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned unsat
[2021-05-13 10:52:04] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:52:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:52:04] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2021-05-13 10:52:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:52:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2021-05-13 10:52:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:52:04] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-13 10:52:04] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:52:04] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 10:52:04] [INFO ] Added : 25 causal constraints over 5 iterations in 18 ms. Result :sat
[2021-05-13 10:52:04] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:52:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:52:04] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-13 10:52:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:52:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:52:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:52:04] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 10:52:04] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:52:04] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 3 ms.
[2021-05-13 10:52:04] [INFO ] Added : 25 causal constraints over 6 iterations in 22 ms. Result :sat
[2021-05-13 10:52:04] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned unsat
[2021-05-13 10:52:04] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned unsat
[2021-05-13 10:52:04] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2021-05-13 10:52:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:52:04] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-13 10:52:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:52:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:52:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:52:04] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-13 10:52:04] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-13 10:52:04] [INFO ] Deduced a trap composed of 4 places in 26 ms
[2021-05-13 10:52:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2021-05-13 10:52:04] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 3 ms.
[2021-05-13 10:52:04] [INFO ] Added : 26 causal constraints over 6 iterations in 19 ms. Result :sat
[2021-05-13 10:52:04] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned unsat
[2021-05-13 10:52:04] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:52:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:52:04] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 10:52:04] [INFO ] [Real]Added 3 Read/Feed constraints in 4 ms returned sat
[2021-05-13 10:52:04] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 3 ms.
[2021-05-13 10:52:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:52:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:52:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:52:04] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-13 10:52:04] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:52:04] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:52:04] [INFO ] Added : 25 causal constraints over 6 iterations in 20 ms. Result :sat
[2021-05-13 10:52:04] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:52:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:52:04] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-13 10:52:04] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:52:04] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 10:52:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:52:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:52:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:52:04] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-13 10:52:04] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:52:04] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 10:52:04] [INFO ] Added : 25 causal constraints over 6 iterations in 15 ms. Result :sat
[2021-05-13 10:52:04] [INFO ] [Real]Absence check using 11 positive place invariants in 1 ms returned unsat
[2021-05-13 10:52:04] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2021-05-13 10:52:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:52:04] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-13 10:52:04] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-13 10:52:04] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 10:52:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:52:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:52:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:52:04] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-13 10:52:04] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:52:04] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 10:52:04] [INFO ] Added : 25 causal constraints over 6 iterations in 14 ms. Result :sat
[2021-05-13 10:52:04] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:52:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:52:04] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-13 10:52:04] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-13 10:52:04] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:52:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:52:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 11 ms returned sat
[2021-05-13 10:52:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:52:04] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2021-05-13 10:52:04] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2021-05-13 10:52:04] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:52:04] [INFO ] Added : 25 causal constraints over 6 iterations in 24 ms. Result :sat
[2021-05-13 10:52:04] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:52:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:52:04] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-13 10:52:04] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-13 10:52:04] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 10:52:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:52:05] [INFO ] [Nat]Absence check using 11 positive place invariants in 12 ms returned sat
[2021-05-13 10:52:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:52:05] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2021-05-13 10:52:05] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:52:05] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:52:05] [INFO ] Added : 25 causal constraints over 6 iterations in 18 ms. Result :sat
[2021-05-13 10:52:05] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:52:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:52:05] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-13 10:52:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:52:05] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2021-05-13 10:52:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:52:05] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-13 10:52:05] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:52:05] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 10:52:05] [INFO ] Added : 25 causal constraints over 5 iterations in 24 ms. Result :sat
Successfully simplified 6 atomic propositions for a total of 8 simplifications.
[2021-05-13 10:52:05] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2021-05-13 10:52:05] [INFO ] Flatten gal took : 22 ms
FORMULA CloudOpsManagement-PT-02560by01280-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-02560by01280-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-02560by01280-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-02560by01280-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-02560by01280-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-02560by01280-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 10:52:05] [INFO ] Flatten gal took : 4 ms
[2021-05-13 10:52:05] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-13 10:52:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ CloudOpsManagement-PT-02560by01280 @ 3570 seconds

FORMULA CloudOpsManagement-PT-02560by01280-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-02560by01280-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-02560by01280-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-02560by01280-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-02560by01280-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-02560by01280-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-02560by01280-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-02560by01280-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-02560by01280-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-02560by01280-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3083
rslt: Output for LTLCardinality @ CloudOpsManagement-PT-02560by01280

{
"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": "Thu May 13 10:52:05 2021
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F ((2 <= p1)))",
"processed_size": 17,
"rewrites": 39
},
"result":
{
"edges": 5121,
"markings": 5121,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 0,
"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": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 2,
"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": "X (X ((2 <= p1)))",
"processed_size": 17,
"rewrites": 39
},
"result":
{
"edges": 1285,
"markings": 1285,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"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 ((p13 <= p21)))",
"processed_size": 20,
"rewrites": 39
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 2,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((F ((p15 + 1 <= p11)) AND (p25 + 1 <= p0)) U (X (F ((p25 <= 1))) U ((p25 + 1 <= p0) AND (p25 <= 1))))",
"processed_size": 102,
"rewrites": 39
},
"result":
{
"edges": 24322,
"markings": 24322,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"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": 3,
"visible_transitions": 0
},
"processed": "X (G (((p3 + 1 <= p5) AND (p26 <= p3))))",
"processed_size": 40,
"rewrites": 39
},
"result":
{
"edges": 1285,
"markings": 1285,
"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": 594
},
"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": "F (G ((p2 + 1 <= p6)))",
"processed_size": 22,
"rewrites": 39
},
"result":
{
"edges": 79229,
"markings": 40900,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"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": "((1 <= p6) U (3 <= p1))",
"processed_size": 23,
"rewrites": 39
},
"result":
{
"edges": 2561,
"markings": 2561,
"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": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1108
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (G ((F ((p26 <= p10)) AND (p8 + 1 <= p22))))",
"processed_size": 46,
"rewrites": 39
},
"result":
{
"edges": 1286,
"markings": 1285,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 7,
"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": 1662
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p3 <= p2)",
"processed_size": 10,
"rewrites": 41
},
"result":
{
"edges": 2561,
"markings": 2561,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 8
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3324
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G ((p9 <= 1))",
"processed_size": 13,
"rewrites": 39
},
"result":
{
"edges": 7685,
"markings": 7685,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"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": "((p13 <= p15) U (3 <= p4))",
"processed_size": 26,
"rewrites": 39
},
"result":
{
"edges": 2561,
"markings": 2561,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3388,
"runtime": 487.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X(X(**)) OR G(F(**))) : ((** U **) AND (G(*) AND (G(*) OR G(F(*))))) : ((** OR (G(**) AND F(**))) AND ((** U **) U **)) : X(F(**)) : ((F(*) AND **) U (X(F(*)) U **)) : X(G(**)) : (** U **) : G((G(*) OR *)) : F(G(*)) : F(G((F(**) AND **)))"
},
"net":
{
"arcs": 94,
"conflict_clusters": 11,
"places": 27,
"places_significant": 16,
"singleton_clusters": 0,
"transitions": 29
},
"result":
{
"preliminary_value": "no no no yes no no no unknown no no ",
"value": "no no no yes no no no unknown 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: 56/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 864
lola: finding significant places
lola: 27 places, 29 transitions, 16 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: (X (X ((2 <= p1))) OR NOT(X (F (NOT(F ((2 <= p1))))))) : (((p13 <= p15) U (3 <= p4)) AND NOT((F (G ((2 <= p9))) U ((0 <= 0) U F ((2 <= p9)))))) : ((G ((p3 <= p10)) U (p2 + 1 <= p3)) AND (((p21 <= p18) U (p3 <= p2)) U (p3 <= p10))) : F (X ((p13 <= p21))) : ((NOT(G ((p11 <= p15))) AND (p25 + 1 <= p0)) U (X (NOT(G ((2 <= p25)))) U ((p25 + 1 <= p0) AND (p25 <= 1)))) : X (G (((p3 + 1 <= p5) AND (p26 <= p3)))) : ((1 <= p6) U (3 <= p1)) : NOT(F ((F ((2 <= p15)) AND (p16 <= p21)))) : F (NOT(F ((p6 <= p2)))) : F (X (G (F (G (X ((F ((p26 <= p10)) AND (p8 + 1 <= p22))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X ((2 <= p1))) OR G (F ((2 <= p1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((2 <= p1)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((2 <= p1)))
lola: processed formula length: 17
lola: 39 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: 5121 markings, 5121 edges
lola: ========================================
lola: subprocess 1 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((2 <= p1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((2 <= p1)))
lola: processed formula length: 17
lola: 39 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: 1285 markings, 1285 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p13 <= p21)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p13 <= p21)))
lola: processed formula length: 20
lola: 39 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: 4 markings, 3 edges
lola: ========================================
lola: subprocess 2 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F ((p15 + 1 <= p11)) AND (p25 + 1 <= p0)) U (X (F ((p25 <= 1))) U ((p25 + 1 <= p0) AND (p25 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((F ((p15 + 1 <= p11)) AND (p25 + 1 <= p0)) U (X (F ((p25 <= 1))) U ((p25 + 1 <= p0) AND (p25 <= 1))))
lola: processed formula length: 102
lola: 39 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 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: 24322 markings, 24322 edges
lola: ========================================
lola: subprocess 3 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((p3 + 1 <= p5) AND (p26 <= p3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((p3 + 1 <= p5) AND (p26 <= p3))))
lola: processed formula length: 40
lola: 39 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1285 markings, 1285 edges
lola: ========================================
lola: subprocess 4 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p2 + 1 <= p6)))
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 ((p2 + 1 <= p6)))
lola: processed formula length: 22
lola: 39 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 0
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: 40900 markings, 79229 edges
lola: ========================================
lola: subprocess 5 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p6) U (3 <= p1))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((1 <= p6) U (3 <= p1))
lola: processed formula length: 23
lola: 39 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: 2561 markings, 2561 edges
lola: ========================================
lola: subprocess 6 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G ((p15 <= 1)) OR (p21 + 1 <= p16)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G ((p15 <= 1)) OR (p21 + 1 <= p16)))
lola: processed formula length: 40
lola: 39 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 3724045 markings, 9247042 edges, 744809 markings/sec, 0 secs
lola: 7219965 markings, 18274883 edges, 699184 markings/sec, 5 secs
lola: 10824988 markings, 27045907 edges, 721005 markings/sec, 10 secs
lola: 14231899 markings, 35865636 edges, 681382 markings/sec, 15 secs
lola: 17681812 markings, 44387126 edges, 689983 markings/sec, 20 secs
lola: 20748526 markings, 52989083 edges, 613343 markings/sec, 25 secs
lola: 24238413 markings, 61678907 edges, 697977 markings/sec, 30 secs
lola: 27567261 markings, 70242611 edges, 665770 markings/sec, 35 secs
lola: 30791643 markings, 78808709 edges, 644876 markings/sec, 40 secs
lola: 34367710 markings, 87040405 edges, 715213 markings/sec, 45 secs
lola: 37866105 markings, 95340261 edges, 699679 markings/sec, 50 secs
lola: 40887300 markings, 103962739 edges, 604239 markings/sec, 55 secs
lola: 43914108 markings, 112128168 edges, 605362 markings/sec, 60 secs
lola: 47462314 markings, 120002098 edges, 709641 markings/sec, 65 secs
lola: 50249793 markings, 128704960 edges, 557496 markings/sec, 70 secs
lola: 54170235 markings, 136592416 edges, 784088 markings/sec, 75 secs
lola: 56765147 markings, 145206389 edges, 518982 markings/sec, 80 secs
lola: 60741149 markings, 153208051 edges, 795200 markings/sec, 85 secs
lola: 63352317 markings, 162183214 edges, 522234 markings/sec, 90 secs
lola: 67348930 markings, 170224937 edges, 799323 markings/sec, 95 secs
lola: 69731402 markings, 179097709 edges, 476494 markings/sec, 100 secs
lola: 73709788 markings, 187090359 edges, 795677 markings/sec, 105 secs
lola: 76650847 markings, 195352371 edges, 588212 markings/sec, 110 secs
lola: 79722784 markings, 203634196 edges, 614387 markings/sec, 115 secs
lola: 83630185 markings, 211497509 edges, 781480 markings/sec, 120 secs
lola: 85599556 markings, 220326281 edges, 393874 markings/sec, 125 secs
lola: 89566622 markings, 228281269 edges, 793413 markings/sec, 130 secs
lola: 93488965 markings, 236179835 edges, 784469 markings/sec, 135 secs
lola: 95398568 markings, 245294709 edges, 381921 markings/sec, 140 secs
lola: 99349222 markings, 253229801 edges, 790131 markings/sec, 145 secs
lola: 103242383 markings, 261068612 edges, 778632 markings/sec, 150 secs
lola: 104729666 markings, 269809477 edges, 297457 markings/sec, 155 secs
lola: 108676599 markings, 277713451 edges, 789387 markings/sec, 160 secs
lola: 112538992 markings, 285485916 edges, 772479 markings/sec, 165 secs
lola: 115089310 markings, 294087255 edges, 510064 markings/sec, 170 secs
lola: 117853207 markings, 302379256 edges, 552779 markings/sec, 175 secs
lola: 121655793 markings, 310027410 edges, 760517 markings/sec, 180 secs
lola: 122714857 markings, 312163157 edges, 211813 markings/sec, 185 secs
lola: 126025209 markings, 318832435 edges, 662070 markings/sec, 190 secs
lola: 127052141 markings, 326690680 edges, 205386 markings/sec, 195 secs
lola: 130105395 markings, 333735488 edges, 610651 markings/sec, 200 secs
lola: 133697112 markings, 340959034 edges, 718343 markings/sec, 205 secs
lola: 137211513 markings, 348032703 edges, 702880 markings/sec, 210 secs
lola: 139348605 markings, 356311932 edges, 427418 markings/sec, 215 secs
lola: 141558024 markings, 364036461 edges, 441884 markings/sec, 220 secs
lola: 145025657 markings, 371001195 edges, 693527 markings/sec, 225 secs
lola: 148507273 markings, 378007536 edges, 696323 markings/sec, 230 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 1108 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((p26 <= p10)) AND (p8 + 1 <= p22))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((p26 <= p10)) AND (p8 + 1 <= p22))))
lola: processed formula length: 46
lola: 39 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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 24
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: 1285 markings, 1286 edges
lola: ========================================
lola: subprocess 8 will run for 1662 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p2 + 1 <= p3) OR (G ((p3 <= p10)) AND F ((p2 + 1 <= p3)))) AND (((p21 <= p18) U (p3 <= p2)) U (p3 <= p10)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 1662 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p2 + 1 <= p3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p2 + 1 <= p3)
lola: processed formula length: 14
lola: 39 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 3324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p2 + 1 <= p3))
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: (p3 <= p2)
lola: processed formula length: 10
lola: 41 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: 2561 markings, 2561 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 3324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p13 <= p15) U (3 <= p4)) AND (G ((p9 <= 1)) AND (G ((p9 <= 1)) OR G (F ((p9 <= 1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 3324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p9 <= 1))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p9 <= 1))
lola: processed formula length: 13
lola: 39 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: 7685 markings, 7685 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p13 <= p15) U (3 <= p4))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p13 <= p15) U (3 <= p4))
lola: processed formula length: 26
lola: 39 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: 2561 markings, 2561 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G ((G ((p15 <= 1)) OR (p21 + 1 <= p16)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G ((p15 <= 1)) OR (p21 + 1 <= p16)))
lola: processed formula length: 40
lola: 39 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 3639771 markings, 9077016 edges, 727954 markings/sec, 0 secs
lola: 7025943 markings, 17858260 edges, 677234 markings/sec, 5 secs
lola: 10454491 markings, 26298100 edges, 685710 markings/sec, 10 secs
lola: 13700513 markings, 34796298 edges, 649204 markings/sec, 15 secs
lola: 17193103 markings, 43008381 edges, 698518 markings/sec, 20 secs
lola: 20382416 markings, 51507665 edges, 637863 markings/sec, 25 secs
lola: 23655504 markings, 60512849 edges, 654618 markings/sec, 30 secs
lola: 27000601 markings, 69108070 edges, 669019 markings/sec, 35 secs
lola: 30400833 markings, 77504366 edges, 680046 markings/sec, 40 secs
lola: 34196561 markings, 85664315 edges, 759146 markings/sec, 45 secs
lola: 37177719 markings, 93954119 edges, 596232 markings/sec, 50 secs
lola: 40044232 markings, 102266915 edges, 573303 markings/sec, 55 secs
lola: 43720384 markings, 110440213 edges, 735230 markings/sec, 60 secs
lola: 46882930 markings, 118835589 edges, 632509 markings/sec, 65 secs
lola: 49597945 markings, 127404820 edges, 543003 markings/sec, 70 secs
lola: 53538437 markings, 135319311 edges, 788098 markings/sec, 75 secs
lola: 56176656 markings, 144026451 edges, 527644 markings/sec, 80 secs
lola: 60192829 markings, 152104042 edges, 803235 markings/sec, 85 secs
lola: 62750985 markings, 160978122 edges, 511631 markings/sec, 90 secs
lola: 66666167 markings, 168851060 edges, 783036 markings/sec, 95 secs
lola: 69104507 markings, 177484634 edges, 487668 markings/sec, 100 secs
lola: 72911682 markings, 185483284 edges, 761435 markings/sec, 105 secs
lola: 76440289 markings, 193504774 edges, 705721 markings/sec, 110 secs
lola: 78961426 markings, 202102983 edges, 504227 markings/sec, 115 secs
lola: 82794745 markings, 209814986 edges, 766664 markings/sec, 120 secs
lola: 85189218 markings, 217735592 edges, 478895 markings/sec, 125 secs
lola: 88265705 markings, 225664293 edges, 615297 markings/sec, 130 secs
lola: 92112259 markings, 233405115 edges, 769311 markings/sec, 135 secs
lola: 94389899 markings, 241384631 edges, 455528 markings/sec, 140 secs
lola: 97245424 markings, 248998041 edges, 571105 markings/sec, 145 secs
lola: 101002876 markings, 256558112 edges, 751490 markings/sec, 150 secs
lola: 104071702 markings, 264416641 edges, 613765 markings/sec, 155 secs
lola: 106122249 markings, 272582286 edges, 410109 markings/sec, 160 secs
lola: 109903912 markings, 280184133 edges, 756333 markings/sec, 165 secs
lola: 113700965 markings, 287826792 edges, 759411 markings/sec, 170 secs
lola: 115326859 markings, 296228686 edges, 325179 markings/sec, 175 secs
lola: 118659066 markings, 303998044 edges, 666441 markings/sec, 180 secs
lola: 122380032 markings, 311484564 edges, 744193 markings/sec, 185 secs
lola: 125772161 markings, 318317582 edges, 678426 markings/sec, 190 secs
lola: 126998522 markings, 326193850 edges, 245272 markings/sec, 195 secs
lola: 129957235 markings, 333438244 edges, 591743 markings/sec, 200 secs
lola: 133441200 markings, 340444726 edges, 696793 markings/sec, 205 secs
lola: 136950325 markings, 347506270 edges, 701825 markings/sec, 210 secs
lola: 139224125 markings, 355203108 edges, 454760 markings/sec, 215 secs
lola: 141137236 markings, 363191927 edges, 382622 markings/sec, 220 secs
lola: 144510160 markings, 369963501 edges, 674585 markings/sec, 225 secs
lola: 147882451 markings, 376749020 edges, 674458 markings/sec, 230 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no no yes no no no unknown no no
lola:
preliminary result: no no no yes no no no unknown no no
lola: memory consumption: 3388 KB
lola: time consumption: 487 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="CloudOpsManagement-PT-02560by01280"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 gold2020"
echo " Input is CloudOpsManagement-PT-02560by01280, 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 r056-oct2-162038334800221"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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