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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 113K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K 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 25K Mar 28 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 12:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 12:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 25 19:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 19:02 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 239K 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-020B-00
FORMULA_NAME ShieldRVt-PT-020B-01
FORMULA_NAME ShieldRVt-PT-020B-02
FORMULA_NAME ShieldRVt-PT-020B-03
FORMULA_NAME ShieldRVt-PT-020B-04
FORMULA_NAME ShieldRVt-PT-020B-05
FORMULA_NAME ShieldRVt-PT-020B-06
FORMULA_NAME ShieldRVt-PT-020B-07
FORMULA_NAME ShieldRVt-PT-020B-08
FORMULA_NAME ShieldRVt-PT-020B-09
FORMULA_NAME ShieldRVt-PT-020B-10
FORMULA_NAME ShieldRVt-PT-020B-11
FORMULA_NAME ShieldRVt-PT-020B-12
FORMULA_NAME ShieldRVt-PT-020B-13
FORMULA_NAME ShieldRVt-PT-020B-14
FORMULA_NAME ShieldRVt-PT-020B-15

=== Now, execution of the tool begins

BK_START 1621263599959

Running Version 0
[2021-05-17 15:00:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 15:00:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 15:00:03] [INFO ] Load time of PNML (sax parser for PT used): 276 ms
[2021-05-17 15:00:03] [INFO ] Transformed 1003 places.
[2021-05-17 15:00:03] [INFO ] Transformed 1003 transitions.
[2021-05-17 15:00:03] [INFO ] Found NUPN structural information;
[2021-05-17 15:00:03] [INFO ] Parsed PT model containing 1003 places and 1003 transitions in 397 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 15:00:03] [INFO ] Initial state test concluded for 3 properties.
FORMULA ShieldRVt-PT-020B-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-020B-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 1003 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1003/1003 places, 1003/1003 transitions.
Discarding 209 places :
Symmetric choice reduction at 0 with 209 rule applications. Total rules 209 place count 794 transition count 794
Iterating global reduction 0 with 209 rules applied. Total rules applied 418 place count 794 transition count 794
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 419 place count 793 transition count 793
Iterating global reduction 0 with 1 rules applied. Total rules applied 420 place count 793 transition count 793
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 421 place count 792 transition count 792
Iterating global reduction 0 with 1 rules applied. Total rules applied 422 place count 792 transition count 792
Applied a total of 422 rules in 505 ms. Remains 792 /1003 variables (removed 211) and now considering 792/1003 (removed 211) transitions.
// Phase 1: matrix 792 rows 792 cols
[2021-05-17 15:00:04] [INFO ] Computed 81 place invariants in 43 ms
[2021-05-17 15:00:05] [INFO ] Implicit Places using invariants in 874 ms returned []
// Phase 1: matrix 792 rows 792 cols
[2021-05-17 15:00:05] [INFO ] Computed 81 place invariants in 10 ms
[2021-05-17 15:00:06] [INFO ] Implicit Places using invariants and state equation in 1280 ms returned []
Implicit Place search using SMT with State Equation took 2215 ms to find 0 implicit places.
// Phase 1: matrix 792 rows 792 cols
[2021-05-17 15:00:06] [INFO ] Computed 81 place invariants in 9 ms
[2021-05-17 15:00:07] [INFO ] Dead Transitions using invariants and state equation in 800 ms returned []
Finished structural reductions, in 1 iterations. Remains : 792/1003 places, 792/1003 transitions.
[2021-05-17 15:00:08] [INFO ] Flatten gal took : 206 ms
[2021-05-17 15:00:08] [INFO ] Flatten gal took : 96 ms
[2021-05-17 15:00:08] [INFO ] Input system was already deterministic with 792 transitions.
Incomplete random walk after 100000 steps, including 3 resets, run finished after 515 ms. (steps per millisecond=194 ) properties (out of 31) seen :26
Running SMT prover for 5 properties.
// Phase 1: matrix 792 rows 792 cols
[2021-05-17 15:00:08] [INFO ] Computed 81 place invariants in 7 ms
[2021-05-17 15:00:09] [INFO ] [Real]Absence check using 81 positive place invariants in 54 ms returned sat
[2021-05-17 15:00:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:00:09] [INFO ] [Real]Absence check using state equation in 592 ms returned sat
[2021-05-17 15:00:10] [INFO ] Deduced a trap composed of 22 places in 446 ms of which 8 ms to minimize.
[2021-05-17 15:00:10] [INFO ] Deduced a trap composed of 33 places in 266 ms of which 2 ms to minimize.
[2021-05-17 15:00:11] [INFO ] Deduced a trap composed of 40 places in 297 ms of which 2 ms to minimize.
[2021-05-17 15:00:11] [INFO ] Deduced a trap composed of 25 places in 323 ms of which 2 ms to minimize.
[2021-05-17 15:00:11] [INFO ] Deduced a trap composed of 23 places in 467 ms of which 2 ms to minimize.
[2021-05-17 15:00:12] [INFO ] Deduced a trap composed of 37 places in 488 ms of which 2 ms to minimize.
[2021-05-17 15:00:12] [INFO ] Deduced a trap composed of 29 places in 386 ms of which 2 ms to minimize.
[2021-05-17 15:00:13] [INFO ] Deduced a trap composed of 22 places in 281 ms of which 1 ms to minimize.
[2021-05-17 15:00:13] [INFO ] Deduced a trap composed of 30 places in 233 ms of which 1 ms to minimize.
[2021-05-17 15:00:13] [INFO ] Deduced a trap composed of 26 places in 208 ms of which 1 ms to minimize.
[2021-05-17 15:00:14] [INFO ] Deduced a trap composed of 24 places in 200 ms of which 1 ms to minimize.
[2021-05-17 15:00:14] [INFO ] Deduced a trap composed of 34 places in 151 ms of which 0 ms to minimize.
[2021-05-17 15:00:14] [INFO ] Deduced a trap composed of 33 places in 155 ms of which 0 ms to minimize.
[2021-05-17 15:00:14] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 0 ms to minimize.
[2021-05-17 15:00:14] [INFO ] Deduced a trap composed of 36 places in 126 ms of which 1 ms to minimize.
[2021-05-17 15:00:14] [INFO ] Deduced a trap composed of 37 places in 124 ms of which 0 ms to minimize.
[2021-05-17 15:00:15] [INFO ] Deduced a trap composed of 30 places in 134 ms of which 1 ms to minimize.
[2021-05-17 15:00:15] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 0 ms to minimize.
[2021-05-17 15:00:15] [INFO ] Deduced a trap composed of 33 places in 127 ms of which 0 ms to minimize.
[2021-05-17 15:00:15] [INFO ] Deduced a trap composed of 33 places in 114 ms of which 0 ms to minimize.
[2021-05-17 15:00:15] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 5709 ms
[2021-05-17 15:00:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:00:15] [INFO ] [Nat]Absence check using 81 positive place invariants in 40 ms returned sat
[2021-05-17 15:00:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:00:16] [INFO ] [Nat]Absence check using state equation in 380 ms returned sat
[2021-05-17 15:00:16] [INFO ] Deduced a trap composed of 22 places in 265 ms of which 1 ms to minimize.
[2021-05-17 15:00:16] [INFO ] Deduced a trap composed of 33 places in 392 ms of which 2 ms to minimize.
[2021-05-17 15:00:17] [INFO ] Deduced a trap composed of 40 places in 409 ms of which 2 ms to minimize.
[2021-05-17 15:00:17] [INFO ] Deduced a trap composed of 25 places in 259 ms of which 1 ms to minimize.
[2021-05-17 15:00:18] [INFO ] Deduced a trap composed of 23 places in 259 ms of which 1 ms to minimize.
[2021-05-17 15:00:18] [INFO ] Deduced a trap composed of 37 places in 240 ms of which 1 ms to minimize.
[2021-05-17 15:00:18] [INFO ] Deduced a trap composed of 29 places in 377 ms of which 1 ms to minimize.
[2021-05-17 15:00:19] [INFO ] Deduced a trap composed of 22 places in 217 ms of which 1 ms to minimize.
[2021-05-17 15:00:19] [INFO ] Deduced a trap composed of 30 places in 217 ms of which 1 ms to minimize.
[2021-05-17 15:00:19] [INFO ] Deduced a trap composed of 26 places in 277 ms of which 1 ms to minimize.
[2021-05-17 15:00:20] [INFO ] Deduced a trap composed of 24 places in 324 ms of which 1 ms to minimize.
[2021-05-17 15:00:20] [INFO ] Deduced a trap composed of 34 places in 196 ms of which 2 ms to minimize.
[2021-05-17 15:00:20] [INFO ] Deduced a trap composed of 24 places in 193 ms of which 0 ms to minimize.
[2021-05-17 15:00:20] [INFO ] Deduced a trap composed of 24 places in 277 ms of which 2 ms to minimize.
[2021-05-17 15:00:21] [INFO ] Deduced a trap composed of 39 places in 185 ms of which 1 ms to minimize.
[2021-05-17 15:00:21] [INFO ] Deduced a trap composed of 32 places in 222 ms of which 2 ms to minimize.
[2021-05-17 15:00:21] [INFO ] Deduced a trap composed of 40 places in 203 ms of which 1 ms to minimize.
[2021-05-17 15:00:21] [INFO ] Deduced a trap composed of 33 places in 180 ms of which 1 ms to minimize.
[2021-05-17 15:00:21] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 5759 ms
[2021-05-17 15:00:22] [INFO ] Computed and/alt/rep : 791/1156/791 causal constraints (skipped 0 transitions) in 65 ms.
[2021-05-17 15:00:35] [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-17 15:00:35] [INFO ] [Real]Absence check using 81 positive place invariants in 46 ms returned sat
[2021-05-17 15:00:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:00:36] [INFO ] [Real]Absence check using state equation in 451 ms returned sat
[2021-05-17 15:00:36] [INFO ] Deduced a trap composed of 24 places in 357 ms of which 2 ms to minimize.
[2021-05-17 15:00:37] [INFO ] Deduced a trap composed of 18 places in 232 ms of which 1 ms to minimize.
[2021-05-17 15:00:37] [INFO ] Deduced a trap composed of 19 places in 157 ms of which 1 ms to minimize.
[2021-05-17 15:00:37] [INFO ] Deduced a trap composed of 36 places in 172 ms of which 1 ms to minimize.
[2021-05-17 15:00:37] [INFO ] Deduced a trap composed of 25 places in 274 ms of which 1 ms to minimize.
[2021-05-17 15:00:38] [INFO ] Deduced a trap composed of 32 places in 253 ms of which 2 ms to minimize.
[2021-05-17 15:00:38] [INFO ] Deduced a trap composed of 28 places in 219 ms of which 1 ms to minimize.
[2021-05-17 15:00:38] [INFO ] Deduced a trap composed of 39 places in 213 ms of which 1 ms to minimize.
[2021-05-17 15:00:38] [INFO ] Deduced a trap composed of 38 places in 194 ms of which 1 ms to minimize.
[2021-05-17 15:00:39] [INFO ] Deduced a trap composed of 24 places in 181 ms of which 1 ms to minimize.
[2021-05-17 15:00:39] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2768 ms
[2021-05-17 15:00:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:00:39] [INFO ] [Nat]Absence check using 81 positive place invariants in 60 ms returned sat
[2021-05-17 15:00:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:00:39] [INFO ] [Nat]Absence check using state equation in 515 ms returned sat
[2021-05-17 15:00:40] [INFO ] Deduced a trap composed of 24 places in 225 ms of which 1 ms to minimize.
[2021-05-17 15:00:40] [INFO ] Deduced a trap composed of 18 places in 320 ms of which 1 ms to minimize.
[2021-05-17 15:00:40] [INFO ] Deduced a trap composed of 19 places in 207 ms of which 2 ms to minimize.
[2021-05-17 15:00:41] [INFO ] Deduced a trap composed of 36 places in 200 ms of which 1 ms to minimize.
[2021-05-17 15:00:41] [INFO ] Deduced a trap composed of 25 places in 236 ms of which 1 ms to minimize.
[2021-05-17 15:00:41] [INFO ] Deduced a trap composed of 32 places in 184 ms of which 0 ms to minimize.
[2021-05-17 15:00:41] [INFO ] Deduced a trap composed of 28 places in 171 ms of which 1 ms to minimize.
[2021-05-17 15:00:42] [INFO ] Deduced a trap composed of 39 places in 252 ms of which 1 ms to minimize.
[2021-05-17 15:00:42] [INFO ] Deduced a trap composed of 38 places in 236 ms of which 4 ms to minimize.
[2021-05-17 15:00:42] [INFO ] Deduced a trap composed of 24 places in 146 ms of which 1 ms to minimize.
[2021-05-17 15:00:42] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2761 ms
[2021-05-17 15:00:42] [INFO ] Computed and/alt/rep : 791/1156/791 causal constraints (skipped 0 transitions) in 90 ms.
[2021-05-17 15:00:59] [INFO ] Added : 780 causal constraints over 156 iterations in 16536 ms. Result :unknown
[2021-05-17 15:00:59] [INFO ] [Real]Absence check using 81 positive place invariants in 60 ms returned sat
[2021-05-17 15:00:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:01:00] [INFO ] [Real]Absence check using state equation in 590 ms returned sat
[2021-05-17 15:01:00] [INFO ] Deduced a trap composed of 24 places in 234 ms of which 1 ms to minimize.
[2021-05-17 15:01:00] [INFO ] Deduced a trap composed of 19 places in 267 ms of which 1 ms to minimize.
[2021-05-17 15:01:01] [INFO ] Deduced a trap composed of 40 places in 414 ms of which 1 ms to minimize.
[2021-05-17 15:01:01] [INFO ] Deduced a trap composed of 33 places in 381 ms of which 2 ms to minimize.
[2021-05-17 15:01:01] [INFO ] Deduced a trap composed of 24 places in 344 ms of which 1 ms to minimize.
[2021-05-17 15:01:02] [INFO ] Deduced a trap composed of 21 places in 349 ms of which 1 ms to minimize.
[2021-05-17 15:01:02] [INFO ] Deduced a trap composed of 34 places in 345 ms of which 1 ms to minimize.
[2021-05-17 15:01:03] [INFO ] Deduced a trap composed of 29 places in 340 ms of which 4 ms to minimize.
[2021-05-17 15:01:03] [INFO ] Deduced a trap composed of 25 places in 253 ms of which 1 ms to minimize.
[2021-05-17 15:01:03] [INFO ] Deduced a trap composed of 21 places in 327 ms of which 1 ms to minimize.
[2021-05-17 15:01:04] [INFO ] Deduced a trap composed of 28 places in 300 ms of which 1 ms to minimize.
[2021-05-17 15:01:04] [INFO ] Deduced a trap composed of 37 places in 302 ms of which 3 ms to minimize.
[2021-05-17 15:01:04] [INFO ] Deduced a trap composed of 33 places in 284 ms of which 1 ms to minimize.
[2021-05-17 15:01:05] [INFO ] Deduced a trap composed of 25 places in 281 ms of which 1 ms to minimize.
[2021-05-17 15:01:05] [INFO ] Deduced a trap composed of 32 places in 283 ms of which 1 ms to minimize.
[2021-05-17 15:01:05] [INFO ] Deduced a trap composed of 31 places in 257 ms of which 1 ms to minimize.
[2021-05-17 15:01:06] [INFO ] Deduced a trap composed of 38 places in 248 ms of which 0 ms to minimize.
[2021-05-17 15:01:06] [INFO ] Deduced a trap composed of 37 places in 189 ms of which 1 ms to minimize.
[2021-05-17 15:01:06] [INFO ] Deduced a trap composed of 25 places in 241 ms of which 1 ms to minimize.
[2021-05-17 15:01:07] [INFO ] Deduced a trap composed of 32 places in 244 ms of which 1 ms to minimize.
[2021-05-17 15:01:07] [INFO ] Deduced a trap composed of 40 places in 211 ms of which 1 ms to minimize.
[2021-05-17 15:01:07] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 7343 ms
[2021-05-17 15:01:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:01:07] [INFO ] [Nat]Absence check using 81 positive place invariants in 64 ms returned sat
[2021-05-17 15:01:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:01:08] [INFO ] [Nat]Absence check using state equation in 528 ms returned sat
[2021-05-17 15:01:08] [INFO ] Deduced a trap composed of 24 places in 352 ms of which 1 ms to minimize.
[2021-05-17 15:01:08] [INFO ] Deduced a trap composed of 19 places in 332 ms of which 1 ms to minimize.
[2021-05-17 15:01:09] [INFO ] Deduced a trap composed of 40 places in 418 ms of which 1 ms to minimize.
[2021-05-17 15:01:09] [INFO ] Deduced a trap composed of 33 places in 405 ms of which 1 ms to minimize.
[2021-05-17 15:01:10] [INFO ] Deduced a trap composed of 24 places in 347 ms of which 1 ms to minimize.
[2021-05-17 15:01:10] [INFO ] Deduced a trap composed of 25 places in 347 ms of which 1 ms to minimize.
[2021-05-17 15:01:11] [INFO ] Deduced a trap composed of 39 places in 322 ms of which 2 ms to minimize.
[2021-05-17 15:01:11] [INFO ] Deduced a trap composed of 30 places in 315 ms of which 1 ms to minimize.
[2021-05-17 15:01:11] [INFO ] Deduced a trap composed of 28 places in 283 ms of which 1 ms to minimize.
[2021-05-17 15:01:12] [INFO ] Deduced a trap composed of 32 places in 289 ms of which 1 ms to minimize.
[2021-05-17 15:01:12] [INFO ] Deduced a trap composed of 45 places in 288 ms of which 1 ms to minimize.
[2021-05-17 15:01:12] [INFO ] Deduced a trap composed of 28 places in 273 ms of which 1 ms to minimize.
[2021-05-17 15:01:13] [INFO ] Deduced a trap composed of 40 places in 282 ms of which 2 ms to minimize.
[2021-05-17 15:01:13] [INFO ] Deduced a trap composed of 25 places in 273 ms of which 1 ms to minimize.
[2021-05-17 15:01:13] [INFO ] Deduced a trap composed of 32 places in 239 ms of which 1 ms to minimize.
[2021-05-17 15:01:14] [INFO ] Deduced a trap composed of 21 places in 225 ms of which 1 ms to minimize.
[2021-05-17 15:01:14] [INFO ] Deduced a trap composed of 39 places in 204 ms of which 1 ms to minimize.
[2021-05-17 15:01:14] [INFO ] Deduced a trap composed of 21 places in 209 ms of which 1 ms to minimize.
[2021-05-17 15:01:14] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 6405 ms
[2021-05-17 15:01:14] [INFO ] Computed and/alt/rep : 791/1156/791 causal constraints (skipped 0 transitions) in 94 ms.
[2021-05-17 15:01:27] [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-17 15:01:27] [INFO ] [Real]Absence check using 81 positive place invariants in 60 ms returned sat
[2021-05-17 15:01:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:01:28] [INFO ] [Real]Absence check using state equation in 556 ms returned sat
[2021-05-17 15:01:28] [INFO ] Deduced a trap composed of 22 places in 354 ms of which 1 ms to minimize.
[2021-05-17 15:01:29] [INFO ] Deduced a trap composed of 28 places in 384 ms of which 1 ms to minimize.
[2021-05-17 15:01:29] [INFO ] Deduced a trap composed of 42 places in 370 ms of which 1 ms to minimize.
[2021-05-17 15:01:30] [INFO ] Deduced a trap composed of 21 places in 368 ms of which 2 ms to minimize.
[2021-05-17 15:01:30] [INFO ] Deduced a trap composed of 25 places in 354 ms of which 1 ms to minimize.
[2021-05-17 15:01:30] [INFO ] Deduced a trap composed of 19 places in 331 ms of which 1 ms to minimize.
[2021-05-17 15:01:31] [INFO ] Deduced a trap composed of 32 places in 341 ms of which 1 ms to minimize.
[2021-05-17 15:01:31] [INFO ] Deduced a trap composed of 31 places in 325 ms of which 1 ms to minimize.
[2021-05-17 15:01:31] [INFO ] Deduced a trap composed of 29 places in 237 ms of which 1 ms to minimize.
[2021-05-17 15:01:32] [INFO ] Deduced a trap composed of 32 places in 274 ms of which 1 ms to minimize.
[2021-05-17 15:01:32] [INFO ] Deduced a trap composed of 34 places in 270 ms of which 1 ms to minimize.
[2021-05-17 15:01:32] [INFO ] Deduced a trap composed of 21 places in 249 ms of which 1 ms to minimize.
[2021-05-17 15:01:33] [INFO ] Deduced a trap composed of 39 places in 224 ms of which 1 ms to minimize.
[2021-05-17 15:01:33] [INFO ] Deduced a trap composed of 32 places in 209 ms of which 1 ms to minimize.
[2021-05-17 15:01:33] [INFO ] Deduced a trap composed of 40 places in 208 ms of which 1 ms to minimize.
[2021-05-17 15:01:33] [INFO ] Deduced a trap composed of 39 places in 192 ms of which 1 ms to minimize.
[2021-05-17 15:01:34] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 5693 ms
[2021-05-17 15:01:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:01:34] [INFO ] [Nat]Absence check using 81 positive place invariants in 62 ms returned sat
[2021-05-17 15:01:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:01:34] [INFO ] [Nat]Absence check using state equation in 592 ms returned sat
[2021-05-17 15:01:35] [INFO ] Deduced a trap composed of 22 places in 376 ms of which 1 ms to minimize.
[2021-05-17 15:01:35] [INFO ] Deduced a trap composed of 28 places in 359 ms of which 1 ms to minimize.
[2021-05-17 15:01:36] [INFO ] Deduced a trap composed of 42 places in 332 ms of which 1 ms to minimize.
[2021-05-17 15:01:36] [INFO ] Deduced a trap composed of 21 places in 329 ms of which 1 ms to minimize.
[2021-05-17 15:01:36] [INFO ] Deduced a trap composed of 25 places in 357 ms of which 1 ms to minimize.
[2021-05-17 15:01:37] [INFO ] Deduced a trap composed of 19 places in 328 ms of which 2 ms to minimize.
[2021-05-17 15:01:37] [INFO ] Deduced a trap composed of 32 places in 332 ms of which 1 ms to minimize.
[2021-05-17 15:01:38] [INFO ] Deduced a trap composed of 31 places in 310 ms of which 1 ms to minimize.
[2021-05-17 15:01:38] [INFO ] Deduced a trap composed of 29 places in 307 ms of which 1 ms to minimize.
[2021-05-17 15:01:38] [INFO ] Deduced a trap composed of 32 places in 272 ms of which 1 ms to minimize.
[2021-05-17 15:01:39] [INFO ] Deduced a trap composed of 34 places in 260 ms of which 1 ms to minimize.
[2021-05-17 15:01:39] [INFO ] Deduced a trap composed of 21 places in 205 ms of which 1 ms to minimize.
[2021-05-17 15:01:39] [INFO ] Deduced a trap composed of 39 places in 189 ms of which 1 ms to minimize.
[2021-05-17 15:01:39] [INFO ] Deduced a trap composed of 32 places in 223 ms of which 1 ms to minimize.
[2021-05-17 15:01:40] [INFO ] Deduced a trap composed of 40 places in 218 ms of which 1 ms to minimize.
[2021-05-17 15:01:40] [INFO ] Deduced a trap composed of 39 places in 194 ms of which 1 ms to minimize.
[2021-05-17 15:01:40] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 5484 ms
[2021-05-17 15:01:40] [INFO ] Computed and/alt/rep : 791/1156/791 causal constraints (skipped 0 transitions) in 87 ms.
[2021-05-17 15:01:54] [INFO ] Added : 715 causal constraints over 143 iterations in 13709 ms. Result :unknown
[2021-05-17 15:01:54] [INFO ] [Real]Absence check using 81 positive place invariants in 60 ms returned sat
[2021-05-17 15:01:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:01:54] [INFO ] [Real]Absence check using state equation in 554 ms returned sat
[2021-05-17 15:01:55] [INFO ] Deduced a trap composed of 24 places in 344 ms of which 1 ms to minimize.
[2021-05-17 15:01:55] [INFO ] Deduced a trap composed of 28 places in 343 ms of which 1 ms to minimize.
[2021-05-17 15:01:56] [INFO ] Deduced a trap composed of 27 places in 322 ms of which 1 ms to minimize.
[2021-05-17 15:01:56] [INFO ] Deduced a trap composed of 18 places in 316 ms of which 1 ms to minimize.
[2021-05-17 15:01:56] [INFO ] Deduced a trap composed of 38 places in 316 ms of which 2 ms to minimize.
[2021-05-17 15:01:57] [INFO ] Deduced a trap composed of 25 places in 306 ms of which 2 ms to minimize.
[2021-05-17 15:01:57] [INFO ] Deduced a trap composed of 41 places in 293 ms of which 1 ms to minimize.
[2021-05-17 15:01:57] [INFO ] Deduced a trap composed of 24 places in 284 ms of which 1 ms to minimize.
[2021-05-17 15:01:58] [INFO ] Deduced a trap composed of 30 places in 253 ms of which 1 ms to minimize.
[2021-05-17 15:01:58] [INFO ] Deduced a trap composed of 32 places in 237 ms of which 1 ms to minimize.
[2021-05-17 15:01:58] [INFO ] Deduced a trap composed of 32 places in 214 ms of which 1 ms to minimize.
[2021-05-17 15:01:59] [INFO ] Deduced a trap composed of 27 places in 212 ms of which 1 ms to minimize.
[2021-05-17 15:01:59] [INFO ] Deduced a trap composed of 28 places in 212 ms of which 1 ms to minimize.
[2021-05-17 15:01:59] [INFO ] Deduced a trap composed of 34 places in 203 ms of which 1 ms to minimize.
[2021-05-17 15:01:59] [INFO ] Deduced a trap composed of 38 places in 213 ms of which 1 ms to minimize.
[2021-05-17 15:02:00] [INFO ] Deduced a trap composed of 32 places in 188 ms of which 1 ms to minimize.
[2021-05-17 15:02:00] [INFO ] Deduced a trap composed of 37 places in 172 ms of which 1 ms to minimize.
[2021-05-17 15:02:00] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 5465 ms
[2021-05-17 15:02:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:02:00] [INFO ] [Nat]Absence check using 81 positive place invariants in 62 ms returned sat
[2021-05-17 15:02:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:02:01] [INFO ] [Nat]Absence check using state equation in 565 ms returned sat
[2021-05-17 15:02:01] [INFO ] Deduced a trap composed of 24 places in 348 ms of which 1 ms to minimize.
[2021-05-17 15:02:02] [INFO ] Deduced a trap composed of 28 places in 371 ms of which 1 ms to minimize.
[2021-05-17 15:02:02] [INFO ] Deduced a trap composed of 27 places in 342 ms of which 1 ms to minimize.
[2021-05-17 15:02:02] [INFO ] Deduced a trap composed of 18 places in 341 ms of which 2 ms to minimize.
[2021-05-17 15:02:03] [INFO ] Deduced a trap composed of 38 places in 295 ms of which 2 ms to minimize.
[2021-05-17 15:02:03] [INFO ] Deduced a trap composed of 25 places in 262 ms of which 1 ms to minimize.
[2021-05-17 15:02:03] [INFO ] Deduced a trap composed of 41 places in 293 ms of which 1 ms to minimize.
[2021-05-17 15:02:04] [INFO ] Deduced a trap composed of 24 places in 275 ms of which 1 ms to minimize.
[2021-05-17 15:02:04] [INFO ] Deduced a trap composed of 30 places in 254 ms of which 0 ms to minimize.
[2021-05-17 15:02:04] [INFO ] Deduced a trap composed of 32 places in 224 ms of which 1 ms to minimize.
[2021-05-17 15:02:04] [INFO ] Deduced a trap composed of 32 places in 209 ms of which 1 ms to minimize.
[2021-05-17 15:02:05] [INFO ] Deduced a trap composed of 27 places in 222 ms of which 1 ms to minimize.
[2021-05-17 15:02:05] [INFO ] Deduced a trap composed of 28 places in 202 ms of which 1 ms to minimize.
[2021-05-17 15:02:05] [INFO ] Deduced a trap composed of 34 places in 191 ms of which 0 ms to minimize.
[2021-05-17 15:02:05] [INFO ] Deduced a trap composed of 38 places in 185 ms of which 1 ms to minimize.
[2021-05-17 15:02:06] [INFO ] Deduced a trap composed of 32 places in 211 ms of which 0 ms to minimize.
[2021-05-17 15:02:06] [INFO ] Deduced a trap composed of 37 places in 169 ms of which 0 ms to minimize.
[2021-05-17 15:02:06] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 5334 ms
[2021-05-17 15:02:06] [INFO ] Computed and/alt/rep : 791/1156/791 causal constraints (skipped 0 transitions) in 75 ms.
[2021-05-17 15:02:20] [INFO ] Added : 715 causal constraints over 143 iterations in 13890 ms. Result :unknown
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(p0)||(p1&&F(p2))||G(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 792 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 792/792 places, 792/792 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 782 transition count 782
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 782 transition count 782
Applied a total of 20 rules in 84 ms. Remains 782 /792 variables (removed 10) and now considering 782/792 (removed 10) transitions.
// Phase 1: matrix 782 rows 782 cols
[2021-05-17 15:02:20] [INFO ] Computed 81 place invariants in 6 ms
[2021-05-17 15:02:21] [INFO ] Implicit Places using invariants in 480 ms returned []
// Phase 1: matrix 782 rows 782 cols
[2021-05-17 15:02:21] [INFO ] Computed 81 place invariants in 5 ms
[2021-05-17 15:02:22] [INFO ] Implicit Places using invariants and state equation in 1034 ms returned []
Implicit Place search using SMT with State Equation took 1517 ms to find 0 implicit places.
// Phase 1: matrix 782 rows 782 cols
[2021-05-17 15:02:22] [INFO ] Computed 81 place invariants in 4 ms
[2021-05-17 15:02:23] [INFO ] Dead Transitions using invariants and state equation in 890 ms returned []
Finished structural reductions, in 1 iterations. Remains : 782/792 places, 782/792 transitions.
[2021-05-17 15:02:23] [INFO ] Initial state test concluded for 1 properties.
Stuttering acceptance computed with spot in 393 ms :[true, (NOT p0), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-020B-00 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=3, aps=[p0:(EQ s43 1), p2:(NEQ s10 1), p1:(NEQ s80 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA ShieldRVt-PT-020B-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-00 finished in 2988 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0 U X((p1&&G(p2))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 792 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 792/792 places, 792/792 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 781 transition count 781
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 781 transition count 781
Applied a total of 22 rules in 41 ms. Remains 781 /792 variables (removed 11) and now considering 781/792 (removed 11) transitions.
// Phase 1: matrix 781 rows 781 cols
[2021-05-17 15:02:23] [INFO ] Computed 81 place invariants in 3 ms
[2021-05-17 15:02:23] [INFO ] Implicit Places using invariants in 438 ms returned []
// Phase 1: matrix 781 rows 781 cols
[2021-05-17 15:02:23] [INFO ] Computed 81 place invariants in 5 ms
[2021-05-17 15:02:24] [INFO ] Implicit Places using invariants and state equation in 933 ms returned []
Implicit Place search using SMT with State Equation took 1373 ms to find 0 implicit places.
// Phase 1: matrix 781 rows 781 cols
[2021-05-17 15:02:24] [INFO ] Computed 81 place invariants in 4 ms
[2021-05-17 15:02:25] [INFO ] Dead Transitions using invariants and state equation in 816 ms returned []
Finished structural reductions, in 1 iterations. Remains : 781/792 places, 781/792 transitions.
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldRVt-PT-020B-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p1 p2), acceptance={} source=1 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=2 dest: 1}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 4}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 4}, { cond=(AND p0 p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s195 1), p1:(EQ s146 1), p2:(NEQ s183 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-020B-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-01 finished in 2515 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0) U (p1||X(F((p1&&X(F(p2))))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 792 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 792/792 places, 792/792 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 783 transition count 783
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 783 transition count 783
Applied a total of 18 rules in 76 ms. Remains 783 /792 variables (removed 9) and now considering 783/792 (removed 9) transitions.
// Phase 1: matrix 783 rows 783 cols
[2021-05-17 15:02:26] [INFO ] Computed 81 place invariants in 3 ms
[2021-05-17 15:02:26] [INFO ] Implicit Places using invariants in 402 ms returned []
// Phase 1: matrix 783 rows 783 cols
[2021-05-17 15:02:26] [INFO ] Computed 81 place invariants in 4 ms
[2021-05-17 15:02:27] [INFO ] Implicit Places using invariants and state equation in 898 ms returned []
Implicit Place search using SMT with State Equation took 1302 ms to find 0 implicit places.
// Phase 1: matrix 783 rows 783 cols
[2021-05-17 15:02:27] [INFO ] Computed 81 place invariants in 3 ms
[2021-05-17 15:02:28] [INFO ] Dead Transitions using invariants and state equation in 793 ms returned []
Finished structural reductions, in 1 iterations. Remains : 783/792 places, 783/792 transitions.
Stuttering acceptance computed with spot in 245 ms :[(AND (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p1)), (NOT p2), (NOT p1), (OR (NOT p1) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : ShieldRVt-PT-020B-02 automaton TGBA [mat=[[{ cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 p0), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(EQ s734 1), p2:(NEQ s550 1), p1:(EQ s409 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2449 steps with 0 reset in 33 ms.
FORMULA ShieldRVt-PT-020B-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-02 finished in 2478 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 792 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 792/792 places, 792/792 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 220 transitions
Trivial Post-agglo rules discarded 220 transitions
Performed 220 trivial Post agglomeration. Transition count delta: 220
Iterating post reduction 0 with 220 rules applied. Total rules applied 220 place count 791 transition count 571
Reduce places removed 220 places and 0 transitions.
Iterating post reduction 1 with 220 rules applied. Total rules applied 440 place count 571 transition count 571
Performed 156 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 156 Pre rules applied. Total rules applied 440 place count 571 transition count 415
Deduced a syphon composed of 156 places in 1 ms
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 2 with 312 rules applied. Total rules applied 752 place count 415 transition count 415
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 758 place count 409 transition count 409
Iterating global reduction 2 with 6 rules applied. Total rules applied 764 place count 409 transition count 409
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 764 place count 409 transition count 406
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 770 place count 406 transition count 406
Performed 181 Post agglomeration using F-continuation condition.Transition count delta: 181
Deduced a syphon composed of 181 places in 1 ms
Reduce places removed 181 places and 0 transitions.
Iterating global reduction 2 with 362 rules applied. Total rules applied 1132 place count 225 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1133 place count 225 transition count 224
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 1135 place count 224 transition count 223
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -57
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1253 place count 165 transition count 280
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1254 place count 164 transition count 279
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1255 place count 163 transition count 279
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1256 place count 162 transition count 278
Applied a total of 1256 rules in 257 ms. Remains 162 /792 variables (removed 630) and now considering 278/792 (removed 514) transitions.
// Phase 1: matrix 278 rows 162 cols
[2021-05-17 15:02:28] [INFO ] Computed 80 place invariants in 1 ms
[2021-05-17 15:02:28] [INFO ] Implicit Places using invariants in 178 ms returned []
// Phase 1: matrix 278 rows 162 cols
[2021-05-17 15:02:28] [INFO ] Computed 80 place invariants in 1 ms
[2021-05-17 15:02:29] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 598 ms to find 0 implicit places.
[2021-05-17 15:02:29] [INFO ] Redundant transitions in 26 ms returned []
// Phase 1: matrix 278 rows 162 cols
[2021-05-17 15:02:29] [INFO ] Computed 80 place invariants in 1 ms
[2021-05-17 15:02:29] [INFO ] Dead Transitions using invariants and state equation in 309 ms returned []
Finished structural reductions, in 1 iterations. Remains : 162/792 places, 278/792 transitions.
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-020B-03 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s10 1), p1:(EQ s15 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-020B-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-03 finished in 1324 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((G(p0)||(p0&&F(p1)))&&X(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 792 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 792/792 places, 792/792 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 781 transition count 781
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 781 transition count 781
Applied a total of 22 rules in 72 ms. Remains 781 /792 variables (removed 11) and now considering 781/792 (removed 11) transitions.
// Phase 1: matrix 781 rows 781 cols
[2021-05-17 15:02:29] [INFO ] Computed 81 place invariants in 4 ms
[2021-05-17 15:02:30] [INFO ] Implicit Places using invariants in 418 ms returned []
// Phase 1: matrix 781 rows 781 cols
[2021-05-17 15:02:30] [INFO ] Computed 81 place invariants in 5 ms
[2021-05-17 15:02:31] [INFO ] Implicit Places using invariants and state equation in 960 ms returned []
Implicit Place search using SMT with State Equation took 1381 ms to find 0 implicit places.
// Phase 1: matrix 781 rows 781 cols
[2021-05-17 15:02:31] [INFO ] Computed 81 place invariants in 5 ms
[2021-05-17 15:02:32] [INFO ] Dead Transitions using invariants and state equation in 909 ms returned []
Finished structural reductions, in 1 iterations. Remains : 781/792 places, 781/792 transitions.
[2021-05-17 15:02:32] [INFO ] Initial state test concluded for 1 properties.
Stuttering acceptance computed with spot in 219 ms :[(NOT p0), true, (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-020B-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(NEQ s289 1), p1:(OR (NEQ s735 1) (NEQ s744 1) (NEQ s767 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1346 ms.
Product exploration explored 100000 steps with 50000 reset in 1056 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), true, (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 50000 reset in 923 ms.
Product exploration explored 100000 steps with 50000 reset in 898 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), true, (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 4 out of 781 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 781/781 places, 781/781 transitions.
Performed 218 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 218 rules applied. Total rules applied 218 place count 781 transition count 781
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 98 Pre rules applied. Total rules applied 218 place count 781 transition count 916
Deduced a syphon composed of 316 places in 1 ms
Iterating global reduction 1 with 98 rules applied. Total rules applied 316 place count 781 transition count 916
Performed 218 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 534 places in 1 ms
Iterating global reduction 1 with 218 rules applied. Total rules applied 534 place count 781 transition count 916
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 535 place count 781 transition count 915
Discarding 139 places :
Symmetric choice reduction at 2 with 139 rule applications. Total rules 674 place count 642 transition count 776
Deduced a syphon composed of 395 places in 1 ms
Iterating global reduction 2 with 139 rules applied. Total rules applied 813 place count 642 transition count 776
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 396 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 814 place count 642 transition count 776
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 816 place count 640 transition count 774
Deduced a syphon composed of 394 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 818 place count 640 transition count 774
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: -476
Deduced a syphon composed of 455 places in 1 ms
Iterating global reduction 2 with 61 rules applied. Total rules applied 879 place count 640 transition count 1250
Discarding 61 places :
Symmetric choice reduction at 2 with 61 rule applications. Total rules 940 place count 579 transition count 1128
Deduced a syphon composed of 394 places in 1 ms
Iterating global reduction 2 with 61 rules applied. Total rules applied 1001 place count 579 transition count 1128
Deduced a syphon composed of 394 places in 0 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 1010 place count 579 transition count 1119
Deduced a syphon composed of 394 places in 0 ms
Applied a total of 1010 rules in 495 ms. Remains 579 /781 variables (removed 202) and now considering 1119/781 (removed -338) transitions.
[2021-05-17 15:02:37] [INFO ] Redundant transitions in 72 ms returned []
// Phase 1: matrix 1119 rows 579 cols
[2021-05-17 15:02:37] [INFO ] Computed 81 place invariants in 6 ms
[2021-05-17 15:02:38] [INFO ] Dead Transitions using invariants and state equation in 691 ms returned []
Finished structural reductions, in 1 iterations. Remains : 579/781 places, 1119/781 transitions.
Product exploration explored 100000 steps with 50000 reset in 3745 ms.
Product exploration explored 100000 steps with 50000 reset in 3977 ms.
[2021-05-17 15:02:46] [INFO ] Flatten gal took : 49 ms
[2021-05-17 15:02:46] [INFO ] Flatten gal took : 41 ms
[2021-05-17 15:02:46] [INFO ] Time to serialize gal into /tmp/LTL9369143912660481974.gal : 33 ms
[2021-05-17 15:02:46] [INFO ] Time to serialize properties into /tmp/LTL388279189307598410.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/LTL9369143912660481974.gal, -t, CGAL, -LTL, /tmp/LTL388279189307598410.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/LTL9369143912660481974.gal -t CGAL -LTL /tmp/LTL388279189307598410.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X("(p366!=1)"))&&((G("(p366!=1)"))||(F("(((p940!=1)||(p952!=1))||(p984!=1))")))))
Formula 0 simplified : !(X"(p366!=1)" & (G"(p366!=1)" | F"(((p940!=1)||(p952!=1))||(p984!=1))"))
Detected timeout of ITS tools.
[2021-05-17 15:03:01] [INFO ] Flatten gal took : 37 ms
[2021-05-17 15:03:01] [INFO ] Applying decomposition
[2021-05-17 15:03:01] [INFO ] Flatten gal took : 36 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/graph956456851812337071.txt, -o, /tmp/graph956456851812337071.bin, -w, /tmp/graph956456851812337071.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/graph956456851812337071.bin, -l, -1, -v, -w, /tmp/graph956456851812337071.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 15:03:01] [INFO ] Decomposing Gal with order
[2021-05-17 15:03:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 15:03:01] [INFO ] Removed a total of 201 redundant transitions.
[2021-05-17 15:03:02] [INFO ] Flatten gal took : 151 ms
[2021-05-17 15:03:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 20 ms.
[2021-05-17 15:03:02] [INFO ] Time to serialize gal into /tmp/LTL7974613635329251462.gal : 22 ms
[2021-05-17 15:03:02] [INFO ] Time to serialize properties into /tmp/LTL5940643511869247310.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/LTL7974613635329251462.gal, -t, CGAL, -LTL, /tmp/LTL5940643511869247310.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/LTL7974613635329251462.gal -t CGAL -LTL /tmp/LTL5940643511869247310.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((X("(i9.i0.u113.p366!=1)"))&&((G("(i9.i0.u113.p366!=1)"))||(F("(((i18.i3.u286.p940!=1)||(i18.i4.u290.p952!=1))||(i19.i4.u302.p984!=1))")))))
Formula 0 simplified : !(X"(i9.i0.u113.p366!=1)" & (G"(i9.i0.u113.p366!=1)" | F"(((i18.i3.u286.p940!=1)||(i18.i4.u290.p952!=1))||(i19.i4.u302.p984!=1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9729733686228355759
[2021-05-17 15:03:17] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9729733686228355759
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/ltsmin9729733686228355759]
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/ltsmin9729733686228355759] 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/ltsmin9729733686228355759] 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-020B-04 finished in 48464 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F((G(p1)||G(p2))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 792 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 792/792 places, 792/792 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 219 transitions
Trivial Post-agglo rules discarded 219 transitions
Performed 219 trivial Post agglomeration. Transition count delta: 219
Iterating post reduction 0 with 219 rules applied. Total rules applied 219 place count 791 transition count 572
Reduce places removed 219 places and 0 transitions.
Iterating post reduction 1 with 219 rules applied. Total rules applied 438 place count 572 transition count 572
Performed 156 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 156 Pre rules applied. Total rules applied 438 place count 572 transition count 416
Deduced a syphon composed of 156 places in 1 ms
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 2 with 312 rules applied. Total rules applied 750 place count 416 transition count 416
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 757 place count 409 transition count 409
Iterating global reduction 2 with 7 rules applied. Total rules applied 764 place count 409 transition count 409
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 764 place count 409 transition count 405
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 772 place count 405 transition count 405
Performed 178 Post agglomeration using F-continuation condition.Transition count delta: 178
Deduced a syphon composed of 178 places in 0 ms
Reduce places removed 178 places and 0 transitions.
Iterating global reduction 2 with 356 rules applied. Total rules applied 1128 place count 227 transition count 227
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1129 place count 227 transition count 226
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 3 with 2 rules applied. Total rules applied 1131 place count 226 transition count 225
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -55
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 1247 place count 168 transition count 280
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1248 place count 167 transition count 279
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1249 place count 166 transition count 279
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1250 place count 165 transition count 278
Applied a total of 1250 rules in 137 ms. Remains 165 /792 variables (removed 627) and now considering 278/792 (removed 514) transitions.
// Phase 1: matrix 278 rows 165 cols
[2021-05-17 15:03:18] [INFO ] Computed 80 place invariants in 1 ms
[2021-05-17 15:03:18] [INFO ] Implicit Places using invariants in 228 ms returned []
// Phase 1: matrix 278 rows 165 cols
[2021-05-17 15:03:18] [INFO ] Computed 80 place invariants in 1 ms
[2021-05-17 15:03:18] [INFO ] State equation strengthened by 116 read => feed constraints.
[2021-05-17 15:03:19] [INFO ] Implicit Places using invariants and state equation in 603 ms returned []
Implicit Place search using SMT with State Equation took 836 ms to find 0 implicit places.
[2021-05-17 15:03:19] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 278 rows 165 cols
[2021-05-17 15:03:19] [INFO ] Computed 80 place invariants in 1 ms
[2021-05-17 15:03:19] [INFO ] Dead Transitions using invariants and state equation in 170 ms returned []
Finished structural reductions, in 1 iterations. Remains : 165/792 places, 278/792 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-020B-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={1} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s33 1), p1:(EQ s1 1), p2:(EQ s158 1)], nbAcceptance=2, 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 0 ms.
FORMULA ShieldRVt-PT-020B-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-05 finished in 1304 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 792 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 792/792 places, 792/792 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 218 transitions
Trivial Post-agglo rules discarded 218 transitions
Performed 218 trivial Post agglomeration. Transition count delta: 218
Iterating post reduction 0 with 218 rules applied. Total rules applied 218 place count 791 transition count 573
Reduce places removed 218 places and 0 transitions.
Iterating post reduction 1 with 218 rules applied. Total rules applied 436 place count 573 transition count 573
Performed 156 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 156 Pre rules applied. Total rules applied 436 place count 573 transition count 417
Deduced a syphon composed of 156 places in 1 ms
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 2 with 312 rules applied. Total rules applied 748 place count 417 transition count 417
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 755 place count 410 transition count 410
Iterating global reduction 2 with 7 rules applied. Total rules applied 762 place count 410 transition count 410
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 762 place count 410 transition count 405
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 772 place count 405 transition count 405
Performed 180 Post agglomeration using F-continuation condition.Transition count delta: 180
Deduced a syphon composed of 180 places in 0 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 2 with 360 rules applied. Total rules applied 1132 place count 225 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1133 place count 225 transition count 224
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 3 with 2 rules applied. Total rules applied 1135 place count 224 transition count 223
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -58
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1253 place count 165 transition count 281
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1254 place count 164 transition count 280
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1255 place count 163 transition count 280
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1256 place count 162 transition count 279
Applied a total of 1256 rules in 183 ms. Remains 162 /792 variables (removed 630) and now considering 279/792 (removed 513) transitions.
// Phase 1: matrix 279 rows 162 cols
[2021-05-17 15:03:19] [INFO ] Computed 80 place invariants in 0 ms
[2021-05-17 15:03:19] [INFO ] Implicit Places using invariants in 146 ms returned []
// Phase 1: matrix 279 rows 162 cols
[2021-05-17 15:03:19] [INFO ] Computed 80 place invariants in 1 ms
[2021-05-17 15:03:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 15:03:20] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
[2021-05-17 15:03:20] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 279 rows 162 cols
[2021-05-17 15:03:20] [INFO ] Computed 80 place invariants in 1 ms
[2021-05-17 15:03:20] [INFO ] Dead Transitions using invariants and state equation in 183 ms returned []
Finished structural reductions, in 1 iterations. Remains : 162/792 places, 279/792 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-020B-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s79 0)], 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 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-020B-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-07 finished in 811 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 792 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 792/792 places, 792/792 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 781 transition count 781
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 781 transition count 781
Applied a total of 22 rules in 52 ms. Remains 781 /792 variables (removed 11) and now considering 781/792 (removed 11) transitions.
// Phase 1: matrix 781 rows 781 cols
[2021-05-17 15:03:20] [INFO ] Computed 81 place invariants in 3 ms
[2021-05-17 15:03:20] [INFO ] Implicit Places using invariants in 218 ms returned []
// Phase 1: matrix 781 rows 781 cols
[2021-05-17 15:03:20] [INFO ] Computed 81 place invariants in 2 ms
[2021-05-17 15:03:21] [INFO ] Implicit Places using invariants and state equation in 684 ms returned []
Implicit Place search using SMT with State Equation took 904 ms to find 0 implicit places.
// Phase 1: matrix 781 rows 781 cols
[2021-05-17 15:03:21] [INFO ] Computed 81 place invariants in 3 ms
[2021-05-17 15:03:22] [INFO ] Dead Transitions using invariants and state equation in 731 ms returned []
Finished structural reductions, in 1 iterations. Remains : 781/792 places, 781/792 transitions.
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-020B-08 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 s717 1)], 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 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-020B-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-08 finished in 1801 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F((p0||X(p0)))||X((p1&&(p0 U p2)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 792 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 792/792 places, 792/792 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 782 transition count 782
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 782 transition count 782
Applied a total of 20 rules in 76 ms. Remains 782 /792 variables (removed 10) and now considering 782/792 (removed 10) transitions.
// Phase 1: matrix 782 rows 782 cols
[2021-05-17 15:03:22] [INFO ] Computed 81 place invariants in 3 ms
[2021-05-17 15:03:22] [INFO ] Implicit Places using invariants in 370 ms returned []
// Phase 1: matrix 782 rows 782 cols
[2021-05-17 15:03:22] [INFO ] Computed 81 place invariants in 4 ms
[2021-05-17 15:03:23] [INFO ] Implicit Places using invariants and state equation in 869 ms returned []
Implicit Place search using SMT with State Equation took 1240 ms to find 0 implicit places.
// Phase 1: matrix 782 rows 782 cols
[2021-05-17 15:03:23] [INFO ] Computed 81 place invariants in 2 ms
[2021-05-17 15:03:24] [INFO ] Dead Transitions using invariants and state equation in 759 ms returned []
Finished structural reductions, in 1 iterations. Remains : 782/792 places, 782/792 transitions.
Stuttering acceptance computed with spot in 101 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-020B-09 automaton TGBA [mat=[[{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s548 1), p1:(EQ s552 1), p2:(EQ s116 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 13 reset in 348 ms.
Stack based approach found an accepted trace after 582 steps with 0 reset with depth 583 and stack size 583 in 4 ms.
FORMULA ShieldRVt-PT-020B-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-09 finished in 2552 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 792 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 792/792 places, 792/792 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 216 transitions
Trivial Post-agglo rules discarded 216 transitions
Performed 216 trivial Post agglomeration. Transition count delta: 216
Iterating post reduction 0 with 216 rules applied. Total rules applied 216 place count 791 transition count 575
Reduce places removed 216 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 218 rules applied. Total rules applied 434 place count 575 transition count 573
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 436 place count 573 transition count 573
Performed 156 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 156 Pre rules applied. Total rules applied 436 place count 573 transition count 417
Deduced a syphon composed of 156 places in 0 ms
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 3 with 312 rules applied. Total rules applied 748 place count 417 transition count 417
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 756 place count 409 transition count 409
Iterating global reduction 3 with 8 rules applied. Total rules applied 764 place count 409 transition count 409
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 764 place count 409 transition count 404
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 774 place count 404 transition count 404
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 3 with 358 rules applied. Total rules applied 1132 place count 225 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1133 place count 225 transition count 224
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 1135 place count 224 transition count 223
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: -54
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 4 with 114 rules applied. Total rules applied 1249 place count 167 transition count 277
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1250 place count 166 transition count 276
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1251 place count 165 transition count 276
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1252 place count 164 transition count 275
Applied a total of 1252 rules in 105 ms. Remains 164 /792 variables (removed 628) and now considering 275/792 (removed 517) transitions.
// Phase 1: matrix 275 rows 164 cols
[2021-05-17 15:03:24] [INFO ] Computed 80 place invariants in 1 ms
[2021-05-17 15:03:25] [INFO ] Implicit Places using invariants in 152 ms returned []
// Phase 1: matrix 275 rows 164 cols
[2021-05-17 15:03:25] [INFO ] Computed 80 place invariants in 14 ms
[2021-05-17 15:03:25] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
[2021-05-17 15:03:25] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 275 rows 164 cols
[2021-05-17 15:03:25] [INFO ] Computed 80 place invariants in 8 ms
[2021-05-17 15:03:25] [INFO ] Dead Transitions using invariants and state equation in 184 ms returned []
Finished structural reductions, in 1 iterations. Remains : 164/792 places, 275/792 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-020B-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s59 1) (NEQ s109 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 5877 steps with 3 reset in 34 ms.
FORMULA ShieldRVt-PT-020B-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-10 finished in 805 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 792 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 792/792 places, 792/792 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 220 transitions
Trivial Post-agglo rules discarded 220 transitions
Performed 220 trivial Post agglomeration. Transition count delta: 220
Iterating post reduction 0 with 220 rules applied. Total rules applied 220 place count 791 transition count 571
Reduce places removed 220 places and 0 transitions.
Iterating post reduction 1 with 220 rules applied. Total rules applied 440 place count 571 transition count 571
Performed 156 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 156 Pre rules applied. Total rules applied 440 place count 571 transition count 415
Deduced a syphon composed of 156 places in 0 ms
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 2 with 312 rules applied. Total rules applied 752 place count 415 transition count 415
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 759 place count 408 transition count 408
Iterating global reduction 2 with 7 rules applied. Total rules applied 766 place count 408 transition count 408
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 766 place count 408 transition count 404
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 774 place count 404 transition count 404
Performed 180 Post agglomeration using F-continuation condition.Transition count delta: 180
Deduced a syphon composed of 180 places in 0 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 2 with 360 rules applied. Total rules applied 1134 place count 224 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1135 place count 224 transition count 223
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 3 with 2 rules applied. Total rules applied 1137 place count 223 transition count 222
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -57
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1255 place count 164 transition count 279
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1256 place count 163 transition count 278
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1257 place count 162 transition count 278
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1258 place count 161 transition count 277
Applied a total of 1258 rules in 69 ms. Remains 161 /792 variables (removed 631) and now considering 277/792 (removed 515) transitions.
// Phase 1: matrix 277 rows 161 cols
[2021-05-17 15:03:25] [INFO ] Computed 80 place invariants in 1 ms
[2021-05-17 15:03:25] [INFO ] Implicit Places using invariants in 129 ms returned []
// Phase 1: matrix 277 rows 161 cols
[2021-05-17 15:03:25] [INFO ] Computed 80 place invariants in 1 ms
[2021-05-17 15:03:25] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
[2021-05-17 15:03:25] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 277 rows 161 cols
[2021-05-17 15:03:25] [INFO ] Computed 80 place invariants in 1 ms
[2021-05-17 15:03:26] [INFO ] Dead Transitions using invariants and state equation in 213 ms returned []
Finished structural reductions, in 1 iterations. Remains : 161/792 places, 277/792 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-020B-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s144 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-020B-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-11 finished in 698 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(((p0 U ((p0&&(G(p1)||X(p2)))||G(p0)))&&(!p0||X(p3)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 792 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 792/792 places, 792/792 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 781 transition count 781
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 781 transition count 781
Applied a total of 22 rules in 83 ms. Remains 781 /792 variables (removed 11) and now considering 781/792 (removed 11) transitions.
// Phase 1: matrix 781 rows 781 cols
[2021-05-17 15:03:26] [INFO ] Computed 81 place invariants in 2 ms
[2021-05-17 15:03:26] [INFO ] Implicit Places using invariants in 410 ms returned []
// Phase 1: matrix 781 rows 781 cols
[2021-05-17 15:03:26] [INFO ] Computed 81 place invariants in 3 ms
[2021-05-17 15:03:27] [INFO ] Implicit Places using invariants and state equation in 969 ms returned []
Implicit Place search using SMT with State Equation took 1381 ms to find 0 implicit places.
// Phase 1: matrix 781 rows 781 cols
[2021-05-17 15:03:27] [INFO ] Computed 81 place invariants in 2 ms
[2021-05-17 15:03:28] [INFO ] Dead Transitions using invariants and state equation in 789 ms returned []
Finished structural reductions, in 1 iterations. Remains : 781/792 places, 781/792 transitions.
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p3) (NOT p0)), true, (OR (NOT p0) (NOT p3))]
Running random walk in product with property : ShieldRVt-PT-020B-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (NOT p0) (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(AND p0 p3), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s137 1), p3:(EQ s759 1)], 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 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-020B-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-13 finished in 2369 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((F(G(p1))&&p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 792 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 792/792 places, 792/792 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 216 transitions
Trivial Post-agglo rules discarded 216 transitions
Performed 216 trivial Post agglomeration. Transition count delta: 216
Iterating post reduction 0 with 216 rules applied. Total rules applied 216 place count 791 transition count 575
Reduce places removed 216 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 218 rules applied. Total rules applied 434 place count 575 transition count 573
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 436 place count 573 transition count 573
Performed 156 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 156 Pre rules applied. Total rules applied 436 place count 573 transition count 417
Deduced a syphon composed of 156 places in 1 ms
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 3 with 312 rules applied. Total rules applied 748 place count 417 transition count 417
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 756 place count 409 transition count 409
Iterating global reduction 3 with 8 rules applied. Total rules applied 764 place count 409 transition count 409
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 764 place count 409 transition count 404
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 774 place count 404 transition count 404
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 1 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 3 with 358 rules applied. Total rules applied 1132 place count 225 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1133 place count 225 transition count 224
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 1135 place count 224 transition count 223
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: -54
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 4 with 114 rules applied. Total rules applied 1249 place count 167 transition count 277
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1250 place count 166 transition count 276
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1251 place count 165 transition count 276
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1252 place count 164 transition count 275
Applied a total of 1252 rules in 105 ms. Remains 164 /792 variables (removed 628) and now considering 275/792 (removed 517) transitions.
// Phase 1: matrix 275 rows 164 cols
[2021-05-17 15:03:28] [INFO ] Computed 80 place invariants in 1 ms
[2021-05-17 15:03:28] [INFO ] Implicit Places using invariants in 263 ms returned []
// Phase 1: matrix 275 rows 164 cols
[2021-05-17 15:03:28] [INFO ] Computed 80 place invariants in 1 ms
[2021-05-17 15:03:29] [INFO ] Implicit Places using invariants and state equation in 416 ms returned []
Implicit Place search using SMT with State Equation took 681 ms to find 0 implicit places.
[2021-05-17 15:03:29] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 275 rows 164 cols
[2021-05-17 15:03:29] [INFO ] Computed 80 place invariants in 1 ms
[2021-05-17 15:03:29] [INFO ] Dead Transitions using invariants and state equation in 295 ms returned []
Finished structural reductions, in 1 iterations. Remains : 164/792 places, 275/792 transitions.
Stuttering acceptance computed with spot in 288 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-020B-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s115 1) (EQ s19 1)), p1:(EQ s19 0)], 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 1 ms.
FORMULA ShieldRVt-PT-020B-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-14 finished in 1393 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(F(p0)) U (X(!p0)&&p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 792 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 792/792 places, 792/792 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 782 transition count 782
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 782 transition count 782
Applied a total of 20 rules in 82 ms. Remains 782 /792 variables (removed 10) and now considering 782/792 (removed 10) transitions.
// Phase 1: matrix 782 rows 782 cols
[2021-05-17 15:03:30] [INFO ] Computed 81 place invariants in 12 ms
[2021-05-17 15:03:30] [INFO ] Implicit Places using invariants in 437 ms returned []
// Phase 1: matrix 782 rows 782 cols
[2021-05-17 15:03:30] [INFO ] Computed 81 place invariants in 4 ms
[2021-05-17 15:03:31] [INFO ] Implicit Places using invariants and state equation in 1093 ms returned []
Implicit Place search using SMT with State Equation took 1532 ms to find 0 implicit places.
// Phase 1: matrix 782 rows 782 cols
[2021-05-17 15:03:31] [INFO ] Computed 81 place invariants in 2 ms
[2021-05-17 15:03:32] [INFO ] Dead Transitions using invariants and state equation in 901 ms returned []
Finished structural reductions, in 1 iterations. Remains : 782/792 places, 782/792 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p1) p0), (NOT p0), (NOT p0), p0]
Running random walk in product with property : ShieldRVt-PT-020B-15 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(NOT p1), acceptance={0} source=0 dest: 2}, { cond=p1, acceptance={0} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 0}, { cond=p0, acceptance={0} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s291 1) (EQ s521 1)), p0:(EQ s152 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 18566 steps with 0 reset in 61 ms.
FORMULA ShieldRVt-PT-020B-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-15 finished in 2745 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4132921693721642711
[2021-05-17 15:03:32] [INFO ] Computing symmetric may disable matrix : 792 transitions.
[2021-05-17 15:03:32] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 15:03:32] [INFO ] Computing symmetric may enable matrix : 792 transitions.
[2021-05-17 15:03:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 15:03:32] [INFO ] Applying decomposition
[2021-05-17 15:03:32] [INFO ] Flatten gal took : 31 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/graph5420988160363951115.txt, -o, /tmp/graph5420988160363951115.bin, -w, /tmp/graph5420988160363951115.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/graph5420988160363951115.bin, -l, -1, -v, -w, /tmp/graph5420988160363951115.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 15:03:32] [INFO ] Decomposing Gal with order
[2021-05-17 15:03:32] [INFO ] Computing Do-Not-Accords matrix : 792 transitions.
[2021-05-17 15:03:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 15:03:32] [INFO ] Computation of Completed DNA matrix. took 35 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 15:03:32] [INFO ] Built C files in 192ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4132921693721642711
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/ltsmin4132921693721642711]
[2021-05-17 15:03:33] [INFO ] Removed a total of 191 redundant transitions.
[2021-05-17 15:03:33] [INFO ] Flatten gal took : 83 ms
[2021-05-17 15:03:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 13 ms.
[2021-05-17 15:03:33] [INFO ] Time to serialize gal into /tmp/LTLFireability3611609928623392685.gal : 16 ms
[2021-05-17 15:03:33] [INFO ] Time to serialize properties into /tmp/LTLFireability9846237022513032026.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/LTLFireability3611609928623392685.gal, -t, CGAL, -LTL, /tmp/LTLFireability9846237022513032026.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/LTLFireability3611609928623392685.gal -t CGAL -LTL /tmp/LTLFireability9846237022513032026.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((("(i0.i0.u115.p366!=1)")U((("(i0.i0.u115.p366!=1)")&&(F(!("(((i18.i3.u291.p940==1)&&(i18.i4.u294.p952==1))&&(i19.i3.u308.p984==1))"))))||(G("(i0.i0.u115.p366!=1)"))))U(((X("(i0.i0.u115.p366!=1)"))&&(("(i0.i0.u115.p366!=1)")U((("(i0.i0.u115.p366!=1)")&&(F(!("(((i18.i3.u291.p940==1)&&(i18.i4.u294.p952==1))&&(i19.i3.u308.p984==1))"))))||(G("(i0.i0.u115.p366!=1)")))))||(G(("(i0.i0.u115.p366!=1)")U((("(i0.i0.u115.p366!=1)")&&(F(!("(((i18.i3.u291.p940==1)&&(i18.i4.u294.p952==1))&&(i19.i3.u308.p984==1))"))))||(G("(i0.i0.u115.p366!=1)"))))))))
Formula 0 simplified : !(("(i0.i0.u115.p366!=1)" U (("(i0.i0.u115.p366!=1)" & F!"(((i18.i3.u291.p940==1)&&(i18.i4.u294.p952==1))&&(i19.i3.u308.p984==1))") | G"(i0.i0.u115.p366!=1)")) U ((("(i0.i0.u115.p366!=1)" U (("(i0.i0.u115.p366!=1)" & F!"(((i18.i3.u291.p940==1)&&(i18.i4.u294.p952==1))&&(i19.i3.u308.p984==1))") | G"(i0.i0.u115.p366!=1)")) & X"(i0.i0.u115.p366!=1)") | G("(i0.i0.u115.p366!=1)" U (("(i0.i0.u115.p366!=1)" & F!"(((i18.i3.u291.p940==1)&&(i18.i4.u294.p952==1))&&(i19.i3.u308.p984==1))") | G"(i0.i0.u115.p366!=1)"))))
Compilation finished in 8368 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin4132921693721642711]
Link finished in 67 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (([]((LTLAPp0==true))||((LTLAPp0==true)&&<>((LTLAPp1==true))))&&X((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin4132921693721642711]
LTSmin run took 723 ms.
FORMULA ShieldRVt-PT-020B-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1621263823375

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

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