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-159033477300361.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 ShieldIIPt-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-159033477300361
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 3.0K May 14 01:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 14 01:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 18:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 18:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 14 10:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 10:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 14 10:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.8K May 13 13:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 13 13:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 08:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 13 08:24 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 265K 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 ShieldIIPt-PT-050A-00
FORMULA_NAME ShieldIIPt-PT-050A-01
FORMULA_NAME ShieldIIPt-PT-050A-02
FORMULA_NAME ShieldIIPt-PT-050A-03
FORMULA_NAME ShieldIIPt-PT-050A-04
FORMULA_NAME ShieldIIPt-PT-050A-05
FORMULA_NAME ShieldIIPt-PT-050A-06
FORMULA_NAME ShieldIIPt-PT-050A-07
FORMULA_NAME ShieldIIPt-PT-050A-08
FORMULA_NAME ShieldIIPt-PT-050A-09
FORMULA_NAME ShieldIIPt-PT-050A-10
FORMULA_NAME ShieldIIPt-PT-050A-11
FORMULA_NAME ShieldIIPt-PT-050A-12
FORMULA_NAME ShieldIIPt-PT-050A-13
FORMULA_NAME ShieldIIPt-PT-050A-14
FORMULA_NAME ShieldIIPt-PT-050A-15

=== Now, execution of the tool begins

BK_START 1591301516250

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 20:11:58] [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-04 20:11:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 20:11:58] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2020-06-04 20:11:58] [INFO ] Transformed 953 places.
[2020-06-04 20:11:58] [INFO ] Transformed 703 transitions.
[2020-06-04 20:11:58] [INFO ] Found NUPN structural information;
[2020-06-04 20:11:58] [INFO ] Parsed PT model containing 953 places and 703 transitions in 183 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 34 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 703 ms. (steps per millisecond=142 ) properties seen :[0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0]
// Phase 1: matrix 702 rows 953 cols
[2020-06-04 20:11:59] [INFO ] Computed 451 place invariants in 24 ms
[2020-06-04 20:11:59] [INFO ] [Real]Absence check using 451 positive place invariants in 303 ms returned sat
[2020-06-04 20:11:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:12:01] [INFO ] [Real]Absence check using state equation in 1774 ms returned sat
[2020-06-04 20:12:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:12:02] [INFO ] [Nat]Absence check using 451 positive place invariants in 257 ms returned sat
[2020-06-04 20:12:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:12:03] [INFO ] [Nat]Absence check using state equation in 1718 ms returned sat
[2020-06-04 20:12:03] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints in 42 ms.
[2020-06-04 20:12:18] [INFO ] Added : 698 causal constraints over 141 iterations in 14685 ms. Result :sat
[2020-06-04 20:12:19] [INFO ] [Real]Absence check using 451 positive place invariants in 285 ms returned sat
[2020-06-04 20:12:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:12:20] [INFO ] [Real]Absence check using state equation in 1544 ms returned sat
[2020-06-04 20:12:20] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints in 58 ms.
[2020-06-04 20:12:20] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:12:21] [INFO ] [Nat]Absence check using 451 positive place invariants in 293 ms returned sat
[2020-06-04 20:12:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:12:22] [INFO ] [Nat]Absence check using state equation in 1601 ms returned sat
[2020-06-04 20:12:22] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints in 68 ms.
[2020-06-04 20:12:38] [INFO ] Added : 697 causal constraints over 141 iterations in 15627 ms. Result :sat
[2020-06-04 20:12:38] [INFO ] [Real]Absence check using 451 positive place invariants in 280 ms returned sat
[2020-06-04 20:12:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:12:40] [INFO ] [Real]Absence check using state equation in 1807 ms returned sat
[2020-06-04 20:12:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:12:41] [INFO ] [Nat]Absence check using 451 positive place invariants in 273 ms returned sat
[2020-06-04 20:12:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:12:43] [INFO ] [Nat]Absence check using state equation in 1742 ms returned sat
[2020-06-04 20:12:43] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints in 67 ms.
[2020-06-04 20:12:57] [INFO ] Added : 692 causal constraints over 141 iterations in 14498 ms. Result :sat
[2020-06-04 20:12:58] [INFO ] [Real]Absence check using 451 positive place invariants in 316 ms returned sat
[2020-06-04 20:12:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:12:59] [INFO ] [Real]Absence check using state equation in 1597 ms returned sat
[2020-06-04 20:12:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:13:00] [INFO ] [Nat]Absence check using 451 positive place invariants in 282 ms returned sat
[2020-06-04 20:13:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:13:01] [INFO ] [Nat]Absence check using state equation in 1605 ms returned sat
[2020-06-04 20:13:01] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints in 57 ms.
[2020-06-04 20:13:15] [INFO ] Added : 697 causal constraints over 142 iterations in 14088 ms. Result :sat
[2020-06-04 20:13:16] [INFO ] [Real]Absence check using 451 positive place invariants in 292 ms returned sat
[2020-06-04 20:13:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:13:18] [INFO ] [Real]Absence check using state equation in 1626 ms returned sat
[2020-06-04 20:13:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:13:18] [INFO ] [Nat]Absence check using 451 positive place invariants in 285 ms returned sat
[2020-06-04 20:13:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:13:20] [INFO ] [Nat]Absence check using state equation in 1514 ms returned sat
[2020-06-04 20:13:20] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints in 39 ms.
[2020-06-04 20:13:35] [INFO ] Added : 693 causal constraints over 140 iterations in 15125 ms. Result :sat
[2020-06-04 20:13:35] [INFO ] [Real]Absence check using 451 positive place invariants in 279 ms returned sat
[2020-06-04 20:13:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:13:37] [INFO ] [Real]Absence check using state equation in 1689 ms returned sat
[2020-06-04 20:13:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:13:38] [INFO ] [Nat]Absence check using 451 positive place invariants in 277 ms returned sat
[2020-06-04 20:13:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:13:39] [INFO ] [Nat]Absence check using state equation in 1549 ms returned sat
[2020-06-04 20:13:39] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints in 61 ms.
[2020-06-04 20:13:57] [INFO ] Added : 701 causal constraints over 144 iterations in 17939 ms. Result :sat
[2020-06-04 20:13:57] [INFO ] [Real]Absence check using 451 positive place invariants in 274 ms returned sat
[2020-06-04 20:13:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:13:59] [INFO ] [Real]Absence check using state equation in 1609 ms returned sat
[2020-06-04 20:13:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:13:59] [INFO ] [Nat]Absence check using 451 positive place invariants in 25 ms returned unsat
[2020-06-04 20:14:00] [INFO ] [Real]Absence check using 451 positive place invariants in 279 ms returned sat
[2020-06-04 20:14:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:14:01] [INFO ] [Real]Absence check using state equation in 1475 ms returned sat
[2020-06-04 20:14:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:14:01] [INFO ] [Nat]Absence check using 451 positive place invariants in 25 ms returned unsat
[2020-06-04 20:14:02] [INFO ] [Real]Absence check using 451 positive place invariants in 288 ms returned sat
[2020-06-04 20:14:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:14:04] [INFO ] [Real]Absence check using state equation in 1641 ms returned sat
[2020-06-04 20:14:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:14:04] [INFO ] [Nat]Absence check using 451 positive place invariants in 26 ms returned unsat
[2020-06-04 20:14:04] [INFO ] [Real]Absence check using 451 positive place invariants in 287 ms returned sat
[2020-06-04 20:14:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:14:06] [INFO ] [Real]Absence check using state equation in 1594 ms returned sat
[2020-06-04 20:14:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:14:06] [INFO ] [Nat]Absence check using 451 positive place invariants in 278 ms returned sat
[2020-06-04 20:14:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:14:08] [INFO ] [Nat]Absence check using state equation in 1610 ms returned sat
[2020-06-04 20:14:08] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints in 63 ms.
[2020-06-04 20:14:22] [INFO ] Added : 687 causal constraints over 138 iterations in 13924 ms. Result :sat
[2020-06-04 20:14:22] [INFO ] [Real]Absence check using 451 positive place invariants in 319 ms returned sat
[2020-06-04 20:14:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:14:24] [INFO ] [Real]Absence check using state equation in 1944 ms returned sat
[2020-06-04 20:14:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:14:25] [INFO ] [Nat]Absence check using 451 positive place invariants in 284 ms returned sat
[2020-06-04 20:14:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:14:27] [INFO ] [Nat]Absence check using state equation in 1831 ms returned sat
[2020-06-04 20:14:27] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints in 69 ms.
[2020-06-04 20:14:41] [INFO ] Added : 687 causal constraints over 138 iterations in 14673 ms. Result :sat
[2020-06-04 20:14:42] [INFO ] [Real]Absence check using 451 positive place invariants in 296 ms returned sat
[2020-06-04 20:14:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:14:44] [INFO ] [Real]Absence check using state equation in 1660 ms returned sat
[2020-06-04 20:14:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:14:44] [INFO ] [Nat]Absence check using 451 positive place invariants in 206 ms returned sat
[2020-06-04 20:14:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:14:46] [INFO ] [Nat]Absence check using state equation in 1510 ms returned sat
[2020-06-04 20:14:46] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints in 63 ms.
[2020-06-04 20:15:00] [INFO ] Added : 692 causal constraints over 140 iterations in 14388 ms. Result :sat
[2020-06-04 20:15:01] [INFO ] [Real]Absence check using 451 positive place invariants in 289 ms returned sat
[2020-06-04 20:15:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:15:02] [INFO ] [Real]Absence check using state equation in 1627 ms returned sat
[2020-06-04 20:15:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:15:03] [INFO ] [Nat]Absence check using 451 positive place invariants in 276 ms returned sat
[2020-06-04 20:15:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:15:04] [INFO ] [Nat]Absence check using state equation in 1628 ms returned sat
[2020-06-04 20:15:04] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints in 39 ms.
[2020-06-04 20:15:21] [INFO ] Added : 697 causal constraints over 141 iterations in 16513 ms. Result :sat
[2020-06-04 20:15:21] [INFO ] [Real]Absence check using 451 positive place invariants in 278 ms returned sat
[2020-06-04 20:15:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:15:23] [INFO ] [Real]Absence check using state equation in 1630 ms returned sat
[2020-06-04 20:15:23] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints in 60 ms.
[2020-06-04 20:15:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:15:24] [INFO ] [Nat]Absence check using 451 positive place invariants in 278 ms returned sat
[2020-06-04 20:15:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:15:25] [INFO ] [Nat]Absence check using state equation in 1590 ms returned sat
[2020-06-04 20:15:25] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints in 62 ms.
[2020-06-04 20:15:40] [INFO ] Added : 693 causal constraints over 142 iterations in 14522 ms. Result :sat
[2020-06-04 20:15:40] [INFO ] [Real]Absence check using 451 positive place invariants in 277 ms returned sat
[2020-06-04 20:15:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:15:42] [INFO ] [Real]Absence check using state equation in 1602 ms returned sat
[2020-06-04 20:15:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:15:42] [INFO ] [Nat]Absence check using 451 positive place invariants in 274 ms returned sat
[2020-06-04 20:15:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:15:44] [INFO ] [Nat]Absence check using state equation in 1497 ms returned sat
[2020-06-04 20:15:44] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints in 56 ms.
[2020-06-04 20:15:55] [INFO ] Added : 677 causal constraints over 137 iterations in 11185 ms. Result :sat
[2020-06-04 20:15:56] [INFO ] [Real]Absence check using 451 positive place invariants in 288 ms returned sat
[2020-06-04 20:15:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:15:57] [INFO ] [Real]Absence check using state equation in 1552 ms returned sat
[2020-06-04 20:15:57] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints in 58 ms.
[2020-06-04 20:15:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:15:58] [INFO ] [Nat]Absence check using 451 positive place invariants in 220 ms returned sat
[2020-06-04 20:15:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:15:59] [INFO ] [Nat]Absence check using state equation in 1502 ms returned sat
[2020-06-04 20:15:59] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints in 57 ms.
[2020-06-04 20:16:10] [INFO ] Added : 686 causal constraints over 138 iterations in 10977 ms. Result :sat
[2020-06-04 20:16:11] [INFO ] [Real]Absence check using 451 positive place invariants in 291 ms returned sat
[2020-06-04 20:16:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:16:12] [INFO ] [Real]Absence check using state equation in 1559 ms returned sat
[2020-06-04 20:16:12] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints in 52 ms.
[2020-06-04 20:16:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:16:13] [INFO ] [Nat]Absence check using 451 positive place invariants in 278 ms returned sat
[2020-06-04 20:16:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:16:15] [INFO ] [Nat]Absence check using state equation in 1564 ms returned sat
[2020-06-04 20:16:15] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints in 44 ms.
[2020-06-04 20:16:32] [INFO ] Added : 691 causal constraints over 141 iterations in 17542 ms. Result :sat
[2020-06-04 20:16:33] [INFO ] [Real]Absence check using 451 positive place invariants in 272 ms returned sat
[2020-06-04 20:16:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:16:34] [INFO ] [Real]Absence check using state equation in 1506 ms returned sat
[2020-06-04 20:16:34] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints in 49 ms.
[2020-06-04 20:16:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:16:35] [INFO ] [Nat]Absence check using 451 positive place invariants in 275 ms returned sat
[2020-06-04 20:16:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:16:36] [INFO ] [Nat]Absence check using state equation in 1626 ms returned sat
[2020-06-04 20:16:36] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints in 40 ms.
[2020-06-04 20:16:50] [INFO ] Added : 686 causal constraints over 138 iterations in 13171 ms. Result :sat
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2020-06-04 20:16:50] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-04 20:16:50] [INFO ] Flatten gal took : 239 ms
FORMULA ShieldIIPt-PT-050A-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-050A-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-050A-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-050A-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 20:16:50] [INFO ] Applying decomposition
[2020-06-04 20:16:50] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-04 20:16:50] [INFO ] Flatten gal took : 88 ms
[2020-06-04 20:16:50] [INFO ] Decomposing Gal with order
[2020-06-04 20:16:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-04 20:16:51] [INFO ] Removed a total of 200 redundant transitions.
[2020-06-04 20:16:51] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-04 20:16:51] [INFO ] Flatten gal took : 120 ms
[2020-06-04 20:16:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 35 ms.
[2020-06-04 20:16:51] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ShieldIIPt-PT-050A-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 20:16:51] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2020-06-04 20:16:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 16 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ ShieldIIPt-PT-050A @ 3570 seconds

FORMULA ShieldIIPt-PT-050A-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA ShieldIIPt-PT-050A-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA ShieldIIPt-PT-050A-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-050A-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-050A-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-050A-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-050A-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA ShieldIIPt-PT-050A-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3557
rslt: Output for LTLCardinality @ ShieldIIPt-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": "Thu Jun 4 20:16:51 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 323
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 5,
"aconj": 10,
"adisj": 3,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 2,
"tdisj": 4,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X ((X (X ((((p187 <= 0)) OR ((1 <= p456))))) AND (X (G ((X ((((p516 <= 0)) OR ((1 <= p290)))) AND (((p516 <= 0)) OR ((1 <= p290)))))) OR (((p187 <= 0)) OR (((1 <= p456)) OR (((p848 <= 0)) OR ((1 <= p878))))))))",
"processed_size": 213,
"rewrites": 81
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 8
},
"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": 355
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 7,
"adisj": 3,
"aneg": 4,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (((((1 <= p846)) AND ((p855 <= 0))) R F ((G ((((1 <= p784)) AND ((p77 <= 0)))) OR (((p739 <= 0)) AND (((1 <= p784)) AND ((p77 <= 0))))))))",
"processed_size": 140,
"rewrites": 81
},
"result":
{
"edges": 7208,
"markings": 7208,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 395
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 6,
"adisj": 2,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (F ((G ((G ((((p385 <= 0)) OR ((1 <= p928)))) AND (((p385 <= 0)) OR ((1 <= p928))))) OR (((p380 <= 0)) OR ((1 <= p69))))))",
"processed_size": 126,
"rewrites": 81
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"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": 444
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 444
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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": "G ((((1 <= p260)) AND ((p891 <= 0))))",
"processed_size": 37,
"rewrites": 81
},
"result":
{
"edges": 23,
"markings": 23,
"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"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 508
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 2,
"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": 4,
"visible_transitions": 0
},
"processed": "X (X (F ((F ((((1 <= p113)) AND ((p898 <= 0)))) AND (((1 <= p450)) AND ((p456 <= 0)))))))",
"processed_size": 89,
"rewrites": 81
},
"result":
{
"edges": 11173,
"markings": 11173,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 592
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 3,
"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 (X (X (F ((((p714 <= 0)) OR ((1 <= p593)))))))",
"processed_size": 49,
"rewrites": 81
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"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": 711
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 2,
"U": 0,
"X": 2,
"aconj": 5,
"adisj": 4,
"aneg": 3,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (G ((F ((((p435 <= 0)) OR ((1 <= p331)))) AND G ((X (F ((((1 <= p435)) AND ((p331 <= 0))))) OR F ((((1 <= p122)) AND ((p456 <= 0)))))))))",
"processed_size": 140,
"rewrites": 81
},
"result":
{
"edges": 12807,
"markings": 12807,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 889
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 3,
"aconj": 8,
"adisj": 4,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((X (F ((((p105 <= 0)) OR ((1 <= p585))))) OR G ((F ((((p887 <= 0)) OR ((1 <= p128)))) AND (X (G ((((p105 <= 0)) OR ((1 <= p585))))) OR (((p887 <= 0)) OR ((1 <= p128))))))))",
"processed_size": 179,
"rewrites": 81
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1185
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((p596 <= 0))",
"processed_size": 13,
"rewrites": 83
},
"result":
{
"edges": 23,
"markings": 23,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1778
},
"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 <= p755))))",
"processed_size": 21,
"rewrites": 81
},
"result":
{
"edges": 25,
"markings": 24,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"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": 3557
},
"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 ((((p224 <= 0)) OR ((1 <= p662)))))",
"processed_size": 41,
"rewrites": 81
},
"result":
{
"edges": 25,
"markings": 24,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 39812,
"runtime": 13.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X((X(X(**)) AND (X(G((X(**) AND **))) OR (** OR (** OR (** OR **)))))) : X((* R F((G(*) OR (* AND *))))) : X(F((G((G(**) AND **)) OR (** OR **)))) : F(G(**)) : (G(*) OR X(*)) : X(X(F((F(*) AND (* AND *))))) : X(X(X(F(**)))) : F(G(**)) : X(G((F(*) AND G((X(F(*)) OR F(*)))))) : X((X(F(**)) OR G((F(**) AND (X(G(**)) OR **))))) : (F(**) AND X((** U **)))"
},
"net":
{
"arcs": 3004,
"conflict_clusters": 353,
"places": 953,
"places_significant": 502,
"singleton_clusters": 0,
"transitions": 702
},
"result":
{
"preliminary_value": "yes no yes no yes no yes no no yes no ",
"value": "yes no yes no yes no yes no no yes 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: 1655/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 30496
lola: finding significant places
lola: 953 places, 702 transitions, 502 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: (p456 <= 1)
lola: LP says that atomic proposition is always true: (p290 <= 1)
lola: LP says that atomic proposition is always true: (p290 <= 1)
lola: LP says that atomic proposition is always true: (p456 <= 1)
lola: LP says that atomic proposition is always true: (p878 <= 1)
lola: LP says that atomic proposition is always true: (p855 <= 1)
lola: LP says that atomic proposition is always true: (p739 <= 1)
lola: LP says that atomic proposition is always true: (p77 <= 1)
lola: LP says that atomic proposition is always true: (p928 <= 1)
lola: LP says that atomic proposition is always true: (p928 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p755 <= 1)
lola: LP says that atomic proposition is always true: (p891 <= 1)
lola: LP says that atomic proposition is always true: (p144 <= 1)
lola: LP says that atomic proposition is always true: (p898 <= 1)
lola: LP says that atomic proposition is always true: (p456 <= 1)
lola: LP says that atomic proposition is always true: (p593 <= 1)
lola: LP says that atomic proposition is always true: (p662 <= 1)
lola: LP says that atomic proposition is always true: (p331 <= 1)
lola: LP says that atomic proposition is always true: (p331 <= 1)
lola: LP says that atomic proposition is always true: (p456 <= 1)
lola: LP says that atomic proposition is always true: (p429 <= 1)
lola: LP says that atomic proposition is always true: (p585 <= 1)
lola: LP says that atomic proposition is always true: (p585 <= 1)
lola: LP says that atomic proposition is always true: (p128 <= 1)
lola: LP says that atomic proposition is always true: (p197 <= 1)
lola: LP says that atomic proposition is always true: (p596 <= 1)
lola: LP says that atomic proposition is always true: (p596 <= 1)
lola: LP says that atomic proposition is always true: (p197 <= 1)
lola: LP says that atomic proposition is always true: (p197 <= 1)
lola: X ((X (X ((((p187 <= 0)) OR ((1 <= p456))))) AND ((((G (X ((X ((((p516 <= 0)) OR ((1 <= p290)))) AND (((p516 <= 0)) OR ((1 <= p290)))))) OR ((p187 <= 0))) OR ((1 <= p456))) OR ((p848 <= 0))) OR ((1 <= p878))))) : NOT((X ((((p846 <= 0)) OR ((1 <= p855)))) U NOT(X (NOT(G ((((1 <= p739)) U (((p784 <= 0)) OR ((1 <= p77)))))))))) : F (X (((G ((G ((((p385 <= 0)) OR ((1 <= p928)))) AND (((p385 <= 0)) OR ((1 <= p928))))) OR ((p380 <= 0))) OR ((1 <= p69))))) : X (F (G (((1 <= p755))))) : (NOT(F ((((p260 <= 0)) OR ((1 <= p891))))) OR NOT(X ((((p112 <= 0)) OR ((1 <= p144)))))) : X (F (NOT(X (((G ((((p113 <= 0)) OR ((1 <= p898)))) OR ((p450 <= 0))) OR ((1 <= p456))))))) : X (X (X (F ((((p714 <= 0)) OR ((1 <= p593))))))) : X (F (G (X ((((p224 <= 0)) OR ((1 <= p662))))))) : NOT(F ((G (X ((((1 <= p435)) AND ((p331 <= 0))))) OR X (F ((X (G ((((p435 <= 0)) OR ((1 <= p331))))) AND G ((((p122 <= 0)) OR ((1 <= p456)))))))))) : (F (X (F (X (((((p474 <= 0)) OR ((1 <= p429))) U (((p105 <= 0)) OR ((1 <= p585)))))))) OR G (X ((X (G ((((p105 <= 0)) OR ((1 <= p585))))) U (((p887 <= 0)) OR ((1 <= p128))))))) : ((((p197 <= 0)) U F (((1 <= p596)))) AND X (((((1 <= p596)) U ((1 <= p197))) U ((1 <= p197)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
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:297
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:528
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:482
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (X ((((p187 <= 0)) OR ((1 <= p456))))) AND (X (G ((X ((((p516 <= 0)) OR ((1 <= p290)))) AND (((p516 <= 0)) OR ((1 <= p290)))))) OR (((p187 <= 0)) OR (((1 <= p456)) OR (((p848 <= 0)) OR ((1 <= p878))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (X ((((p187 <= 0)) OR ((1 <= p456))))) AND (X (G ((X ((((p516 <= 0)) OR ((1 <= p290)))) AND (((p516 <= 0)) OR ((1 <= p290)))))) OR (((p187 <= 0)) OR (((1 <= p456)) OR (((p848 <= 0)) OR ((1 <= p878))))))))
lola: processed formula length: 213
lola: 81 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 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: 5 markings, 4 edges
lola: ========================================
lola: subprocess 1 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((((1 <= p846)) AND ((p855 <= 0))) R F ((G ((((1 <= p784)) AND ((p77 <= 0)))) OR (((p739 <= 0)) AND (((1 <= p784)) AND ((p77 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((((1 <= p846)) AND ((p855 <= 0))) R F ((G ((((1 <= p784)) AND ((p77 <= 0)))) OR (((p739 <= 0)) AND (((1 <= p784)) AND ((p77 <= 0))))))))
lola: processed formula length: 140
lola: 81 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: 7208 markings, 7208 edges
lola: ========================================
lola: subprocess 2 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((G ((G ((((p385 <= 0)) OR ((1 <= p928)))) AND (((p385 <= 0)) OR ((1 <= p928))))) OR (((p380 <= 0)) OR ((1 <= p69))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G ((G ((((p385 <= 0)) OR ((1 <= p928)))) AND (((p385 <= 0)) OR ((1 <= p928))))) OR (((p380 <= 0)) OR ((1 <= p69))))))
lola: processed formula length: 126
lola: 81 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 3 will run for 444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((((1 <= p260)) AND ((p891 <= 0)))) OR X ((((1 <= p112)) AND ((p144 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((1 <= p260)) AND ((p891 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((1 <= p260)) AND ((p891 <= 0))))
lola: processed formula length: 37
lola: 81 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: 23 markings, 23 edges
lola: ========================================
lola: subprocess 4 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((1 <= p112)) AND ((p144 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((1 <= p112)) AND ((p144 <= 0))))
lola: processed formula length: 37
lola: 81 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((F ((((1 <= p113)) AND ((p898 <= 0)))) AND (((1 <= p450)) AND ((p456 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((F ((((1 <= p113)) AND ((p898 <= 0)))) AND (((1 <= p450)) AND ((p456 <= 0)))))))
lola: processed formula length: 89
lola: 81 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: 11173 markings, 11173 edges
lola: ========================================
lola: subprocess 5 will run for 592 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (F ((((p714 <= 0)) OR ((1 <= p593)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (F ((((p714 <= 0)) OR ((1 <= p593)))))))
lola: processed formula length: 49
lola: 81 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 6 will run for 711 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((F ((((p435 <= 0)) OR ((1 <= p331)))) AND G ((X (F ((((1 <= p435)) AND ((p331 <= 0))))) OR F ((((1 <= p122)) AND ((p456 <= 0)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F ((((p435 <= 0)) OR ((1 <= p331)))) AND G ((X (F ((((1 <= p435)) AND ((p331 <= 0))))) OR F ((((1 <= p122)) AND ((p456 <= 0)))))))))
lola: processed formula length: 140
lola: 81 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 12807 markings, 12807 edges
lola: ========================================
lola: subprocess 7 will run for 889 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (F ((((p105 <= 0)) OR ((1 <= p585))))) OR G ((F ((((p887 <= 0)) OR ((1 <= p128)))) AND (X (G ((((p105 <= 0)) OR ((1 <= p585))))) OR (((p887 <= 0)) OR ((1 <= p128))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (F ((((p105 <= 0)) OR ((1 <= p585))))) OR G ((F ((((p887 <= 0)) OR ((1 <= p128)))) AND (X (G ((((p105 <= 0)) OR ((1 <= p585))))) OR (((p887 <= 0)) OR ((1 <= p128))))))))
lola: processed formula length: 179
lola: 81 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 8 will run for 1185 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p596))) AND X ((((1 <= p596)) U ((1 <= p197)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 1185 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p596)))
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: ((p596 <= 0))
lola: processed formula length: 13
lola: 83 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 23 markings, 23 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 1778 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p755))))
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 <= p755))))
lola: processed formula length: 21
lola: 81 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: 24 markings, 25 edges
lola: ========================================
lola: subprocess 10 will run for 3557 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p224 <= 0)) OR ((1 <= p662)))))
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 ((((p224 <= 0)) OR ((1 <= p662)))))
lola: processed formula length: 41
lola: 81 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: 24 markings, 25 edges
lola: RESULT
lola:
SUMMARY: yes no yes no yes no yes no no yes no
lola:
preliminary result: yes no yes no yes no yes no no yes no
lola: ========================================
lola: memory consumption: 39812 KB
lola: time consumption: 13 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="ShieldIIPt-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 ShieldIIPt-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-159033477300361"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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