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-162106564800349.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-100B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r235-smll-162106564800349
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 130K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 90K 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.5K Mar 28 16:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 28 16:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 28 16:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 27 13:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 13:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 25 19:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 19:25 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 1.3M 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-100B-00
FORMULA_NAME ShieldRVt-PT-100B-01
FORMULA_NAME ShieldRVt-PT-100B-02
FORMULA_NAME ShieldRVt-PT-100B-03
FORMULA_NAME ShieldRVt-PT-100B-04
FORMULA_NAME ShieldRVt-PT-100B-05
FORMULA_NAME ShieldRVt-PT-100B-06
FORMULA_NAME ShieldRVt-PT-100B-07
FORMULA_NAME ShieldRVt-PT-100B-08
FORMULA_NAME ShieldRVt-PT-100B-09
FORMULA_NAME ShieldRVt-PT-100B-10
FORMULA_NAME ShieldRVt-PT-100B-11
FORMULA_NAME ShieldRVt-PT-100B-12
FORMULA_NAME ShieldRVt-PT-100B-13
FORMULA_NAME ShieldRVt-PT-100B-14
FORMULA_NAME ShieldRVt-PT-100B-15

=== Now, execution of the tool begins

BK_START 1621300397113

Running Version 0
[2021-05-18 01:13:20] [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-18 01:13:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 01:13:21] [INFO ] Load time of PNML (sax parser for PT used): 479 ms
[2021-05-18 01:13:21] [INFO ] Transformed 5003 places.
[2021-05-18 01:13:21] [INFO ] Transformed 5003 transitions.
[2021-05-18 01:13:21] [INFO ] Found NUPN structural information;
[2021-05-18 01:13:21] [INFO ] Parsed PT model containing 5003 places and 5003 transitions in 749 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
[2021-05-18 01:13:21] [INFO ] Initial state test concluded for 3 properties.
FORMULA ShieldRVt-PT-100B-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100B-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 5003 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5003/5003 places, 5003/5003 transitions.
Discarding 1087 places :
Symmetric choice reduction at 0 with 1087 rule applications. Total rules 1087 place count 3916 transition count 3916
Iterating global reduction 0 with 1087 rules applied. Total rules applied 2174 place count 3916 transition count 3916
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2175 place count 3915 transition count 3915
Iterating global reduction 0 with 1 rules applied. Total rules applied 2176 place count 3915 transition count 3915
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2177 place count 3914 transition count 3914
Iterating global reduction 0 with 1 rules applied. Total rules applied 2178 place count 3914 transition count 3914
Applied a total of 2178 rules in 3365 ms. Remains 3914 /5003 variables (removed 1089) and now considering 3914/5003 (removed 1089) transitions.
// Phase 1: matrix 3914 rows 3914 cols
[2021-05-18 01:13:25] [INFO ] Computed 401 place invariants in 55 ms
[2021-05-18 01:13:26] [INFO ] Implicit Places using invariants in 1311 ms returned []
// Phase 1: matrix 3914 rows 3914 cols
[2021-05-18 01:13:26] [INFO ] Computed 401 place invariants in 36 ms
[2021-05-18 01:13:27] [INFO ] Implicit Places using invariants and state equation in 1040 ms returned []
Implicit Place search using SMT with State Equation took 2394 ms to find 0 implicit places.
// Phase 1: matrix 3914 rows 3914 cols
[2021-05-18 01:13:27] [INFO ] Computed 401 place invariants in 29 ms
[2021-05-18 01:13:28] [INFO ] Dead Transitions using invariants and state equation in 872 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3914/5003 places, 3914/5003 transitions.
[2021-05-18 01:13:29] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-18 01:13:29] [INFO ] Flatten gal took : 549 ms
FORMULA ShieldRVt-PT-100B-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100B-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100B-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 01:13:29] [INFO ] Flatten gal took : 319 ms
[2021-05-18 01:13:30] [INFO ] Input system was already deterministic with 3914 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 1902 ms. (steps per millisecond=52 ) properties (out of 28) seen :11
Running SMT prover for 17 properties.
// Phase 1: matrix 3914 rows 3914 cols
[2021-05-18 01:13:32] [INFO ] Computed 401 place invariants in 24 ms
[2021-05-18 01:13:33] [INFO ] [Real]Absence check using 401 positive place invariants in 526 ms returned sat
[2021-05-18 01:13:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 01:13:37] [INFO ] [Real]Absence check using state equation in 4320 ms returned sat
[2021-05-18 01:13:41] [INFO ] Deduced a trap composed of 39 places in 3094 ms of which 7 ms to minimize.
[2021-05-18 01:13:44] [INFO ] Deduced a trap composed of 41 places in 2678 ms of which 10 ms to minimize.
[2021-05-18 01:13:46] [INFO ] Deduced a trap composed of 52 places in 2055 ms of which 14 ms to minimize.
[2021-05-18 01:13:49] [INFO ] Deduced a trap composed of 47 places in 2562 ms of which 4 ms to minimize.
[2021-05-18 01:13:52] [INFO ] Deduced a trap composed of 29 places in 2716 ms of which 4 ms to minimize.
[2021-05-18 01:13:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2021-05-18 01:13:53] [INFO ] [Real]Absence check using 401 positive place invariants in 390 ms returned sat
[2021-05-18 01:13:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 01:13:58] [INFO ] [Real]Absence check using state equation in 4375 ms returned sat
[2021-05-18 01:14:00] [INFO ] Deduced a trap composed of 36 places in 2341 ms of which 15 ms to minimize.
[2021-05-18 01:14:03] [INFO ] Deduced a trap composed of 32 places in 2140 ms of which 3 ms to minimize.
[2021-05-18 01:14:05] [INFO ] Deduced a trap composed of 39 places in 2417 ms of which 4 ms to minimize.
[2021-05-18 01:14:07] [INFO ] Deduced a trap composed of 33 places in 1845 ms of which 3 ms to minimize.
[2021-05-18 01:14:10] [INFO ] Deduced a trap composed of 42 places in 1808 ms of which 4 ms to minimize.
[2021-05-18 01:14:12] [INFO ] Deduced a trap composed of 24 places in 1768 ms of which 2 ms to minimize.
[2021-05-18 01:14:14] [INFO ] Deduced a trap composed of 30 places in 1933 ms of which 2 ms to minimize.
[2021-05-18 01:14:14] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
[2021-05-18 01:14:14] [INFO ] [Real]Absence check using 401 positive place invariants in 318 ms returned sat
[2021-05-18 01:14:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 01:14:18] [INFO ] [Real]Absence check using state equation in 3392 ms returned sat
[2021-05-18 01:14:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 01:14:19] [INFO ] [Nat]Absence check using 401 positive place invariants in 497 ms returned sat
[2021-05-18 01:14:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 01:14:23] [INFO ] [Nat]Absence check using state equation in 3662 ms returned sat
[2021-05-18 01:14:25] [INFO ] Deduced a trap composed of 36 places in 1951 ms of which 3 ms to minimize.
[2021-05-18 01:14:27] [INFO ] Deduced a trap composed of 34 places in 1907 ms of which 8 ms to minimize.
[2021-05-18 01:14:29] [INFO ] Deduced a trap composed of 33 places in 2023 ms of which 2 ms to minimize.
[2021-05-18 01:14:32] [INFO ] Deduced a trap composed of 23 places in 1932 ms of which 2 ms to minimize.
[2021-05-18 01:14:34] [INFO ] Deduced a trap composed of 23 places in 2057 ms of which 3 ms to minimize.
[2021-05-18 01:14:36] [INFO ] Deduced a trap composed of 23 places in 2036 ms of which 2 ms to minimize.
[2021-05-18 01:14:38] [INFO ] Deduced a trap composed of 50 places in 2033 ms of which 4 ms to minimize.
[2021-05-18 01:14:38] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
[2021-05-18 01:14:39] [INFO ] [Real]Absence check using 401 positive place invariants in 346 ms returned sat
[2021-05-18 01:14:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 01:14:44] [INFO ] [Real]Absence check using state equation in 4432 ms returned sat
[2021-05-18 01:14:46] [INFO ] Deduced a trap composed of 31 places in 2003 ms of which 2 ms to minimize.
[2021-05-18 01:14:49] [INFO ] Deduced a trap composed of 27 places in 2586 ms of which 3 ms to minimize.
[2021-05-18 01:14:52] [INFO ] Deduced a trap composed of 29 places in 2488 ms of which 2 ms to minimize.
[2021-05-18 01:14:54] [INFO ] Deduced a trap composed of 34 places in 2209 ms of which 3 ms to minimize.
[2021-05-18 01:14:56] [INFO ] Deduced a trap composed of 32 places in 2070 ms of which 3 ms to minimize.
[2021-05-18 01:14:59] [INFO ] Deduced a trap composed of 23 places in 2302 ms of which 3 ms to minimize.
[2021-05-18 01:14:59] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
[2021-05-18 01:15:00] [INFO ] [Real]Absence check using 401 positive place invariants in 333 ms returned sat
[2021-05-18 01:15:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 01:15:04] [INFO ] [Real]Absence check using state equation in 4014 ms returned sat
[2021-05-18 01:15:06] [INFO ] Deduced a trap composed of 35 places in 2108 ms of which 4 ms to minimize.
[2021-05-18 01:15:09] [INFO ] Deduced a trap composed of 39 places in 2117 ms of which 2 ms to minimize.
[2021-05-18 01:15:11] [INFO ] Deduced a trap composed of 24 places in 1994 ms of which 3 ms to minimize.
[2021-05-18 01:15:13] [INFO ] Deduced a trap composed of 30 places in 1940 ms of which 2 ms to minimize.
[2021-05-18 01:15:15] [INFO ] Deduced a trap composed of 45 places in 1932 ms of which 2 ms to minimize.
[2021-05-18 01:15:18] [INFO ] Deduced a trap composed of 22 places in 2262 ms of which 7 ms to minimize.
[2021-05-18 01:15:19] [INFO ] Deduced a trap composed of 21 places in 1738 ms of which 3 ms to minimize.
[2021-05-18 01:15:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
[2021-05-18 01:15:21] [INFO ] [Real]Absence check using 401 positive place invariants in 495 ms returned sat
[2021-05-18 01:15:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 01:15:25] [INFO ] [Real]Absence check using state equation in 4384 ms returned sat
[2021-05-18 01:15:27] [INFO ] Deduced a trap composed of 31 places in 2247 ms of which 2 ms to minimize.
[2021-05-18 01:15:30] [INFO ] Deduced a trap composed of 24 places in 2106 ms of which 2 ms to minimize.
[2021-05-18 01:15:32] [INFO ] Deduced a trap composed of 32 places in 2042 ms of which 4 ms to minimize.
[2021-05-18 01:15:34] [INFO ] Deduced a trap composed of 35 places in 2220 ms of which 3 ms to minimize.
[2021-05-18 01:15:36] [INFO ] Deduced a trap composed of 33 places in 1812 ms of which 2 ms to minimize.
[2021-05-18 01:15:39] [INFO ] Deduced a trap composed of 39 places in 2067 ms of which 4 ms to minimize.
[2021-05-18 01:15:41] [INFO ] Deduced a trap composed of 24 places in 1986 ms of which 2 ms to minimize.
[2021-05-18 01:15:41] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
[2021-05-18 01:15:42] [INFO ] [Real]Absence check using 401 positive place invariants in 423 ms returned sat
[2021-05-18 01:15:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 01:15:46] [INFO ] [Real]Absence check using state equation in 4269 ms returned sat
[2021-05-18 01:15:49] [INFO ] Deduced a trap composed of 22 places in 2221 ms of which 4 ms to minimize.
[2021-05-18 01:15:51] [INFO ] Deduced a trap composed of 26 places in 2235 ms of which 2 ms to minimize.
[2021-05-18 01:15:54] [INFO ] Deduced a trap composed of 43 places in 2168 ms of which 3 ms to minimize.
[2021-05-18 01:15:56] [INFO ] Deduced a trap composed of 41 places in 2201 ms of which 2 ms to minimize.
[2021-05-18 01:15:58] [INFO ] Deduced a trap composed of 22 places in 2057 ms of which 2 ms to minimize.
[2021-05-18 01:16:01] [INFO ] Deduced a trap composed of 38 places in 2333 ms of which 2 ms to minimize.
[2021-05-18 01:16:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
[2021-05-18 01:16:02] [INFO ] [Real]Absence check using 401 positive place invariants in 511 ms returned sat
[2021-05-18 01:16:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 01:16:06] [INFO ] [Real]Absence check using state equation in 3502 ms returned sat
[2021-05-18 01:16:08] [INFO ] Deduced a trap composed of 49 places in 1877 ms of which 3 ms to minimize.
[2021-05-18 01:16:10] [INFO ] Deduced a trap composed of 42 places in 2145 ms of which 3 ms to minimize.
[2021-05-18 01:16:12] [INFO ] Deduced a trap composed of 72 places in 2159 ms of which 3 ms to minimize.
[2021-05-18 01:16:15] [INFO ] Deduced a trap composed of 61 places in 2017 ms of which 2 ms to minimize.
[2021-05-18 01:16:17] [INFO ] Deduced a trap composed of 38 places in 1973 ms of which 2 ms to minimize.
[2021-05-18 01:16:20] [INFO ] Deduced a trap composed of 46 places in 2814 ms of which 3 ms to minimize.
[2021-05-18 01:16:23] [INFO ] Deduced a trap composed of 32 places in 2289 ms of which 3 ms to minimize.
[2021-05-18 01:16:23] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
[2021-05-18 01:16:23] [INFO ] [Real]Absence check using 401 positive place invariants in 336 ms returned sat
[2021-05-18 01:16:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 01:16:27] [INFO ] [Real]Absence check using state equation in 3586 ms returned sat
[2021-05-18 01:16:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 01:16:28] [INFO ] [Nat]Absence check using 401 positive place invariants in 333 ms returned sat
[2021-05-18 01:16:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 01:16:32] [INFO ] [Nat]Absence check using state equation in 3639 ms returned sat
[2021-05-18 01:16:34] [INFO ] Deduced a trap composed of 21 places in 1882 ms of which 7 ms to minimize.
[2021-05-18 01:16:36] [INFO ] Deduced a trap composed of 39 places in 1821 ms of which 3 ms to minimize.
[2021-05-18 01:16:38] [INFO ] Deduced a trap composed of 33 places in 1815 ms of which 3 ms to minimize.
[2021-05-18 01:16:40] [INFO ] Deduced a trap composed of 33 places in 1806 ms of which 3 ms to minimize.
[2021-05-18 01:16:42] [INFO ] Deduced a trap composed of 29 places in 2044 ms of which 2 ms to minimize.
[2021-05-18 01:16:44] [INFO ] Deduced a trap composed of 39 places in 2014 ms of which 3 ms to minimize.
[2021-05-18 01:16:46] [INFO ] Deduced a trap composed of 23 places in 1911 ms of which 2 ms to minimize.
[2021-05-18 01:16:48] [INFO ] Deduced a trap composed of 46 places in 1726 ms of which 2 ms to minimize.
[2021-05-18 01:16:48] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
[2021-05-18 01:16:49] [INFO ] [Real]Absence check using 401 positive place invariants in 328 ms returned sat
[2021-05-18 01:16:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 01:16:52] [INFO ] [Real]Absence check using state equation in 3565 ms returned sat
[2021-05-18 01:16:55] [INFO ] Deduced a trap composed of 24 places in 1965 ms of which 3 ms to minimize.
[2021-05-18 01:16:57] [INFO ] Deduced a trap composed of 21 places in 1802 ms of which 3 ms to minimize.
[2021-05-18 01:16:59] [INFO ] Deduced a trap composed of 33 places in 2018 ms of which 4 ms to minimize.
[2021-05-18 01:17:01] [INFO ] Deduced a trap composed of 30 places in 2251 ms of which 3 ms to minimize.
[2021-05-18 01:17:03] [INFO ] Deduced a trap composed of 33 places in 1944 ms of which 2 ms to minimize.
[2021-05-18 01:17:06] [INFO ] Deduced a trap composed of 31 places in 1947 ms of which 5 ms to minimize.
[2021-05-18 01:17:08] [INFO ] Deduced a trap composed of 27 places in 2113 ms of which 3 ms to minimize.
[2021-05-18 01:17:13] [INFO ] Deduced a trap composed of 16 places in 4931 ms of which 5 ms to minimize.
[2021-05-18 01:17:13] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 9
[2021-05-18 01:17:14] [INFO ] [Real]Absence check using 401 positive place invariants in 383 ms returned sat
[2021-05-18 01:17:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 01:17:18] [INFO ] [Real]Absence check using state equation in 4446 ms returned sat
[2021-05-18 01:17:21] [INFO ] Deduced a trap composed of 23 places in 2017 ms of which 3 ms to minimize.
[2021-05-18 01:17:23] [INFO ] Deduced a trap composed of 31 places in 2010 ms of which 2 ms to minimize.
[2021-05-18 01:17:25] [INFO ] Deduced a trap composed of 21 places in 2091 ms of which 3 ms to minimize.
[2021-05-18 01:17:27] [INFO ] Deduced a trap composed of 32 places in 2180 ms of which 2 ms to minimize.
[2021-05-18 01:17:30] [INFO ] Deduced a trap composed of 23 places in 2085 ms of which 4 ms to minimize.
[2021-05-18 01:17:32] [INFO ] Deduced a trap composed of 23 places in 1992 ms of which 2 ms to minimize.
[2021-05-18 01:17:34] [INFO ] Deduced a trap composed of 28 places in 2013 ms of which 3 ms to minimize.
[2021-05-18 01:17:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 10
[2021-05-18 01:17:35] [INFO ] [Real]Absence check using 401 positive place invariants in 343 ms returned sat
[2021-05-18 01:17:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 01:17:39] [INFO ] [Real]Absence check using state equation in 3904 ms returned sat
[2021-05-18 01:17:41] [INFO ] Deduced a trap composed of 22 places in 1952 ms of which 2 ms to minimize.
[2021-05-18 01:17:43] [INFO ] Deduced a trap composed of 32 places in 1788 ms of which 2 ms to minimize.
[2021-05-18 01:17:45] [INFO ] Deduced a trap composed of 39 places in 1749 ms of which 2 ms to minimize.
[2021-05-18 01:17:47] [INFO ] Deduced a trap composed of 28 places in 1823 ms of which 16 ms to minimize.
[2021-05-18 01:17:49] [INFO ] Deduced a trap composed of 35 places in 1680 ms of which 2 ms to minimize.
[2021-05-18 01:17:51] [INFO ] Deduced a trap composed of 26 places in 1912 ms of which 2 ms to minimize.
[2021-05-18 01:17:53] [INFO ] Deduced a trap composed of 33 places in 1841 ms of which 2 ms to minimize.
[2021-05-18 01:17:55] [INFO ] Deduced a trap composed of 35 places in 1866 ms of which 2 ms to minimize.
[2021-05-18 01:17:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 11
[2021-05-18 01:17:56] [INFO ] [Real]Absence check using 401 positive place invariants in 355 ms returned sat
[2021-05-18 01:17:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 01:18:00] [INFO ] [Real]Absence check using state equation in 3430 ms returned sat
[2021-05-18 01:18:02] [INFO ] Deduced a trap composed of 23 places in 1957 ms of which 4 ms to minimize.
[2021-05-18 01:18:04] [INFO ] Deduced a trap composed of 24 places in 2047 ms of which 2 ms to minimize.
[2021-05-18 01:18:06] [INFO ] Deduced a trap composed of 37 places in 1876 ms of which 3 ms to minimize.
[2021-05-18 01:18:08] [INFO ] Deduced a trap composed of 26 places in 1917 ms of which 2 ms to minimize.
[2021-05-18 01:18:10] [INFO ] Deduced a trap composed of 24 places in 1801 ms of which 2 ms to minimize.
[2021-05-18 01:18:12] [INFO ] Deduced a trap composed of 22 places in 1668 ms of which 2 ms to minimize.
[2021-05-18 01:18:14] [INFO ] Deduced a trap composed of 46 places in 1807 ms of which 2 ms to minimize.
[2021-05-18 01:18:16] [INFO ] Deduced a trap composed of 39 places in 1965 ms of which 4 ms to minimize.
[2021-05-18 01:18:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 12
[2021-05-18 01:18:17] [INFO ] [Real]Absence check using 401 positive place invariants in 378 ms returned sat
[2021-05-18 01:18:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 01:18:22] [INFO ] [Real]Absence check using state equation in 4927 ms returned sat
[2021-05-18 01:18:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 01:18:23] [INFO ] [Nat]Absence check using 401 positive place invariants in 410 ms returned sat
[2021-05-18 01:18:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 01:18:28] [INFO ] [Nat]Absence check using state equation in 5044 ms returned sat
[2021-05-18 01:18:30] [INFO ] Deduced a trap composed of 21 places in 1822 ms of which 2 ms to minimize.
[2021-05-18 01:18:32] [INFO ] Deduced a trap composed of 35 places in 1898 ms of which 2 ms to minimize.
[2021-05-18 01:18:34] [INFO ] Deduced a trap composed of 28 places in 1847 ms of which 2 ms to minimize.
[2021-05-18 01:18:37] [INFO ] Deduced a trap composed of 23 places in 2008 ms of which 2 ms to minimize.
[2021-05-18 01:18:39] [INFO ] Deduced a trap composed of 53 places in 2119 ms of which 2 ms to minimize.
[2021-05-18 01:18:41] [INFO ] Deduced a trap composed of 42 places in 1975 ms of which 3 ms to minimize.
[2021-05-18 01:18:43] [INFO ] Deduced a trap composed of 33 places in 1796 ms of which 2 ms to minimize.
[2021-05-18 01:18:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 13
[2021-05-18 01:18:44] [INFO ] [Real]Absence check using 401 positive place invariants in 347 ms returned sat
[2021-05-18 01:18:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 01:18:47] [INFO ] [Real]Absence check using state equation in 3477 ms returned sat
[2021-05-18 01:18:50] [INFO ] Deduced a trap composed of 27 places in 2206 ms of which 3 ms to minimize.
[2021-05-18 01:18:52] [INFO ] Deduced a trap composed of 24 places in 2170 ms of which 3 ms to minimize.
[2021-05-18 01:18:55] [INFO ] Deduced a trap composed of 29 places in 2140 ms of which 3 ms to minimize.
[2021-05-18 01:18:57] [INFO ] Deduced a trap composed of 33 places in 2068 ms of which 4 ms to minimize.
[2021-05-18 01:18:59] [INFO ] Deduced a trap composed of 23 places in 2169 ms of which 3 ms to minimize.
[2021-05-18 01:19:02] [INFO ] Deduced a trap composed of 53 places in 1921 ms of which 2 ms to minimize.
[2021-05-18 01:19:03] [INFO ] Deduced a trap composed of 24 places in 1711 ms of which 2 ms to minimize.
[2021-05-18 01:19:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 14
[2021-05-18 01:19:04] [INFO ] [Real]Absence check using 401 positive place invariants in 321 ms returned sat
[2021-05-18 01:19:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 01:19:08] [INFO ] [Real]Absence check using state equation in 3808 ms returned sat
[2021-05-18 01:19:10] [INFO ] Deduced a trap composed of 22 places in 1492 ms of which 3 ms to minimize.
[2021-05-18 01:19:12] [INFO ] Deduced a trap composed of 22 places in 2059 ms of which 3 ms to minimize.
[2021-05-18 01:19:14] [INFO ] Deduced a trap composed of 35 places in 2148 ms of which 2 ms to minimize.
[2021-05-18 01:19:17] [INFO ] Deduced a trap composed of 34 places in 2146 ms of which 3 ms to minimize.
[2021-05-18 01:19:19] [INFO ] Deduced a trap composed of 32 places in 1751 ms of which 2 ms to minimize.
[2021-05-18 01:19:21] [INFO ] Deduced a trap composed of 28 places in 1730 ms of which 3 ms to minimize.
[2021-05-18 01:19:22] [INFO ] Deduced a trap composed of 33 places in 1674 ms of which 2 ms to minimize.
[2021-05-18 01:19:24] [INFO ] Deduced a trap composed of 25 places in 1643 ms of which 2 ms to minimize.
[2021-05-18 01:19:24] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 15
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 3914 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3914/3914 places, 3914/3914 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1102 transitions
Trivial Post-agglo rules discarded 1102 transitions
Performed 1102 trivial Post agglomeration. Transition count delta: 1102
Iterating post reduction 0 with 1102 rules applied. Total rules applied 1102 place count 3913 transition count 2811
Reduce places removed 1102 places and 0 transitions.
Iterating post reduction 1 with 1102 rules applied. Total rules applied 2204 place count 2811 transition count 2811
Performed 790 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 790 Pre rules applied. Total rules applied 2204 place count 2811 transition count 2021
Deduced a syphon composed of 790 places in 8 ms
Reduce places removed 790 places and 0 transitions.
Iterating global reduction 2 with 1580 rules applied. Total rules applied 3784 place count 2021 transition count 2021
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 3793 place count 2012 transition count 2012
Iterating global reduction 2 with 9 rules applied. Total rules applied 3802 place count 2012 transition count 2012
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 3802 place count 2012 transition count 2003
Deduced a syphon composed of 9 places in 9 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 3820 place count 2003 transition count 2003
Performed 898 Post agglomeration using F-continuation condition.Transition count delta: 898
Deduced a syphon composed of 898 places in 2 ms
Reduce places removed 898 places and 0 transitions.
Iterating global reduction 2 with 1796 rules applied. Total rules applied 5616 place count 1105 transition count 1105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5617 place count 1105 transition count 1104
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 5619 place count 1104 transition count 1103
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 5821 place count 1003 transition count 1203
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 6023 place count 902 transition count 1303
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: -94
Deduced a syphon composed of 95 places in 2 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 6213 place count 807 transition count 1397
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 6214 place count 806 transition count 1396
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6215 place count 805 transition count 1396
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 6216 place count 804 transition count 1395
Applied a total of 6216 rules in 1672 ms. Remains 804 /3914 variables (removed 3110) and now considering 1395/3914 (removed 2519) transitions.
// Phase 1: matrix 1395 rows 804 cols
[2021-05-18 01:19:27] [INFO ] Computed 400 place invariants in 4 ms
[2021-05-18 01:19:27] [INFO ] Implicit Places using invariants in 736 ms returned []
// Phase 1: matrix 1395 rows 804 cols
[2021-05-18 01:19:27] [INFO ] Computed 400 place invariants in 2 ms
[2021-05-18 01:19:29] [INFO ] Implicit Places using invariants and state equation in 1927 ms returned []
Implicit Place search using SMT with State Equation took 2665 ms to find 0 implicit places.
[2021-05-18 01:19:29] [INFO ] Redundant transitions in 119 ms returned []
// Phase 1: matrix 1395 rows 804 cols
[2021-05-18 01:19:29] [INFO ] Computed 400 place invariants in 3 ms
[2021-05-18 01:19:30] [INFO ] Dead Transitions using invariants and state equation in 1067 ms returned []
Finished structural reductions, in 1 iterations. Remains : 804/3914 places, 1395/3914 transitions.
Stuttering acceptance computed with spot in 294 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-100B-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s507 1), p1:(EQ s609 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA ShieldRVt-PT-100B-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-100B-01 finished in 5896 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||X(F((p0&&X(F(p1))))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 3914 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3914/3914 places, 3914/3914 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 3901 transition count 3901
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 3901 transition count 3901
Applied a total of 26 rules in 1336 ms. Remains 3901 /3914 variables (removed 13) and now considering 3901/3914 (removed 13) transitions.
// Phase 1: matrix 3901 rows 3901 cols
[2021-05-18 01:19:32] [INFO ] Computed 401 place invariants in 12 ms
[2021-05-18 01:19:33] [INFO ] Implicit Places using invariants in 1369 ms returned []
// Phase 1: matrix 3901 rows 3901 cols
[2021-05-18 01:19:33] [INFO ] Computed 401 place invariants in 11 ms
[2021-05-18 01:19:35] [INFO ] Implicit Places using invariants and state equation in 1442 ms returned []
Implicit Place search using SMT with State Equation took 2813 ms to find 0 implicit places.
// Phase 1: matrix 3901 rows 3901 cols
[2021-05-18 01:19:35] [INFO ] Computed 401 place invariants in 11 ms
[2021-05-18 01:19:39] [INFO ] Dead Transitions using invariants and state equation in 3984 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3901/3914 places, 3901/3914 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-100B-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s3020 1), p1:(EQ s1328 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 231 reset in 692 ms.
Product exploration explored 100000 steps with 231 reset in 634 ms.
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 229 reset in 463 ms.
Product exploration explored 100000 steps with 230 reset in 501 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 2 out of 3901 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 3901/3901 places, 3901/3901 transitions.
Performed 1097 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1097 rules applied. Total rules applied 1097 place count 3901 transition count 3901
Performed 501 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 501 Pre rules applied. Total rules applied 1097 place count 3901 transition count 4601
Deduced a syphon composed of 1598 places in 18 ms
Iterating global reduction 1 with 501 rules applied. Total rules applied 1598 place count 3901 transition count 4601
Performed 1098 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2696 places in 12 ms
Iterating global reduction 1 with 1098 rules applied. Total rules applied 2696 place count 3901 transition count 4601
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2697 place count 3901 transition count 4600
Renaming transitions due to excessive name length > 1024 char.
Discarding 698 places :
Symmetric choice reduction at 2 with 698 rule applications. Total rules 3395 place count 3203 transition count 3902
Deduced a syphon composed of 1998 places in 11 ms
Iterating global reduction 2 with 698 rules applied. Total rules applied 4093 place count 3203 transition count 3902
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1999 places in 16 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 4094 place count 3203 transition count 3902
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 4096 place count 3201 transition count 3900
Deduced a syphon composed of 1997 places in 11 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 4098 place count 3201 transition count 3900
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -803
Deduced a syphon composed of 2098 places in 14 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 4199 place count 3201 transition count 4703
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 4300 place count 3100 transition count 4501
Deduced a syphon composed of 1997 places in 12 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 4401 place count 3100 transition count 4501
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -814
Deduced a syphon composed of 2098 places in 10 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 4502 place count 3100 transition count 5315
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 4603 place count 2999 transition count 5113
Deduced a syphon composed of 1997 places in 9 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 4704 place count 2999 transition count 5113
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: -783
Deduced a syphon composed of 2095 places in 2 ms
Iterating global reduction 2 with 98 rules applied. Total rules applied 4802 place count 2999 transition count 5896
Discarding 98 places :
Symmetric choice reduction at 2 with 98 rule applications. Total rules 4900 place count 2901 transition count 5700
Deduced a syphon composed of 1997 places in 2 ms
Iterating global reduction 2 with 98 rules applied. Total rules applied 4998 place count 2901 transition count 5700
Deduced a syphon composed of 1997 places in 1 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 5007 place count 2901 transition count 5691
Deduced a syphon composed of 1997 places in 2 ms
Applied a total of 5007 rules in 5558 ms. Remains 2901 /3901 variables (removed 1000) and now considering 5691/3901 (removed -1790) transitions.
[2021-05-18 01:19:48] [INFO ] Redundant transitions in 378 ms returned []
// Phase 1: matrix 5691 rows 2901 cols
[2021-05-18 01:19:48] [INFO ] Computed 401 place invariants in 69 ms
[2021-05-18 01:19:53] [INFO ] Dead Transitions using invariants and state equation in 4951 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2901/3901 places, 5691/3901 transitions.
Product exploration explored 100000 steps with 229 reset in 805 ms.
Product exploration explored 100000 steps with 228 reset in 784 ms.
[2021-05-18 01:19:55] [INFO ] Flatten gal took : 150 ms
[2021-05-18 01:19:55] [INFO ] Flatten gal took : 147 ms
[2021-05-18 01:19:55] [INFO ] Time to serialize gal into /tmp/LTL34523105350980321.gal : 70 ms
[2021-05-18 01:19:55] [INFO ] Time to serialize properties into /tmp/LTL13597113762062153084.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/LTL34523105350980321.gal, -t, CGAL, -LTL, /tmp/LTL13597113762062153084.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/LTL34523105350980321.gal -t CGAL -LTL /tmp/LTL13597113762062153084.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(("(p3864==1)")||(X(F(("(p3864==1)")&&(X(F("(p1681==0)")))))))))
Formula 0 simplified : !G("(p3864==1)" | XF("(p3864==1)" & XF"(p1681==0)"))
Detected timeout of ITS tools.
[2021-05-18 01:20:10] [INFO ] Flatten gal took : 116 ms
[2021-05-18 01:20:10] [INFO ] Applying decomposition
[2021-05-18 01:20:10] [INFO ] Flatten gal took : 124 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/graph14225936437463659380.txt, -o, /tmp/graph14225936437463659380.bin, -w, /tmp/graph14225936437463659380.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/graph14225936437463659380.bin, -l, -1, -v, -w, /tmp/graph14225936437463659380.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 01:20:11] [INFO ] Decomposing Gal with order
[2021-05-18 01:20:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 01:20:12] [INFO ] Removed a total of 996 redundant transitions.
[2021-05-18 01:20:12] [INFO ] Flatten gal took : 408 ms
[2021-05-18 01:20:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 28 ms.
[2021-05-18 01:20:13] [INFO ] Time to serialize gal into /tmp/LTL9761475081021368334.gal : 58 ms
[2021-05-18 01:20:13] [INFO ] Time to serialize properties into /tmp/LTL2494699075769385734.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/LTL9761475081021368334.gal, -t, CGAL, -LTL, /tmp/LTL2494699075769385734.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/LTL9761475081021368334.gal -t CGAL -LTL /tmp/LTL2494699075769385734.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(("(i43.u1191.p3864==1)")||(X(F(("(i43.u1191.p3864==1)")&&(X(F("(i24.i1.i2.u526.p1681==0)")))))))))
Formula 0 simplified : !G("(i43.u1191.p3864==1)" | XF("(i43.u1191.p3864==1)" & XF"(i24.i1.i2.u526.p1681==0)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14065330922360648265
[2021-05-18 01:20:28] [INFO ] Built C files in 70ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14065330922360648265
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin14065330922360648265]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin14065330922360648265] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin14065330922360648265] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property ShieldRVt-PT-100B-03 finished in 57985 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F((p0||X(p1)))&&G(p2)))], workingDir=/home/mcc/execution]
Support contains 4 out of 3914 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3914/3914 places, 3914/3914 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 3902 transition count 3902
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 3902 transition count 3902
Applied a total of 24 rules in 920 ms. Remains 3902 /3914 variables (removed 12) and now considering 3902/3914 (removed 12) transitions.
// Phase 1: matrix 3902 rows 3902 cols
[2021-05-18 01:20:30] [INFO ] Computed 401 place invariants in 18 ms
[2021-05-18 01:20:31] [INFO ] Implicit Places using invariants in 1699 ms returned []
// Phase 1: matrix 3902 rows 3902 cols
[2021-05-18 01:20:31] [INFO ] Computed 401 place invariants in 16 ms
[2021-05-18 01:20:33] [INFO ] Implicit Places using invariants and state equation in 1463 ms returned []
Implicit Place search using SMT with State Equation took 3167 ms to find 0 implicit places.
// Phase 1: matrix 3902 rows 3902 cols
[2021-05-18 01:20:33] [INFO ] Computed 401 place invariants in 11 ms
[2021-05-18 01:20:36] [INFO ] Dead Transitions using invariants and state equation in 3638 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3902/3914 places, 3902/3914 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), true]
Running random walk in product with property : ShieldRVt-PT-100B-04 automaton TGBA [mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(OR (AND p0 p2) (AND p2 p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p2:(AND (OR (NEQ s1299 1) (NEQ s1657 1)) (NEQ s1023 1)), p0:(EQ s2397 1), p1:(EQ s1299 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 34286 steps with 0 reset in 474 ms.
FORMULA ShieldRVt-PT-100B-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-100B-04 finished in 8393 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G((p0||(G(F(p1)) U p2)))||G(F(p0)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 3914 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3914/3914 places, 3914/3914 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1102 transitions
Trivial Post-agglo rules discarded 1102 transitions
Performed 1102 trivial Post agglomeration. Transition count delta: 1102
Iterating post reduction 0 with 1102 rules applied. Total rules applied 1102 place count 3913 transition count 2811
Reduce places removed 1102 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1103 rules applied. Total rules applied 2205 place count 2811 transition count 2810
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2206 place count 2810 transition count 2810
Performed 790 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 790 Pre rules applied. Total rules applied 2206 place count 2810 transition count 2020
Deduced a syphon composed of 790 places in 9 ms
Reduce places removed 790 places and 0 transitions.
Iterating global reduction 3 with 1580 rules applied. Total rules applied 3786 place count 2020 transition count 2020
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 3793 place count 2013 transition count 2013
Iterating global reduction 3 with 7 rules applied. Total rules applied 3800 place count 2013 transition count 2013
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 3800 place count 2013 transition count 2006
Deduced a syphon composed of 7 places in 8 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 3814 place count 2006 transition count 2006
Performed 898 Post agglomeration using F-continuation condition.Transition count delta: 898
Deduced a syphon composed of 898 places in 0 ms
Reduce places removed 898 places and 0 transitions.
Iterating global reduction 3 with 1796 rules applied. Total rules applied 5610 place count 1108 transition count 1108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5611 place count 1108 transition count 1107
Renaming transitions due to excessive name length > 1024 char.
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 4 with 2 rules applied. Total rules applied 5613 place count 1107 transition count 1106
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 5815 place count 1006 transition count 1206
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -101
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 6017 place count 905 transition count 1307
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -97
Deduced a syphon composed of 97 places in 0 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 6211 place count 808 transition count 1404
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 6212 place count 807 transition count 1403
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6213 place count 806 transition count 1403
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 6214 place count 805 transition count 1402
Applied a total of 6214 rules in 1135 ms. Remains 805 /3914 variables (removed 3109) and now considering 1402/3914 (removed 2512) transitions.
// Phase 1: matrix 1402 rows 805 cols
[2021-05-18 01:20:38] [INFO ] Computed 400 place invariants in 3 ms
[2021-05-18 01:20:39] [INFO ] Implicit Places using invariants in 915 ms returned []
// Phase 1: matrix 1402 rows 805 cols
[2021-05-18 01:20:39] [INFO ] Computed 400 place invariants in 2 ms
[2021-05-18 01:20:40] [INFO ] State equation strengthened by 9 read => feed constraints.
[2021-05-18 01:20:41] [INFO ] Implicit Places using invariants and state equation in 2262 ms returned []
Implicit Place search using SMT with State Equation took 3181 ms to find 0 implicit places.
[2021-05-18 01:20:41] [INFO ] Redundant transitions in 44 ms returned []
// Phase 1: matrix 1402 rows 805 cols
[2021-05-18 01:20:41] [INFO ] Computed 400 place invariants in 2 ms
[2021-05-18 01:20:42] [INFO ] Dead Transitions using invariants and state equation in 1016 ms returned []
Finished structural reductions, in 1 iterations. Remains : 805/3914 places, 1402/3914 transitions.
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-100B-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s302 1), p2:(EQ s494 1), p1:(EQ s248 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-100B-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-100B-05 finished in 5608 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(G(p0))||(p1&&X(p2)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 3914 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3914/3914 places, 3914/3914 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 3901 transition count 3901
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 3901 transition count 3901
Applied a total of 26 rules in 1029 ms. Remains 3901 /3914 variables (removed 13) and now considering 3901/3914 (removed 13) transitions.
// Phase 1: matrix 3901 rows 3901 cols
[2021-05-18 01:20:44] [INFO ] Computed 401 place invariants in 11 ms
[2021-05-18 01:20:45] [INFO ] Implicit Places using invariants in 1372 ms returned []
// Phase 1: matrix 3901 rows 3901 cols
[2021-05-18 01:20:45] [INFO ] Computed 401 place invariants in 12 ms
[2021-05-18 01:20:46] [INFO ] Implicit Places using invariants and state equation in 1356 ms returned []
Implicit Place search using SMT with State Equation took 2756 ms to find 0 implicit places.
// Phase 1: matrix 3901 rows 3901 cols
[2021-05-18 01:20:46] [INFO ] Computed 401 place invariants in 11 ms
[2021-05-18 01:20:50] [INFO ] Dead Transitions using invariants and state equation in 3766 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3901/3914 places, 3901/3914 transitions.
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : ShieldRVt-PT-100B-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=p1, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(AND (NEQ s2855 0) (NEQ s2430 1)), p2:(NEQ s58 1), p1:(NEQ s2855 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 2521 ms.
Product exploration explored 100000 steps with 33333 reset in 2488 ms.
Knowledge obtained : [(NOT p0), p2, p1]
Stuttering acceptance computed with spot in 174 ms :[true, (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Product exploration explored 100000 steps with 33333 reset in 2466 ms.
Product exploration explored 100000 steps with 33333 reset in 2465 ms.
Applying partial POR strategy [true, true, true, false, false]
Stuttering acceptance computed with spot in 152 ms :[true, (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Support contains 3 out of 3901 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 3901/3901 places, 3901/3901 transitions.
Performed 1097 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1097 rules applied. Total rules applied 1097 place count 3901 transition count 3901
Performed 501 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 501 Pre rules applied. Total rules applied 1097 place count 3901 transition count 4601
Deduced a syphon composed of 1598 places in 51 ms
Iterating global reduction 1 with 501 rules applied. Total rules applied 1598 place count 3901 transition count 4601
Performed 1097 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2695 places in 13 ms
Iterating global reduction 1 with 1097 rules applied. Total rules applied 2695 place count 3901 transition count 4601
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2696 place count 3901 transition count 4600
Renaming transitions due to excessive name length > 1024 char.
Discarding 699 places :
Symmetric choice reduction at 2 with 699 rule applications. Total rules 3395 place count 3202 transition count 3901
Deduced a syphon composed of 1996 places in 11 ms
Iterating global reduction 2 with 699 rules applied. Total rules applied 4094 place count 3202 transition count 3901
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1997 places in 11 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 4095 place count 3202 transition count 3901
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 4097 place count 3200 transition count 3899
Deduced a syphon composed of 1995 places in 11 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 4099 place count 3200 transition count 3899
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -803
Deduced a syphon composed of 2096 places in 14 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 4200 place count 3200 transition count 4702
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 4301 place count 3099 transition count 4500
Deduced a syphon composed of 1995 places in 13 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 4402 place count 3099 transition count 4500
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -814
Deduced a syphon composed of 2096 places in 10 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 4503 place count 3099 transition count 5314
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 4604 place count 2998 transition count 5112
Deduced a syphon composed of 1995 places in 9 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 4705 place count 2998 transition count 5112
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -781
Deduced a syphon composed of 2092 places in 3 ms
Iterating global reduction 2 with 97 rules applied. Total rules applied 4802 place count 2998 transition count 5893
Discarding 97 places :
Symmetric choice reduction at 2 with 97 rule applications. Total rules 4899 place count 2901 transition count 5699
Deduced a syphon composed of 1995 places in 2 ms
Iterating global reduction 2 with 97 rules applied. Total rules applied 4996 place count 2901 transition count 5699
Deduced a syphon composed of 1995 places in 2 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 5005 place count 2901 transition count 5690
Deduced a syphon composed of 1995 places in 1 ms
Applied a total of 5005 rules in 3741 ms. Remains 2901 /3901 variables (removed 1000) and now considering 5690/3901 (removed -1789) transitions.
[2021-05-18 01:21:06] [INFO ] Redundant transitions in 799 ms returned []
// Phase 1: matrix 5690 rows 2901 cols
[2021-05-18 01:21:06] [INFO ] Computed 401 place invariants in 40 ms
[2021-05-18 01:21:11] [INFO ] Dead Transitions using invariants and state equation in 5940 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2901/3901 places, 5690/3901 transitions.
Product exploration timeout after 80130 steps with 26710 reset in 10001 ms.
Product exploration timeout after 77350 steps with 25783 reset in 10001 ms.
[2021-05-18 01:21:32] [INFO ] Flatten gal took : 109 ms
[2021-05-18 01:21:32] [INFO ] Flatten gal took : 112 ms
[2021-05-18 01:21:32] [INFO ] Time to serialize gal into /tmp/LTL9197747035325433425.gal : 27 ms
[2021-05-18 01:21:32] [INFO ] Time to serialize properties into /tmp/LTL15037132415695744803.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/LTL9197747035325433425.gal, -t, CGAL, -LTL, /tmp/LTL15037132415695744803.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/LTL9197747035325433425.gal -t CGAL -LTL /tmp/LTL15037132415695744803.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((X(G("((p3651!=0)&&(p3102!=1))")))||(("(p3651!=1)")&&(X("(p58!=1)"))))))
Formula 0 simplified : !X(XG"((p3651!=0)&&(p3102!=1))" | ("(p3651!=1)" & X"(p58!=1)"))
Detected timeout of ITS tools.
[2021-05-18 01:21:47] [INFO ] Flatten gal took : 102 ms
[2021-05-18 01:21:47] [INFO ] Applying decomposition
[2021-05-18 01:21:47] [INFO ] Flatten gal took : 108 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/graph14671239351573925591.txt, -o, /tmp/graph14671239351573925591.bin, -w, /tmp/graph14671239351573925591.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/graph14671239351573925591.bin, -l, -1, -v, -w, /tmp/graph14671239351573925591.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 01:21:47] [INFO ] Decomposing Gal with order
[2021-05-18 01:21:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 01:21:49] [INFO ] Removed a total of 991 redundant transitions.
[2021-05-18 01:21:49] [INFO ] Flatten gal took : 224 ms
[2021-05-18 01:21:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 18 ms.
[2021-05-18 01:21:49] [INFO ] Time to serialize gal into /tmp/LTL3481134197562995866.gal : 39 ms
[2021-05-18 01:21:49] [INFO ] Time to serialize properties into /tmp/LTL4900470940527201362.ltl : 0 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/LTL3481134197562995866.gal, -t, CGAL, -LTL, /tmp/LTL4900470940527201362.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/LTL3481134197562995866.gal -t CGAL -LTL /tmp/LTL4900470940527201362.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((X(G("((i43.i0.i2.u1127.p3651!=0)&&(i38.i1.i1.u959.p3102!=1))")))||(("(i43.i0.i2.u1127.p3651!=1)")&&(X("(i28.i0.i0.u25.p58!=1)"))))))
Formula 0 simplified : !X(XG"((i43.i0.i2.u1127.p3651!=0)&&(i38.i1.i1.u959.p3102!=1))" | ("(i43.i0.i2.u1127.p3651!=1)" & X"(i28.i0.i0.u25.p58!=1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18099414138175386897
[2021-05-18 01:22:04] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18099414138175386897
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin18099414138175386897]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin18099414138175386897] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin18099414138175386897] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property ShieldRVt-PT-100B-08 finished in 82164 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X(X(F(!p0)))))], workingDir=/home/mcc/execution]
Support contains 1 out of 3914 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3914/3914 places, 3914/3914 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 3901 transition count 3901
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 3901 transition count 3901
Applied a total of 26 rules in 945 ms. Remains 3901 /3914 variables (removed 13) and now considering 3901/3914 (removed 13) transitions.
// Phase 1: matrix 3901 rows 3901 cols
[2021-05-18 01:22:06] [INFO ] Computed 401 place invariants in 25 ms
[2021-05-18 01:22:07] [INFO ] Implicit Places using invariants in 1284 ms returned []
// Phase 1: matrix 3901 rows 3901 cols
[2021-05-18 01:22:07] [INFO ] Computed 401 place invariants in 10 ms
[2021-05-18 01:22:08] [INFO ] Implicit Places using invariants and state equation in 1270 ms returned []
Implicit Place search using SMT with State Equation took 2563 ms to find 0 implicit places.
// Phase 1: matrix 3901 rows 3901 cols
[2021-05-18 01:22:08] [INFO ] Computed 401 place invariants in 10 ms
[2021-05-18 01:22:12] [INFO ] Dead Transitions using invariants and state equation in 3452 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3901/3914 places, 3901/3914 transitions.
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p0), p0, p0]
Running random walk in product with property : ShieldRVt-PT-100B-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s1995 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 184 reset in 777 ms.
Product exploration explored 100000 steps with 226 reset in 716 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 143 ms :[true, (NOT p0), p0, p0]
Product exploration explored 100000 steps with 242 reset in 638 ms.
Product exploration explored 100000 steps with 212 reset in 711 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), p0, p0]
Support contains 1 out of 3901 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 3901/3901 places, 3901/3901 transitions.
Performed 1098 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1098 rules applied. Total rules applied 1098 place count 3901 transition count 3901
Performed 501 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 501 Pre rules applied. Total rules applied 1098 place count 3901 transition count 4601
Deduced a syphon composed of 1599 places in 19 ms
Iterating global reduction 1 with 501 rules applied. Total rules applied 1599 place count 3901 transition count 4601
Performed 1098 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2697 places in 13 ms
Iterating global reduction 1 with 1098 rules applied. Total rules applied 2697 place count 3901 transition count 4601
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2698 place count 3901 transition count 4600
Renaming transitions due to excessive name length > 1024 char.
Discarding 699 places :
Symmetric choice reduction at 2 with 699 rule applications. Total rules 3397 place count 3202 transition count 3901
Deduced a syphon composed of 1998 places in 13 ms
Iterating global reduction 2 with 699 rules applied. Total rules applied 4096 place count 3202 transition count 3901
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1999 places in 12 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 4097 place count 3202 transition count 3901
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 4099 place count 3200 transition count 3899
Deduced a syphon composed of 1997 places in 11 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 4101 place count 3200 transition count 3899
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -803
Deduced a syphon composed of 2098 places in 14 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 4202 place count 3200 transition count 4702
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 4303 place count 3099 transition count 4500
Deduced a syphon composed of 1997 places in 13 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 4404 place count 3099 transition count 4500
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -814
Deduced a syphon composed of 2098 places in 10 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 4505 place count 3099 transition count 5314
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 4606 place count 2998 transition count 5112
Deduced a syphon composed of 1997 places in 9 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 4707 place count 2998 transition count 5112
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: -783
Deduced a syphon composed of 2095 places in 2 ms
Iterating global reduction 2 with 98 rules applied. Total rules applied 4805 place count 2998 transition count 5895
Discarding 98 places :
Symmetric choice reduction at 2 with 98 rule applications. Total rules 4903 place count 2900 transition count 5699
Deduced a syphon composed of 1997 places in 1 ms
Iterating global reduction 2 with 98 rules applied. Total rules applied 5001 place count 2900 transition count 5699
Deduced a syphon composed of 1997 places in 1 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 5010 place count 2900 transition count 5690
Deduced a syphon composed of 1997 places in 1 ms
Applied a total of 5010 rules in 4074 ms. Remains 2900 /3901 variables (removed 1001) and now considering 5690/3901 (removed -1789) transitions.
[2021-05-18 01:22:20] [INFO ] Redundant transitions in 615 ms returned []
// Phase 1: matrix 5690 rows 2900 cols
[2021-05-18 01:22:20] [INFO ] Computed 401 place invariants in 62 ms
[2021-05-18 01:22:24] [INFO ] Dead Transitions using invariants and state equation in 4163 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2900/3901 places, 5690/3901 transitions.
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-100B-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-100B-09 finished in 19286 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0&&(p1 U (p2||G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 3914 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3914/3914 places, 3914/3914 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1101 transitions
Trivial Post-agglo rules discarded 1101 transitions
Performed 1101 trivial Post agglomeration. Transition count delta: 1101
Iterating post reduction 0 with 1101 rules applied. Total rules applied 1101 place count 3913 transition count 2812
Reduce places removed 1101 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1102 rules applied. Total rules applied 2203 place count 2812 transition count 2811
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2204 place count 2811 transition count 2811
Performed 790 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 790 Pre rules applied. Total rules applied 2204 place count 2811 transition count 2021
Deduced a syphon composed of 790 places in 8 ms
Reduce places removed 790 places and 0 transitions.
Iterating global reduction 3 with 1580 rules applied. Total rules applied 3784 place count 2021 transition count 2021
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 3792 place count 2013 transition count 2013
Iterating global reduction 3 with 8 rules applied. Total rules applied 3800 place count 2013 transition count 2013
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 3800 place count 2013 transition count 2005
Deduced a syphon composed of 8 places in 8 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 3816 place count 2005 transition count 2005
Performed 899 Post agglomeration using F-continuation condition.Transition count delta: 899
Deduced a syphon composed of 899 places in 0 ms
Reduce places removed 899 places and 0 transitions.
Iterating global reduction 3 with 1798 rules applied. Total rules applied 5614 place count 1106 transition count 1106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5615 place count 1106 transition count 1105
Renaming transitions due to excessive name length > 1024 char.
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 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 5617 place count 1105 transition count 1104
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 5819 place count 1004 transition count 1203
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 6021 place count 903 transition count 1303
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: -94
Deduced a syphon composed of 95 places in 1 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 4 with 190 rules applied. Total rules applied 6211 place count 808 transition count 1397
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 6212 place count 807 transition count 1396
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6213 place count 806 transition count 1396
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 6214 place count 805 transition count 1395
Applied a total of 6214 rules in 979 ms. Remains 805 /3914 variables (removed 3109) and now considering 1395/3914 (removed 2519) transitions.
// Phase 1: matrix 1395 rows 805 cols
[2021-05-18 01:22:25] [INFO ] Computed 400 place invariants in 2 ms
[2021-05-18 01:22:26] [INFO ] Implicit Places using invariants in 795 ms returned []
// Phase 1: matrix 1395 rows 805 cols
[2021-05-18 01:22:26] [INFO ] Computed 400 place invariants in 2 ms
[2021-05-18 01:22:28] [INFO ] Implicit Places using invariants and state equation in 1850 ms returned []
Implicit Place search using SMT with State Equation took 2647 ms to find 0 implicit places.
[2021-05-18 01:22:28] [INFO ] Redundant transitions in 33 ms returned []
// Phase 1: matrix 1395 rows 805 cols
[2021-05-18 01:22:28] [INFO ] Computed 400 place invariants in 2 ms
[2021-05-18 01:22:29] [INFO ] Dead Transitions using invariants and state equation in 1533 ms returned []
Finished structural reductions, in 1 iterations. Remains : 805/3914 places, 1395/3914 transitions.
Stuttering acceptance computed with spot in 40 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldRVt-PT-100B-10 automaton TGBA [mat=[[{ cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p2 p0) (AND p1 p0)), acceptance={} source=0 dest: 0}]], initial=0, aps=[p2:(AND (NEQ s788 1) (NEQ s188 1)), p1:(NEQ s188 1), p0:(OR (EQ s188 1) (AND (EQ s352 1) (EQ s788 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-100B-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-100B-10 finished in 5264 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0&&F(p1)) U (p1||X((p2&&X(p0))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 3914 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3914/3914 places, 3914/3914 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 3902 transition count 3902
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 3902 transition count 3902
Applied a total of 24 rules in 1233 ms. Remains 3902 /3914 variables (removed 12) and now considering 3902/3914 (removed 12) transitions.
// Phase 1: matrix 3902 rows 3902 cols
[2021-05-18 01:22:31] [INFO ] Computed 401 place invariants in 10 ms
[2021-05-18 01:22:32] [INFO ] Implicit Places using invariants in 1604 ms returned []
// Phase 1: matrix 3902 rows 3902 cols
[2021-05-18 01:22:32] [INFO ] Computed 401 place invariants in 11 ms
[2021-05-18 01:22:34] [INFO ] Implicit Places using invariants and state equation in 1751 ms returned []
Implicit Place search using SMT with State Equation took 3357 ms to find 0 implicit places.
// Phase 1: matrix 3902 rows 3902 cols
[2021-05-18 01:22:34] [INFO ] Computed 401 place invariants in 11 ms
[2021-05-18 01:22:38] [INFO ] Dead Transitions using invariants and state equation in 4211 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3902/3914 places, 3902/3914 transitions.
Stuttering acceptance computed with spot in 336 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-100B-11 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=p2, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=2 dest: 8}], [{ cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}], [{ cond=(NOT p1), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=8 dest: 4}]], initial=0, aps=[p1:(EQ s3571 1), p0:(EQ s1312 1), p2:(EQ s1539 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, 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-100B-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-100B-11 finished in 9216 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 3914 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3914/3914 places, 3914/3914 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 3901 transition count 3901
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 3901 transition count 3901
Applied a total of 26 rules in 969 ms. Remains 3901 /3914 variables (removed 13) and now considering 3901/3914 (removed 13) transitions.
// Phase 1: matrix 3901 rows 3901 cols
[2021-05-18 01:22:40] [INFO ] Computed 401 place invariants in 10 ms
[2021-05-18 01:22:40] [INFO ] Implicit Places using invariants in 691 ms returned []
// Phase 1: matrix 3901 rows 3901 cols
[2021-05-18 01:22:40] [INFO ] Computed 401 place invariants in 10 ms
[2021-05-18 01:22:42] [INFO ] Implicit Places using invariants and state equation in 1472 ms returned []
Implicit Place search using SMT with State Equation took 2165 ms to find 0 implicit places.
// Phase 1: matrix 3901 rows 3901 cols
[2021-05-18 01:22:42] [INFO ] Computed 401 place invariants in 10 ms
[2021-05-18 01:22:46] [INFO ] Dead Transitions using invariants and state equation in 4544 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3901/3914 places, 3901/3914 transitions.
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-100B-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s1320 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1292 steps with 0 reset in 28 ms.
FORMULA ShieldRVt-PT-100B-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-100B-13 finished in 7858 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(p0) U (p0||X((p1 U X(G(p2)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 3914 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3914/3914 places, 3914/3914 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 3903 transition count 3903
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 3903 transition count 3903
Applied a total of 22 rules in 930 ms. Remains 3903 /3914 variables (removed 11) and now considering 3903/3914 (removed 11) transitions.
// Phase 1: matrix 3903 rows 3903 cols
[2021-05-18 01:22:47] [INFO ] Computed 401 place invariants in 15 ms
[2021-05-18 01:22:48] [INFO ] Implicit Places using invariants in 702 ms returned []
// Phase 1: matrix 3903 rows 3903 cols
[2021-05-18 01:22:48] [INFO ] Computed 401 place invariants in 9 ms
[2021-05-18 01:22:49] [INFO ] Implicit Places using invariants and state equation in 676 ms returned []
Implicit Place search using SMT with State Equation took 1380 ms to find 0 implicit places.
// Phase 1: matrix 3903 rows 3903 cols
[2021-05-18 01:22:49] [INFO ] Computed 401 place invariants in 10 ms
[2021-05-18 01:22:53] [INFO ] Dead Transitions using invariants and state equation in 4383 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3903/3914 places, 3903/3914 transitions.
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-100B-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 3}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s453 1), p1:(EQ s1406 0), p2:(NEQ s208 1)], 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 1150 ms.
Product exploration explored 100000 steps with 1 reset in 1665 ms.
Knowledge obtained : [(NOT p0), p1, p2]
Stuttering acceptance computed with spot in 254 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 2 reset in 1333 ms.
Product exploration explored 100000 steps with 2 reset in 1567 ms.
Applying partial POR strategy [false, false, true, false, true, false, false]
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 3903 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 3903/3903 places, 3903/3903 transitions.
Performed 1097 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1097 rules applied. Total rules applied 1097 place count 3903 transition count 3903
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 500 Pre rules applied. Total rules applied 1097 place count 3903 transition count 4597
Deduced a syphon composed of 1597 places in 18 ms
Iterating global reduction 1 with 500 rules applied. Total rules applied 1597 place count 3903 transition count 4597
Performed 1100 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2697 places in 13 ms
Iterating global reduction 1 with 1100 rules applied. Total rules applied 2697 place count 3903 transition count 4597
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2698 place count 3903 transition count 4596
Renaming transitions due to excessive name length > 1024 char.
Discarding 699 places :
Symmetric choice reduction at 2 with 699 rule applications. Total rules 3397 place count 3204 transition count 3897
Deduced a syphon composed of 1998 places in 11 ms
Iterating global reduction 2 with 699 rules applied. Total rules applied 4096 place count 3204 transition count 3897
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1999 places in 11 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 4097 place count 3204 transition count 3897
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 4099 place count 3202 transition count 3895
Deduced a syphon composed of 1997 places in 11 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 4101 place count 3202 transition count 3895
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -802
Deduced a syphon composed of 2098 places in 12 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 4202 place count 3202 transition count 4697
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 4303 place count 3101 transition count 4495
Deduced a syphon composed of 1997 places in 12 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 4404 place count 3101 transition count 4495
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -803
Deduced a syphon composed of 2098 places in 9 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 4505 place count 3101 transition count 5298
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 4606 place count 3000 transition count 5096
Deduced a syphon composed of 1997 places in 8 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 4707 place count 3000 transition count 5096
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: -805
Deduced a syphon composed of 2097 places in 1 ms
Iterating global reduction 2 with 100 rules applied. Total rules applied 4807 place count 3000 transition count 5901
Discarding 100 places :
Symmetric choice reduction at 2 with 100 rule applications. Total rules 4907 place count 2900 transition count 5701
Deduced a syphon composed of 1997 places in 2 ms
Iterating global reduction 2 with 100 rules applied. Total rules applied 5007 place count 2900 transition count 5701
Deduced a syphon composed of 1997 places in 2 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 5016 place count 2900 transition count 5692
Deduced a syphon composed of 1997 places in 1 ms
Applied a total of 5016 rules in 4115 ms. Remains 2900 /3903 variables (removed 1003) and now considering 5692/3903 (removed -1789) transitions.
[2021-05-18 01:23:05] [INFO ] Redundant transitions in 577 ms returned []
// Phase 1: matrix 5692 rows 2900 cols
[2021-05-18 01:23:05] [INFO ] Computed 401 place invariants in 62 ms
[2021-05-18 01:23:10] [INFO ] Dead Transitions using invariants and state equation in 5062 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2900/3903 places, 5692/3903 transitions.
Product exploration explored 100000 steps with 0 reset in 1025 ms.
Product exploration explored 100000 steps with 1 reset in 1330 ms.
[2021-05-18 01:23:12] [INFO ] Flatten gal took : 99 ms
[2021-05-18 01:23:12] [INFO ] Flatten gal took : 101 ms
[2021-05-18 01:23:12] [INFO ] Time to serialize gal into /tmp/LTL3820923847027429618.gal : 17 ms
[2021-05-18 01:23:12] [INFO ] Time to serialize properties into /tmp/LTL4506977423966344736.ltl : 0 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/LTL3820923847027429618.gal, -t, CGAL, -LTL, /tmp/LTL4506977423966344736.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/LTL3820923847027429618.gal -t CGAL -LTL /tmp/LTL4506977423966344736.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X("(p551==1)"))U(("(p551==1)")||(X(("(p1779==0)")U(X(G("(p237!=1)"))))))))
Formula 0 simplified : !(X"(p551==1)" U ("(p551==1)" | X("(p1779==0)" U XG"(p237!=1)")))
Detected timeout of ITS tools.
[2021-05-18 01:23:28] [INFO ] Flatten gal took : 100 ms
[2021-05-18 01:23:28] [INFO ] Applying decomposition
[2021-05-18 01:23:28] [INFO ] Flatten gal took : 102 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/graph11047696574117939229.txt, -o, /tmp/graph11047696574117939229.bin, -w, /tmp/graph11047696574117939229.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/graph11047696574117939229.bin, -l, -1, -v, -w, /tmp/graph11047696574117939229.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 01:23:28] [INFO ] Decomposing Gal with order
[2021-05-18 01:23:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 01:23:29] [INFO ] Removed a total of 999 redundant transitions.
[2021-05-18 01:23:29] [INFO ] Flatten gal took : 208 ms
[2021-05-18 01:23:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 18 ms.
[2021-05-18 01:23:29] [INFO ] Time to serialize gal into /tmp/LTL11262962051429067525.gal : 38 ms
[2021-05-18 01:23:29] [INFO ] Time to serialize properties into /tmp/LTL14118967312492785924.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/LTL11262962051429067525.gal, -t, CGAL, -LTL, /tmp/LTL14118967312492785924.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/LTL11262962051429067525.gal -t CGAL -LTL /tmp/LTL14118967312492785924.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((X("(i16.u182.p551==1)"))U(("(i16.u182.p551==1)")||(X(("(i6.i0.i1.u557.p1779==0)")U(X(G("(i13.u84.p237!=1)"))))))))
Formula 0 simplified : !(X"(i16.u182.p551==1)" U ("(i16.u182.p551==1)" | X("(i6.i0.i1.u557.p1779==0)" U XG"(i13.u84.p237!=1)")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3947234283701534762
[2021-05-18 01:23:44] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3947234283701534762
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin3947234283701534762]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin3947234283701534762] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin3947234283701534762] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property ShieldRVt-PT-100B-14 finished in 58805 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 3914 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3914/3914 places, 3914/3914 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1104 transitions
Trivial Post-agglo rules discarded 1104 transitions
Performed 1104 trivial Post agglomeration. Transition count delta: 1104
Iterating post reduction 0 with 1104 rules applied. Total rules applied 1104 place count 3913 transition count 2809
Reduce places removed 1104 places and 0 transitions.
Iterating post reduction 1 with 1104 rules applied. Total rules applied 2208 place count 2809 transition count 2809
Performed 790 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 790 Pre rules applied. Total rules applied 2208 place count 2809 transition count 2019
Deduced a syphon composed of 790 places in 8 ms
Reduce places removed 790 places and 0 transitions.
Iterating global reduction 2 with 1580 rules applied. Total rules applied 3788 place count 2019 transition count 2019
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 3796 place count 2011 transition count 2011
Iterating global reduction 2 with 8 rules applied. Total rules applied 3804 place count 2011 transition count 2011
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 3804 place count 2011 transition count 2003
Deduced a syphon composed of 8 places in 8 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 3820 place count 2003 transition count 2003
Performed 899 Post agglomeration using F-continuation condition.Transition count delta: 899
Deduced a syphon composed of 899 places in 1 ms
Reduce places removed 899 places and 0 transitions.
Iterating global reduction 2 with 1798 rules applied. Total rules applied 5618 place count 1104 transition count 1104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5619 place count 1104 transition count 1103
Renaming transitions due to excessive name length > 1024 char.
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 3 with 2 rules applied. Total rules applied 5621 place count 1103 transition count 1102
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 5823 place count 1002 transition count 1201
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -101
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 6025 place count 901 transition count 1302
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -97
Deduced a syphon composed of 97 places in 0 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 6219 place count 804 transition count 1399
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 6220 place count 803 transition count 1398
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6221 place count 802 transition count 1398
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 6222 place count 801 transition count 1397
Applied a total of 6222 rules in 914 ms. Remains 801 /3914 variables (removed 3113) and now considering 1397/3914 (removed 2517) transitions.
// Phase 1: matrix 1397 rows 801 cols
[2021-05-18 01:23:46] [INFO ] Computed 400 place invariants in 2 ms
[2021-05-18 01:23:47] [INFO ] Implicit Places using invariants in 750 ms returned []
// Phase 1: matrix 1397 rows 801 cols
[2021-05-18 01:23:47] [INFO ] Computed 400 place invariants in 2 ms
[2021-05-18 01:23:49] [INFO ] Implicit Places using invariants and state equation in 1772 ms returned []
Implicit Place search using SMT with State Equation took 2525 ms to find 0 implicit places.
[2021-05-18 01:23:49] [INFO ] Redundant transitions in 81 ms returned []
// Phase 1: matrix 1397 rows 801 cols
[2021-05-18 01:23:49] [INFO ] Computed 400 place invariants in 2 ms
[2021-05-18 01:23:50] [INFO ] Dead Transitions using invariants and state equation in 940 ms returned []
Finished structural reductions, in 1 iterations. Remains : 801/3914 places, 1397/3914 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-100B-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s248 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 35 reset in 1098 ms.
Product exploration explored 100000 steps with 19 reset in 1334 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 23 reset in 1077 ms.
Product exploration explored 100000 steps with 27 reset in 1314 ms.
[2021-05-18 01:23:55] [INFO ] Flatten gal took : 75 ms
[2021-05-18 01:23:55] [INFO ] Flatten gal took : 74 ms
[2021-05-18 01:23:55] [INFO ] Time to serialize gal into /tmp/LTL15076156060128433792.gal : 8 ms
[2021-05-18 01:23:55] [INFO ] Time to serialize properties into /tmp/LTL117256107263236848.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/LTL15076156060128433792.gal, -t, CGAL, -LTL, /tmp/LTL117256107263236848.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/LTL15076156060128433792.gal -t CGAL -LTL /tmp/LTL117256107263236848.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("(p1607==0)"))))
Formula 0 simplified : !GF"(p1607==0)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 4.28324e+77 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
660 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,6.9032,108780,1,0,8,575448,24,5,30102,126174,20
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldRVt-PT-100B-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ShieldRVt-PT-100B-15 finished in 17142 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11233410215902471611
[2021-05-18 01:24:02] [INFO ] Too many transitions (3914) to apply POR reductions. Disabling POR matrices.
[2021-05-18 01:24:03] [INFO ] Built C files in 78ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11233410215902471611
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11233410215902471611]
[2021-05-18 01:24:03] [INFO ] Applying decomposition
[2021-05-18 01:24:03] [INFO ] Flatten gal took : 139 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/graph9134696457128926494.txt, -o, /tmp/graph9134696457128926494.bin, -w, /tmp/graph9134696457128926494.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/graph9134696457128926494.bin, -l, -1, -v, -w, /tmp/graph9134696457128926494.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 01:24:03] [INFO ] Decomposing Gal with order
[2021-05-18 01:24:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 01:24:04] [INFO ] Removed a total of 989 redundant transitions.
[2021-05-18 01:24:04] [INFO ] Flatten gal took : 340 ms
[2021-05-18 01:24:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 107 ms.
[2021-05-18 01:24:05] [INFO ] Time to serialize gal into /tmp/LTLFireability2142270537425542439.gal : 63 ms
[2021-05-18 01:24:05] [INFO ] Time to serialize properties into /tmp/LTLFireability7124696943346434390.ltl : 24 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/LTLFireability2142270537425542439.gal, -t, CGAL, -LTL, /tmp/LTLFireability7124696943346434390.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/LTLFireability2142270537425542439.gal -t CGAL -LTL /tmp/LTLFireability7124696943346434390.ltl -c -stutter-deadlock
Read 3 LTL properties
Checking formula 0 : !((G(("(i44.i1.i4.u1203.p3864==1)")||(X(F(("(i44.i1.i4.u1203.p3864==1)")&&(X(F("(i8.i1.i2.u535.p1681==0)")))))))))
Formula 0 simplified : !G("(i44.i1.i4.u1203.p3864==1)" | XF("(i44.i1.i4.u1203.p3864==1)" & XF"(i8.i1.i2.u535.p1681==0)"))
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11233410215902471611] killed by timeout after 32 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11233410215902471611] killed by timeout after 32 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-18 01:47:44] [INFO ] Applying decomposition
[2021-05-18 01:47:46] [INFO ] Flatten gal took : 1032 ms
[2021-05-18 01:47:46] [INFO ] Decomposing Gal with order
[2021-05-18 01:47:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 01:47:56] [INFO ] Removed a total of 297 redundant transitions.
[2021-05-18 01:47:56] [INFO ] Flatten gal took : 1234 ms
[2021-05-18 01:47:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2021-05-18 01:47:59] [INFO ] Time to serialize gal into /tmp/LTLFireability4405327030260117322.gal : 29 ms
[2021-05-18 01:47:59] [INFO ] Time to serialize properties into /tmp/LTLFireability4521112260193041567.ltl : 24 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/LTLFireability4405327030260117322.gal, -t, CGAL, -LTL, /tmp/LTLFireability4521112260193041567.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/LTLFireability4405327030260117322.gal -t CGAL -LTL /tmp/LTLFireability4521112260193041567.ltl -c -stutter-deadlock
Read 3 LTL properties
Checking formula 0 : !((G(("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u638.p3864==1)")||(X(F(("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u638.p3864==1)")&&(X(F("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u328.p1681==0)")))))))))
Formula 0 simplified : !G("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u638.p3864==1)" | XF("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u638.p3864==1)" & XF"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u328.p1681==0)"))
Detected timeout of ITS tools.
[2021-05-18 02:11:37] [INFO ] Flatten gal took : 1791 ms
[2021-05-18 02:11:39] [INFO ] Input system was already deterministic with 3914 transitions.
[2021-05-18 02:11:39] [INFO ] Transformed 3914 places.
[2021-05-18 02:11:39] [INFO ] Transformed 3914 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-18 02:11:42] [INFO ] Time to serialize gal into /tmp/LTLFireability7705635828805551312.gal : 40 ms
[2021-05-18 02:11:42] [INFO ] Time to serialize properties into /tmp/LTLFireability13853522117494443077.ltl : 14 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/LTLFireability7705635828805551312.gal, -t, CGAL, -LTL, /tmp/LTLFireability13853522117494443077.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --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/LTLFireability7705635828805551312.gal -t CGAL -LTL /tmp/LTLFireability13853522117494443077.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(("(p3864==1)")||(X(F(("(p3864==1)")&&(X(F("(p1681==0)")))))))))
Formula 0 simplified : !G("(p3864==1)" | XF("(p3864==1)" & XF"(p1681==0)"))

BK_TIME_CONFINEMENT_REACHED

--------------------
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-100B"
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-100B, 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-162106564800349"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-100B.tgz
mv ShieldRVt-PT-100B 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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;