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-162098231300394.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 LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r227-tall-162098231300394
=====================================================================

--------------------
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 1621180198495

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-16 15:50:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-16 15:50:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 15:50:00] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2021-05-16 15:50:00] [INFO ] Transformed 503 places.
[2021-05-16 15:50:00] [INFO ] Transformed 363 transitions.
[2021-05-16 15:50:00] [INFO ] Found NUPN structural information;
[2021-05-16 15:50:00] [INFO ] Parsed PT model containing 503 places and 363 transitions in 134 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 27 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 640 ms. (steps per millisecond=156 ) properties seen :[1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 362 rows 503 cols
[2021-05-16 15:50:00] [INFO ] Computed 221 place invariants in 13 ms
[2021-05-16 15:50:01] [INFO ] [Real]Absence check using 221 positive place invariants in 103 ms returned sat
[2021-05-16 15:50:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:50:01] [INFO ] [Real]Absence check using state equation in 473 ms returned sat
[2021-05-16 15:50:01] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 33 ms.
[2021-05-16 15:50:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:50:02] [INFO ] [Nat]Absence check using 221 positive place invariants in 88 ms returned sat
[2021-05-16 15:50:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:50:02] [INFO ] [Nat]Absence check using state equation in 478 ms returned sat
[2021-05-16 15:50:02] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 26 ms.
[2021-05-16 15:50:04] [INFO ] Added : 354 causal constraints over 72 iterations in 2419 ms. Result :sat
[2021-05-16 15:50:05] [INFO ] [Real]Absence check using 221 positive place invariants in 109 ms returned sat
[2021-05-16 15:50:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:50:05] [INFO ] [Real]Absence check using state equation in 486 ms returned sat
[2021-05-16 15:50:05] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 24 ms.
[2021-05-16 15:50:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:50:05] [INFO ] [Nat]Absence check using 221 positive place invariants in 82 ms returned sat
[2021-05-16 15:50:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:50:06] [INFO ] [Nat]Absence check using state equation in 445 ms returned sat
[2021-05-16 15:50:06] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 23 ms.
[2021-05-16 15:50:08] [INFO ] Added : 354 causal constraints over 72 iterations in 2212 ms. Result :sat
[2021-05-16 15:50:08] [INFO ] [Real]Absence check using 221 positive place invariants in 81 ms returned sat
[2021-05-16 15:50:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:50:09] [INFO ] [Real]Absence check using state equation in 453 ms returned sat
[2021-05-16 15:50:09] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 25 ms.
[2021-05-16 15:50:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:50:09] [INFO ] [Nat]Absence check using 221 positive place invariants in 80 ms returned sat
[2021-05-16 15:50:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:50:09] [INFO ] [Nat]Absence check using state equation in 462 ms returned sat
[2021-05-16 15:50:09] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 25 ms.
[2021-05-16 15:50:12] [INFO ] Added : 350 causal constraints over 72 iterations in 2240 ms. Result :sat
[2021-05-16 15:50:12] [INFO ] [Real]Absence check using 221 positive place invariants in 82 ms returned sat
[2021-05-16 15:50:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:50:12] [INFO ] [Real]Absence check using state equation in 457 ms returned sat
[2021-05-16 15:50:12] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 36 ms.
[2021-05-16 15:50:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:50:13] [INFO ] [Nat]Absence check using 221 positive place invariants in 83 ms returned sat
[2021-05-16 15:50:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:50:13] [INFO ] [Nat]Absence check using state equation in 458 ms returned sat
[2021-05-16 15:50:13] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 18 ms.
[2021-05-16 15:50:15] [INFO ] Added : 338 causal constraints over 69 iterations in 2276 ms. Result :sat
[2021-05-16 15:50:15] [INFO ] [Real]Absence check using 221 positive place invariants in 81 ms returned sat
[2021-05-16 15:50:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:50:16] [INFO ] [Real]Absence check using state equation in 446 ms returned sat
[2021-05-16 15:50:16] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 22 ms.
[2021-05-16 15:50:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:50:16] [INFO ] [Nat]Absence check using 221 positive place invariants in 81 ms returned sat
[2021-05-16 15:50:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:50:17] [INFO ] [Nat]Absence check using state equation in 445 ms returned sat
[2021-05-16 15:50:17] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 26 ms.
[2021-05-16 15:50:19] [INFO ] Added : 356 causal constraints over 72 iterations in 2436 ms. Result :sat
[2021-05-16 15:50:19] [INFO ] [Real]Absence check using 221 positive place invariants in 80 ms returned sat
[2021-05-16 15:50:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:50:20] [INFO ] [Real]Absence check using state equation in 448 ms returned sat
[2021-05-16 15:50:20] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 33 ms.
[2021-05-16 15:50:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:50:20] [INFO ] [Nat]Absence check using 221 positive place invariants in 84 ms returned sat
[2021-05-16 15:50:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:50:20] [INFO ] [Nat]Absence check using state equation in 447 ms returned sat
[2021-05-16 15:50:20] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 18 ms.
[2021-05-16 15:50:23] [INFO ] Added : 351 causal constraints over 73 iterations in 2669 ms. Result :sat
[2021-05-16 15:50:23] [INFO ] [Real]Absence check using 221 positive place invariants in 82 ms returned sat
[2021-05-16 15:50:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:50:24] [INFO ] [Real]Absence check using state equation in 454 ms returned sat
[2021-05-16 15:50:24] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 18 ms.
[2021-05-16 15:50:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:50:24] [INFO ] [Nat]Absence check using 221 positive place invariants in 84 ms returned sat
[2021-05-16 15:50:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:50:24] [INFO ] [Nat]Absence check using state equation in 459 ms returned sat
[2021-05-16 15:50:24] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 24 ms.
[2021-05-16 15:50:27] [INFO ] Added : 346 causal constraints over 70 iterations in 2260 ms. Result :sat
[2021-05-16 15:50:27] [INFO ] [Real]Absence check using 221 positive place invariants in 80 ms returned sat
[2021-05-16 15:50:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:50:27] [INFO ] [Real]Absence check using state equation in 448 ms returned sat
[2021-05-16 15:50:27] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 18 ms.
[2021-05-16 15:50:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:50:28] [INFO ] [Nat]Absence check using 221 positive place invariants in 81 ms returned sat
[2021-05-16 15:50:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:50:28] [INFO ] [Nat]Absence check using state equation in 447 ms returned sat
[2021-05-16 15:50:28] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 22 ms.
[2021-05-16 15:50:30] [INFO ] Added : 350 causal constraints over 71 iterations in 2167 ms. Result :sat
[2021-05-16 15:50:30] [INFO ] [Real]Absence check using 221 positive place invariants in 83 ms returned sat
[2021-05-16 15:50:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:50:31] [INFO ] [Real]Absence check using state equation in 458 ms returned sat
[2021-05-16 15:50:31] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 21 ms.
[2021-05-16 15:50:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:50:31] [INFO ] [Nat]Absence check using 221 positive place invariants in 101 ms returned sat
[2021-05-16 15:50:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:50:32] [INFO ] [Nat]Absence check using state equation in 461 ms returned sat
[2021-05-16 15:50:32] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 21 ms.
[2021-05-16 15:50:34] [INFO ] Added : 354 causal constraints over 71 iterations in 2139 ms. Result :sat
[2021-05-16 15:50:34] [INFO ] [Real]Absence check using 221 positive place invariants in 80 ms returned sat
[2021-05-16 15:50:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:50:34] [INFO ] [Real]Absence check using state equation in 452 ms returned sat
[2021-05-16 15:50:34] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 18 ms.
[2021-05-16 15:50:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:50:35] [INFO ] [Nat]Absence check using 221 positive place invariants in 132 ms returned sat
[2021-05-16 15:50:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:50:35] [INFO ] [Nat]Absence check using state equation in 446 ms returned sat
[2021-05-16 15:50:35] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 17 ms.
[2021-05-16 15:50:37] [INFO ] Added : 356 causal constraints over 72 iterations in 2109 ms. Result :sat
[2021-05-16 15:50:37] [INFO ] [Real]Absence check using 221 positive place invariants in 80 ms returned sat
[2021-05-16 15:50:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:50:38] [INFO ] [Real]Absence check using state equation in 445 ms returned sat
[2021-05-16 15:50:38] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 17 ms.
[2021-05-16 15:50:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:50:38] [INFO ] [Nat]Absence check using 221 positive place invariants in 79 ms returned sat
[2021-05-16 15:50:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:50:39] [INFO ] [Nat]Absence check using state equation in 449 ms returned sat
[2021-05-16 15:50:39] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 18 ms.
[2021-05-16 15:50:41] [INFO ] Added : 352 causal constraints over 73 iterations in 2321 ms. Result :sat
[2021-05-16 15:50:41] [INFO ] [Real]Absence check using 221 positive place invariants in 82 ms returned sat
[2021-05-16 15:50:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:50:42] [INFO ] [Real]Absence check using state equation in 458 ms returned sat
[2021-05-16 15:50:42] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 20 ms.
[2021-05-16 15:50:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:50:42] [INFO ] [Nat]Absence check using 221 positive place invariants in 82 ms returned sat
[2021-05-16 15:50:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:50:42] [INFO ] [Nat]Absence check using state equation in 458 ms returned sat
[2021-05-16 15:50:42] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 21 ms.
[2021-05-16 15:50:44] [INFO ] Added : 355 causal constraints over 73 iterations in 2171 ms. Result :sat
[2021-05-16 15:50:45] [INFO ] [Real]Absence check using 221 positive place invariants in 83 ms returned sat
[2021-05-16 15:50:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:50:45] [INFO ] [Real]Absence check using state equation in 447 ms returned sat
[2021-05-16 15:50:45] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 21 ms.
[2021-05-16 15:50:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:50:45] [INFO ] [Nat]Absence check using 221 positive place invariants in 81 ms returned sat
[2021-05-16 15:50:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:50:46] [INFO ] [Nat]Absence check using state equation in 452 ms returned sat
[2021-05-16 15:50:46] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 21 ms.
[2021-05-16 15:50:48] [INFO ] Added : 350 causal constraints over 70 iterations in 1961 ms. Result :sat
[2021-05-16 15:50:48] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2021-05-16 15:50:48] [INFO ] Flatten gal took : 86 ms
FORMULA ShieldPPPt-PT-020A-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020A-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 15:50:48] [INFO ] Applying decomposition
[2021-05-16 15:50:48] [INFO ] Flatten gal took : 38 ms
[2021-05-16 15:50:48] [INFO ] Decomposing Gal with order
[2021-05-16 15:50:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 15:50:48] [INFO ] Removed a total of 120 redundant transitions.
[2021-05-16 15:50:48] [INFO ] Flatten gal took : 84 ms
[2021-05-16 15:50:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 11 ms.
[2021-05-16 15:50:48] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2021-05-16 15:50:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ ShieldPPPt-PT-020A @ 3570 seconds

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

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

FORMULA ShieldPPPt-PT-020A-05 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

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

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

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

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

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

FORMULA ShieldPPPt-PT-020A-09 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-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
vrfy: finished
info: timeLeft: 3557
rslt: Output for LTLFireability @ 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=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sun May 16 15:50:49 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"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": "X ((G (((p28 <= 0) OR (p51 <= 0))) AND F (((1 <= p30) AND (1 <= p47)))))",
"processed_size": 73,
"rewrites": 96
},
"result":
{
"edges": 329,
"markings": 329,
"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": 273
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 273
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 3,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "F ((F (((p445 <= 0) OR (p460 <= 0) OR (p117 <= 0) OR (p119 <= 0))) AND (G (((1 <= p205) AND (1 <= p222))) AND (((1 <= p479)) AND ((1 <= p498))))))",
"processed_size": 149,
"rewrites": 96
},
"result":
{
"edges": 49,
"markings": 49,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 1,
"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": 296
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 3,
"aconj": 3,
"adisj": 0,
"aneg": 3,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (X (X (G ((((p63 <= 0) OR (p77 <= 0)) AND (F (G (((p433 <= 0) OR (p450 <= 0)))) OR G (((p63 <= 0) OR (p77 <= 0)))))))))",
"processed_size": 124,
"rewrites": 96
},
"result":
{
"edges": 970341,
"markings": 374952,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 323
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 4,
"aconj": 4,
"adisj": 2,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 2,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((((1 <= p262) AND (1 <= p264)) AND (X (((1 <= p262) AND (1 <= p264))) OR (X (((1 <= p1) AND (1 <= p24))) AND (X (X (((1 <= p262) AND (1 <= p264)))) OR (((p1 <= 0)) OR ((p24 <= 0))))))))",
"processed_size": 188,
"rewrites": 96
},
"result":
{
"edges": 481,
"markings": 481,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 355
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 3,
"aconj": 4,
"adisj": 0,
"aneg": 2,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X (((X (F ((X (((1 <= p54) AND (1 <= p73))) AND ((p356 <= 0) OR (p371 <= 0))))) R ((p407 <= 0) OR (p409 <= 0))) OR ((1 <= p407) AND (1 <= p409))))",
"processed_size": 148,
"rewrites": 96
},
"result":
{
"edges": 393,
"markings": 393,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 395
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (G (((1 <= p438) AND (1 <= p452))))",
"processed_size": 37,
"rewrites": 96
},
"result":
{
"edges": 329,
"markings": 329,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 5,
"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": 444
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"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": "(((p406 <= 0) OR (p421 <= 0)) R X (((p45 <= 0))))",
"processed_size": 50,
"rewrites": 96
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"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": 5,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 444
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 1,
"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": 2,
"visible_transitions": 0
},
"processed": "X (X (G (((p38 <= 0) OR (p52 <= 0)))))",
"processed_size": 39,
"rewrites": 96
},
"result":
{
"edges": 329,
"markings": 329,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 6,
"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": 508
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((F ((X (G (((p495 <= 0)))) AND F (((p351 <= 0))))) AND F (((1 <= p351)))))",
"processed_size": 77,
"rewrites": 96
},
"result":
{
"edges": 539,
"markings": 539,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 7,
"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": 593
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 1,
"X": 2,
"aconj": 5,
"adisj": 0,
"aneg": 1,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "X (((F (((1 <= p331) AND (1 <= p346))) OR X (G ((F (((1 <= p236) AND (1 <= p246))) AND (((1 <= p386) AND (1 <= p396)) OR ((1 <= p236) AND (1 <= p246))))))) U ((p206 <= 0) OR (p221 <= 0))))",
"processed_size": 189,
"rewrites": 96
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 8,
"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": 711
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"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": "((p53 <= 0) OR (p76 <= 0) OR (p42 <= 0) OR (p44 <= 0))",
"processed_size": 57,
"rewrites": 98
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 9
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 889
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F (((1 <= p272))))",
"processed_size": 21,
"rewrites": 96
},
"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": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1186
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F ((F (G (((1 <= p170)))) AND ((1 <= p324))))",
"processed_size": 45,
"rewrites": 96
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 11,
"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": 1779
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 0,
"aneg": 3,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G (((F (G (((p201 <= 0)))) AND F (((p30 <= 0) OR (p47 <= 0)))) OR ((p347 <= 0))))",
"processed_size": 82,
"rewrites": 96
},
"result":
{
"edges": 175776,
"markings": 148532,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 12,
"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": 3557
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 5,
"G": 2,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 2,
"aneg": 4,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 2,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F ((((p443 <= 0) OR (p450 <= 0)) AND (F ((F (((1 <= p149))) AND (F (((1 <= p57) AND (1 <= p59))) OR G (F (((1 <= p149))))))) OR G (((p443 <= 0) OR (p450 <= 0))))))",
"processed_size": 165,
"rewrites": 96
},
"result":
{
"edges": 121,
"markings": 109,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 13
},
"compoundnumber": 13,
"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": 45024,
"runtime": 13.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F((F(G(**)) AND **)) : G(((F(G(*)) AND F(*)) OR *)) : X((G(*) AND F(**))) : F((* AND (F((F(*) AND (F(**) OR G(F(*))))) OR G(*)))) : (X(G(**)) AND F((F(**) AND (G(**) AND (** AND **))))) : X(X(X(G((* AND (F(G(*)) OR G(*))))))) : F((** AND (X(**) OR (X(**) AND (X(X(**)) OR (** OR **)))))) : G(F(**)) : X(((X(F((X(**) AND *))) R *) OR **)) : F(**) : (X(G(**)) OR (* R X(*))) : X(X(G(*))) : X((F((X(G(*)) AND F(**))) AND F(**))) : X(((F(**) OR X(G((F(**) AND (** OR **))))) U *))"
},
"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 no no yes no no yes ",
"value": "no no no no no no no no no no yes 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 LTLFireability.xml
lola: LP says that atomic proposition is always true: (p170 <= 1)
lola: LP says that atomic proposition is always true: (p324 <= 1)
lola: LP says that atomic proposition is always true: (p201 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p347 <= 1)
lola: LP says that atomic proposition is always true: (p365 <= 1)
lola: LP says that atomic proposition is always true: (p399 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p354 <= 1)
lola: LP says that atomic proposition is always true: (p373 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p57 <= 1)
lola: LP says that atomic proposition is always true: (p59 <= 1)
lola: LP says that atomic proposition is always true: (p149 <= 1)
lola: LP says that atomic proposition is always true: (p443 <= 1)
lola: LP says that atomic proposition is always true: (p450 <= 1)
lola: LP says that atomic proposition is always true: (p205 <= 1)
lola: LP says that atomic proposition is always true: (p222 <= 1)
lola: LP says that atomic proposition is always true: (p445 <= 1)
lola: LP says that atomic proposition is always true: (p460 <= 1)
lola: LP says that atomic proposition is always true: (p117 <= 1)
lola: LP says that atomic proposition is always true: (p119 <= 1)
lola: LP says that atomic proposition is always true: (p205 <= 1)
lola: LP says that atomic proposition is always true: (p222 <= 1)
lola: LP says that atomic proposition is always true: (p479 <= 1)
lola: LP says that atomic proposition is always true: (p498 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p433 <= 1)
lola: LP says that atomic proposition is always true: (p450 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p77 <= 1)
lola: LP says that atomic proposition is always true: (p262 <= 1)
lola: LP says that atomic proposition is always true: (p264 <= 1)
lola: LP says that atomic proposition is always true: (p262 <= 1)
lola: LP says that atomic proposition is always true: (p264 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p262 <= 1)
lola: LP says that atomic proposition is always true: (p264 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p272 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p73 <= 1)
lola: LP says that atomic proposition is always true: (p356 <= 1)
lola: LP says that atomic proposition is always true: (p371 <= 1)
lola: LP says that atomic proposition is always true: (p407 <= 1)
lola: LP says that atomic proposition is always true: (p409 <= 1)
lola: LP says that atomic proposition is always true: (p407 <= 1)
lola: LP says that atomic proposition is always true: (p409 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p76 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p438 <= 1)
lola: LP says that atomic proposition is always true: (p452 <= 1)
lola: LP says that atomic proposition is always true: (p406 <= 1)
lola: LP says that atomic proposition is always true: (p421 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p495 <= 1)
lola: LP says that atomic proposition is always true: (p495 <= 1)
lola: LP says that atomic proposition is always true: (p351 <= 1)
lola: LP says that atomic proposition is always true: (p351 <= 1)
lola: LP says that atomic proposition is always true: (p331 <= 1)
lola: LP says that atomic proposition is always true: (p346 <= 1)
lola: LP says that atomic proposition is always true: (p386 <= 1)
lola: LP says that atomic proposition is always true: (p396 <= 1)
lola: LP says that atomic proposition is always true: (p236 <= 1)
lola: LP says that atomic proposition is always true: (p246 <= 1)
lola: LP says that atomic proposition is always true: (p206 <= 1)
lola: LP says that atomic proposition is always true: (p221 <= 1)
lola: F ((X (F (G (F (G (((1 <= p170))))))) AND ((1 <= p324)))) : NOT(F (((F (G (X (F (((1 <= p201)))))) OR G (((1 <= p30) AND (1 <= p47)))) AND ((1 <= p347))))) : X ((NOT((((1 <= p365) AND (1 <= p399)) U F (((1 <= p28) AND (1 <= p51))))) AND (((1 <= p354) AND (1 <= p373)) U F (((1 <= p30) AND (1 <= p47)))))) : NOT(G ((G ((NOT(F (((1 <= p57) AND (1 <= p59)))) U G (((p149 <= 0))))) U ((1 <= p443) AND (1 <= p450))))) : (G (X (((1 <= p205) AND (1 <= p222)))) AND F ((((F (((p445 <= 0) OR (p460 <= 0) OR (p117 <= 0) OR (p119 <= 0))) AND G (((1 <= p205) AND (1 <= p222)))) AND ((1 <= p479))) AND ((1 <= p498))))) : G (X (G (X (X (NOT((G ((F (((1 <= p92) AND (1 <= p94))) U F (((1 <= p433) AND (1 <= p450))))) U ((1 <= p63) AND (1 <= p77))))))))) : F ((((1 <= p262) AND (1 <= p264)) AND (X (((1 <= p262) AND (1 <= p264))) OR (X (((1 <= p1) AND (1 <= p24))) AND ((X (X (((1 <= p262) AND (1 <= p264)))) OR ((p1 <= 0))) OR ((p24 <= 0))))))) : G (F (((1 <= p272)))) : X ((NOT((G (X ((NOT(X (((1 <= p54) AND (1 <= p73)))) OR ((1 <= p356) AND (1 <= p371))))) U ((1 <= p407) AND (1 <= p409)))) OR ((1 <= p407) AND (1 <= p409)))) : F (((1 <= p53) AND (1 <= p76) AND (1 <= p42) AND (1 <= p44))) : (NOT(F (NOT(X (((1 <= p438) AND (1 <= p452)))))) OR NOT((((1 <= p406) AND (1 <= p421)) U X (((1 <= p45)))))) : G (X (NOT(X (((1 <= p38) AND (1 <= p52)))))) : X ((F ((NOT(F (X (((1 <= p495))))) AND F ((((1 <= p495)) U ((p351 <= 0)))))) AND F (((1 <= p351))))) : (X ((F (((1 <= p331) AND (1 <= p346))) OR G (X ((((1 <= p386) AND (1 <= p396)) U ((1 <= p236) AND (1 <= p246))))))) U NOT(X (((1 <= p206) AND (1 <= p221)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:297
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:300
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:434
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (((p28 <= 0) OR (p51 <= 0))) AND F (((1 <= p30) AND (1 <= p47)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (((p28 <= 0) OR (p51 <= 0))) AND F (((1 <= p30) AND (1 <= p47)))))
lola: processed formula length: 73
lola: 96 rewrites
lola: closed formula file LTLFireability.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: 329 markings, 329 edges
lola: ========================================
lola: subprocess 1 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G (((1 <= p205) AND (1 <= p222)))) AND F ((F (((p445 <= 0) OR (p460 <= 0) OR (p117 <= 0) OR (p119 <= 0))) AND (G (((1 <= p205) AND (1 <= p222))) AND (((1 <= p479)) AND ((1 <= p498)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F (((p445 <= 0) OR (p460 <= 0) OR (p117 <= 0) OR (p119 <= 0))) AND (G (((1 <= p205) AND (1 <= p222))) AND (((1 <= p479)) AND ((1 <= p498))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F (((p445 <= 0) OR (p460 <= 0) OR (p117 <= 0) OR (p119 <= 0))) AND (G (((1 <= p205) AND (1 <= p222))) AND (((1 <= p479)) AND ((1 <= p498))))))
lola: processed formula length: 149
lola: 96 rewrites
lola: closed formula file LTLFireability.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: 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: 49 markings, 49 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (G ((((p63 <= 0) OR (p77 <= 0)) AND (F (G (((p433 <= 0) OR (p450 <= 0)))) OR G (((p63 <= 0) OR (p77 <= 0)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (G ((((p63 <= 0) OR (p77 <= 0)) AND (F (G (((p433 <= 0) OR (p450 <= 0)))) OR G (((p63 <= 0) OR (p77 <= 0)))))))))
lola: processed formula length: 124
lola: 96 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 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: add low 66
lola: add low 65
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: 374952 markings, 970341 edges
lola: ========================================
lola: subprocess 3 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((1 <= p262) AND (1 <= p264)) AND (X (((1 <= p262) AND (1 <= p264))) OR (X (((1 <= p1) AND (1 <= p24))) AND (X (X (((1 <= p262) AND (1 <= p264)))) OR (((p1 <= 0)) OR ((p24 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((((1 <= p262) AND (1 <= p264)) AND (X (((1 <= p262) AND (1 <= p264))) OR (X (((1 <= p1) AND (1 <= p24))) AND (X (X (((1 <= p262) AND (1 <= p264)))) OR (((p1 <= 0)) OR ((p24 <= 0))))))))
lola: processed formula length: 188
lola: 96 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 481 markings, 481 edges
lola: ========================================
lola: subprocess 4 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((X (F ((X (((1 <= p54) AND (1 <= p73))) AND ((p356 <= 0) OR (p371 <= 0))))) R ((p407 <= 0) OR (p409 <= 0))) OR ((1 <= p407) AND (1 <= p409))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((X (F ((X (((1 <= p54) AND (1 <= p73))) AND ((p356 <= 0) OR (p371 <= 0))))) R ((p407 <= 0) OR (p409 <= 0))) OR ((1 <= p407) AND (1 <= p409))))
lola: processed formula length: 148
lola: 96 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 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: 393 markings, 393 edges
lola: ========================================
lola: subprocess 5 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G (((1 <= p438) AND (1 <= p452)))) OR (((p406 <= 0) OR (p421 <= 0)) R X (((p45 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((1 <= p438) AND (1 <= p452))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((1 <= p438) AND (1 <= p452))))
lola: processed formula length: 37
lola: 96 rewrites
lola: closed formula file LTLFireability.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: 329 markings, 329 edges
lola: ========================================
lola: subprocess 6 will run for 444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p406 <= 0) OR (p421 <= 0)) R X (((p45 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((p406 <= 0) OR (p421 <= 0)) R X (((p45 <= 0))))
lola: processed formula length: 50
lola: 96 rewrites
lola: closed formula file LTLFireability.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: 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 6 will run for 444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G (((p38 <= 0) OR (p52 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G (((p38 <= 0) OR (p52 <= 0)))))
lola: processed formula length: 39
lola: 96 rewrites
lola: closed formula file LTLFireability.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: 329 markings, 329 edges
lola: ========================================
lola: subprocess 7 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((X (G (((p495 <= 0)))) AND F (((p351 <= 0))))) AND F (((1 <= p351)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((X (G (((p495 <= 0)))) AND F (((p351 <= 0))))) AND F (((1 <= p351)))))
lola: processed formula length: 77
lola: 96 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 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: 539 markings, 539 edges
lola: ========================================
lola: subprocess 8 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((F (((1 <= p331) AND (1 <= p346))) OR X (G ((F (((1 <= p236) AND (1 <= p246))) AND (((1 <= p386) AND (1 <= p396)) OR ((1 <= p236) AND (1 <= p246))))))) U ((p206 <= 0) OR (p221 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((F (((1 <= p331) AND (1 <= p346))) OR X (G ((F (((1 <= p236) AND (1 <= p246))) AND (((1 <= p386) AND (1 <= p396)) OR ((1 <= p236) AND (1 <= p246))))))) U ((p206 <= 0) OR (p221 <= 0))))
lola: processed formula length: 189
lola: 96 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 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: subprocess 9 will run for 711 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p53) AND (1 <= p76) AND (1 <= p42) AND (1 <= p44)))
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: ((p53 <= 0) OR (p76 <= 0) OR (p42 <= 0) OR (p44 <= 0))
lola: processed formula length: 57
lola: 98 rewrites
lola: closed formula file LTLFireability.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 10 will run for 889 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p272))))
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 <= p272))))
lola: processed formula length: 21
lola: 96 rewrites
lola: closed formula file LTLFireability.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 11 will run for 1186 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F (G (((1 <= p170)))) AND ((1 <= p324))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F (G (((1 <= p170)))) AND ((1 <= p324))))
lola: processed formula length: 45
lola: 96 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 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 12 will run for 1779 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((F (G (((p201 <= 0)))) AND F (((p30 <= 0) OR (p47 <= 0)))) OR ((p347 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((F (G (((p201 <= 0)))) AND F (((p30 <= 0) OR (p47 <= 0)))) OR ((p347 <= 0))))
lola: processed formula length: 82
lola: 96 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 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: 148532 markings, 175776 edges
lola: ========================================
lola: subprocess 13 will run for 3557 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((p443 <= 0) OR (p450 <= 0)) AND (F ((F (((1 <= p149))) AND (F (((1 <= p57) AND (1 <= p59))) OR G (F (((1 <= p149))))))) OR G (((p443 <= 0) OR (p450 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((((p443 <= 0) OR (p450 <= 0)) AND (F ((F (((1 <= p149))) AND (F (((1 <= p57) AND (1 <= p59))) OR G (F (((1 <= p149))))))) OR G (((p443 <= 0) OR (p450 <= 0))))))
lola: processed formula length: 165
lola: 96 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 13 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: 109 markings, 121 edges
lola: RESULT
lola:
SUMMARY: no no no no no no no no no no yes no no yes
lola:
preliminary result: no no no no no no no no no no yes no no yes
lola: ========================================
lola: memory consumption: 45024 KB
lola: time consumption: 13 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.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="LTLFireability"
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 LTLFireability"
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-162098231300394"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;