Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r265-tall-162106800600257.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is Sudoku-COL-AN16, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-tall-162106800600257
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 264K
-rw-r--r-- 1 mcc users 6.7K May 15 08:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 15 08:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 15 08:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 15 08:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 13 19:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K May 13 19:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 13 19:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 13 19:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:52 equiv_pt
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 5 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 6.5K May 5 16:52 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 Sudoku-COL-AN16-00
FORMULA_NAME Sudoku-COL-AN16-01
FORMULA_NAME Sudoku-COL-AN16-02
FORMULA_NAME Sudoku-COL-AN16-03
FORMULA_NAME Sudoku-COL-AN16-04
FORMULA_NAME Sudoku-COL-AN16-05
FORMULA_NAME Sudoku-COL-AN16-06
FORMULA_NAME Sudoku-COL-AN16-07
FORMULA_NAME Sudoku-COL-AN16-08
FORMULA_NAME Sudoku-COL-AN16-09
FORMULA_NAME Sudoku-COL-AN16-10
FORMULA_NAME Sudoku-COL-AN16-11
FORMULA_NAME Sudoku-COL-AN16-12
FORMULA_NAME Sudoku-COL-AN16-13
FORMULA_NAME Sudoku-COL-AN16-14
FORMULA_NAME Sudoku-COL-AN16-15

=== Now, execution of the tool begins

BK_START 1621208673143

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-16 23:44:34] [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-16 23:44:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 23:44:34] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2021-05-16 23:44:35] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 496 ms
[2021-05-16 23:44:35] [INFO ] sort/places :
N2->Rows,Cells,Columns,
N3->Board,

[2021-05-16 23:44:35] [WARNING] Unknown color function,Tuple skipping symmetry detection on parameters for transition select
[2021-05-16 23:44:35] [WARNING] Unknown color function,Tuple skipping symmetry detection on parameters for transition select
[2021-05-16 23:44:35] [WARNING] Unknown color function,Tuple skipping symmetry detection on parameters for transition select
[2021-05-16 23:44:35] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 4050 PT places and 3375.0 transition bindings in 19 ms.
[2021-05-16 23:44:35] [INFO ] Computed order based on color domains.
[2021-05-16 23:44:35] [INFO ] Unfolded HLPN to a Petri net with 4050 places and 3375 transitions in 64 ms.
[2021-05-16 23:44:35] [INFO ] Unfolded HLPN properties in 5 ms.
Deduced a syphon composed of 4046 places in 4 ms
Reduce places removed 4046 places and 3374 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 166 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 50000 resets, run finished after 283 ms. (steps per millisecond=353 ) properties seen :[0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1]
// Phase 1: matrix 1 rows 4 cols
[2021-05-16 23:44:35] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-16 23:44:35] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned unsat
[2021-05-16 23:44:35] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned unsat
[2021-05-16 23:44:35] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned unsat
[2021-05-16 23:44:36] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned unsat
[2021-05-16 23:44:36] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned unsat
[2021-05-16 23:44:36] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned unsat
[2021-05-16 23:44:36] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned unsat
[2021-05-16 23:44:36] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned unsat
[2021-05-16 23:44:36] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned unsat
[2021-05-16 23:44:36] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned unsat
[2021-05-16 23:44:36] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned unsat
[2021-05-16 23:44:36] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned unsat
[2021-05-16 23:44:36] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned unsat
[2021-05-16 23:44:36] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned unsat
[2021-05-16 23:44:36] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned unsat
[2021-05-16 23:44:36] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned unsat
[2021-05-16 23:44:36] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned unsat
[2021-05-16 23:44:36] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned unsat
[2021-05-16 23:44:36] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned unsat
Successfully simplified 19 atomic propositions for a total of 35 simplifications.
[2021-05-16 23:44:36] [INFO ] Initial state reduction rules for CTL removed 10 formulas.
[2021-05-16 23:44:36] [INFO ] Flatten gal took : 15 ms
FORMULA Sudoku-COL-AN16-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN16-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN16-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN16-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN16-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN16-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN16-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN16-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN16-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN16-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 23:44:36] [INFO ] Applying decomposition
[2021-05-16 23:44:36] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2021-05-16 23:44:36] [INFO ] Flatten gal took : 1 ms
[2021-05-16 23:44:36] [INFO ] Decomposing Gal with order
[2021-05-16 23:44:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 23:44:36] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2021-05-16 23:44:36] [INFO ] Flatten gal took : 19 ms
[2021-05-16 23:44:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-16 23:44:36] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA Sudoku-COL-AN16-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN16-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 23:44:36] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-16 23:44:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ Sudoku-COL-AN16 @ 3570 seconds

FORMULA Sudoku-COL-AN16-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-COL-AN16-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-COL-AN16-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-COL-AN16-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3568
rslt: Output for LTLCardinality @ Sudoku-COL-AN16

{
"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": "Sun May 16 23:44:37 2021
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"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": 1,
"visible_transitions": 0
},
"processed": "X ((X (F ((p0 <= 0))) U (1 <= p0)))",
"processed_size": 35,
"rewrites": 29
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 1784
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "G (((p1 <= p0)))",
"processed_size": 16,
"rewrites": 29
},
"result":
{
"edges": 3,
"markings": 3,
"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": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3568
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 2,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(F (((1 <= p3) OR (G (F ((1 <= p3))) AND F ((1 <= p3))))) U G ((p3 <= p1)))",
"processed_size": 75,
"rewrites": 29
},
"result":
{
"edges": 18,
"markings": 8,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 12
},
"compoundnumber": 3,
"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": 18476,
"runtime": 2.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(**) : G((F((G(*) OR (* AND *))) OR X(G(*)))) : X((X(F(*)) U **)) : (F((** OR (G(F(**)) AND F(**)))) U G(**))"
},
"net":
{
"arcs": 4,
"conflict_clusters": 2,
"places": 4,
"places_significant": 1,
"singleton_clusters": 0,
"transitions": 1
},
"result":
{
"preliminary_value": "no yes no yes ",
"value": "no yes no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 5/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 4
lola: finding significant places
lola: 4 places, 1 transitions, 1 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 false: (2 <= p0)
lola: G (((p1 <= p0))) : NOT(F ((G ((((1 <= p2) OR (p1 <= p0)) U (1 <= p1))) AND ((0 <= 0) U X ((p1 <= p0)))))) : (F (X (F (NOT(X (G (((1 <= 0) U (1 <= p0)))))))) U X ((1 <= p0))) : (F ((G (F ((1 <= p3))) U (1 <= p3))) U G ((p3 <= p1)))
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((G ((p1 <= 0)) OR (((p2 <= 0) AND (p0 + 1 <= p1)) AND (p1 <= 0)))) OR X (G ((p0 + 1 <= p1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((G ((p1 <= 0)) OR (((p2 <= 0) AND (p0 + 1 <= p1)) AND (p1 <= 0)))) OR X (G ((p0 + 1 <= p1)))))
lola: processed formula length: 101
lola: 29 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3 markings, 5 edges
lola: ========================================
lola: subprocess 1 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (F ((p0 <= 0))) U (1 <= p0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (F ((p0 <= 0))) U (1 <= p0)))
lola: processed formula length: 35
lola: 29 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: 3 markings, 3 edges
lola: ========================================
lola: subprocess 2 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p1 <= p0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p1 <= p0)))
lola: processed formula length: 16
lola: 29 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: 3 markings, 3 edges
lola: ========================================
lola: subprocess 3 will run for 3568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p3) OR (G (F ((1 <= p3))) AND F ((1 <= p3))))) U G ((p3 <= p1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F (((1 <= p3) OR (G (F ((1 <= p3))) AND F ((1 <= p3))))) U G ((p3 <= p1)))
lola: processed formula length: 75
lola: 29 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 12 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 8 markings, 18 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no yes
lola:
preliminary result: no yes no yes
lola: memory consumption: 18476 KB
lola: time consumption: 2 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="Sudoku-COL-AN16"
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 Sudoku-COL-AN16, 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 r265-tall-162106800600257"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN16.tgz
mv Sudoku-COL-AN16 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 ;