About the Execution of ITS-Tools for ShieldRVt-PT-050A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 851.168 | 204528.00 | 240802.00 | 981.80 | TFFFFFFFTFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r235-smll-162106564800325.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldRVt-PT-050A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r235-smll-162106564800325
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 115K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 82K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 16:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 27 13:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 13:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 19:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 25 19:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 136K May 5 16:52 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldRVt-PT-050A-00
FORMULA_NAME ShieldRVt-PT-050A-01
FORMULA_NAME ShieldRVt-PT-050A-02
FORMULA_NAME ShieldRVt-PT-050A-03
FORMULA_NAME ShieldRVt-PT-050A-04
FORMULA_NAME ShieldRVt-PT-050A-05
FORMULA_NAME ShieldRVt-PT-050A-06
FORMULA_NAME ShieldRVt-PT-050A-07
FORMULA_NAME ShieldRVt-PT-050A-08
FORMULA_NAME ShieldRVt-PT-050A-09
FORMULA_NAME ShieldRVt-PT-050A-10
FORMULA_NAME ShieldRVt-PT-050A-11
FORMULA_NAME ShieldRVt-PT-050A-12
FORMULA_NAME ShieldRVt-PT-050A-13
FORMULA_NAME ShieldRVt-PT-050A-14
FORMULA_NAME ShieldRVt-PT-050A-15
=== Now, execution of the tool begins
BK_START 1621283975710
Running Version 0
[2021-05-17 20:39:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 20:39:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 20:39:38] [INFO ] Load time of PNML (sax parser for PT used): 132 ms
[2021-05-17 20:39:38] [INFO ] Transformed 403 places.
[2021-05-17 20:39:38] [INFO ] Transformed 403 transitions.
[2021-05-17 20:39:38] [INFO ] Found NUPN structural information;
[2021-05-17 20:39:38] [INFO ] Parsed PT model containing 403 places and 403 transitions in 198 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 20:39:38] [INFO ] Initial state test concluded for 2 properties.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldRVt-PT-050A-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050A-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 54 out of 403 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 403/403 places, 402/402 transitions.
Applied a total of 0 rules in 136 ms. Remains 403 /403 variables (removed 0) and now considering 402/402 (removed 0) transitions.
// Phase 1: matrix 402 rows 403 cols
[2021-05-17 20:39:39] [INFO ] Computed 201 place invariants in 31 ms
[2021-05-17 20:39:39] [INFO ] Implicit Places using invariants in 661 ms returned []
// Phase 1: matrix 402 rows 403 cols
[2021-05-17 20:39:39] [INFO ] Computed 201 place invariants in 14 ms
[2021-05-17 20:39:40] [INFO ] Implicit Places using invariants and state equation in 680 ms returned []
Implicit Place search using SMT with State Equation took 1400 ms to find 0 implicit places.
// Phase 1: matrix 402 rows 403 cols
[2021-05-17 20:39:40] [INFO ] Computed 201 place invariants in 4 ms
[2021-05-17 20:39:40] [INFO ] Dead Transitions using invariants and state equation in 575 ms returned []
Finished structural reductions, in 1 iterations. Remains : 403/403 places, 402/402 transitions.
[2021-05-17 20:39:41] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-17 20:39:41] [INFO ] Flatten gal took : 147 ms
FORMULA ShieldRVt-PT-050A-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050A-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 20:39:41] [INFO ] Flatten gal took : 62 ms
[2021-05-17 20:39:41] [INFO ] Input system was already deterministic with 402 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 1020 ms. (steps per millisecond=98 ) properties (out of 27) seen :9
Running SMT prover for 18 properties.
// Phase 1: matrix 402 rows 403 cols
[2021-05-17 20:39:42] [INFO ] Computed 201 place invariants in 3 ms
[2021-05-17 20:39:42] [INFO ] [Real]Absence check using 201 positive place invariants in 75 ms returned sat
[2021-05-17 20:39:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:39:43] [INFO ] [Real]Absence check using state equation in 256 ms returned sat
[2021-05-17 20:39:43] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints (skipped 0 transitions) in 51 ms.
[2021-05-17 20:39:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:39:43] [INFO ] [Nat]Absence check using 201 positive place invariants in 90 ms returned sat
[2021-05-17 20:39:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:39:43] [INFO ] [Nat]Absence check using state equation in 308 ms returned sat
[2021-05-17 20:39:43] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints (skipped 0 transitions) in 87 ms.
[2021-05-17 20:39:49] [INFO ] Added : 384 causal constraints over 77 iterations in 5674 ms. Result :sat
[2021-05-17 20:39:49] [INFO ] [Real]Absence check using 201 positive place invariants in 55 ms returned sat
[2021-05-17 20:39:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:39:49] [INFO ] [Real]Absence check using state equation in 209 ms returned sat
[2021-05-17 20:39:49] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints (skipped 0 transitions) in 35 ms.
[2021-05-17 20:39:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:39:50] [INFO ] [Nat]Absence check using 201 positive place invariants in 53 ms returned sat
[2021-05-17 20:39:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:39:50] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2021-05-17 20:39:50] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints (skipped 0 transitions) in 34 ms.
[2021-05-17 20:39:55] [INFO ] Added : 397 causal constraints over 80 iterations in 4927 ms. Result :sat
[2021-05-17 20:39:55] [INFO ] [Real]Absence check using 201 positive place invariants in 51 ms returned sat
[2021-05-17 20:39:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:39:55] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2021-05-17 20:39:55] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints (skipped 0 transitions) in 31 ms.
[2021-05-17 20:39:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:39:55] [INFO ] [Nat]Absence check using 201 positive place invariants in 49 ms returned sat
[2021-05-17 20:39:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:39:56] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2021-05-17 20:39:56] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints (skipped 0 transitions) in 38 ms.
[2021-05-17 20:40:02] [INFO ] Added : 399 causal constraints over 81 iterations in 6402 ms. Result :sat
[2021-05-17 20:40:02] [INFO ] [Real]Absence check using 201 positive place invariants in 56 ms returned sat
[2021-05-17 20:40:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:40:02] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2021-05-17 20:40:02] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints (skipped 0 transitions) in 29 ms.
[2021-05-17 20:40:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:40:03] [INFO ] [Nat]Absence check using 201 positive place invariants in 58 ms returned sat
[2021-05-17 20:40:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:40:03] [INFO ] [Nat]Absence check using state equation in 205 ms returned sat
[2021-05-17 20:40:03] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints (skipped 0 transitions) in 28 ms.
[2021-05-17 20:40:07] [INFO ] Added : 378 causal constraints over 78 iterations in 4163 ms. Result :sat
[2021-05-17 20:40:07] [INFO ] [Real]Absence check using 201 positive place invariants in 52 ms returned sat
[2021-05-17 20:40:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:40:07] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2021-05-17 20:40:07] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints (skipped 0 transitions) in 29 ms.
[2021-05-17 20:40:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:40:08] [INFO ] [Nat]Absence check using 201 positive place invariants in 79 ms returned sat
[2021-05-17 20:40:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:40:08] [INFO ] [Nat]Absence check using state equation in 246 ms returned sat
[2021-05-17 20:40:08] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints (skipped 0 transitions) in 24 ms.
[2021-05-17 20:40:13] [INFO ] Added : 383 causal constraints over 78 iterations in 4804 ms. Result :sat
[2021-05-17 20:40:13] [INFO ] [Real]Absence check using 201 positive place invariants in 50 ms returned sat
[2021-05-17 20:40:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:40:13] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2021-05-17 20:40:13] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints (skipped 0 transitions) in 27 ms.
[2021-05-17 20:40:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:40:13] [INFO ] [Nat]Absence check using 201 positive place invariants in 66 ms returned sat
[2021-05-17 20:40:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:40:14] [INFO ] [Nat]Absence check using state equation in 221 ms returned sat
[2021-05-17 20:40:14] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints (skipped 0 transitions) in 40 ms.
[2021-05-17 20:40:18] [INFO ] Added : 353 causal constraints over 73 iterations in 4023 ms. Result :sat
[2021-05-17 20:40:18] [INFO ] [Real]Absence check using 201 positive place invariants in 51 ms returned sat
[2021-05-17 20:40:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:40:18] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2021-05-17 20:40:18] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints (skipped 0 transitions) in 41 ms.
[2021-05-17 20:40:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:40:18] [INFO ] [Nat]Absence check using 201 positive place invariants in 54 ms returned sat
[2021-05-17 20:40:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:40:18] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2021-05-17 20:40:18] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints (skipped 0 transitions) in 26 ms.
[2021-05-17 20:40:22] [INFO ] Added : 349 causal constraints over 71 iterations in 3571 ms. Result :sat
[2021-05-17 20:40:22] [INFO ] [Real]Absence check using 201 positive place invariants in 78 ms returned sat
[2021-05-17 20:40:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:40:22] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2021-05-17 20:40:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:40:23] [INFO ] [Nat]Absence check using 201 positive place invariants in 52 ms returned sat
[2021-05-17 20:40:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:40:23] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2021-05-17 20:40:23] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints (skipped 0 transitions) in 29 ms.
[2021-05-17 20:40:27] [INFO ] Added : 396 causal constraints over 80 iterations in 4392 ms. Result :sat
[2021-05-17 20:40:27] [INFO ] [Real]Absence check using 201 positive place invariants in 53 ms returned sat
[2021-05-17 20:40:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:40:27] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2021-05-17 20:40:27] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints (skipped 0 transitions) in 27 ms.
[2021-05-17 20:40:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:40:28] [INFO ] [Nat]Absence check using 201 positive place invariants in 52 ms returned sat
[2021-05-17 20:40:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:40:28] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2021-05-17 20:40:28] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints (skipped 0 transitions) in 25 ms.
[2021-05-17 20:40:32] [INFO ] Added : 380 causal constraints over 77 iterations in 4245 ms. Result :sat
[2021-05-17 20:40:32] [INFO ] [Real]Absence check using 201 positive place invariants in 51 ms returned sat
[2021-05-17 20:40:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:40:32] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2021-05-17 20:40:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:40:33] [INFO ] [Nat]Absence check using 201 positive place invariants in 56 ms returned sat
[2021-05-17 20:40:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:40:33] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2021-05-17 20:40:33] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints (skipped 0 transitions) in 26 ms.
[2021-05-17 20:40:38] [INFO ] Added : 377 causal constraints over 79 iterations in 5060 ms. Result :sat
[2021-05-17 20:40:38] [INFO ] [Real]Absence check using 201 positive place invariants in 51 ms returned sat
[2021-05-17 20:40:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:40:38] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2021-05-17 20:40:38] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints (skipped 0 transitions) in 31 ms.
[2021-05-17 20:40:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:40:38] [INFO ] [Nat]Absence check using 201 positive place invariants in 53 ms returned sat
[2021-05-17 20:40:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:40:39] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
[2021-05-17 20:40:39] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints (skipped 0 transitions) in 27 ms.
[2021-05-17 20:40:43] [INFO ] Added : 388 causal constraints over 78 iterations in 4590 ms. Result :sat
[2021-05-17 20:40:43] [INFO ] [Real]Absence check using 201 positive place invariants in 51 ms returned sat
[2021-05-17 20:40:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:40:44] [INFO ] [Real]Absence check using state equation in 184 ms returned sat
[2021-05-17 20:40:44] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints (skipped 0 transitions) in 25 ms.
[2021-05-17 20:40:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:40:44] [INFO ] [Nat]Absence check using 201 positive place invariants in 55 ms returned sat
[2021-05-17 20:40:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:40:44] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2021-05-17 20:40:44] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints (skipped 0 transitions) in 26 ms.
[2021-05-17 20:40:48] [INFO ] Added : 370 causal constraints over 77 iterations in 4220 ms. Result :sat
[2021-05-17 20:40:48] [INFO ] [Real]Absence check using 201 positive place invariants in 51 ms returned sat
[2021-05-17 20:40:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:40:49] [INFO ] [Real]Absence check using state equation in 182 ms returned sat
[2021-05-17 20:40:49] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints (skipped 0 transitions) in 25 ms.
[2021-05-17 20:40:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:40:49] [INFO ] [Nat]Absence check using 201 positive place invariants in 52 ms returned sat
[2021-05-17 20:40:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:40:49] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2021-05-17 20:40:49] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints (skipped 0 transitions) in 30 ms.
[2021-05-17 20:40:53] [INFO ] Added : 379 causal constraints over 77 iterations in 4451 ms. Result :sat
[2021-05-17 20:40:54] [INFO ] [Real]Absence check using 201 positive place invariants in 50 ms returned sat
[2021-05-17 20:40:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:40:54] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2021-05-17 20:40:54] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints (skipped 0 transitions) in 26 ms.
[2021-05-17 20:40:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:40:54] [INFO ] [Nat]Absence check using 201 positive place invariants in 51 ms returned sat
[2021-05-17 20:40:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:40:54] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2021-05-17 20:40:54] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints (skipped 0 transitions) in 26 ms.
[2021-05-17 20:40:58] [INFO ] Added : 369 causal constraints over 76 iterations in 3747 ms. Result :sat
[2021-05-17 20:40:58] [INFO ] [Real]Absence check using 201 positive place invariants in 51 ms returned sat
[2021-05-17 20:40:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:40:58] [INFO ] [Real]Absence check using state equation in 182 ms returned sat
[2021-05-17 20:40:58] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints (skipped 0 transitions) in 26 ms.
[2021-05-17 20:40:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:40:59] [INFO ] [Nat]Absence check using 201 positive place invariants in 54 ms returned sat
[2021-05-17 20:40:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:40:59] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
[2021-05-17 20:40:59] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints (skipped 0 transitions) in 27 ms.
[2021-05-17 20:41:02] [INFO ] Added : 365 causal constraints over 79 iterations in 3718 ms. Result :sat
[2021-05-17 20:41:03] [INFO ] [Real]Absence check using 201 positive place invariants in 51 ms returned sat
[2021-05-17 20:41:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:41:03] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2021-05-17 20:41:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:41:03] [INFO ] [Nat]Absence check using 201 positive place invariants in 57 ms returned sat
[2021-05-17 20:41:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:41:03] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2021-05-17 20:41:03] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints (skipped 0 transitions) in 26 ms.
[2021-05-17 20:41:07] [INFO ] Added : 362 causal constraints over 76 iterations in 3607 ms. Result :sat
[2021-05-17 20:41:07] [INFO ] [Real]Absence check using 201 positive place invariants in 51 ms returned sat
[2021-05-17 20:41:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:41:07] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2021-05-17 20:41:07] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints (skipped 0 transitions) in 26 ms.
[2021-05-17 20:41:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:41:07] [INFO ] [Nat]Absence check using 201 positive place invariants in 52 ms returned sat
[2021-05-17 20:41:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:41:07] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
[2021-05-17 20:41:08] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints (skipped 0 transitions) in 26 ms.
[2021-05-17 20:41:14] [INFO ] Added : 390 causal constraints over 79 iterations in 6107 ms. Result :sat
[2021-05-17 20:41:14] [INFO ] [Real]Absence check using 201 positive place invariants in 59 ms returned sat
[2021-05-17 20:41:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:41:14] [INFO ] [Real]Absence check using state equation in 210 ms returned sat
[2021-05-17 20:41:14] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints (skipped 0 transitions) in 27 ms.
[2021-05-17 20:41:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:41:14] [INFO ] [Nat]Absence check using 201 positive place invariants in 58 ms returned sat
[2021-05-17 20:41:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:41:14] [INFO ] [Nat]Absence check using state equation in 208 ms returned sat
[2021-05-17 20:41:14] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints (skipped 0 transitions) in 26 ms.
[2021-05-17 20:41:20] [INFO ] Added : 394 causal constraints over 81 iterations in 5215 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((G(p0)||F(p1)||G(p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 403 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 403/403 places, 402/402 transitions.
Applied a total of 0 rules in 11 ms. Remains 403 /403 variables (removed 0) and now considering 402/402 (removed 0) transitions.
// Phase 1: matrix 402 rows 403 cols
[2021-05-17 20:41:20] [INFO ] Computed 201 place invariants in 2 ms
[2021-05-17 20:41:20] [INFO ] Implicit Places using invariants in 319 ms returned []
// Phase 1: matrix 402 rows 403 cols
[2021-05-17 20:41:20] [INFO ] Computed 201 place invariants in 3 ms
[2021-05-17 20:41:21] [INFO ] Implicit Places using invariants and state equation in 539 ms returned []
Implicit Place search using SMT with State Equation took 873 ms to find 0 implicit places.
// Phase 1: matrix 402 rows 403 cols
[2021-05-17 20:41:21] [INFO ] Computed 201 place invariants in 2 ms
[2021-05-17 20:41:21] [INFO ] Dead Transitions using invariants and state equation in 403 ms returned []
Finished structural reductions, in 1 iterations. Remains : 403/403 places, 402/402 transitions.
Stuttering acceptance computed with spot in 377 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-050A-00 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 2}]], initial=4, aps=[p1:(OR (NEQ s134 1) (NEQ s137 1)), p2:(NEQ s355 1), p0:(NEQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1932 ms.
Product exploration explored 100000 steps with 33333 reset in 1921 ms.
Knowledge obtained : [p1, p2, p0]
Stuttering acceptance computed with spot in 194 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 33333 reset in 1674 ms.
Product exploration explored 100000 steps with 33333 reset in 1769 ms.
Applying partial POR strategy [true, true, true, true, false, false]
Stuttering acceptance computed with spot in 191 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Support contains 4 out of 403 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 403/403 places, 402/402 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 403 transition count 402
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 1 rules in 105 ms. Remains 403 /403 variables (removed 0) and now considering 402/402 (removed 0) transitions.
[2021-05-17 20:41:30] [INFO ] Redundant transitions in 47 ms returned []
// Phase 1: matrix 402 rows 403 cols
[2021-05-17 20:41:30] [INFO ] Computed 201 place invariants in 2 ms
[2021-05-17 20:41:30] [INFO ] Dead Transitions using invariants and state equation in 378 ms returned []
Finished structural reductions, in 1 iterations. Remains : 403/403 places, 402/402 transitions.
Product exploration explored 100000 steps with 33333 reset in 3860 ms.
Product exploration explored 100000 steps with 33333 reset in 3784 ms.
[2021-05-17 20:41:38] [INFO ] Flatten gal took : 82 ms
[2021-05-17 20:41:38] [INFO ] Flatten gal took : 66 ms
[2021-05-17 20:41:38] [INFO ] Time to serialize gal into /tmp/LTL14095742668852456376.gal : 27 ms
[2021-05-17 20:41:38] [INFO ] Time to serialize properties into /tmp/LTL17930346489813344213.ltl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL14095742668852456376.gal, -t, CGAL, -LTL, /tmp/LTL17930346489813344213.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL14095742668852456376.gal -t CGAL -LTL /tmp/LTL17930346489813344213.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(((G("(p7==0)"))||(F("((p134==0)||(p137==0))")))||(G("(p355==0)"))))))
Formula 0 simplified : !XX(G"(p7==0)" | F"((p134==0)||(p137==0))" | G"(p355==0)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
163 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.71204,40276,1,0,7,129532,35,0,11280,29365,17
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldRVt-PT-050A-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ShieldRVt-PT-050A-00 finished in 20089 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(((F(p1)||p0)&&(F(p1)||X((p2 U (p3||G(p2)))))))))], workingDir=/home/mcc/execution]
Support contains 7 out of 403 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 403/403 places, 402/402 transitions.
Applied a total of 0 rules in 10 ms. Remains 403 /403 variables (removed 0) and now considering 402/402 (removed 0) transitions.
// Phase 1: matrix 402 rows 403 cols
[2021-05-17 20:41:40] [INFO ] Computed 201 place invariants in 1 ms
[2021-05-17 20:41:40] [INFO ] Implicit Places using invariants in 334 ms returned []
// Phase 1: matrix 402 rows 403 cols
[2021-05-17 20:41:40] [INFO ] Computed 201 place invariants in 2 ms
[2021-05-17 20:41:41] [INFO ] Implicit Places using invariants and state equation in 594 ms returned []
Implicit Place search using SMT with State Equation took 930 ms to find 0 implicit places.
// Phase 1: matrix 402 rows 403 cols
[2021-05-17 20:41:41] [INFO ] Computed 201 place invariants in 2 ms
[2021-05-17 20:41:41] [INFO ] Dead Transitions using invariants and state equation in 521 ms returned []
Finished structural reductions, in 1 iterations. Remains : 403/403 places, 402/402 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : ShieldRVt-PT-050A-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={0, 1} source=1 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={1} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p0:(OR (NEQ s180 1) (NEQ s181 1) (NEQ s184 1)), p1:(OR (AND (EQ s216 1) (EQ s218 1) (EQ s223 1)) (EQ s119 1)), p3:(NEQ s119 1), p2:(OR (NEQ s180 1) (NEQ s181 1) (NEQ s184 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33377 reset in 2094 ms.
Product exploration explored 100000 steps with 33406 reset in 1949 ms.
Knowledge obtained : [p0, (NOT p1), p3, p2]
Stuttering acceptance computed with spot in 137 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1)))]
Product exploration explored 100000 steps with 33309 reset in 2107 ms.
Product exploration explored 100000 steps with 33217 reset in 1836 ms.
Applying partial POR strategy [true, true, true]
Stuttering acceptance computed with spot in 117 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1)))]
Support contains 7 out of 403 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 403/403 places, 402/402 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 403 transition count 402
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 1 rules in 32 ms. Remains 403 /403 variables (removed 0) and now considering 402/402 (removed 0) transitions.
[2021-05-17 20:41:50] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 402 rows 403 cols
[2021-05-17 20:41:50] [INFO ] Computed 201 place invariants in 2 ms
[2021-05-17 20:41:50] [INFO ] Dead Transitions using invariants and state equation in 431 ms returned []
Finished structural reductions, in 1 iterations. Remains : 403/403 places, 402/402 transitions.
Product exploration explored 100000 steps with 33485 reset in 1990 ms.
Product exploration explored 100000 steps with 33380 reset in 1637 ms.
[2021-05-17 20:41:54] [INFO ] Flatten gal took : 37 ms
[2021-05-17 20:41:54] [INFO ] Flatten gal took : 35 ms
[2021-05-17 20:41:54] [INFO ] Time to serialize gal into /tmp/LTL4896884593178106987.gal : 9 ms
[2021-05-17 20:41:54] [INFO ] Time to serialize properties into /tmp/LTL15008536365133913638.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL4896884593178106987.gal, -t, CGAL, -LTL, /tmp/LTL15008536365133913638.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4896884593178106987.gal -t CGAL -LTL /tmp/LTL15008536365133913638.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G((("(((p180==0)||(p181==0))||(p184==0))")||(F("((((p216==1)&&(p218==1))&&(p223==1))||(p119==1))")))&&((F("((((p216==1)&&(p218==1))&&(p223==1))||(p119==1))"))||(X(("(((p180==0)||(p181==0))||(p184==0))")U(("(p119==0)")||(G("(((p180==0)||(p181==0))||(p184==0))"))))))))))
Formula 0 simplified : !FG(("(((p180==0)||(p181==0))||(p184==0))" | F"((((p216==1)&&(p218==1))&&(p223==1))||(p119==1))") & (F"((((p216==1)&&(p218==1))&&(p223==1))||(p119==1))" | X("(((p180==0)||(p181==0))||(p184==0))" U ("(p119==0)" | G"(((p180==0)||(p181==0))||(p184==0))"))))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
332 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.40021,85756,1,0,130,360203,30,59,11781,351621,340
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldRVt-PT-050A-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ShieldRVt-PT-050A-01 finished in 18131 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&G(F(p0)))))], workingDir=/home/mcc/execution]
Support contains 1 out of 403 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 403/403 places, 402/402 transitions.
Applied a total of 0 rules in 10 ms. Remains 403 /403 variables (removed 0) and now considering 402/402 (removed 0) transitions.
// Phase 1: matrix 402 rows 403 cols
[2021-05-17 20:41:58] [INFO ] Computed 201 place invariants in 1 ms
[2021-05-17 20:41:58] [INFO ] Implicit Places using invariants in 391 ms returned []
// Phase 1: matrix 402 rows 403 cols
[2021-05-17 20:41:58] [INFO ] Computed 201 place invariants in 2 ms
[2021-05-17 20:41:59] [INFO ] Implicit Places using invariants and state equation in 630 ms returned []
Implicit Place search using SMT with State Equation took 1024 ms to find 0 implicit places.
// Phase 1: matrix 402 rows 403 cols
[2021-05-17 20:41:59] [INFO ] Computed 201 place invariants in 1 ms
[2021-05-17 20:41:59] [INFO ] Dead Transitions using invariants and state equation in 509 ms returned []
Finished structural reductions, in 1 iterations. Remains : 403/403 places, 402/402 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p0), true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-050A-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s165 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-050A-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050A-03 finished in 1741 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((p0 U p1)&&(X(p1)||G(p0)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 403 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 403/403 places, 402/402 transitions.
Applied a total of 0 rules in 10 ms. Remains 403 /403 variables (removed 0) and now considering 402/402 (removed 0) transitions.
// Phase 1: matrix 402 rows 403 cols
[2021-05-17 20:42:00] [INFO ] Computed 201 place invariants in 2 ms
[2021-05-17 20:42:00] [INFO ] Implicit Places using invariants in 363 ms returned []
// Phase 1: matrix 402 rows 403 cols
[2021-05-17 20:42:00] [INFO ] Computed 201 place invariants in 2 ms
[2021-05-17 20:42:01] [INFO ] Implicit Places using invariants and state equation in 612 ms returned []
Implicit Place search using SMT with State Equation took 977 ms to find 0 implicit places.
// Phase 1: matrix 402 rows 403 cols
[2021-05-17 20:42:01] [INFO ] Computed 201 place invariants in 1 ms
[2021-05-17 20:42:01] [INFO ] Dead Transitions using invariants and state equation in 481 ms returned []
Finished structural reductions, in 1 iterations. Remains : 403/403 places, 402/402 transitions.
Stuttering acceptance computed with spot in 380 ms :[(NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-050A-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}, { cond=p0, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 2}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s379 1) (EQ s388 1) (EQ s394 1)), p0:(EQ s91 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-050A-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050A-04 finished in 1874 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0&&F(G((p1 U p2)))&&F(p3)))))], workingDir=/home/mcc/execution]
Support contains 8 out of 403 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 403/403 places, 402/402 transitions.
Applied a total of 0 rules in 12 ms. Remains 403 /403 variables (removed 0) and now considering 402/402 (removed 0) transitions.
// Phase 1: matrix 402 rows 403 cols
[2021-05-17 20:42:02] [INFO ] Computed 201 place invariants in 3 ms
[2021-05-17 20:42:02] [INFO ] Implicit Places using invariants in 376 ms returned []
// Phase 1: matrix 402 rows 403 cols
[2021-05-17 20:42:02] [INFO ] Computed 201 place invariants in 1 ms
[2021-05-17 20:42:03] [INFO ] Implicit Places using invariants and state equation in 1207 ms returned []
Implicit Place search using SMT with State Equation took 1601 ms to find 0 implicit places.
// Phase 1: matrix 402 rows 403 cols
[2021-05-17 20:42:03] [INFO ] Computed 201 place invariants in 10 ms
[2021-05-17 20:42:04] [INFO ] Dead Transitions using invariants and state equation in 372 ms returned []
Finished structural reductions, in 1 iterations. Remains : 403/403 places, 402/402 transitions.
Stuttering acceptance computed with spot in 377 ms :[(OR (NOT p0) (NOT p3) (NOT p2)), (OR (NOT p0) (NOT p3) (NOT p2)), (OR (NOT p0) (NOT p3) (NOT p2)), true, (NOT p2), (NOT p3), (NOT p2)]
Running random walk in product with property : ShieldRVt-PT-050A-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p3)), acceptance={} source=2 dest: 5}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(OR p2 p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 6}], [{ cond=(NOT p3), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(OR (EQ s36 0) (EQ s37 0) (EQ s40 0)), p3:(EQ s225 0), p2:(AND (EQ s248 1) (EQ s250 1) (EQ s255 1)), p1:(EQ s133 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3 reset in 586 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 1 ms.
FORMULA ShieldRVt-PT-050A-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050A-05 finished in 2984 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||(p1 U (p2&&G(p3))))))], workingDir=/home/mcc/execution]
Support contains 7 out of 403 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 403/403 places, 402/402 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 402 transition count 401
Applied a total of 2 rules in 36 ms. Remains 402 /403 variables (removed 1) and now considering 401/402 (removed 1) transitions.
// Phase 1: matrix 401 rows 402 cols
[2021-05-17 20:42:05] [INFO ] Computed 201 place invariants in 2 ms
[2021-05-17 20:42:05] [INFO ] Implicit Places using invariants in 312 ms returned [395]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 314 ms to find 1 implicit places.
[2021-05-17 20:42:05] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 401 rows 401 cols
[2021-05-17 20:42:05] [INFO ] Computed 200 place invariants in 1 ms
[2021-05-17 20:42:05] [INFO ] Dead Transitions using invariants and state equation in 383 ms returned []
Starting structural reductions, iteration 1 : 401/403 places, 401/402 transitions.
Applied a total of 0 rules in 22 ms. Remains 401 /401 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2021-05-17 20:42:05] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 401 rows 401 cols
[2021-05-17 20:42:05] [INFO ] Computed 200 place invariants in 2 ms
[2021-05-17 20:42:06] [INFO ] Dead Transitions using invariants and state equation in 364 ms returned []
Finished structural reductions, in 2 iterations. Remains : 401/403 places, 401/402 transitions.
Stuttering acceptance computed with spot in 79 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : ShieldRVt-PT-050A-07 automaton TGBA [mat=[[{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p2 p3), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p3), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s332 1) (EQ s333 1) (EQ s336 1)), p2:(EQ s267 0), p3:(OR (NEQ s24 1) (NEQ s26 1) (NEQ s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 60 reset in 592 ms.
Product exploration explored 100000 steps with 72 reset in 735 ms.
Knowledge obtained : [(NOT p0), p2, p3]
Stuttering acceptance computed with spot in 85 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 67 reset in 604 ms.
Product exploration explored 100000 steps with 61 reset in 874 ms.
[2021-05-17 20:42:09] [INFO ] Flatten gal took : 53 ms
[2021-05-17 20:42:09] [INFO ] Flatten gal took : 52 ms
[2021-05-17 20:42:09] [INFO ] Time to serialize gal into /tmp/LTL4943931099215325875.gal : 7 ms
[2021-05-17 20:42:09] [INFO ] Time to serialize properties into /tmp/LTL610675644724664250.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL4943931099215325875.gal, -t, CGAL, -LTL, /tmp/LTL610675644724664250.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4943931099215325875.gal -t CGAL -LTL /tmp/LTL610675644724664250.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((("(p267==1)")U(("(p267==0)")&&(G("(((p24==0)||(p26==0))||(p31==0))"))))||("(((p332==1)&&(p333==1))&&(p336==1))"))))
Formula 0 simplified : !F("(((p332==1)&&(p333==1))&&(p336==1))" | ("(p267==1)" U ("(p267==0)" & G"(((p24==0)||(p26==0))||(p31==0))")))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2021-05-17 20:42:24] [INFO ] Flatten gal took : 45 ms
[2021-05-17 20:42:24] [INFO ] Applying decomposition
[2021-05-17 20:42:24] [INFO ] Flatten gal took : 41 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph7793508625424305385.txt, -o, /tmp/graph7793508625424305385.bin, -w, /tmp/graph7793508625424305385.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph7793508625424305385.bin, -l, -1, -v, -w, /tmp/graph7793508625424305385.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 20:42:24] [INFO ] Decomposing Gal with order
[2021-05-17 20:42:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 20:42:25] [INFO ] Removed a total of 149 redundant transitions.
[2021-05-17 20:42:25] [INFO ] Flatten gal took : 146 ms
[2021-05-17 20:42:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 36 ms.
[2021-05-17 20:42:25] [INFO ] Time to serialize gal into /tmp/LTL4671514141090357897.gal : 20 ms
[2021-05-17 20:42:25] [INFO ] Time to serialize properties into /tmp/LTL7879618509868771684.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL4671514141090357897.gal, -t, CGAL, -LTL, /tmp/LTL7879618509868771684.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4671514141090357897.gal -t CGAL -LTL /tmp/LTL7879618509868771684.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F((("(i15.i0.u133.p267==1)")U(("(i15.i0.u133.p267==0)")&&(G("(((i1.i0.u11.p24==0)||(i1.i0.u12.p26==0))||(i1.i1.u15.p31==0))"))))||("(((i17.i2.u165.p332==1)&&(i17.i2.u166.p333==1))&&(i17.i2.u167.p336==1))"))))
Formula 0 simplified : !F("(((i17.i2.u165.p332==1)&&(i17.i2.u166.p333==1))&&(i17.i2.u167.p336==1))" | ("(i15.i0.u133.p267==1)" U ("(i15.i0.u133.p267==0)" & G"(((i1.i0.u11.p24==0)||(i1.i0.u12.p26==0))||(i1.i1.u15.p31==0))")))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
327 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.38469,110128,1,0,155165,97,1391,551359,67,150,99770
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldRVt-PT-050A-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ShieldRVt-PT-050A-07 finished in 24091 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 403 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 403/403 places, 402/402 transitions.
Applied a total of 0 rules in 10 ms. Remains 403 /403 variables (removed 0) and now considering 402/402 (removed 0) transitions.
// Phase 1: matrix 402 rows 403 cols
[2021-05-17 20:42:29] [INFO ] Computed 201 place invariants in 2 ms
[2021-05-17 20:42:29] [INFO ] Implicit Places using invariants in 405 ms returned []
// Phase 1: matrix 402 rows 403 cols
[2021-05-17 20:42:29] [INFO ] Computed 201 place invariants in 2 ms
[2021-05-17 20:42:30] [INFO ] Implicit Places using invariants and state equation in 624 ms returned []
Implicit Place search using SMT with State Equation took 1034 ms to find 0 implicit places.
// Phase 1: matrix 402 rows 403 cols
[2021-05-17 20:42:30] [INFO ] Computed 201 place invariants in 2 ms
[2021-05-17 20:42:30] [INFO ] Dead Transitions using invariants and state equation in 492 ms returned []
Finished structural reductions, in 1 iterations. Remains : 403/403 places, 402/402 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-050A-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s51 1) (EQ s60 1) (EQ s66 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 728 ms.
Stack based approach found an accepted trace after 43 steps with 0 reset with depth 44 and stack size 44 in 0 ms.
FORMULA ShieldRVt-PT-050A-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050A-09 finished in 2342 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 403 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 403/403 places, 402/402 transitions.
Applied a total of 0 rules in 6 ms. Remains 403 /403 variables (removed 0) and now considering 402/402 (removed 0) transitions.
// Phase 1: matrix 402 rows 403 cols
[2021-05-17 20:42:31] [INFO ] Computed 201 place invariants in 1 ms
[2021-05-17 20:42:31] [INFO ] Implicit Places using invariants in 311 ms returned []
// Phase 1: matrix 402 rows 403 cols
[2021-05-17 20:42:31] [INFO ] Computed 201 place invariants in 1 ms
[2021-05-17 20:42:32] [INFO ] Implicit Places using invariants and state equation in 572 ms returned []
Implicit Place search using SMT with State Equation took 885 ms to find 0 implicit places.
// Phase 1: matrix 402 rows 403 cols
[2021-05-17 20:42:32] [INFO ] Computed 201 place invariants in 1 ms
[2021-05-17 20:42:32] [INFO ] Dead Transitions using invariants and state equation in 488 ms returned []
Finished structural reductions, in 1 iterations. Remains : 403/403 places, 402/402 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-050A-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s277 1), p1:(EQ s197 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-050A-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050A-10 finished in 1503 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||F(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 403 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 403/403 places, 402/402 transitions.
Applied a total of 0 rules in 9 ms. Remains 403 /403 variables (removed 0) and now considering 402/402 (removed 0) transitions.
// Phase 1: matrix 402 rows 403 cols
[2021-05-17 20:42:32] [INFO ] Computed 201 place invariants in 1 ms
[2021-05-17 20:42:33] [INFO ] Implicit Places using invariants in 355 ms returned []
// Phase 1: matrix 402 rows 403 cols
[2021-05-17 20:42:33] [INFO ] Computed 201 place invariants in 1 ms
[2021-05-17 20:42:33] [INFO ] Implicit Places using invariants and state equation in 591 ms returned []
Implicit Place search using SMT with State Equation took 949 ms to find 0 implicit places.
// Phase 1: matrix 402 rows 403 cols
[2021-05-17 20:42:33] [INFO ] Computed 201 place invariants in 1 ms
[2021-05-17 20:42:34] [INFO ] Dead Transitions using invariants and state equation in 372 ms returned []
Finished structural reductions, in 1 iterations. Remains : 403/403 places, 402/402 transitions.
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-050A-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(EQ s171 1), p0:(EQ s159 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 515 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA ShieldRVt-PT-050A-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050A-11 finished in 1959 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 403 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 403/403 places, 402/402 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 400 transition count 400
Applied a total of 3 rules in 31 ms. Remains 400 /403 variables (removed 3) and now considering 400/402 (removed 2) transitions.
// Phase 1: matrix 400 rows 400 cols
[2021-05-17 20:42:34] [INFO ] Computed 200 place invariants in 1 ms
[2021-05-17 20:42:35] [INFO ] Implicit Places using invariants in 303 ms returned []
// Phase 1: matrix 400 rows 400 cols
[2021-05-17 20:42:35] [INFO ] Computed 200 place invariants in 2 ms
[2021-05-17 20:42:35] [INFO ] Implicit Places using invariants and state equation in 536 ms returned []
Implicit Place search using SMT with State Equation took 841 ms to find 0 implicit places.
[2021-05-17 20:42:35] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 400 rows 400 cols
[2021-05-17 20:42:35] [INFO ] Computed 200 place invariants in 1 ms
[2021-05-17 20:42:36] [INFO ] Dead Transitions using invariants and state equation in 334 ms returned []
Finished structural reductions, in 1 iterations. Remains : 400/403 places, 400/402 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-050A-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s262 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1 reset in 510 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 0 ms.
FORMULA ShieldRVt-PT-050A-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050A-12 finished in 1782 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 403 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 403/403 places, 402/402 transitions.
Applied a total of 0 rules in 5 ms. Remains 403 /403 variables (removed 0) and now considering 402/402 (removed 0) transitions.
// Phase 1: matrix 402 rows 403 cols
[2021-05-17 20:42:36] [INFO ] Computed 201 place invariants in 0 ms
[2021-05-17 20:42:37] [INFO ] Implicit Places using invariants in 320 ms returned []
// Phase 1: matrix 402 rows 403 cols
[2021-05-17 20:42:37] [INFO ] Computed 201 place invariants in 2 ms
[2021-05-17 20:42:37] [INFO ] Implicit Places using invariants and state equation in 528 ms returned []
Implicit Place search using SMT with State Equation took 850 ms to find 0 implicit places.
// Phase 1: matrix 402 rows 403 cols
[2021-05-17 20:42:37] [INFO ] Computed 201 place invariants in 3 ms
[2021-05-17 20:42:37] [INFO ] Dead Transitions using invariants and state equation in 403 ms returned []
Finished structural reductions, in 1 iterations. Remains : 403/403 places, 402/402 transitions.
Stuttering acceptance computed with spot in 279 ms :[true, (OR (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-050A-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(EQ s203 1), p0:(OR (EQ s28 0) (EQ s29 0) (EQ s32 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-050A-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050A-13 finished in 1558 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 6 out of 403 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 403/403 places, 402/402 transitions.
Applied a total of 0 rules in 16 ms. Remains 403 /403 variables (removed 0) and now considering 402/402 (removed 0) transitions.
// Phase 1: matrix 402 rows 403 cols
[2021-05-17 20:42:38] [INFO ] Computed 201 place invariants in 1 ms
[2021-05-17 20:42:38] [INFO ] Implicit Places using invariants in 245 ms returned []
// Phase 1: matrix 402 rows 403 cols
[2021-05-17 20:42:38] [INFO ] Computed 201 place invariants in 1 ms
[2021-05-17 20:42:39] [INFO ] Implicit Places using invariants and state equation in 531 ms returned []
Implicit Place search using SMT with State Equation took 777 ms to find 0 implicit places.
[2021-05-17 20:42:39] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 402 rows 403 cols
[2021-05-17 20:42:39] [INFO ] Computed 201 place invariants in 1 ms
[2021-05-17 20:42:39] [INFO ] Dead Transitions using invariants and state equation in 362 ms returned []
Finished structural reductions, in 1 iterations. Remains : 403/403 places, 402/402 transitions.
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-050A-14 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s387 1) (NEQ s396 1) (NEQ s402 1)), p1:(OR (AND (NEQ s387 0) (NEQ s396 0) (NEQ s402 0)) (NEQ s107 1) (NEQ s116 1) (NEQ s122 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 595 ms.
Product exploration explored 100000 steps with 0 reset in 735 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 594 ms.
Product exploration explored 100000 steps with 0 reset in 733 ms.
[2021-05-17 20:42:42] [INFO ] Flatten gal took : 22 ms
[2021-05-17 20:42:42] [INFO ] Flatten gal took : 21 ms
[2021-05-17 20:42:42] [INFO ] Time to serialize gal into /tmp/LTL4466022069392125711.gal : 5 ms
[2021-05-17 20:42:42] [INFO ] Time to serialize properties into /tmp/LTL4542910885600512498.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL4466022069392125711.gal, -t, CGAL, -LTL, /tmp/LTL4542910885600512498.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4466022069392125711.gal -t CGAL -LTL /tmp/LTL4542910885600512498.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((G("(((p387==0)||(p396==0))||(p402==0))"))||(G("((((((p387==1)&&(p396==1))&&(p402==1))||(p107==0))||(p116==0))||(p122==0))")))))
Formula 0 simplified : !F(G"(((p387==0)||(p396==0))||(p402==0))" | G"((((((p387==1)&&(p396==1))&&(p402==1))||(p107==0))||(p116==0))||(p122==0))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2021-05-17 20:42:57] [INFO ] Flatten gal took : 25 ms
[2021-05-17 20:42:57] [INFO ] Applying decomposition
[2021-05-17 20:42:57] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph3319184649136120627.txt, -o, /tmp/graph3319184649136120627.bin, -w, /tmp/graph3319184649136120627.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph3319184649136120627.bin, -l, -1, -v, -w, /tmp/graph3319184649136120627.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 20:42:57] [INFO ] Decomposing Gal with order
[2021-05-17 20:42:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 20:42:57] [INFO ] Removed a total of 150 redundant transitions.
[2021-05-17 20:42:57] [INFO ] Flatten gal took : 127 ms
[2021-05-17 20:42:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 58 ms.
[2021-05-17 20:42:57] [INFO ] Time to serialize gal into /tmp/LTL12781964774359315469.gal : 29 ms
[2021-05-17 20:42:57] [INFO ] Time to serialize properties into /tmp/LTL10820542148197851799.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL12781964774359315469.gal, -t, CGAL, -LTL, /tmp/LTL10820542148197851799.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL12781964774359315469.gal -t CGAL -LTL /tmp/LTL10820542148197851799.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F((G("(((i22.i0.u193.p387==0)||(i22.i1.u197.p396==0))||(i22.i1.u200.p402==0))"))||(G("((((((i22.i0.u193.p387==1)&&(i22.i1.u197.p396==1))&&(i22.i1.u200.p402==1))||(i6.i0.u53.p107==0))||(i6.i1.u57.p116==0))||(i6.i1.u60.p122==0))")))))
Formula 0 simplified : !F(G"(((i22.i0.u193.p387==0)||(i22.i1.u197.p396==0))||(i22.i1.u200.p402==0))" | G"((((((i22.i0.u193.p387==1)&&(i22.i1.u197.p396==1))&&(i22.i1.u200.p402==1))||(i6.i0.u53.p107==0))||(i6.i1.u57.p116==0))||(i6.i1.u60.p122==0))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
95 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.09497,45356,1,0,60363,98,1344,140464,66,149,61035
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldRVt-PT-050A-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ShieldRVt-PT-050A-14 finished in 20889 ms.
All properties solved without resorting to model-checking.
BK_STOP 1621284180238
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVt-PT-050A"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldRVt-PT-050A, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r235-smll-162106564800325"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-050A.tgz
mv ShieldRVt-PT-050A execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;