MCC'2021- Execution of r216-tall-162098205100445

About the Execution of ITS-Tools for ShieldIIPt-PT-020B

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
16248.168	3600000.00	5470764.00	216105.10	FFTFFFFFFTTFFF?F	normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r216-tall-162098205100445.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldIIPt-PT-020B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r216-tall-162098205100445
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 119K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 78K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 28 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 27 12:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 27 12:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 17:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 17:54 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 338K 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 ShieldIIPt-PT-020B-00
FORMULA_NAME ShieldIIPt-PT-020B-01
FORMULA_NAME ShieldIIPt-PT-020B-02
FORMULA_NAME ShieldIIPt-PT-020B-03
FORMULA_NAME ShieldIIPt-PT-020B-04
FORMULA_NAME ShieldIIPt-PT-020B-05
FORMULA_NAME ShieldIIPt-PT-020B-06
FORMULA_NAME ShieldIIPt-PT-020B-07
FORMULA_NAME ShieldIIPt-PT-020B-08
FORMULA_NAME ShieldIIPt-PT-020B-09
FORMULA_NAME ShieldIIPt-PT-020B-10
FORMULA_NAME ShieldIIPt-PT-020B-11
FORMULA_NAME ShieldIIPt-PT-020B-12
FORMULA_NAME ShieldIIPt-PT-020B-13
FORMULA_NAME ShieldIIPt-PT-020B-14
FORMULA_NAME ShieldIIPt-PT-020B-15

=== Now, execution of the tool begins

BK_START 1621103263278

Running Version 0
[2021-05-15 18:27:55] [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-15 18:27:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-15 18:27:55] [INFO ] Load time of PNML (sax parser for PT used): 113 ms
[2021-05-15 18:27:56] [INFO ] Transformed 1403 places.
[2021-05-15 18:27:56] [INFO ] Transformed 1303 transitions.
[2021-05-15 18:27:56] [INFO ] Found NUPN structural information;
[2021-05-15 18:27:56] [INFO ] Parsed PT model containing 1403 places and 1303 transitions in 192 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-15 18:27:56] [INFO ] Initial state test concluded for 3 properties.
FORMULA ShieldIIPt-PT-020B-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 1403 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1403/1403 places, 1303/1303 transitions.
Discarding 212 places :
Symmetric choice reduction at 0 with 212 rule applications. Total rules 212 place count 1191 transition count 1091
Iterating global reduction 0 with 212 rules applied. Total rules applied 424 place count 1191 transition count 1091
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 425 place count 1190 transition count 1090
Iterating global reduction 0 with 1 rules applied. Total rules applied 426 place count 1190 transition count 1090
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 427 place count 1189 transition count 1089
Iterating global reduction 0 with 1 rules applied. Total rules applied 428 place count 1189 transition count 1089
Applied a total of 428 rules in 497 ms. Remains 1189 /1403 variables (removed 214) and now considering 1089/1303 (removed 214) transitions.
// Phase 1: matrix 1089 rows 1189 cols
[2021-05-15 18:27:56] [INFO ] Computed 181 place invariants in 27 ms
[2021-05-15 18:27:57] [INFO ] Implicit Places using invariants in 493 ms returned []
// Phase 1: matrix 1089 rows 1189 cols
[2021-05-15 18:27:57] [INFO ] Computed 181 place invariants in 7 ms
[2021-05-15 18:27:58] [INFO ] Implicit Places using invariants and state equation in 893 ms returned []
Implicit Place search using SMT with State Equation took 1414 ms to find 0 implicit places.
// Phase 1: matrix 1089 rows 1189 cols
[2021-05-15 18:27:58] [INFO ] Computed 181 place invariants in 9 ms
[2021-05-15 18:27:58] [INFO ] Dead Transitions using invariants and state equation in 513 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1189/1403 places, 1089/1303 transitions.
[2021-05-15 18:27:58] [INFO ] Initial state reduction rules for LTL removed 5 formulas.
[2021-05-15 18:27:58] [INFO ] Flatten gal took : 109 ms
FORMULA ShieldIIPt-PT-020B-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020B-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020B-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020B-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020B-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-15 18:27:58] [INFO ] Flatten gal took : 67 ms
[2021-05-15 18:27:59] [INFO ] Input system was already deterministic with 1089 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 673 ms. (steps per millisecond=148 ) properties (out of 27) seen :17
Running SMT prover for 10 properties.
// Phase 1: matrix 1089 rows 1189 cols
[2021-05-15 18:27:59] [INFO ] Computed 181 place invariants in 17 ms
[2021-05-15 18:28:00] [INFO ] [Real]Absence check using 181 positive place invariants in 49 ms returned sat
[2021-05-15 18:28:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 18:28:00] [INFO ] [Real]Absence check using state equation in 386 ms returned sat
[2021-05-15 18:28:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 18:28:00] [INFO ] [Nat]Absence check using 181 positive place invariants in 49 ms returned sat
[2021-05-15 18:28:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 18:28:01] [INFO ] [Nat]Absence check using state equation in 398 ms returned sat
[2021-05-15 18:28:01] [INFO ] Deduced a trap composed of 22 places in 249 ms of which 4 ms to minimize.
[2021-05-15 18:28:01] [INFO ] Deduced a trap composed of 16 places in 267 ms of which 2 ms to minimize.
[2021-05-15 18:28:01] [INFO ] Deduced a trap composed of 22 places in 242 ms of which 2 ms to minimize.
[2021-05-15 18:28:02] [INFO ] Deduced a trap composed of 21 places in 276 ms of which 1 ms to minimize.
[2021-05-15 18:28:02] [INFO ] Deduced a trap composed of 23 places in 236 ms of which 1 ms to minimize.
[2021-05-15 18:28:02] [INFO ] Deduced a trap composed of 14 places in 217 ms of which 2 ms to minimize.
[2021-05-15 18:28:03] [INFO ] Deduced a trap composed of 22 places in 216 ms of which 1 ms to minimize.
[2021-05-15 18:28:03] [INFO ] Deduced a trap composed of 23 places in 214 ms of which 0 ms to minimize.
[2021-05-15 18:28:03] [INFO ] Deduced a trap composed of 19 places in 200 ms of which 0 ms to minimize.
[2021-05-15 18:28:03] [INFO ] Deduced a trap composed of 17 places in 195 ms of which 1 ms to minimize.
[2021-05-15 18:28:03] [INFO ] Deduced a trap composed of 23 places in 193 ms of which 1 ms to minimize.
[2021-05-15 18:28:04] [INFO ] Deduced a trap composed of 26 places in 177 ms of which 1 ms to minimize.
[2021-05-15 18:28:04] [INFO ] Deduced a trap composed of 22 places in 178 ms of which 0 ms to minimize.
[2021-05-15 18:28:04] [INFO ] Deduced a trap composed of 24 places in 167 ms of which 1 ms to minimize.
[2021-05-15 18:28:04] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 1 ms to minimize.
[2021-05-15 18:28:04] [INFO ] Deduced a trap composed of 35 places in 150 ms of which 1 ms to minimize.
[2021-05-15 18:28:05] [INFO ] Deduced a trap composed of 39 places in 134 ms of which 0 ms to minimize.
[2021-05-15 18:28:05] [INFO ] Deduced a trap composed of 30 places in 137 ms of which 0 ms to minimize.
[2021-05-15 18:28:05] [INFO ] Deduced a trap composed of 26 places in 146 ms of which 1 ms to minimize.
[2021-05-15 18:28:05] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 0 ms to minimize.
[2021-05-15 18:28:05] [INFO ] Deduced a trap composed of 34 places in 125 ms of which 0 ms to minimize.
[2021-05-15 18:28:06] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 1 ms to minimize.
[2021-05-15 18:28:06] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 1 ms to minimize.
[2021-05-15 18:28:06] [INFO ] Deduced a trap composed of 28 places in 115 ms of which 1 ms to minimize.
[2021-05-15 18:28:06] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 0 ms to minimize.
[2021-05-15 18:28:06] [INFO ] Deduced a trap composed of 32 places in 129 ms of which 1 ms to minimize.
[2021-05-15 18:28:06] [INFO ] Deduced a trap composed of 34 places in 129 ms of which 0 ms to minimize.
[2021-05-15 18:28:06] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 1 ms to minimize.
[2021-05-15 18:28:07] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 0 ms to minimize.
[2021-05-15 18:28:07] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 0 ms to minimize.
[2021-05-15 18:28:07] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 0 ms to minimize.
[2021-05-15 18:28:07] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 0 ms to minimize.
[2021-05-15 18:28:07] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 0 ms to minimize.
[2021-05-15 18:28:07] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 6541 ms
[2021-05-15 18:28:07] [INFO ] Computed and/alt/rep : 1088/1634/1088 causal constraints (skipped 0 transitions) in 70 ms.
[2021-05-15 18:28:13] [INFO ] Added : 30 causal constraints over 6 iterations in 5531 ms. Result :sat
[2021-05-15 18:28:13] [INFO ] [Real]Absence check using 181 positive place invariants in 79 ms returned sat
[2021-05-15 18:28:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 18:28:13] [INFO ] [Real]Absence check using state equation in 381 ms returned sat
[2021-05-15 18:28:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 18:28:14] [INFO ] [Nat]Absence check using 181 positive place invariants in 48 ms returned sat
[2021-05-15 18:28:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 18:28:14] [INFO ] [Nat]Absence check using state equation in 369 ms returned sat
[2021-05-15 18:28:15] [INFO ] Deduced a trap composed of 20 places in 236 ms of which 4 ms to minimize.
[2021-05-15 18:28:15] [INFO ] Deduced a trap composed of 16 places in 214 ms of which 1 ms to minimize.
[2021-05-15 18:28:15] [INFO ] Deduced a trap composed of 20 places in 202 ms of which 1 ms to minimize.
[2021-05-15 18:28:15] [INFO ] Deduced a trap composed of 19 places in 215 ms of which 1 ms to minimize.
[2021-05-15 18:28:16] [INFO ] Deduced a trap composed of 21 places in 198 ms of which 1 ms to minimize.
[2021-05-15 18:28:16] [INFO ] Deduced a trap composed of 31 places in 190 ms of which 0 ms to minimize.
[2021-05-15 18:28:16] [INFO ] Deduced a trap composed of 25 places in 185 ms of which 0 ms to minimize.
[2021-05-15 18:28:16] [INFO ] Deduced a trap composed of 27 places in 189 ms of which 1 ms to minimize.
[2021-05-15 18:28:16] [INFO ] Deduced a trap composed of 25 places in 187 ms of which 1 ms to minimize.
[2021-05-15 18:28:17] [INFO ] Deduced a trap composed of 29 places in 193 ms of which 1 ms to minimize.
[2021-05-15 18:28:17] [INFO ] Deduced a trap composed of 25 places in 182 ms of which 0 ms to minimize.
[2021-05-15 18:28:17] [INFO ] Deduced a trap composed of 37 places in 170 ms of which 0 ms to minimize.
[2021-05-15 18:28:17] [INFO ] Deduced a trap composed of 33 places in 168 ms of which 1 ms to minimize.
[2021-05-15 18:28:18] [INFO ] Deduced a trap composed of 33 places in 170 ms of which 1 ms to minimize.
[2021-05-15 18:28:18] [INFO ] Deduced a trap composed of 38 places in 164 ms of which 1 ms to minimize.
[2021-05-15 18:28:18] [INFO ] Deduced a trap composed of 21 places in 166 ms of which 0 ms to minimize.
[2021-05-15 18:28:18] [INFO ] Deduced a trap composed of 36 places in 164 ms of which 1 ms to minimize.
[2021-05-15 18:28:18] [INFO ] Deduced a trap composed of 35 places in 160 ms of which 0 ms to minimize.
[2021-05-15 18:28:19] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 1 ms to minimize.
[2021-05-15 18:28:19] [INFO ] Deduced a trap composed of 31 places in 150 ms of which 0 ms to minimize.
[2021-05-15 18:28:19] [INFO ] Deduced a trap composed of 30 places in 147 ms of which 0 ms to minimize.
[2021-05-15 18:28:19] [INFO ] Deduced a trap composed of 30 places in 141 ms of which 1 ms to minimize.
[2021-05-15 18:28:19] [INFO ] Deduced a trap composed of 34 places in 147 ms of which 8 ms to minimize.
[2021-05-15 18:28:19] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 0 ms to minimize.
[2021-05-15 18:28:20] [INFO ] Deduced a trap composed of 40 places in 133 ms of which 0 ms to minimize.
[2021-05-15 18:28:20] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 1 ms to minimize.
[2021-05-15 18:28:20] [INFO ] Deduced a trap composed of 37 places in 115 ms of which 0 ms to minimize.
[2021-05-15 18:28:20] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 1 ms to minimize.
[2021-05-15 18:28:20] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 1 ms to minimize.
[2021-05-15 18:28:20] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 1 ms to minimize.
[2021-05-15 18:28:20] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 0 ms to minimize.
[2021-05-15 18:28:21] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 6171 ms
[2021-05-15 18:28:21] [INFO ] Computed and/alt/rep : 1088/1634/1088 causal constraints (skipped 0 transitions) in 59 ms.
[2021-05-15 18:28:33] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
[2021-05-15 18:28:33] [INFO ] [Real]Absence check using 181 positive place invariants in 44 ms returned sat
[2021-05-15 18:28:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 18:28:34] [INFO ] [Real]Absence check using state equation in 354 ms returned sat
[2021-05-15 18:28:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 18:28:34] [INFO ] [Nat]Absence check using 181 positive place invariants in 44 ms returned sat
[2021-05-15 18:28:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 18:28:34] [INFO ] [Nat]Absence check using state equation in 359 ms returned sat
[2021-05-15 18:28:35] [INFO ] Deduced a trap composed of 16 places in 192 ms of which 0 ms to minimize.
[2021-05-15 18:28:35] [INFO ] Deduced a trap composed of 32 places in 189 ms of which 3 ms to minimize.
[2021-05-15 18:28:35] [INFO ] Deduced a trap composed of 17 places in 190 ms of which 1 ms to minimize.
[2021-05-15 18:28:35] [INFO ] Deduced a trap composed of 17 places in 189 ms of which 1 ms to minimize.
[2021-05-15 18:28:35] [INFO ] Deduced a trap composed of 21 places in 190 ms of which 11 ms to minimize.
[2021-05-15 18:28:36] [INFO ] Deduced a trap composed of 24 places in 185 ms of which 1 ms to minimize.
[2021-05-15 18:28:36] [INFO ] Deduced a trap composed of 25 places in 185 ms of which 0 ms to minimize.
[2021-05-15 18:28:36] [INFO ] Deduced a trap composed of 32 places in 176 ms of which 1 ms to minimize.
[2021-05-15 18:28:36] [INFO ] Deduced a trap composed of 33 places in 175 ms of which 1 ms to minimize.
[2021-05-15 18:28:37] [INFO ] Deduced a trap composed of 32 places in 172 ms of which 0 ms to minimize.
[2021-05-15 18:28:37] [INFO ] Deduced a trap composed of 19 places in 165 ms of which 0 ms to minimize.
[2021-05-15 18:28:37] [INFO ] Deduced a trap composed of 34 places in 169 ms of which 1 ms to minimize.
[2021-05-15 18:28:37] [INFO ] Deduced a trap composed of 21 places in 162 ms of which 1 ms to minimize.
[2021-05-15 18:28:37] [INFO ] Deduced a trap composed of 18 places in 152 ms of which 1 ms to minimize.
[2021-05-15 18:28:38] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 1 ms to minimize.
[2021-05-15 18:28:38] [INFO ] Deduced a trap composed of 26 places in 142 ms of which 1 ms to minimize.
[2021-05-15 18:28:38] [INFO ] Deduced a trap composed of 32 places in 141 ms of which 1 ms to minimize.
[2021-05-15 18:28:54] [INFO ] Deduced a trap composed of 14 places in 400 ms of which 1 ms to minimize.
[2021-05-15 18:28:54] [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-15 18:28:54] [INFO ] [Real]Absence check using 181 positive place invariants in 44 ms returned sat
[2021-05-15 18:28:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 18:28:55] [INFO ] [Real]Absence check using state equation in 353 ms returned sat
[2021-05-15 18:28:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 18:28:55] [INFO ] [Nat]Absence check using 181 positive place invariants in 45 ms returned sat
[2021-05-15 18:28:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 18:28:55] [INFO ] [Nat]Absence check using state equation in 349 ms returned sat
[2021-05-15 18:28:56] [INFO ] Deduced a trap composed of 18 places in 207 ms of which 0 ms to minimize.
[2021-05-15 18:28:56] [INFO ] Deduced a trap composed of 22 places in 213 ms of which 1 ms to minimize.
[2021-05-15 18:28:56] [INFO ] Deduced a trap composed of 21 places in 202 ms of which 0 ms to minimize.
[2021-05-15 18:28:56] [INFO ] Deduced a trap composed of 18 places in 197 ms of which 0 ms to minimize.
[2021-05-15 18:28:56] [INFO ] Deduced a trap composed of 20 places in 198 ms of which 1 ms to minimize.
[2021-05-15 18:28:57] [INFO ] Deduced a trap composed of 20 places in 198 ms of which 1 ms to minimize.
[2021-05-15 18:28:57] [INFO ] Deduced a trap composed of 14 places in 186 ms of which 1 ms to minimize.
[2021-05-15 18:28:57] [INFO ] Deduced a trap composed of 25 places in 182 ms of which 0 ms to minimize.
[2021-05-15 18:28:57] [INFO ] Deduced a trap composed of 21 places in 181 ms of which 1 ms to minimize.
[2021-05-15 18:28:58] [INFO ] Deduced a trap composed of 14 places in 170 ms of which 1 ms to minimize.
[2021-05-15 18:28:58] [INFO ] Deduced a trap composed of 31 places in 171 ms of which 1 ms to minimize.
[2021-05-15 18:28:58] [INFO ] Deduced a trap composed of 28 places in 154 ms of which 0 ms to minimize.
[2021-05-15 18:28:58] [INFO ] Deduced a trap composed of 26 places in 150 ms of which 1 ms to minimize.
[2021-05-15 18:28:58] [INFO ] Deduced a trap composed of 25 places in 149 ms of which 0 ms to minimize.
[2021-05-15 18:28:59] [INFO ] Deduced a trap composed of 26 places in 148 ms of which 1 ms to minimize.
[2021-05-15 18:28:59] [INFO ] Deduced a trap composed of 32 places in 142 ms of which 1 ms to minimize.
[2021-05-15 18:28:59] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 1 ms to minimize.
[2021-05-15 18:28:59] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 1 ms to minimize.
[2021-05-15 18:28:59] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 1 ms to minimize.
[2021-05-15 18:28:59] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 0 ms to minimize.
[2021-05-15 18:29:00] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 0 ms to minimize.
[2021-05-15 18:29:00] [INFO ] Deduced a trap composed of 33 places in 124 ms of which 0 ms to minimize.
[2021-05-15 18:29:00] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 0 ms to minimize.
[2021-05-15 18:29:00] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 0 ms to minimize.
[2021-05-15 18:29:00] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 0 ms to minimize.
[2021-05-15 18:29:00] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 1 ms to minimize.
[2021-05-15 18:29:00] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 0 ms to minimize.
[2021-05-15 18:29:01] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 0 ms to minimize.
[2021-05-15 18:29:01] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 1 ms to minimize.
[2021-05-15 18:29:01] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 1 ms to minimize.
[2021-05-15 18:29:01] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 0 ms to minimize.
[2021-05-15 18:29:01] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 0 ms to minimize.
[2021-05-15 18:29:01] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 5770 ms
[2021-05-15 18:29:01] [INFO ] Computed and/alt/rep : 1088/1634/1088 causal constraints (skipped 0 transitions) in 57 ms.
[2021-05-15 18:29:15] [INFO ] Deduced a trap composed of 14 places in 390 ms of which 1 ms to minimize.
[2021-05-15 18:29:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
[2021-05-15 18:29:15] [INFO ] [Real]Absence check using 181 positive place invariants in 44 ms returned sat
[2021-05-15 18:29:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 18:29:16] [INFO ] [Real]Absence check using state equation in 334 ms returned sat
[2021-05-15 18:29:16] [INFO ] Deduced a trap composed of 22 places in 225 ms of which 5 ms to minimize.
[2021-05-15 18:29:16] [INFO ] Deduced a trap composed of 20 places in 208 ms of which 1 ms to minimize.
[2021-05-15 18:29:16] [INFO ] Deduced a trap composed of 16 places in 205 ms of which 0 ms to minimize.
[2021-05-15 18:29:17] [INFO ] Deduced a trap composed of 24 places in 202 ms of which 1 ms to minimize.
[2021-05-15 18:29:17] [INFO ] Deduced a trap composed of 16 places in 200 ms of which 1 ms to minimize.
[2021-05-15 18:29:17] [INFO ] Deduced a trap composed of 26 places in 200 ms of which 1 ms to minimize.
[2021-05-15 18:29:17] [INFO ] Deduced a trap composed of 18 places in 194 ms of which 1 ms to minimize.
[2021-05-15 18:29:18] [INFO ] Deduced a trap composed of 19 places in 193 ms of which 1 ms to minimize.
[2021-05-15 18:29:18] [INFO ] Deduced a trap composed of 16 places in 190 ms of which 1 ms to minimize.
[2021-05-15 18:29:18] [INFO ] Deduced a trap composed of 26 places in 180 ms of which 0 ms to minimize.
[2021-05-15 18:29:18] [INFO ] Deduced a trap composed of 32 places in 177 ms of which 0 ms to minimize.
[2021-05-15 18:29:18] [INFO ] Deduced a trap composed of 23 places in 173 ms of which 1 ms to minimize.
[2021-05-15 18:29:19] [INFO ] Deduced a trap composed of 34 places in 188 ms of which 0 ms to minimize.
[2021-05-15 18:29:19] [INFO ] Deduced a trap composed of 35 places in 168 ms of which 0 ms to minimize.
[2021-05-15 18:29:19] [INFO ] Deduced a trap composed of 32 places in 166 ms of which 0 ms to minimize.
[2021-05-15 18:29:19] [INFO ] Deduced a trap composed of 24 places in 166 ms of which 0 ms to minimize.
[2021-05-15 18:29:20] [INFO ] Deduced a trap composed of 31 places in 152 ms of which 1 ms to minimize.
[2021-05-15 18:29:20] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 0 ms to minimize.
[2021-05-15 18:29:20] [INFO ] Deduced a trap composed of 26 places in 150 ms of which 0 ms to minimize.
[2021-05-15 18:29:20] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 1 ms to minimize.
[2021-05-15 18:29:20] [INFO ] Deduced a trap composed of 32 places in 142 ms of which 1 ms to minimize.
[2021-05-15 18:29:20] [INFO ] Deduced a trap composed of 28 places in 137 ms of which 1 ms to minimize.
[2021-05-15 18:29:21] [INFO ] Deduced a trap composed of 33 places in 130 ms of which 0 ms to minimize.
[2021-05-15 18:29:21] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 0 ms to minimize.
[2021-05-15 18:29:21] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 1 ms to minimize.
[2021-05-15 18:29:21] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 0 ms to minimize.
[2021-05-15 18:29:21] [INFO ] Deduced a trap composed of 34 places in 112 ms of which 1 ms to minimize.
[2021-05-15 18:29:21] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 1 ms to minimize.
[2021-05-15 18:29:22] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 0 ms to minimize.
[2021-05-15 18:29:22] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 0 ms to minimize.
[2021-05-15 18:29:22] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 0 ms to minimize.
[2021-05-15 18:29:22] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 0 ms to minimize.
[2021-05-15 18:29:22] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 0 ms to minimize.
[2021-05-15 18:29:22] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 0 ms to minimize.
[2021-05-15 18:29:22] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 6514 ms
[2021-05-15 18:29:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 18:29:22] [INFO ] [Nat]Absence check using 181 positive place invariants in 47 ms returned sat
[2021-05-15 18:29:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 18:29:23] [INFO ] [Nat]Absence check using state equation in 344 ms returned sat
[2021-05-15 18:29:23] [INFO ] Deduced a trap composed of 22 places in 222 ms of which 1 ms to minimize.
[2021-05-15 18:29:23] [INFO ] Deduced a trap composed of 20 places in 211 ms of which 1 ms to minimize.
[2021-05-15 18:29:24] [INFO ] Deduced a trap composed of 16 places in 207 ms of which 0 ms to minimize.
[2021-05-15 18:29:24] [INFO ] Deduced a trap composed of 24 places in 209 ms of which 1 ms to minimize.
[2021-05-15 18:29:24] [INFO ] Deduced a trap composed of 16 places in 208 ms of which 8 ms to minimize.
[2021-05-15 18:29:24] [INFO ] Deduced a trap composed of 26 places in 199 ms of which 1 ms to minimize.
[2021-05-15 18:29:24] [INFO ] Deduced a trap composed of 23 places in 192 ms of which 0 ms to minimize.
[2021-05-15 18:29:25] [INFO ] Deduced a trap composed of 24 places in 187 ms of which 1 ms to minimize.
[2021-05-15 18:29:25] [INFO ] Deduced a trap composed of 16 places in 194 ms of which 0 ms to minimize.
[2021-05-15 18:29:25] [INFO ] Deduced a trap composed of 26 places in 181 ms of which 1 ms to minimize.
[2021-05-15 18:29:25] [INFO ] Deduced a trap composed of 32 places in 175 ms of which 1 ms to minimize.
[2021-05-15 18:29:26] [INFO ] Deduced a trap composed of 23 places in 175 ms of which 0 ms to minimize.
[2021-05-15 18:29:26] [INFO ] Deduced a trap composed of 34 places in 170 ms of which 0 ms to minimize.
[2021-05-15 18:29:26] [INFO ] Deduced a trap composed of 35 places in 174 ms of which 0 ms to minimize.
[2021-05-15 18:29:26] [INFO ] Deduced a trap composed of 26 places in 175 ms of which 1 ms to minimize.
[2021-05-15 18:29:26] [INFO ] Deduced a trap composed of 32 places in 166 ms of which 0 ms to minimize.
[2021-05-15 18:29:27] [INFO ] Deduced a trap composed of 31 places in 164 ms of which 1 ms to minimize.
[2021-05-15 18:29:27] [INFO ] Deduced a trap composed of 19 places in 165 ms of which 0 ms to minimize.
[2021-05-15 18:29:27] [INFO ] Deduced a trap composed of 20 places in 162 ms of which 1 ms to minimize.
[2021-05-15 18:29:27] [INFO ] Deduced a trap composed of 26 places in 164 ms of which 1 ms to minimize.
[2021-05-15 18:29:27] [INFO ] Deduced a trap composed of 31 places in 146 ms of which 1 ms to minimize.
[2021-05-15 18:29:28] [INFO ] Deduced a trap composed of 30 places in 149 ms of which 0 ms to minimize.
[2021-05-15 18:29:28] [INFO ] Deduced a trap composed of 34 places in 140 ms of which 0 ms to minimize.
[2021-05-15 18:29:28] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 0 ms to minimize.
[2021-05-15 18:29:28] [INFO ] Deduced a trap composed of 28 places in 134 ms of which 1 ms to minimize.
[2021-05-15 18:29:28] [INFO ] Deduced a trap composed of 35 places in 126 ms of which 0 ms to minimize.
[2021-05-15 18:29:28] [INFO ] Deduced a trap composed of 34 places in 122 ms of which 0 ms to minimize.
[2021-05-15 18:29:28] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 1 ms to minimize.
[2021-05-15 18:29:29] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 0 ms to minimize.
[2021-05-15 18:29:29] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 0 ms to minimize.
[2021-05-15 18:29:29] [INFO ] Deduced a trap composed of 35 places in 103 ms of which 0 ms to minimize.
[2021-05-15 18:29:29] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 1 ms to minimize.
[2021-05-15 18:29:29] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 1 ms to minimize.
[2021-05-15 18:29:29] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 0 ms to minimize.
[2021-05-15 18:29:29] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 0 ms to minimize.
[2021-05-15 18:29:30] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 0 ms to minimize.
[2021-05-15 18:29:30] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 0 ms to minimize.
[2021-05-15 18:29:30] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 6926 ms
[2021-05-15 18:29:30] [INFO ] Computed and/alt/rep : 1088/1634/1088 causal constraints (skipped 0 transitions) in 56 ms.
[2021-05-15 18:29:43] [INFO ] Deduced a trap composed of 14 places in 390 ms of which 1 ms to minimize.
[2021-05-15 18:29:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
[2021-05-15 18:29:43] [INFO ] [Real]Absence check using 181 positive place invariants in 44 ms returned sat
[2021-05-15 18:29:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 18:29:43] [INFO ] [Real]Absence check using state equation in 345 ms returned sat
[2021-05-15 18:29:43] [INFO ] Deduced a trap composed of 14 places in 213 ms of which 0 ms to minimize.
[2021-05-15 18:29:44] [INFO ] Deduced a trap composed of 22 places in 214 ms of which 1 ms to minimize.
[2021-05-15 18:29:44] [INFO ] Deduced a trap composed of 22 places in 209 ms of which 0 ms to minimize.
[2021-05-15 18:29:44] [INFO ] Deduced a trap composed of 21 places in 203 ms of which 1 ms to minimize.
[2021-05-15 18:29:44] [INFO ] Deduced a trap composed of 21 places in 198 ms of which 1 ms to minimize.
[2021-05-15 18:29:45] [INFO ] Deduced a trap composed of 20 places in 205 ms of which 1 ms to minimize.
[2021-05-15 18:29:45] [INFO ] Deduced a trap composed of 28 places in 192 ms of which 1 ms to minimize.
[2021-05-15 18:29:45] [INFO ] Deduced a trap composed of 24 places in 192 ms of which 1 ms to minimize.
[2021-05-15 18:29:45] [INFO ] Deduced a trap composed of 25 places in 168 ms of which 1 ms to minimize.
[2021-05-15 18:29:45] [INFO ] Deduced a trap composed of 22 places in 163 ms of which 0 ms to minimize.
[2021-05-15 18:29:46] [INFO ] Deduced a trap composed of 31 places in 160 ms of which 0 ms to minimize.
[2021-05-15 18:29:46] [INFO ] Deduced a trap composed of 16 places in 167 ms of which 0 ms to minimize.
[2021-05-15 18:29:46] [INFO ] Deduced a trap composed of 26 places in 153 ms of which 1 ms to minimize.
[2021-05-15 18:29:46] [INFO ] Deduced a trap composed of 24 places in 151 ms of which 1 ms to minimize.
[2021-05-15 18:29:46] [INFO ] Deduced a trap composed of 31 places in 148 ms of which 0 ms to minimize.
[2021-05-15 18:29:47] [INFO ] Deduced a trap composed of 25 places in 143 ms of which 1 ms to minimize.
[2021-05-15 18:29:47] [INFO ] Deduced a trap composed of 29 places in 141 ms of which 1 ms to minimize.
[2021-05-15 18:29:47] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 0 ms to minimize.
[2021-05-15 18:29:47] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 0 ms to minimize.
[2021-05-15 18:29:47] [INFO ] Deduced a trap composed of 34 places in 128 ms of which 1 ms to minimize.
[2021-05-15 18:29:47] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 0 ms to minimize.
[2021-05-15 18:29:48] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 1 ms to minimize.
[2021-05-15 18:29:48] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 0 ms to minimize.
[2021-05-15 18:29:48] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 1 ms to minimize.
[2021-05-15 18:29:48] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 1 ms to minimize.
[2021-05-15 18:29:48] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 0 ms to minimize.
[2021-05-15 18:29:48] [INFO ] Deduced a trap composed of 33 places in 108 ms of which 0 ms to minimize.
[2021-05-15 18:29:49] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 0 ms to minimize.
[2021-05-15 18:29:49] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 0 ms to minimize.
[2021-05-15 18:29:49] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 1 ms to minimize.
[2021-05-15 18:29:49] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 1 ms to minimize.
[2021-05-15 18:29:49] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 0 ms to minimize.
[2021-05-15 18:29:49] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 1 ms to minimize.
[2021-05-15 18:29:49] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 0 ms to minimize.
[2021-05-15 18:29:49] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 0 ms to minimize.
[2021-05-15 18:29:50] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 1 ms to minimize.
[2021-05-15 18:29:50] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 1 ms to minimize.
[2021-05-15 18:29:50] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 0 ms to minimize.
[2021-05-15 18:29:50] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 6641 ms
[2021-05-15 18:29:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 18:29:50] [INFO ] [Nat]Absence check using 181 positive place invariants in 45 ms returned sat
[2021-05-15 18:29:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 18:29:50] [INFO ] [Nat]Absence check using state equation in 347 ms returned sat
[2021-05-15 18:29:51] [INFO ] Deduced a trap composed of 14 places in 213 ms of which 1 ms to minimize.
[2021-05-15 18:29:51] [INFO ] Deduced a trap composed of 22 places in 214 ms of which 1 ms to minimize.
[2021-05-15 18:29:51] [INFO ] Deduced a trap composed of 22 places in 210 ms of which 1 ms to minimize.
[2021-05-15 18:29:51] [INFO ] Deduced a trap composed of 21 places in 203 ms of which 0 ms to minimize.
[2021-05-15 18:29:52] [INFO ] Deduced a trap composed of 21 places in 198 ms of which 1 ms to minimize.
[2021-05-15 18:29:52] [INFO ] Deduced a trap composed of 20 places in 196 ms of which 1 ms to minimize.
[2021-05-15 18:29:52] [INFO ] Deduced a trap composed of 28 places in 193 ms of which 0 ms to minimize.
[2021-05-15 18:29:52] [INFO ] Deduced a trap composed of 24 places in 190 ms of which 0 ms to minimize.
[2021-05-15 18:29:52] [INFO ] Deduced a trap composed of 25 places in 172 ms of which 0 ms to minimize.
[2021-05-15 18:29:53] [INFO ] Deduced a trap composed of 29 places in 167 ms of which 1 ms to minimize.
[2021-05-15 18:29:53] [INFO ] Deduced a trap composed of 26 places in 159 ms of which 0 ms to minimize.
[2021-05-15 18:29:53] [INFO ] Deduced a trap composed of 28 places in 150 ms of which 0 ms to minimize.
[2021-05-15 18:29:53] [INFO ] Deduced a trap composed of 32 places in 151 ms of which 1 ms to minimize.
[2021-05-15 18:29:53] [INFO ] Deduced a trap composed of 25 places in 146 ms of which 1 ms to minimize.
[2021-05-15 18:29:54] [INFO ] Deduced a trap composed of 25 places in 146 ms of which 1 ms to minimize.
[2021-05-15 18:29:54] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 1 ms to minimize.
[2021-05-15 18:29:54] [INFO ] Deduced a trap composed of 33 places in 134 ms of which 1 ms to minimize.
[2021-05-15 18:29:54] [INFO ] Deduced a trap composed of 26 places in 132 ms of which 0 ms to minimize.
[2021-05-15 18:29:54] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 1 ms to minimize.
[2021-05-15 18:29:54] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 1 ms to minimize.
[2021-05-15 18:29:55] [INFO ] Deduced a trap composed of 30 places in 125 ms of which 1 ms to minimize.
[2021-05-15 18:29:55] [INFO ] Deduced a trap composed of 35 places in 119 ms of which 1 ms to minimize.
[2021-05-15 18:29:55] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 1 ms to minimize.
[2021-05-15 18:29:55] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 1 ms to minimize.
[2021-05-15 18:29:55] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 1 ms to minimize.
[2021-05-15 18:29:55] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 1 ms to minimize.
[2021-05-15 18:29:55] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 0 ms to minimize.
[2021-05-15 18:29:56] [INFO ] Deduced a trap composed of 35 places in 95 ms of which 1 ms to minimize.
[2021-05-15 18:29:56] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 0 ms to minimize.
[2021-05-15 18:29:56] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 1 ms to minimize.
[2021-05-15 18:29:56] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 0 ms to minimize.
[2021-05-15 18:29:56] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 0 ms to minimize.
[2021-05-15 18:29:56] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 1 ms to minimize.
[2021-05-15 18:29:56] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 0 ms to minimize.
[2021-05-15 18:29:56] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 0 ms to minimize.
[2021-05-15 18:29:56] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 6062 ms
[2021-05-15 18:29:56] [INFO ] Computed and/alt/rep : 1088/1634/1088 causal constraints (skipped 0 transitions) in 63 ms.
[2021-05-15 18:30:10] [INFO ] Deduced a trap composed of 14 places in 380 ms of which 1 ms to minimize.
[2021-05-15 18:30:10] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
[2021-05-15 18:30:10] [INFO ] [Real]Absence check using 181 positive place invariants in 45 ms returned sat
[2021-05-15 18:30:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 18:30:11] [INFO ] [Real]Absence check using state equation in 342 ms returned sat
[2021-05-15 18:30:11] [INFO ] Deduced a trap composed of 27 places in 211 ms of which 1 ms to minimize.
[2021-05-15 18:30:11] [INFO ] Deduced a trap composed of 17 places in 210 ms of which 1 ms to minimize.
[2021-05-15 18:30:11] [INFO ] Deduced a trap composed of 20 places in 205 ms of which 0 ms to minimize.
[2021-05-15 18:30:12] [INFO ] Deduced a trap composed of 28 places in 210 ms of which 1 ms to minimize.
[2021-05-15 18:30:12] [INFO ] Deduced a trap composed of 28 places in 193 ms of which 1 ms to minimize.
[2021-05-15 18:30:12] [INFO ] Deduced a trap composed of 22 places in 187 ms of which 0 ms to minimize.
[2021-05-15 18:30:12] [INFO ] Deduced a trap composed of 16 places in 184 ms of which 1 ms to minimize.
[2021-05-15 18:30:13] [INFO ] Deduced a trap composed of 32 places in 178 ms of which 1 ms to minimize.
[2021-05-15 18:30:13] [INFO ] Deduced a trap composed of 23 places in 171 ms of which 1 ms to minimize.
[2021-05-15 18:30:13] [INFO ] Deduced a trap composed of 25 places in 165 ms of which 1 ms to minimize.
[2021-05-15 18:30:13] [INFO ] Deduced a trap composed of 27 places in 162 ms of which 0 ms to minimize.
[2021-05-15 18:30:13] [INFO ] Deduced a trap composed of 26 places in 156 ms of which 1 ms to minimize.
[2021-05-15 18:30:14] [INFO ] Deduced a trap composed of 25 places in 150 ms of which 1 ms to minimize.
[2021-05-15 18:30:14] [INFO ] Deduced a trap composed of 26 places in 151 ms of which 1 ms to minimize.
[2021-05-15 18:30:14] [INFO ] Deduced a trap composed of 32 places in 143 ms of which 0 ms to minimize.
[2021-05-15 18:30:14] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 0 ms to minimize.
[2021-05-15 18:30:14] [INFO ] Deduced a trap composed of 28 places in 135 ms of which 1 ms to minimize.
[2021-05-15 18:30:15] [INFO ] Deduced a trap composed of 33 places in 132 ms of which 0 ms to minimize.
[2021-05-15 18:30:15] [INFO ] Deduced a trap composed of 32 places in 127 ms of which 1 ms to minimize.
[2021-05-15 18:30:15] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 1 ms to minimize.
[2021-05-15 18:30:15] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 0 ms to minimize.
[2021-05-15 18:30:15] [INFO ] Deduced a trap composed of 37 places in 115 ms of which 0 ms to minimize.
[2021-05-15 18:30:15] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 1 ms to minimize.
[2021-05-15 18:30:15] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 0 ms to minimize.
[2021-05-15 18:30:16] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 1 ms to minimize.
[2021-05-15 18:30:16] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 0 ms to minimize.
[2021-05-15 18:30:16] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 1 ms to minimize.
[2021-05-15 18:30:16] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 0 ms to minimize.
[2021-05-15 18:30:16] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 0 ms to minimize.
[2021-05-15 18:30:16] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 0 ms to minimize.
[2021-05-15 18:30:16] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
[2021-05-15 18:30:17] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 1 ms to minimize.
[2021-05-15 18:30:17] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 0 ms to minimize.
[2021-05-15 18:30:17] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 5935 ms
[2021-05-15 18:30:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 18:30:17] [INFO ] [Nat]Absence check using 181 positive place invariants in 44 ms returned sat
[2021-05-15 18:30:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 18:30:17] [INFO ] [Nat]Absence check using state equation in 379 ms returned sat
[2021-05-15 18:30:18] [INFO ] Deduced a trap composed of 28 places in 227 ms of which 1 ms to minimize.
[2021-05-15 18:30:18] [INFO ] Deduced a trap composed of 17 places in 195 ms of which 1 ms to minimize.
[2021-05-15 18:30:18] [INFO ] Deduced a trap composed of 22 places in 185 ms of which 0 ms to minimize.
[2021-05-15 18:30:18] [INFO ] Deduced a trap composed of 34 places in 184 ms of which 1 ms to minimize.
[2021-05-15 18:30:18] [INFO ] Deduced a trap composed of 26 places in 178 ms of which 0 ms to minimize.
[2021-05-15 18:30:19] [INFO ] Deduced a trap composed of 20 places in 176 ms of which 0 ms to minimize.
[2021-05-15 18:30:19] [INFO ] Deduced a trap composed of 23 places in 173 ms of which 1 ms to minimize.
[2021-05-15 18:30:19] [INFO ] Deduced a trap composed of 29 places in 165 ms of which 0 ms to minimize.
[2021-05-15 18:30:19] [INFO ] Deduced a trap composed of 23 places in 159 ms of which 0 ms to minimize.
[2021-05-15 18:30:19] [INFO ] Deduced a trap composed of 27 places in 159 ms of which 0 ms to minimize.
[2021-05-15 18:30:20] [INFO ] Deduced a trap composed of 31 places in 157 ms of which 0 ms to minimize.
[2021-05-15 18:30:20] [INFO ] Deduced a trap composed of 19 places in 155 ms of which 1 ms to minimize.
[2021-05-15 18:30:20] [INFO ] Deduced a trap composed of 34 places in 146 ms of which 0 ms to minimize.
[2021-05-15 18:30:20] [INFO ] Deduced a trap composed of 32 places in 147 ms of which 0 ms to minimize.
[2021-05-15 18:30:20] [INFO ] Deduced a trap composed of 25 places in 143 ms of which 0 ms to minimize.
[2021-05-15 18:30:21] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 0 ms to minimize.
[2021-05-15 18:30:21] [INFO ] Deduced a trap composed of 28 places in 136 ms of which 1 ms to minimize.
[2021-05-15 18:30:21] [INFO ] Deduced a trap composed of 34 places in 132 ms of which 1 ms to minimize.
[2021-05-15 18:30:21] [INFO ] Deduced a trap composed of 37 places in 130 ms of which 1 ms to minimize.
[2021-05-15 18:30:21] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 0 ms to minimize.
[2021-05-15 18:30:21] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 1 ms to minimize.
[2021-05-15 18:30:21] [INFO ] Deduced a trap composed of 33 places in 116 ms of which 1 ms to minimize.
[2021-05-15 18:30:22] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 1 ms to minimize.
[2021-05-15 18:30:22] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 1 ms to minimize.
[2021-05-15 18:30:22] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 1 ms to minimize.
[2021-05-15 18:30:22] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 1 ms to minimize.
[2021-05-15 18:30:22] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 1 ms to minimize.
[2021-05-15 18:30:22] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 0 ms to minimize.
[2021-05-15 18:30:22] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 1 ms to minimize.
[2021-05-15 18:30:23] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 1 ms to minimize.
[2021-05-15 18:30:23] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 0 ms to minimize.
[2021-05-15 18:30:23] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 0 ms to minimize.
[2021-05-15 18:30:23] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 1 ms to minimize.
[2021-05-15 18:30:23] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 5740 ms
[2021-05-15 18:30:23] [INFO ] Computed and/alt/rep : 1088/1634/1088 causal constraints (skipped 0 transitions) in 72 ms.
[2021-05-15 18:30:37] [INFO ] Added : 1025 causal constraints over 205 iterations in 13734 ms. Result :unknown
[2021-05-15 18:30:37] [INFO ] [Real]Absence check using 181 positive place invariants in 44 ms returned sat
[2021-05-15 18:30:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 18:30:37] [INFO ] [Real]Absence check using state equation in 351 ms returned sat
[2021-05-15 18:30:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 18:30:37] [INFO ] [Nat]Absence check using 181 positive place invariants in 44 ms returned sat
[2021-05-15 18:30:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 18:30:38] [INFO ] [Nat]Absence check using state equation in 354 ms returned sat
[2021-05-15 18:30:38] [INFO ] Deduced a trap composed of 20 places in 196 ms of which 1 ms to minimize.
[2021-05-15 18:30:38] [INFO ] Deduced a trap composed of 16 places in 193 ms of which 0 ms to minimize.
[2021-05-15 18:30:38] [INFO ] Deduced a trap composed of 26 places in 187 ms of which 1 ms to minimize.
[2021-05-15 18:30:39] [INFO ] Deduced a trap composed of 19 places in 190 ms of which 1 ms to minimize.
[2021-05-15 18:30:39] [INFO ] Deduced a trap composed of 18 places in 180 ms of which 1 ms to minimize.
[2021-05-15 18:30:39] [INFO ] Deduced a trap composed of 17 places in 177 ms of which 1 ms to minimize.
[2021-05-15 18:30:39] [INFO ] Deduced a trap composed of 22 places in 171 ms of which 1 ms to minimize.
[2021-05-15 18:30:40] [INFO ] Deduced a trap composed of 31 places in 168 ms of which 1 ms to minimize.
[2021-05-15 18:30:40] [INFO ] Deduced a trap composed of 29 places in 160 ms of which 1 ms to minimize.
[2021-05-15 18:30:40] [INFO ] Deduced a trap composed of 21 places in 158 ms of which 1 ms to minimize.
[2021-05-15 18:30:40] [INFO ] Deduced a trap composed of 31 places in 151 ms of which 0 ms to minimize.
[2021-05-15 18:30:40] [INFO ] Deduced a trap composed of 16 places in 148 ms of which 1 ms to minimize.
[2021-05-15 18:30:40] [INFO ] Deduced a trap composed of 33 places in 141 ms of which 1 ms to minimize.
[2021-05-15 18:30:41] [INFO ] Deduced a trap composed of 34 places in 137 ms of which 0 ms to minimize.
[2021-05-15 18:30:41] [INFO ] Deduced a trap composed of 25 places in 133 ms of which 0 ms to minimize.
[2021-05-15 18:30:41] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 0 ms to minimize.
[2021-05-15 18:30:41] [INFO ] Deduced a trap composed of 30 places in 114 ms of which 0 ms to minimize.
[2021-05-15 18:30:41] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 1 ms to minimize.
[2021-05-15 18:30:41] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 0 ms to minimize.
[2021-05-15 18:30:42] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 1 ms to minimize.
[2021-05-15 18:30:42] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 0 ms to minimize.
[2021-05-15 18:30:42] [INFO ] Deduced a trap composed of 34 places in 101 ms of which 1 ms to minimize.
[2021-05-15 18:30:42] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 0 ms to minimize.
[2021-05-15 18:30:42] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 0 ms to minimize.
[2021-05-15 18:30:42] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 0 ms to minimize.
[2021-05-15 18:30:42] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 0 ms to minimize.
[2021-05-15 18:30:42] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 1 ms to minimize.
[2021-05-15 18:30:43] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 0 ms to minimize.
[2021-05-15 18:30:43] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 0 ms to minimize.
[2021-05-15 18:30:43] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 0 ms to minimize.
[2021-05-15 18:30:43] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 0 ms to minimize.
[2021-05-15 18:30:43] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 0 ms to minimize.
[2021-05-15 18:30:43] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 5224 ms
[2021-05-15 18:30:43] [INFO ] Computed and/alt/rep : 1088/1634/1088 causal constraints (skipped 0 transitions) in 57 ms.
[2021-05-15 18:30:58] [INFO ] Deduced a trap composed of 14 places in 397 ms of which 1 ms to minimize.
[2021-05-15 18:30:58] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
[2021-05-15 18:30:58] [INFO ] [Real]Absence check using 181 positive place invariants in 45 ms returned sat
[2021-05-15 18:30:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 18:30:58] [INFO ] [Real]Absence check using state equation in 335 ms returned sat
[2021-05-15 18:30:58] [INFO ] Deduced a trap composed of 27 places in 211 ms of which 1 ms to minimize.
[2021-05-15 18:30:59] [INFO ] Deduced a trap composed of 16 places in 187 ms of which 0 ms to minimize.
[2021-05-15 18:30:59] [INFO ] Deduced a trap composed of 25 places in 186 ms of which 0 ms to minimize.
[2021-05-15 18:30:59] [INFO ] Deduced a trap composed of 23 places in 181 ms of which 1 ms to minimize.
[2021-05-15 18:30:59] [INFO ] Deduced a trap composed of 22 places in 179 ms of which 0 ms to minimize.
[2021-05-15 18:31:00] [INFO ] Deduced a trap composed of 34 places in 173 ms of which 1 ms to minimize.
[2021-05-15 18:31:00] [INFO ] Deduced a trap composed of 30 places in 174 ms of which 0 ms to minimize.
[2021-05-15 18:31:00] [INFO ] Deduced a trap composed of 35 places in 178 ms of which 0 ms to minimize.
[2021-05-15 18:31:00] [INFO ] Deduced a trap composed of 33 places in 169 ms of which 1 ms to minimize.
[2021-05-15 18:31:00] [INFO ] Deduced a trap composed of 33 places in 165 ms of which 1 ms to minimize.
[2021-05-15 18:31:01] [INFO ] Deduced a trap composed of 29 places in 157 ms of which 0 ms to minimize.
[2021-05-15 18:31:01] [INFO ] Deduced a trap composed of 31 places in 153 ms of which 0 ms to minimize.
[2021-05-15 18:31:01] [INFO ] Deduced a trap composed of 35 places in 150 ms of which 1 ms to minimize.
[2021-05-15 18:31:01] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 0 ms to minimize.
[2021-05-15 18:31:01] [INFO ] Deduced a trap composed of 30 places in 141 ms of which 1 ms to minimize.
[2021-05-15 18:31:01] [INFO ] Deduced a trap composed of 25 places in 144 ms of which 1 ms to minimize.
[2021-05-15 18:31:02] [INFO ] Deduced a trap composed of 33 places in 133 ms of which 1 ms to minimize.
[2021-05-15 18:31:02] [INFO ] Deduced a trap composed of 36 places in 138 ms of which 1 ms to minimize.
[2021-05-15 18:31:02] [INFO ] Deduced a trap composed of 30 places in 128 ms of which 0 ms to minimize.
[2021-05-15 18:31:02] [INFO ] Deduced a trap composed of 35 places in 129 ms of which 0 ms to minimize.
[2021-05-15 18:31:02] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 0 ms to minimize.
[2021-05-15 18:31:02] [INFO ] Deduced a trap composed of 34 places in 117 ms of which 1 ms to minimize.
[2021-05-15 18:31:03] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 1 ms to minimize.
[2021-05-15 18:31:03] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 1 ms to minimize.
[2021-05-15 18:31:03] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 4595 ms
[2021-05-15 18:31:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 18:31:03] [INFO ] [Nat]Absence check using 181 positive place invariants in 45 ms returned sat
[2021-05-15 18:31:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 18:31:03] [INFO ] [Nat]Absence check using state equation in 335 ms returned sat
[2021-05-15 18:31:04] [INFO ] Deduced a trap composed of 27 places in 192 ms of which 1 ms to minimize.
[2021-05-15 18:31:04] [INFO ] Deduced a trap composed of 16 places in 196 ms of which 1 ms to minimize.
[2021-05-15 18:31:04] [INFO ] Deduced a trap composed of 24 places in 194 ms of which 0 ms to minimize.
[2021-05-15 18:31:04] [INFO ] Deduced a trap composed of 22 places in 184 ms of which 1 ms to minimize.
[2021-05-15 18:31:04] [INFO ] Deduced a trap composed of 30 places in 178 ms of which 1 ms to minimize.
[2021-05-15 18:31:05] [INFO ] Deduced a trap composed of 23 places in 180 ms of which 0 ms to minimize.
[2021-05-15 18:31:05] [INFO ] Deduced a trap composed of 23 places in 180 ms of which 0 ms to minimize.
[2021-05-15 18:31:05] [INFO ] Deduced a trap composed of 33 places in 162 ms of which 1 ms to minimize.
[2021-05-15 18:31:05] [INFO ] Deduced a trap composed of 33 places in 172 ms of which 1 ms to minimize.
[2021-05-15 18:31:05] [INFO ] Deduced a trap composed of 31 places in 166 ms of which 1 ms to minimize.
[2021-05-15 18:31:06] [INFO ] Deduced a trap composed of 25 places in 162 ms of which 0 ms to minimize.
[2021-05-15 18:31:06] [INFO ] Deduced a trap composed of 34 places in 155 ms of which 0 ms to minimize.
[2021-05-15 18:31:06] [INFO ] Deduced a trap composed of 33 places in 157 ms of which 1 ms to minimize.
[2021-05-15 18:31:06] [INFO ] Deduced a trap composed of 33 places in 157 ms of which 0 ms to minimize.
[2021-05-15 18:31:06] [INFO ] Deduced a trap composed of 30 places in 145 ms of which 1 ms to minimize.
[2021-05-15 18:31:07] [INFO ] Deduced a trap composed of 32 places in 142 ms of which 1 ms to minimize.
[2021-05-15 18:31:07] [INFO ] Deduced a trap composed of 32 places in 141 ms of which 1 ms to minimize.
[2021-05-15 18:31:07] [INFO ] Deduced a trap composed of 34 places in 129 ms of which 1 ms to minimize.
[2021-05-15 18:31:07] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 0 ms to minimize.
[2021-05-15 18:31:07] [INFO ] Deduced a trap composed of 34 places in 120 ms of which 1 ms to minimize.
[2021-05-15 18:31:07] [INFO ] Deduced a trap composed of 33 places in 122 ms of which 0 ms to minimize.
[2021-05-15 18:31:08] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 0 ms to minimize.
[2021-05-15 18:31:08] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 0 ms to minimize.
[2021-05-15 18:31:08] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 4397 ms
[2021-05-15 18:31:08] [INFO ] Computed and/alt/rep : 1088/1634/1088 causal constraints (skipped 0 transitions) in 54 ms.
[2021-05-15 18:31:23] [INFO ] Added : 1074 causal constraints over 216 iterations in 15121 ms. Result :unknown
[2021-05-15 18:31:23] [INFO ] [Real]Absence check using 181 positive place invariants in 44 ms returned sat
[2021-05-15 18:31:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 18:31:23] [INFO ] [Real]Absence check using state equation in 350 ms returned sat
[2021-05-15 18:31:24] [INFO ] Deduced a trap composed of 20 places in 191 ms of which 0 ms to minimize.
[2021-05-15 18:31:24] [INFO ] Deduced a trap composed of 32 places in 189 ms of which 0 ms to minimize.
[2021-05-15 18:31:24] [INFO ] Deduced a trap composed of 27 places in 185 ms of which 1 ms to minimize.
[2021-05-15 18:31:24] [INFO ] Deduced a trap composed of 23 places in 185 ms of which 1 ms to minimize.
[2021-05-15 18:31:24] [INFO ] Deduced a trap composed of 24 places in 181 ms of which 1 ms to minimize.
[2021-05-15 18:31:25] [INFO ] Deduced a trap composed of 34 places in 184 ms of which 1 ms to minimize.
[2021-05-15 18:31:25] [INFO ] Deduced a trap composed of 32 places in 176 ms of which 1 ms to minimize.
[2021-05-15 18:31:25] [INFO ] Deduced a trap composed of 16 places in 172 ms of which 1 ms to minimize.
[2021-05-15 18:31:25] [INFO ] Deduced a trap composed of 17 places in 173 ms of which 1 ms to minimize.
[2021-05-15 18:31:26] [INFO ] Deduced a trap composed of 16 places in 169 ms of which 1 ms to minimize.
[2021-05-15 18:31:26] [INFO ] Deduced a trap composed of 22 places in 171 ms of which 0 ms to minimize.
[2021-05-15 18:31:26] [INFO ] Deduced a trap composed of 19 places in 160 ms of which 1 ms to minimize.
[2021-05-15 18:31:26] [INFO ] Deduced a trap composed of 22 places in 155 ms of which 1 ms to minimize.
[2021-05-15 18:31:26] [INFO ] Deduced a trap composed of 26 places in 156 ms of which 1 ms to minimize.
[2021-05-15 18:31:27] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 0 ms to minimize.
[2021-05-15 18:31:27] [INFO ] Deduced a trap composed of 26 places in 144 ms of which 0 ms to minimize.
[2021-05-15 18:31:27] [INFO ] Deduced a trap composed of 28 places in 144 ms of which 0 ms to minimize.
[2021-05-15 18:31:27] [INFO ] Deduced a trap composed of 22 places in 139 ms of which 0 ms to minimize.
[2021-05-15 18:31:27] [INFO ] Deduced a trap composed of 16 places in 135 ms of which 0 ms to minimize.
[2021-05-15 18:31:27] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 1 ms to minimize.
[2021-05-15 18:31:28] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 0 ms to minimize.
[2021-05-15 18:31:28] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 0 ms to minimize.
[2021-05-15 18:31:28] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 0 ms to minimize.
[2021-05-15 18:31:28] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 1 ms to minimize.
[2021-05-15 18:31:28] [INFO ] Deduced a trap composed of 41 places in 107 ms of which 0 ms to minimize.
[2021-05-15 18:31:28] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 0 ms to minimize.
[2021-05-15 18:31:28] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 1 ms to minimize.
[2021-05-15 18:31:29] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 1 ms to minimize.
[2021-05-15 18:31:29] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 0 ms to minimize.
[2021-05-15 18:31:29] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 0 ms to minimize.
[2021-05-15 18:31:29] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 0 ms to minimize.
[2021-05-15 18:31:29] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 1 ms to minimize.
[2021-05-15 18:31:29] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 0 ms to minimize.
[2021-05-15 18:31:29] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 0 ms to minimize.
[2021-05-15 18:31:29] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 0 ms to minimize.
[2021-05-15 18:31:30] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 0 ms to minimize.
[2021-05-15 18:31:30] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 0 ms to minimize.
[2021-05-15 18:31:30] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 0 ms to minimize.
[2021-05-15 18:31:30] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2021-05-15 18:31:30] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 6465 ms
[2021-05-15 18:31:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 18:31:30] [INFO ] [Nat]Absence check using 181 positive place invariants in 45 ms returned sat
[2021-05-15 18:31:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 18:31:30] [INFO ] [Nat]Absence check using state equation in 345 ms returned sat
[2021-05-15 18:31:31] [INFO ] Deduced a trap composed of 20 places in 187 ms of which 1 ms to minimize.
[2021-05-15 18:31:31] [INFO ] Deduced a trap composed of 32 places in 183 ms of which 1 ms to minimize.
[2021-05-15 18:31:31] [INFO ] Deduced a trap composed of 27 places in 182 ms of which 0 ms to minimize.
[2021-05-15 18:31:31] [INFO ] Deduced a trap composed of 23 places in 180 ms of which 1 ms to minimize.
[2021-05-15 18:31:31] [INFO ] Deduced a trap composed of 24 places in 180 ms of which 1 ms to minimize.
[2021-05-15 18:31:32] [INFO ] Deduced a trap composed of 34 places in 178 ms of which 0 ms to minimize.
[2021-05-15 18:31:32] [INFO ] Deduced a trap composed of 32 places in 175 ms of which 0 ms to minimize.
[2021-05-15 18:31:32] [INFO ] Deduced a trap composed of 16 places in 171 ms of which 0 ms to minimize.
[2021-05-15 18:31:32] [INFO ] Deduced a trap composed of 17 places in 170 ms of which 1 ms to minimize.
[2021-05-15 18:31:32] [INFO ] Deduced a trap composed of 16 places in 167 ms of which 0 ms to minimize.
[2021-05-15 18:31:33] [INFO ] Deduced a trap composed of 22 places in 163 ms of which 1 ms to minimize.
[2021-05-15 18:31:33] [INFO ] Deduced a trap composed of 19 places in 156 ms of which 0 ms to minimize.
[2021-05-15 18:31:33] [INFO ] Deduced a trap composed of 22 places in 153 ms of which 0 ms to minimize.
[2021-05-15 18:31:33] [INFO ] Deduced a trap composed of 26 places in 147 ms of which 0 ms to minimize.
[2021-05-15 18:31:33] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 1 ms to minimize.
[2021-05-15 18:31:34] [INFO ] Deduced a trap composed of 26 places in 143 ms of which 1 ms to minimize.
[2021-05-15 18:31:34] [INFO ] Deduced a trap composed of 28 places in 142 ms of which 1 ms to minimize.
[2021-05-15 18:31:34] [INFO ] Deduced a trap composed of 22 places in 140 ms of which 1 ms to minimize.
[2021-05-15 18:31:34] [INFO ] Deduced a trap composed of 16 places in 135 ms of which 1 ms to minimize.
[2021-05-15 18:31:34] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 1 ms to minimize.
[2021-05-15 18:31:34] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 0 ms to minimize.
[2021-05-15 18:31:35] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 0 ms to minimize.
[2021-05-15 18:31:35] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 0 ms to minimize.
[2021-05-15 18:31:35] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 1 ms to minimize.
[2021-05-15 18:31:35] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 0 ms to minimize.
[2021-05-15 18:31:35] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 0 ms to minimize.
[2021-05-15 18:31:35] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 1 ms to minimize.
[2021-05-15 18:31:35] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 0 ms to minimize.
[2021-05-15 18:31:36] [INFO ] Deduced a trap composed of 30 places in 186 ms of which 0 ms to minimize.
[2021-05-15 18:31:36] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 0 ms to minimize.
[2021-05-15 18:31:36] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 1 ms to minimize.
[2021-05-15 18:31:36] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 0 ms to minimize.
[2021-05-15 18:31:36] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 1 ms to minimize.
[2021-05-15 18:31:36] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 0 ms to minimize.
[2021-05-15 18:31:36] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 0 ms to minimize.
[2021-05-15 18:31:36] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 1 ms to minimize.
[2021-05-15 18:31:37] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 1 ms to minimize.
[2021-05-15 18:31:37] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 0 ms to minimize.
[2021-05-15 18:31:37] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 0 ms to minimize.
[2021-05-15 18:31:37] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 6354 ms
[2021-05-15 18:31:37] [INFO ] Computed and/alt/rep : 1088/1634/1088 causal constraints (skipped 0 transitions) in 59 ms.
[2021-05-15 18:31:50] [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: Broken pipe ... while checking expression at index 9
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0) U p1))], workingDir=/home/mcc/execution]
Support contains 2 out of 1189 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1189/1189 places, 1089/1089 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 0 with 240 rules applied. Total rules applied 240 place count 1189 transition count 849
Reduce places removed 240 places and 0 transitions.
Iterating post reduction 1 with 240 rules applied. Total rules applied 480 place count 949 transition count 849
Performed 156 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 156 Pre rules applied. Total rules applied 480 place count 949 transition count 693
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 792 place count 793 transition count 693
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 797 place count 788 transition count 688
Iterating global reduction 2 with 5 rules applied. Total rules applied 802 place count 788 transition count 688
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 802 place count 788 transition count 683
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 812 place count 783 transition count 683
Performed 339 Post agglomeration using F-continuation condition.Transition count delta: 339
Deduced a syphon composed of 339 places in 1 ms
Reduce places removed 339 places and 0 transitions.
Iterating global reduction 2 with 678 rules applied. Total rules applied 1490 place count 444 transition count 344
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1491 place count 444 transition count 343
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 1493 place count 443 transition count 342
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -39
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 1611 place count 384 transition count 381
Applied a total of 1611 rules in 187 ms. Remains 384 /1189 variables (removed 805) and now considering 381/1089 (removed 708) transitions.
// Phase 1: matrix 381 rows 384 cols
[2021-05-15 18:31:50] [INFO ] Computed 181 place invariants in 2 ms
[2021-05-15 18:31:50] [INFO ] Implicit Places using invariants in 254 ms returned [376, 377]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 257 ms to find 2 implicit places.
[2021-05-15 18:31:50] [INFO ] Redundant transitions in 22 ms returned []
// Phase 1: matrix 381 rows 382 cols
[2021-05-15 18:31:50] [INFO ] Computed 179 place invariants in 4 ms
[2021-05-15 18:31:51] [INFO ] Dead Transitions using invariants and state equation in 205 ms returned []
Starting structural reductions, iteration 1 : 382/1189 places, 381/1089 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 382 transition count 380
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 381 transition count 380
Applied a total of 2 rules in 19 ms. Remains 381 /382 variables (removed 1) and now considering 380/381 (removed 1) transitions.
// Phase 1: matrix 380 rows 381 cols
[2021-05-15 18:31:51] [INFO ] Computed 179 place invariants in 2 ms
[2021-05-15 18:31:51] [INFO ] Implicit Places using invariants in 219 ms returned [370]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 220 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 380/1189 places, 380/1089 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 379 transition count 379
Applied a total of 2 rules in 18 ms. Remains 379 /380 variables (removed 1) and now considering 379/380 (removed 1) transitions.
// Phase 1: matrix 379 rows 379 cols
[2021-05-15 18:31:51] [INFO ] Computed 178 place invariants in 1 ms
[2021-05-15 18:31:51] [INFO ] Implicit Places using invariants in 210 ms returned []
// Phase 1: matrix 379 rows 379 cols
[2021-05-15 18:31:51] [INFO ] Computed 178 place invariants in 1 ms
[2021-05-15 18:31:51] [INFO ] State equation strengthened by 177 read => feed constraints.
[2021-05-15 18:31:52] [INFO ] Implicit Places using invariants and state equation in 885 ms returned []
Implicit Place search using SMT with State Equation took 1097 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 379/1189 places, 379/1089 transitions.
Stuttering acceptance computed with spot in 192 ms :[(NOT p1), true, (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-020B-00 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s1 1), p0:(NEQ s364 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]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 10 ms.
FORMULA ShieldIIPt-PT-020B-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-00 finished in 2272 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(((F((p0&&X(G(p1))))&&X(G(p2)))||G((F(p0)&&F(G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 1189 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1189/1189 places, 1089/1089 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1182 transition count 1082
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1182 transition count 1082
Applied a total of 14 rules in 77 ms. Remains 1182 /1189 variables (removed 7) and now considering 1082/1089 (removed 7) transitions.
// Phase 1: matrix 1082 rows 1182 cols
[2021-05-15 18:31:52] [INFO ] Computed 181 place invariants in 3 ms
[2021-05-15 18:31:53] [INFO ] Implicit Places using invariants in 294 ms returned []
// Phase 1: matrix 1082 rows 1182 cols
[2021-05-15 18:31:53] [INFO ] Computed 181 place invariants in 4 ms
[2021-05-15 18:31:53] [INFO ] Implicit Places using invariants and state equation in 788 ms returned []
Implicit Place search using SMT with State Equation took 1091 ms to find 0 implicit places.
// Phase 1: matrix 1082 rows 1182 cols
[2021-05-15 18:31:53] [INFO ] Computed 181 place invariants in 3 ms
[2021-05-15 18:31:54] [INFO ] Dead Transitions using invariants and state equation in 556 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1182/1189 places, 1082/1089 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p2)), (NOT p0), false]
Running random walk in product with property : ShieldIIPt-PT-020B-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=(NOT p0), acceptance={} source=0 dest: 4}, { cond=(NOT p0), acceptance={} source=0 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(OR (AND (NOT p0) p1) (AND p0 p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 5}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 p2), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(NEQ s480 1), p1:(NEQ s226 1), p2:(EQ s303 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 517 ms.
Product exploration explored 100000 steps with 1 reset in 675 ms.
Knowledge obtained : [p0, p1, p2]
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p2)), (NOT p0), false]
Product exploration explored 100000 steps with 0 reset in 437 ms.
Product exploration explored 100000 steps with 1 reset in 532 ms.
Applying partial POR strategy [true, true, true, true, true, true]
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p2)), (NOT p0), false]
Support contains 3 out of 1182 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1182/1182 places, 1082/1082 transitions.
Performed 236 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 236 rules applied. Total rules applied 236 place count 1182 transition count 1082
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 104 Pre rules applied. Total rules applied 236 place count 1182 transition count 1206
Deduced a syphon composed of 340 places in 1 ms
Iterating global reduction 1 with 104 rules applied. Total rules applied 340 place count 1182 transition count 1206
Performed 377 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 717 places in 1 ms
Iterating global reduction 1 with 377 rules applied. Total rules applied 717 place count 1182 transition count 1206
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 718 place count 1182 transition count 1205
Renaming transitions due to excessive name length > 1024 char.
Discarding 137 places :
Symmetric choice reduction at 2 with 137 rule applications. Total rules 855 place count 1045 transition count 1068
Deduced a syphon composed of 580 places in 0 ms
Iterating global reduction 2 with 137 rules applied. Total rules applied 992 place count 1045 transition count 1068
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 581 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 993 place count 1045 transition count 1068
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 995 place count 1043 transition count 1066
Deduced a syphon composed of 579 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 997 place count 1043 transition count 1066
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: -333
Deduced a syphon composed of 639 places in 1 ms
Iterating global reduction 2 with 60 rules applied. Total rules applied 1057 place count 1043 transition count 1399
Discarding 61 places :
Symmetric choice reduction at 2 with 61 rule applications. Total rules 1118 place count 982 transition count 1277
Deduced a syphon composed of 578 places in 1 ms
Iterating global reduction 2 with 61 rules applied. Total rules applied 1179 place count 982 transition count 1277
Deduced a syphon composed of 578 places in 1 ms
Applied a total of 1179 rules in 576 ms. Remains 982 /1182 variables (removed 200) and now considering 1277/1082 (removed -195) transitions.
[2021-05-15 18:31:57] [INFO ] Redundant transitions in 64 ms returned []
// Phase 1: matrix 1277 rows 982 cols
[2021-05-15 18:31:57] [INFO ] Computed 181 place invariants in 6 ms
[2021-05-15 18:31:58] [INFO ] Dead Transitions using invariants and state equation in 547 ms returned []
Finished structural reductions, in 1 iterations. Remains : 982/1182 places, 1277/1082 transitions.
Product exploration explored 100000 steps with 0 reset in 549 ms.
Stack based approach found an accepted trace after 24605 steps with 0 reset with depth 24606 and stack size 21175 in 153 ms.
FORMULA ShieldIIPt-PT-020B-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-01 finished in 6534 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((F(p0)||X((p1 U (p2||G(p1))))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 1189 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1189/1189 places, 1089/1089 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1181 transition count 1081
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1181 transition count 1081
Applied a total of 16 rules in 87 ms. Remains 1181 /1189 variables (removed 8) and now considering 1081/1089 (removed 8) transitions.
// Phase 1: matrix 1081 rows 1181 cols
[2021-05-15 18:31:59] [INFO ] Computed 181 place invariants in 4 ms
[2021-05-15 18:31:59] [INFO ] Implicit Places using invariants in 331 ms returned []
// Phase 1: matrix 1081 rows 1181 cols
[2021-05-15 18:31:59] [INFO ] Computed 181 place invariants in 3 ms
[2021-05-15 18:32:00] [INFO ] Implicit Places using invariants and state equation in 819 ms returned []
Implicit Place search using SMT with State Equation took 1151 ms to find 0 implicit places.
// Phase 1: matrix 1081 rows 1181 cols
[2021-05-15 18:32:00] [INFO ] Computed 181 place invariants in 3 ms
[2021-05-15 18:32:01] [INFO ] Dead Transitions using invariants and state equation in 584 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1181/1189 places, 1081/1089 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-020B-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(AND (OR (NEQ s20 1) (NEQ s67 1)) (NEQ s1037 1)), p2:(AND (OR (NEQ s37 1) (NEQ s54 1)) (NEQ s20 0) (NEQ s67 0)), p1:(AND (NEQ s20 0) (NEQ s67 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 614 ms.
Product exploration explored 100000 steps with 33333 reset in 530 ms.
Knowledge obtained : [p0, (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 33333 reset in 509 ms.
Product exploration explored 100000 steps with 33333 reset in 522 ms.
Applying partial POR strategy [true, false, true, false, false]
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 5 out of 1181 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1181/1181 places, 1081/1081 transitions.
Performed 237 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 237 rules applied. Total rules applied 237 place count 1181 transition count 1081
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 100 Pre rules applied. Total rules applied 237 place count 1181 transition count 1202
Deduced a syphon composed of 337 places in 1 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 337 place count 1181 transition count 1202
Performed 377 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 714 places in 0 ms
Iterating global reduction 1 with 377 rules applied. Total rules applied 714 place count 1181 transition count 1202
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 715 place count 1181 transition count 1201
Renaming transitions due to excessive name length > 1024 char.
Discarding 140 places :
Symmetric choice reduction at 2 with 140 rule applications. Total rules 855 place count 1041 transition count 1061
Deduced a syphon composed of 574 places in 0 ms
Iterating global reduction 2 with 140 rules applied. Total rules applied 995 place count 1041 transition count 1061
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 575 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 996 place count 1041 transition count 1061
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 998 place count 1039 transition count 1059
Deduced a syphon composed of 573 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1000 place count 1039 transition count 1059
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: -333
Deduced a syphon composed of 633 places in 1 ms
Iterating global reduction 2 with 60 rules applied. Total rules applied 1060 place count 1039 transition count 1392
Discarding 60 places :
Symmetric choice reduction at 2 with 60 rule applications. Total rules 1120 place count 979 transition count 1272
Deduced a syphon composed of 573 places in 1 ms
Iterating global reduction 2 with 60 rules applied. Total rules applied 1180 place count 979 transition count 1272
Deduced a syphon composed of 573 places in 0 ms
Applied a total of 1180 rules in 297 ms. Remains 979 /1181 variables (removed 202) and now considering 1272/1081 (removed -191) transitions.
[2021-05-15 18:32:04] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 1272 rows 979 cols
[2021-05-15 18:32:04] [INFO ] Computed 181 place invariants in 5 ms
[2021-05-15 18:32:04] [INFO ] Dead Transitions using invariants and state equation in 616 ms returned []
Finished structural reductions, in 1 iterations. Remains : 979/1181 places, 1272/1081 transitions.
Product exploration explored 100000 steps with 33333 reset in 527 ms.
Product exploration explored 100000 steps with 33333 reset in 527 ms.
[2021-05-15 18:32:05] [INFO ] Flatten gal took : 46 ms
[2021-05-15 18:32:05] [INFO ] Flatten gal took : 47 ms
[2021-05-15 18:32:05] [INFO ] Time to serialize gal into /tmp/LTL15270531649240298769.gal : 15 ms
[2021-05-15 18:32:05] [INFO ] Time to serialize properties into /tmp/LTL18429653316490811882.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/LTL15270531649240298769.gal, -t, CGAL, -LTL, /tmp/LTL18429653316490811882.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/LTL15270531649240298769.gal -t CGAL -LTL /tmp/LTL18429653316490811882.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X((F("(((p20!=1)||(p73!=1))&&(p1225!=1))"))||(X(("((p20!=0)&&(p73!=0))")U(("((((p37!=1)||(p56!=1))&&(p20!=0))&&(p73!=0))")||(G("((p20!=0)&&(p73!=0))")))))))))
Formula 0 simplified : !XX(F"(((p20!=1)||(p73!=1))&&(p1225!=1))" | X("((p20!=0)&&(p73!=0))" U ("((((p37!=1)||(p56!=1))&&(p20!=0))&&(p73!=0))" | G"((p20!=0)&&(p73!=0))")))
Detected timeout of ITS tools.
[2021-05-15 18:32:21] [INFO ] Flatten gal took : 43 ms
[2021-05-15 18:32:21] [INFO ] Applying decomposition
[2021-05-15 18:32:21] [INFO ] Flatten gal took : 39 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/graph6712275597005305141.txt, -o, /tmp/graph6712275597005305141.bin, -w, /tmp/graph6712275597005305141.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/graph6712275597005305141.bin, -l, -1, -v, -w, /tmp/graph6712275597005305141.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 18:32:21] [INFO ] Decomposing Gal with order
[2021-05-15 18:32:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 18:32:21] [INFO ] Removed a total of 199 redundant transitions.
[2021-05-15 18:32:21] [INFO ] Flatten gal took : 112 ms
[2021-05-15 18:32:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 13 ms.
[2021-05-15 18:32:21] [INFO ] Time to serialize gal into /tmp/LTL10903663337951225678.gal : 18 ms
[2021-05-15 18:32:21] [INFO ] Time to serialize properties into /tmp/LTL2173675109129724729.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL10903663337951225678.gal, -t, CGAL, -LTL, /tmp/LTL2173675109129724729.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/LTL10903663337951225678.gal -t CGAL -LTL /tmp/LTL2173675109129724729.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X((F("(((i0.i2.u8.p20!=1)||(i0.i6.u25.p73!=1))&&(i17.i3.u385.p1225!=1))"))||(X(("((i0.i2.u8.p20!=0)&&(i0.i6.u25.p73!=0))")U(("((((i0.i1.u15.p37!=1)||(i0.i3.u18.p56!=1))&&(i0.i2.u8.p20!=0))&&(i0.i6.u25.p73!=0))")||(G("((i0.i2.u8.p20!=0)&&(i0.i6.u25.p73!=0))")))))))))
Formula 0 simplified : !XX(F"(((i0.i2.u8.p20!=1)||(i0.i6.u25.p73!=1))&&(i17.i3.u385.p1225!=1))" | X("((i0.i2.u8.p20!=0)&&(i0.i6.u25.p73!=0))" U ("((((i0.i1.u15.p37!=1)||(i0.i3.u18.p56!=1))&&(i0.i2.u8.p20!=0))&&(i0.i6.u25.p73!=0))" | G"((i0.i2.u8.p20!=0)&&(i0.i6.u25.p73!=0))")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin760211162961728073
[2021-05-15 18:32:36] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin760211162961728073
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/ltsmin760211162961728073]
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/ltsmin760211162961728073] 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/ltsmin760211162961728073] 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 ShieldIIPt-PT-020B-02 finished in 38429 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||(p1 U p2)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 1189 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1189/1189 places, 1089/1089 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 239 place count 1188 transition count 849
Reduce places removed 239 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 240 rules applied. Total rules applied 479 place count 949 transition count 848
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 480 place count 948 transition count 848
Performed 155 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 155 Pre rules applied. Total rules applied 480 place count 948 transition count 693
Deduced a syphon composed of 155 places in 0 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 3 with 310 rules applied. Total rules applied 790 place count 793 transition count 693
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 796 place count 787 transition count 687
Iterating global reduction 3 with 6 rules applied. Total rules applied 802 place count 787 transition count 687
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 802 place count 787 transition count 681
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 814 place count 781 transition count 681
Performed 337 Post agglomeration using F-continuation condition.Transition count delta: 337
Deduced a syphon composed of 337 places in 0 ms
Reduce places removed 337 places and 0 transitions.
Iterating global reduction 3 with 674 rules applied. Total rules applied 1488 place count 444 transition count 344
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1489 place count 444 transition count 343
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 1491 place count 443 transition count 342
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: -36
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 1605 place count 386 transition count 378
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1606 place count 385 transition count 377
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1608 place count 383 transition count 377
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1608 place count 383 transition count 376
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1610 place count 382 transition count 376
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1611 place count 381 transition count 375
Applied a total of 1611 rules in 191 ms. Remains 381 /1189 variables (removed 808) and now considering 375/1089 (removed 714) transitions.
// Phase 1: matrix 375 rows 381 cols
[2021-05-15 18:32:37] [INFO ] Computed 179 place invariants in 1 ms
[2021-05-15 18:32:38] [INFO ] Implicit Places using invariants in 208 ms returned [370]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 209 ms to find 1 implicit places.
[2021-05-15 18:32:38] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 375 rows 380 cols
[2021-05-15 18:32:38] [INFO ] Computed 178 place invariants in 1 ms
[2021-05-15 18:32:38] [INFO ] Dead Transitions using invariants and state equation in 163 ms returned []
Starting structural reductions, iteration 1 : 380/1189 places, 375/1089 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 379 transition count 374
Applied a total of 2 rules in 10 ms. Remains 379 /380 variables (removed 1) and now considering 374/375 (removed 1) transitions.
// Phase 1: matrix 374 rows 379 cols
[2021-05-15 18:32:38] [INFO ] Computed 178 place invariants in 1 ms
[2021-05-15 18:32:38] [INFO ] Implicit Places using invariants in 185 ms returned []
// Phase 1: matrix 374 rows 379 cols
[2021-05-15 18:32:38] [INFO ] Computed 178 place invariants in 1 ms
[2021-05-15 18:32:38] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 379/1189 places, 374/1089 transitions.
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-020B-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (EQ s248 1) (EQ s271 1)), p0:(EQ s271 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-020B-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-03 finished in 1152 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||(p1&&G(p2))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 1189 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1189/1189 places, 1089/1089 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 0 with 240 rules applied. Total rules applied 240 place count 1188 transition count 848
Reduce places removed 240 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 241 rules applied. Total rules applied 481 place count 948 transition count 847
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 482 place count 947 transition count 847
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 154 Pre rules applied. Total rules applied 482 place count 947 transition count 693
Deduced a syphon composed of 154 places in 1 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 3 with 308 rules applied. Total rules applied 790 place count 793 transition count 693
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 796 place count 787 transition count 687
Iterating global reduction 3 with 6 rules applied. Total rules applied 802 place count 787 transition count 687
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 802 place count 787 transition count 681
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 814 place count 781 transition count 681
Performed 333 Post agglomeration using F-continuation condition.Transition count delta: 333
Deduced a syphon composed of 333 places in 0 ms
Reduce places removed 333 places and 0 transitions.
Iterating global reduction 3 with 666 rules applied. Total rules applied 1480 place count 448 transition count 348
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1481 place count 448 transition count 347
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 1483 place count 447 transition count 346
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 4 with 118 rules applied. Total rules applied 1601 place count 388 transition count 385
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1602 place count 388 transition count 385
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1603 place count 387 transition count 384
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1605 place count 385 transition count 384
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1605 place count 385 transition count 383
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1607 place count 384 transition count 383
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1608 place count 383 transition count 382
Applied a total of 1608 rules in 156 ms. Remains 383 /1189 variables (removed 806) and now considering 382/1089 (removed 707) transitions.
// Phase 1: matrix 382 rows 383 cols
[2021-05-15 18:32:38] [INFO ] Computed 179 place invariants in 1 ms
[2021-05-15 18:32:39] [INFO ] Implicit Places using invariants in 186 ms returned [372]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 187 ms to find 1 implicit places.
[2021-05-15 18:32:39] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 382 rows 382 cols
[2021-05-15 18:32:39] [INFO ] Computed 178 place invariants in 1 ms
[2021-05-15 18:32:39] [INFO ] Dead Transitions using invariants and state equation in 167 ms returned []
Starting structural reductions, iteration 1 : 382/1189 places, 382/1089 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 381 transition count 381
Applied a total of 2 rules in 10 ms. Remains 381 /382 variables (removed 1) and now considering 381/382 (removed 1) transitions.
// Phase 1: matrix 381 rows 381 cols
[2021-05-15 18:32:39] [INFO ] Computed 178 place invariants in 1 ms
[2021-05-15 18:32:39] [INFO ] Implicit Places using invariants in 190 ms returned []
// Phase 1: matrix 381 rows 381 cols
[2021-05-15 18:32:39] [INFO ] Computed 178 place invariants in 1 ms
[2021-05-15 18:32:39] [INFO ] State equation strengthened by 7 read => feed constraints.
[2021-05-15 18:32:39] [INFO ] Implicit Places using invariants and state equation in 344 ms returned []
Implicit Place search using SMT with State Equation took 539 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 381/1189 places, 381/1089 transitions.
Stuttering acceptance computed with spot in 1953 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-020B-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s267 0), p0:(AND (EQ s352 1) (EQ s362 1)), p2:(NEQ s167 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-020B-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-05 finished in 3035 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 3 out of 1189 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1189/1189 places, 1089/1089 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 0 with 240 rules applied. Total rules applied 240 place count 1188 transition count 848
Reduce places removed 240 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 241 rules applied. Total rules applied 481 place count 948 transition count 847
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 482 place count 947 transition count 847
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 154 Pre rules applied. Total rules applied 482 place count 947 transition count 693
Deduced a syphon composed of 154 places in 1 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 3 with 308 rules applied. Total rules applied 790 place count 793 transition count 693
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 796 place count 787 transition count 687
Iterating global reduction 3 with 6 rules applied. Total rules applied 802 place count 787 transition count 687
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 802 place count 787 transition count 681
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 814 place count 781 transition count 681
Performed 336 Post agglomeration using F-continuation condition.Transition count delta: 336
Deduced a syphon composed of 336 places in 0 ms
Reduce places removed 336 places and 0 transitions.
Iterating global reduction 3 with 672 rules applied. Total rules applied 1486 place count 445 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1487 place count 445 transition count 344
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 1489 place count 444 transition count 343
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 1605 place count 386 transition count 380
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1606 place count 385 transition count 379
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1608 place count 383 transition count 379
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1608 place count 383 transition count 378
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1610 place count 382 transition count 378
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1611 place count 381 transition count 377
Applied a total of 1611 rules in 129 ms. Remains 381 /1189 variables (removed 808) and now considering 377/1089 (removed 712) transitions.
// Phase 1: matrix 377 rows 381 cols
[2021-05-15 18:32:41] [INFO ] Computed 179 place invariants in 0 ms
[2021-05-15 18:32:42] [INFO ] Implicit Places using invariants in 308 ms returned [370]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 309 ms to find 1 implicit places.
[2021-05-15 18:32:42] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 377 rows 380 cols
[2021-05-15 18:32:42] [INFO ] Computed 178 place invariants in 1 ms
[2021-05-15 18:32:42] [INFO ] Dead Transitions using invariants and state equation in 189 ms returned []
Starting structural reductions, iteration 1 : 380/1189 places, 377/1089 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 379 transition count 376
Applied a total of 2 rules in 10 ms. Remains 379 /380 variables (removed 1) and now considering 376/377 (removed 1) transitions.
// Phase 1: matrix 376 rows 379 cols
[2021-05-15 18:32:42] [INFO ] Computed 178 place invariants in 3 ms
[2021-05-15 18:32:42] [INFO ] Implicit Places using invariants in 198 ms returned []
// Phase 1: matrix 376 rows 379 cols
[2021-05-15 18:32:42] [INFO ] Computed 178 place invariants in 1 ms
[2021-05-15 18:32:43] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 379/1189 places, 376/1089 transitions.
Stuttering acceptance computed with spot in 33 ms :[true, (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-020B-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (NEQ s366 0) (NEQ s196 1) (NEQ s206 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 6299 steps with 0 reset in 35 ms.
FORMULA ShieldIIPt-PT-020B-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-06 finished in 1249 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0 U X((p1&&G(p2)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 1189 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1189/1189 places, 1089/1089 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1182 transition count 1082
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1182 transition count 1082
Applied a total of 14 rules in 85 ms. Remains 1182 /1189 variables (removed 7) and now considering 1082/1089 (removed 7) transitions.
// Phase 1: matrix 1082 rows 1182 cols
[2021-05-15 18:32:43] [INFO ] Computed 181 place invariants in 3 ms
[2021-05-15 18:32:43] [INFO ] Implicit Places using invariants in 268 ms returned []
// Phase 1: matrix 1082 rows 1182 cols
[2021-05-15 18:32:43] [INFO ] Computed 181 place invariants in 5 ms
[2021-05-15 18:32:44] [INFO ] Implicit Places using invariants and state equation in 777 ms returned []
Implicit Place search using SMT with State Equation took 1047 ms to find 0 implicit places.
// Phase 1: matrix 1082 rows 1182 cols
[2021-05-15 18:32:44] [INFO ] Computed 181 place invariants in 11 ms
[2021-05-15 18:32:44] [INFO ] Dead Transitions using invariants and state equation in 525 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1182/1189 places, 1082/1089 transitions.
Stuttering acceptance computed with spot in 5156 ms :[(OR (NOT p1) (NOT p2)), (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 : ShieldIIPt-PT-020B-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p1 p2), acceptance={} source=2 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=3 dest: 2}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 5}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=6 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 5}, { cond=(AND p0 p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s751 1) (EQ s137 1)), p1:(EQ s137 1), p2:(NEQ s1179 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-020B-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-07 finished in 6837 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||(p1&&F(p0)&&F(p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 1189 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1189/1189 places, 1089/1089 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1181 transition count 1081
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1181 transition count 1081
Applied a total of 16 rules in 93 ms. Remains 1181 /1189 variables (removed 8) and now considering 1081/1089 (removed 8) transitions.
// Phase 1: matrix 1081 rows 1181 cols
[2021-05-15 18:32:50] [INFO ] Computed 181 place invariants in 3 ms
[2021-05-15 18:32:50] [INFO ] Implicit Places using invariants in 386 ms returned []
// Phase 1: matrix 1081 rows 1181 cols
[2021-05-15 18:32:50] [INFO ] Computed 181 place invariants in 2 ms
[2021-05-15 18:32:51] [INFO ] Implicit Places using invariants and state equation in 763 ms returned []
Implicit Place search using SMT with State Equation took 1152 ms to find 0 implicit places.
// Phase 1: matrix 1081 rows 1181 cols
[2021-05-15 18:32:51] [INFO ] Computed 181 place invariants in 2 ms
[2021-05-15 18:32:51] [INFO ] Dead Transitions using invariants and state equation in 529 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1181/1189 places, 1081/1089 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), true, (NOT p0), (NOT p2)]
Running random walk in product with property : ShieldIIPt-PT-020B-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s449 1) (EQ s460 1) (EQ s486 1)), p1:(EQ s925 1), p2:(AND (NEQ s449 0) (NEQ s460 0) (NEQ s486 0))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-020B-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-11 finished in 1897 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||X(X(G(p1))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 1189 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1189/1189 places, 1089/1089 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1181 transition count 1081
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1181 transition count 1081
Applied a total of 16 rules in 84 ms. Remains 1181 /1189 variables (removed 8) and now considering 1081/1089 (removed 8) transitions.
// Phase 1: matrix 1081 rows 1181 cols
[2021-05-15 18:32:51] [INFO ] Computed 181 place invariants in 2 ms
[2021-05-15 18:32:52] [INFO ] Implicit Places using invariants in 293 ms returned []
// Phase 1: matrix 1081 rows 1181 cols
[2021-05-15 18:32:52] [INFO ] Computed 181 place invariants in 3 ms
[2021-05-15 18:32:52] [INFO ] Implicit Places using invariants and state equation in 775 ms returned []
Implicit Place search using SMT with State Equation took 1070 ms to find 0 implicit places.
// Phase 1: matrix 1081 rows 1181 cols
[2021-05-15 18:32:52] [INFO ] Computed 181 place invariants in 3 ms
[2021-05-15 18:32:53] [INFO ] Dead Transitions using invariants and state equation in 516 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1181/1189 places, 1081/1089 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-020B-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s159 1) (EQ s170 1) (EQ s196 1)), p1:(AND (NEQ s940 1) (NEQ s490 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 295 steps with 0 reset in 2 ms.
FORMULA ShieldIIPt-PT-020B-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-13 finished in 1762 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(((p0 U (p1||G(p0)))||(X(p2)&&G(p3)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 1189 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1189/1189 places, 1089/1089 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1181 transition count 1081
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1181 transition count 1081
Applied a total of 16 rules in 83 ms. Remains 1181 /1189 variables (removed 8) and now considering 1081/1089 (removed 8) transitions.
// Phase 1: matrix 1081 rows 1181 cols
[2021-05-15 18:32:53] [INFO ] Computed 181 place invariants in 2 ms
[2021-05-15 18:32:53] [INFO ] Implicit Places using invariants in 292 ms returned []
// Phase 1: matrix 1081 rows 1181 cols
[2021-05-15 18:32:53] [INFO ] Computed 181 place invariants in 2 ms
[2021-05-15 18:32:54] [INFO ] Implicit Places using invariants and state equation in 774 ms returned []
Implicit Place search using SMT with State Equation took 1076 ms to find 0 implicit places.
// Phase 1: matrix 1081 rows 1181 cols
[2021-05-15 18:32:54] [INFO ] Computed 181 place invariants in 3 ms
[2021-05-15 18:32:55] [INFO ] Dead Transitions using invariants and state equation in 526 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1181/1189 places, 1081/1089 transitions.
Spot timed out Subprocess running CommandLine [args=[/home/mcc/BenchKit/bin//..//autfilt, --hoaf=tv, --small, -F, /tmp/curaut9113980263724342545.hoa], workingDir=/home/mcc/execution] killed by timeout after 10 SECONDS
Stuttering acceptance computed with spot in 12005 ms :[false, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : ShieldIIPt-PT-020B-14 automaton TGBA [mat=[[{ cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 1}, { cond=(AND p3 (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={1} source=0 dest: 2}, { cond=(AND p3 (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND (NOT p3) (NOT p1) p0 (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND p3 (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p3 (NOT p1) p0 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p3 (NOT p1) (NOT p0) (NOT p2)), acceptance={1} source=1 dest: 2}, { cond=(AND p3 (NOT p1) p0 (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={0} source=2 dest: 0}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={1} source=2 dest: 2}, { cond=(AND p3 (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p3:(EQ s939 1), p1:(AND (NEQ s689 0) (OR (NEQ s340 1) (NEQ s389 1))), p0:(OR (NEQ s340 1) (NEQ s389 1)), p2:(EQ s939 0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50 reset in 455 ms.
Product exploration explored 100000 steps with 54 reset in 537 ms.
Knowledge obtained : [(NOT p3), (NOT p1), p0, p2]
Stuttering acceptance computed with spot in 86 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 41 reset in 455 ms.
Product exploration explored 100000 steps with 48 reset in 520 ms.
[2021-05-15 18:33:09] [INFO ] Flatten gal took : 39 ms
[2021-05-15 18:33:09] [INFO ] Flatten gal took : 32 ms
[2021-05-15 18:33:09] [INFO ] Time to serialize gal into /tmp/LTL10468794836248563613.gal : 5 ms
[2021-05-15 18:33:09] [INFO ] Time to serialize properties into /tmp/LTL226113933792436112.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL10468794836248563613.gal, -t, CGAL, -LTL, /tmp/LTL226113933792436112.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/LTL10468794836248563613.gal -t CGAL -LTL /tmp/LTL226113933792436112.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((("((p396!=1)||(p455!=1))")U(("((p811!=0)&&((p396!=1)||(p455!=1)))")||(G("((p396!=1)||(p455!=1))"))))||((X("(p1110==0)"))&&(G("(p1110==1)"))))))
Formula 0 simplified : !F(("((p396!=1)||(p455!=1))" U ("((p811!=0)&&((p396!=1)||(p455!=1)))" | G"((p396!=1)||(p455!=1))")) | (X"(p1110==0)" & G"(p1110==1)"))
Detected timeout of ITS tools.
[2021-05-15 18:33:24] [INFO ] Flatten gal took : 32 ms
[2021-05-15 18:33:24] [INFO ] Applying decomposition
[2021-05-15 18:33:24] [INFO ] Flatten gal took : 30 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/graph14362945524256780265.txt, -o, /tmp/graph14362945524256780265.bin, -w, /tmp/graph14362945524256780265.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/graph14362945524256780265.bin, -l, -1, -v, -w, /tmp/graph14362945524256780265.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 18:33:28] [INFO ] Decomposing Gal with order
[2021-05-15 18:33:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 18:33:28] [INFO ] Removed a total of 199 redundant transitions.
[2021-05-15 18:33:28] [INFO ] Flatten gal took : 75 ms
[2021-05-15 18:33:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2021-05-15 18:33:28] [INFO ] Time to serialize gal into /tmp/LTL2138602116727281893.gal : 26 ms
[2021-05-15 18:33:28] [INFO ] Time to serialize properties into /tmp/LTL5743765007770017163.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL2138602116727281893.gal, -t, CGAL, -LTL, /tmp/LTL5743765007770017163.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/LTL2138602116727281893.gal -t CGAL -LTL /tmp/LTL5743765007770017163.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F((("((i5.i4.u129.p396!=1)||(i6.i3.u147.p455!=1))")U(("((i11.i4.u259.p811!=0)&&((i5.i4.u129.p396!=1)||(i6.i3.u147.p455!=1)))")||(G("((i5.i4.u129.p396!=1)||(i6.i3.u147.p455!=1))"))))||((X("(i15.i6.u352.p1110==0)"))&&(G("(i15.i6.u352.p1110==1)"))))))
Formula 0 simplified : !F(("((i5.i4.u129.p396!=1)||(i6.i3.u147.p455!=1))" U ("((i11.i4.u259.p811!=0)&&((i5.i4.u129.p396!=1)||(i6.i3.u147.p455!=1)))" | G"((i5.i4.u129.p396!=1)||(i6.i3.u147.p455!=1))")) | (X"(i15.i6.u352.p1110==0)" & G"(i15.i6.u352.p1110==1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14113027101497448297
[2021-05-15 18:33:43] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14113027101497448297
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/ltsmin14113027101497448297]
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/ltsmin14113027101497448297] 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/ltsmin14113027101497448297] 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 ShieldIIPt-PT-020B-14 finished in 50765 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7494252728536141641
[2021-05-15 18:33:44] [INFO ] Computing symmetric may disable matrix : 1089 transitions.
[2021-05-15 18:33:44] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-15 18:33:44] [INFO ] Computing symmetric may enable matrix : 1089 transitions.
[2021-05-15 18:33:44] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-15 18:33:44] [INFO ] Applying decomposition
[2021-05-15 18:33:44] [INFO ] Flatten gal took : 57 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/graph17330244229547048278.txt, -o, /tmp/graph17330244229547048278.bin, -w, /tmp/graph17330244229547048278.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/graph17330244229547048278.bin, -l, -1, -v, -w, /tmp/graph17330244229547048278.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 18:33:44] [INFO ] Decomposing Gal with order
[2021-05-15 18:33:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 18:33:44] [INFO ] Computing Do-Not-Accords matrix : 1089 transitions.
[2021-05-15 18:33:44] [INFO ] Computation of Completed DNA matrix. took 35 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-15 18:33:44] [INFO ] Built C files in 461ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7494252728536141641
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/ltsmin7494252728536141641]
[2021-05-15 18:33:44] [INFO ] Removed a total of 197 redundant transitions.
[2021-05-15 18:33:44] [INFO ] Flatten gal took : 121 ms
[2021-05-15 18:33:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2021-05-15 18:33:49] [INFO ] Time to serialize gal into /tmp/LTLFireability15651487932381612014.gal : 4447 ms
[2021-05-15 18:33:49] [INFO ] Time to serialize properties into /tmp/LTLFireability3098565922432728121.ltl : 116 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/LTLFireability15651487932381612014.gal, -t, CGAL, -LTL, /tmp/LTLFireability3098565922432728121.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/LTLFireability15651487932381612014.gal -t CGAL -LTL /tmp/LTLFireability3098565922432728121.ltl -c -stutter-deadlock
Read 2 LTL properties
Checking formula 0 : !((X(X((F(!("(((i0.u10.p20==1)&&(i0.u28.p73==1))||(i17.u391.p1225==1))")))||(X((!("((i0.u10.p20==0)||(i0.u28.p73==0))"))U(("((!((i0.u17.p37==1)&&(i0.u20.p56==1)))&&(!((i0.u10.p20==0)||(i0.u28.p73==0))))")||(G(!("((i0.u10.p20==0)||(i0.u28.p73==0))"))))))))))
Formula 0 simplified : !XX(F!"(((i0.u10.p20==1)&&(i0.u28.p73==1))||(i17.u391.p1225==1))" | X(!"((i0.u10.p20==0)||(i0.u28.p73==0))" U ("((!((i0.u17.p37==1)&&(i0.u20.p56==1)))&&(!((i0.u10.p20==0)||(i0.u28.p73==0))))" | G!"((i0.u10.p20==0)||(i0.u28.p73==0))")))
Compilation finished in 9395 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin7494252728536141641]
Link finished in 81 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, X(X((<>((LTLAPp0==true))||X(((LTLAPp1==true) U ((LTLAPp2==true)||[]((LTLAPp1==true)))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin7494252728536141641]
LTSmin run took 17683 ms.
FORMULA ShieldIIPt-PT-020B-02 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
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, <>((((LTLAPp3==true) U ((LTLAPp4==true)||[]((LTLAPp3==true))))||(X((LTLAPp5==true))&&[]((LTLAPp6==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin7494252728536141641]
WARNING : LTSmin timed out (>360 s) on command 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, <>((((LTLAPp3==true) U ((LTLAPp4==true)||[]((LTLAPp3==true))))||(X((LTLAPp5==true))&&[]((LTLAPp6==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin7494252728536141641]
Retrying LTSmin with larger timeout 2880 s
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, <>((((LTLAPp3==true) U ((LTLAPp4==true)||[]((LTLAPp3==true))))||(X((LTLAPp5==true))&&[]((LTLAPp6==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin7494252728536141641]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.020: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.020: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.021: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.021: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.203: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.203: LTL layer: formula: <>((((LTLAPp3==true) U ((LTLAPp4==true)||[]((LTLAPp3==true))))||(X((LTLAPp5==true))&&[]((LTLAPp6==true)))))
pins2lts-mc-linux64( 2/ 8), 0.209: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.210: "<>((((LTLAPp3==true) U ((LTLAPp4==true)||[]((LTLAPp3==true))))||(X((LTLAPp5==true))&&[]((LTLAPp6==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.213: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.218: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.219: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.216: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.221: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.221: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.222: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.411: There are 1097 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.411: State length is 1190, there are 1115 groups
pins2lts-mc-linux64( 0/ 8), 0.411: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.411: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.411: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.411: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.555: [Blue] ~120 levels ~960 states ~10232 transitions
pins2lts-mc-linux64( 4/ 8), 0.606: [Blue] ~240 levels ~1920 states ~23800 transitions
pins2lts-mc-linux64( 6/ 8), 0.679: [Blue] ~480 levels ~3840 states ~33288 transitions
pins2lts-mc-linux64( 2/ 8), 0.840: [Blue] ~960 levels ~7680 states ~63360 transitions
pins2lts-mc-linux64( 2/ 8), 1.156: [Blue] ~1920 levels ~15360 states ~99448 transitions
pins2lts-mc-linux64( 2/ 8), 1.756: [Blue] ~3840 levels ~30720 states ~169912 transitions
pins2lts-mc-linux64( 0/ 8), 2.973: [Blue] ~2158 levels ~61440 states ~218304 transitions
pins2lts-mc-linux64( 2/ 8), 5.411: [Blue] ~15360 levels ~122880 states ~645552 transitions
pins2lts-mc-linux64( 2/ 8), 10.654: [Blue] ~30720 levels ~245760 states ~1314648 transitions
pins2lts-mc-linux64( 0/ 8), 20.974: [Blue] ~2158 levels ~491520 states ~1241256 transitions
pins2lts-mc-linux64( 0/ 8), 42.631: [Blue] ~2158 levels ~983040 states ~2647344 transitions
pins2lts-mc-linux64( 4/ 8), 85.314: [Blue] ~79398 levels ~1966080 states ~6431624 transitions
pins2lts-mc-linux64( 4/ 8), 170.649: [Blue] ~84288 levels ~3932160 states ~12218152 transitions
pins2lts-mc-linux64( 4/ 8), 342.095: [Blue] ~84901 levels ~7864320 states ~23865504 transitions
pins2lts-mc-linux64( 3/ 8), 543.111: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 543.222:
pins2lts-mc-linux64( 0/ 8), 543.222: Explored 12132777 states 49644918 transitions, fanout: 4.092
pins2lts-mc-linux64( 0/ 8), 543.222: Total exploration time 542.780 sec (542.680 sec minimum, 542.737 sec on average)
pins2lts-mc-linux64( 0/ 8), 543.222: States per second: 22353, Transitions per second: 91464
pins2lts-mc-linux64( 0/ 8), 543.222:
pins2lts-mc-linux64( 0/ 8), 543.222: State space has 21420651 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 543.222: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 543.222: blue states: 12132777 (56.64%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 543.222: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 543.222: all-red states: 6955506 (32.47%), bogus 65490 (0.31%)
pins2lts-mc-linux64( 0/ 8), 543.222:
pins2lts-mc-linux64( 0/ 8), 543.222: Total memory used for local state coloring: 41.1MB
pins2lts-mc-linux64( 0/ 8), 543.222:
pins2lts-mc-linux64( 0/ 8), 543.222: Queue width: 8B, total height: 2693949, memory: 20.55MB
pins2lts-mc-linux64( 0/ 8), 543.222: Tree memory: 419.4MB, 20.5 B/state, compr.: 0.4%
pins2lts-mc-linux64( 0/ 8), 543.222: Tree fill ratio (roots/leafs): 15.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 543.222: Stored 1316 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 543.222: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 543.222: Est. total memory use: 440.0MB (~1044.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing 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, <>((((LTLAPp3==true) U ((LTLAPp4==true)||[]((LTLAPp3==true))))||(X((LTLAPp5==true))&&[]((LTLAPp6==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin7494252728536141641]
255
java.lang.RuntimeException: Unexpected exception when executing 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, <>((((LTLAPp3==true) U ((LTLAPp4==true)||[]((LTLAPp3==true))))||(X((LTLAPp5==true))&&[]((LTLAPp6==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin7494252728536141641]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:102)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-15 18:55:46] [INFO ] Applying decomposition
[2021-05-15 18:55:46] [INFO ] Flatten gal took : 86 ms
[2021-05-15 18:55:46] [INFO ] Decomposing Gal with order
[2021-05-15 18:55:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 18:55:46] [INFO ] Removed a total of 58 redundant transitions.
[2021-05-15 18:55:46] [INFO ] Flatten gal took : 83 ms
[2021-05-15 18:55:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 34 ms.
[2021-05-15 18:55:46] [INFO ] Time to serialize gal into /tmp/LTLFireability10577903183820891686.gal : 24 ms
[2021-05-15 18:55:46] [INFO ] Time to serialize properties into /tmp/LTLFireability7216683844878868547.ltl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability10577903183820891686.gal, -t, CGAL, -LTL, /tmp/LTLFireability7216683844878868547.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/LTLFireability10577903183820891686.gal -t CGAL -LTL /tmp/LTLFireability7216683844878868547.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F(((X("(i0.i0.i0.i0.i1.i0.u291.p1110==0)"))&&(G("(i0.i0.i0.i0.i1.i0.u291.p1110==1)")))||((!("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.u119.p396==1)&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.u134.p455==1))"))U(("((i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.u221.p811!=0)&&(!((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.u119.p396==1)&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.u134.p455==1))))")||(G(!("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.u119.p396==1)&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.u134.p455==1))"))))))))
Formula 0 simplified : !F((X"(i0.i0.i0.i0.i1.i0.u291.p1110==0)" & G"(i0.i0.i0.i0.i1.i0.u291.p1110==1)") | (!"((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.u119.p396==1)&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.u134.p455==1))" U ("((i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.u221.p811!=0)&&(!((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.u119.p396==1)&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.u134.p455==1))))" | G!"((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.u119.p396==1)&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.u134.p455==1))")))
Detected timeout of ITS tools.
[2021-05-15 19:17:44] [INFO ] Flatten gal took : 229 ms
[2021-05-15 19:17:45] [INFO ] Input system was already deterministic with 1089 transitions.
[2021-05-15 19:17:45] [INFO ] Transformed 1189 places.
[2021-05-15 19:17:45] [INFO ] Transformed 1089 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-15 19:17:45] [INFO ] Time to serialize gal into /tmp/LTLFireability2204461361111898345.gal : 18 ms
[2021-05-15 19:17:45] [INFO ] Time to serialize properties into /tmp/LTLFireability9943484249617191156.ltl : 3 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/LTLFireability2204461361111898345.gal, -t, CGAL, -LTL, /tmp/LTLFireability9943484249617191156.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability2204461361111898345.gal -t CGAL -LTL /tmp/LTLFireability9943484249617191156.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(((X("(p1110==0)"))&&(G("(p1110==1)")))||((!("((p396==1)&&(p455==1))"))U(("((p811!=0)&&(!((p396==1)&&(p455==1))))")||(G(!("((p396==1)&&(p455==1))"))))))))
Formula 0 simplified : !F((X"(p1110==0)" & G"(p1110==1)") | (!"((p396==1)&&(p455==1))" U ("((p811!=0)&&(!((p396==1)&&(p455==1))))" | G!"((p396==1)&&(p455==1))")))

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-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 ShieldIIPt-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 r216-tall-162098205100445"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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