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-162038334600133.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 CloudDeployment-PT-2a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r056-oct2-162038334600133
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 151K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 88K 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.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 23 03:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 03:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 22 12:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 22 12:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 51K 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 CloudDeployment-PT-2a-00
FORMULA_NAME CloudDeployment-PT-2a-01
FORMULA_NAME CloudDeployment-PT-2a-02
FORMULA_NAME CloudDeployment-PT-2a-03
FORMULA_NAME CloudDeployment-PT-2a-04
FORMULA_NAME CloudDeployment-PT-2a-05
FORMULA_NAME CloudDeployment-PT-2a-06
FORMULA_NAME CloudDeployment-PT-2a-07
FORMULA_NAME CloudDeployment-PT-2a-08
FORMULA_NAME CloudDeployment-PT-2a-09
FORMULA_NAME CloudDeployment-PT-2a-10
FORMULA_NAME CloudDeployment-PT-2a-11
FORMULA_NAME CloudDeployment-PT-2a-12
FORMULA_NAME CloudDeployment-PT-2a-13
FORMULA_NAME CloudDeployment-PT-2a-14
FORMULA_NAME CloudDeployment-PT-2a-15

=== Now, execution of the tool begins

BK_START 1620899308749

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 09:48: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]
[2021-05-13 09:48:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 09:48:30] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2021-05-13 09:48:30] [INFO ] Transformed 69 places.
[2021-05-13 09:48:30] [INFO ] Transformed 174 transitions.
[2021-05-13 09:48:30] [INFO ] Found NUPN structural information;
[2021-05-13 09:48:30] [INFO ] Parsed PT model containing 69 places and 174 transitions in 77 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 3037 resets, run finished after 142 ms. (steps per millisecond=704 ) properties seen :[1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-05-13 09:48:30] [INFO ] Flow matrix only has 100 transitions (discarded 60 similar events)
// Phase 1: matrix 100 rows 69 cols
[2021-05-13 09:48:30] [INFO ] Computed 12 place invariants in 4 ms
[2021-05-13 09:48:30] [INFO ] [Real]Absence check using 0 positive and 12 generalized place invariants in 14 ms returned sat
[2021-05-13 09:48:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:48:31] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2021-05-13 09:48:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 09:48:31] [INFO ] [Nat]Absence check using 0 positive and 12 generalized place invariants in 9 ms returned unsat
[2021-05-13 09:48:31] [INFO ] [Real]Absence check using 0 positive and 12 generalized place invariants in 5 ms returned sat
[2021-05-13 09:48:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:48:31] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2021-05-13 09:48:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 09:48:31] [INFO ] [Nat]Absence check using 0 positive and 12 generalized place invariants in 65 ms returned sat
[2021-05-13 09:48:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 09:48:31] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2021-05-13 09:48:31] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-13 09:48:31] [INFO ] [Nat]Added 30 Read/Feed constraints in 35 ms returned sat
[2021-05-13 09:48:31] [INFO ] Computed and/alt/rep : 159/656/99 causal constraints in 13 ms.
[2021-05-13 09:48:31] [INFO ] Added : 78 causal constraints over 16 iterations in 291 ms. Result :sat
[2021-05-13 09:48:31] [INFO ] [Real]Absence check using 0 positive and 12 generalized place invariants in 5 ms returned sat
[2021-05-13 09:48:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:48:31] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2021-05-13 09:48:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 09:48:31] [INFO ] [Nat]Absence check using 0 positive and 12 generalized place invariants in 4 ms returned unsat
[2021-05-13 09:48:31] [INFO ] [Real]Absence check using 0 positive and 12 generalized place invariants in 8 ms returned sat
[2021-05-13 09:48:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:48:31] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2021-05-13 09:48:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 09:48:31] [INFO ] [Nat]Absence check using 0 positive and 12 generalized place invariants in 5 ms returned sat
[2021-05-13 09:48:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 09:48:32] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2021-05-13 09:48:32] [INFO ] [Nat]Added 30 Read/Feed constraints in 5 ms returned sat
[2021-05-13 09:48:32] [INFO ] Computed and/alt/rep : 159/656/99 causal constraints in 51 ms.
[2021-05-13 09:48:32] [INFO ] Added : 83 causal constraints over 19 iterations in 346 ms. Result :sat
[2021-05-13 09:48:32] [INFO ] [Real]Absence check using 0 positive and 12 generalized place invariants in 6 ms returned sat
[2021-05-13 09:48:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:48:32] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2021-05-13 09:48:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 09:48:32] [INFO ] [Nat]Absence check using 0 positive and 12 generalized place invariants in 9 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 4 simplifications.
[2021-05-13 09:48:32] [INFO ] Initial state reduction rules for CTL removed 10 formulas.
[2021-05-13 09:48:32] [INFO ] Flatten gal took : 82 ms
FORMULA CloudDeployment-PT-2a-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-2a-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-2a-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-2a-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-2a-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-2a-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-2a-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-2a-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-2a-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-2a-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 09:48:32] [INFO ] Applying decomposition
[2021-05-13 09:48:32] [INFO ] Flatten gal took : 20 ms
[2021-05-13 09:48:32] [INFO ] Decomposing Gal with order
[2021-05-13 09:48:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 09:48:32] [INFO ] Removed a total of 247 redundant transitions.
[2021-05-13 09:48:33] [INFO ] Flatten gal took : 44 ms
[2021-05-13 09:48:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 5 ms.
[2021-05-13 09:48:33] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2021-05-13 09:48:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ CloudDeployment-PT-2a @ 3570 seconds

FORMULA CloudDeployment-PT-2a-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudDeployment-PT-2a-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudDeployment-PT-2a-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudDeployment-PT-2a-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudDeployment-PT-2a-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudDeployment-PT-2a-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for LTLCardinality @ CloudDeployment-PT-2a

{
"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",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu May 13 09:48:33 2021
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"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": "G ((((p38 <= 0)) OR ((1 <= p2))))",
"processed_size": 34,
"rewrites": 30
},
"result":
{
"edges": 34372,
"markings": 4624,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 0,
"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": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"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 (((p1 <= 0))))",
"processed_size": 19,
"rewrites": 30
},
"result":
{
"edges": 318,
"markings": 132,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"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": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G (((p52 <= 0))))",
"processed_size": 20,
"rewrites": 30
},
"result":
{
"edges": 536,
"markings": 184,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"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": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"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": "G (F ((((1 <= p35)) AND ((p34 <= 0)))))",
"processed_size": 39,
"rewrites": 30
},
"result":
{
"edges": 8,
"markings": 8,
"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": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 6,
"adisj": 3,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G (F ((((1 <= p35)) OR ((((p36 <= 0)) OR ((1 <= p47))) AND (((p24 <= 0)) OR ((1 <= p9)))))))",
"processed_size": 95,
"rewrites": 30
},
"result":
{
"edges": 146,
"markings": 52,
"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": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 0,
"X": 0,
"aconj": 12,
"adisj": 5,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "F (G ((F ((G ((((p58 <= 0)) OR ((1 <= p38)))) AND (((p58 <= 0)) OR ((1 <= p38))))) AND ((((p56 <= 0)) OR ((1 <= p15)) OR ((p21 <= 0)) OR ((1 <= p36))) OR (G ((((p58 <= 0)) OR ((1 <= p38)))) AND (((p58 <= 0)) OR ((1 <= p38))))))))",
"processed_size": 236,
"rewrites": 30
},
"result":
{
"edges": 1540,
"markings": 362,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 11
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 25520,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(G(*)) : (X(F(*)) OR G(**)) : G(F(*)) : F(G((F((G(**) AND **)) AND (** OR (G(**) AND **))))) : G(F(**)) : F(G(**))"
},
"net":
{
"arcs": 781,
"conflict_clusters": 20,
"places": 69,
"places_significant": 57,
"singleton_clusters": 0,
"transitions": 160
},
"result":
{
"preliminary_value": "no yes no no no no ",
"value": "no yes no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 229/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 69
lola: finding significant places
lola: 69 places, 160 transitions, 57 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: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p57 <= 1)
lola: LP says that atomic proposition is always true: (p59 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: F (G (NOT(F (((G (((1 <= p1))) OR ((1 <= p1))) U ((1 <= p1))))))) : (NOT(X (G (((((p37 <= 0)) OR ((1 <= p57))))))) OR G ((((p38 <= 0)) OR ((1 <= p2))))) : NOT(F (G ((((p35 <= 0)) OR ((1 <= p34)))))) : NOT(X (G (F (NOT(((((p56 <= 0)) OR ((1 <= p15)) OR ((p21 <= 0)) OR ((1 <= p36))) U (G ((((p58 <= 0)) OR ((1 <= p38)))) AND (((p58 <= 0)) OR ((1 <= p38)))))))))) : G (F (((0 <= 0) U (((1 <= p35)) OR ((((p36 <= 0)) OR ((1 <= p47))) AND (((p24 <= 0)) OR ((1 <= p9)))))))) : F (G (((p52 <= 0))))
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k: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:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:347
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F (((((1 <= p37)) AND ((p57 <= 0)))))) OR G ((((p38 <= 0)) OR ((1 <= p2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((p38 <= 0)) OR ((1 <= p2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p38 <= 0)) OR ((1 <= p2))))
lola: processed formula length: 34
lola: 30 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4624 markings, 34372 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p1 <= 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 <= 0))))
lola: processed formula length: 19
lola: 30 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: 132 markings, 318 edges
lola: ========================================
lola: subprocess 2 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p52 <= 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 (((p52 <= 0))))
lola: processed formula length: 20
lola: 30 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: 184 markings, 536 edges
lola: ========================================
lola: subprocess 3 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((1 <= p35)) AND ((p34 <= 0)))))
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 ((((1 <= p35)) AND ((p34 <= 0)))))
lola: processed formula length: 39
lola: 30 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: 8 markings, 8 edges
lola: ========================================
lola: subprocess 4 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((1 <= p35)) OR ((((p36 <= 0)) OR ((1 <= p47))) AND (((p24 <= 0)) OR ((1 <= p9)))))))
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 ((((1 <= p35)) OR ((((p36 <= 0)) OR ((1 <= p47))) AND (((p24 <= 0)) OR ((1 <= p9)))))))
lola: processed formula length: 95
lola: 30 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: 52 markings, 146 edges
lola: ========================================
lola: subprocess 5 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((G ((((p58 <= 0)) OR ((1 <= p38)))) AND (((p58 <= 0)) OR ((1 <= p38))))) AND ((((p56 <= 0)) OR ((1 <= p15)) OR ((p21 <= 0)) OR ((1 <= p36))) OR (G ((((p58 <= 0)) OR ((1 <= p38)))) AND (((p58 <= 0)) OR ((1 <= p38))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((G ((((p58 <= 0)) OR ((1 <= p38)))) AND (((p58 <= 0)) OR ((1 <= p38))))) AND ((((p56 <= 0)) OR ((1 <= p15)) OR ((p21 <= 0)) OR ((1 <= p36))) OR (G ((((p58 <= 0)) OR ((1 <= p38)))) AND (((p58 <= 0)) OR ((1 <= p38))))))))
lola: processed formula length: 236
lola: 30 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 11 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 362 markings, 1540 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no no no no
lola:
preliminary result: no yes no no no no
lola: memory consumption: 25520 KB
lola: time consumption: 3 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="CloudDeployment-PT-2a"
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 CloudDeployment-PT-2a, 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-162038334600133"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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