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-159033478401081.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-100A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033478401081
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 3.5K May 14 03:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 14 03:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 21:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 21:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 14 10:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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.4K May 13 14:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 13 14:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 10:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 13 10:13 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 273K 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-100A-00
FORMULA_NAME ShieldRVt-PT-100A-01
FORMULA_NAME ShieldRVt-PT-100A-02
FORMULA_NAME ShieldRVt-PT-100A-03
FORMULA_NAME ShieldRVt-PT-100A-04
FORMULA_NAME ShieldRVt-PT-100A-05
FORMULA_NAME ShieldRVt-PT-100A-06
FORMULA_NAME ShieldRVt-PT-100A-07
FORMULA_NAME ShieldRVt-PT-100A-08
FORMULA_NAME ShieldRVt-PT-100A-09
FORMULA_NAME ShieldRVt-PT-100A-10
FORMULA_NAME ShieldRVt-PT-100A-11
FORMULA_NAME ShieldRVt-PT-100A-12
FORMULA_NAME ShieldRVt-PT-100A-13
FORMULA_NAME ShieldRVt-PT-100A-14
FORMULA_NAME ShieldRVt-PT-100A-15

=== Now, execution of the tool begins

BK_START 1591340765444

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 07:06:08] [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 07:06:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 07:06:08] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2020-06-05 07:06:08] [INFO ] Transformed 803 places.
[2020-06-05 07:06:08] [INFO ] Transformed 803 transitions.
[2020-06-05 07:06:08] [INFO ] Found NUPN structural information;
[2020-06-05 07:06:08] [INFO ] Parsed PT model containing 803 places and 803 transitions in 155 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 45 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 831 ms. (steps per millisecond=120 ) properties seen :[1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0]
// Phase 1: matrix 802 rows 803 cols
[2020-06-05 07:06:09] [INFO ] Computed 401 place invariants in 19 ms
[2020-06-05 07:06:09] [INFO ] [Real]Absence check using 401 positive place invariants in 219 ms returned sat
[2020-06-05 07:06:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:06:11] [INFO ] [Real]Absence check using state equation in 1585 ms returned sat
[2020-06-05 07:06:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:06:11] [INFO ] [Nat]Absence check using 401 positive place invariants in 26 ms returned unsat
[2020-06-05 07:06:12] [INFO ] [Real]Absence check using 401 positive place invariants in 230 ms returned sat
[2020-06-05 07:06:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:06:13] [INFO ] [Real]Absence check using state equation in 1454 ms returned sat
[2020-06-05 07:06:13] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 75 ms.
[2020-06-05 07:06:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:06:14] [INFO ] [Nat]Absence check using 401 positive place invariants in 222 ms returned sat
[2020-06-05 07:06:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:06:15] [INFO ] [Nat]Absence check using state equation in 1556 ms returned sat
[2020-06-05 07:06:15] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 67 ms.
[2020-06-05 07:06:33] [INFO ] Added : 770 causal constraints over 154 iterations in 18004 ms. Result :unknown
[2020-06-05 07:06:34] [INFO ] [Real]Absence check using 401 positive place invariants in 259 ms returned sat
[2020-06-05 07:06:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:06:35] [INFO ] [Real]Absence check using state equation in 1408 ms returned sat
[2020-06-05 07:06:35] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 45 ms.
[2020-06-05 07:06:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:06:36] [INFO ] [Nat]Absence check using 401 positive place invariants in 164 ms returned sat
[2020-06-05 07:06:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:06:37] [INFO ] [Nat]Absence check using state equation in 1240 ms returned sat
[2020-06-05 07:06:37] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 50 ms.
[2020-06-05 07:06:55] [INFO ] Added : 787 causal constraints over 158 iterations in 18491 ms. Result :unknown
[2020-06-05 07:06:56] [INFO ] [Real]Absence check using 401 positive place invariants in 169 ms returned sat
[2020-06-05 07:06:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:06:57] [INFO ] [Real]Absence check using state equation in 1628 ms returned sat
[2020-06-05 07:06:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:06:58] [INFO ] [Nat]Absence check using 401 positive place invariants in 221 ms returned sat
[2020-06-05 07:06:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:06:59] [INFO ] [Nat]Absence check using state equation in 1339 ms returned sat
[2020-06-05 07:06:59] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 60 ms.
[2020-06-05 07:07:17] [INFO ] Added : 790 causal constraints over 158 iterations in 18284 ms. Result :unknown
[2020-06-05 07:07:18] [INFO ] [Real]Absence check using 401 positive place invariants in 241 ms returned sat
[2020-06-05 07:07:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:07:19] [INFO ] [Real]Absence check using state equation in 1449 ms returned sat
[2020-06-05 07:07:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:07:20] [INFO ] [Nat]Absence check using 401 positive place invariants in 224 ms returned sat
[2020-06-05 07:07:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:07:21] [INFO ] [Nat]Absence check using state equation in 1508 ms returned sat
[2020-06-05 07:07:21] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 56 ms.
[2020-06-05 07:07:38] [INFO ] Added : 796 causal constraints over 160 iterations in 17006 ms. Result :sat
[2020-06-05 07:07:39] [INFO ] [Real]Absence check using 401 positive place invariants in 240 ms returned sat
[2020-06-05 07:07:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:07:40] [INFO ] [Real]Absence check using state equation in 1450 ms returned sat
[2020-06-05 07:07:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:07:41] [INFO ] [Nat]Absence check using 401 positive place invariants in 225 ms returned sat
[2020-06-05 07:07:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:07:42] [INFO ] [Nat]Absence check using state equation in 1426 ms returned sat
[2020-06-05 07:07:42] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 65 ms.
[2020-06-05 07:08:00] [INFO ] Added : 795 causal constraints over 159 iterations in 18160 ms. Result :unknown
[2020-06-05 07:08:01] [INFO ] [Real]Absence check using 401 positive place invariants in 247 ms returned sat
[2020-06-05 07:08:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:08:02] [INFO ] [Real]Absence check using state equation in 1459 ms returned sat
[2020-06-05 07:08:02] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 95 ms.
[2020-06-05 07:08:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:08:03] [INFO ] [Nat]Absence check using 401 positive place invariants in 266 ms returned sat
[2020-06-05 07:08:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:08:04] [INFO ] [Nat]Absence check using state equation in 1643 ms returned sat
[2020-06-05 07:08:04] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 43 ms.
[2020-06-05 07:08:22] [INFO ] Added : 760 causal constraints over 152 iterations in 17942 ms. Result :unknown
[2020-06-05 07:08:23] [INFO ] [Real]Absence check using 401 positive place invariants in 242 ms returned sat
[2020-06-05 07:08:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:08:24] [INFO ] [Real]Absence check using state equation in 1477 ms returned sat
[2020-06-05 07:08:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:08:25] [INFO ] [Nat]Absence check using 401 positive place invariants in 223 ms returned sat
[2020-06-05 07:08:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:08:26] [INFO ] [Nat]Absence check using state equation in 1465 ms returned sat
[2020-06-05 07:08:26] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 61 ms.
[2020-06-05 07:08:44] [INFO ] Added : 787 causal constraints over 158 iterations in 18128 ms. Result :unknown
[2020-06-05 07:08:45] [INFO ] [Real]Absence check using 401 positive place invariants in 204 ms returned sat
[2020-06-05 07:08:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:08:46] [INFO ] [Real]Absence check using state equation in 1317 ms returned sat
[2020-06-05 07:08:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:08:46] [INFO ] [Nat]Absence check using 401 positive place invariants in 222 ms returned sat
[2020-06-05 07:08:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:08:48] [INFO ] [Nat]Absence check using state equation in 1385 ms returned sat
[2020-06-05 07:08:48] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 62 ms.
[2020-06-05 07:09:06] [INFO ] Added : 793 causal constraints over 159 iterations in 18212 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-05 07:09:06] [INFO ] [Real]Absence check using 401 positive place invariants in 230 ms returned sat
[2020-06-05 07:09:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:09:08] [INFO ] [Real]Absence check using state equation in 1365 ms returned sat
[2020-06-05 07:09:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:09:08] [INFO ] [Nat]Absence check using 401 positive place invariants in 23 ms returned unsat
[2020-06-05 07:09:08] [INFO ] [Real]Absence check using 401 positive place invariants in 230 ms returned sat
[2020-06-05 07:09:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:09:10] [INFO ] [Real]Absence check using state equation in 1541 ms returned sat
[2020-06-05 07:09:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:09:10] [INFO ] [Nat]Absence check using 401 positive place invariants in 224 ms returned sat
[2020-06-05 07:09:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:09:12] [INFO ] [Nat]Absence check using state equation in 1352 ms returned sat
[2020-06-05 07:09:12] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 56 ms.
[2020-06-05 07:09:30] [INFO ] Added : 791 causal constraints over 159 iterations in 18241 ms. Result :unknown
[2020-06-05 07:09:30] [INFO ] [Real]Absence check using 401 positive place invariants in 226 ms returned sat
[2020-06-05 07:09:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:09:32] [INFO ] [Real]Absence check using state equation in 1295 ms returned sat
[2020-06-05 07:09:32] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 55 ms.
[2020-06-05 07:09:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:09:32] [INFO ] [Nat]Absence check using 401 positive place invariants in 252 ms returned sat
[2020-06-05 07:09:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:09:33] [INFO ] [Nat]Absence check using state equation in 1204 ms returned sat
[2020-06-05 07:09:34] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 62 ms.
[2020-06-05 07:09:51] [INFO ] Added : 798 causal constraints over 161 iterations in 17595 ms. Result :sat
[2020-06-05 07:09:52] [INFO ] [Real]Absence check using 401 positive place invariants in 259 ms returned sat
[2020-06-05 07:09:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:09:53] [INFO ] [Real]Absence check using state equation in 1463 ms returned sat
[2020-06-05 07:09:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:09:53] [INFO ] [Nat]Absence check using 401 positive place invariants in 218 ms returned sat
[2020-06-05 07:09:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:09:55] [INFO ] [Nat]Absence check using state equation in 1361 ms returned sat
[2020-06-05 07:09:55] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 65 ms.
[2020-06-05 07:10:13] [INFO ] Added : 785 causal constraints over 157 iterations in 18237 ms. Result :unknown
[2020-06-05 07:10:13] [INFO ] [Real]Absence check using 401 positive place invariants in 171 ms returned sat
[2020-06-05 07:10:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:10:15] [INFO ] [Real]Absence check using state equation in 1315 ms returned sat
[2020-06-05 07:10:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:10:15] [INFO ] [Nat]Absence check using 401 positive place invariants in 162 ms returned sat
[2020-06-05 07:10:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:10:16] [INFO ] [Nat]Absence check using state equation in 1218 ms returned sat
[2020-06-05 07:10:16] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 65 ms.
[2020-06-05 07:10:35] [INFO ] Added : 793 causal constraints over 159 iterations in 18479 ms. Result :unknown
[2020-06-05 07:10:35] [INFO ] [Real]Absence check using 401 positive place invariants in 259 ms returned sat
[2020-06-05 07:10:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:10:37] [INFO ] [Real]Absence check using state equation in 1465 ms returned sat
[2020-06-05 07:10:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:10:37] [INFO ] [Nat]Absence check using 401 positive place invariants in 224 ms returned sat
[2020-06-05 07:10:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:10:38] [INFO ] [Nat]Absence check using state equation in 1301 ms returned sat
[2020-06-05 07:10:38] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 64 ms.
[2020-06-05 07:10:56] [INFO ] Added : 793 causal constraints over 160 iterations in 17584 ms. Result :sat
[2020-06-05 07:10:56] [INFO ] [Real]Absence check using 401 positive place invariants in 225 ms returned sat
[2020-06-05 07:10:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:10:58] [INFO ] [Real]Absence check using state equation in 1460 ms returned sat
[2020-06-05 07:10:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:10:58] [INFO ] [Nat]Absence check using 401 positive place invariants in 216 ms returned sat
[2020-06-05 07:10:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:11:00] [INFO ] [Nat]Absence check using state equation in 1382 ms returned sat
[2020-06-05 07:11:00] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 46 ms.
[2020-06-05 07:11:15] [INFO ] Added : 792 causal constraints over 159 iterations in 15307 ms. Result :sat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-06-05 07:11:15] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-06-05 07:11:15] [INFO ] Flatten gal took : 222 ms
FORMULA ShieldRVt-PT-100A-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100A-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100A-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100A-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100A-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100A-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100A-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-05 07:11:15] [INFO ] Applying decomposition
[2020-06-05 07:11:16] [INFO ] Flatten gal took : 86 ms
[2020-06-05 07:11:16] [INFO ] Decomposing Gal with order
[2020-06-05 07:11:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-05 07:11:16] [INFO ] Removed a total of 300 redundant transitions.
[2020-06-05 07:11:16] [INFO ] Flatten gal took : 112 ms
[2020-06-05 07:11:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 41 ms.
[2020-06-05 07:11:16] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2020-06-05 07:11:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 11 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ ShieldRVt-PT-100A @ 3570 seconds

FORMULA ShieldRVt-PT-100A-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-100A-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

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

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

FORMULA ShieldRVt-PT-100A-07 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

{
"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:11:16 2020
",
"timelimit": 3570
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"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": "X (F (((p3 <= 0))))",
"processed_size": 19,
"rewrites": 41
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 668
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((((p240 <= 0)) OR ((1 <= p571)))))",
"processed_size": 41,
"rewrites": 41
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 835
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"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": "F (G ((((p490 <= 0)) OR ((1 <= p694)))))",
"processed_size": 41,
"rewrites": 41
},
"result":
{
"edges": 6383796,
"markings": 3164371,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1650
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 0,
"aconj": 10,
"adisj": 4,
"aneg": 1,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "((((p629 <= 0)) OR ((1 <= p244)) OR ((p517 <= 0)) OR ((1 <= p227))) U (F ((G ((((p659 <= 0)) OR ((1 <= p281)))) R (((1 <= p517)) AND ((p463 <= 0))))) AND (((p517 <= 0)) OR ((1 <= p227)))))",
"processed_size": 193,
"rewrites": 41
},
"result":
{
"edges": 141,
"markings": 104,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 12
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3301
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((1 <= p18)) AND ((p779 <= 0)))",
"processed_size": 32,
"rewrites": 41
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 2,
"aneg": 1,
"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 ((((1 <= p169)) OR G ((((p18 <= 0)) OR ((1 <= p779))))))",
"processed_size": 59,
"rewrites": 41
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3508,
"runtime": 485.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(G(**) AND X(**)) : G(**) : G(F(**)) : X(F(*)) : (** U (F((G(**) R *)) AND **)) : ((F(G(*)) AND G((** OR G(*)))) OR **) : (X(G(*)) U **) : X(G(*)) : F(G(*))"
},
"net":
{
"arcs": 3404,
"conflict_clusters": 203,
"places": 803,
"places_significant": 402,
"singleton_clusters": 0,
"transitions": 802
},
"result":
{
"preliminary_value": "no no no yes no no unknown unknown no ",
"value": "no no no yes no no unknown unknown 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: 1605/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 25696
lola: finding significant places
lola: 803 places, 802 transitions, 402 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: (p449 <= 1)
lola: LP says that atomic proposition is always true: (p449 <= 1)
lola: LP says that atomic proposition is always true: (p232 <= 1)
lola: LP says that atomic proposition is always true: (p571 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p244 <= 1)
lola: LP says that atomic proposition is always true: (p227 <= 1)
lola: LP says that atomic proposition is always true: (p281 <= 1)
lola: LP says that atomic proposition is always true: (p463 <= 1)
lola: LP says that atomic proposition is always true: (p227 <= 1)
lola: LP says that atomic proposition is always true: (p169 <= 1)
lola: LP says that atomic proposition is always true: (p779 <= 1)
lola: LP says that atomic proposition is always true: (p779 <= 1)
lola: LP says that atomic proposition is always true: (p220 <= 1)
lola: LP says that atomic proposition is always true: (p204 <= 1)
lola: LP says that atomic proposition is always true: (p605 <= 1)
lola: LP says that atomic proposition is always true: (p694 <= 1)
lola: (G ((((p726 <= 0)) OR ((1 <= p449)))) AND X ((((p726 <= 0)) OR ((1 <= p449))))) : (F ((((1 <= 0) U (1 <= 0)) U (1 <= 0))) OR G ((((p152 <= 0)) OR ((1 <= p232))))) : G (F ((((p240 <= 0)) OR ((1 <= p571))))) : F (NOT(G (X (((1 <= p3)))))) : ((((p629 <= 0)) OR ((1 <= p244)) OR ((p517 <= 0)) OR ((1 <= p227))) U (F (NOT((NOT(G ((((p659 <= 0)) OR ((1 <= p281))))) U (((p517 <= 0)) OR ((1 <= p463)))))) AND (((p517 <= 0)) OR ((1 <= p227))))) : (G ((((1 <= p169)) U G (NOT(((1 <= 0) U (((1 <= p18)) AND ((p779 <= 0)))))))) OR (((1 <= p18)) AND ((p779 <= 0)))) : (X (NOT(F ((((p760 <= 0)) OR ((1 <= p220)))))) U (((1 <= p185)) AND ((p204 <= 0)))) : NOT(F (X (F ((((p641 <= 0)) OR ((1 <= p605))))))) : F (NOT(X (X (((0 <= 0) U (((1 <= p490)) AND ((p694 <= 0))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
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:356
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((((p726 <= 0)) OR ((1 <= p449)))) AND X ((((p726 <= 0)) OR ((1 <= p449)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((p726 <= 0)) OR ((1 <= p449))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p726 <= 0)) OR ((1 <= p449))))
lola: processed formula length: 37
lola: 41 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 6 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((p3 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((p3 <= 0))))
lola: processed formula length: 19
lola: 41 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 2 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((((1 <= p760)) AND ((p220 <= 0))))) U (((1 <= p185)) AND ((p204 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (G ((((1 <= p760)) AND ((p220 <= 0))))) U (((1 <= p185)) AND ((p204 <= 0))))
lola: processed formula length: 79
lola: 41 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: 1087865 markings, 1087865 edges, 217573 markings/sec, 0 secs
lola: 2241967 markings, 2241966 edges, 230820 markings/sec, 5 secs
lola: 3392078 markings, 3392078 edges, 230022 markings/sec, 10 secs
lola: 4492167 markings, 4492167 edges, 220018 markings/sec, 15 secs
lola: 5574835 markings, 5574834 edges, 216534 markings/sec, 20 secs
lola: 6679203 markings, 6679203 edges, 220874 markings/sec, 25 secs
lola: 7700094 markings, 7700093 edges, 204178 markings/sec, 30 secs
lola: 8745484 markings, 8745484 edges, 209078 markings/sec, 35 secs
lola: 9873377 markings, 9873376 edges, 225579 markings/sec, 40 secs
lola: 11005282 markings, 11005281 edges, 226381 markings/sec, 45 secs
lola: 12132991 markings, 12132990 edges, 225542 markings/sec, 50 secs
lola: 13248107 markings, 13248107 edges, 223023 markings/sec, 55 secs
lola: 14362727 markings, 14362727 edges, 222924 markings/sec, 60 secs
lola: 15491652 markings, 15491652 edges, 225785 markings/sec, 65 secs
lola: 16285596 markings, 16285885 edges, 158789 markings/sec, 70 secs
lola: 16944905 markings, 16945199 edges, 131862 markings/sec, 75 secs
lola: 17615545 markings, 17615652 edges, 134128 markings/sec, 80 secs
lola: 18177045 markings, 18177309 edges, 112300 markings/sec, 85 secs
lola: 18845866 markings, 18845987 edges, 133764 markings/sec, 90 secs
lola: 19653887 markings, 19654072 edges, 161604 markings/sec, 95 secs
lola: 19842748 markings, 19842747 edges, 37772 markings/sec, 100 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 575 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((((1 <= p641)) AND ((p605 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((1 <= p641)) AND ((p605 <= 0)))))
lola: processed formula length: 41
lola: 41 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: 1083489 markings, 1083488 edges, 216698 markings/sec, 0 secs
lola: 2118157 markings, 2118156 edges, 206934 markings/sec, 5 secs
lola: 3221616 markings, 3221616 edges, 220692 markings/sec, 10 secs
lola: 4195988 markings, 4195988 edges, 194874 markings/sec, 15 secs
lola: 5209544 markings, 5209543 edges, 202711 markings/sec, 20 secs
lola: 6298803 markings, 6298803 edges, 217852 markings/sec, 25 secs
lola: 7332084 markings, 7332084 edges, 206656 markings/sec, 30 secs
lola: 8422226 markings, 8422225 edges, 218028 markings/sec, 35 secs
lola: 9573672 markings, 9573672 edges, 230289 markings/sec, 40 secs
lola: 10717868 markings, 10717867 edges, 228839 markings/sec, 45 secs
lola: 11870764 markings, 11870764 edges, 230579 markings/sec, 50 secs
lola: 13019671 markings, 13019671 edges, 229781 markings/sec, 55 secs
lola: 14159727 markings, 14159727 edges, 228011 markings/sec, 60 secs
lola: 15312253 markings, 15312253 edges, 230505 markings/sec, 65 secs
lola: 16196484 markings, 16196798 edges, 176846 markings/sec, 70 secs
lola: 16845780 markings, 16845873 edges, 129859 markings/sec, 75 secs
lola: 17466953 markings, 17467094 edges, 124235 markings/sec, 80 secs
lola: 18071265 markings, 18071427 edges, 120862 markings/sec, 85 secs
lola: 18722906 markings, 18722906 edges, 130328 markings/sec, 90 secs
lola: 19252657 markings, 19252657 edges, 105950 markings/sec, 95 secs
lola: 19808271 markings, 19808271 edges, 111123 markings/sec, 100 secs
lola: 19824931 markings, 19824931 edges, 3332 markings/sec, 105 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 668 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((p240 <= 0)) OR ((1 <= p571)))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((((p240 <= 0)) OR ((1 <= p571)))))
lola: processed formula length: 41
lola: 41 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 6 edges
lola: ========================================
lola: subprocess 5 will run for 835 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p490 <= 0)) OR ((1 <= p694)))))
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 ((((p490 <= 0)) OR ((1 <= p694)))))
lola: processed formula length: 41
lola: 41 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: 458267 markings, 889903 edges, 91653 markings/sec, 0 secs
lola: 869516 markings, 1718385 edges, 82250 markings/sec, 5 secs
lola: 1305076 markings, 2604251 edges, 87112 markings/sec, 10 secs
lola: 1726139 markings, 3438031 edges, 84213 markings/sec, 15 secs
lola: 2136592 markings, 4270322 edges, 82091 markings/sec, 20 secs
lola: 2516520 markings, 5049288 edges, 75986 markings/sec, 25 secs
lola: 2906072 markings, 5864740 edges, 77910 markings/sec, 30 secs
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: 3164371 markings, 6383796 edges
lola: ========================================
lola: subprocess 6 will run for 1100 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((p152 <= 0)) OR ((1 <= p232))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p152 <= 0)) OR ((1 <= p232))))
lola: processed formula length: 37
lola: 41 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: 296 markings, 416 edges
lola: ========================================
lola: subprocess 7 will run for 1650 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((p629 <= 0)) OR ((1 <= p244)) OR ((p517 <= 0)) OR ((1 <= p227))) U (F ((G ((((p659 <= 0)) OR ((1 <= p281)))) R (((1 <= p517)) AND ((p463 <= 0))))) AND (((p517 <= 0)) OR ((1 <= p227)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((((p629 <= 0)) OR ((1 <= p244)) OR ((p517 <= 0)) OR ((1 <= p227))) U (F ((G ((((p659 <= 0)) OR ((1 <= p281)))) R (((1 <= p517)) AND ((p463 <= 0))))) AND (((p517 <= 0)) OR ((1 <= p227)))))
lola: processed formula length: 193
lola: 41 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 12 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: 104 markings, 141 edges
lola: ========================================
lola: subprocess 8 will run for 3301 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F (G ((((p18 <= 0)) OR ((1 <= p779))))) AND G ((((1 <= p169)) OR G ((((p18 <= 0)) OR ((1 <= p779))))))) OR (((1 <= p18)) AND ((p779 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 3301 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p18)) AND ((p779 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((1 <= p18)) AND ((p779 <= 0)))
lola: processed formula length: 32
lola: 41 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((1 <= p169)) OR G ((((p18 <= 0)) OR ((1 <= p779))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((1 <= p169)) OR G ((((p18 <= 0)) OR ((1 <= p779))))))
lola: processed formula length: 59
lola: 41 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: 6 markings, 6 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (X (G ((((1 <= p760)) AND ((p220 <= 0))))) U (((1 <= p185)) AND ((p204 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (G ((((1 <= p760)) AND ((p220 <= 0))))) U (((1 <= p185)) AND ((p204 <= 0))))
lola: processed formula length: 79
lola: 41 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: 1053488 markings, 1053488 edges, 210698 markings/sec, 0 secs
lola: 2184199 markings, 2184198 edges, 226142 markings/sec, 5 secs
lola: 3302017 markings, 3302016 edges, 223564 markings/sec, 10 secs
lola: 4417026 markings, 4417026 edges, 223002 markings/sec, 15 secs
lola: 5533058 markings, 5533057 edges, 223206 markings/sec, 20 secs
lola: 6663125 markings, 6663125 edges, 226013 markings/sec, 25 secs
lola: 7791672 markings, 7791671 edges, 225709 markings/sec, 30 secs
lola: 8925811 markings, 8925810 edges, 226828 markings/sec, 35 secs
lola: 10057965 markings, 10057964 edges, 226431 markings/sec, 40 secs
lola: 11193292 markings, 11193292 edges, 227065 markings/sec, 45 secs
lola: 12314826 markings, 12314826 edges, 224307 markings/sec, 50 secs
lola: 13431004 markings, 13431003 edges, 223236 markings/sec, 55 secs
lola: 14553526 markings, 14553525 edges, 224504 markings/sec, 60 secs
lola: 15691713 markings, 15691713 edges, 227637 markings/sec, 65 secs
lola: 16482652 markings, 16482836 edges, 158188 markings/sec, 70 secs
lola: 17021155 markings, 17021276 edges, 107701 markings/sec, 75 secs
lola: 17604253 markings, 17604486 edges, 116620 markings/sec, 80 secs
lola: 17970296 markings, 17970296 edges, 73209 markings/sec, 85 secs
lola: 18552641 markings, 18552641 edges, 116469 markings/sec, 90 secs
lola: 19104931 markings, 19104930 edges, 110458 markings/sec, 95 secs
lola: 19606164 markings, 19606164 edges, 100247 markings/sec, 100 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: X (G ((((1 <= p641)) AND ((p605 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((1 <= p641)) AND ((p605 <= 0)))))
lola: processed formula length: 41
lola: 41 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: 993313 markings, 993312 edges, 198663 markings/sec, 0 secs
lola: 2114986 markings, 2114986 edges, 224335 markings/sec, 5 secs
lola: 3221606 markings, 3221606 edges, 221324 markings/sec, 10 secs
lola: 4288065 markings, 4288064 edges, 213292 markings/sec, 15 secs
lola: 5402585 markings, 5402585 edges, 222904 markings/sec, 20 secs
lola: 6524098 markings, 6524098 edges, 224303 markings/sec, 25 secs
lola: 7643525 markings, 7643529 edges, 223885 markings/sec, 30 secs
lola: 8774540 markings, 8774540 edges, 226203 markings/sec, 35 secs
lola: 9896922 markings, 9896922 edges, 224476 markings/sec, 40 secs
lola: 11030245 markings, 11030245 edges, 226665 markings/sec, 45 secs
lola: 12144407 markings, 12144406 edges, 222832 markings/sec, 50 secs
lola: 13256903 markings, 13256903 edges, 222499 markings/sec, 55 secs
lola: 14368181 markings, 14368181 edges, 222256 markings/sec, 60 secs
lola: 15502643 markings, 15502643 edges, 226892 markings/sec, 65 secs
lola: 16456394 markings, 16456629 edges, 190750 markings/sec, 70 secs
lola: 17069221 markings, 17069459 edges, 122565 markings/sec, 75 secs
lola: 17643421 markings, 17643421 edges, 114840 markings/sec, 80 secs
lola: 18334734 markings, 18335043 edges, 138263 markings/sec, 85 secs
lola: 19052413 markings, 19052415 edges, 143536 markings/sec, 90 secs
lola: 19613094 markings, 19613094 edges, 112136 markings/sec, 95 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no no yes no no unknown unknown no
lola:
preliminary result: no no no yes no no unknown unknown no
lola: memory consumption: 3508 KB
lola: time consumption: 485 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-100A"
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-100A, 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-159033478401081"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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