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.r246-smll-162106594300145.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is ShieldRVt-PT-030A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r246-smll-162106594300145
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 8.9K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K 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.4K Mar 28 16:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 28 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 27 13:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 13:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 19:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 19:06 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 82K 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 ShieldRVt-PT-030A-00
FORMULA_NAME ShieldRVt-PT-030A-01
FORMULA_NAME ShieldRVt-PT-030A-02
FORMULA_NAME ShieldRVt-PT-030A-03
FORMULA_NAME ShieldRVt-PT-030A-04
FORMULA_NAME ShieldRVt-PT-030A-05
FORMULA_NAME ShieldRVt-PT-030A-06
FORMULA_NAME ShieldRVt-PT-030A-07
FORMULA_NAME ShieldRVt-PT-030A-08
FORMULA_NAME ShieldRVt-PT-030A-09
FORMULA_NAME ShieldRVt-PT-030A-10
FORMULA_NAME ShieldRVt-PT-030A-11
FORMULA_NAME ShieldRVt-PT-030A-12
FORMULA_NAME ShieldRVt-PT-030A-13
FORMULA_NAME ShieldRVt-PT-030A-14
FORMULA_NAME ShieldRVt-PT-030A-15

=== Now, execution of the tool begins

BK_START 1621324243511

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-18 07:50:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-18 07:50:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 07:50:46] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2021-05-18 07:50:46] [INFO ] Transformed 243 places.
[2021-05-18 07:50:46] [INFO ] Transformed 243 transitions.
[2021-05-18 07:50:46] [INFO ] Found NUPN structural information;
[2021-05-18 07:50:46] [INFO ] Parsed PT model containing 243 places and 243 transitions in 177 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 41 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 697 ms. (steps per millisecond=143 ) properties seen :[1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1]
// Phase 1: matrix 242 rows 243 cols
[2021-05-18 07:50:47] [INFO ] Computed 121 place invariants in 13 ms
[2021-05-18 07:50:47] [INFO ] [Real]Absence check using 121 positive place invariants in 99 ms returned sat
[2021-05-18 07:50:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 07:50:48] [INFO ] [Real]Absence check using state equation in 319 ms returned sat
[2021-05-18 07:50:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 07:50:48] [INFO ] [Nat]Absence check using 121 positive place invariants in 15 ms returned unsat
[2021-05-18 07:50:48] [INFO ] [Real]Absence check using 121 positive place invariants in 59 ms returned sat
[2021-05-18 07:50:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 07:50:48] [INFO ] [Real]Absence check using state equation in 241 ms returned sat
[2021-05-18 07:50:48] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 36 ms.
[2021-05-18 07:50:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 07:50:49] [INFO ] [Nat]Absence check using 121 positive place invariants in 60 ms returned sat
[2021-05-18 07:50:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 07:50:49] [INFO ] [Nat]Absence check using state equation in 633 ms returned sat
[2021-05-18 07:50:49] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 54 ms.
[2021-05-18 07:50:51] [INFO ] Added : 239 causal constraints over 49 iterations in 1639 ms. Result :sat
[2021-05-18 07:50:51] [INFO ] [Real]Absence check using 121 positive place invariants in 58 ms returned sat
[2021-05-18 07:50:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 07:50:51] [INFO ] [Real]Absence check using state equation in 257 ms returned sat
[2021-05-18 07:50:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 07:50:51] [INFO ] [Nat]Absence check using 121 positive place invariants in 11 ms returned unsat
[2021-05-18 07:50:52] [INFO ] [Real]Absence check using 121 positive place invariants in 79 ms returned sat
[2021-05-18 07:50:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 07:50:52] [INFO ] [Real]Absence check using state equation in 250 ms returned sat
[2021-05-18 07:50:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 07:50:52] [INFO ] [Nat]Absence check using 121 positive place invariants in 56 ms returned sat
[2021-05-18 07:50:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 07:50:52] [INFO ] [Nat]Absence check using state equation in 267 ms returned sat
[2021-05-18 07:50:52] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 22 ms.
[2021-05-18 07:50:54] [INFO ] Added : 234 causal constraints over 48 iterations in 1438 ms. Result :sat
[2021-05-18 07:50:54] [INFO ] [Real]Absence check using 121 positive place invariants in 59 ms returned sat
[2021-05-18 07:50:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 07:50:54] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2021-05-18 07:50:54] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 24 ms.
[2021-05-18 07:50:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 07:50:54] [INFO ] [Nat]Absence check using 121 positive place invariants in 52 ms returned sat
[2021-05-18 07:50:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 07:50:54] [INFO ] [Nat]Absence check using state equation in 222 ms returned sat
[2021-05-18 07:50:55] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 22 ms.
[2021-05-18 07:50:56] [INFO ] Added : 239 causal constraints over 48 iterations in 1386 ms. Result :sat
[2021-05-18 07:50:56] [INFO ] [Real]Absence check using 121 positive place invariants in 55 ms returned sat
[2021-05-18 07:50:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 07:50:56] [INFO ] [Real]Absence check using state equation in 241 ms returned sat
[2021-05-18 07:50:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 07:50:56] [INFO ] [Nat]Absence check using 121 positive place invariants in 11 ms returned unsat
[2021-05-18 07:50:56] [INFO ] [Real]Absence check using 121 positive place invariants in 54 ms returned sat
[2021-05-18 07:50:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 07:50:57] [INFO ] [Real]Absence check using state equation in 233 ms returned sat
[2021-05-18 07:50:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 07:50:57] [INFO ] [Nat]Absence check using 121 positive place invariants in 50 ms returned sat
[2021-05-18 07:50:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 07:50:57] [INFO ] [Nat]Absence check using state equation in 237 ms returned sat
[2021-05-18 07:50:57] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 21 ms.
[2021-05-18 07:50:58] [INFO ] Added : 238 causal constraints over 48 iterations in 1241 ms. Result :sat
[2021-05-18 07:50:58] [INFO ] [Real]Absence check using 121 positive place invariants in 49 ms returned sat
[2021-05-18 07:50:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 07:50:59] [INFO ] [Real]Absence check using state equation in 249 ms returned sat
[2021-05-18 07:50:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 07:50:59] [INFO ] [Nat]Absence check using 121 positive place invariants in 50 ms returned sat
[2021-05-18 07:50:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 07:50:59] [INFO ] [Nat]Absence check using state equation in 241 ms returned sat
[2021-05-18 07:50:59] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 29 ms.
[2021-05-18 07:51:00] [INFO ] Added : 238 causal constraints over 48 iterations in 1232 ms. Result :sat
[2021-05-18 07:51:00] [INFO ] [Real]Absence check using 121 positive place invariants in 51 ms returned sat
[2021-05-18 07:51:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 07:51:01] [INFO ] [Real]Absence check using state equation in 231 ms returned sat
[2021-05-18 07:51:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 07:51:01] [INFO ] [Nat]Absence check using 121 positive place invariants in 11 ms returned unsat
[2021-05-18 07:51:01] [INFO ] [Real]Absence check using 121 positive place invariants in 52 ms returned sat
[2021-05-18 07:51:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 07:51:01] [INFO ] [Real]Absence check using state equation in 239 ms returned sat
[2021-05-18 07:51:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 07:51:01] [INFO ] [Nat]Absence check using 121 positive place invariants in 10 ms returned unsat
[2021-05-18 07:51:01] [INFO ] [Real]Absence check using 121 positive place invariants in 48 ms returned sat
[2021-05-18 07:51:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 07:51:01] [INFO ] [Real]Absence check using state equation in 239 ms returned sat
[2021-05-18 07:51:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 07:51:02] [INFO ] [Nat]Absence check using 121 positive place invariants in 11 ms returned unsat
[2021-05-18 07:51:02] [INFO ] [Real]Absence check using 121 positive place invariants in 53 ms returned sat
[2021-05-18 07:51:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 07:51:02] [INFO ] [Real]Absence check using state equation in 236 ms returned sat
[2021-05-18 07:51:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 07:51:02] [INFO ] [Nat]Absence check using 121 positive place invariants in 53 ms returned sat
[2021-05-18 07:51:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 07:51:02] [INFO ] [Nat]Absence check using state equation in 224 ms returned sat
[2021-05-18 07:51:02] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 20 ms.
[2021-05-18 07:51:04] [INFO ] Added : 241 causal constraints over 49 iterations in 1285 ms. Result :sat
[2021-05-18 07:51:04] [INFO ] [Real]Absence check using 121 positive place invariants in 51 ms returned sat
[2021-05-18 07:51:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 07:51:04] [INFO ] [Real]Absence check using state equation in 228 ms returned sat
[2021-05-18 07:51:04] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 24 ms.
[2021-05-18 07:51:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 07:51:04] [INFO ] [Nat]Absence check using 121 positive place invariants in 54 ms returned sat
[2021-05-18 07:51:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 07:51:04] [INFO ] [Nat]Absence check using state equation in 226 ms returned sat
[2021-05-18 07:51:04] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 16 ms.
[2021-05-18 07:51:06] [INFO ] Added : 238 causal constraints over 49 iterations in 1253 ms. Result :sat
[2021-05-18 07:51:06] [INFO ] [Real]Absence check using 121 positive place invariants in 52 ms returned sat
[2021-05-18 07:51:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 07:51:06] [INFO ] [Real]Absence check using state equation in 236 ms returned sat
[2021-05-18 07:51:06] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 16 ms.
[2021-05-18 07:51:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 07:51:06] [INFO ] [Nat]Absence check using 121 positive place invariants in 58 ms returned sat
[2021-05-18 07:51:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 07:51:06] [INFO ] [Nat]Absence check using state equation in 227 ms returned sat
[2021-05-18 07:51:06] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 17 ms.
[2021-05-18 07:51:08] [INFO ] Added : 240 causal constraints over 49 iterations in 1212 ms. Result :sat
[2021-05-18 07:51:08] [INFO ] [Real]Absence check using 121 positive place invariants in 53 ms returned sat
[2021-05-18 07:51:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 07:51:08] [INFO ] [Real]Absence check using state equation in 239 ms returned sat
[2021-05-18 07:51:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 07:51:08] [INFO ] [Nat]Absence check using 121 positive place invariants in 48 ms returned sat
[2021-05-18 07:51:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 07:51:08] [INFO ] [Nat]Absence check using state equation in 256 ms returned sat
[2021-05-18 07:51:08] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 17 ms.
[2021-05-18 07:51:10] [INFO ] Added : 238 causal constraints over 48 iterations in 1314 ms. Result :sat
[2021-05-18 07:51:10] [INFO ] [Real]Absence check using 121 positive place invariants in 53 ms returned sat
[2021-05-18 07:51:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 07:51:10] [INFO ] [Real]Absence check using state equation in 235 ms returned sat
[2021-05-18 07:51:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 07:51:10] [INFO ] [Nat]Absence check using 121 positive place invariants in 52 ms returned sat
[2021-05-18 07:51:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 07:51:10] [INFO ] [Nat]Absence check using state equation in 226 ms returned sat
[2021-05-18 07:51:10] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 19 ms.
[2021-05-18 07:51:12] [INFO ] Added : 238 causal constraints over 49 iterations in 1326 ms. Result :sat
[2021-05-18 07:51:12] [INFO ] [Real]Absence check using 121 positive place invariants in 51 ms returned sat
[2021-05-18 07:51:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 07:51:12] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
[2021-05-18 07:51:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 07:51:12] [INFO ] [Nat]Absence check using 121 positive place invariants in 52 ms returned sat
[2021-05-18 07:51:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 07:51:12] [INFO ] [Nat]Absence check using state equation in 230 ms returned sat
[2021-05-18 07:51:12] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 17 ms.
[2021-05-18 07:51:14] [INFO ] Added : 240 causal constraints over 49 iterations in 1369 ms. Result :sat
Successfully simplified 6 atomic propositions for a total of 7 simplifications.
[2021-05-18 07:51:14] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2021-05-18 07:51:14] [INFO ] Flatten gal took : 118 ms
FORMULA ShieldRVt-PT-030A-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030A-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030A-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030A-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030A-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030A-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030A-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030A-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 07:51:14] [INFO ] Applying decomposition
[2021-05-18 07:51:14] [INFO ] Flatten gal took : 46 ms
[2021-05-18 07:51:14] [INFO ] Decomposing Gal with order
[2021-05-18 07:51:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 07:51:14] [INFO ] Removed a total of 90 redundant transitions.
[2021-05-18 07:51:14] [INFO ] Flatten gal took : 109 ms
[2021-05-18 07:51:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 16 ms.
[2021-05-18 07:51:14] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 5 ms.
[2021-05-18 07:51:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 12 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ ShieldRVt-PT-030A @ 3570 seconds

FORMULA ShieldRVt-PT-030A-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-030A-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-030A-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-030A-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-030A-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-030A-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-030A-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-030A-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3566
rslt: Output for LTLCardinality @ ShieldRVt-PT-030A

{
"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": "Tue May 18 07:51:16 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 1,
"X": 1,
"aconj": 9,
"adisj": 6,
"aneg": 2,
"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": 6,
"visible_transitions": 0
},
"processed": "((G ((((1 <= p182)) AND ((p50 <= 0)))) OR ((((p122 <= 0)) OR ((1 <= p226))) AND (X ((((1 <= p182)) AND ((p50 <= 0)))) OR G ((((p182 <= 0)) OR ((1 <= p50))))))) U (((1 <= p44)) AND ((p121 <= 0))))",
"processed_size": 197,
"rewrites": 72
},
"result":
{
"edges": 194,
"markings": 194,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"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": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 6,
"adisj": 3,
"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": "G (F ((G ((((1 <= p80)) AND ((p118 <= 0)))) OR ((((1 <= p49)) AND ((p197 <= 0))) AND X ((((1 <= p80)) AND ((p118 <= 0))))))))",
"processed_size": 125,
"rewrites": 72
},
"result":
{
"edges": 194,
"markings": 194,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"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": "X (G ((((p177 <= 0)) OR ((1 <= p40)))))",
"processed_size": 40,
"rewrites": 72
},
"result":
{
"edges": 194,
"markings": 194,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (((p185 <= 0)))",
"processed_size": 17,
"rewrites": 72
},
"result":
{
"edges": 53,
"markings": 42,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"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": 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": "F (G (((1 <= p73))))",
"processed_size": 20,
"rewrites": 72
},
"result":
{
"edges": 7,
"markings": 6,
"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": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"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": "F (G ((((p124 <= 0)) OR ((1 <= p108)))))",
"processed_size": 41,
"rewrites": 72
},
"result":
{
"edges": 4638,
"markings": 2990,
"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": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 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": "F (G ((((p98 <= 0)) OR ((1 <= p116)))))",
"processed_size": 40,
"rewrites": 72
},
"result":
{
"edges": 7941,
"markings": 5749,
"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": 3566
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"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 (F ((((p124 <= 0)) OR ((1 <= p61)))))",
"processed_size": 40,
"rewrites": 72
},
"result":
{
"edges": 6,
"markings": 6,
"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": "fairness",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 30368,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(G(**)) : ((G(*) OR (** AND (X(*) OR G(**)))) U **) : G(F((G(*) OR (* AND X(*))))) : F(G(**)) : X(G(**)) : (X(G(**)) AND G(**)) : F(G(**)) : G(F(**))"
},
"net":
{
"arcs": 1024,
"conflict_clusters": 63,
"places": 243,
"places_significant": 122,
"singleton_clusters": 0,
"transitions": 242
},
"result":
{
"preliminary_value": "no no no no no no no no ",
"value": "no no no no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 485/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 243
lola: finding significant places
lola: 243 places, 242 transitions, 122 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: (p73 <= 1)
lola: LP says that atomic proposition is always true: (p73 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p226 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p121 <= 1)
lola: LP says that atomic proposition is always true: (p197 <= 1)
lola: LP says that atomic proposition is always true: (p118 <= 1)
lola: LP says that atomic proposition is always true: (p178 <= 1)
lola: LP says that atomic proposition is always true: (p118 <= 1)
lola: LP says that atomic proposition is always true: (p108 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p138 <= 1)
lola: LP says that atomic proposition is always true: (p185 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p116 <= 1)
lola: LP says that atomic proposition is always true: (p125 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: F (G (((((1 <= p73)) U (1 <= 0)) U ((1 <= p73))))) : ((NOT(F ((((p182 <= 0)) OR ((1 <= p50))))) OR ((((p122 <= 0)) OR ((1 <= p226))) AND (NOT(X ((((p182 <= 0)) OR ((1 <= p50))))) OR G ((((p182 <= 0)) OR ((1 <= p50))))))) U (((1 <= p44)) AND ((p121 <= 0)))) : X (F (G (NOT(X (X (G (X (((1 <= 0) U ((((p49 <= 0)) OR ((1 <= p197))) U X ((((p80 <= 0)) OR ((1 <= p118)))))))))))))) : ((((1 <= p223)) AND ((p178 <= 0))) U ((((p72 <= 0)) OR ((1 <= p118))) U F (G ((((p124 <= 0)) OR ((1 <= p108))))))) : NOT(X ((F ((((1 <= p177)) AND ((p40 <= 0)))) U NOT(G ((((p177 <= 0)) OR ((1 <= p40)))))))) : (X (G ((((p149 <= 0)) OR ((1 <= p138))))) AND G (((p185 <= 0)))) : G (X (NOT(G (NOT((X (G ((((p3 <= 0)) OR ((1 <= p214))))) U G ((((p98 <= 0)) OR ((1 <= p116)))))))))) : G (NOT(X (((((1 <= p125)) U (1 <= 0)) U X (G (NOT(F ((((p124 <= 0)) OR ((1 <= p61)))))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k: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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:341
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((G ((((1 <= p182)) AND ((p50 <= 0)))) OR ((((p122 <= 0)) OR ((1 <= p226))) AND (X ((((1 <= p182)) AND ((p50 <= 0)))) OR G ((((p182 <= 0)) OR ((1 <= p50))))))) U (((1 <= p44)) AND ((p121 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((G ((((1 <= p182)) AND ((p50 <= 0)))) OR ((((p122 <= 0)) OR ((1 <= p226))) AND (X ((((1 <= p182)) AND ((p50 <= 0)))) OR G ((((p182 <= 0)) OR ((1 <= p50))))))) U (((1 <= p44)) AND ((p121 <= 0))))
lola: processed formula length: 197
lola: 72 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 9 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: 194 markings, 194 edges
lola: ========================================
lola: subprocess 1 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((((1 <= p80)) AND ((p118 <= 0)))) OR ((((1 <= p49)) AND ((p197 <= 0))) AND X ((((1 <= p80)) AND ((p118 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((((1 <= p80)) AND ((p118 <= 0)))) OR ((((1 <= p49)) AND ((p197 <= 0))) AND X ((((1 <= p80)) AND ((p118 <= 0))))))))
lola: processed formula length: 125
lola: 72 rewrites
lola: closed formula file LTLCardinality.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: 194 markings, 194 edges
lola: ========================================
lola: subprocess 2 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((((p177 <= 0)) OR ((1 <= p40)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((p177 <= 0)) OR ((1 <= p40)))))
lola: processed formula length: 40
lola: 72 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 194 markings, 194 edges
lola: ========================================
lola: subprocess 3 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((((p149 <= 0)) OR ((1 <= p138))))) AND G (((p185 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p185 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p185 <= 0)))
lola: processed formula length: 17
lola: 72 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: 42 markings, 53 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p73))))
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 <= p73))))
lola: processed formula length: 20
lola: 72 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: 6 markings, 7 edges
lola: ========================================
lola: subprocess 5 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p124 <= 0)) OR ((1 <= p108)))))
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 ((((p124 <= 0)) OR ((1 <= p108)))))
lola: processed formula length: 41
lola: 72 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: 2990 markings, 4638 edges
lola: ========================================
lola: subprocess 6 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p98 <= 0)) OR ((1 <= p116)))))
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 ((((p98 <= 0)) OR ((1 <= p116)))))
lola: processed formula length: 40
lola: 72 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: 5749 markings, 7941 edges
lola: ========================================
lola: subprocess 7 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((p124 <= 0)) OR ((1 <= p61)))))
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 ((((p124 <= 0)) OR ((1 <= p61)))))
lola: processed formula length: 40
lola: 72 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: 6 markings, 6 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no no
lola:
preliminary result: no no no no no no no no
lola: memory consumption: 30368 KB
lola: time consumption: 4 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="ShieldRVt-PT-030A"
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 ShieldRVt-PT-030A, 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 r246-smll-162106594300145"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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