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.r170-oct2-162089287100125.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 PolyORBLF-PT-S02J06T08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-oct2-162089287100125
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 74K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 310K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 76K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 355K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 16K Mar 28 16:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Mar 28 16:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Mar 28 16:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 36K Mar 28 16:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Mar 27 09:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 47K Mar 27 09:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 25 11:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K Mar 25 11:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 09:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K Mar 22 09:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 10 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1.3M 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 PolyORBLF-PT-S02J06T08-00
FORMULA_NAME PolyORBLF-PT-S02J06T08-01
FORMULA_NAME PolyORBLF-PT-S02J06T08-02
FORMULA_NAME PolyORBLF-PT-S02J06T08-03
FORMULA_NAME PolyORBLF-PT-S02J06T08-04
FORMULA_NAME PolyORBLF-PT-S02J06T08-05
FORMULA_NAME PolyORBLF-PT-S02J06T08-06
FORMULA_NAME PolyORBLF-PT-S02J06T08-07
FORMULA_NAME PolyORBLF-PT-S02J06T08-08
FORMULA_NAME PolyORBLF-PT-S02J06T08-09
FORMULA_NAME PolyORBLF-PT-S02J06T08-10
FORMULA_NAME PolyORBLF-PT-S02J06T08-11
FORMULA_NAME PolyORBLF-PT-S02J06T08-12
FORMULA_NAME PolyORBLF-PT-S02J06T08-13
FORMULA_NAME PolyORBLF-PT-S02J06T08-14
FORMULA_NAME PolyORBLF-PT-S02J06T08-15

=== Now, execution of the tool begins

BK_START 1621379807439

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-18 23:16:50] [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-18 23:16:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 23:16:50] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2021-05-18 23:16:50] [INFO ] Transformed 690 places.
[2021-05-18 23:16:50] [INFO ] Transformed 1434 transitions.
[2021-05-18 23:16:50] [INFO ] Parsed PT model containing 690 places and 1434 transitions in 151 ms.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 43 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 17 resets, run finished after 822 ms. (steps per millisecond=121 ) properties seen :[1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1]
[2021-05-18 23:16:51] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
// Phase 1: matrix 1290 rows 690 cols
[2021-05-18 23:16:51] [INFO ] Computed 54 place invariants in 78 ms
[2021-05-18 23:16:52] [INFO ] [Real]Absence check using 13 positive place invariants in 116 ms returned sat
[2021-05-18 23:16:52] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 21 ms returned unsat
[2021-05-18 23:16:52] [INFO ] [Real]Absence check using 13 positive place invariants in 67 ms returned sat
[2021-05-18 23:16:52] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 151 ms returned unsat
[2021-05-18 23:16:52] [INFO ] [Real]Absence check using 13 positive place invariants in 17 ms returned sat
[2021-05-18 23:16:52] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 38 ms returned unsat
[2021-05-18 23:16:52] [INFO ] [Real]Absence check using 13 positive place invariants in 40 ms returned sat
[2021-05-18 23:16:52] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 21 ms returned unsat
[2021-05-18 23:16:52] [INFO ] [Real]Absence check using 13 positive place invariants in 22 ms returned unsat
[2021-05-18 23:16:53] [INFO ] [Real]Absence check using 13 positive place invariants in 20 ms returned unsat
[2021-05-18 23:16:53] [INFO ] [Real]Absence check using 13 positive place invariants in 26 ms returned sat
[2021-05-18 23:16:53] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 46 ms returned unsat
[2021-05-18 23:16:53] [INFO ] [Real]Absence check using 13 positive place invariants in 34 ms returned sat
[2021-05-18 23:16:53] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 38 ms returned sat
[2021-05-18 23:16:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 23:16:56] [INFO ] [Real]Absence check using state equation in 3272 ms returned sat
[2021-05-18 23:16:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 23:16:56] [INFO ] [Nat]Absence check using 13 positive place invariants in 18 ms returned sat
[2021-05-18 23:16:56] [INFO ] [Nat]Absence check using 13 positive and 41 generalized place invariants in 42 ms returned sat
[2021-05-18 23:16:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 23:17:02] [INFO ] [Nat]Absence check using state equation in 5891 ms returned sat
[2021-05-18 23:17:02] [INFO ] State equation strengthened by 104 read => feed constraints.
[2021-05-18 23:17:03] [INFO ] [Nat]Added 104 Read/Feed constraints in 561 ms returned sat
[2021-05-18 23:17:03] [INFO ] Deduced a trap composed of 74 places in 99 ms
[2021-05-18 23:17:03] [INFO ] Deduced a trap composed of 74 places in 120 ms
[2021-05-18 23:17:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 694 ms
[2021-05-18 23:17:04] [INFO ] Computed and/alt/rep : 1304/21470/1288 causal constraints in 104 ms.
[2021-05-18 23:17:16] [INFO ] Added : 25 causal constraints over 5 iterations in 12730 ms. Result :unknown
[2021-05-18 23:17:16] [INFO ] [Real]Absence check using 13 positive place invariants in 26 ms returned sat
[2021-05-18 23:17:16] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 39 ms returned sat
[2021-05-18 23:17:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 23:17:20] [INFO ] [Real]Absence check using state equation in 3546 ms returned sat
[2021-05-18 23:17:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 23:17:20] [INFO ] [Nat]Absence check using 13 positive place invariants in 51 ms returned sat
[2021-05-18 23:17:20] [INFO ] [Nat]Absence check using 13 positive and 41 generalized place invariants in 92 ms returned sat
[2021-05-18 23:17:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 23:17:24] [INFO ] [Nat]Absence check using state equation in 3678 ms returned sat
[2021-05-18 23:17:25] [INFO ] [Nat]Added 104 Read/Feed constraints in 1150 ms returned sat
[2021-05-18 23:17:25] [INFO ] Deduced a trap composed of 73 places in 115 ms
[2021-05-18 23:17:26] [INFO ] Deduced a trap composed of 73 places in 192 ms
[2021-05-18 23:17:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1880 ms
[2021-05-18 23:17:27] [INFO ] Computed and/alt/rep : 1304/21470/1288 causal constraints in 73 ms.
[2021-05-18 23:17:40] [INFO ] Added : 225 causal constraints over 45 iterations in 13103 ms. Result :(error "Failed to check-sat")
[2021-05-18 23:17:40] [INFO ] [Real]Absence check using 13 positive place invariants in 20 ms returned unsat
[2021-05-18 23:17:40] [INFO ] [Real]Absence check using 13 positive place invariants in 14 ms returned sat
[2021-05-18 23:17:40] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 9 ms returned unsat
[2021-05-18 23:17:40] [INFO ] [Real]Absence check using 13 positive place invariants in 13 ms returned sat
[2021-05-18 23:17:40] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 11 ms returned unsat
[2021-05-18 23:17:40] [INFO ] [Real]Absence check using 13 positive place invariants in 15 ms returned sat
[2021-05-18 23:17:40] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 15 ms returned unsat
[2021-05-18 23:17:40] [INFO ] [Real]Absence check using 13 positive place invariants in 13 ms returned sat
[2021-05-18 23:17:40] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 8 ms returned unsat
[2021-05-18 23:17:41] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned unsat
[2021-05-18 23:17:41] [INFO ] [Real]Absence check using 13 positive place invariants in 14 ms returned sat
[2021-05-18 23:17:41] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 23 ms returned unsat
[2021-05-18 23:17:41] [INFO ] [Real]Absence check using 13 positive place invariants in 17 ms returned sat
[2021-05-18 23:17:41] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 9 ms returned unsat
[2021-05-18 23:17:41] [INFO ] [Real]Absence check using 13 positive place invariants in 21 ms returned sat
[2021-05-18 23:17:41] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 9 ms returned unsat
[2021-05-18 23:17:41] [INFO ] [Real]Absence check using 13 positive place invariants in 14 ms returned sat
[2021-05-18 23:17:41] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 26 ms returned unsat
[2021-05-18 23:17:41] [INFO ] [Real]Absence check using 13 positive place invariants in 30 ms returned sat
[2021-05-18 23:17:41] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 106 ms returned unsat
Successfully simplified 18 atomic propositions for a total of 19 simplifications.
[2021-05-18 23:17:42] [INFO ] Initial state reduction rules for CTL removed 10 formulas.
[2021-05-18 23:17:42] [INFO ] Flatten gal took : 176 ms
FORMULA PolyORBLF-PT-S02J06T08-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T08-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T08-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T08-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T08-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T08-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T08-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T08-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T08-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T08-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 23:17:42] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2021-05-18 23:17:42] [INFO ] Flatten gal took : 68 ms
[2021-05-18 23:17:42] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA PolyORBLF-PT-S02J06T08-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T08-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 23:17:42] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-18 23:17:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 23 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ PolyORBLF-PT-S02J06T08 @ 3570 seconds

FORMULA PolyORBLF-PT-S02J06T08-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S02J06T08-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S02J06T08-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S02J06T08-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3521
rslt: Output for LTLCardinality @ PolyORBLF-PT-S02J06T08

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Tue May 18 23:17:42 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 880
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "X (G ((p548 <= p176 + p205 + p254 + p262 + p445 + p549 + p667 + p29)))",
"processed_size": 70,
"rewrites": 20
},
"result":
{
"edges": 351,
"markings": 351,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1173
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "X (X (G ((p198 + p224 + p356 + p408 + p509 + p594 + p60 + p664 <= p217 + p302 + p407 + p465 + p489 + p596 + p30 + p45))))",
"processed_size": 121,
"rewrites": 20
},
"result":
{
"edges": 351,
"markings": 351,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1760
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "(X (G (((p176 + p205 + p254 + p262 + p445 + p549 + p667 + p29 <= p529 + p590)))) U (p176 + p205 + p254 + p262 + p445 + p549 + p667 + p29 <= p529 + p590))",
"processed_size": 153,
"rewrites": 20
},
"result":
{
"edges": 351,
"markings": 351,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 3521
},
"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": 15,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "F (G ((p166 + p246 + p326 + p435 + p455 + p77 + p619 + p637 <= p112 + p249 + p328 + p523 + p538 + p623 + p675)))",
"processed_size": 112,
"rewrites": 20
},
"result":
{
"edges": 4177,
"markings": 4106,
"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": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 36412,
"runtime": 49.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(G(**)) : X(X(G(*))) : F(G(**)) : (X(G(**)) U **)"
},
"net":
{
"arcs": 5668,
"conflict_clusters": 261,
"places": 690,
"places_significant": 636,
"singleton_clusters": 0,
"transitions": 1306
},
"result":
{
"preliminary_value": "no no no no ",
"value": "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: 1996/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 22080
lola: finding significant places
lola: 690 places, 1306 transitions, 636 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: G (X ((p548 <= p176 + p205 + p254 + p262 + p445 + p549 + p667 + p29))) : NOT(F (X (X (F ((p217 + p302 + p407 + p465 + p489 + p596 + p30 + p45 + 1 <= p198 + p224 + p356 + p408 + p509 + p594 + p60 + p664)))))) : G (NOT(G (F ((X (X (G ((p112 + p249 + p328 + p523 + p538 + p623 + p675 + 1 <= p166 + p246 + p326 + p435 + p455 + p77 + p619 + p637)))) U X (NOT(G ((p166 + p246 + p326 + p435 + p455 + p77 + p619 + p637 <= p112 + p249 + p328 + p523 + p538 + p623 + p675))))))))) : (X (G (((p176 + p205 + p254 + p262 + p445 + p549 + p667 + p29 <= p529 + p590)))) U (p176 + p205 + p254 + p262 + p445 + p549 + p667 + p29 <= p529 + p590))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:335
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:300
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 880 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p548 <= p176 + p205 + p254 + p262 + p445 + p549 + p667 + p29)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p548 <= p176 + p205 + p254 + p262 + p445 + p549 + p667 + p29)))
lola: processed formula length: 70
lola: 20 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: 351 markings, 351 edges
lola: ========================================
lola: subprocess 1 will run for 1173 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((p198 + p224 + p356 + p408 + p509 + p594 + p60 + p664 <= p217 + p302 + p407 + p465 + p489 + p596 + p30 + p45))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((p198 + p224 + p356 + p408 + p509 + p594 + p60 + p664 <= p217 + p302 + p407 + p465 + p489 + p596 + p30 + p45))))
lola: processed formula length: 121
lola: 20 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: 351 markings, 351 edges
lola: ========================================
lola: subprocess 2 will run for 1760 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G (((p176 + p205 + p254 + p262 + p445 + p549 + p667 + p29 <= p529 + p590)))) U (p176 + p205 + p254 + p262 + p445 + p549 + p667 + p29 <= p529 + p590))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (G (((p176 + p205 + p254 + p262 + p445 + p549 + p667 + p29 <= p529 + p590)))) U (p176 + p205 + p254 + p262 + p445 + p549 + p667 + p29 <= p529 + p590))
lola: processed formula length: 153
lola: 20 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: 351 markings, 351 edges
lola: ========================================
lola: subprocess 3 will run for 3521 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p166 + p246 + p326 + p435 + p455 + p77 + p619 + p637 <= p112 + p249 + p328 + p523 + p538 + p623 + p675)))
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 ((p166 + p246 + p326 + p435 + p455 + p77 + p619 + p637 <= p112 + p249 + p328 + p523 + p538 + p623 + p675)))
lola: processed formula length: 112
lola: 20 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: 4106 markings, 4177 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no
lola:
preliminary result: no no no no
lola: memory consumption: 36412 KB
lola: time consumption: 49 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="PolyORBLF-PT-S02J06T08"
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 PolyORBLF-PT-S02J06T08, 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 r170-oct2-162089287100125"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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