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.r227-tall-162098231300393.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 ShieldPPPt-PT-020A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r227-tall-162098231300393
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 106K May 10 09:44 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.5K Mar 28 16:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 27 12:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 27 12:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 18:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 25 18:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 134K 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 ShieldPPPt-PT-020A-00
FORMULA_NAME ShieldPPPt-PT-020A-01
FORMULA_NAME ShieldPPPt-PT-020A-02
FORMULA_NAME ShieldPPPt-PT-020A-03
FORMULA_NAME ShieldPPPt-PT-020A-04
FORMULA_NAME ShieldPPPt-PT-020A-05
FORMULA_NAME ShieldPPPt-PT-020A-06
FORMULA_NAME ShieldPPPt-PT-020A-07
FORMULA_NAME ShieldPPPt-PT-020A-08
FORMULA_NAME ShieldPPPt-PT-020A-09
FORMULA_NAME ShieldPPPt-PT-020A-10
FORMULA_NAME ShieldPPPt-PT-020A-11
FORMULA_NAME ShieldPPPt-PT-020A-12
FORMULA_NAME ShieldPPPt-PT-020A-13
FORMULA_NAME ShieldPPPt-PT-020A-14
FORMULA_NAME ShieldPPPt-PT-020A-15

=== Now, execution of the tool begins

BK_START 1621180174743

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-16 15:49:36] [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 15:49:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 15:49:36] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2021-05-16 15:49:36] [INFO ] Transformed 503 places.
[2021-05-16 15:49:36] [INFO ] Transformed 363 transitions.
[2021-05-16 15:49:36] [INFO ] Found NUPN structural information;
[2021-05-16 15:49:36] [INFO ] Parsed PT model containing 503 places and 363 transitions in 122 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 630 ms. (steps per millisecond=158 ) properties seen :[1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1]
// Phase 1: matrix 362 rows 503 cols
[2021-05-16 15:49:37] [INFO ] Computed 221 place invariants in 12 ms
[2021-05-16 15:49:37] [INFO ] [Real]Absence check using 221 positive place invariants in 98 ms returned sat
[2021-05-16 15:49:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:49:38] [INFO ] [Real]Absence check using state equation in 499 ms returned sat
[2021-05-16 15:49:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:49:38] [INFO ] [Nat]Absence check using 221 positive place invariants in 18 ms returned unsat
[2021-05-16 15:49:38] [INFO ] [Real]Absence check using 221 positive place invariants in 92 ms returned sat
[2021-05-16 15:49:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:49:38] [INFO ] [Real]Absence check using state equation in 523 ms returned sat
[2021-05-16 15:49:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:49:39] [INFO ] [Nat]Absence check using 221 positive place invariants in 53 ms returned unsat
[2021-05-16 15:49:39] [INFO ] [Real]Absence check using 221 positive place invariants in 87 ms returned sat
[2021-05-16 15:49:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:49:39] [INFO ] [Real]Absence check using state equation in 485 ms returned sat
[2021-05-16 15:49:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:49:39] [INFO ] [Nat]Absence check using 221 positive place invariants in 86 ms returned sat
[2021-05-16 15:49:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:49:40] [INFO ] [Nat]Absence check using state equation in 464 ms returned sat
[2021-05-16 15:49:40] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 23 ms.
[2021-05-16 15:49:42] [INFO ] Added : 353 causal constraints over 71 iterations in 2530 ms. Result :sat
[2021-05-16 15:49:43] [INFO ] [Real]Absence check using 221 positive place invariants in 83 ms returned sat
[2021-05-16 15:49:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:49:43] [INFO ] [Real]Absence check using state equation in 481 ms returned sat
[2021-05-16 15:49:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:49:43] [INFO ] [Nat]Absence check using 221 positive place invariants in 80 ms returned sat
[2021-05-16 15:49:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:49:44] [INFO ] [Nat]Absence check using state equation in 452 ms returned sat
[2021-05-16 15:49:44] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 23 ms.
[2021-05-16 15:49:46] [INFO ] Added : 350 causal constraints over 71 iterations in 2513 ms. Result :sat
[2021-05-16 15:49:47] [INFO ] [Real]Absence check using 221 positive place invariants in 108 ms returned sat
[2021-05-16 15:49:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:49:47] [INFO ] [Real]Absence check using state equation in 515 ms returned sat
[2021-05-16 15:49:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:49:47] [INFO ] [Nat]Absence check using 221 positive place invariants in 80 ms returned sat
[2021-05-16 15:49:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:49:48] [INFO ] [Nat]Absence check using state equation in 446 ms returned sat
[2021-05-16 15:49:48] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 18 ms.
[2021-05-16 15:49:50] [INFO ] Added : 353 causal constraints over 72 iterations in 2493 ms. Result :sat
[2021-05-16 15:49:50] [INFO ] [Real]Absence check using 221 positive place invariants in 80 ms returned sat
[2021-05-16 15:49:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:49:51] [INFO ] [Real]Absence check using state equation in 458 ms returned sat
[2021-05-16 15:49:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:49:51] [INFO ] [Nat]Absence check using 221 positive place invariants in 13 ms returned unsat
[2021-05-16 15:49:51] [INFO ] [Real]Absence check using 221 positive place invariants in 82 ms returned sat
[2021-05-16 15:49:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:49:51] [INFO ] [Real]Absence check using state equation in 463 ms returned sat
[2021-05-16 15:49:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:49:52] [INFO ] [Nat]Absence check using 221 positive place invariants in 13 ms returned unsat
[2021-05-16 15:49:52] [INFO ] [Real]Absence check using 221 positive place invariants in 79 ms returned sat
[2021-05-16 15:49:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:49:52] [INFO ] [Real]Absence check using state equation in 455 ms returned sat
[2021-05-16 15:49:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:49:52] [INFO ] [Nat]Absence check using 221 positive place invariants in 79 ms returned sat
[2021-05-16 15:49:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:49:53] [INFO ] [Nat]Absence check using state equation in 443 ms returned sat
[2021-05-16 15:49:53] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 23 ms.
[2021-05-16 15:49:55] [INFO ] Added : 350 causal constraints over 71 iterations in 2036 ms. Result :sat
[2021-05-16 15:49:55] [INFO ] [Real]Absence check using 221 positive place invariants in 79 ms returned sat
[2021-05-16 15:49:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:49:55] [INFO ] [Real]Absence check using state equation in 448 ms returned sat
[2021-05-16 15:49:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:49:56] [INFO ] [Nat]Absence check using 221 positive place invariants in 78 ms returned sat
[2021-05-16 15:49:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:49:56] [INFO ] [Nat]Absence check using state equation in 443 ms returned sat
[2021-05-16 15:49:56] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 25 ms.
[2021-05-16 15:49:58] [INFO ] Added : 350 causal constraints over 71 iterations in 2105 ms. Result :sat
[2021-05-16 15:49:58] [INFO ] [Real]Absence check using 221 positive place invariants in 80 ms returned sat
[2021-05-16 15:49:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:49:59] [INFO ] [Real]Absence check using state equation in 441 ms returned sat
[2021-05-16 15:49:59] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 19 ms.
[2021-05-16 15:49:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:49:59] [INFO ] [Nat]Absence check using 221 positive place invariants in 80 ms returned sat
[2021-05-16 15:49:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:49:59] [INFO ] [Nat]Absence check using state equation in 452 ms returned sat
[2021-05-16 15:49:59] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 15 ms.
[2021-05-16 15:50:02] [INFO ] Added : 354 causal constraints over 73 iterations in 2363 ms. Result :sat
Successfully simplified 4 atomic propositions for a total of 6 simplifications.
[2021-05-16 15:50:02] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2021-05-16 15:50:02] [INFO ] Flatten gal took : 91 ms
FORMULA ShieldPPPt-PT-020A-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020A-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020A-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020A-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020A-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020A-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 15:50:02] [INFO ] Applying decomposition
[2021-05-16 15:50:02] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-16 15:50:02] [INFO ] Flatten gal took : 39 ms
[2021-05-16 15:50:02] [INFO ] Decomposing Gal with order
[2021-05-16 15:50:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 15:50:02] [INFO ] Removed a total of 120 redundant transitions.
[2021-05-16 15:50:02] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-16 15:50:02] [INFO ] Flatten gal took : 84 ms
[2021-05-16 15:50:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 11 ms.
[2021-05-16 15:50:02] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ShieldPPPt-PT-020A-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 15:50:02] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2021-05-16 15:50:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 7 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ ShieldPPPt-PT-020A @ 3570 seconds

FORMULA ShieldPPPt-PT-020A-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020A-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020A-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020A-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020A-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020A-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020A-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020A-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020A-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3565
rslt: Output for LTLCardinality @ ShieldPPPt-PT-020A

{
"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 15:50:03 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 3,
"aneg": 1,
"comp": 4,
"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 ((X (G ((((p162 <= 0)) OR ((1 <= p133))))) AND (((p1 <= 0)) OR ((1 <= p484))))))",
"processed_size": 87,
"rewrites": 32
},
"result":
{
"edges": 331,
"markings": 330,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "(((p225 <= 0)) OR ((1 <= p240)))",
"processed_size": 33,
"rewrites": 32
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 3,
"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": "((((p343 <= 0)) OR ((1 <= p414))) U ((1 <= p457)))",
"processed_size": 51,
"rewrites": 32
},
"result":
{
"edges": 8,
"markings": 8,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "(((p154 <= 0)) OR ((1 <= p180)))",
"processed_size": 33,
"rewrites": 32
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"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 <= p154)) AND ((p180 <= 0)))",
"processed_size": 33,
"rewrites": 32
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 2,
"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": "X (F ((((p154 <= 0)) OR ((1 <= p180)))))",
"processed_size": 41,
"rewrites": 32
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "((p207 <= 0))",
"processed_size": 13,
"rewrites": 34
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"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": "F (G ((((1 <= p0)) AND ((p341 <= 0)))))",
"processed_size": 39,
"rewrites": 32
},
"result":
{
"edges": 10,
"markings": 9,
"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": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"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 (F ((((1 <= p343)) AND ((p420 <= 0)))))",
"processed_size": 41,
"rewrites": 32
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"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": "F (G ((((1 <= p407)) AND ((p224 <= 0)))))",
"processed_size": 41,
"rewrites": 32
},
"result":
{
"edges": 10,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"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": 1782
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((((p35 <= 0)) OR ((1 <= p326)) OR ((p416 <= 0)) OR ((1 <= p63))))",
"processed_size": 71,
"rewrites": 32
},
"result":
{
"edges": 93,
"markings": 82,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3565
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "(((p48 <= 0)) OR ((1 <= p260)))",
"processed_size": 32,
"rewrites": 32
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 8,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "(((1 <= p48)) AND ((p260 <= 0)))",
"processed_size": 32,
"rewrites": 34
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 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": "(((p48 <= 0)) OR ((1 <= p260)))",
"processed_size": 32,
"rewrites": 32
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 9,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"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 ((((p360 <= 0)) OR ((1 <= p161))))",
"processed_size": 37,
"rewrites": 32
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 30708,
"runtime": 5.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(**) : F(G(*)) : G(F(**)) : (F(**) AND (G(**) AND **)) : F(G(*)) : G(**) : F(G((X(G(**)) AND *))) : ((** U X(F(**))) AND ((** U **) AND **)) : (** OR (X(F(*)) AND **))"
},
"net":
{
"arcs": 1444,
"conflict_clusters": 223,
"places": 503,
"places_significant": 282,
"singleton_clusters": 0,
"transitions": 362
},
"result":
{
"preliminary_value": "no no no no no no no no yes ",
"value": "no no no no no no no 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: 865/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 503
lola: finding significant places
lola: 503 places, 362 transitions, 282 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: (p207 <= 1)
lola: LP says that atomic proposition is always true: (p341 <= 1)
lola: LP says that atomic proposition is always true: (p225 <= 1)
lola: LP says that atomic proposition is always true: (p420 <= 1)
lola: LP says that atomic proposition is always true: (p260 <= 1)
lola: LP says that atomic proposition is always true: (p161 <= 1)
lola: LP says that atomic proposition is always true: (p260 <= 1)
lola: LP says that atomic proposition is always true: (p224 <= 1)
lola: LP says that atomic proposition is always true: (p326 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p133 <= 1)
lola: LP says that atomic proposition is always true: (p484 <= 1)
lola: LP says that atomic proposition is always true: (p457 <= 1)
lola: LP says that atomic proposition is always true: (p457 <= 1)
lola: LP says that atomic proposition is always true: (p414 <= 1)
lola: LP says that atomic proposition is always true: (p457 <= 1)
lola: LP says that atomic proposition is always true: (p240 <= 1)
lola: LP says that atomic proposition is always true: (p180 <= 1)
lola: LP says that atomic proposition is always true: (p180 <= 1)
lola: LP says that atomic proposition is always true: (p180 <= 1)
lola: F (((1 <= p207))) : F ((NOT(((1 <= 0) U (1 <= 0))) AND NOT(F (X ((((p0 <= 0)) OR ((1 <= p341)))))))) : G (F (((((p265 <= 0)) OR ((1 <= p225))) U (((1 <= p343)) AND ((p420 <= 0)))))) : ((F ((((p48 <= 0)) OR ((1 <= p260)))) AND G ((((p360 <= 0)) OR ((1 <= p161))))) AND (((p48 <= 0)) OR ((1 <= p260)))) : X (X (F (NOT(F ((((p407 <= 0)) OR ((1 <= p224)))))))) : G ((((p35 <= 0)) OR ((1 <= p326)) OR ((p416 <= 0)) OR ((1 <= p63)))) : NOT(X (G (F ((NOT(G (X ((((p162 <= 0)) OR ((1 <= p133)))))) OR (((1 <= p1)) AND ((p484 <= 0)))))))) : (((((1 <= p457)) U X (F (((1 <= p457))))) AND ((((p343 <= 0)) OR ((1 <= p414))) U ((1 <= p457)))) AND (((p225 <= 0)) OR ((1 <= p240)))) : ((((1 <= p154)) AND ((p180 <= 0))) OR (X (NOT(G ((((1 <= p154)) AND ((p180 <= 0)))))) AND (((p154 <= 0)) OR ((1 <= p180)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:116
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:380
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X (G ((((p162 <= 0)) OR ((1 <= p133))))) AND (((p1 <= 0)) OR ((1 <= p484))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X (G ((((p162 <= 0)) OR ((1 <= p133))))) AND (((p1 <= 0)) OR ((1 <= p484))))))
lola: processed formula length: 87
lola: 32 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: 330 markings, 331 edges
lola: ========================================
lola: subprocess 1 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p457)) U X (F (((1 <= p457))))) AND (((((p343 <= 0)) OR ((1 <= p414))) U ((1 <= p457))) AND (((p225 <= 0)) OR ((1 <= p240)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p225 <= 0)) OR ((1 <= p240)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p225 <= 0)) OR ((1 <= p240)))
lola: processed formula length: 33
lola: 32 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((p343 <= 0)) OR ((1 <= p414))) U ((1 <= p457)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((((p343 <= 0)) OR ((1 <= p414))) U ((1 <= p457)))
lola: processed formula length: 51
lola: 32 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p154)) AND ((p180 <= 0))) OR (X (F ((((p154 <= 0)) OR ((1 <= p180))))) AND (((p154 <= 0)) OR ((1 <= p180)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p154 <= 0)) OR ((1 <= p180)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p154 <= 0)) OR ((1 <= p180)))
lola: processed formula length: 33
lola: 32 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p154)) AND ((p180 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((1 <= p154)) AND ((p180 <= 0)))
lola: processed formula length: 33
lola: 32 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 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 4 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((((p154 <= 0)) OR ((1 <= p180)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((((p154 <= 0)) OR ((1 <= p180)))))
lola: processed formula length: 41
lola: 32 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p207)))
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: ((p207 <= 0))
lola: processed formula length: 13
lola: 34 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: 8 markings, 8 edges
lola: ========================================
lola: subprocess 4 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((1 <= p0)) AND ((p341 <= 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 ((((1 <= p0)) AND ((p341 <= 0)))))
lola: processed formula length: 39
lola: 32 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: 9 markings, 10 edges
lola: ========================================
lola: subprocess 5 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((1 <= p343)) AND ((p420 <= 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 <= p343)) AND ((p420 <= 0)))))
lola: processed formula length: 41
lola: 32 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 6 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((1 <= p407)) AND ((p224 <= 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 ((((1 <= p407)) AND ((p224 <= 0)))))
lola: processed formula length: 41
lola: 32 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: 9 markings, 10 edges
lola: ========================================
lola: subprocess 7 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((p35 <= 0)) OR ((1 <= p326)) OR ((p416 <= 0)) OR ((1 <= p63))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p35 <= 0)) OR ((1 <= p326)) OR ((p416 <= 0)) OR ((1 <= p63))))
lola: processed formula length: 71
lola: 32 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: 82 markings, 93 edges
lola: ========================================
lola: subprocess 8 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((((p48 <= 0)) OR ((1 <= p260)))) AND (G ((((p360 <= 0)) OR ((1 <= p161)))) AND (((p48 <= 0)) OR ((1 <= p260)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p48 <= 0)) OR ((1 <= p260)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p48 <= 0)) OR ((1 <= p260)))
lola: processed formula length: 32
lola: 32 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((p48 <= 0)) OR ((1 <= p260))))
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: (((1 <= p48)) AND ((p260 <= 0)))
lola: processed formula length: 32
lola: 34 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: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (F ((((p48 <= 0)) OR ((1 <= p260)))) AND (G ((((p360 <= 0)) OR ((1 <= p161)))) AND (((p48 <= 0)) OR ((1 <= p260)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (((p48 <= 0)) OR ((1 <= p260)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p48 <= 0)) OR ((1 <= p260)))
lola: processed formula length: 32
lola: 32 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G ((((p360 <= 0)) OR ((1 <= p161))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p360 <= 0)) OR ((1 <= p161))))
lola: processed formula length: 37
lola: 32 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no no yes
lola:
preliminary result: no no no no no no no no yes
lola: memory consumption: 30708 KB
lola: time consumption: 5 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="ShieldPPPt-PT-020A"
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 ShieldPPPt-PT-020A, 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 r227-tall-162098231300393"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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