Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r211-tajo-159033478401065.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-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 itslola
Input is ShieldRVt-PT-050A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033478401065
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 308K
-rw-r--r-- 1 mcc users 3.1K May 14 03:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 14 03:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 13 20:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 13 20:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 14 10:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 14 10:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 14 10:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.7K May 13 14:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 13 14:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 09:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 13 09:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 136K May 12 20:42 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-050A-00
FORMULA_NAME ShieldRVt-PT-050A-01
FORMULA_NAME ShieldRVt-PT-050A-02
FORMULA_NAME ShieldRVt-PT-050A-03
FORMULA_NAME ShieldRVt-PT-050A-04
FORMULA_NAME ShieldRVt-PT-050A-05
FORMULA_NAME ShieldRVt-PT-050A-06
FORMULA_NAME ShieldRVt-PT-050A-07
FORMULA_NAME ShieldRVt-PT-050A-08
FORMULA_NAME ShieldRVt-PT-050A-09
FORMULA_NAME ShieldRVt-PT-050A-10
FORMULA_NAME ShieldRVt-PT-050A-11
FORMULA_NAME ShieldRVt-PT-050A-12
FORMULA_NAME ShieldRVt-PT-050A-13
FORMULA_NAME ShieldRVt-PT-050A-14
FORMULA_NAME ShieldRVt-PT-050A-15

=== Now, execution of the tool begins

BK_START 1591340332240

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 06:58:54] [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]
[2020-06-05 06:58:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 06:58:54] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2020-06-05 06:58:54] [INFO ] Transformed 403 places.
[2020-06-05 06:58:54] [INFO ] Transformed 403 transitions.
[2020-06-05 06:58:54] [INFO ] Found NUPN structural information;
[2020-06-05 06:58:54] [INFO ] Parsed PT model containing 403 places and 403 transitions in 150 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 577 ms. (steps per millisecond=173 ) properties seen :[0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0]
// Phase 1: matrix 402 rows 403 cols
[2020-06-05 06:58:55] [INFO ] Computed 201 place invariants in 17 ms
[2020-06-05 06:58:55] [INFO ] [Real]Absence check using 201 positive place invariants in 129 ms returned sat
[2020-06-05 06:58:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:58:56] [INFO ] [Real]Absence check using state equation in 512 ms returned sat
[2020-06-05 06:58:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:58:56] [INFO ] [Nat]Absence check using 201 positive place invariants in 15 ms returned unsat
[2020-06-05 06:58:56] [INFO ] [Real]Absence check using 201 positive place invariants in 111 ms returned sat
[2020-06-05 06:58:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:58:56] [INFO ] [Real]Absence check using state equation in 352 ms returned sat
[2020-06-05 06:58:56] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 45 ms.
[2020-06-05 06:58:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:58:57] [INFO ] [Nat]Absence check using 201 positive place invariants in 112 ms returned sat
[2020-06-05 06:58:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:58:57] [INFO ] [Nat]Absence check using state equation in 358 ms returned sat
[2020-06-05 06:58:57] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 24 ms.
[2020-06-05 06:59:01] [INFO ] Added : 397 causal constraints over 80 iterations in 3808 ms. Result :sat
[2020-06-05 06:59:01] [INFO ] [Real]Absence check using 201 positive place invariants in 87 ms returned sat
[2020-06-05 06:59:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:59:02] [INFO ] [Real]Absence check using state equation in 428 ms returned sat
[2020-06-05 06:59:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:59:02] [INFO ] [Nat]Absence check using 201 positive place invariants in 106 ms returned sat
[2020-06-05 06:59:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:59:02] [INFO ] [Nat]Absence check using state equation in 342 ms returned sat
[2020-06-05 06:59:02] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 42 ms.
[2020-06-05 06:59:06] [INFO ] Added : 399 causal constraints over 80 iterations in 3408 ms. Result :sat
[2020-06-05 06:59:06] [INFO ] [Real]Absence check using 201 positive place invariants in 104 ms returned sat
[2020-06-05 06:59:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:59:06] [INFO ] [Real]Absence check using state equation in 408 ms returned sat
[2020-06-05 06:59:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:59:06] [INFO ] [Nat]Absence check using 201 positive place invariants in 75 ms returned sat
[2020-06-05 06:59:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:59:07] [INFO ] [Nat]Absence check using state equation in 367 ms returned sat
[2020-06-05 06:59:07] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 26 ms.
[2020-06-05 06:59:10] [INFO ] Added : 396 causal constraints over 80 iterations in 3532 ms. Result :sat
[2020-06-05 06:59:10] [INFO ] [Real]Absence check using 201 positive place invariants in 84 ms returned sat
[2020-06-05 06:59:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:59:11] [INFO ] [Real]Absence check using state equation in 464 ms returned sat
[2020-06-05 06:59:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:59:11] [INFO ] [Nat]Absence check using 201 positive place invariants in 74 ms returned sat
[2020-06-05 06:59:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:59:11] [INFO ] [Nat]Absence check using state equation in 333 ms returned sat
[2020-06-05 06:59:11] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 26 ms.
[2020-06-05 06:59:15] [INFO ] Added : 397 causal constraints over 80 iterations in 3561 ms. Result :sat
[2020-06-05 06:59:15] [INFO ] [Real]Absence check using 201 positive place invariants in 124 ms returned sat
[2020-06-05 06:59:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:59:16] [INFO ] [Real]Absence check using state equation in 441 ms returned sat
[2020-06-05 06:59:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:59:16] [INFO ] [Nat]Absence check using 201 positive place invariants in 75 ms returned sat
[2020-06-05 06:59:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:59:16] [INFO ] [Nat]Absence check using state equation in 394 ms returned sat
[2020-06-05 06:59:16] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 20 ms.
[2020-06-05 06:59:20] [INFO ] Added : 400 causal constraints over 81 iterations in 3640 ms. Result :sat
[2020-06-05 06:59:20] [INFO ] [Real]Absence check using 201 positive place invariants in 84 ms returned sat
[2020-06-05 06:59:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:59:21] [INFO ] [Real]Absence check using state equation in 446 ms returned sat
[2020-06-05 06:59:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:59:21] [INFO ] [Nat]Absence check using 201 positive place invariants in 77 ms returned sat
[2020-06-05 06:59:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:59:21] [INFO ] [Nat]Absence check using state equation in 383 ms returned sat
[2020-06-05 06:59:21] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 26 ms.
[2020-06-05 06:59:25] [INFO ] Added : 394 causal constraints over 80 iterations in 3401 ms. Result :sat
[2020-06-05 06:59:25] [INFO ] [Real]Absence check using 201 positive place invariants in 125 ms returned sat
[2020-06-05 06:59:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:59:25] [INFO ] [Real]Absence check using state equation in 547 ms returned sat
[2020-06-05 06:59:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:59:25] [INFO ] [Nat]Absence check using 201 positive place invariants in 86 ms returned sat
[2020-06-05 06:59:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:59:26] [INFO ] [Nat]Absence check using state equation in 436 ms returned sat
[2020-06-05 06:59:26] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 20 ms.
[2020-06-05 06:59:29] [INFO ] Added : 395 causal constraints over 80 iterations in 3464 ms. Result :sat
[2020-06-05 06:59:30] [INFO ] [Real]Absence check using 201 positive place invariants in 79 ms returned sat
[2020-06-05 06:59:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:59:30] [INFO ] [Real]Absence check using state equation in 473 ms returned sat
[2020-06-05 06:59:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:59:30] [INFO ] [Nat]Absence check using 201 positive place invariants in 14 ms returned unsat
[2020-06-05 06:59:30] [INFO ] [Real]Absence check using 201 positive place invariants in 75 ms returned sat
[2020-06-05 06:59:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:59:31] [INFO ] [Real]Absence check using state equation in 455 ms returned sat
[2020-06-05 06:59:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:59:31] [INFO ] [Nat]Absence check using 201 positive place invariants in 72 ms returned sat
[2020-06-05 06:59:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:59:31] [INFO ] [Nat]Absence check using state equation in 331 ms returned sat
[2020-06-05 06:59:31] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 19 ms.
[2020-06-05 06:59:35] [INFO ] Added : 397 causal constraints over 80 iterations in 4016 ms. Result :sat
[2020-06-05 06:59:36] [INFO ] [Real]Absence check using 201 positive place invariants in 108 ms returned sat
[2020-06-05 06:59:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:59:36] [INFO ] [Real]Absence check using state equation in 492 ms returned sat
[2020-06-05 06:59:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:59:36] [INFO ] [Nat]Absence check using 201 positive place invariants in 79 ms returned sat
[2020-06-05 06:59:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:59:37] [INFO ] [Nat]Absence check using state equation in 329 ms returned sat
[2020-06-05 06:59:37] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 35 ms.
[2020-06-05 06:59:40] [INFO ] Added : 400 causal constraints over 81 iterations in 3323 ms. Result :sat
[2020-06-05 06:59:40] [INFO ] [Real]Absence check using 201 positive place invariants in 142 ms returned sat
[2020-06-05 06:59:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:59:41] [INFO ] [Real]Absence check using state equation in 463 ms returned sat
[2020-06-05 06:59:41] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:59:41] [INFO ] [Nat]Absence check using 201 positive place invariants in 79 ms returned sat
[2020-06-05 06:59:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:59:41] [INFO ] [Nat]Absence check using state equation in 540 ms returned sat
[2020-06-05 06:59:41] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 35 ms.
[2020-06-05 06:59:44] [INFO ] Added : 397 causal constraints over 80 iterations in 3007 ms. Result :sat
[2020-06-05 06:59:45] [INFO ] [Real]Absence check using 201 positive place invariants in 78 ms returned sat
[2020-06-05 06:59:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:59:45] [INFO ] [Real]Absence check using state equation in 437 ms returned sat
[2020-06-05 06:59:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:59:45] [INFO ] [Nat]Absence check using 201 positive place invariants in 120 ms returned sat
[2020-06-05 06:59:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:59:46] [INFO ] [Nat]Absence check using state equation in 477 ms returned sat
[2020-06-05 06:59:46] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 36 ms.
[2020-06-05 06:59:49] [INFO ] Added : 397 causal constraints over 80 iterations in 3550 ms. Result :sat
[2020-06-05 06:59:49] [INFO ] [Real]Absence check using 201 positive place invariants in 79 ms returned sat
[2020-06-05 06:59:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:59:50] [INFO ] [Real]Absence check using state equation in 436 ms returned sat
[2020-06-05 06:59:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:59:50] [INFO ] [Nat]Absence check using 201 positive place invariants in 16 ms returned unsat
[2020-06-05 06:59:50] [INFO ] [Real]Absence check using 201 positive place invariants in 90 ms returned sat
[2020-06-05 06:59:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:59:50] [INFO ] [Real]Absence check using state equation in 343 ms returned sat
[2020-06-05 06:59:50] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 16 ms.
[2020-06-05 06:59:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:59:51] [INFO ] [Nat]Absence check using 201 positive place invariants in 84 ms returned sat
[2020-06-05 06:59:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:59:51] [INFO ] [Nat]Absence check using state equation in 488 ms returned sat
[2020-06-05 06:59:51] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 49 ms.
[2020-06-05 06:59:54] [INFO ] Added : 397 causal constraints over 80 iterations in 2902 ms. Result :sat
[2020-06-05 06:59:54] [INFO ] [Real]Absence check using 201 positive place invariants in 84 ms returned sat
[2020-06-05 06:59:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:59:55] [INFO ] [Real]Absence check using state equation in 428 ms returned sat
[2020-06-05 06:59:55] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 32 ms.
[2020-06-05 06:59:55] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:59:55] [INFO ] [Nat]Absence check using 201 positive place invariants in 78 ms returned sat
[2020-06-05 06:59:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:59:55] [INFO ] [Nat]Absence check using state equation in 440 ms returned sat
[2020-06-05 06:59:55] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 27 ms.
[2020-06-05 06:59:59] [INFO ] Added : 398 causal constraints over 81 iterations in 3309 ms. Result :sat
[2020-06-05 06:59:59] [INFO ] [Real]Absence check using 201 positive place invariants in 87 ms returned sat
[2020-06-05 06:59:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:59:59] [INFO ] [Real]Absence check using state equation in 482 ms returned sat
[2020-06-05 06:59:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:00:00] [INFO ] [Nat]Absence check using 201 positive place invariants in 76 ms returned sat
[2020-06-05 07:00:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:00:00] [INFO ] [Nat]Absence check using state equation in 467 ms returned sat
[2020-06-05 07:00:00] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 23 ms.
[2020-06-05 07:00:03] [INFO ] Added : 400 causal constraints over 81 iterations in 3391 ms. Result :sat
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2020-06-05 07:00:04] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-06-05 07:00:04] [INFO ] Flatten gal took : 161 ms
FORMULA ShieldRVt-PT-050A-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050A-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050A-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050A-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050A-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050A-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-05 07:00:04] [INFO ] Applying decomposition
[2020-06-05 07:00:04] [INFO ] Flatten gal took : 55 ms
[2020-06-05 07:00:04] [INFO ] Decomposing Gal with order
[2020-06-05 07:00:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-05 07:00:04] [INFO ] Removed a total of 150 redundant transitions.
[2020-06-05 07:00:04] [INFO ] Flatten gal took : 183 ms
[2020-06-05 07:00:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 23 ms.
[2020-06-05 07:00:04] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2020-06-05 07:00:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 10 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ ShieldRVt-PT-050A @ 3570 seconds

FORMULA ShieldRVt-PT-050A-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-050A-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-050A-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-050A-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-050A-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-050A-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-050A-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-050A-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA ShieldRVt-PT-050A-08 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3372
rslt: Output for LTLCardinality @ ShieldRVt-PT-050A

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 6,
"adisj": 3,
"aneg": 0,
"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 ((((p217 <= 0)) OR ((1 <= p338)))) AND (X ((((p379 <= 0)) OR ((1 <= p309)))) OR (((p217 <= 0)) OR ((1 <= p338))))))",
"processed_size": 124,
"rewrites": 58
},
"result":
{
"edges": 314,
"markings": 314,
"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": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 4,
"aconj": 5,
"adisj": 4,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (((X (X ((((1 <= p386)) AND ((p296 <= 0))))) OR (((1 <= p51)) AND ((p401 <= 0)))) U X (G ((((p386 <= 0)) OR ((1 <= p296)))))))",
"processed_size": 129,
"rewrites": 58
},
"result":
{
"edges": 314,
"markings": 314,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"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": 495
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 4,
"aconj": 4,
"adisj": 1,
"aneg": 3,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (X (G ((X (X (G ((((1 <= p253)) AND ((p99 <= 0)))))) AND (((1 <= p4)) AND ((p4 <= 0)))))))",
"processed_size": 92,
"rewrites": 58
},
"result":
{
"edges": 314,
"markings": 314,
"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": 578
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 0,
"U": 0,
"X": 1,
"aconj": 6,
"adisj": 4,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((F ((((1 <= p99)) AND ((p101 <= 0)))) OR X (F (((((p99 <= 0)) OR ((1 <= p101))) AND (((p43 <= 0)) OR ((1 <= p196))))))))",
"processed_size": 125,
"rewrites": 58
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 694
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (F ((((1 <= p268)) OR ((p19 <= 0)) OR ((1 <= p304)))))",
"processed_size": 58,
"rewrites": 58
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 867
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((p24 <= 0)) OR ((1 <= p123)))",
"processed_size": 32,
"rewrites": 60
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 6,
"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": 1156
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((((1 <= p364)) AND ((p81 <= 0)))))",
"processed_size": 40,
"rewrites": 58
},
"result":
{
"edges": 126,
"markings": 94,
"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": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1735
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F (((((1 <= p391)) AND ((p235 <= 0))) OR G (((p191 <= 0))))))",
"processed_size": 64,
"rewrites": 58
},
"result":
{
"edges": 3568,
"markings": 2361,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 8,
"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": 3470
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 2,
"aneg": 0,
"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": "G (F ((G ((((p62 <= 0)) OR ((1 <= p252)))) AND (((p231 <= 0)) OR ((1 <= p30))))))",
"processed_size": 83,
"rewrites": 58
},
"result":
{
"edges": 2214,
"markings": 1820,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 9,
"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": 3632,
"runtime": 197.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(F((* OR G(*)))) : G((F(**) AND (X(**) OR **))) : G(F((G(**) AND **))) : X(((X(X(*)) OR **) U X(G(**)))) : F(**) : X(G(**)) : X(X(G((X(X(G(*))) AND (* AND *))))) : F((F(**) OR X(F(**)))) : F(G(*)) : X(F(**))"
},
"net":
{
"arcs": 1704,
"conflict_clusters": 103,
"places": 403,
"places_significant": 202,
"singleton_clusters": 0,
"transitions": 402
},
"result":
{
"preliminary_value": "no no no no yes unknown no yes no yes ",
"value": "no no no no yes unknown no yes no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 805/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 12896
lola: finding significant places
lola: 403 places, 402 transitions, 202 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: (p235 <= 1)
lola: LP says that atomic proposition is always true: (p191 <= 1)
lola: LP says that atomic proposition is always true: (p309 <= 1)
lola: LP says that atomic proposition is always true: (p338 <= 1)
lola: LP says that atomic proposition is always true: (p252 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p296 <= 1)
lola: LP says that atomic proposition is always true: (p401 <= 1)
lola: LP says that atomic proposition is always true: (p296 <= 1)
lola: LP says that atomic proposition is always true: (p123 <= 1)
lola: LP says that atomic proposition is always true: (p150 <= 1)
lola: LP says that atomic proposition is always true: (p179 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p101 <= 1)
lola: LP says that atomic proposition is always true: (p101 <= 1)
lola: LP says that atomic proposition is always true: (p196 <= 1)
lola: LP says that atomic proposition is always true: (p81 <= 1)
lola: LP says that atomic proposition is always true: (p268 <= 1)
lola: LP says that atomic proposition is always true: (p304 <= 1)
lola: F (G ((NOT(G ((((p391 <= 0)) OR ((1 <= p235))))) OR NOT(G (F (((1 <= p191)))))))) : NOT(F (NOT((X ((((p379 <= 0)) OR ((1 <= p309)))) U (((p217 <= 0)) OR ((1 <= p338))))))) : G (((0 <= 0) U (G ((((p62 <= 0)) OR ((1 <= p252)))) AND (((p231 <= 0)) OR ((1 <= p30)))))) : X (((X (NOT(X ((((p386 <= 0)) OR ((1 <= p296)))))) OR (((1 <= p51)) AND ((p401 <= 0)))) U NOT(F (NOT(X ((((p386 <= 0)) OR ((1 <= p296))))))))) : F ((((1 <= p24)) AND ((p123 <= 0)))) : G (X ((((1 <= p150)) OR ((p80 <= 0)) OR ((1 <= p179))))) : NOT(F (X (X (((X (F (((0 <= 0) U X ((((p253 <= 0)) OR ((1 <= p99))))))) OR ((p4 <= 0))) OR ((1 <= p4))))))) : F ((F (((1 <= 0) U (((1 <= p99)) AND ((p101 <= 0))))) OR F (X (((((p99 <= 0)) OR ((1 <= p101))) AND (((p43 <= 0)) OR ((1 <= p196)))))))) : G (F (NOT(G (F (((1 <= 0) U (((p364 <= 0)) OR ((1 <= p81))))))))) : X (F ((((1 <= p268)) OR ((p19 <= 0)) OR ((1 <= p304)))))
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:519
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k: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: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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
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:347
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((((p217 <= 0)) OR ((1 <= p338)))) AND (X ((((p379 <= 0)) OR ((1 <= p309)))) OR (((p217 <= 0)) OR ((1 <= p338))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((((p217 <= 0)) OR ((1 <= p338)))) AND (X ((((p379 <= 0)) OR ((1 <= p309)))) OR (((p217 <= 0)) OR ((1 <= p338))))))
lola: processed formula length: 124
lola: 58 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 314 markings, 314 edges
lola: ========================================
lola: subprocess 1 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((X (X ((((1 <= p386)) AND ((p296 <= 0))))) OR (((1 <= p51)) AND ((p401 <= 0)))) U X (G ((((p386 <= 0)) OR ((1 <= p296)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((X (X ((((1 <= p386)) AND ((p296 <= 0))))) OR (((1 <= p51)) AND ((p401 <= 0)))) U X (G ((((p386 <= 0)) OR ((1 <= p296)))))))
lola: processed formula length: 129
lola: 58 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: 314 markings, 314 edges
lola: ========================================
lola: subprocess 2 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((((1 <= p150)) OR ((p80 <= 0)) OR ((1 <= p179)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((1 <= p150)) OR ((p80 <= 0)) OR ((1 <= p179)))))
lola: processed formula length: 58
lola: 58 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: 1602032 markings, 1761076 edges, 320406 markings/sec, 0 secs
lola: 3361682 markings, 3695444 edges, 351930 markings/sec, 5 secs
lola: 4982901 markings, 5477635 edges, 324244 markings/sec, 10 secs
lola: 6711551 markings, 7377924 edges, 345730 markings/sec, 15 secs
lola: 8429097 markings, 9266008 edges, 343509 markings/sec, 20 secs
lola: 10152608 markings, 11160647 edges, 344702 markings/sec, 25 secs
lola: 11871225 markings, 13049905 edges, 343723 markings/sec, 30 secs
lola: 13586308 markings, 14935283 edges, 343017 markings/sec, 35 secs
lola: 15291241 markings, 16809503 edges, 340987 markings/sec, 40 secs
lola: 17009150 markings, 18697981 edges, 343582 markings/sec, 45 secs
lola: 18724125 markings, 20583237 edges, 342995 markings/sec, 50 secs
lola: 19777578 markings, 21741588 edges, 210691 markings/sec, 55 secs
lola: 20451531 markings, 22484752 edges, 134791 markings/sec, 60 secs
lola: 21205193 markings, 23310699 edges, 150732 markings/sec, 65 secs
lola: 21907514 markings, 24082705 edges, 140464 markings/sec, 70 secs
lola: 22551801 markings, 24791160 edges, 128857 markings/sec, 75 secs
lola: 23216305 markings, 25521450 edges, 132901 markings/sec, 80 secs
lola: 23899600 markings, 26272590 edges, 136659 markings/sec, 85 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 495 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((X (X (G ((((1 <= p253)) AND ((p99 <= 0)))))) AND (((1 <= p4)) AND ((p4 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((X (X (G ((((1 <= p253)) AND ((p99 <= 0)))))) AND (((1 <= p4)) AND ((p4 <= 0)))))))
lola: processed formula length: 92
lola: 58 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: 314 markings, 314 edges
lola: ========================================
lola: subprocess 4 will run for 578 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F ((((1 <= p99)) AND ((p101 <= 0)))) OR X (F (((((p99 <= 0)) OR ((1 <= p101))) AND (((p43 <= 0)) OR ((1 <= p196))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F ((((1 <= p99)) AND ((p101 <= 0)))) OR X (F (((((p99 <= 0)) OR ((1 <= p101))) AND (((p43 <= 0)) OR ((1 <= p196))))))))
lola: processed formula length: 125
lola: 58 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 5 will run for 694 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((((1 <= p268)) OR ((p19 <= 0)) OR ((1 <= p304)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((((1 <= p268)) OR ((p19 <= 0)) OR ((1 <= p304)))))
lola: processed formula length: 58
lola: 58 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 6 will run for 867 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((1 <= p24)) AND ((p123 <= 0))))
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: (((p24 <= 0)) OR ((1 <= p123)))
lola: processed formula length: 32
lola: 60 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 1156 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((1 <= p364)) AND ((p81 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((((1 <= p364)) AND ((p81 <= 0)))))
lola: processed formula length: 40
lola: 58 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: 94 markings, 126 edges
lola: ========================================
lola: subprocess 8 will run for 1735 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((((1 <= p391)) AND ((p235 <= 0))) OR G (((p191 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((((1 <= p391)) AND ((p235 <= 0))) OR G (((p191 <= 0))))))
lola: processed formula length: 64
lola: 58 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 2361 markings, 3568 edges
lola: ========================================
lola: subprocess 9 will run for 3470 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((((p62 <= 0)) OR ((1 <= p252)))) AND (((p231 <= 0)) OR ((1 <= p30))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((((p62 <= 0)) OR ((1 <= p252)))) AND (((p231 <= 0)) OR ((1 <= p30))))))
lola: processed formula length: 83
lola: 58 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: 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: 1820 markings, 2214 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (G ((((1 <= p150)) OR ((p80 <= 0)) OR ((1 <= p179)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((1 <= p150)) OR ((p80 <= 0)) OR ((1 <= p179)))))
lola: processed formula length: 58
lola: 58 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: 1463014 markings, 1608263 edges, 292603 markings/sec, 0 secs
lola: 2990932 markings, 3287882 edges, 305584 markings/sec, 5 secs
lola: 4593751 markings, 5049846 edges, 320564 markings/sec, 10 secs
lola: 6348752 markings, 6979104 edges, 351000 markings/sec, 15 secs
lola: 8065534 markings, 8866344 edges, 343356 markings/sec, 20 secs
lola: 9822335 markings, 10797582 edges, 351360 markings/sec, 25 secs
lola: 11578055 markings, 12727624 edges, 351144 markings/sec, 30 secs
lola: 13327235 markings, 14650485 edges, 349836 markings/sec, 35 secs
lola: 15080138 markings, 16577437 edges, 350581 markings/sec, 40 secs
lola: 16819903 markings, 18489945 edges, 347953 markings/sec, 45 secs
lola: 18575056 markings, 20419367 edges, 351031 markings/sec, 50 secs
lola: 19801444 markings, 21767611 edges, 245278 markings/sec, 55 secs
lola: 20554272 markings, 22595198 edges, 150566 markings/sec, 60 secs
lola: 21151509 markings, 23251857 edges, 119447 markings/sec, 65 secs
lola: 21918179 markings, 24094433 edges, 153334 markings/sec, 70 secs
lola: 22585269 markings, 24827756 edges, 133418 markings/sec, 75 secs
lola: 23410992 markings, 25735471 edges, 165145 markings/sec, 80 secs
lola: 24186989 markings, 26588513 edges, 155199 markings/sec, 85 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no no no yes unknown no yes no yes
lola:
preliminary result: no no no no yes unknown no yes no yes
lola: memory consumption: 3632 KB
lola: time consumption: 197 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-050A"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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 itslola"
echo " Input is ShieldRVt-PT-050A, 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 r211-tajo-159033478401065"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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