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.r140-tall-162089128200630.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 Peterson-PT-5, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089128200630
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.8M
-rw-r--r-- 1 mcc users 562K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.1M May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 612K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.7M May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 52K Mar 28 16:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 165K Mar 28 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 60K Mar 28 16:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 201K Mar 28 16:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 69K Mar 27 07:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 192K Mar 27 07:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 47K Mar 25 08:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 154K Mar 25 08:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 26K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 927K May 5 16:51 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 Peterson-PT-5-ReachabilityCardinality-00
FORMULA_NAME Peterson-PT-5-ReachabilityCardinality-01
FORMULA_NAME Peterson-PT-5-ReachabilityCardinality-02
FORMULA_NAME Peterson-PT-5-ReachabilityCardinality-03
FORMULA_NAME Peterson-PT-5-ReachabilityCardinality-04
FORMULA_NAME Peterson-PT-5-ReachabilityCardinality-05
FORMULA_NAME Peterson-PT-5-ReachabilityCardinality-06
FORMULA_NAME Peterson-PT-5-ReachabilityCardinality-07
FORMULA_NAME Peterson-PT-5-ReachabilityCardinality-08
FORMULA_NAME Peterson-PT-5-ReachabilityCardinality-09
FORMULA_NAME Peterson-PT-5-ReachabilityCardinality-10
FORMULA_NAME Peterson-PT-5-ReachabilityCardinality-11
FORMULA_NAME Peterson-PT-5-ReachabilityCardinality-12
FORMULA_NAME Peterson-PT-5-ReachabilityCardinality-13
FORMULA_NAME Peterson-PT-5-ReachabilityCardinality-14
FORMULA_NAME Peterson-PT-5-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1621023442279

Running Version 0
[2021-05-14 20:17:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -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-14 20:17:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 20:17:25] [INFO ] Load time of PNML (sax parser for PT used): 203 ms
[2021-05-14 20:17:25] [INFO ] Transformed 834 places.
[2021-05-14 20:17:25] [INFO ] Transformed 1242 transitions.
[2021-05-14 20:17:25] [INFO ] Found NUPN structural information;
[2021-05-14 20:17:25] [INFO ] Parsed PT model containing 834 places and 1242 transitions in 293 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 56 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-PT-5-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 279 ms. (steps per millisecond=35 ) properties (out of 12) seen :2
FORMULA Peterson-PT-5-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-5-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2021-05-14 20:17:26] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2021-05-14 20:17:27] [INFO ] Computed 23 place invariants in 70 ms
[2021-05-14 20:17:28] [INFO ] [Real]Absence check using 17 positive place invariants in 127 ms returned sat
[2021-05-14 20:17:28] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 25 ms returned sat
[2021-05-14 20:17:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:17:29] [INFO ] [Real]Absence check using state equation in 945 ms returned sat
[2021-05-14 20:17:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:17:32] [INFO ] [Real]Absence check using 17 positive place invariants in 145 ms returned sat
[2021-05-14 20:17:32] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 40 ms returned sat
[2021-05-14 20:17:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:17:33] [INFO ] [Real]Absence check using state equation in 394 ms returned sat
[2021-05-14 20:17:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:17:36] [INFO ] [Nat]Absence check using 17 positive place invariants in 17 ms returned sat
[2021-05-14 20:17:36] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2021-05-14 20:17:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:17:36] [INFO ] [Nat]Absence check using state equation in 273 ms returned sat
[2021-05-14 20:17:36] [INFO ] State equation strengthened by 230 read => feed constraints.
[2021-05-14 20:17:36] [INFO ] [Nat]Added 230 Read/Feed constraints in 53 ms returned sat
[2021-05-14 20:17:37] [INFO ] Deduced a trap composed of 11 places in 319 ms of which 4 ms to minimize.
[2021-05-14 20:17:37] [INFO ] Deduced a trap composed of 11 places in 409 ms of which 11 ms to minimize.
[2021-05-14 20:17:38] [INFO ] Deduced a trap composed of 11 places in 411 ms of which 14 ms to minimize.
[2021-05-14 20:17:38] [INFO ] Deduced a trap composed of 11 places in 355 ms of which 9 ms to minimize.
[2021-05-14 20:17:38] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
[2021-05-14 20:17:38] [INFO ] [Real]Absence check using 17 positive place invariants in 18 ms returned sat
[2021-05-14 20:17:38] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-14 20:17:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:17:39] [INFO ] [Real]Absence check using state equation in 269 ms returned sat
[2021-05-14 20:17:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:17:39] [INFO ] [Nat]Absence check using 17 positive place invariants in 22 ms returned sat
[2021-05-14 20:17:39] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-14 20:17:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:17:39] [INFO ] [Nat]Absence check using state equation in 299 ms returned sat
[2021-05-14 20:17:39] [INFO ] [Nat]Added 230 Read/Feed constraints in 49 ms returned sat
[2021-05-14 20:17:40] [INFO ] Deduced a trap composed of 37 places in 263 ms of which 1 ms to minimize.
[2021-05-14 20:17:40] [INFO ] Deduced a trap composed of 37 places in 511 ms of which 1 ms to minimize.
[2021-05-14 20:17:41] [INFO ] Deduced a trap composed of 37 places in 686 ms of which 0 ms to minimize.
[2021-05-14 20:17:41] [INFO ] Deduced a trap composed of 44 places in 226 ms of which 2 ms to minimize.
[2021-05-14 20:17:41] [INFO ] Deduced a trap composed of 37 places in 212 ms of which 0 ms to minimize.
[2021-05-14 20:17:42] [INFO ] Deduced a trap composed of 11 places in 193 ms of which 1 ms to minimize.
[2021-05-14 20:17:42] [INFO ] Deduced a trap composed of 19 places in 186 ms of which 1 ms to minimize.
[2021-05-14 20:17:42] [INFO ] Deduced a trap composed of 32 places in 227 ms of which 0 ms to minimize.
[2021-05-14 20:17:42] [INFO ] Deduced a trap composed of 26 places in 190 ms of which 0 ms to minimize.
[2021-05-14 20:17:43] [INFO ] Deduced a trap composed of 27 places in 216 ms of which 0 ms to minimize.
[2021-05-14 20:17:43] [INFO ] Deduced a trap composed of 11 places in 196 ms of which 9 ms to minimize.
[2021-05-14 20:17:43] [INFO ] Deduced a trap composed of 108 places in 183 ms of which 1 ms to minimize.
[2021-05-14 20:17:43] [INFO ] Deduced a trap composed of 83 places in 156 ms of which 1 ms to minimize.
[2021-05-14 20:17:43] [INFO ] Deduced a trap composed of 83 places in 172 ms of which 0 ms to minimize.
[2021-05-14 20:17:44] [INFO ] Deduced a trap composed of 86 places in 612 ms of which 0 ms to minimize.
[2021-05-14 20:17:44] [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-14 20:17:44] [INFO ] [Real]Absence check using 17 positive place invariants in 17 ms returned sat
[2021-05-14 20:17:44] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 34 ms returned sat
[2021-05-14 20:17:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:17:45] [INFO ] [Real]Absence check using state equation in 397 ms returned sat
[2021-05-14 20:17:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:17:45] [INFO ] [Nat]Absence check using 17 positive place invariants in 18 ms returned sat
[2021-05-14 20:17:45] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-14 20:17:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:17:45] [INFO ] [Nat]Absence check using state equation in 392 ms returned sat
[2021-05-14 20:17:45] [INFO ] [Nat]Added 230 Read/Feed constraints in 55 ms returned sat
[2021-05-14 20:17:46] [INFO ] Deduced a trap composed of 32 places in 395 ms of which 1 ms to minimize.
[2021-05-14 20:17:46] [INFO ] Deduced a trap composed of 18 places in 261 ms of which 0 ms to minimize.
[2021-05-14 20:17:46] [INFO ] Deduced a trap composed of 26 places in 233 ms of which 1 ms to minimize.
[2021-05-14 20:17:47] [INFO ] Deduced a trap composed of 32 places in 238 ms of which 1 ms to minimize.
[2021-05-14 20:17:47] [INFO ] Deduced a trap composed of 32 places in 229 ms of which 1 ms to minimize.
[2021-05-14 20:17:47] [INFO ] Deduced a trap composed of 29 places in 279 ms of which 1 ms to minimize.
[2021-05-14 20:17:48] [INFO ] Deduced a trap composed of 32 places in 237 ms of which 1 ms to minimize.
[2021-05-14 20:17:48] [INFO ] Deduced a trap composed of 71 places in 241 ms of which 0 ms to minimize.
[2021-05-14 20:17:48] [INFO ] Deduced a trap composed of 37 places in 250 ms of which 1 ms to minimize.
[2021-05-14 20:17:48] [INFO ] Deduced a trap composed of 40 places in 247 ms of which 1 ms to minimize.
[2021-05-14 20:17:49] [INFO ] Deduced a trap composed of 40 places in 255 ms of which 1 ms to minimize.
[2021-05-14 20:17:49] [INFO ] Deduced a trap composed of 40 places in 250 ms of which 1 ms to minimize.
[2021-05-14 20:17:49] [INFO ] Deduced a trap composed of 40 places in 247 ms of which 1 ms to minimize.
[2021-05-14 20:17:50] [INFO ] Deduced a trap composed of 74 places in 249 ms of which 0 ms to minimize.
[2021-05-14 20:17:50] [INFO ] Deduced a trap composed of 47 places in 242 ms of which 2 ms to minimize.
[2021-05-14 20:17: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: Stream close... while checking expression at index 5
[2021-05-14 20:17:50] [INFO ] [Real]Absence check using 17 positive place invariants in 16 ms returned sat
[2021-05-14 20:17:50] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-14 20:17:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:17:50] [INFO ] [Real]Absence check using state equation in 303 ms returned sat
[2021-05-14 20:17:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:17:50] [INFO ] [Nat]Absence check using 17 positive place invariants in 18 ms returned sat
[2021-05-14 20:17:50] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-14 20:17:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:17:51] [INFO ] [Nat]Absence check using state equation in 302 ms returned sat
[2021-05-14 20:17:51] [INFO ] [Nat]Added 230 Read/Feed constraints in 47 ms returned sat
[2021-05-14 20:17:51] [INFO ] Deduced a trap composed of 48 places in 266 ms of which 5 ms to minimize.
[2021-05-14 20:17:51] [INFO ] Deduced a trap composed of 11 places in 282 ms of which 1 ms to minimize.
[2021-05-14 20:17:52] [INFO ] Deduced a trap composed of 53 places in 285 ms of which 1 ms to minimize.
[2021-05-14 20:17:52] [INFO ] Deduced a trap composed of 50 places in 281 ms of which 0 ms to minimize.
[2021-05-14 20:17:52] [INFO ] Deduced a trap composed of 49 places in 283 ms of which 1 ms to minimize.
[2021-05-14 20:17:53] [INFO ] Deduced a trap composed of 50 places in 283 ms of which 10 ms to minimize.
[2021-05-14 20:17:53] [INFO ] Deduced a trap composed of 65 places in 283 ms of which 1 ms to minimize.
[2021-05-14 20:17:53] [INFO ] Deduced a trap composed of 65 places in 284 ms of which 0 ms to minimize.
[2021-05-14 20:17:54] [INFO ] Deduced a trap composed of 11 places in 276 ms of which 1 ms to minimize.
[2021-05-14 20:17:54] [INFO ] Deduced a trap composed of 49 places in 280 ms of which 1 ms to minimize.
[2021-05-14 20:17:54] [INFO ] Deduced a trap composed of 58 places in 279 ms of which 0 ms to minimize.
[2021-05-14 20:17:55] [INFO ] Deduced a trap composed of 56 places in 261 ms of which 1 ms to minimize.
[2021-05-14 20:17:55] [INFO ] Deduced a trap composed of 55 places in 299 ms of which 0 ms to minimize.
[2021-05-14 20:17:55] [INFO ] Deduced a trap composed of 77 places in 285 ms of which 1 ms to minimize.
[2021-05-14 20:17:56] [INFO ] Deduced a trap composed of 76 places in 300 ms of which 0 ms to minimize.
[2021-05-14 20:17:56] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
[2021-05-14 20:17:56] [INFO ] [Real]Absence check using 17 positive place invariants in 15 ms returned sat
[2021-05-14 20:17:56] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-14 20:17:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:17:56] [INFO ] [Real]Absence check using state equation in 313 ms returned sat
[2021-05-14 20:17:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:17:56] [INFO ] [Nat]Absence check using 17 positive place invariants in 17 ms returned sat
[2021-05-14 20:17:56] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-14 20:17:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:17:57] [INFO ] [Nat]Absence check using state equation in 289 ms returned sat
[2021-05-14 20:17:57] [INFO ] [Nat]Added 230 Read/Feed constraints in 53 ms returned sat
[2021-05-14 20:17:57] [INFO ] Deduced a trap composed of 13 places in 244 ms of which 1 ms to minimize.
[2021-05-14 20:17:57] [INFO ] Deduced a trap composed of 43 places in 245 ms of which 8 ms to minimize.
[2021-05-14 20:17:57] [INFO ] Deduced a trap composed of 28 places in 193 ms of which 0 ms to minimize.
[2021-05-14 20:17:58] [INFO ] Deduced a trap composed of 28 places in 208 ms of which 0 ms to minimize.
[2021-05-14 20:17:58] [INFO ] Deduced a trap composed of 52 places in 190 ms of which 1 ms to minimize.
[2021-05-14 20:17:58] [INFO ] Deduced a trap composed of 28 places in 205 ms of which 0 ms to minimize.
[2021-05-14 20:17:58] [INFO ] Deduced a trap composed of 48 places in 204 ms of which 1 ms to minimize.
[2021-05-14 20:17:59] [INFO ] Deduced a trap composed of 52 places in 204 ms of which 15 ms to minimize.
[2021-05-14 20:17:59] [INFO ] Deduced a trap composed of 78 places in 169 ms of which 1 ms to minimize.
[2021-05-14 20:17:59] [INFO ] Deduced a trap composed of 105 places in 123 ms of which 0 ms to minimize.
[2021-05-14 20:17:59] [INFO ] Deduced a trap composed of 104 places in 123 ms of which 0 ms to minimize.
[2021-05-14 20:17:59] [INFO ] Deduced a trap composed of 104 places in 120 ms of which 0 ms to minimize.
[2021-05-14 20:17:59] [INFO ] Deduced a trap composed of 93 places in 119 ms of which 0 ms to minimize.
[2021-05-14 20:18:00] [INFO ] Deduced a trap composed of 104 places in 121 ms of which 0 ms to minimize.
[2021-05-14 20:18:00] [INFO ] Deduced a trap composed of 184 places in 132 ms of which 2 ms to minimize.
[2021-05-14 20:18:00] [INFO ] Deduced a trap composed of 130 places in 193 ms of which 0 ms to minimize.
[2021-05-14 20:18:00] [INFO ] Deduced a trap composed of 98 places in 225 ms of which 2 ms to minimize.
[2021-05-14 20:18:01] [INFO ] Deduced a trap composed of 110 places in 204 ms of which 2 ms to minimize.
[2021-05-14 20:18:01] [INFO ] Deduced a trap composed of 28 places in 280 ms of which 11 ms to minimize.
[2021-05-14 20:18:01] [INFO ] Deduced a trap composed of 130 places in 179 ms of which 2 ms to minimize.
[2021-05-14 20:18:01] [INFO ] Deduced a trap composed of 131 places in 172 ms of which 1 ms to minimize.
[2021-05-14 20:18:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
[2021-05-14 20:18:01] [INFO ] [Real]Absence check using 17 positive place invariants in 17 ms returned sat
[2021-05-14 20:18:01] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-14 20:18:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:18:02] [INFO ] [Real]Absence check using state equation in 321 ms returned sat
[2021-05-14 20:18:02] [INFO ] [Real]Added 230 Read/Feed constraints in 42 ms returned sat
[2021-05-14 20:18:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:18:02] [INFO ] [Nat]Absence check using 17 positive place invariants in 19 ms returned sat
[2021-05-14 20:18:02] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-14 20:18:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:18:02] [INFO ] [Nat]Absence check using state equation in 307 ms returned sat
[2021-05-14 20:18:02] [INFO ] [Nat]Added 230 Read/Feed constraints in 42 ms returned sat
[2021-05-14 20:18:03] [INFO ] Deduced a trap composed of 11 places in 245 ms of which 0 ms to minimize.
[2021-05-14 20:18:03] [INFO ] Deduced a trap composed of 11 places in 260 ms of which 1 ms to minimize.
[2021-05-14 20:18:03] [INFO ] Deduced a trap composed of 11 places in 265 ms of which 1 ms to minimize.
[2021-05-14 20:18:04] [INFO ] Deduced a trap composed of 11 places in 261 ms of which 1 ms to minimize.
[2021-05-14 20:18:04] [INFO ] Deduced a trap composed of 11 places in 252 ms of which 0 ms to minimize.
[2021-05-14 20:18:04] [INFO ] Deduced a trap composed of 56 places in 225 ms of which 0 ms to minimize.
[2021-05-14 20:18:04] [INFO ] Deduced a trap composed of 82 places in 213 ms of which 1 ms to minimize.
[2021-05-14 20:18:05] [INFO ] Deduced a trap composed of 41 places in 225 ms of which 3 ms to minimize.
[2021-05-14 20:18:05] [INFO ] Deduced a trap composed of 56 places in 216 ms of which 0 ms to minimize.
[2021-05-14 20:18:05] [INFO ] Deduced a trap composed of 56 places in 213 ms of which 1 ms to minimize.
[2021-05-14 20:18:05] [INFO ] Deduced a trap composed of 41 places in 217 ms of which 1 ms to minimize.
[2021-05-14 20:18:06] [INFO ] Deduced a trap composed of 135 places in 262 ms of which 1 ms to minimize.
[2021-05-14 20:18:06] [INFO ] Deduced a trap composed of 135 places in 265 ms of which 0 ms to minimize.
[2021-05-14 20:18:06] [INFO ] Deduced a trap composed of 32 places in 272 ms of which 1 ms to minimize.
[2021-05-14 20:18:07] [INFO ] Deduced a trap composed of 119 places in 183 ms of which 1 ms to minimize.
[2021-05-14 20:18:07] [INFO ] Deduced a trap composed of 93 places in 166 ms of which 0 ms to minimize.
[2021-05-14 20:18:07] [INFO ] Deduced a trap composed of 71 places in 171 ms of which 1 ms to minimize.
[2021-05-14 20:18:07] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
[2021-05-14 20:18:07] [INFO ] [Real]Absence check using 17 positive place invariants in 15 ms returned sat
[2021-05-14 20:18:07] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-14 20:18:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:18:07] [INFO ] [Real]Absence check using state equation in 282 ms returned sat
[2021-05-14 20:18:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:18:08] [INFO ] [Nat]Absence check using 17 positive place invariants in 18 ms returned sat
[2021-05-14 20:18:08] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-14 20:18:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:18:08] [INFO ] [Nat]Absence check using state equation in 260 ms returned sat
[2021-05-14 20:18:08] [INFO ] [Nat]Added 230 Read/Feed constraints in 47 ms returned sat
[2021-05-14 20:18:08] [INFO ] Deduced a trap composed of 139 places in 224 ms of which 0 ms to minimize.
[2021-05-14 20:18:08] [INFO ] Deduced a trap composed of 28 places in 226 ms of which 0 ms to minimize.
[2021-05-14 20:18:09] [INFO ] Deduced a trap composed of 30 places in 233 ms of which 0 ms to minimize.
[2021-05-14 20:18:09] [INFO ] Deduced a trap composed of 11 places in 225 ms of which 1 ms to minimize.
[2021-05-14 20:18:09] [INFO ] Deduced a trap composed of 133 places in 228 ms of which 0 ms to minimize.
[2021-05-14 20:18:09] [INFO ] Deduced a trap composed of 139 places in 228 ms of which 1 ms to minimize.
[2021-05-14 20:18:10] [INFO ] Deduced a trap composed of 139 places in 241 ms of which 1 ms to minimize.
[2021-05-14 20:18:10] [INFO ] Deduced a trap composed of 56 places in 232 ms of which 1 ms to minimize.
[2021-05-14 20:18:10] [INFO ] Deduced a trap composed of 136 places in 223 ms of which 1 ms to minimize.
[2021-05-14 20:18:11] [INFO ] Deduced a trap composed of 136 places in 231 ms of which 0 ms to minimize.
[2021-05-14 20:18:11] [INFO ] Deduced a trap composed of 136 places in 218 ms of which 1 ms to minimize.
[2021-05-14 20:18:11] [INFO ] Deduced a trap composed of 136 places in 217 ms of which 0 ms to minimize.
[2021-05-14 20:18:11] [INFO ] Deduced a trap composed of 102 places in 215 ms of which 0 ms to minimize.
[2021-05-14 20:18:12] [INFO ] Deduced a trap composed of 15 places in 228 ms of which 1 ms to minimize.
[2021-05-14 20:18:12] [INFO ] Deduced a trap composed of 15 places in 245 ms of which 0 ms to minimize.
[2021-05-14 20:18:12] [INFO ] Deduced a trap composed of 14 places in 229 ms of which 0 ms to minimize.
[2021-05-14 20:18:12] [INFO ] Deduced a trap composed of 125 places in 195 ms of which 1 ms to minimize.
[2021-05-14 20:18:13] [INFO ] Deduced a trap composed of 19 places in 214 ms of which 1 ms to minimize.
[2021-05-14 20:18:13] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 9
FORMULA Peterson-PT-5-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-5-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 1 different solutions.
Support contains 611 out of 834 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 63 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 834/834 places, 1242/1242 transitions.
[2021-05-14 20:18:13] [INFO ] Flatten gal took : 110 ms
[2021-05-14 20:18:13] [INFO ] Flatten gal took : 67 ms
[2021-05-14 20:18:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12446151568762267512.gal : 22 ms
[2021-05-14 20:18:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17504052675233095876.prop : 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality12446151568762267512.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality17504052675233095876.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality12446151568762267512.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality17504052675233095876.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality17504052675233095876.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :2 after 9
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :9 after 11
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :11 after 12
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :12 after 15
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :15 after 16
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :16 after 21
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :21 after 76
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :76 after 180
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :180 after 874
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :874 after 2322
Invariant property Peterson-PT-5-ReachabilityCardinality-08 does not hold.
FORMULA Peterson-PT-5-ReachabilityCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :2322 after 6567
SDD proceeding with computation,7 properties remain. new max is 8192
SDD size :6567 after 10070
SDD proceeding with computation,7 properties remain. new max is 16384
SDD size :10070 after 31666
SDD proceeding with computation,7 properties remain. new max is 32768
SDD size :31666 after 110594
Invariant property Peterson-PT-5-ReachabilityCardinality-10 does not hold.
FORMULA Peterson-PT-5-ReachabilityCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,6 properties remain. new max is 32768
SDD size :110594 after 315228
Detected timeout of ITS tools.
[2021-05-14 20:18:28] [INFO ] Flatten gal took : 84 ms
[2021-05-14 20:18:28] [INFO ] Applying decomposition
[2021-05-14 20:18:28] [INFO ] Flatten gal took : 49 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/graph16337017921466915266.txt, -o, /tmp/graph16337017921466915266.bin, -w, /tmp/graph16337017921466915266.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/graph16337017921466915266.bin, -l, -1, -v, -w, /tmp/graph16337017921466915266.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 20:18:29] [INFO ] Decomposing Gal with order
[2021-05-14 20:18:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 20:18:30] [INFO ] Removed a total of 222 redundant transitions.
[2021-05-14 20:18:30] [INFO ] Flatten gal took : 941 ms
[2021-05-14 20:18:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 210 labels/synchronizations in 26 ms.
[2021-05-14 20:18:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16982988897513464713.gal : 11 ms
[2021-05-14 20:18:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1011465597118522627.prop : 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality16982988897513464713.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality1011465597118522627.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality16982988897513464713.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality1011465597118522627.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality1011465597118522627.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :4 after 13
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :13 after 14
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :14 after 15
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :15 after 16
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :16 after 19
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :19 after 114
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :114 after 206
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :206 after 883
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :883 after 1468
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :1468 after 4512
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :4512 after 8709
SDD proceeding with computation,6 properties remain. new max is 32768
SDD size :8709 after 30968
SDD proceeding with computation,6 properties remain. new max is 65536
SDD size :30968 after 107231
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4656233647011377872
[2021-05-14 20:18:45] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4656233647011377872
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/ltsmin4656233647011377872]
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/ltsmin4656233647011377872] 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/ltsmin4656233647011377872] 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)
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4578 ms. (steps per millisecond=218 ) properties (out of 6) seen :0
Interrupted Best-First random walk after 647935 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=129 ) properties seen :{}
Interrupted Best-First random walk after 481986 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=96 ) properties seen :{}
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1210 ms. (steps per millisecond=826 ) properties (out of 6) seen :1
FORMULA Peterson-PT-5-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1008 ms. (steps per millisecond=992 ) properties (out of 5) seen :1
FORMULA Peterson-PT-5-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 957 ms. (steps per millisecond=1044 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2021-05-14 20:19:04] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2021-05-14 20:19:04] [INFO ] Computed 23 place invariants in 7 ms
[2021-05-14 20:19:04] [INFO ] [Real]Absence check using 17 positive place invariants in 17 ms returned sat
[2021-05-14 20:19:04] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-14 20:19:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:19:05] [INFO ] [Real]Absence check using state equation in 314 ms returned sat
[2021-05-14 20:19:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:19:08] [INFO ] [Real]Absence check using 17 positive place invariants in 17 ms returned sat
[2021-05-14 20:19:08] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-14 20:19:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:19:08] [INFO ] [Real]Absence check using state equation in 307 ms returned sat
[2021-05-14 20:19:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:19:11] [INFO ] [Nat]Absence check using 17 positive place invariants in 17 ms returned sat
[2021-05-14 20:19:11] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-14 20:19:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:19:12] [INFO ] [Nat]Absence check using state equation in 294 ms returned sat
[2021-05-14 20:19:12] [INFO ] State equation strengthened by 230 read => feed constraints.
[2021-05-14 20:19:12] [INFO ] [Nat]Added 230 Read/Feed constraints in 69 ms returned sat
[2021-05-14 20:19:12] [INFO ] Deduced a trap composed of 11 places in 209 ms of which 2 ms to minimize.
[2021-05-14 20:19:12] [INFO ] Deduced a trap composed of 11 places in 267 ms of which 0 ms to minimize.
[2021-05-14 20:19:12] [INFO ] Deduced a trap composed of 11 places in 191 ms of which 0 ms to minimize.
[2021-05-14 20:19:13] [INFO ] Deduced a trap composed of 11 places in 191 ms of which 1 ms to minimize.
[2021-05-14 20:19:13] [INFO ] Deduced a trap composed of 11 places in 191 ms of which 1 ms to minimize.
[2021-05-14 20:19:13] [INFO ] Deduced a trap composed of 79 places in 180 ms of which 0 ms to minimize.
[2021-05-14 20:19:13] [INFO ] Deduced a trap composed of 67 places in 183 ms of which 1 ms to minimize.
[2021-05-14 20:19:14] [INFO ] Deduced a trap composed of 63 places in 187 ms of which 0 ms to minimize.
[2021-05-14 20:19:14] [INFO ] Deduced a trap composed of 63 places in 187 ms of which 1 ms to minimize.
[2021-05-14 20:19:14] [INFO ] Deduced a trap composed of 65 places in 187 ms of which 1 ms to minimize.
[2021-05-14 20:19:14] [INFO ] Deduced a trap composed of 65 places in 175 ms of which 1 ms to minimize.
[2021-05-14 20:19:14] [INFO ] Deduced a trap composed of 65 places in 180 ms of which 0 ms to minimize.
[2021-05-14 20:19:15] [INFO ] Deduced a trap composed of 65 places in 177 ms of which 1 ms to minimize.
[2021-05-14 20:19:15] [INFO ] Deduced a trap composed of 65 places in 178 ms of which 0 ms to minimize.
[2021-05-14 20:19:15] [INFO ] Deduced a trap composed of 89 places in 245 ms of which 0 ms to minimize.
[2021-05-14 20:19:15] [INFO ] Deduced a trap composed of 89 places in 218 ms of which 1 ms to minimize.
[2021-05-14 20:19:16] [INFO ] Deduced a trap composed of 89 places in 231 ms of which 1 ms to minimize.
[2021-05-14 20:19:16] [INFO ] Deduced a trap composed of 89 places in 235 ms of which 1 ms to minimize.
[2021-05-14 20:19:16] [INFO ] Deduced a trap composed of 89 places in 224 ms of which 1 ms to minimize.
[2021-05-14 20:19:16] [INFO ] Deduced a trap composed of 89 places in 197 ms of which 1 ms to minimize.
[2021-05-14 20:19:17] [INFO ] Deduced a trap composed of 117 places in 215 ms of which 0 ms to minimize.
[2021-05-14 20:19:17] [INFO ] Deduced a trap composed of 75 places in 209 ms of which 0 ms to minimize.
[2021-05-14 20:19:17] [INFO ] Deduced a trap composed of 74 places in 209 ms of which 0 ms to minimize.
[2021-05-14 20:19:18] [INFO ] Deduced a trap composed of 14 places in 291 ms of which 1 ms to minimize.
[2021-05-14 20:19:18] [INFO ] Deduced a trap composed of 109 places in 268 ms of which 0 ms to minimize.
[2021-05-14 20:19:18] [INFO ] Deduced a trap composed of 59 places in 263 ms of which 0 ms to minimize.
[2021-05-14 20:19:19] [INFO ] Deduced a trap composed of 108 places in 229 ms of which 1 ms to minimize.
[2021-05-14 20:19:19] [INFO ] Deduced a trap composed of 58 places in 234 ms of which 1 ms to minimize.
[2021-05-14 20:19:19] [INFO ] Deduced a trap composed of 93 places in 186 ms of which 1 ms to minimize.
[2021-05-14 20:19:19] [INFO ] Deduced a trap composed of 122 places in 185 ms of which 1 ms to minimize.
[2021-05-14 20:19:20] [INFO ] Deduced a trap composed of 61 places in 165 ms of which 1 ms to minimize.
[2021-05-14 20:19:20] [INFO ] Deduced a trap composed of 63 places in 209 ms of which 0 ms to minimize.
[2021-05-14 20:19:20] [INFO ] Deduced a trap composed of 117 places in 196 ms of which 1 ms to minimize.
[2021-05-14 20:19:20] [INFO ] Deduced a trap composed of 132 places in 217 ms of which 0 ms to minimize.
[2021-05-14 20:19:21] [INFO ] Deduced a trap composed of 39 places in 195 ms of which 0 ms to minimize.
[2021-05-14 20:19:21] [INFO ] Deduced a trap composed of 85 places in 230 ms of which 1 ms to minimize.
[2021-05-14 20:19:21] [INFO ] Deduced a trap composed of 55 places in 247 ms of which 1 ms to minimize.
[2021-05-14 20:19:22] [INFO ] Deduced a trap composed of 130 places in 243 ms of which 1 ms to minimize.
[2021-05-14 20:19:22] [INFO ] Deduced a trap composed of 104 places in 254 ms of which 0 ms to minimize.
[2021-05-14 20:19:22] [INFO ] Deduced a trap composed of 115 places in 228 ms of which 1 ms to minimize.
[2021-05-14 20:19:23] [INFO ] Deduced a trap composed of 37 places in 236 ms of which 1 ms to minimize.
[2021-05-14 20:19:23] [INFO ] Deduced a trap composed of 37 places in 238 ms of which 0 ms to minimize.
[2021-05-14 20:19:23] [INFO ] Deduced a trap composed of 37 places in 226 ms of which 1 ms to minimize.
[2021-05-14 20:19:24] [INFO ] Deduced a trap composed of 37 places in 224 ms of which 0 ms to minimize.
[2021-05-14 20:19:24] [INFO ] Deduced a trap composed of 37 places in 224 ms of which 1 ms to minimize.
[2021-05-14 20:19:24] [INFO ] Deduced a trap composed of 43 places in 254 ms of which 1 ms to minimize.
[2021-05-14 20:19:25] [INFO ] Deduced a trap composed of 28 places in 272 ms of which 1 ms to minimize.
[2021-05-14 20:19:25] [INFO ] Deduced a trap composed of 43 places in 256 ms of which 0 ms to minimize.
[2021-05-14 20:19:25] [INFO ] Deduced a trap composed of 43 places in 258 ms of which 1 ms to minimize.
[2021-05-14 20:19:26] [INFO ] Deduced a trap composed of 51 places in 239 ms of which 0 ms to minimize.
[2021-05-14 20:19:26] [INFO ] Deduced a trap composed of 117 places in 240 ms of which 1 ms to minimize.
[2021-05-14 20:19:27] [INFO ] Deduced a trap composed of 46 places in 190 ms of which 0 ms to minimize.
[2021-05-14 20:19:27] [INFO ] Deduced a trap composed of 67 places in 189 ms of which 1 ms to minimize.
[2021-05-14 20:19:27] [INFO ] Deduced a trap composed of 90 places in 191 ms of which 0 ms to minimize.
[2021-05-14 20:19:28] [INFO ] Deduced a trap composed of 79 places in 184 ms of which 1 ms to minimize.
[2021-05-14 20:19:28] [INFO ] Deduced a trap composed of 79 places in 184 ms of which 1 ms to minimize.
[2021-05-14 20:19:28] [INFO ] Deduced a trap composed of 66 places in 173 ms of which 0 ms to minimize.
[2021-05-14 20:19:29] [INFO ] Deduced a trap composed of 124 places in 207 ms of which 0 ms to minimize.
[2021-05-14 20:19:29] [INFO ] Deduced a trap composed of 82 places in 193 ms of which 1 ms to minimize.
[2021-05-14 20:19:29] [INFO ] Deduced a trap composed of 56 places in 235 ms of which 0 ms to minimize.
[2021-05-14 20:19:29] [INFO ] Deduced a trap composed of 75 places in 231 ms of which 1 ms to minimize.
[2021-05-14 20:19:30] [INFO ] Deduced a trap composed of 104 places in 173 ms of which 0 ms to minimize.
[2021-05-14 20:19:30] [INFO ] Deduced a trap composed of 104 places in 174 ms of which 0 ms to minimize.
[2021-05-14 20:19:30] [INFO ] Deduced a trap composed of 104 places in 177 ms of which 0 ms to minimize.
[2021-05-14 20:19:30] [INFO ] Deduced a trap composed of 134 places in 180 ms of which 1 ms to minimize.
[2021-05-14 20:19:30] [INFO ] Deduced a trap composed of 188 places in 179 ms of which 0 ms to minimize.
[2021-05-14 20:19:31] [INFO ] Deduced a trap composed of 105 places in 166 ms of which 1 ms to minimize.
[2021-05-14 20:19:31] [INFO ] Deduced a trap composed of 130 places in 178 ms of which 0 ms to minimize.
[2021-05-14 20:19:32] [INFO ] Deduced a trap composed of 127 places in 182 ms of which 1 ms to minimize.
[2021-05-14 20:19:32] [INFO ] Deduced a trap composed of 98 places in 184 ms of which 0 ms to minimize.
[2021-05-14 20:19:32] [INFO ] Deduced a trap composed of 93 places in 172 ms of which 0 ms to minimize.
[2021-05-14 20:19:33] [INFO ] Deduced a trap composed of 18 places in 261 ms of which 1 ms to minimize.
[2021-05-14 20:19:33] [INFO ] Deduced a trap composed of 136 places in 214 ms of which 0 ms to minimize.
[2021-05-14 20:19:34] [INFO ] Deduced a trap composed of 53 places in 261 ms of which 1 ms to minimize.
[2021-05-14 20:19:35] [INFO ] Deduced a trap composed of 56 places in 239 ms of which 1 ms to minimize.
[2021-05-14 20:19:35] [INFO ] Deduced a trap composed of 56 places in 257 ms of which 1 ms to minimize.
[2021-05-14 20:19:35] [INFO ] Deduced a trap composed of 15 places in 260 ms of which 1 ms to minimize.
[2021-05-14 20:19:36] [INFO ] Deduced a trap composed of 56 places in 257 ms of which 1 ms to minimize.
[2021-05-14 20:19:37] [INFO ] Deduced a trap composed of 127 places in 172 ms of which 1 ms to minimize.
[2021-05-14 20:19:37] [INFO ] Deduced a trap composed of 138 places in 187 ms of which 1 ms to minimize.
[2021-05-14 20:19:38] [INFO ] Deduced a trap composed of 149 places in 178 ms of which 8 ms to minimize.
[2021-05-14 20:19:38] [INFO ] Deduced a trap composed of 97 places in 184 ms of which 0 ms to minimize.
[2021-05-14 20:19:38] [INFO ] Deduced a trap composed of 137 places in 184 ms of which 0 ms to minimize.
[2021-05-14 20:19:39] [INFO ] Deduced a trap composed of 43 places in 182 ms of which 0 ms to minimize.
[2021-05-14 20:19:41] [INFO ] Deduced a trap composed of 107 places in 211 ms of which 0 ms to minimize.
[2021-05-14 20:19:42] [INFO ] Deduced a trap composed of 41 places in 253 ms of which 1 ms to minimize.
[2021-05-14 20:19:42] [INFO ] Deduced a trap composed of 91 places in 256 ms of which 1 ms to minimize.
[2021-05-14 20:19:42] [INFO ] Deduced a trap composed of 48 places in 232 ms of which 1 ms to minimize.
[2021-05-14 20:19:42] [INFO ] Deduced a trap composed of 93 places in 167 ms of which 1 ms to minimize.
[2021-05-14 20:19:43] [INFO ] Deduced a trap composed of 173 places in 186 ms of which 1 ms to minimize.
[2021-05-14 20:19:43] [INFO ] Deduced a trap composed of 126 places in 184 ms of which 1 ms to minimize.
[2021-05-14 20:19:43] [INFO ] Deduced a trap composed of 126 places in 172 ms of which 0 ms to minimize.
[2021-05-14 20:19:43] [INFO ] Deduced a trap composed of 134 places in 172 ms of which 1 ms to minimize.
[2021-05-14 20:19:45] [INFO ] Deduced a trap composed of 40 places in 220 ms of which 0 ms to minimize.
[2021-05-14 20:19:45] [INFO ] Deduced a trap composed of 41 places in 260 ms of which 0 ms to minimize.
[2021-05-14 20:19:45] [INFO ] Deduced a trap composed of 40 places in 235 ms of which 0 ms to minimize.
[2021-05-14 20:19:45] [INFO ] Deduced a trap composed of 123 places in 181 ms of which 0 ms to minimize.
[2021-05-14 20:19:54] [INFO ] Deduced a trap composed of 2 places in 358 ms of which 1 ms to minimize.
[2021-05-14 20:19: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 1
[2021-05-14 20:19:54] [INFO ] [Real]Absence check using 17 positive place invariants in 17 ms returned sat
[2021-05-14 20:19:54] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-14 20:19:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:19:54] [INFO ] [Real]Absence check using state equation in 416 ms returned sat
[2021-05-14 20:19:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:19:54] [INFO ] [Nat]Absence check using 17 positive place invariants in 19 ms returned sat
[2021-05-14 20:19:54] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-14 20:19:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:19:55] [INFO ] [Nat]Absence check using state equation in 412 ms returned sat
[2021-05-14 20:19:55] [INFO ] [Nat]Added 230 Read/Feed constraints in 61 ms returned sat
[2021-05-14 20:19:55] [INFO ] Deduced a trap composed of 32 places in 241 ms of which 1 ms to minimize.
[2021-05-14 20:19:55] [INFO ] Deduced a trap composed of 18 places in 249 ms of which 0 ms to minimize.
[2021-05-14 20:19:56] [INFO ] Deduced a trap composed of 26 places in 230 ms of which 1 ms to minimize.
[2021-05-14 20:19:56] [INFO ] Deduced a trap composed of 32 places in 238 ms of which 1 ms to minimize.
[2021-05-14 20:19:56] [INFO ] Deduced a trap composed of 32 places in 236 ms of which 1 ms to minimize.
[2021-05-14 20:19:57] [INFO ] Deduced a trap composed of 29 places in 235 ms of which 1 ms to minimize.
[2021-05-14 20:19:57] [INFO ] Deduced a trap composed of 32 places in 242 ms of which 0 ms to minimize.
[2021-05-14 20:19:57] [INFO ] Deduced a trap composed of 71 places in 219 ms of which 1 ms to minimize.
[2021-05-14 20:19:57] [INFO ] Deduced a trap composed of 37 places in 229 ms of which 1 ms to minimize.
[2021-05-14 20:19:58] [INFO ] Deduced a trap composed of 40 places in 229 ms of which 0 ms to minimize.
[2021-05-14 20:19:58] [INFO ] Deduced a trap composed of 40 places in 244 ms of which 0 ms to minimize.
[2021-05-14 20:19:58] [INFO ] Deduced a trap composed of 40 places in 245 ms of which 1 ms to minimize.
[2021-05-14 20:19:59] [INFO ] Deduced a trap composed of 40 places in 238 ms of which 0 ms to minimize.
[2021-05-14 20:19:59] [INFO ] Deduced a trap composed of 74 places in 259 ms of which 1 ms to minimize.
[2021-05-14 20:19:59] [INFO ] Deduced a trap composed of 47 places in 220 ms of which 0 ms to minimize.
[2021-05-14 20:19:59] [INFO ] Deduced a trap composed of 104 places in 173 ms of which 0 ms to minimize.
[2021-05-14 20:19:59] [INFO ] Deduced a trap composed of 79 places in 137 ms of which 0 ms to minimize.
[2021-05-14 20:20:00] [INFO ] Deduced a trap composed of 78 places in 144 ms of which 0 ms to minimize.
[2021-05-14 20:20:00] [INFO ] Deduced a trap composed of 76 places in 157 ms of which 1 ms to minimize.
[2021-05-14 20:20:00] [INFO ] Deduced a trap composed of 74 places in 154 ms of which 0 ms to minimize.
[2021-05-14 20:20:00] [INFO ] Deduced a trap composed of 132 places in 156 ms of which 0 ms to minimize.
[2021-05-14 20:20:01] [INFO ] Deduced a trap composed of 40 places in 225 ms of which 0 ms to minimize.
[2021-05-14 20:20:01] [INFO ] Deduced a trap composed of 102 places in 163 ms of which 1 ms to minimize.
[2021-05-14 20:20:01] [INFO ] Deduced a trap composed of 102 places in 165 ms of which 1 ms to minimize.
[2021-05-14 20:20:01] [INFO ] Deduced a trap composed of 67 places in 186 ms of which 0 ms to minimize.
[2021-05-14 20:20:02] [INFO ] Deduced a trap composed of 193 places in 156 ms of which 1 ms to minimize.
[2021-05-14 20:20:02] [INFO ] Deduced a trap composed of 67 places in 180 ms of which 1 ms to minimize.
[2021-05-14 20:20:02] [INFO ] Deduced a trap composed of 79 places in 193 ms of which 1 ms to minimize.
[2021-05-14 20:20:02] [INFO ] Deduced a trap composed of 79 places in 239 ms of which 1 ms to minimize.
[2021-05-14 20:20:03] [INFO ] Deduced a trap composed of 11 places in 208 ms of which 1 ms to minimize.
[2021-05-14 20:20:03] [INFO ] Deduced a trap composed of 67 places in 221 ms of which 0 ms to minimize.
[2021-05-14 20:20:03] [INFO ] Deduced a trap composed of 31 places in 286 ms of which 0 ms to minimize.
[2021-05-14 20:20:04] [INFO ] Deduced a trap composed of 39 places in 276 ms of which 0 ms to minimize.
[2021-05-14 20:20:04] [INFO ] Deduced a trap composed of 78 places in 176 ms of which 0 ms to minimize.
[2021-05-14 20:20:04] [INFO ] Deduced a trap composed of 78 places in 188 ms of which 1 ms to minimize.
[2021-05-14 20:20:04] [INFO ] Deduced a trap composed of 105 places in 197 ms of which 1 ms to minimize.
[2021-05-14 20:20:05] [INFO ] Deduced a trap composed of 104 places in 195 ms of which 1 ms to minimize.
[2021-05-14 20:20:05] [INFO ] Deduced a trap composed of 104 places in 172 ms of which 0 ms to minimize.
[2021-05-14 20:20:05] [INFO ] Deduced a trap composed of 72 places in 191 ms of which 1 ms to minimize.
[2021-05-14 20:20:05] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 10140 ms
[2021-05-14 20:20:05] [INFO ] Computed and/alt/rep : 1056/1992/1056 causal constraints (skipped 60 transitions) in 78 ms.
[2021-05-14 20:20:20] [INFO ] Deduced a trap composed of 103 places in 177 ms of which 1 ms to minimize.
[2021-05-14 20:20:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 542 ms
[2021-05-14 20:20:20] [INFO ] Added : 1032 causal constraints over 207 iterations in 15094 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 24 ms.
[2021-05-14 20:20:20] [INFO ] [Real]Absence check using 17 positive place invariants in 16 ms returned sat
[2021-05-14 20:20:20] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-14 20:20:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:20:21] [INFO ] [Real]Absence check using state equation in 250 ms returned sat
[2021-05-14 20:20:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:20:21] [INFO ] [Nat]Absence check using 17 positive place invariants in 17 ms returned sat
[2021-05-14 20:20:21] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2021-05-14 20:20:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:20:21] [INFO ] [Nat]Absence check using state equation in 288 ms returned sat
[2021-05-14 20:20:21] [INFO ] [Nat]Added 230 Read/Feed constraints in 50 ms returned sat
[2021-05-14 20:20:21] [INFO ] Deduced a trap composed of 139 places in 245 ms of which 2 ms to minimize.
[2021-05-14 20:20:22] [INFO ] Deduced a trap composed of 28 places in 230 ms of which 1 ms to minimize.
[2021-05-14 20:20:22] [INFO ] Deduced a trap composed of 30 places in 255 ms of which 2 ms to minimize.
[2021-05-14 20:20:22] [INFO ] Deduced a trap composed of 11 places in 229 ms of which 9 ms to minimize.
[2021-05-14 20:20:23] [INFO ] Deduced a trap composed of 133 places in 222 ms of which 8 ms to minimize.
[2021-05-14 20:20:23] [INFO ] Deduced a trap composed of 139 places in 227 ms of which 0 ms to minimize.
[2021-05-14 20:20:23] [INFO ] Deduced a trap composed of 139 places in 239 ms of which 1 ms to minimize.
[2021-05-14 20:20:23] [INFO ] Deduced a trap composed of 56 places in 227 ms of which 1 ms to minimize.
[2021-05-14 20:20:24] [INFO ] Deduced a trap composed of 136 places in 216 ms of which 0 ms to minimize.
[2021-05-14 20:20:24] [INFO ] Deduced a trap composed of 136 places in 214 ms of which 1 ms to minimize.
[2021-05-14 20:20:24] [INFO ] Deduced a trap composed of 136 places in 223 ms of which 1 ms to minimize.
[2021-05-14 20:20:24] [INFO ] Deduced a trap composed of 136 places in 213 ms of which 3 ms to minimize.
[2021-05-14 20:20:25] [INFO ] Deduced a trap composed of 102 places in 214 ms of which 0 ms to minimize.
[2021-05-14 20:20:25] [INFO ] Deduced a trap composed of 15 places in 234 ms of which 1 ms to minimize.
[2021-05-14 20:20:25] [INFO ] Deduced a trap composed of 15 places in 231 ms of which 1 ms to minimize.
[2021-05-14 20:20:25] [INFO ] Deduced a trap composed of 14 places in 231 ms of which 1 ms to minimize.
[2021-05-14 20:20:26] [INFO ] Deduced a trap composed of 125 places in 188 ms of which 0 ms to minimize.
[2021-05-14 20:20:26] [INFO ] Deduced a trap composed of 19 places in 214 ms of which 1 ms to minimize.
[2021-05-14 20:20:26] [INFO ] Deduced a trap composed of 18 places in 239 ms of which 0 ms to minimize.
[2021-05-14 20:20:26] [INFO ] Deduced a trap composed of 13 places in 239 ms of which 1 ms to minimize.
[2021-05-14 20:20:27] [INFO ] Deduced a trap composed of 56 places in 212 ms of which 0 ms to minimize.
[2021-05-14 20:20:27] [INFO ] Deduced a trap composed of 51 places in 211 ms of which 0 ms to minimize.
[2021-05-14 20:20:27] [INFO ] Deduced a trap composed of 53 places in 222 ms of which 1 ms to minimize.
[2021-05-14 20:20:27] [INFO ] Deduced a trap composed of 53 places in 210 ms of which 1 ms to minimize.
[2021-05-14 20:20:28] [INFO ] Deduced a trap composed of 84 places in 174 ms of which 1 ms to minimize.
[2021-05-14 20:20:28] [INFO ] Deduced a trap composed of 96 places in 123 ms of which 1 ms to minimize.
[2021-05-14 20:20:28] [INFO ] Deduced a trap composed of 108 places in 123 ms of which 1 ms to minimize.
[2021-05-14 20:20:28] [INFO ] Deduced a trap composed of 108 places in 125 ms of which 0 ms to minimize.
[2021-05-14 20:20:28] [INFO ] Deduced a trap composed of 97 places in 124 ms of which 1 ms to minimize.
[2021-05-14 20:20:28] [INFO ] Deduced a trap composed of 108 places in 125 ms of which 0 ms to minimize.
[2021-05-14 20:20:29] [INFO ] Deduced a trap composed of 84 places in 176 ms of which 1 ms to minimize.
[2021-05-14 20:20:29] [INFO ] Deduced a trap composed of 32 places in 299 ms of which 1 ms to minimize.
[2021-05-14 20:20:29] [INFO ] Deduced a trap composed of 61 places in 303 ms of which 1 ms to minimize.
[2021-05-14 20:20:30] [INFO ] Deduced a trap composed of 32 places in 297 ms of which 1 ms to minimize.
[2021-05-14 20:20:30] [INFO ] Deduced a trap composed of 11 places in 313 ms of which 1 ms to minimize.
[2021-05-14 20:20:30] [INFO ] Deduced a trap composed of 111 places in 259 ms of which 1 ms to minimize.
[2021-05-14 20:20:31] [INFO ] Deduced a trap composed of 39 places in 296 ms of which 1 ms to minimize.
[2021-05-14 20:20:31] [INFO ] Deduced a trap composed of 71 places in 234 ms of which 1 ms to minimize.
[2021-05-14 20:20:31] [INFO ] Deduced a trap composed of 89 places in 227 ms of which 0 ms to minimize.
[2021-05-14 20:20:32] [INFO ] Deduced a trap composed of 66 places in 229 ms of which 0 ms to minimize.
[2021-05-14 20:20:32] [INFO ] Deduced a trap composed of 128 places in 190 ms of which 1 ms to minimize.
[2021-05-14 20:20:32] [INFO ] Deduced a trap composed of 100 places in 194 ms of which 0 ms to minimize.
[2021-05-14 20:20:32] [INFO ] Deduced a trap composed of 93 places in 191 ms of which 0 ms to minimize.
[2021-05-14 20:20:33] [INFO ] Deduced a trap composed of 93 places in 199 ms of which 1 ms to minimize.
[2021-05-14 20:20:33] [INFO ] Deduced a trap composed of 93 places in 200 ms of which 0 ms to minimize.
[2021-05-14 20:20:33] [INFO ] Deduced a trap composed of 93 places in 192 ms of which 1 ms to minimize.
[2021-05-14 20:20:33] [INFO ] Deduced a trap composed of 126 places in 142 ms of which 1 ms to minimize.
[2021-05-14 20:20:33] [INFO ] Deduced a trap composed of 126 places in 149 ms of which 0 ms to minimize.
[2021-05-14 20:20:34] [INFO ] Deduced a trap composed of 127 places in 145 ms of which 1 ms to minimize.
[2021-05-14 20:20:34] [INFO ] Trap strengthening (SAT) tested/added 50/49 trap constraints in 12423 ms
[2021-05-14 20:20:34] [INFO ] Computed and/alt/rep : 1056/1992/1056 causal constraints (skipped 60 transitions) in 71 ms.
[2021-05-14 20:20:46] [INFO ] Deduced a trap composed of 127 places in 152 ms of which 1 ms to minimize.
[2021-05-14 20:20:46] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 1 ms to minimize.
[2021-05-14 20:20:46] [INFO ] Deduced a trap composed of 74 places in 103 ms of which 0 ms to minimize.
[2021-05-14 20:20:46] [INFO ] Deduced a trap composed of 101 places in 124 ms of which 0 ms to minimize.
[2021-05-14 20:20:47] [INFO ] Deduced a trap composed of 101 places in 120 ms of which 0 ms to minimize.
[2021-05-14 20:20:47] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1019 ms
[2021-05-14 20:20:47] [INFO ] Added : 923 causal constraints over 186 iterations in 13185 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 20 ms.
Fused 4 Parikh solutions to 3 different solutions.
Incomplete Parikh walk after 528500 steps, including 1000 resets, run finished after 2235 ms. (steps per millisecond=236 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 285300 steps, including 1000 resets, run finished after 1191 ms. (steps per millisecond=239 ) properties (out of 4) seen :0 could not realise parikh vector
Support contains 608 out of 834 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 43 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 834/834 places, 1242/1242 transitions.
[2021-05-14 20:20:50] [INFO ] Flatten gal took : 61 ms
[2021-05-14 20:20:50] [INFO ] Flatten gal took : 37 ms
[2021-05-14 20:20:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15980986439070289882.gal : 4 ms
[2021-05-14 20:20:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10256391595588701064.prop : 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality15980986439070289882.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality10256391595588701064.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality15980986439070289882.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality10256391595588701064.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality10256391595588701064.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 9
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :9 after 11
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :11 after 12
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :12 after 15
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :15 after 16
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :16 after 21
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :21 after 76
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :76 after 180
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :180 after 874
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :874 after 2322
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :2322 after 6567
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :6567 after 24400
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :24400 after 84464
SDD proceeding with computation,4 properties remain. new max is 65536
SDD size :84464 after 302742
Detected timeout of ITS tools.
[2021-05-14 20:21:06] [INFO ] Flatten gal took : 69 ms
[2021-05-14 20:21:06] [INFO ] Applying decomposition
[2021-05-14 20:21:06] [INFO ] Flatten gal took : 35 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/graph13500909222072722989.txt, -o, /tmp/graph13500909222072722989.bin, -w, /tmp/graph13500909222072722989.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/graph13500909222072722989.bin, -l, -1, -v, -w, /tmp/graph13500909222072722989.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 20:21:06] [INFO ] Decomposing Gal with order
[2021-05-14 20:21:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 20:21:06] [INFO ] Removed a total of 186 redundant transitions.
[2021-05-14 20:21:06] [INFO ] Flatten gal took : 449 ms
[2021-05-14 20:21:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 180 labels/synchronizations in 21 ms.
[2021-05-14 20:21:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1649667779472018741.gal : 6 ms
[2021-05-14 20:21:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7388750031934697357.prop : 103 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality1649667779472018741.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality7388750031934697357.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality1649667779472018741.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality7388750031934697357.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality7388750031934697357.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :4 after 13
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :13 after 14
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :14 after 15
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :15 after 16
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :16 after 19
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :19 after 52
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :52 after 170
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :170 after 925
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :925 after 1534
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :1534 after 2985
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :2985 after 8365
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :8365 after 29344
SDD proceeding with computation,4 properties remain. new max is 65536
SDD size :29344 after 88350
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16053098456917537950
[2021-05-14 20:21:22] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16053098456917537950
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/ltsmin16053098456917537950]
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/ltsmin16053098456917537950] 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/ltsmin16053098456917537950] 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)
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4479 ms. (steps per millisecond=223 ) properties (out of 4) seen :0
Interrupted Best-First random walk after 657819 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=131 ) properties seen :{}
Interrupted Best-First random walk after 489112 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=97 ) properties seen :{}
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1127 ms. (steps per millisecond=887 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 979 ms. (steps per millisecond=1021 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 5168660 steps, run timeout after 30001 ms. (steps per millisecond=172 ) properties seen :{}
Probabilistic random walk after 5168660 steps, saw 967122 distinct states, run finished after 30001 ms. (steps per millisecond=172 ) properties seen :{}
Running SMT prover for 4 properties.
[2021-05-14 20:22:09] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2021-05-14 20:22:09] [INFO ] Computed 23 place invariants in 5 ms
[2021-05-14 20:22:10] [INFO ] [Real]Absence check using 17 positive place invariants in 17 ms returned sat
[2021-05-14 20:22:10] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-14 20:22:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:22:10] [INFO ] [Real]Absence check using state equation in 289 ms returned sat
[2021-05-14 20:22:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:22:13] [INFO ] [Real]Absence check using 17 positive place invariants in 17 ms returned sat
[2021-05-14 20:22:13] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-14 20:22:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:22:13] [INFO ] [Real]Absence check using state equation in 252 ms returned sat
[2021-05-14 20:22:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:22:17] [INFO ] [Nat]Absence check using 17 positive place invariants in 17 ms returned sat
[2021-05-14 20:22:17] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-14 20:22:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:22:17] [INFO ] [Nat]Absence check using state equation in 279 ms returned sat
[2021-05-14 20:22:17] [INFO ] State equation strengthened by 230 read => feed constraints.
[2021-05-14 20:22:17] [INFO ] [Nat]Added 230 Read/Feed constraints in 47 ms returned sat
[2021-05-14 20:22:17] [INFO ] Deduced a trap composed of 11 places in 168 ms of which 1 ms to minimize.
[2021-05-14 20:22:17] [INFO ] Deduced a trap composed of 11 places in 181 ms of which 0 ms to minimize.
[2021-05-14 20:22:18] [INFO ] Deduced a trap composed of 11 places in 174 ms of which 0 ms to minimize.
[2021-05-14 20:22:18] [INFO ] Deduced a trap composed of 11 places in 194 ms of which 0 ms to minimize.
[2021-05-14 20:22:18] [INFO ] Deduced a trap composed of 11 places in 186 ms of which 0 ms to minimize.
[2021-05-14 20:22:18] [INFO ] Deduced a trap composed of 79 places in 164 ms of which 1 ms to minimize.
[2021-05-14 20:22:18] [INFO ] Deduced a trap composed of 67 places in 179 ms of which 0 ms to minimize.
[2021-05-14 20:22:19] [INFO ] Deduced a trap composed of 63 places in 164 ms of which 1 ms to minimize.
[2021-05-14 20:22:19] [INFO ] Deduced a trap composed of 63 places in 167 ms of which 0 ms to minimize.
[2021-05-14 20:22:19] [INFO ] Deduced a trap composed of 65 places in 182 ms of which 1 ms to minimize.
[2021-05-14 20:22:19] [INFO ] Deduced a trap composed of 65 places in 171 ms of which 1 ms to minimize.
[2021-05-14 20:22:19] [INFO ] Deduced a trap composed of 65 places in 172 ms of which 0 ms to minimize.
[2021-05-14 20:22:20] [INFO ] Deduced a trap composed of 65 places in 160 ms of which 0 ms to minimize.
[2021-05-14 20:22:20] [INFO ] Deduced a trap composed of 65 places in 172 ms of which 0 ms to minimize.
[2021-05-14 20:22:20] [INFO ] Deduced a trap composed of 89 places in 210 ms of which 1 ms to minimize.
[2021-05-14 20:22:20] [INFO ] Deduced a trap composed of 89 places in 213 ms of which 1 ms to minimize.
[2021-05-14 20:22:21] [INFO ] Deduced a trap composed of 89 places in 196 ms of which 1 ms to minimize.
[2021-05-14 20:22:21] [INFO ] Deduced a trap composed of 89 places in 215 ms of which 1 ms to minimize.
[2021-05-14 20:22:21] [INFO ] Deduced a trap composed of 89 places in 239 ms of which 1 ms to minimize.
[2021-05-14 20:22:21] [INFO ] Deduced a trap composed of 89 places in 193 ms of which 0 ms to minimize.
[2021-05-14 20:22:22] [INFO ] Deduced a trap composed of 117 places in 193 ms of which 0 ms to minimize.
[2021-05-14 20:22:22] [INFO ] Deduced a trap composed of 75 places in 192 ms of which 1 ms to minimize.
[2021-05-14 20:22:22] [INFO ] Deduced a trap composed of 74 places in 201 ms of which 0 ms to minimize.
[2021-05-14 20:22:23] [INFO ] Deduced a trap composed of 14 places in 273 ms of which 1 ms to minimize.
[2021-05-14 20:22:23] [INFO ] Deduced a trap composed of 109 places in 263 ms of which 0 ms to minimize.
[2021-05-14 20:22:23] [INFO ] Deduced a trap composed of 59 places in 258 ms of which 1 ms to minimize.
[2021-05-14 20:22:23] [INFO ] Deduced a trap composed of 108 places in 224 ms of which 1 ms to minimize.
[2021-05-14 20:22:24] [INFO ] Deduced a trap composed of 58 places in 226 ms of which 0 ms to minimize.
[2021-05-14 20:22:24] [INFO ] Deduced a trap composed of 93 places in 179 ms of which 1 ms to minimize.
[2021-05-14 20:22:24] [INFO ] Deduced a trap composed of 122 places in 182 ms of which 0 ms to minimize.
[2021-05-14 20:22:24] [INFO ] Deduced a trap composed of 61 places in 180 ms of which 0 ms to minimize.
[2021-05-14 20:22:25] [INFO ] Deduced a trap composed of 63 places in 193 ms of which 1 ms to minimize.
[2021-05-14 20:22:25] [INFO ] Deduced a trap composed of 117 places in 200 ms of which 1 ms to minimize.
[2021-05-14 20:22:25] [INFO ] Deduced a trap composed of 132 places in 213 ms of which 0 ms to minimize.
[2021-05-14 20:22:26] [INFO ] Deduced a trap composed of 39 places in 205 ms of which 0 ms to minimize.
[2021-05-14 20:22:26] [INFO ] Deduced a trap composed of 85 places in 247 ms of which 0 ms to minimize.
[2021-05-14 20:22:26] [INFO ] Deduced a trap composed of 55 places in 249 ms of which 1 ms to minimize.
[2021-05-14 20:22:26] [INFO ] Deduced a trap composed of 130 places in 264 ms of which 0 ms to minimize.
[2021-05-14 20:22:27] [INFO ] Deduced a trap composed of 104 places in 260 ms of which 1 ms to minimize.
[2021-05-14 20:22:27] [INFO ] Deduced a trap composed of 115 places in 233 ms of which 0 ms to minimize.
[2021-05-14 20:22:28] [INFO ] Deduced a trap composed of 37 places in 272 ms of which 1 ms to minimize.
[2021-05-14 20:22:28] [INFO ] Deduced a trap composed of 37 places in 239 ms of which 0 ms to minimize.
[2021-05-14 20:22:28] [INFO ] Deduced a trap composed of 37 places in 268 ms of which 1 ms to minimize.
[2021-05-14 20:22:28] [INFO ] Deduced a trap composed of 37 places in 246 ms of which 0 ms to minimize.
[2021-05-14 20:22:29] [INFO ] Deduced a trap composed of 37 places in 258 ms of which 0 ms to minimize.
[2021-05-14 20:22:29] [INFO ] Deduced a trap composed of 43 places in 283 ms of which 1 ms to minimize.
[2021-05-14 20:22:30] [INFO ] Deduced a trap composed of 28 places in 287 ms of which 1 ms to minimize.
[2021-05-14 20:22:30] [INFO ] Deduced a trap composed of 43 places in 302 ms of which 0 ms to minimize.
[2021-05-14 20:22:30] [INFO ] Deduced a trap composed of 43 places in 267 ms of which 1 ms to minimize.
[2021-05-14 20:22:31] [INFO ] Deduced a trap composed of 51 places in 263 ms of which 1 ms to minimize.
[2021-05-14 20:22:31] [INFO ] Deduced a trap composed of 117 places in 286 ms of which 1 ms to minimize.
[2021-05-14 20:22:32] [INFO ] Deduced a trap composed of 46 places in 196 ms of which 1 ms to minimize.
[2021-05-14 20:22:32] [INFO ] Deduced a trap composed of 67 places in 217 ms of which 1 ms to minimize.
[2021-05-14 20:22:33] [INFO ] Deduced a trap composed of 90 places in 204 ms of which 1 ms to minimize.
[2021-05-14 20:22:33] [INFO ] Deduced a trap composed of 79 places in 196 ms of which 1 ms to minimize.
[2021-05-14 20:22:33] [INFO ] Deduced a trap composed of 79 places in 184 ms of which 0 ms to minimize.
[2021-05-14 20:22:33] [INFO ] Deduced a trap composed of 66 places in 196 ms of which 1 ms to minimize.
[2021-05-14 20:22:34] [INFO ] Deduced a trap composed of 124 places in 205 ms of which 1 ms to minimize.
[2021-05-14 20:22:34] [INFO ] Deduced a trap composed of 82 places in 205 ms of which 1 ms to minimize.
[2021-05-14 20:22:34] [INFO ] Deduced a trap composed of 56 places in 248 ms of which 0 ms to minimize.
[2021-05-14 20:22:35] [INFO ] Deduced a trap composed of 75 places in 231 ms of which 0 ms to minimize.
[2021-05-14 20:22:35] [INFO ] Deduced a trap composed of 104 places in 184 ms of which 0 ms to minimize.
[2021-05-14 20:22:35] [INFO ] Deduced a trap composed of 104 places in 182 ms of which 1 ms to minimize.
[2021-05-14 20:22:35] [INFO ] Deduced a trap composed of 104 places in 186 ms of which 0 ms to minimize.
[2021-05-14 20:22:36] [INFO ] Deduced a trap composed of 134 places in 204 ms of which 1 ms to minimize.
[2021-05-14 20:22:36] [INFO ] Deduced a trap composed of 188 places in 186 ms of which 1 ms to minimize.
[2021-05-14 20:22:36] [INFO ] Deduced a trap composed of 105 places in 185 ms of which 0 ms to minimize.
[2021-05-14 20:22:37] [INFO ] Deduced a trap composed of 130 places in 183 ms of which 0 ms to minimize.
[2021-05-14 20:22:37] [INFO ] Deduced a trap composed of 127 places in 189 ms of which 0 ms to minimize.
[2021-05-14 20:22:37] [INFO ] Deduced a trap composed of 98 places in 182 ms of which 1 ms to minimize.
[2021-05-14 20:22:38] [INFO ] Deduced a trap composed of 93 places in 168 ms of which 0 ms to minimize.
[2021-05-14 20:22:38] [INFO ] Deduced a trap composed of 18 places in 255 ms of which 1 ms to minimize.
[2021-05-14 20:22:38] [INFO ] Deduced a trap composed of 136 places in 214 ms of which 1 ms to minimize.
[2021-05-14 20:22:40] [INFO ] Deduced a trap composed of 53 places in 235 ms of which 1 ms to minimize.
[2021-05-14 20:22:40] [INFO ] Deduced a trap composed of 56 places in 258 ms of which 1 ms to minimize.
[2021-05-14 20:22:40] [INFO ] Deduced a trap composed of 56 places in 253 ms of which 1 ms to minimize.
[2021-05-14 20:22:41] [INFO ] Deduced a trap composed of 15 places in 259 ms of which 0 ms to minimize.
[2021-05-14 20:22:41] [INFO ] Deduced a trap composed of 56 places in 233 ms of which 1 ms to minimize.
[2021-05-14 20:22:52] [INFO ] Deduced a trap composed of 127 places in 173 ms of which 0 ms to minimize.
[2021-05-14 20:22:52] [INFO ] Deduced a trap composed of 138 places in 188 ms of which 0 ms to minimize.
[2021-05-14 20:22:52] [INFO ] Deduced a trap composed of 149 places in 179 ms of which 0 ms to minimize.
[2021-05-14 20:22:53] [INFO ] Deduced a trap composed of 97 places in 191 ms of which 1 ms to minimize.
[2021-05-14 20:22:53] [INFO ] Deduced a trap composed of 137 places in 194 ms of which 1 ms to minimize.
[2021-05-14 20:22:54] [INFO ] Deduced a trap composed of 43 places in 175 ms of which 1 ms to minimize.
[2021-05-14 20:22:56] [INFO ] Deduced a trap composed of 107 places in 220 ms of which 0 ms to minimize.
[2021-05-14 20:22:56] [INFO ] Deduced a trap composed of 41 places in 233 ms of which 0 ms to minimize.
[2021-05-14 20:22:57] [INFO ] Deduced a trap composed of 91 places in 279 ms of which 1 ms to minimize.
[2021-05-14 20:22:57] [INFO ] Deduced a trap composed of 48 places in 215 ms of which 1 ms to minimize.
[2021-05-14 20:22:57] [INFO ] Deduced a trap composed of 93 places in 196 ms of which 0 ms to minimize.
[2021-05-14 20:22:58] [INFO ] Deduced a trap composed of 173 places in 187 ms of which 1 ms to minimize.
[2021-05-14 20:22:58] [INFO ] Deduced a trap composed of 126 places in 200 ms of which 1 ms to minimize.
[2021-05-14 20:22:58] [INFO ] Deduced a trap composed of 126 places in 203 ms of which 1 ms to minimize.
[2021-05-14 20:22:58] [INFO ] Deduced a trap composed of 134 places in 186 ms of which 1 ms to minimize.
[2021-05-14 20:22:59] [INFO ] Deduced a trap composed of 2 places in 344 ms of which 1 ms to minimize.
[2021-05-14 20:22:59] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
[2021-05-14 20:22:59] [INFO ] [Real]Absence check using 17 positive place invariants in 17 ms returned sat
[2021-05-14 20:22:59] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-14 20:22:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:22:59] [INFO ] [Real]Absence check using state equation in 412 ms returned sat
[2021-05-14 20:22:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:23:06] [INFO ] [Nat]Absence check using 17 positive place invariants in 20 ms returned sat
[2021-05-14 20:23:06] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-14 20:23:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:23:06] [INFO ] [Nat]Absence check using state equation in 413 ms returned sat
[2021-05-14 20:23:06] [INFO ] [Nat]Added 230 Read/Feed constraints in 58 ms returned sat
[2021-05-14 20:23:06] [INFO ] Deduced a trap composed of 32 places in 228 ms of which 0 ms to minimize.
[2021-05-14 20:23:07] [INFO ] Deduced a trap composed of 18 places in 246 ms of which 1 ms to minimize.
[2021-05-14 20:23:07] [INFO ] Deduced a trap composed of 26 places in 239 ms of which 0 ms to minimize.
[2021-05-14 20:23:07] [INFO ] Deduced a trap composed of 32 places in 262 ms of which 1 ms to minimize.
[2021-05-14 20:23:07] [INFO ] Deduced a trap composed of 32 places in 261 ms of which 1 ms to minimize.
[2021-05-14 20:23:08] [INFO ] Deduced a trap composed of 29 places in 253 ms of which 1 ms to minimize.
[2021-05-14 20:23:08] [INFO ] Deduced a trap composed of 32 places in 250 ms of which 1 ms to minimize.
[2021-05-14 20:23:08] [INFO ] Deduced a trap composed of 71 places in 240 ms of which 1 ms to minimize.
[2021-05-14 20:23:09] [INFO ] Deduced a trap composed of 37 places in 256 ms of which 0 ms to minimize.
[2021-05-14 20:23:09] [INFO ] Deduced a trap composed of 40 places in 258 ms of which 0 ms to minimize.
[2021-05-14 20:23:09] [INFO ] Deduced a trap composed of 40 places in 250 ms of which 0 ms to minimize.
[2021-05-14 20:23:09] [INFO ] Deduced a trap composed of 40 places in 252 ms of which 1 ms to minimize.
[2021-05-14 20:23:10] [INFO ] Deduced a trap composed of 40 places in 237 ms of which 0 ms to minimize.
[2021-05-14 20:23:10] [INFO ] Deduced a trap composed of 74 places in 257 ms of which 0 ms to minimize.
[2021-05-14 20:23:10] [INFO ] Deduced a trap composed of 47 places in 251 ms of which 1 ms to minimize.
[2021-05-14 20:23:11] [INFO ] Deduced a trap composed of 104 places in 211 ms of which 0 ms to minimize.
[2021-05-14 20:23:12] [INFO ] Deduced a trap composed of 79 places in 1381 ms of which 0 ms to minimize.
[2021-05-14 20:23:12] [INFO ] Deduced a trap composed of 78 places in 154 ms of which 2 ms to minimize.
[2021-05-14 20:23:12] [INFO ] Deduced a trap composed of 76 places in 143 ms of which 0 ms to minimize.
[2021-05-14 20:23:13] [INFO ] Deduced a trap composed of 74 places in 137 ms of which 1 ms to minimize.
[2021-05-14 20:23:13] [INFO ] Deduced a trap composed of 132 places in 138 ms of which 1 ms to minimize.
[2021-05-14 20:23:13] [INFO ] Deduced a trap composed of 40 places in 242 ms of which 1 ms to minimize.
[2021-05-14 20:23:13] [INFO ] Deduced a trap composed of 102 places in 166 ms of which 0 ms to minimize.
[2021-05-14 20:23:14] [INFO ] Deduced a trap composed of 102 places in 220 ms of which 1 ms to minimize.
[2021-05-14 20:23:14] [INFO ] Deduced a trap composed of 67 places in 170 ms of which 0 ms to minimize.
[2021-05-14 20:23:14] [INFO ] Deduced a trap composed of 193 places in 178 ms of which 0 ms to minimize.
[2021-05-14 20:23:14] [INFO ] Deduced a trap composed of 67 places in 183 ms of which 0 ms to minimize.
[2021-05-14 20:23:15] [INFO ] Deduced a trap composed of 79 places in 202 ms of which 0 ms to minimize.
[2021-05-14 20:23:15] [INFO ] Deduced a trap composed of 79 places in 227 ms of which 1 ms to minimize.
[2021-05-14 20:23:15] [INFO ] Deduced a trap composed of 11 places in 228 ms of which 1 ms to minimize.
[2021-05-14 20:23:15] [INFO ] Deduced a trap composed of 67 places in 187 ms of which 0 ms to minimize.
[2021-05-14 20:23:16] [INFO ] Deduced a trap composed of 31 places in 259 ms of which 1 ms to minimize.
[2021-05-14 20:23:16] [INFO ] Deduced a trap composed of 39 places in 265 ms of which 0 ms to minimize.
[2021-05-14 20:23:16] [INFO ] Deduced a trap composed of 78 places in 204 ms of which 0 ms to minimize.
[2021-05-14 20:23:17] [INFO ] Deduced a trap composed of 78 places in 188 ms of which 1 ms to minimize.
[2021-05-14 20:23:17] [INFO ] Deduced a trap composed of 105 places in 198 ms of which 1 ms to minimize.
[2021-05-14 20:23:17] [INFO ] Deduced a trap composed of 104 places in 198 ms of which 1 ms to minimize.
[2021-05-14 20:23:17] [INFO ] Deduced a trap composed of 104 places in 187 ms of which 0 ms to minimize.
[2021-05-14 20:23:18] [INFO ] Deduced a trap composed of 72 places in 181 ms of which 1 ms to minimize.
[2021-05-14 20:23:18] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 11649 ms
[2021-05-14 20:23:18] [INFO ] Computed and/alt/rep : 1056/1992/1056 causal constraints (skipped 60 transitions) in 58 ms.
[2021-05-14 20:23:34] [INFO ] Deduced a trap composed of 103 places in 184 ms of which 1 ms to minimize.
[2021-05-14 20:23:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 543 ms
[2021-05-14 20:23:35] [INFO ] Added : 1032 causal constraints over 207 iterations in 17204 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 23 ms.
[2021-05-14 20:23:35] [INFO ] [Real]Absence check using 17 positive place invariants in 16 ms returned sat
[2021-05-14 20:23:35] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2021-05-14 20:23:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:23:35] [INFO ] [Real]Absence check using state equation in 266 ms returned sat
[2021-05-14 20:23:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:23:35] [INFO ] [Nat]Absence check using 17 positive place invariants in 17 ms returned sat
[2021-05-14 20:23:35] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2021-05-14 20:23:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:23:36] [INFO ] [Nat]Absence check using state equation in 251 ms returned sat
[2021-05-14 20:23:36] [INFO ] [Nat]Added 230 Read/Feed constraints in 50 ms returned sat
[2021-05-14 20:23:36] [INFO ] Deduced a trap composed of 139 places in 243 ms of which 1 ms to minimize.
[2021-05-14 20:23:36] [INFO ] Deduced a trap composed of 28 places in 247 ms of which 1 ms to minimize.
[2021-05-14 20:23:37] [INFO ] Deduced a trap composed of 30 places in 242 ms of which 1 ms to minimize.
[2021-05-14 20:23:37] [INFO ] Deduced a trap composed of 11 places in 237 ms of which 0 ms to minimize.
[2021-05-14 20:23:37] [INFO ] Deduced a trap composed of 133 places in 226 ms of which 1 ms to minimize.
[2021-05-14 20:23:37] [INFO ] Deduced a trap composed of 139 places in 242 ms of which 1 ms to minimize.
[2021-05-14 20:23:38] [INFO ] Deduced a trap composed of 139 places in 252 ms of which 1 ms to minimize.
[2021-05-14 20:23:38] [INFO ] Deduced a trap composed of 56 places in 240 ms of which 0 ms to minimize.
[2021-05-14 20:23:38] [INFO ] Deduced a trap composed of 136 places in 213 ms of which 0 ms to minimize.
[2021-05-14 20:23:39] [INFO ] Deduced a trap composed of 136 places in 232 ms of which 1 ms to minimize.
[2021-05-14 20:23:39] [INFO ] Deduced a trap composed of 136 places in 224 ms of which 0 ms to minimize.
[2021-05-14 20:23:39] [INFO ] Deduced a trap composed of 136 places in 224 ms of which 0 ms to minimize.
[2021-05-14 20:23:39] [INFO ] Deduced a trap composed of 102 places in 213 ms of which 0 ms to minimize.
[2021-05-14 20:23:40] [INFO ] Deduced a trap composed of 15 places in 227 ms of which 0 ms to minimize.
[2021-05-14 20:23:40] [INFO ] Deduced a trap composed of 15 places in 225 ms of which 1 ms to minimize.
[2021-05-14 20:23:40] [INFO ] Deduced a trap composed of 14 places in 232 ms of which 0 ms to minimize.
[2021-05-14 20:23:40] [INFO ] Deduced a trap composed of 125 places in 187 ms of which 1 ms to minimize.
[2021-05-14 20:23:41] [INFO ] Deduced a trap composed of 19 places in 217 ms of which 0 ms to minimize.
[2021-05-14 20:23:41] [INFO ] Deduced a trap composed of 18 places in 244 ms of which 1 ms to minimize.
[2021-05-14 20:23:41] [INFO ] Deduced a trap composed of 13 places in 241 ms of which 1 ms to minimize.
[2021-05-14 20:23:41] [INFO ] Deduced a trap composed of 56 places in 215 ms of which 1 ms to minimize.
[2021-05-14 20:23:42] [INFO ] Deduced a trap composed of 51 places in 213 ms of which 1 ms to minimize.
[2021-05-14 20:23:42] [INFO ] Deduced a trap composed of 53 places in 214 ms of which 0 ms to minimize.
[2021-05-14 20:23:42] [INFO ] Deduced a trap composed of 53 places in 214 ms of which 0 ms to minimize.
[2021-05-14 20:23:42] [INFO ] Deduced a trap composed of 84 places in 178 ms of which 1 ms to minimize.
[2021-05-14 20:23:43] [INFO ] Deduced a trap composed of 96 places in 124 ms of which 0 ms to minimize.
[2021-05-14 20:23:43] [INFO ] Deduced a trap composed of 108 places in 131 ms of which 0 ms to minimize.
[2021-05-14 20:23:43] [INFO ] Deduced a trap composed of 108 places in 124 ms of which 0 ms to minimize.
[2021-05-14 20:23:43] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 0 ms to minimize.
[2021-05-14 20:23:43] [INFO ] Deduced a trap composed of 108 places in 123 ms of which 1 ms to minimize.
[2021-05-14 20:23:43] [INFO ] Deduced a trap composed of 84 places in 175 ms of which 0 ms to minimize.
[2021-05-14 20:23:44] [INFO ] Deduced a trap composed of 32 places in 297 ms of which 0 ms to minimize.
[2021-05-14 20:23:44] [INFO ] Deduced a trap composed of 61 places in 302 ms of which 1 ms to minimize.
[2021-05-14 20:23:57] [INFO ] Deduced a trap composed of 32 places in 13254 ms of which 1 ms to minimize.
[2021-05-14 20:23:58] [INFO ] Deduced a trap composed of 11 places in 313 ms of which 0 ms to minimize.
[2021-05-14 20:23:58] [INFO ] Deduced a trap composed of 111 places in 281 ms of which 1 ms to minimize.
[2021-05-14 20:23:58] [INFO ] Deduced a trap composed of 39 places in 293 ms of which 1 ms to minimize.
[2021-05-14 20:23:59] [INFO ] Deduced a trap composed of 71 places in 261 ms of which 1 ms to minimize.
[2021-05-14 20:23:59] [INFO ] Deduced a trap composed of 89 places in 242 ms of which 1 ms to minimize.
[2021-05-14 20:23:59] [INFO ] Deduced a trap composed of 66 places in 247 ms of which 1 ms to minimize.
[2021-05-14 20:24:00] [INFO ] Deduced a trap composed of 128 places in 193 ms of which 0 ms to minimize.
[2021-05-14 20:24:00] [INFO ] Deduced a trap composed of 100 places in 203 ms of which 0 ms to minimize.
[2021-05-14 20:24:00] [INFO ] Deduced a trap composed of 93 places in 212 ms of which 0 ms to minimize.
[2021-05-14 20:24:00] [INFO ] Deduced a trap composed of 93 places in 201 ms of which 1 ms to minimize.
[2021-05-14 20:24:01] [INFO ] Deduced a trap composed of 93 places in 191 ms of which 0 ms to minimize.
[2021-05-14 20:24:01] [INFO ] Deduced a trap composed of 93 places in 205 ms of which 1 ms to minimize.
[2021-05-14 20:24:01] [INFO ] Deduced a trap composed of 126 places in 147 ms of which 0 ms to minimize.
[2021-05-14 20:24:01] [INFO ] Deduced a trap composed of 126 places in 149 ms of which 0 ms to minimize.
[2021-05-14 20:24:01] [INFO ] Deduced a trap composed of 127 places in 153 ms of which 1 ms to minimize.
[2021-05-14 20:24:01] [INFO ] Trap strengthening (SAT) tested/added 50/49 trap constraints in 25628 ms
[2021-05-14 20:24:01] [INFO ] Computed and/alt/rep : 1056/1992/1056 causal constraints (skipped 60 transitions) in 71 ms.
[2021-05-14 20:24:23] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
Fused 4 Parikh solutions to 2 different solutions.
Incomplete Parikh walk after 528500 steps, including 1000 resets, run finished after 2200 ms. (steps per millisecond=240 ) properties (out of 4) seen :0 could not realise parikh vector
Support contains 608 out of 834 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 28 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 834/834 places, 1242/1242 transitions.
Starting structural reductions, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 24 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2021-05-14 20:24:26] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2021-05-14 20:24:26] [INFO ] Computed 23 place invariants in 5 ms
[2021-05-14 20:24:26] [INFO ] Implicit Places using invariants in 217 ms returned [785, 805, 806, 807, 808, 809]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 220 ms to find 6 implicit places.
[2021-05-14 20:24:26] [INFO ] Redundant transitions in 80 ms returned []
[2021-05-14 20:24:26] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 828 cols
[2021-05-14 20:24:26] [INFO ] Computed 17 place invariants in 5 ms
[2021-05-14 20:24:27] [INFO ] Dead Transitions using invariants and state equation in 653 ms returned []
Starting structural reductions, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 22 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2021-05-14 20:24:27] [INFO ] Redundant transitions in 17 ms returned []
[2021-05-14 20:24:27] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 828 cols
[2021-05-14 20:24:27] [INFO ] Computed 17 place invariants in 5 ms
[2021-05-14 20:24:27] [INFO ] Dead Transitions using invariants and state equation in 655 ms returned []
Finished structural reductions, in 2 iterations. Remains : 828/834 places, 1242/1242 transitions.
[2021-05-14 20:24:27] [INFO ] Flatten gal took : 34 ms
[2021-05-14 20:24:27] [INFO ] Flatten gal took : 34 ms
[2021-05-14 20:24:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14599324135552695176.gal : 4 ms
[2021-05-14 20:24:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13769987602691895942.prop : 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality14599324135552695176.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality13769987602691895942.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality14599324135552695176.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality13769987602691895942.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality13769987602691895942.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 10
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :10 after 11
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :11 after 12
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :12 after 15
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :15 after 16
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :16 after 21
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :21 after 76
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :76 after 180
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :180 after 613
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :613 after 2222
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :2222 after 5987
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :5987 after 23902
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :23902 after 80146
SDD proceeding with computation,4 properties remain. new max is 65536
SDD size :80146 after 285998
Detected timeout of ITS tools.
[2021-05-14 20:24:47] [INFO ] Flatten gal took : 34 ms
[2021-05-14 20:24:47] [INFO ] Applying decomposition
[2021-05-14 20:24:47] [INFO ] Flatten gal took : 33 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/graph6381942336301488488.txt, -o, /tmp/graph6381942336301488488.bin, -w, /tmp/graph6381942336301488488.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/graph6381942336301488488.bin, -l, -1, -v, -w, /tmp/graph6381942336301488488.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 20:24:47] [INFO ] Decomposing Gal with order
[2021-05-14 20:24:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 20:24:48] [INFO ] Removed a total of 402 redundant transitions.
[2021-05-14 20:24:48] [INFO ] Flatten gal took : 464 ms
[2021-05-14 20:24:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 390 labels/synchronizations in 35 ms.
[2021-05-14 20:24:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4682865224717802247.gal : 8 ms
[2021-05-14 20:24:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6731391927482247645.prop : 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality4682865224717802247.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality6731391927482247645.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality4682865224717802247.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality6731391927482247645.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality6731391927482247645.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :4 after 11
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :11 after 12
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :12 after 13
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :13 after 15
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :15 after 20
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :20 after 55
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :55 after 163
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :163 after 867
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :867 after 2753
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :2753 after 6373
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :6373 after 36934
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :36934 after 129339
SDD proceeding with computation,4 properties remain. new max is 65536
SDD size :129339 after 288990
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16247720167849760832
[2021-05-14 20:25:03] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16247720167849760832
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/ltsmin16247720167849760832]
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/ltsmin16247720167849760832] 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/ltsmin16247720167849760832] 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)
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4191 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Interrupted Best-First random walk after 654242 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=130 ) properties seen :{}
Interrupted Best-First random walk after 492227 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=98 ) properties seen :{}
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1128 ms. (steps per millisecond=886 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 978 ms. (steps per millisecond=1022 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 5088188 steps, run timeout after 30001 ms. (steps per millisecond=169 ) properties seen :{}
Probabilistic random walk after 5088188 steps, saw 957131 distinct states, run finished after 30001 ms. (steps per millisecond=169 ) properties seen :{}
Running SMT prover for 4 properties.
[2021-05-14 20:25:50] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 828 cols
[2021-05-14 20:25:50] [INFO ] Computed 17 place invariants in 3 ms
[2021-05-14 20:25:50] [INFO ] [Real]Absence check using 17 positive place invariants in 17 ms returned sat
[2021-05-14 20:25:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:25:51] [INFO ] [Real]Absence check using state equation in 323 ms returned sat
[2021-05-14 20:25:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:25:54] [INFO ] [Real]Absence check using 17 positive place invariants in 15 ms returned sat
[2021-05-14 20:25:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:25:55] [INFO ] [Real]Absence check using state equation in 270 ms returned sat
[2021-05-14 20:25:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:25:57] [INFO ] [Nat]Absence check using 17 positive place invariants in 16 ms returned sat
[2021-05-14 20:25:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:25:58] [INFO ] [Nat]Absence check using state equation in 289 ms returned sat
[2021-05-14 20:25:58] [INFO ] State equation strengthened by 230 read => feed constraints.
[2021-05-14 20:25:58] [INFO ] [Nat]Added 230 Read/Feed constraints in 56 ms returned sat
[2021-05-14 20:25:58] [INFO ] Deduced a trap composed of 11 places in 268 ms of which 0 ms to minimize.
[2021-05-14 20:25:58] [INFO ] Deduced a trap composed of 15 places in 257 ms of which 1 ms to minimize.
[2021-05-14 20:25:59] [INFO ] Deduced a trap composed of 15 places in 281 ms of which 1 ms to minimize.
[2021-05-14 20:25:59] [INFO ] Deduced a trap composed of 15 places in 268 ms of which 0 ms to minimize.
[2021-05-14 20:25:59] [INFO ] Deduced a trap composed of 15 places in 278 ms of which 1 ms to minimize.
[2021-05-14 20:26:00] [INFO ] Deduced a trap composed of 48 places in 239 ms of which 1 ms to minimize.
[2021-05-14 20:26:00] [INFO ] Deduced a trap composed of 45 places in 239 ms of which 1 ms to minimize.
[2021-05-14 20:26:00] [INFO ] Deduced a trap composed of 48 places in 242 ms of which 1 ms to minimize.
[2021-05-14 20:26:00] [INFO ] Deduced a trap composed of 127 places in 240 ms of which 1 ms to minimize.
[2021-05-14 20:26:01] [INFO ] Deduced a trap composed of 123 places in 253 ms of which 1 ms to minimize.
[2021-05-14 20:26:01] [INFO ] Deduced a trap composed of 113 places in 257 ms of which 0 ms to minimize.
[2021-05-14 20:26:01] [INFO ] Deduced a trap composed of 51 places in 256 ms of which 1 ms to minimize.
[2021-05-14 20:26:02] [INFO ] Deduced a trap composed of 32 places in 260 ms of which 1 ms to minimize.
[2021-05-14 20:26:02] [INFO ] Deduced a trap composed of 45 places in 263 ms of which 1 ms to minimize.
[2021-05-14 20:26:02] [INFO ] Deduced a trap composed of 11 places in 260 ms of which 1 ms to minimize.
[2021-05-14 20:26:02] [INFO ] Deduced a trap composed of 115 places in 220 ms of which 0 ms to minimize.
[2021-05-14 20:26:03] [INFO ] Deduced a trap composed of 89 places in 220 ms of which 1 ms to minimize.
[2021-05-14 20:26:03] [INFO ] Deduced a trap composed of 51 places in 222 ms of which 1 ms to minimize.
[2021-05-14 20:26:03] [INFO ] Deduced a trap composed of 51 places in 223 ms of which 1 ms to minimize.
[2021-05-14 20:26:03] [INFO ] Deduced a trap composed of 51 places in 221 ms of which 0 ms to minimize.
[2021-05-14 20:26:04] [INFO ] Deduced a trap composed of 51 places in 209 ms of which 0 ms to minimize.
[2021-05-14 20:26:04] [INFO ] Deduced a trap composed of 40 places in 257 ms of which 1 ms to minimize.
[2021-05-14 20:26:04] [INFO ] Deduced a trap composed of 40 places in 274 ms of which 1 ms to minimize.
[2021-05-14 20:26:05] [INFO ] Deduced a trap composed of 40 places in 265 ms of which 1 ms to minimize.
[2021-05-14 20:26:05] [INFO ] Deduced a trap composed of 60 places in 267 ms of which 0 ms to minimize.
[2021-05-14 20:26:05] [INFO ] Deduced a trap composed of 100 places in 250 ms of which 0 ms to minimize.
[2021-05-14 20:26:06] [INFO ] Deduced a trap composed of 48 places in 252 ms of which 1 ms to minimize.
[2021-05-14 20:26:06] [INFO ] Deduced a trap composed of 67 places in 289 ms of which 17 ms to minimize.
[2021-05-14 20:26:06] [INFO ] Deduced a trap composed of 26 places in 257 ms of which 0 ms to minimize.
[2021-05-14 20:26:07] [INFO ] Deduced a trap composed of 104 places in 253 ms of which 1 ms to minimize.
[2021-05-14 20:26:07] [INFO ] Deduced a trap composed of 104 places in 252 ms of which 1 ms to minimize.
[2021-05-14 20:26:07] [INFO ] Deduced a trap composed of 78 places in 254 ms of which 1 ms to minimize.
[2021-05-14 20:26:07] [INFO ] Deduced a trap composed of 105 places in 257 ms of which 1 ms to minimize.
[2021-05-14 20:26:08] [INFO ] Deduced a trap composed of 67 places in 254 ms of which 1 ms to minimize.
[2021-05-14 20:26:08] [INFO ] Deduced a trap composed of 93 places in 253 ms of which 0 ms to minimize.
[2021-05-14 20:26:08] [INFO ] Deduced a trap composed of 119 places in 252 ms of which 1 ms to minimize.
[2021-05-14 20:26:09] [INFO ] Deduced a trap composed of 78 places in 252 ms of which 0 ms to minimize.
[2021-05-14 20:26:09] [INFO ] Deduced a trap composed of 52 places in 252 ms of which 0 ms to minimize.
[2021-05-14 20:26:09] [INFO ] Deduced a trap composed of 43 places in 234 ms of which 1 ms to minimize.
[2021-05-14 20:26:09] [INFO ] Deduced a trap composed of 67 places in 205 ms of which 1 ms to minimize.
[2021-05-14 20:26:10] [INFO ] Deduced a trap composed of 26 places in 261 ms of which 1 ms to minimize.
[2021-05-14 20:26:10] [INFO ] Deduced a trap composed of 86 places in 244 ms of which 1 ms to minimize.
[2021-05-14 20:26:10] [INFO ] Deduced a trap composed of 55 places in 244 ms of which 0 ms to minimize.
[2021-05-14 20:26:11] [INFO ] Deduced a trap composed of 134 places in 239 ms of which 1 ms to minimize.
[2021-05-14 20:26:11] [INFO ] Deduced a trap composed of 119 places in 235 ms of which 1 ms to minimize.
[2021-05-14 20:26:11] [INFO ] Deduced a trap composed of 37 places in 227 ms of which 0 ms to minimize.
[2021-05-14 20:26:11] [INFO ] Deduced a trap composed of 134 places in 184 ms of which 0 ms to minimize.
[2021-05-14 20:26:12] [INFO ] Deduced a trap composed of 134 places in 182 ms of which 1 ms to minimize.
[2021-05-14 20:26:12] [INFO ] Deduced a trap composed of 86 places in 220 ms of which 1 ms to minimize.
[2021-05-14 20:26:12] [INFO ] Deduced a trap composed of 85 places in 230 ms of which 1 ms to minimize.
[2021-05-14 20:26:12] [INFO ] Deduced a trap composed of 66 places in 217 ms of which 0 ms to minimize.
[2021-05-14 20:26:13] [INFO ] Deduced a trap composed of 74 places in 216 ms of which 0 ms to minimize.
[2021-05-14 20:26:13] [INFO ] Deduced a trap composed of 140 places in 225 ms of which 1 ms to minimize.
[2021-05-14 20:26:13] [INFO ] Deduced a trap composed of 82 places in 224 ms of which 0 ms to minimize.
[2021-05-14 20:26:14] [INFO ] Deduced a trap composed of 79 places in 224 ms of which 0 ms to minimize.
[2021-05-14 20:26:14] [INFO ] Deduced a trap composed of 78 places in 220 ms of which 1 ms to minimize.
[2021-05-14 20:26:14] [INFO ] Deduced a trap composed of 58 places in 218 ms of which 1 ms to minimize.
[2021-05-14 20:26:14] [INFO ] Deduced a trap composed of 37 places in 259 ms of which 1 ms to minimize.
[2021-05-14 20:26:15] [INFO ] Deduced a trap composed of 53 places in 266 ms of which 1 ms to minimize.
[2021-05-14 20:26:15] [INFO ] Deduced a trap composed of 100 places in 266 ms of which 1 ms to minimize.
[2021-05-14 20:26:15] [INFO ] Deduced a trap composed of 127 places in 242 ms of which 1 ms to minimize.
[2021-05-14 20:26:16] [INFO ] Deduced a trap composed of 46 places in 257 ms of which 1 ms to minimize.
[2021-05-14 20:26:16] [INFO ] Deduced a trap composed of 56 places in 209 ms of which 1 ms to minimize.
[2021-05-14 20:26:16] [INFO ] Deduced a trap composed of 101 places in 179 ms of which 0 ms to minimize.
[2021-05-14 20:26:17] [INFO ] Deduced a trap composed of 89 places in 168 ms of which 0 ms to minimize.
[2021-05-14 20:26:17] [INFO ] Deduced a trap composed of 94 places in 167 ms of which 0 ms to minimize.
[2021-05-14 20:26:17] [INFO ] Deduced a trap composed of 94 places in 186 ms of which 1 ms to minimize.
[2021-05-14 20:26:18] [INFO ] Deduced a trap composed of 108 places in 159 ms of which 1 ms to minimize.
[2021-05-14 20:26:18] [INFO ] Deduced a trap composed of 97 places in 182 ms of which 0 ms to minimize.
[2021-05-14 20:26:19] [INFO ] Deduced a trap composed of 89 places in 168 ms of which 1 ms to minimize.
[2021-05-14 20:26:19] [INFO ] Deduced a trap composed of 127 places in 212 ms of which 0 ms to minimize.
[2021-05-14 20:26:19] [INFO ] Deduced a trap composed of 74 places in 221 ms of which 0 ms to minimize.
[2021-05-14 20:26:20] [INFO ] Deduced a trap composed of 126 places in 217 ms of which 0 ms to minimize.
[2021-05-14 20:26:20] [INFO ] Deduced a trap composed of 82 places in 216 ms of which 1 ms to minimize.
[2021-05-14 20:26:20] [INFO ] Deduced a trap composed of 91 places in 236 ms of which 1 ms to minimize.
[2021-05-14 20:26:21] [INFO ] Deduced a trap composed of 31 places in 235 ms of which 0 ms to minimize.
[2021-05-14 20:26:21] [INFO ] Deduced a trap composed of 98 places in 188 ms of which 0 ms to minimize.
[2021-05-14 20:26:22] [INFO ] Deduced a trap composed of 104 places in 188 ms of which 1 ms to minimize.
[2021-05-14 20:26:22] [INFO ] Deduced a trap composed of 126 places in 175 ms of which 1 ms to minimize.
[2021-05-14 20:26:22] [INFO ] Deduced a trap composed of 101 places in 156 ms of which 0 ms to minimize.
[2021-05-14 20:26:23] [INFO ] Deduced a trap composed of 14 places in 223 ms of which 1 ms to minimize.
[2021-05-14 20:26:23] [INFO ] Deduced a trap composed of 48 places in 201 ms of which 1 ms to minimize.
[2021-05-14 20:26:24] [INFO ] Deduced a trap composed of 40 places in 222 ms of which 0 ms to minimize.
[2021-05-14 20:26:27] [INFO ] Deduced a trap composed of 109 places in 228 ms of which 1 ms to minimize.
[2021-05-14 20:26:27] [INFO ] Deduced a trap composed of 119 places in 204 ms of which 1 ms to minimize.
[2021-05-14 20:26:28] [INFO ] Deduced a trap composed of 11 places in 205 ms of which 1 ms to minimize.
[2021-05-14 20:26:29] [INFO ] Deduced a trap composed of 118 places in 185 ms of which 0 ms to minimize.
[2021-05-14 20:26:31] [INFO ] Deduced a trap composed of 52 places in 203 ms of which 1 ms to minimize.
[2021-05-14 20:26:32] [INFO ] Deduced a trap composed of 71 places in 179 ms of which 0 ms to minimize.
[2021-05-14 20:26:32] [INFO ] Deduced a trap composed of 82 places in 215 ms of which 1 ms to minimize.
[2021-05-14 20:26:32] [INFO ] Deduced a trap composed of 98 places in 199 ms of which 1 ms to minimize.
[2021-05-14 20:26:40] [INFO ] Deduced a trap composed of 2 places in 320 ms of which 1 ms to minimize.
[2021-05-14 20:26:40] [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-14 20:26:40] [INFO ] [Real]Absence check using 17 positive place invariants in 16 ms returned sat
[2021-05-14 20:26:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:26:40] [INFO ] [Real]Absence check using state equation in 402 ms returned sat
[2021-05-14 20:26:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:26:41] [INFO ] [Nat]Absence check using 17 positive place invariants in 17 ms returned sat
[2021-05-14 20:26:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:26:41] [INFO ] [Nat]Absence check using state equation in 335 ms returned sat
[2021-05-14 20:26:41] [INFO ] [Nat]Added 230 Read/Feed constraints in 54 ms returned sat
[2021-05-14 20:26:41] [INFO ] Deduced a trap composed of 91 places in 224 ms of which 1 ms to minimize.
[2021-05-14 20:26:42] [INFO ] Deduced a trap composed of 95 places in 268 ms of which 0 ms to minimize.
[2021-05-14 20:26:42] [INFO ] Deduced a trap composed of 107 places in 247 ms of which 1 ms to minimize.
[2021-05-14 20:26:42] [INFO ] Deduced a trap composed of 146 places in 241 ms of which 0 ms to minimize.
[2021-05-14 20:26:42] [INFO ] Deduced a trap composed of 37 places in 249 ms of which 0 ms to minimize.
[2021-05-14 20:26:43] [INFO ] Deduced a trap composed of 56 places in 240 ms of which 1 ms to minimize.
[2021-05-14 20:26:43] [INFO ] Deduced a trap composed of 52 places in 255 ms of which 1 ms to minimize.
[2021-05-14 20:26:43] [INFO ] Deduced a trap composed of 26 places in 260 ms of which 0 ms to minimize.
[2021-05-14 20:26:44] [INFO ] Deduced a trap composed of 74 places in 257 ms of which 1 ms to minimize.
[2021-05-14 20:26:44] [INFO ] Deduced a trap composed of 19 places in 286 ms of which 1 ms to minimize.
[2021-05-14 20:26:44] [INFO ] Deduced a trap composed of 32 places in 239 ms of which 0 ms to minimize.
[2021-05-14 20:26:44] [INFO ] Deduced a trap composed of 11 places in 258 ms of which 1 ms to minimize.
[2021-05-14 20:26:45] [INFO ] Deduced a trap composed of 41 places in 273 ms of which 1 ms to minimize.
[2021-05-14 20:26:45] [INFO ] Deduced a trap composed of 19 places in 274 ms of which 1 ms to minimize.
[2021-05-14 20:26:45] [INFO ] Deduced a trap composed of 19 places in 264 ms of which 1 ms to minimize.
[2021-05-14 20:26:46] [INFO ] Deduced a trap composed of 51 places in 225 ms of which 1 ms to minimize.
[2021-05-14 20:26:46] [INFO ] Deduced a trap composed of 28 places in 223 ms of which 0 ms to minimize.
[2021-05-14 20:26:46] [INFO ] Deduced a trap composed of 41 places in 224 ms of which 0 ms to minimize.
[2021-05-14 20:26:46] [INFO ] Deduced a trap composed of 41 places in 227 ms of which 0 ms to minimize.
[2021-05-14 20:26:47] [INFO ] Deduced a trap composed of 63 places in 258 ms of which 1 ms to minimize.
[2021-05-14 20:26:47] [INFO ] Deduced a trap composed of 45 places in 263 ms of which 0 ms to minimize.
[2021-05-14 20:26:48] [INFO ] Deduced a trap composed of 181 places in 266 ms of which 1 ms to minimize.
[2021-05-14 20:26:48] [INFO ] Deduced a trap composed of 48 places in 271 ms of which 1 ms to minimize.
[2021-05-14 20:26:48] [INFO ] Deduced a trap composed of 104 places in 190 ms of which 0 ms to minimize.
[2021-05-14 20:26:48] [INFO ] Deduced a trap composed of 78 places in 167 ms of which 1 ms to minimize.
[2021-05-14 20:26:49] [INFO ] Deduced a trap composed of 75 places in 154 ms of which 0 ms to minimize.
[2021-05-14 20:26:49] [INFO ] Deduced a trap composed of 78 places in 145 ms of which 1 ms to minimize.
[2021-05-14 20:26:49] [INFO ] Deduced a trap composed of 75 places in 148 ms of which 1 ms to minimize.
[2021-05-14 20:26:49] [INFO ] Deduced a trap composed of 74 places in 150 ms of which 0 ms to minimize.
[2021-05-14 20:26:49] [INFO ] Deduced a trap composed of 78 places in 153 ms of which 0 ms to minimize.
[2021-05-14 20:26:51] [INFO ] Deduced a trap composed of 37 places in 259 ms of which 1 ms to minimize.
[2021-05-14 20:26:51] [INFO ] Deduced a trap composed of 108 places in 250 ms of which 1 ms to minimize.
[2021-05-14 20:26:52] [INFO ] Deduced a trap composed of 131 places in 274 ms of which 1 ms to minimize.
[2021-05-14 20:26:52] [INFO ] Deduced a trap composed of 101 places in 279 ms of which 1 ms to minimize.
[2021-05-14 20:26:52] [INFO ] Deduced a trap composed of 101 places in 313 ms of which 1 ms to minimize.
[2021-05-14 20:26:53] [INFO ] Deduced a trap composed of 50 places in 264 ms of which 1 ms to minimize.
[2021-05-14 20:26:53] [INFO ] Deduced a trap composed of 100 places in 151 ms of which 0 ms to minimize.
[2021-05-14 20:26:53] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 12018 ms
[2021-05-14 20:26:53] [INFO ] Computed and/alt/rep : 1056/1992/1056 causal constraints (skipped 60 transitions) in 58 ms.
[2021-05-14 20:27:08] [INFO ] Deduced a trap composed of 100 places in 156 ms of which 1 ms to minimize.
[2021-05-14 20:27:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 285 ms
[2021-05-14 20:27:08] [INFO ] Added : 1034 causal constraints over 207 iterations in 15019 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 20 ms.
[2021-05-14 20:27:08] [INFO ] [Real]Absence check using 17 positive place invariants in 51 ms returned sat
[2021-05-14 20:27:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:27:09] [INFO ] [Real]Absence check using state equation in 269 ms returned sat
[2021-05-14 20:27:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:27:09] [INFO ] [Nat]Absence check using 17 positive place invariants in 16 ms returned sat
[2021-05-14 20:27:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:27:09] [INFO ] [Nat]Absence check using state equation in 286 ms returned sat
[2021-05-14 20:27:09] [INFO ] [Nat]Added 230 Read/Feed constraints in 52 ms returned sat
[2021-05-14 20:27:09] [INFO ] Deduced a trap composed of 48 places in 213 ms of which 0 ms to minimize.
[2021-05-14 20:27:13] [INFO ] Deduced a trap composed of 49 places in 3220 ms of which 1 ms to minimize.
[2021-05-14 20:27:13] [INFO ] Deduced a trap composed of 11 places in 204 ms of which 0 ms to minimize.
[2021-05-14 20:27:13] [INFO ] Deduced a trap composed of 11 places in 255 ms of which 1 ms to minimize.
[2021-05-14 20:27:13] [INFO ] Deduced a trap composed of 11 places in 215 ms of which 1 ms to minimize.
[2021-05-14 20:27:14] [INFO ] Deduced a trap composed of 18 places in 233 ms of which 0 ms to minimize.
[2021-05-14 20:27:14] [INFO ] Deduced a trap composed of 13 places in 234 ms of which 1 ms to minimize.
[2021-05-14 20:27:14] [INFO ] Deduced a trap composed of 11 places in 234 ms of which 0 ms to minimize.
[2021-05-14 20:27:14] [INFO ] Deduced a trap composed of 71 places in 187 ms of which 1 ms to minimize.
[2021-05-14 20:27:15] [INFO ] Deduced a trap composed of 52 places in 188 ms of which 0 ms to minimize.
[2021-05-14 20:27:15] [INFO ] Deduced a trap composed of 75 places in 178 ms of which 1 ms to minimize.
[2021-05-14 20:27:15] [INFO ] Deduced a trap composed of 52 places in 169 ms of which 0 ms to minimize.
[2021-05-14 20:27:15] [INFO ] Deduced a trap composed of 74 places in 169 ms of which 1 ms to minimize.
[2021-05-14 20:27:15] [INFO ] Deduced a trap composed of 74 places in 161 ms of which 0 ms to minimize.
[2021-05-14 20:27:16] [INFO ] Deduced a trap composed of 75 places in 177 ms of which 1 ms to minimize.
[2021-05-14 20:27:16] [INFO ] Deduced a trap composed of 97 places in 181 ms of which 0 ms to minimize.
[2021-05-14 20:27:16] [INFO ] Deduced a trap composed of 49 places in 195 ms of which 0 ms to minimize.
[2021-05-14 20:27:16] [INFO ] Deduced a trap composed of 116 places in 138 ms of which 0 ms to minimize.
[2021-05-14 20:27:17] [INFO ] Deduced a trap composed of 82 places in 220 ms of which 1 ms to minimize.
[2021-05-14 20:27:17] [INFO ] Deduced a trap composed of 55 places in 210 ms of which 1 ms to minimize.
[2021-05-14 20:27:17] [INFO ] Deduced a trap composed of 79 places in 138 ms of which 0 ms to minimize.
[2021-05-14 20:27:17] [INFO ] Deduced a trap composed of 127 places in 219 ms of which 0 ms to minimize.
[2021-05-14 20:27:18] [INFO ] Deduced a trap composed of 126 places in 231 ms of which 1 ms to minimize.
[2021-05-14 20:27:18] [INFO ] Deduced a trap composed of 75 places in 222 ms of which 0 ms to minimize.
[2021-05-14 20:27:18] [INFO ] Deduced a trap composed of 101 places in 107 ms of which 1 ms to minimize.
[2021-05-14 20:27:18] [INFO ] Deduced a trap composed of 100 places in 108 ms of which 0 ms to minimize.
[2021-05-14 20:27:18] [INFO ] Deduced a trap composed of 97 places in 116 ms of which 0 ms to minimize.
[2021-05-14 20:27:18] [INFO ] Deduced a trap composed of 100 places in 117 ms of which 1 ms to minimize.
[2021-05-14 20:27:18] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 9320 ms
[2021-05-14 20:27:18] [INFO ] Computed and/alt/rep : 1056/1992/1056 causal constraints (skipped 60 transitions) in 58 ms.
[2021-05-14 20:27:29] [INFO ] Deduced a trap composed of 48 places in 215 ms of which 0 ms to minimize.
[2021-05-14 20:27:30] [INFO ] Deduced a trap composed of 41 places in 225 ms of which 0 ms to minimize.
[2021-05-14 20:27:30] [INFO ] Deduced a trap composed of 15 places in 196 ms of which 0 ms to minimize.
[2021-05-14 20:27:30] [INFO ] Deduced a trap composed of 15 places in 200 ms of which 0 ms to minimize.
[2021-05-14 20:27:31] [INFO ] Deduced a trap composed of 100 places in 99 ms of which 0 ms to minimize.
[2021-05-14 20:27:31] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1409 ms
[2021-05-14 20:27:31] [INFO ] Added : 886 causal constraints over 178 iterations in 12305 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 20 ms.
Fused 4 Parikh solutions to 3 different solutions.
Incomplete Parikh walk after 467400 steps, including 1000 resets, run finished after 1959 ms. (steps per millisecond=238 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 250700 steps, including 1000 resets, run finished after 1058 ms. (steps per millisecond=236 ) properties (out of 4) seen :0 could not realise parikh vector
Support contains 608 out of 828 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 828/828 places, 1242/1242 transitions.
Applied a total of 0 rules in 18 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 828/828 places, 1242/1242 transitions.
Starting structural reductions, iteration 0 : 828/828 places, 1242/1242 transitions.
Applied a total of 0 rules in 17 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2021-05-14 20:27:34] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 828 cols
[2021-05-14 20:27:34] [INFO ] Computed 17 place invariants in 3 ms
[2021-05-14 20:27:34] [INFO ] Implicit Places using invariants in 306 ms returned []
[2021-05-14 20:27:34] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 828 cols
[2021-05-14 20:27:34] [INFO ] Computed 17 place invariants in 4 ms
[2021-05-14 20:27:35] [INFO ] State equation strengthened by 230 read => feed constraints.
[2021-05-14 20:27:35] [INFO ] Implicit Places using invariants and state equation in 948 ms returned []
Implicit Place search using SMT with State Equation took 1256 ms to find 0 implicit places.
[2021-05-14 20:27:35] [INFO ] Redundant transitions in 11 ms returned []
[2021-05-14 20:27:35] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 828 cols
[2021-05-14 20:27:35] [INFO ] Computed 17 place invariants in 3 ms
[2021-05-14 20:27:46] [INFO ] Dead Transitions using invariants and state equation in 10588 ms returned []
Finished structural reductions, in 1 iterations. Remains : 828/828 places, 1242/1242 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 539 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2021-05-14 20:27:46] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 828 cols
[2021-05-14 20:27:46] [INFO ] Computed 17 place invariants in 3 ms
[2021-05-14 20:27:46] [INFO ] [Real]Absence check using 17 positive place invariants in 16 ms returned sat
[2021-05-14 20:27:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:27:47] [INFO ] [Real]Absence check using state equation in 298 ms returned sat
[2021-05-14 20:27:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:27:50] [INFO ] [Real]Absence check using 17 positive place invariants in 16 ms returned sat
[2021-05-14 20:27:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:27:51] [INFO ] [Real]Absence check using state equation in 329 ms returned sat
[2021-05-14 20:27:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:27:53] [INFO ] [Nat]Absence check using 17 positive place invariants in 17 ms returned sat
[2021-05-14 20:27:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:27:54] [INFO ] [Nat]Absence check using state equation in 263 ms returned sat
[2021-05-14 20:27:54] [INFO ] State equation strengthened by 230 read => feed constraints.
[2021-05-14 20:27:54] [INFO ] [Nat]Added 230 Read/Feed constraints in 54 ms returned sat
[2021-05-14 20:27:54] [INFO ] Deduced a trap composed of 11 places in 267 ms of which 1 ms to minimize.
[2021-05-14 20:27:55] [INFO ] Deduced a trap composed of 15 places in 642 ms of which 1 ms to minimize.
[2021-05-14 20:27:55] [INFO ] Deduced a trap composed of 15 places in 269 ms of which 1 ms to minimize.
[2021-05-14 20:27:56] [INFO ] Deduced a trap composed of 15 places in 706 ms of which 1 ms to minimize.
[2021-05-14 20:27:56] [INFO ] Deduced a trap composed of 15 places in 259 ms of which 1 ms to minimize.
[2021-05-14 20:27:56] [INFO ] Deduced a trap composed of 48 places in 233 ms of which 0 ms to minimize.
[2021-05-14 20:27:57] [INFO ] Deduced a trap composed of 45 places in 244 ms of which 0 ms to minimize.
[2021-05-14 20:27:57] [INFO ] Deduced a trap composed of 48 places in 250 ms of which 1 ms to minimize.
[2021-05-14 20:27:57] [INFO ] Deduced a trap composed of 127 places in 239 ms of which 1 ms to minimize.
[2021-05-14 20:27:58] [INFO ] Deduced a trap composed of 123 places in 233 ms of which 1 ms to minimize.
[2021-05-14 20:27:58] [INFO ] Deduced a trap composed of 113 places in 246 ms of which 0 ms to minimize.
[2021-05-14 20:27:58] [INFO ] Deduced a trap composed of 51 places in 253 ms of which 0 ms to minimize.
[2021-05-14 20:27:58] [INFO ] Deduced a trap composed of 32 places in 251 ms of which 1 ms to minimize.
[2021-05-14 20:27:59] [INFO ] Deduced a trap composed of 45 places in 252 ms of which 1 ms to minimize.
[2021-05-14 20:27:59] [INFO ] Deduced a trap composed of 11 places in 259 ms of which 0 ms to minimize.
[2021-05-14 20:27:59] [INFO ] Deduced a trap composed of 115 places in 217 ms of which 0 ms to minimize.
[2021-05-14 20:27:59] [INFO ] Deduced a trap composed of 89 places in 207 ms of which 1 ms to minimize.
[2021-05-14 20:28:00] [INFO ] Deduced a trap composed of 51 places in 220 ms of which 1 ms to minimize.
[2021-05-14 20:28:00] [INFO ] Deduced a trap composed of 51 places in 238 ms of which 1 ms to minimize.
[2021-05-14 20:28:00] [INFO ] Deduced a trap composed of 51 places in 208 ms of which 1 ms to minimize.
[2021-05-14 20:28:01] [INFO ] Deduced a trap composed of 51 places in 218 ms of which 1 ms to minimize.
[2021-05-14 20:28:01] [INFO ] Deduced a trap composed of 40 places in 248 ms of which 1 ms to minimize.
[2021-05-14 20:28:01] [INFO ] Deduced a trap composed of 40 places in 251 ms of which 0 ms to minimize.
[2021-05-14 20:28:02] [INFO ] Deduced a trap composed of 40 places in 265 ms of which 0 ms to minimize.
[2021-05-14 20:28:02] [INFO ] Deduced a trap composed of 60 places in 247 ms of which 1 ms to minimize.
[2021-05-14 20:28:02] [INFO ] Deduced a trap composed of 100 places in 248 ms of which 0 ms to minimize.
[2021-05-14 20:28:02] [INFO ] Deduced a trap composed of 48 places in 228 ms of which 1 ms to minimize.
[2021-05-14 20:28:03] [INFO ] Deduced a trap composed of 67 places in 244 ms of which 1 ms to minimize.
[2021-05-14 20:28:03] [INFO ] Deduced a trap composed of 26 places in 254 ms of which 1 ms to minimize.
[2021-05-14 20:28:03] [INFO ] Deduced a trap composed of 104 places in 231 ms of which 1 ms to minimize.
[2021-05-14 20:28:04] [INFO ] Deduced a trap composed of 104 places in 254 ms of which 1 ms to minimize.
[2021-05-14 20:28:04] [INFO ] Deduced a trap composed of 78 places in 247 ms of which 1 ms to minimize.
[2021-05-14 20:28:04] [INFO ] Deduced a trap composed of 105 places in 249 ms of which 0 ms to minimize.
[2021-05-14 20:28:04] [INFO ] Deduced a trap composed of 67 places in 232 ms of which 1 ms to minimize.
[2021-05-14 20:28:05] [INFO ] Deduced a trap composed of 93 places in 234 ms of which 0 ms to minimize.
[2021-05-14 20:28:05] [INFO ] Deduced a trap composed of 119 places in 241 ms of which 1 ms to minimize.
[2021-05-14 20:28:05] [INFO ] Deduced a trap composed of 78 places in 259 ms of which 0 ms to minimize.
[2021-05-14 20:28:06] [INFO ] Deduced a trap composed of 52 places in 240 ms of which 0 ms to minimize.
[2021-05-14 20:28:06] [INFO ] Deduced a trap composed of 43 places in 227 ms of which 0 ms to minimize.
[2021-05-14 20:28:06] [INFO ] Deduced a trap composed of 67 places in 223 ms of which 0 ms to minimize.
[2021-05-14 20:28:06] [INFO ] Deduced a trap composed of 26 places in 260 ms of which 0 ms to minimize.
[2021-05-14 20:28:07] [INFO ] Deduced a trap composed of 86 places in 247 ms of which 1 ms to minimize.
[2021-05-14 20:28:07] [INFO ] Deduced a trap composed of 55 places in 247 ms of which 1 ms to minimize.
[2021-05-14 20:28:07] [INFO ] Deduced a trap composed of 134 places in 224 ms of which 1 ms to minimize.
[2021-05-14 20:28:07] [INFO ] Deduced a trap composed of 119 places in 223 ms of which 1 ms to minimize.
[2021-05-14 20:28:08] [INFO ] Deduced a trap composed of 37 places in 224 ms of which 1 ms to minimize.
[2021-05-14 20:28:08] [INFO ] Deduced a trap composed of 134 places in 171 ms of which 1 ms to minimize.
[2021-05-14 20:28:08] [INFO ] Deduced a trap composed of 134 places in 170 ms of which 0 ms to minimize.
[2021-05-14 20:28:09] [INFO ] Deduced a trap composed of 86 places in 213 ms of which 1 ms to minimize.
[2021-05-14 20:28:09] [INFO ] Deduced a trap composed of 85 places in 203 ms of which 0 ms to minimize.
[2021-05-14 20:28:09] [INFO ] Deduced a trap composed of 66 places in 212 ms of which 0 ms to minimize.
[2021-05-14 20:28:09] [INFO ] Deduced a trap composed of 74 places in 204 ms of which 1 ms to minimize.
[2021-05-14 20:28:10] [INFO ] Deduced a trap composed of 140 places in 216 ms of which 0 ms to minimize.
[2021-05-14 20:28:10] [INFO ] Deduced a trap composed of 82 places in 211 ms of which 0 ms to minimize.
[2021-05-14 20:28:10] [INFO ] Deduced a trap composed of 79 places in 205 ms of which 1 ms to minimize.
[2021-05-14 20:28:10] [INFO ] Deduced a trap composed of 78 places in 201 ms of which 1 ms to minimize.
[2021-05-14 20:28:11] [INFO ] Deduced a trap composed of 58 places in 210 ms of which 1 ms to minimize.
[2021-05-14 20:28:11] [INFO ] Deduced a trap composed of 2 places in 304 ms of which 1 ms to minimize.
[2021-05-14 20:28:11] [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-14 20:28:11] [INFO ] [Real]Absence check using 17 positive place invariants in 16 ms returned sat
[2021-05-14 20:28:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:28:11] [INFO ] [Real]Absence check using state equation in 405 ms returned sat
[2021-05-14 20:28:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:28:12] [INFO ] [Nat]Absence check using 17 positive place invariants in 17 ms returned sat
[2021-05-14 20:28:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:28:12] [INFO ] [Nat]Absence check using state equation in 333 ms returned sat
[2021-05-14 20:28:12] [INFO ] [Nat]Added 230 Read/Feed constraints in 55 ms returned sat
[2021-05-14 20:28:12] [INFO ] Deduced a trap composed of 91 places in 217 ms of which 1 ms to minimize.
[2021-05-14 20:28:13] [INFO ] Deduced a trap composed of 95 places in 233 ms of which 0 ms to minimize.
[2021-05-14 20:28:13] [INFO ] Deduced a trap composed of 107 places in 224 ms of which 0 ms to minimize.
[2021-05-14 20:28:13] [INFO ] Deduced a trap composed of 146 places in 224 ms of which 0 ms to minimize.
[2021-05-14 20:28:13] [INFO ] Deduced a trap composed of 37 places in 235 ms of which 1 ms to minimize.
[2021-05-14 20:28:14] [INFO ] Deduced a trap composed of 56 places in 235 ms of which 1 ms to minimize.
[2021-05-14 20:28:14] [INFO ] Deduced a trap composed of 52 places in 256 ms of which 1 ms to minimize.
[2021-05-14 20:28:14] [INFO ] Deduced a trap composed of 26 places in 285 ms of which 1 ms to minimize.
[2021-05-14 20:28:15] [INFO ] Deduced a trap composed of 74 places in 251 ms of which 1 ms to minimize.
[2021-05-14 20:28:15] [INFO ] Deduced a trap composed of 19 places in 241 ms of which 0 ms to minimize.
[2021-05-14 20:28:15] [INFO ] Deduced a trap composed of 32 places in 274 ms of which 1 ms to minimize.
[2021-05-14 20:28:15] [INFO ] Deduced a trap composed of 11 places in 282 ms of which 1 ms to minimize.
[2021-05-14 20:28:16] [INFO ] Deduced a trap composed of 41 places in 282 ms of which 1 ms to minimize.
[2021-05-14 20:28:16] [INFO ] Deduced a trap composed of 19 places in 250 ms of which 0 ms to minimize.
[2021-05-14 20:28:16] [INFO ] Deduced a trap composed of 19 places in 247 ms of which 1 ms to minimize.
[2021-05-14 20:28:17] [INFO ] Deduced a trap composed of 51 places in 252 ms of which 1 ms to minimize.
[2021-05-14 20:28:17] [INFO ] Deduced a trap composed of 28 places in 242 ms of which 1 ms to minimize.
[2021-05-14 20:28:17] [INFO ] Deduced a trap composed of 41 places in 236 ms of which 0 ms to minimize.
[2021-05-14 20:28:17] [INFO ] Deduced a trap composed of 41 places in 234 ms of which 1 ms to minimize.
[2021-05-14 20:28:18] [INFO ] Deduced a trap composed of 63 places in 275 ms of which 1 ms to minimize.
[2021-05-14 20:28:18] [INFO ] Deduced a trap composed of 45 places in 279 ms of which 1 ms to minimize.
[2021-05-14 20:28:19] [INFO ] Deduced a trap composed of 181 places in 284 ms of which 1 ms to minimize.
[2021-05-14 20:28:19] [INFO ] Deduced a trap composed of 48 places in 266 ms of which 1 ms to minimize.
[2021-05-14 20:28:19] [INFO ] Deduced a trap composed of 104 places in 197 ms of which 0 ms to minimize.
[2021-05-14 20:28:19] [INFO ] Deduced a trap composed of 78 places in 156 ms of which 1 ms to minimize.
[2021-05-14 20:28:20] [INFO ] Deduced a trap composed of 75 places in 150 ms of which 0 ms to minimize.
[2021-05-14 20:28:20] [INFO ] Deduced a trap composed of 78 places in 153 ms of which 1 ms to minimize.
[2021-05-14 20:28:20] [INFO ] Deduced a trap composed of 75 places in 151 ms of which 0 ms to minimize.
[2021-05-14 20:28:20] [INFO ] Deduced a trap composed of 74 places in 152 ms of which 1 ms to minimize.
[2021-05-14 20:28:20] [INFO ] Deduced a trap composed of 78 places in 151 ms of which 1 ms to minimize.
[2021-05-14 20:28:22] [INFO ] Deduced a trap composed of 37 places in 260 ms of which 0 ms to minimize.
[2021-05-14 20:28:22] [INFO ] Deduced a trap composed of 108 places in 252 ms of which 1 ms to minimize.
[2021-05-14 20:28:23] [INFO ] Deduced a trap composed of 131 places in 267 ms of which 1 ms to minimize.
[2021-05-14 20:28:23] [INFO ] Deduced a trap composed of 101 places in 268 ms of which 0 ms to minimize.
[2021-05-14 20:28:23] [INFO ] Deduced a trap composed of 101 places in 277 ms of which 1 ms to minimize.
[2021-05-14 20:28:24] [INFO ] Deduced a trap composed of 50 places in 266 ms of which 0 ms to minimize.
[2021-05-14 20:28:24] [INFO ] Deduced a trap composed of 100 places in 142 ms of which 0 ms to minimize.
[2021-05-14 20:28:24] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 11886 ms
[2021-05-14 20:28:24] [INFO ] Computed and/alt/rep : 1056/1992/1056 causal constraints (skipped 60 transitions) in 68 ms.
[2021-05-14 20:28:32] [INFO ] Deduced a trap composed of 2 places in 333 ms of which 1 ms to minimize.
[2021-05-14 20:28:32] [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-14 20:28:32] [INFO ] [Real]Absence check using 17 positive place invariants in 38 ms returned sat
[2021-05-14 20:28:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:28:32] [INFO ] [Real]Absence check using state equation in 283 ms returned sat
[2021-05-14 20:28:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:28:32] [INFO ] [Nat]Absence check using 17 positive place invariants in 16 ms returned sat
[2021-05-14 20:28:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:28:33] [INFO ] [Nat]Absence check using state equation in 257 ms returned sat
[2021-05-14 20:28:33] [INFO ] [Nat]Added 230 Read/Feed constraints in 52 ms returned sat
[2021-05-14 20:28:33] [INFO ] Deduced a trap composed of 48 places in 222 ms of which 1 ms to minimize.
[2021-05-14 20:28:33] [INFO ] Deduced a trap composed of 49 places in 230 ms of which 1 ms to minimize.
[2021-05-14 20:28:34] [INFO ] Deduced a trap composed of 11 places in 223 ms of which 1 ms to minimize.
[2021-05-14 20:28:34] [INFO ] Deduced a trap composed of 11 places in 239 ms of which 0 ms to minimize.
[2021-05-14 20:28:34] [INFO ] Deduced a trap composed of 11 places in 223 ms of which 0 ms to minimize.
[2021-05-14 20:28:34] [INFO ] Deduced a trap composed of 18 places in 223 ms of which 0 ms to minimize.
[2021-05-14 20:28:35] [INFO ] Deduced a trap composed of 13 places in 214 ms of which 1 ms to minimize.
[2021-05-14 20:28:35] [INFO ] Deduced a trap composed of 11 places in 224 ms of which 1 ms to minimize.
[2021-05-14 20:28:35] [INFO ] Deduced a trap composed of 71 places in 167 ms of which 0 ms to minimize.
[2021-05-14 20:28:35] [INFO ] Deduced a trap composed of 52 places in 165 ms of which 1 ms to minimize.
[2021-05-14 20:28:36] [INFO ] Deduced a trap composed of 75 places in 175 ms of which 1 ms to minimize.
[2021-05-14 20:28:36] [INFO ] Deduced a trap composed of 52 places in 172 ms of which 0 ms to minimize.
[2021-05-14 20:28:36] [INFO ] Deduced a trap composed of 74 places in 178 ms of which 0 ms to minimize.
[2021-05-14 20:28:36] [INFO ] Deduced a trap composed of 74 places in 177 ms of which 1 ms to minimize.
[2021-05-14 20:28:36] [INFO ] Deduced a trap composed of 75 places in 167 ms of which 0 ms to minimize.
[2021-05-14 20:28:37] [INFO ] Deduced a trap composed of 97 places in 174 ms of which 0 ms to minimize.
[2021-05-14 20:28:37] [INFO ] Deduced a trap composed of 49 places in 167 ms of which 1 ms to minimize.
[2021-05-14 20:28:37] [INFO ] Deduced a trap composed of 116 places in 141 ms of which 1 ms to minimize.
[2021-05-14 20:28:37] [INFO ] Deduced a trap composed of 82 places in 197 ms of which 0 ms to minimize.
[2021-05-14 20:28:37] [INFO ] Deduced a trap composed of 55 places in 197 ms of which 0 ms to minimize.
[2021-05-14 20:28:38] [INFO ] Deduced a trap composed of 79 places in 131 ms of which 0 ms to minimize.
[2021-05-14 20:28:38] [INFO ] Deduced a trap composed of 127 places in 200 ms of which 1 ms to minimize.
[2021-05-14 20:28:38] [INFO ] Deduced a trap composed of 126 places in 204 ms of which 1 ms to minimize.
[2021-05-14 20:28:38] [INFO ] Deduced a trap composed of 75 places in 203 ms of which 1 ms to minimize.
[2021-05-14 20:28:38] [INFO ] Deduced a trap composed of 101 places in 114 ms of which 1 ms to minimize.
[2021-05-14 20:28:39] [INFO ] Deduced a trap composed of 100 places in 119 ms of which 1 ms to minimize.
[2021-05-14 20:28:39] [INFO ] Deduced a trap composed of 97 places in 125 ms of which 1 ms to minimize.
[2021-05-14 20:28:39] [INFO ] Deduced a trap composed of 100 places in 118 ms of which 0 ms to minimize.
[2021-05-14 20:28:39] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 6205 ms
[2021-05-14 20:28:39] [INFO ] Computed and/alt/rep : 1056/1992/1056 causal constraints (skipped 60 transitions) in 68 ms.
[2021-05-14 20:28:50] [INFO ] Deduced a trap composed of 48 places in 220 ms of which 0 ms to minimize.
[2021-05-14 20:28:50] [INFO ] Deduced a trap composed of 41 places in 248 ms of which 1 ms to minimize.
[2021-05-14 20:28:51] [INFO ] Deduced a trap composed of 15 places in 202 ms of which 1 ms to minimize.
[2021-05-14 20:28:51] [INFO ] Deduced a trap composed of 15 places in 212 ms of which 1 ms to minimize.
[2021-05-14 20:28:51] [INFO ] Deduced a trap composed of 100 places in 81 ms of which 0 ms to minimize.
[2021-05-14 20:28:51] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1440 ms
[2021-05-14 20:28:51] [INFO ] Added : 886 causal constraints over 178 iterations in 12164 ms. Result :sat
[2021-05-14 20:28:51] [INFO ] Flatten gal took : 53 ms
[2021-05-14 20:28:51] [INFO ] Flatten gal took : 45 ms
[2021-05-14 20:28:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8652710771494742057.gal : 4 ms
[2021-05-14 20:28:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6108983458812388414.prop : 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality8652710771494742057.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality6108983458812388414.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality8652710771494742057.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality6108983458812388414.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality6108983458812388414.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 10
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :10 after 11
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :11 after 12
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :12 after 15
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :15 after 16
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :16 after 21
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :21 after 76
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :76 after 180
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :180 after 613
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :613 after 2222
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :2222 after 5987
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :5987 after 23902
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :23902 after 80146
SDD proceeding with computation,4 properties remain. new max is 65536
SDD size :80146 after 285998
Detected timeout of ITS tools.
[2021-05-14 20:29:11] [INFO ] Flatten gal took : 32 ms
[2021-05-14 20:29:11] [INFO ] Applying decomposition
[2021-05-14 20:29:11] [INFO ] Flatten gal took : 35 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/graph1807700688640931157.txt, -o, /tmp/graph1807700688640931157.bin, -w, /tmp/graph1807700688640931157.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/graph1807700688640931157.bin, -l, -1, -v, -w, /tmp/graph1807700688640931157.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 20:29:12] [INFO ] Decomposing Gal with order
[2021-05-14 20:29:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 20:29:12] [INFO ] Removed a total of 366 redundant transitions.
[2021-05-14 20:29:12] [INFO ] Flatten gal took : 444 ms
[2021-05-14 20:29:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 360 labels/synchronizations in 16 ms.
[2021-05-14 20:29:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16537394551515054089.gal : 6 ms
[2021-05-14 20:29:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1877494961057723811.prop : 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality16537394551515054089.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality1877494961057723811.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality16537394551515054089.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality1877494961057723811.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality1877494961057723811.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :4 after 11
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :11 after 12
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :12 after 13
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :13 after 15
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :15 after 20
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :20 after 46
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :46 after 169
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :169 after 878
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :878 after 2520
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :2520 after 6703
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :6703 after 24020
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :24020 after 93116
SDD proceeding with computation,4 properties remain. new max is 65536
SDD size :93116 after 286620
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5636720200710739063
[2021-05-14 20:29:32] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5636720200710739063
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/ltsmin5636720200710739063]
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/ltsmin5636720200710739063] killed by timeout after 2 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/ltsmin5636720200710739063] killed by timeout after 2 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 828 transition count 1122
Applied a total of 120 rules in 64 ms. Remains 828 /828 variables (removed 0) and now considering 1122/1242 (removed 120) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 1122 rows 828 cols
[2021-05-14 20:29:39] [INFO ] Computed 17 place invariants in 5 ms
[2021-05-14 20:29:39] [INFO ] [Real]Absence check using 17 positive place invariants in 17 ms returned sat
[2021-05-14 20:29:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:29:39] [INFO ] [Real]Absence check using state equation in 263 ms returned sat
[2021-05-14 20:29:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:29:42] [INFO ] [Real]Absence check using 17 positive place invariants in 29 ms returned sat
[2021-05-14 20:29:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:29:43] [INFO ] [Real]Absence check using state equation in 312 ms returned sat
[2021-05-14 20:29:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:29:46] [INFO ] [Nat]Absence check using 17 positive place invariants in 16 ms returned sat
[2021-05-14 20:29:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:29:46] [INFO ] [Nat]Absence check using state equation in 298 ms returned sat
[2021-05-14 20:29:46] [INFO ] Computed and/alt/rep : 1056/1717/1056 causal constraints (skipped 60 transitions) in 65 ms.
[2021-05-14 20:29:51] [INFO ] Added : 533 causal constraints over 107 iterations in 5171 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2021-05-14 20:29:51] [INFO ] [Real]Absence check using 17 positive place invariants in 16 ms returned sat
[2021-05-14 20:29:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:29:52] [INFO ] [Real]Absence check using state equation in 399 ms returned sat
[2021-05-14 20:29:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:29:52] [INFO ] [Nat]Absence check using 17 positive place invariants in 17 ms returned sat
[2021-05-14 20:29:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:29:52] [INFO ] [Nat]Absence check using state equation in 377 ms returned sat
[2021-05-14 20:29:53] [INFO ] Computed and/alt/rep : 1056/1717/1056 causal constraints (skipped 60 transitions) in 57 ms.
[2021-05-14 20:29:59] [INFO ] Added : 644 causal constraints over 129 iterations in 6656 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2021-05-14 20:29:59] [INFO ] [Real]Absence check using 17 positive place invariants in 15 ms returned sat
[2021-05-14 20:29:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:30:00] [INFO ] [Real]Absence check using state equation in 280 ms returned sat
[2021-05-14 20:30:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:30:00] [INFO ] [Nat]Absence check using 17 positive place invariants in 15 ms returned sat
[2021-05-14 20:30:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:30:00] [INFO ] [Nat]Absence check using state equation in 257 ms returned sat
[2021-05-14 20:30:00] [INFO ] Computed and/alt/rep : 1056/1717/1056 causal constraints (skipped 60 transitions) in 57 ms.
[2021-05-14 20:30:03] [INFO ] Added : 287 causal constraints over 58 iterations in 2607 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
[2021-05-14 20:30:03] [INFO ] Flatten gal took : 28 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3709483412511303787
[2021-05-14 20:30:03] [INFO ] Computing symmetric may disable matrix : 1242 transitions.
[2021-05-14 20:30:03] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 20:30:03] [INFO ] Applying decomposition
[2021-05-14 20:30:03] [INFO ] Computing symmetric may enable matrix : 1242 transitions.
[2021-05-14 20:30:03] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 20:30:03] [INFO ] Flatten gal took : 34 ms
[2021-05-14 20:30:03] [INFO ] Flatten gal took : 39 ms
[2021-05-14 20:30:03] [INFO ] Input system was already deterministic with 1242 transitions.
[2021-05-14 20:30:03] [INFO ] Computing Do-Not-Accords matrix : 1242 transitions.
[2021-05-14 20:30:03] [INFO ] Computation of Completed DNA matrix. took 46 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 20:30:03] [INFO ] Built C files in 327ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3709483412511303787
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/ltsmin3709483412511303787]
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/graph8318479813630806044.txt, -o, /tmp/graph8318479813630806044.bin, -w, /tmp/graph8318479813630806044.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/graph8318479813630806044.bin, -l, -1, -v, -w, /tmp/graph8318479813630806044.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 20:30:12] [INFO ] Decomposing Gal with order
[2021-05-14 20:30:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 20:30:12] [INFO ] Ran tautology test, simplified 0 / 4 in 9133 ms.
[2021-05-14 20:30:12] [INFO ] Removed a total of 330 redundant transitions.
[2021-05-14 20:30:12] [INFO ] BMC solution for property Peterson-PT-5-ReachabilityCardinality-02(UNSAT) depth K=0 took 33 ms
[2021-05-14 20:30:12] [INFO ] BMC solution for property Peterson-PT-5-ReachabilityCardinality-05(UNSAT) depth K=0 took 4 ms
[2021-05-14 20:30:12] [INFO ] BMC solution for property Peterson-PT-5-ReachabilityCardinality-09(UNSAT) depth K=0 took 2 ms
[2021-05-14 20:30:12] [INFO ] BMC solution for property Peterson-PT-5-ReachabilityCardinality-15(UNSAT) depth K=0 took 0 ms
[2021-05-14 20:30:12] [INFO ] Flatten gal took : 520 ms
[2021-05-14 20:30:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 330 labels/synchronizations in 39 ms.
[2021-05-14 20:30:12] [INFO ] BMC solution for property Peterson-PT-5-ReachabilityCardinality-02(UNSAT) depth K=1 took 133 ms
[2021-05-14 20:30:12] [INFO ] BMC solution for property Peterson-PT-5-ReachabilityCardinality-05(UNSAT) depth K=1 took 22 ms
[2021-05-14 20:30:12] [INFO ] BMC solution for property Peterson-PT-5-ReachabilityCardinality-09(UNSAT) depth K=1 took 2 ms
[2021-05-14 20:30:12] [INFO ] BMC solution for property Peterson-PT-5-ReachabilityCardinality-15(UNSAT) depth K=1 took 1 ms
[2021-05-14 20:30:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3199597251272657541.gal : 6 ms
[2021-05-14 20:30:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15256462057859405226.prop : 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality3199597251272657541.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality15256462057859405226.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality3199597251272657541.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality15256462057859405226.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality15256462057859405226.prop.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 1122 out of 1242 initially.
// Phase 1: matrix 1122 rows 828 cols
[2021-05-14 20:30:12] [INFO ] Computed 17 place invariants in 15 ms
inv : Turn_4_4 + Turn_4_3 + Turn_4_5 + Turn_4_1 + Turn_4_0 + Turn_4_2 = 1
inv : Turn_2_0 + Turn_2_4 + Turn_2_5 + Turn_2_1 + Turn_2_3 + Turn_2_2 = 1
inv : Turn_1_0 + Turn_1_5 + Turn_1_4 + Turn_1_1 + Turn_1_3 + Turn_1_2 = 1
inv : IsEndLoop_5_0_0 + IsEndLoop_5_1_0 + IsEndLoop_5_2_0 + IsEndLoop_5_3_0 + IsEndLoop_5_4_0 + IsEndLoop_5_0_1 + IsEndLoop_5_1_1 + IsEndLoop_5_2_1 + IsEndLoop_5_3_1 + IsEndLoop_5_4_1 + IsEndLoop_5_0_2 + IsEndLoop_5_1_2 + IsEndLoop_5_3_2 + IsEndLoop_5_2_2 + IsEndLoop_5_4_2 + IsEndLoop_5_0_3 + IsEndLoop_5_2_3 + IsEndLoop_5_1_3 + IsEndLoop_5_3_3 + IsEndLoop_5_4_3 + IsEndLoop_5_2_4 + IsEndLoop_5_0_4 + IsEndLoop_5_1_4 + IsEndLoop_5_4_4 + IsEndLoop_5_0_5 + IsEndLoop_5_3_4 + IsEndLoop_5_2_5 + IsEndLoop_5_1_5 + EndTurn_5_0 + IsEndLoop_5_3_5 + IsEndLoop_5_4_5 + EndTurn_5_3 + EndTurn_5_2 + EndTurn_5_1 + BeginLoop_5_0_0 + EndTurn_5_4 + BeginLoop_5_3_0 + BeginLoop_5_2_0 + BeginLoop_5_1_0 + BeginLoop_5_1_1 + BeginLoop_5_0_1 + BeginLoop_5_4_0 + BeginLoop_5_4_1 + BeginLoop_5_0_2 + BeginLoop_5_1_2 + BeginLoop_5_2_1 + BeginLoop_5_3_1 + BeginLoop_5_0_3 + BeginLoop_5_1_3 + BeginLoop_5_2_2 + BeginLoop_5_3_2 + BeginLoop_5_4_2 + BeginLoop_5_0_4 + BeginLoop_5_2_4 + BeginLoop_5_1_4 + BeginLoop_5_3_3 + BeginLoop_5_2_3 + BeginLoop_5_4_3 + BeginLoop_5_1_5 + BeginLoop_5_0_5 + BeginLoop_5_2_5 + BeginLoop_5_3_4 + BeginLoop_5_4_4 + TestAlone_5_0_0 + TestAlone_5_1_0 + WantSection_5_F + BeginLoop_5_4_5 + BeginLoop_5_3_5 + TestAlone_5_2_1 + TestAlone_5_0_1 + TestAlone_5_1_1 + TestAlone_5_3_0 + TestAlone_5_4_0 + TestAlone_5_2_0 + TestAlone_5_4_2 + TestAlone_5_3_2 + TestAlone_5_2_2 + TestAlone_5_1_2 + TestAlone_5_0_2 + TestAlone_5_4_1 + TestAlone_5_3_1 + TestAlone_5_0_4 + TestAlone_5_4_3 + TestAlone_5_3_3 + TestAlone_5_2_3 + TestAlone_5_1_3 + TestAlone_5_0_3 + TestTurn_5_1 + TestTurn_5_0 + TestTurn_5_2 + TestAlone_5_2_4 + TestAlone_5_1_4 + TestAlone_5_3_4 + TestAlone_5_4_4 + TestIdentity_5_3_0 + TestIdentity_5_4_0 + TestIdentity_5_0_1 + TestIdentity_5_1_1 + TestIdentity_5_2_1 + TestIdentity_5_3_1 + TestTurn_5_3 + TestTurn_5_4 + TestIdentity_5_0_0 + TestIdentity_5_1_0 + TestIdentity_5_2_0 + TestIdentity_5_1_3 + TestIdentity_5_0_3 + TestIdentity_5_4_2 + TestIdentity_5_3_3 + TestIdentity_5_2_3 + TestIdentity_5_0_2 + TestIdentity_5_4_1 + TestIdentity_5_3_2 + TestIdentity_5_2_2 + TestIdentity_5_1_2 + TestIdentity_5_1_5 + TestIdentity_5_0_5 + TestIdentity_5_4_5 + TestIdentity_5_2_5 + TestIdentity_5_3_5 + TestIdentity_5_1_4 + TestIdentity_5_4_3 + TestIdentity_5_0_4 + TestIdentity_5_3_4 + TestIdentity_5_4_4 + TestIdentity_5_2_4 + AskForSection_5_2 + AskForSection_5_4 + AskForSection_5_3 + AskForSection_5_0 + AskForSection_5_1 + CS_5 = 1
inv : IsEndLoop_4_0_0 + IsEndLoop_4_1_0 + IsEndLoop_4_2_0 + IsEndLoop_4_3_0 + IsEndLoop_4_4_0 + IsEndLoop_4_0_1 + IsEndLoop_4_1_1 + IsEndLoop_4_2_1 + IsEndLoop_4_3_1 + IsEndLoop_4_4_1 + IsEndLoop_4_0_2 + IsEndLoop_4_2_2 + IsEndLoop_4_1_2 + IsEndLoop_4_3_2 + IsEndLoop_4_4_2 + IsEndLoop_4_1_3 + IsEndLoop_4_0_3 + IsEndLoop_4_2_3 + IsEndLoop_4_3_3 + IsEndLoop_4_0_4 + IsEndLoop_4_4_3 + IsEndLoop_4_2_4 + IsEndLoop_4_1_4 + IsEndLoop_4_0_5 + IsEndLoop_4_3_4 + IsEndLoop_4_4_4 + IsEndLoop_4_2_5 + IsEndLoop_4_3_5 + IsEndLoop_4_1_5 + EndTurn_4_0 + IsEndLoop_4_4_5 + EndTurn_4_3 + EndTurn_4_2 + EndTurn_4_1 + BeginLoop_4_1_0 + BeginLoop_4_0_0 + EndTurn_4_4 + BeginLoop_4_3_0 + BeginLoop_4_2_0 + BeginLoop_4_1_1 + BeginLoop_4_0_1 + BeginLoop_4_4_0 + BeginLoop_4_0_2 + BeginLoop_4_1_2 + BeginLoop_4_2_1 + BeginLoop_4_3_1 + BeginLoop_4_4_1 + BeginLoop_4_0_3 + BeginLoop_4_1_3 + BeginLoop_4_2_3 + BeginLoop_4_2_2 + BeginLoop_4_3_2 + BeginLoop_4_4_2 + BeginLoop_4_1_4 + BeginLoop_4_0_4 + BeginLoop_4_2_4 + BeginLoop_4_3_3 + BeginLoop_4_4_3 + BeginLoop_4_1_5 + BeginLoop_4_2_5 + BeginLoop_4_3_4 + BeginLoop_4_0_5 + BeginLoop_4_4_4 + TestAlone_4_0_0 + TestAlone_4_1_0 + WantSection_4_F + BeginLoop_4_3_5 + BeginLoop_4_4_5 + TestAlone_4_2_1 + TestAlone_4_0_1 + TestAlone_4_1_1 + TestAlone_4_4_0 + TestAlone_4_2_0 + TestAlone_4_3_0 + TestAlone_4_4_2 + TestAlone_4_3_2 + TestAlone_4_2_2 + TestAlone_4_1_2 + TestAlone_4_0_2 + TestAlone_4_4_1 + TestAlone_4_3_1 + TestAlone_4_4_3 + TestAlone_4_3_3 + TestAlone_4_2_3 + TestAlone_4_1_3 + TestAlone_4_0_3 + TestAlone_4_3_5 + TestAlone_4_2_5 + TestTurn_4_0 + TestAlone_4_4_5 + TestTurn_4_1 + TestTurn_4_2 + TestAlone_4_0_5 + TestAlone_4_1_5 + TestIdentity_4_4_0 + TestIdentity_4_0_1 + TestIdentity_4_1_1 + TestIdentity_4_2_1 + TestIdentity_4_3_1 + TestTurn_4_3 + TestTurn_4_4 + TestIdentity_4_0_0 + TestIdentity_4_1_0 + TestIdentity_4_2_0 + TestIdentity_4_3_0 + TestIdentity_4_1_3 + TestIdentity_4_0_3 + TestIdentity_4_4_2 + TestIdentity_4_4_3 + TestIdentity_4_3_3 + TestIdentity_4_2_3 + TestIdentity_4_1_2 + TestIdentity_4_0_2 + TestIdentity_4_4_1 + TestIdentity_4_3_2 + TestIdentity_4_2_2 + TestIdentity_4_1_5 + TestIdentity_4_2_5 + TestIdentity_4_0_5 + TestIdentity_4_4_5 + TestIdentity_4_3_5 + TestIdentity_4_1_4 + TestIdentity_4_0_4 + TestIdentity_4_4_4 + TestIdentity_4_2_4 + TestIdentity_4_3_4 + AskForSection_4_3 + AskForSection_4_2 + AskForSection_4_4 + AskForSection_4_0 + AskForSection_4_1 + CS_4 = 1
inv : IsEndLoop_0_0_0 + IsEndLoop_0_1_0 + IsEndLoop_0_2_0 + IsEndLoop_0_3_0 + IsEndLoop_0_4_0 + IsEndLoop_0_0_1 + IsEndLoop_0_1_1 + IsEndLoop_0_2_1 + IsEndLoop_0_3_1 + IsEndLoop_0_4_1 + IsEndLoop_0_0_2 + IsEndLoop_0_1_2 + IsEndLoop_0_2_2 + IsEndLoop_0_4_2 + IsEndLoop_0_3_2 + IsEndLoop_0_0_3 + IsEndLoop_0_1_3 + IsEndLoop_0_3_3 + IsEndLoop_0_2_3 + IsEndLoop_0_4_3 + IsEndLoop_0_0_4 + IsEndLoop_0_3_4 + IsEndLoop_0_1_4 + IsEndLoop_0_2_4 + IsEndLoop_0_0_5 + IsEndLoop_0_1_5 + IsEndLoop_0_4_4 + IsEndLoop_0_3_5 + IsEndLoop_0_2_5 + EndTurn_0_1 + IsEndLoop_0_4_5 + EndTurn_0_0 + EndTurn_0_4 + EndTurn_0_3 + EndTurn_0_2 + BeginLoop_0_1_0 + BeginLoop_0_0_0 + BeginLoop_0_4_0 + BeginLoop_0_3_0 + BeginLoop_0_2_0 + BeginLoop_0_2_1 + BeginLoop_0_1_1 + BeginLoop_0_0_1 + BeginLoop_0_0_2 + BeginLoop_0_1_2 + BeginLoop_0_2_2 + BeginLoop_0_3_1 + BeginLoop_0_4_1 + BeginLoop_0_1_3 + BeginLoop_0_2_3 + BeginLoop_0_3_2 + BeginLoop_0_4_2 + BeginLoop_0_0_3 + BeginLoop_0_1_4 + BeginLoop_0_3_4 + BeginLoop_0_2_4 + BeginLoop_0_4_3 + BeginLoop_0_3_3 + BeginLoop_0_0_4 + BeginLoop_0_2_5 + BeginLoop_0_1_5 + BeginLoop_0_3_5 + BeginLoop_0_4_4 + BeginLoop_0_0_5 + WantSection_0_F + BeginLoop_0_4_5 + TestAlone_0_2_1 + TestAlone_0_3_1 + TestAlone_0_1_1 + TestAlone_0_0_1 + TestAlone_0_4_2 + TestAlone_0_3_2 + TestAlone_0_2_2 + TestAlone_0_1_2 + TestAlone_0_0_2 + TestAlone_0_4_1 + TestAlone_0_1_4 + TestAlone_0_0_4 + TestAlone_0_4_3 + TestAlone_0_3_3 + TestAlone_0_2_3 + TestAlone_0_1_3 + TestAlone_0_0_3 + TestAlone_0_4_5 + TestAlone_0_3_5 + TestTurn_0_0 + TestTurn_0_2 + TestTurn_0_1 + TestTurn_0_3 + TestAlone_0_2_4 + TestAlone_0_4_4 + TestAlone_0_3_4 + TestAlone_0_1_5 + TestAlone_0_0_5 + TestAlone_0_2_5 + TestIdentity_0_4_0 + TestIdentity_0_0_1 + TestIdentity_0_1_1 + TestIdentity_0_2_1 + TestIdentity_0_3_1 + TestIdentity_0_4_1 + TestTurn_0_4 + TestIdentity_0_0_0 + TestIdentity_0_1_0 + TestIdentity_0_2_0 + TestIdentity_0_3_0 + TestIdentity_0_2_3 + TestIdentity_0_1_3 + TestIdentity_0_0_3 + TestIdentity_0_4_3 + TestIdentity_0_3_3 + TestIdentity_0_1_2 + TestIdentity_0_0_2 + TestIdentity_0_4_2 + TestIdentity_0_3_2 + TestIdentity_0_2_2 + TestIdentity_0_2_5 + TestIdentity_0_1_5 + TestIdentity_0_3_5 + TestIdentity_0_4_5 + TestIdentity_0_2_4 + TestIdentity_0_0_4 + TestIdentity_0_1_4 + TestIdentity_0_4_4 + TestIdentity_0_0_5 + TestIdentity_0_3_4 + AskForSection_0_3 + CS_0 + AskForSection_0_4 + AskForSection_0_1 + AskForSection_0_0 + AskForSection_0_2 = 1
inv : WantSection_3_F + WantSection_3_T = 1
inv : WantSection_1_F + WantSection_1_T = 1
inv : Turn_0_0 + Turn_0_5 + Turn_0_4 + Turn_0_2 + Turn_0_1 + Turn_0_3 = 1
inv : WantSection_0_T + WantSection_0_F = 1
inv : IsEndLoop_1_0_0 + IsEndLoop_1_1_0 + IsEndLoop_1_2_0 + IsEndLoop_1_3_0 + IsEndLoop_1_4_0 + IsEndLoop_1_0_1 + IsEndLoop_1_1_1 + IsEndLoop_1_2_1 + IsEndLoop_1_3_1 + IsEndLoop_1_4_1 + IsEndLoop_1_1_2 + IsEndLoop_1_0_2 + IsEndLoop_1_2_2 + IsEndLoop_1_3_2 + IsEndLoop_1_0_3 + IsEndLoop_1_4_2 + IsEndLoop_1_1_3 + IsEndLoop_1_2_3 + IsEndLoop_1_4_3 + IsEndLoop_1_3_3 + IsEndLoop_1_0_4 + IsEndLoop_1_2_4 + IsEndLoop_1_3_4 + IsEndLoop_1_1_4 + IsEndLoop_1_0_5 + IsEndLoop_1_4_4 + IsEndLoop_1_3_5 + IsEndLoop_1_1_5 + IsEndLoop_1_2_5 + EndTurn_1_0 + EndTurn_1_1 + IsEndLoop_1_4_5 + EndTurn_1_3 + EndTurn_1_2 + BeginLoop_1_1_0 + BeginLoop_1_0_0 + EndTurn_1_4 + BeginLoop_1_4_0 + BeginLoop_1_3_0 + BeginLoop_1_2_0 + BeginLoop_1_1_1 + BeginLoop_1_0_1 + BeginLoop_1_0_2 + BeginLoop_1_1_2 + BeginLoop_1_2_2 + BeginLoop_1_2_1 + BeginLoop_1_3_1 + BeginLoop_1_4_1 + BeginLoop_1_0_3 + BeginLoop_1_1_3 + BeginLoop_1_2_3 + BeginLoop_1_3_2 + BeginLoop_1_4_2 + BeginLoop_1_1_4 + BeginLoop_1_2_4 + BeginLoop_1_3_3 + BeginLoop_1_0_4 + BeginLoop_1_4_3 + BeginLoop_1_1_5 + BeginLoop_1_3_5 + BeginLoop_1_2_5 + BeginLoop_1_4_4 + BeginLoop_1_3_4 + BeginLoop_1_0_5 + TestAlone_1_1_0 + TestAlone_1_2_0 + WantSection_1_F + TestAlone_1_0_0 + BeginLoop_1_4_5 + TestAlone_1_4_0 + TestAlone_1_3_0 + TestAlone_1_4_2 + TestAlone_1_3_2 + TestAlone_1_2_2 + TestAlone_1_1_2 + TestAlone_1_0_2 + TestAlone_1_1_4 + TestAlone_1_0_4 + TestAlone_1_4_3 + TestAlone_1_3_3 + TestAlone_1_2_3 + TestAlone_1_1_3 + TestAlone_1_0_3 + TestAlone_1_4_5 + TestAlone_1_3_5 + TestTurn_1_0 + TestTurn_1_1 + TestTurn_1_3 + TestTurn_1_2 + TestAlone_1_2_4 + TestAlone_1_4_4 + TestAlone_1_3_4 + TestAlone_1_0_5 + TestAlone_1_2_5 + TestAlone_1_1_5 + TestIdentity_1_4_0 + TestIdentity_1_0_1 + TestIdentity_1_1_1 + TestIdentity_1_2_1 + TestIdentity_1_3_1 + TestTurn_1_4 + TestIdentity_1_0_0 + TestIdentity_1_1_0 + TestIdentity_1_2_0 + TestIdentity_1_3_0 + TestIdentity_1_1_3 + TestIdentity_1_0_3 + TestIdentity_1_4_3 + TestIdentity_1_3_3 + TestIdentity_1_2_3 + TestIdentity_1_1_2 + TestIdentity_1_0_2 + TestIdentity_1_4_1 + TestIdentity_1_4_2 + TestIdentity_1_3_2 + TestIdentity_1_2_2 + TestIdentity_1_2_5 + TestIdentity_1_0_5 + TestIdentity_1_1_5 + TestIdentity_1_4_5 + TestIdentity_1_3_5 + TestIdentity_1_1_4 + TestIdentity_1_2_4 + TestIdentity_1_0_4 + TestIdentity_1_4_4 + TestIdentity_1_3_4 + AskForSection_1_3 + AskForSection_1_4 + AskForSection_1_0 + AskForSection_1_2 + AskForSection_1_1 + CS_1 = 1
inv : IsEndLoop_2_0_0 + IsEndLoop_2_1_0 + IsEndLoop_2_2_0 + IsEndLoop_2_3_0 + IsEndLoop_2_4_0 + IsEndLoop_2_0_1 + IsEndLoop_2_1_1 + IsEndLoop_2_2_1 + IsEndLoop_2_3_1 + IsEndLoop_2_4_1 + IsEndLoop_2_1_2 + IsEndLoop_2_0_2 + IsEndLoop_2_2_2 + IsEndLoop_2_3_2 + IsEndLoop_2_0_3 + IsEndLoop_2_4_2 + IsEndLoop_2_1_3 + IsEndLoop_2_2_3 + IsEndLoop_2_4_3 + IsEndLoop_2_3_3 + IsEndLoop_2_0_4 + IsEndLoop_2_2_4 + IsEndLoop_2_3_4 + IsEndLoop_2_1_4 + IsEndLoop_2_0_5 + IsEndLoop_2_4_4 + IsEndLoop_2_3_5 + IsEndLoop_2_1_5 + IsEndLoop_2_2_5 + EndTurn_2_0 + EndTurn_2_1 + IsEndLoop_2_4_5 + EndTurn_2_3 + EndTurn_2_2 + BeginLoop_2_1_0 + BeginLoop_2_0_0 + EndTurn_2_4 + BeginLoop_2_4_0 + BeginLoop_2_3_0 + BeginLoop_2_2_0 + BeginLoop_2_1_1 + BeginLoop_2_0_1 + BeginLoop_2_0_2 + BeginLoop_2_1_2 + BeginLoop_2_2_2 + BeginLoop_2_2_1 + BeginLoop_2_3_1 + BeginLoop_2_4_1 + BeginLoop_2_0_3 + BeginLoop_2_1_3 + BeginLoop_2_2_3 + BeginLoop_2_3_2 + BeginLoop_2_4_2 + BeginLoop_2_1_4 + BeginLoop_2_2_4 + BeginLoop_2_3_3 + BeginLoop_2_0_4 + BeginLoop_2_4_3 + BeginLoop_2_1_5 + BeginLoop_2_3_5 + BeginLoop_2_2_5 + BeginLoop_2_4_4 + BeginLoop_2_3_4 + BeginLoop_2_0_5 + TestAlone_2_1_0 + WantSection_2_F + TestAlone_2_0_0 + BeginLoop_2_4_5 + TestAlone_2_2_1 + TestAlone_2_3_1 + TestAlone_2_1_1 + TestAlone_2_4_0 + TestAlone_2_0_1 + TestAlone_2_2_0 + TestAlone_2_3_0 + TestAlone_2_4_1 + TestAlone_2_0_4 + TestAlone_2_4_3 + TestAlone_2_3_3 + TestAlone_2_2_3 + TestAlone_2_1_3 + TestAlone_2_0_3 + TestAlone_2_3_5 + TestTurn_2_0 + TestAlone_2_4_5 + TestTurn_2_1 + TestTurn_2_3 + TestTurn_2_2 + TestAlone_2_2_4 + TestAlone_2_1_4 + TestAlone_2_4_4 + TestAlone_2_3_4 + TestAlone_2_0_5 + TestAlone_2_2_5 + TestAlone_2_1_5 + TestIdentity_2_4_0 + TestIdentity_2_0_1 + TestIdentity_2_1_1 + TestIdentity_2_2_1 + TestIdentity_2_3_1 + TestTurn_2_4 + TestIdentity_2_0_0 + TestIdentity_2_1_0 + TestIdentity_2_2_0 + TestIdentity_2_3_0 + TestIdentity_2_1_3 + TestIdentity_2_0_3 + TestIdentity_2_4_3 + TestIdentity_2_3_3 + TestIdentity_2_2_3 + TestIdentity_2_1_2 + TestIdentity_2_0_2 + TestIdentity_2_4_1 + TestIdentity_2_4_2 + TestIdentity_2_3_2 + TestIdentity_2_2_2 + TestIdentity_2_2_5 + TestIdentity_2_0_5 + TestIdentity_2_1_5 + TestIdentity_2_4_5 + TestIdentity_2_3_5 + TestIdentity_2_1_4 + TestIdentity_2_2_4 + TestIdentity_2_0_4 + TestIdentity_2_4_4 + TestIdentity_2_3_4 + AskForSection_2_3 + AskForSection_2_4 + AskForSection_2_0 + AskForSection_2_2 + AskForSection_2_1 + CS_2 = 1
inv : Turn_3_4 + Turn_3_5 + Turn_3_1 + Turn_3_0 + Turn_3_3 + Turn_3_2 = 1
inv : WantSection_5_F + WantSection_5_T = 1
inv : WantSection_4_F + WantSection_4_T = 1
inv : IsEndLoop_3_0_0 + IsEndLoop_3_1_0 + IsEndLoop_3_2_0 + IsEndLoop_3_3_0 + IsEndLoop_3_4_0 + IsEndLoop_3_0_1 + IsEndLoop_3_1_1 + IsEndLoop_3_2_1 + IsEndLoop_3_3_1 + IsEndLoop_3_4_1 + IsEndLoop_3_0_2 + IsEndLoop_3_2_2 + IsEndLoop_3_1_2 + IsEndLoop_3_3_2 + IsEndLoop_3_4_2 + IsEndLoop_3_1_3 + IsEndLoop_3_0_3 + IsEndLoop_3_2_3 + IsEndLoop_3_3_3 + IsEndLoop_3_0_4 + IsEndLoop_3_4_3 + IsEndLoop_3_2_4 + IsEndLoop_3_1_4 + IsEndLoop_3_0_5 + IsEndLoop_3_3_4 + IsEndLoop_3_4_4 + IsEndLoop_3_2_5 + IsEndLoop_3_3_5 + IsEndLoop_3_1_5 + EndTurn_3_0 + IsEndLoop_3_4_5 + EndTurn_3_3 + EndTurn_3_2 + EndTurn_3_1 + BeginLoop_3_1_0 + BeginLoop_3_0_0 + EndTurn_3_4 + BeginLoop_3_3_0 + BeginLoop_3_2_0 + BeginLoop_3_1_1 + BeginLoop_3_0_1 + BeginLoop_3_4_0 + BeginLoop_3_0_2 + BeginLoop_3_1_2 + BeginLoop_3_2_1 + BeginLoop_3_3_1 + BeginLoop_3_4_1 + BeginLoop_3_0_3 + BeginLoop_3_1_3 + BeginLoop_3_2_3 + BeginLoop_3_2_2 + BeginLoop_3_3_2 + BeginLoop_3_4_2 + BeginLoop_3_1_4 + BeginLoop_3_0_4 + BeginLoop_3_2_4 + BeginLoop_3_3_3 + BeginLoop_3_4_3 + BeginLoop_3_1_5 + BeginLoop_3_2_5 + BeginLoop_3_3_4 + BeginLoop_3_0_5 + BeginLoop_3_4_4 + TestAlone_3_1_0 + WantSection_3_F + TestAlone_3_0_0 + BeginLoop_3_3_5 + BeginLoop_3_4_5 + TestAlone_3_2_1 + TestAlone_3_3_1 + TestAlone_3_0_1 + TestAlone_3_1_1 + TestAlone_3_4_0 + TestAlone_3_2_0 + TestAlone_3_3_0 + TestAlone_3_4_2 + TestAlone_3_3_2 + TestAlone_3_2_2 + TestAlone_3_1_2 + TestAlone_3_0_2 + TestAlone_3_4_1 + TestAlone_3_0_4 + TestAlone_3_3_5 + TestTurn_3_0 + TestAlone_3_4_5 + TestTurn_3_1 + TestTurn_3_2 + TestAlone_3_2_4 + TestAlone_3_1_4 + TestAlone_3_3_4 + TestAlone_3_0_5 + TestAlone_3_4_4 + TestAlone_3_2_5 + TestAlone_3_1_5 + TestIdentity_3_4_0 + TestIdentity_3_0_1 + TestIdentity_3_1_1 + TestIdentity_3_2_1 + TestIdentity_3_3_1 + TestTurn_3_3 + TestTurn_3_4 + TestIdentity_3_0_0 + TestIdentity_3_1_0 + TestIdentity_3_2_0 + TestIdentity_3_3_0 + TestIdentity_3_1_3 + TestIdentity_3_0_3 + TestIdentity_3_4_2 + TestIdentity_3_4_3 + TestIdentity_3_3_3 + TestIdentity_3_2_3 + TestIdentity_3_1_2 + TestIdentity_3_0_2 + TestIdentity_3_4_1 + TestIdentity_3_3_2 + TestIdentity_3_2_2 + TestIdentity_3_1_5 + TestIdentity_3_2_5 + TestIdentity_3_0_5 + TestIdentity_3_4_5 + TestIdentity_3_3_5 + TestIdentity_3_1_4 + TestIdentity_3_0_4 + TestIdentity_3_4_4 + TestIdentity_3_2_4 + TestIdentity_3_3_4 + AskForSection_3_3 + AskForSection_3_2 + AskForSection_3_4 + AskForSection_3_0 + AskForSection_3_1 + CS_3 = 1
inv : WantSection_2_F + WantSection_2_T = 1
Total of 17 invariants.
[2021-05-14 20:30:12] [INFO ] Computed 17 place invariants in 18 ms
[2021-05-14 20:30:13] [INFO ] BMC solution for property Peterson-PT-5-ReachabilityCardinality-02(UNSAT) depth K=2 took 1079 ms
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 8
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :8 after 11
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :11 after 12
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :12 after 13
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :13 after 16
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :16 after 21
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :21 after 73
Compilation finished in 10589 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin3709483412511303787]
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :73 after 195
[2021-05-14 20:30:14] [INFO ] Proved 828 variables to be positive in 1416 ms
Link finished in 90 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, -p, --pins-guards, --when, -i, PetersonPT5ReachabilityCardinality02==true], workingDir=/tmp/ltsmin3709483412511303787]
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :195 after 912
[2021-05-14 20:30:14] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-5-ReachabilityCardinality-02
[2021-05-14 20:30:14] [INFO ] KInduction solution for property Peterson-PT-5-ReachabilityCardinality-02(SAT) depth K=0 took 114 ms
[2021-05-14 20:30:14] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-5-ReachabilityCardinality-05
[2021-05-14 20:30:14] [INFO ] KInduction solution for property Peterson-PT-5-ReachabilityCardinality-05(SAT) depth K=0 took 200 ms
[2021-05-14 20:30:14] [INFO ] BMC solution for property Peterson-PT-5-ReachabilityCardinality-05(UNSAT) depth K=2 took 952 ms
[2021-05-14 20:30:14] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-5-ReachabilityCardinality-09
[2021-05-14 20:30:14] [INFO ] KInduction solution for property Peterson-PT-5-ReachabilityCardinality-09(SAT) depth K=0 took 208 ms
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :912 after 2935
[2021-05-14 20:30:15] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-5-ReachabilityCardinality-15
[2021-05-14 20:30:15] [INFO ] KInduction solution for property Peterson-PT-5-ReachabilityCardinality-15(SAT) depth K=0 took 1095 ms
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :2935 after 6499
[2021-05-14 20:30:17] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-5-ReachabilityCardinality-02
[2021-05-14 20:30:17] [INFO ] KInduction solution for property Peterson-PT-5-ReachabilityCardinality-02(SAT) depth K=1 took 1505 ms
[2021-05-14 20:30:17] [INFO ] BMC solution for property Peterson-PT-5-ReachabilityCardinality-09(UNSAT) depth K=2 took 2985 ms
[2021-05-14 20:30:18] [INFO ] BMC solution for property Peterson-PT-5-ReachabilityCardinality-15(UNSAT) depth K=2 took 794 ms
[2021-05-14 20:30:19] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-5-ReachabilityCardinality-05
[2021-05-14 20:30:19] [INFO ] KInduction solution for property Peterson-PT-5-ReachabilityCardinality-05(SAT) depth K=1 took 1540 ms
[2021-05-14 20:30:20] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-5-ReachabilityCardinality-09
[2021-05-14 20:30:20] [INFO ] KInduction solution for property Peterson-PT-5-ReachabilityCardinality-09(SAT) depth K=1 took 1127 ms
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :6499 after 27114
[2021-05-14 20:30:24] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-5-ReachabilityCardinality-15
[2021-05-14 20:30:24] [INFO ] KInduction solution for property Peterson-PT-5-ReachabilityCardinality-15(SAT) depth K=1 took 4059 ms
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :27114 after 88482
[2021-05-14 20:30:36] [INFO ] BMC solution for property Peterson-PT-5-ReachabilityCardinality-02(UNSAT) depth K=3 took 17508 ms
[2021-05-14 20:30:51] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-5-ReachabilityCardinality-02
[2021-05-14 20:30:51] [INFO ] KInduction solution for property Peterson-PT-5-ReachabilityCardinality-02(SAT) depth K=2 took 27567 ms
SDD proceeding with computation,4 properties remain. new max is 65536
SDD size :88482 after 265750
[2021-05-14 20:31:12] [INFO ] BMC solution for property Peterson-PT-5-ReachabilityCardinality-05(UNSAT) depth K=3 took 36763 ms
SDD proceeding with computation,4 properties remain. new max is 131072
SDD size :265750 after 607832
[2021-05-14 20:33:09] [INFO ] BMC solution for property Peterson-PT-5-ReachabilityCardinality-09(UNSAT) depth K=3 took 116372 ms
[2021-05-14 20:33:27] [INFO ] BMC solution for property Peterson-PT-5-ReachabilityCardinality-15(UNSAT) depth K=3 took 18527 ms
SDD proceeding with computation,4 properties remain. new max is 262144
SDD size :607832 after 3.30856e+06
SDD proceeding with computation,4 properties remain. new max is 524288
SDD size :3.30856e+06 after 1.07497e+07
WARNING : LTSmin timed out (>900 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, -p, --pins-guards, --when, -i, PetersonPT5ReachabilityCardinality02==true], workingDir=/tmp/ltsmin3709483412511303787]
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, -p, --pins-guards, --when, -i, PetersonPT5ReachabilityCardinality05==true], workingDir=/tmp/ltsmin3709483412511303787]
SDD proceeding with computation,4 properties remain. new max is 1048576
SDD size :1.07497e+07 after 2.02524e+07
Detected timeout of ITS tools.
[2021-05-14 20:54:25] [INFO ] Applying decomposition
[2021-05-14 20:54:25] [INFO ] Flatten gal took : 127 ms
[2021-05-14 20:54:25] [INFO ] Decomposing Gal with order
[2021-05-14 20:54:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 20:54:26] [INFO ] Removed a total of 366 redundant transitions.
[2021-05-14 20:54:26] [INFO ] Flatten gal took : 1353 ms
[2021-05-14 20:54:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 360 labels/synchronizations in 138 ms.
[2021-05-14 20:54:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14105398004736884668.gal : 5 ms
[2021-05-14 20:54:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15872265249883624977.prop : 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality14105398004736884668.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality15872265249883624977.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality14105398004736884668.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality15872265249883624977.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality15872265249883624977.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :4 after 11
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :11 after 12
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :12 after 13
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :13 after 15
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :15 after 20
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :20 after 46
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :46 after 169
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :169 after 878
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :878 after 2520
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :2520 after 6703
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :6703 after 24020
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :24020 after 93116
SDD proceeding with computation,4 properties remain. new max is 65536
SDD size :93116 after 286620
SDD proceeding with computation,4 properties remain. new max is 131072
SDD size :286620 after 562772
SDD proceeding with computation,4 properties remain. new max is 262144
SDD size :562772 after 2.41573e+06
WARNING : LTSmin timed out (>900 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, -p, --pins-guards, --when, -i, PetersonPT5ReachabilityCardinality05==true], workingDir=/tmp/ltsmin3709483412511303787]
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, -p, --pins-guards, --when, -i, PetersonPT5ReachabilityCardinality09==true], workingDir=/tmp/ltsmin3709483412511303787]
SDD proceeding with computation,4 properties remain. new max is 524288
SDD size :2.41573e+06 after 1.00333e+07
SDD proceeding with computation,4 properties remain. new max is 1048576
SDD size :1.00333e+07 after 1.97775e+07
WARNING : LTSmin timed out (>900 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, -p, --pins-guards, --when, -i, PetersonPT5ReachabilityCardinality09==true], workingDir=/tmp/ltsmin3709483412511303787]
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, -p, --pins-guards, --when, -i, PetersonPT5ReachabilityCardinality15==true], workingDir=/tmp/ltsmin3709483412511303787]
[2021-05-14 21:15:57] [INFO ] BMC solution for property Peterson-PT-5-ReachabilityCardinality-02(UNSAT) depth K=4 took 2549586 ms

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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="Peterson-PT-5"
export BK_EXAMINATION="ReachabilityCardinality"
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 Peterson-PT-5, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r140-tall-162089128200630"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-5.tgz
mv Peterson-PT-5 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;