Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r089-tall-165260117600074.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is DoubleExponent-PT-010, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r089-tall-165260117600074
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.9K Apr 29 13:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 29 13:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 29 13:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 29 13:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K May 9 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.2K Apr 29 13:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 55K Apr 29 13:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Apr 29 13:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 29 13:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 169K May 10 09:33 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 DoubleExponent-PT-010-ReachabilityCardinality-00
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-01
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-02
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-03
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-04
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-05
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-06
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-07
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-08
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-09
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-10
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-11
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-12
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-13
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-14
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1655068514886

Running Version 0
[2022-06-12 21:15:16] [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]
[2022-06-12 21:15:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 21:15:16] [INFO ] Load time of PNML (sax parser for PT used): 149 ms
[2022-06-12 21:15:16] [INFO ] Transformed 534 places.
[2022-06-12 21:15:16] [INFO ] Transformed 498 transitions.
[2022-06-12 21:15:16] [INFO ] Parsed PT model containing 534 places and 498 transitions in 189 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 333 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 25 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 24 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 27 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 24 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Probabilistic random walk after 1000001 steps, saw 500065 distinct states, run finished after 6592 ms. (steps per millisecond=151 ) properties seen :{}
Running SMT prover for 16 properties.
// Phase 1: matrix 498 rows 534 cols
[2022-06-12 21:15:23] [INFO ] Computed 54 place invariants in 68 ms
[2022-06-12 21:15:23] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-06-12 21:15:23] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 23 ms returned sat
[2022-06-12 21:15:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:15:23] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2022-06-12 21:15:23] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:15:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2022-06-12 21:15:24] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 17 ms returned sat
[2022-06-12 21:15:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:15:24] [INFO ] [Nat]Absence check using state equation in 247 ms returned sat
[2022-06-12 21:15:24] [INFO ] Deduced a trap composed of 208 places in 170 ms of which 3 ms to minimize.
[2022-06-12 21:15:24] [INFO ] Deduced a trap composed of 77 places in 161 ms of which 1 ms to minimize.
[2022-06-12 21:15:24] [INFO ] Deduced a trap composed of 203 places in 127 ms of which 1 ms to minimize.
[2022-06-12 21:15:24] [INFO ] Deduced a trap composed of 183 places in 120 ms of which 1 ms to minimize.
[2022-06-12 21:15:25] [INFO ] Deduced a trap composed of 207 places in 127 ms of which 0 ms to minimize.
[2022-06-12 21:15:25] [INFO ] Deduced a trap composed of 65 places in 120 ms of which 1 ms to minimize.
[2022-06-12 21:15:25] [INFO ] Deduced a trap composed of 188 places in 122 ms of which 0 ms to minimize.
[2022-06-12 21:15:25] [INFO ] Deduced a trap composed of 55 places in 125 ms of which 0 ms to minimize.
[2022-06-12 21:15:25] [INFO ] Deduced a trap composed of 41 places in 150 ms of which 1 ms to minimize.
[2022-06-12 21:15:25] [INFO ] Deduced a trap composed of 101 places in 114 ms of which 1 ms to minimize.
[2022-06-12 21:15:25] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1677 ms
[2022-06-12 21:15:25] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 30 ms.
[2022-06-12 21:15:28] [INFO ] Added : 315 causal constraints over 63 iterations in 2995 ms. Result :unknown
[2022-06-12 21:15:29] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned unsat
[2022-06-12 21:15:29] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2022-06-12 21:15:29] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 21 ms returned sat
[2022-06-12 21:15:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:15:29] [INFO ] [Real]Absence check using state equation in 238 ms returned sat
[2022-06-12 21:15:29] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:15:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2022-06-12 21:15:29] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 17 ms returned sat
[2022-06-12 21:15:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:15:29] [INFO ] [Nat]Absence check using state equation in 254 ms returned sat
[2022-06-12 21:15:29] [INFO ] Deduced a trap composed of 72 places in 74 ms of which 1 ms to minimize.
[2022-06-12 21:15:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 102 ms
[2022-06-12 21:15:29] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-12 21:15:29] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 15 ms returned unsat
[2022-06-12 21:15:29] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned unsat
[2022-06-12 21:15:30] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned unsat
[2022-06-12 21:15:30] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2022-06-12 21:15:30] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 16 ms returned sat
[2022-06-12 21:15:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:15:30] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2022-06-12 21:15:30] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:15:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2022-06-12 21:15:30] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 20 ms returned sat
[2022-06-12 21:15:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:15:30] [INFO ] [Nat]Absence check using state equation in 196 ms returned sat
[2022-06-12 21:15:30] [INFO ] Deduced a trap composed of 206 places in 126 ms of which 0 ms to minimize.
[2022-06-12 21:15:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 206 ms
[2022-06-12 21:15:30] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 30 ms.
[2022-06-12 21:15:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
[2022-06-12 21:15:35] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned unsat
[2022-06-12 21:15:35] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-12 21:15:35] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 15 ms returned sat
[2022-06-12 21:15:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:15:35] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2022-06-12 21:15:35] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:15:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-12 21:15:35] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 14 ms returned sat
[2022-06-12 21:15:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:15:36] [INFO ] [Nat]Absence check using state equation in 259 ms returned sat
[2022-06-12 21:15:36] [INFO ] Deduced a trap composed of 108 places in 74 ms of which 1 ms to minimize.
[2022-06-12 21:15:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 114 ms
[2022-06-12 21:15:36] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-12 21:15:36] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 19 ms returned sat
[2022-06-12 21:15:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:15:36] [INFO ] [Real]Absence check using state equation in 270 ms returned sat
[2022-06-12 21:15:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:15:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2022-06-12 21:15:36] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 24 ms returned sat
[2022-06-12 21:15:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:15:36] [INFO ] [Nat]Absence check using state equation in 250 ms returned sat
[2022-06-12 21:15:37] [INFO ] Deduced a trap composed of 82 places in 89 ms of which 2 ms to minimize.
[2022-06-12 21:15:37] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 1 ms to minimize.
[2022-06-12 21:15:37] [INFO ] Deduced a trap composed of 61 places in 104 ms of which 0 ms to minimize.
[2022-06-12 21:15:37] [INFO ] Deduced a trap composed of 67 places in 127 ms of which 1 ms to minimize.
[2022-06-12 21:15:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 542 ms
[2022-06-12 21:15:37] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 25 ms.
[2022-06-12 21:15:41] [INFO ] Added : 391 causal constraints over 79 iterations in 4128 ms. Result :unknown
[2022-06-12 21:15:41] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned unsat
[2022-06-12 21:15:41] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2022-06-12 21:15:41] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 20 ms returned unsat
[2022-06-12 21:15:41] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2022-06-12 21:15:41] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 17 ms returned unsat
[2022-06-12 21:15:41] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-12 21:15:41] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 15 ms returned sat
[2022-06-12 21:15:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:15:42] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2022-06-12 21:15:42] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:15:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-12 21:15:42] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 16 ms returned sat
[2022-06-12 21:15:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:15:42] [INFO ] [Nat]Absence check using state equation in 249 ms returned sat
[2022-06-12 21:15:42] [INFO ] Deduced a trap composed of 191 places in 116 ms of which 0 ms to minimize.
[2022-06-12 21:15:42] [INFO ] Deduced a trap composed of 121 places in 58 ms of which 0 ms to minimize.
[2022-06-12 21:15:42] [INFO ] Deduced a trap composed of 101 places in 66 ms of which 0 ms to minimize.
[2022-06-12 21:15:42] [INFO ] Deduced a trap composed of 183 places in 131 ms of which 1 ms to minimize.
[2022-06-12 21:15:43] [INFO ] Deduced a trap composed of 121 places in 126 ms of which 1 ms to minimize.
[2022-06-12 21:15:43] [INFO ] Deduced a trap composed of 159 places in 72 ms of which 1 ms to minimize.
[2022-06-12 21:15:43] [INFO ] Deduced a trap composed of 129 places in 64 ms of which 0 ms to minimize.
[2022-06-12 21:15:43] [INFO ] Deduced a trap composed of 131 places in 58 ms of which 0 ms to minimize.
[2022-06-12 21:15:43] [INFO ] Deduced a trap composed of 127 places in 51 ms of which 0 ms to minimize.
[2022-06-12 21:15:43] [INFO ] Deduced a trap composed of 181 places in 106 ms of which 0 ms to minimize.
[2022-06-12 21:15:43] [INFO ] Deduced a trap composed of 53 places in 125 ms of which 1 ms to minimize.
[2022-06-12 21:15:43] [INFO ] Deduced a trap composed of 222 places in 121 ms of which 0 ms to minimize.
[2022-06-12 21:15:44] [INFO ] Deduced a trap composed of 193 places in 122 ms of which 1 ms to minimize.
[2022-06-12 21:15:44] [INFO ] Deduced a trap composed of 221 places in 109 ms of which 1 ms to minimize.
[2022-06-12 21:15:44] [INFO ] Deduced a trap composed of 197 places in 108 ms of which 0 ms to minimize.
[2022-06-12 21:15:44] [INFO ] Deduced a trap composed of 223 places in 110 ms of which 1 ms to minimize.
[2022-06-12 21:15:44] [INFO ] Deduced a trap composed of 245 places in 107 ms of which 1 ms to minimize.
[2022-06-12 21:15:44] [INFO ] Deduced a trap composed of 31 places in 126 ms of which 4 ms to minimize.
[2022-06-12 21:15:44] [INFO ] Deduced a trap composed of 205 places in 114 ms of which 0 ms to minimize.
[2022-06-12 21:15:45] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 1 ms to minimize.
[2022-06-12 21:15:45] [INFO ] Deduced a trap composed of 65 places in 108 ms of which 0 ms to minimize.
[2022-06-12 21:15:45] [INFO ] Deduced a trap composed of 126 places in 113 ms of which 1 ms to minimize.
[2022-06-12 21:15:45] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 2976 ms
[2022-06-12 21:15:45] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 25 ms.
[2022-06-12 21:15:47] [INFO ] Added : 45 causal constraints over 9 iterations in 1708 ms. Result :unknown
[2022-06-12 21:15:47] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned unsat
[2022-06-12 21:15:47] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned unsat
FORMULA DoubleExponent-PT-010-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-010-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-010-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-010-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-010-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-010-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-010-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-010-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-010-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-010-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-010-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-010-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 16 Parikh solutions to 4 different solutions.
Incomplete Parikh walk after 2167000 steps, including 75779 resets, run finished after 2204 ms. (steps per millisecond=983 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 890500 steps, including 33001 resets, run finished after 839 ms. (steps per millisecond=1061 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 2522600 steps, including 88191 resets, run finished after 2373 ms. (steps per millisecond=1063 ) properties (out of 4) seen :0 could not realise parikh vector
Support contains 8 out of 534 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 534/534 places, 498/498 transitions.
Graph (complete) has 906 edges and 534 vertex of which 528 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 120 rules applied. Total rules applied 121 place count 527 transition count 379
Reduce places removed 117 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 118 rules applied. Total rules applied 239 place count 410 transition count 378
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 240 place count 409 transition count 378
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 240 place count 409 transition count 358
Deduced a syphon composed of 20 places in 7 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 280 place count 389 transition count 358
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 2 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 458 place count 300 transition count 269
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 494 place count 282 transition count 269
Free-agglomeration rule (complex) applied 38 times.
Iterating global reduction 3 with 38 rules applied. Total rules applied 532 place count 282 transition count 231
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 3 with 38 rules applied. Total rules applied 570 place count 244 transition count 231
Partial Free-agglomeration rule applied 36 times.
Drop transitions removed 36 transitions
Iterating global reduction 4 with 36 rules applied. Total rules applied 606 place count 244 transition count 231
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 607 place count 243 transition count 230
Applied a total of 607 rules in 133 ms. Remains 243 /534 variables (removed 291) and now considering 230/498 (removed 268) transitions.
Finished structural reductions, in 1 iterations. Remains : 243/534 places, 230/498 transitions.
[2022-06-12 21:15:52] [INFO ] Flatten gal took : 63 ms
[2022-06-12 21:15:52] [INFO ] Flatten gal took : 23 ms
[2022-06-12 21:15:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18335952932082192574.gal : 14 ms
[2022-06-12 21:15:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1724465049985541336.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/ReachabilityCardinality18335952932082192574.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality1724465049985541336.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/ReachabilityCardinality18335952932082192574.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality1724465049985541336.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality1724465049985541336.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 7
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :7 after 9
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :9 after 17
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :17 after 30
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :30 after 43
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :43 after 79
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :79 after 202
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :202 after 513
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :513 after 1267
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :1267 after 15429
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :15429 after 71026
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :71026 after 197870
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :197870 after 457940
SDD proceeding with computation,4 properties remain. new max is 65536
SDD size :457940 after 1.00104e+06
Detected timeout of ITS tools.
[2022-06-12 21:16:08] [INFO ] Flatten gal took : 22 ms
[2022-06-12 21:16:08] [INFO ] Applying decomposition
[2022-06-12 21:16:08] [INFO ] Flatten gal took : 20 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/graph2615851395706115843.txt, -o, /tmp/graph2615851395706115843.bin, -w, /tmp/graph2615851395706115843.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/graph2615851395706115843.bin, -l, -1, -v, -w, /tmp/graph2615851395706115843.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:16:08] [INFO ] Decomposing Gal with order
[2022-06-12 21:16:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:16:08] [INFO ] Removed a total of 146 redundant transitions.
[2022-06-12 21:16:08] [INFO ] Flatten gal took : 60 ms
[2022-06-12 21:16:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 94 labels/synchronizations in 15 ms.
[2022-06-12 21:16:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3201039722401021229.gal : 11 ms
[2022-06-12 21:16:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3399387196550802733.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality3201039722401021229.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality3399387196550802733.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/ReachabilityCardinality3201039722401021229.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality3399387196550802733.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality3399387196550802733.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 5
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :5 after 9
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :9 after 17
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :17 after 32
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :32 after 47
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :47 after 95
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :95 after 206
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :206 after 657
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :657 after 1530
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :1530 after 31934
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :31934 after 257437
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :257437 after 858880
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12489541069439217261
[2022-06-12 21:16:23] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12489541069439217261
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/ltsmin12489541069439217261]
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/ltsmin12489541069439217261] 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/ltsmin12489541069439217261] 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 128338 resets, run finished after 1014 ms. (steps per millisecond=986 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85067 resets, run finished after 697 ms. (steps per millisecond=1434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84712 resets, run finished after 659 ms. (steps per millisecond=1517 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84716 resets, run finished after 657 ms. (steps per millisecond=1522 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84838 resets, run finished after 656 ms. (steps per millisecond=1524 ) properties (out of 4) seen :0
Probably explored full state space saw : 178958 states, properties seen :{}
Probabilistic random walk after 357919 steps, saw 178958 distinct states, run finished after 1436 ms. (steps per millisecond=249 ) properties seen :{}
Interrupted probabilistic random walk after 6290967 steps, run timeout after 30074 ms. (steps per millisecond=209 ) properties seen :{}
Exhaustive walk after 6290967 steps, saw 3145729 distinct states, run finished after 30077 ms. (steps per millisecond=209 ) properties seen :{}
Running SMT prover for 4 properties.
// Phase 1: matrix 230 rows 243 cols
[2022-06-12 21:16:59] [INFO ] Computed 50 place invariants in 238 ms
[2022-06-12 21:17:00] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-06-12 21:17:00] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 11 ms returned sat
[2022-06-12 21:17:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:17:00] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2022-06-12 21:17:00] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:17:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-06-12 21:17:00] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 10 ms returned sat
[2022-06-12 21:17:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:17:00] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2022-06-12 21:17:00] [INFO ] State equation strengthened by 34 read => feed constraints.
[2022-06-12 21:17:00] [INFO ] [Nat]Added 34 Read/Feed constraints in 43 ms returned sat
[2022-06-12 21:17:00] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2022-06-12 21:17:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2022-06-12 21:17:00] [INFO ] Computed and/alt/rep : 210/1192/210 causal constraints (skipped 19 transitions) in 13 ms.
[2022-06-12 21:17:02] [INFO ] Deduced a trap composed of 71 places in 62 ms of which 0 ms to minimize.
[2022-06-12 21:17:02] [INFO ] Deduced a trap composed of 77 places in 66 ms of which 1 ms to minimize.
[2022-06-12 21:17:02] [INFO ] Deduced a trap composed of 57 places in 89 ms of which 1 ms to minimize.
[2022-06-12 21:17:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 312 ms
[2022-06-12 21:17:02] [INFO ] Added : 175 causal constraints over 36 iterations in 1993 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-06-12 21:17:02] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-06-12 21:17:02] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 10 ms returned sat
[2022-06-12 21:17:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:17:02] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2022-06-12 21:17:02] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:17:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-06-12 21:17:02] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 16 ms returned sat
[2022-06-12 21:17:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:17:02] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2022-06-12 21:17:02] [INFO ] [Nat]Added 34 Read/Feed constraints in 15 ms returned sat
[2022-06-12 21:17:02] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2022-06-12 21:17:02] [INFO ] Deduced a trap composed of 39 places in 27 ms of which 0 ms to minimize.
[2022-06-12 21:17:02] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2022-06-12 21:17:03] [INFO ] Deduced a trap composed of 42 places in 175 ms of which 1 ms to minimize.
[2022-06-12 21:17:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 343 ms
[2022-06-12 21:17:03] [INFO ] Computed and/alt/rep : 210/1192/210 causal constraints (skipped 19 transitions) in 17 ms.
[2022-06-12 21:17:05] [INFO ] Added : 201 causal constraints over 41 iterations in 2122 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
[2022-06-12 21:17:05] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-12 21:17:05] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 10 ms returned sat
[2022-06-12 21:17:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:17:05] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2022-06-12 21:17:05] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:17:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-12 21:17:05] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 10 ms returned sat
[2022-06-12 21:17:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:17:05] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2022-06-12 21:17:05] [INFO ] [Nat]Added 34 Read/Feed constraints in 17 ms returned sat
[2022-06-12 21:17:05] [INFO ] Deduced a trap composed of 60 places in 42 ms of which 0 ms to minimize.
[2022-06-12 21:17:05] [INFO ] Deduced a trap composed of 63 places in 34 ms of which 1 ms to minimize.
[2022-06-12 21:17:05] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2022-06-12 21:17:05] [INFO ] Deduced a trap composed of 57 places in 30 ms of which 1 ms to minimize.
[2022-06-12 21:17:05] [INFO ] Deduced a trap composed of 63 places in 29 ms of which 0 ms to minimize.
[2022-06-12 21:17:05] [INFO ] Deduced a trap composed of 53 places in 34 ms of which 1 ms to minimize.
[2022-06-12 21:17:05] [INFO ] Deduced a trap composed of 60 places in 38 ms of which 1 ms to minimize.
[2022-06-12 21:17:05] [INFO ] Deduced a trap composed of 62 places in 28 ms of which 0 ms to minimize.
[2022-06-12 21:17:05] [INFO ] Deduced a trap composed of 56 places in 35 ms of which 0 ms to minimize.
[2022-06-12 21:17:06] [INFO ] Deduced a trap composed of 63 places in 36 ms of which 0 ms to minimize.
[2022-06-12 21:17:06] [INFO ] Deduced a trap composed of 65 places in 32 ms of which 0 ms to minimize.
[2022-06-12 21:17:06] [INFO ] Deduced a trap composed of 62 places in 31 ms of which 0 ms to minimize.
[2022-06-12 21:17:06] [INFO ] Deduced a trap composed of 65 places in 34 ms of which 0 ms to minimize.
[2022-06-12 21:17:06] [INFO ] Deduced a trap composed of 62 places in 44 ms of which 1 ms to minimize.
[2022-06-12 21:17:06] [INFO ] Deduced a trap composed of 68 places in 31 ms of which 0 ms to minimize.
[2022-06-12 21:17:06] [INFO ] Deduced a trap composed of 68 places in 29 ms of which 0 ms to minimize.
[2022-06-12 21:17:06] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 0 ms to minimize.
[2022-06-12 21:17:06] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 764 ms
[2022-06-12 21:17:06] [INFO ] Computed and/alt/rep : 210/1192/210 causal constraints (skipped 19 transitions) in 12 ms.
[2022-06-12 21:17:07] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 0 ms to minimize.
[2022-06-12 21:17:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2022-06-12 21:17:07] [INFO ] Added : 120 causal constraints over 24 iterations in 1171 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-06-12 21:17:07] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-12 21:17:07] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 12 ms returned sat
[2022-06-12 21:17:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:17:07] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2022-06-12 21:17:07] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:17:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-12 21:17:07] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 10 ms returned sat
[2022-06-12 21:17:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:17:07] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2022-06-12 21:17:07] [INFO ] [Nat]Added 34 Read/Feed constraints in 23 ms returned sat
[2022-06-12 21:17:07] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 0 ms to minimize.
[2022-06-12 21:17:07] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2022-06-12 21:17:07] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 0 ms to minimize.
[2022-06-12 21:17:07] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2022-06-12 21:17:08] [INFO ] Deduced a trap composed of 29 places in 16 ms of which 1 ms to minimize.
[2022-06-12 21:17:08] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 263 ms
[2022-06-12 21:17:08] [INFO ] Computed and/alt/rep : 210/1192/210 causal constraints (skipped 19 transitions) in 12 ms.
[2022-06-12 21:17:10] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2022-06-12 21:17:10] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2022-06-12 21:17:10] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2022-06-12 21:17:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 214 ms
[2022-06-12 21:17:10] [INFO ] Added : 207 causal constraints over 42 iterations in 2312 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 12 ms.
Incomplete Parikh walk after 359200 steps, including 55769 resets, run finished after 393 ms. (steps per millisecond=913 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 8598800 steps, including 1333359 resets, run finished after 9074 ms. (steps per millisecond=947 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 207000 steps, including 30237 resets, run finished after 236 ms. (steps per millisecond=877 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 14512500 steps, including 2105256 resets, run finished after 14800 ms. (steps per millisecond=980 ) properties (out of 4) seen :0 could not realise parikh vector
Support contains 8 out of 243 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 243/243 places, 230/230 transitions.
Applied a total of 0 rules in 21 ms. Remains 243 /243 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 243/243 places, 230/230 transitions.
Starting structural reductions, iteration 0 : 243/243 places, 230/230 transitions.
Applied a total of 0 rules in 9 ms. Remains 243 /243 variables (removed 0) and now considering 230/230 (removed 0) transitions.
// Phase 1: matrix 230 rows 243 cols
[2022-06-12 21:17:34] [INFO ] Computed 50 place invariants in 29 ms
[2022-06-12 21:17:35] [INFO ] Implicit Places using invariants in 227 ms returned [20, 26, 46, 51, 78, 98, 104, 128, 133, 155, 160, 181, 187, 194, 202, 209, 234, 240]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 232 ms to find 18 implicit places.
[2022-06-12 21:17:35] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 230 rows 225 cols
[2022-06-12 21:17:35] [INFO ] Computed 33 place invariants in 15 ms
[2022-06-12 21:17:35] [INFO ] Dead Transitions using invariants and state equation in 121 ms returned []
Starting structural reductions, iteration 1 : 225/243 places, 230/230 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 224 transition count 229
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 8 place count 224 transition count 223
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 14 place count 218 transition count 223
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 18 place count 218 transition count 223
Applied a total of 18 rules in 28 ms. Remains 218 /225 variables (removed 7) and now considering 223/230 (removed 7) transitions.
// Phase 1: matrix 223 rows 218 cols
[2022-06-12 21:17:35] [INFO ] Computed 33 place invariants in 9 ms
[2022-06-12 21:17:35] [INFO ] Implicit Places using invariants in 130 ms returned []
// Phase 1: matrix 223 rows 218 cols
[2022-06-12 21:17:35] [INFO ] Computed 33 place invariants in 16 ms
[2022-06-12 21:17:35] [INFO ] State equation strengthened by 34 read => feed constraints.
[2022-06-12 21:17:36] [INFO ] Implicit Places using invariants and state equation in 673 ms returned []
Implicit Place search using SMT with State Equation took 805 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 218/243 places, 223/230 transitions.
[2022-06-12 21:17:36] [INFO ] Flatten gal took : 19 ms
[2022-06-12 21:17:36] [INFO ] Flatten gal took : 16 ms
[2022-06-12 21:17:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13958965241533315373.gal : 3 ms
[2022-06-12 21:17:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8447274809359818923.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality13958965241533315373.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality8447274809359818923.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/ReachabilityCardinality13958965241533315373.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality8447274809359818923.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality8447274809359818923.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 6
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :6 after 8
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :8 after 14
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :14 after 27
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :27 after 40
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :40 after 139
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :139 after 284
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :284 after 834
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :834 after 2181
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :2181 after 12136
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :12136 after 35780
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :35780 after 101851
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :101851 after 238204
SDD proceeding with computation,4 properties remain. new max is 65536
SDD size :238204 after 525536
Detected timeout of ITS tools.
[2022-06-12 21:17:51] [INFO ] Flatten gal took : 20 ms
[2022-06-12 21:17:51] [INFO ] Applying decomposition
[2022-06-12 21:17:51] [INFO ] Flatten gal took : 16 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/graph13312224659010008210.txt, -o, /tmp/graph13312224659010008210.bin, -w, /tmp/graph13312224659010008210.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/graph13312224659010008210.bin, -l, -1, -v, -w, /tmp/graph13312224659010008210.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:17:51] [INFO ] Decomposing Gal with order
[2022-06-12 21:17:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:17:51] [INFO ] Removed a total of 123 redundant transitions.
[2022-06-12 21:17:51] [INFO ] Flatten gal took : 28 ms
[2022-06-12 21:17:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 109 labels/synchronizations in 10 ms.
[2022-06-12 21:17:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9903488453280266361.gal : 3 ms
[2022-06-12 21:17:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14060995827757307756.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality9903488453280266361.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality14060995827757307756.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/ReachabilityCardinality9903488453280266361.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality14060995827757307756.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality14060995827757307756.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 6
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :6 after 8
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :8 after 14
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :14 after 31
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :31 after 40
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :40 after 150
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :150 after 297
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :297 after 821
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :821 after 2181
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :2181 after 20751
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :20751 after 67799
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :67799 after 184717
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :184717 after 421186
SDD proceeding with computation,4 properties remain. new max is 65536
SDD size :421186 after 886242
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3444186027545441969
[2022-06-12 21:18:06] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3444186027545441969
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/ltsmin3444186027545441969]
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/ltsmin3444186027545441969] 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/ltsmin3444186027545441969] 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 144803 resets, run finished after 867 ms. (steps per millisecond=1153 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91392 resets, run finished after 606 ms. (steps per millisecond=1650 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91480 resets, run finished after 635 ms. (steps per millisecond=1574 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91243 resets, run finished after 642 ms. (steps per millisecond=1557 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91100 resets, run finished after 632 ms. (steps per millisecond=1582 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 7406764 steps, run timeout after 30001 ms. (steps per millisecond=246 ) properties seen :{}
Probabilistic random walk after 7406764 steps, saw 3702768 distinct states, run finished after 30001 ms. (steps per millisecond=246 ) properties seen :{}
Running SMT prover for 4 properties.
// Phase 1: matrix 223 rows 218 cols
[2022-06-12 21:18:40] [INFO ] Computed 33 place invariants in 22 ms
[2022-06-12 21:18:40] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2022-06-12 21:18:40] [INFO ] [Real]Absence check using 15 positive and 18 generalized place invariants in 2 ms returned sat
[2022-06-12 21:18:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:40] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2022-06-12 21:18:40] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:18:40] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2022-06-12 21:18:40] [INFO ] [Nat]Absence check using 15 positive and 18 generalized place invariants in 2 ms returned sat
[2022-06-12 21:18:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:41] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2022-06-12 21:18:41] [INFO ] State equation strengthened by 34 read => feed constraints.
[2022-06-12 21:18:41] [INFO ] [Nat]Added 34 Read/Feed constraints in 11 ms returned sat
[2022-06-12 21:18:41] [INFO ] Deduced a trap composed of 55 places in 54 ms of which 0 ms to minimize.
[2022-06-12 21:18:41] [INFO ] Deduced a trap composed of 60 places in 48 ms of which 0 ms to minimize.
[2022-06-12 21:18:41] [INFO ] Deduced a trap composed of 61 places in 57 ms of which 0 ms to minimize.
[2022-06-12 21:18:41] [INFO ] Deduced a trap composed of 61 places in 62 ms of which 0 ms to minimize.
[2022-06-12 21:18:41] [INFO ] Deduced a trap composed of 50 places in 47 ms of which 1 ms to minimize.
[2022-06-12 21:18:41] [INFO ] Deduced a trap composed of 63 places in 46 ms of which 1 ms to minimize.
[2022-06-12 21:18:41] [INFO ] Deduced a trap composed of 60 places in 47 ms of which 0 ms to minimize.
[2022-06-12 21:18:41] [INFO ] Deduced a trap composed of 61 places in 53 ms of which 0 ms to minimize.
[2022-06-12 21:18:41] [INFO ] Deduced a trap composed of 79 places in 48 ms of which 0 ms to minimize.
[2022-06-12 21:18:41] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 0 ms to minimize.
[2022-06-12 21:18:41] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 619 ms
[2022-06-12 21:18:41] [INFO ] Computed and/alt/rep : 208/1223/208 causal constraints (skipped 14 transitions) in 12 ms.
[2022-06-12 21:18:43] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 0 ms to minimize.
[2022-06-12 21:18:43] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 0 ms to minimize.
[2022-06-12 21:18:43] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2022-06-12 21:18:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 249 ms
[2022-06-12 21:18:43] [INFO ] Added : 163 causal constraints over 34 iterations in 1968 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-06-12 21:18:43] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2022-06-12 21:18:43] [INFO ] [Real]Absence check using 15 positive and 18 generalized place invariants in 5 ms returned sat
[2022-06-12 21:18:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:43] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2022-06-12 21:18:43] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:18:43] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2022-06-12 21:18:43] [INFO ] [Nat]Absence check using 15 positive and 18 generalized place invariants in 2 ms returned sat
[2022-06-12 21:18:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:43] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2022-06-12 21:18:43] [INFO ] [Nat]Added 34 Read/Feed constraints in 30 ms returned sat
[2022-06-12 21:18:44] [INFO ] Computed and/alt/rep : 208/1223/208 causal constraints (skipped 14 transitions) in 13 ms.
[2022-06-12 21:18:45] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 0 ms to minimize.
[2022-06-12 21:18:45] [INFO ] Deduced a trap composed of 59 places in 71 ms of which 1 ms to minimize.
[2022-06-12 21:18:45] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:18:45] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2022-06-12 21:18:45] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 0 ms to minimize.
[2022-06-12 21:18:45] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2022-06-12 21:18:45] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 0 ms to minimize.
[2022-06-12 21:18:45] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2022-06-12 21:18:45] [INFO ] Deduced a trap composed of 68 places in 52 ms of which 0 ms to minimize.
[2022-06-12 21:18:46] [INFO ] Deduced a trap composed of 79 places in 53 ms of which 0 ms to minimize.
[2022-06-12 21:18:46] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 0 ms to minimize.
[2022-06-12 21:18:46] [INFO ] Deduced a trap composed of 79 places in 53 ms of which 0 ms to minimize.
[2022-06-12 21:18:46] [INFO ] Deduced a trap composed of 67 places in 48 ms of which 0 ms to minimize.
[2022-06-12 21:18:46] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 0 ms to minimize.
[2022-06-12 21:18:46] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 1 ms to minimize.
[2022-06-12 21:18:46] [INFO ] Deduced a trap composed of 71 places in 55 ms of which 0 ms to minimize.
[2022-06-12 21:18:46] [INFO ] Deduced a trap composed of 79 places in 44 ms of which 0 ms to minimize.
[2022-06-12 21:18:46] [INFO ] Deduced a trap composed of 74 places in 46 ms of which 1 ms to minimize.
[2022-06-12 21:18:46] [INFO ] Deduced a trap composed of 85 places in 48 ms of which 0 ms to minimize.
[2022-06-12 21:18:46] [INFO ] Deduced a trap composed of 83 places in 46 ms of which 0 ms to minimize.
[2022-06-12 21:18:46] [INFO ] Deduced a trap composed of 74 places in 50 ms of which 1 ms to minimize.
[2022-06-12 21:18:47] [INFO ] Deduced a trap composed of 74 places in 48 ms of which 1 ms to minimize.
[2022-06-12 21:18:47] [INFO ] Deduced a trap composed of 66 places in 51 ms of which 1 ms to minimize.
[2022-06-12 21:18:47] [INFO ] Deduced a trap composed of 66 places in 48 ms of which 0 ms to minimize.
[2022-06-12 21:18:47] [INFO ] Deduced a trap composed of 84 places in 51 ms of which 0 ms to minimize.
[2022-06-12 21:18:47] [INFO ] Deduced a trap composed of 92 places in 51 ms of which 1 ms to minimize.
[2022-06-12 21:18:47] [INFO ] Deduced a trap composed of 56 places in 49 ms of which 1 ms to minimize.
[2022-06-12 21:18:47] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2022-06-12 21:18:47] [INFO ] Deduced a trap composed of 62 places in 50 ms of which 1 ms to minimize.
[2022-06-12 21:18:47] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 2628 ms
[2022-06-12 21:18:48] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 0 ms to minimize.
[2022-06-12 21:18:48] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2022-06-12 21:18:48] [INFO ] Deduced a trap composed of 86 places in 52 ms of which 1 ms to minimize.
[2022-06-12 21:18:48] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 1 ms to minimize.
[2022-06-12 21:18:48] [INFO ] Deduced a trap composed of 55 places in 50 ms of which 1 ms to minimize.
[2022-06-12 21:18:48] [INFO ] Deduced a trap composed of 57 places in 50 ms of which 0 ms to minimize.
[2022-06-12 21:18:48] [INFO ] Deduced a trap composed of 62 places in 49 ms of which 0 ms to minimize.
[2022-06-12 21:18:48] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 0 ms to minimize.
[2022-06-12 21:18:48] [INFO ] Deduced a trap composed of 56 places in 51 ms of which 1 ms to minimize.
[2022-06-12 21:18:48] [INFO ] Deduced a trap composed of 74 places in 49 ms of which 1 ms to minimize.
[2022-06-12 21:18:49] [INFO ] Deduced a trap composed of 77 places in 45 ms of which 0 ms to minimize.
[2022-06-12 21:18:49] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 969 ms
[2022-06-12 21:18:49] [INFO ] Added : 155 causal constraints over 33 iterations in 5178 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
[2022-06-12 21:18:49] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2022-06-12 21:18:49] [INFO ] [Real]Absence check using 15 positive and 18 generalized place invariants in 3 ms returned sat
[2022-06-12 21:18:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:49] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2022-06-12 21:18:49] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:18:49] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2022-06-12 21:18:49] [INFO ] [Nat]Absence check using 15 positive and 18 generalized place invariants in 3 ms returned sat
[2022-06-12 21:18:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:49] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2022-06-12 21:18:49] [INFO ] [Nat]Added 34 Read/Feed constraints in 27 ms returned sat
[2022-06-12 21:18:49] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2022-06-12 21:18:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2022-06-12 21:18:49] [INFO ] Computed and/alt/rep : 208/1223/208 causal constraints (skipped 14 transitions) in 14 ms.
[2022-06-12 21:18:52] [INFO ] Deduced a trap composed of 68 places in 55 ms of which 0 ms to minimize.
[2022-06-12 21:18:52] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 0 ms to minimize.
[2022-06-12 21:18:52] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 0 ms to minimize.
[2022-06-12 21:18:52] [INFO ] Deduced a trap composed of 77 places in 53 ms of which 0 ms to minimize.
[2022-06-12 21:18:53] [INFO ] Deduced a trap composed of 66 places in 47 ms of which 1 ms to minimize.
[2022-06-12 21:18:53] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 474 ms
[2022-06-12 21:18:53] [INFO ] Added : 197 causal constraints over 41 iterations in 3566 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-06-12 21:18:53] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2022-06-12 21:18:53] [INFO ] [Real]Absence check using 15 positive and 18 generalized place invariants in 2 ms returned sat
[2022-06-12 21:18:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:53] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2022-06-12 21:18:53] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:18:53] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2022-06-12 21:18:53] [INFO ] [Nat]Absence check using 15 positive and 18 generalized place invariants in 2 ms returned sat
[2022-06-12 21:18:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:53] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2022-06-12 21:18:53] [INFO ] [Nat]Added 34 Read/Feed constraints in 36 ms returned sat
[2022-06-12 21:18:53] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 0 ms to minimize.
[2022-06-12 21:18:53] [INFO ] Deduced a trap composed of 61 places in 78 ms of which 0 ms to minimize.
[2022-06-12 21:18:53] [INFO ] Deduced a trap composed of 65 places in 52 ms of which 1 ms to minimize.
[2022-06-12 21:18:53] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2022-06-12 21:18:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 278 ms
[2022-06-12 21:18:53] [INFO ] Computed and/alt/rep : 208/1223/208 causal constraints (skipped 14 transitions) in 11 ms.
[2022-06-12 21:18:57] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2022-06-12 21:18:57] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 0 ms to minimize.
[2022-06-12 21:18:57] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2022-06-12 21:18:57] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2022-06-12 21:18:58] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2022-06-12 21:18:58] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 0 ms to minimize.
[2022-06-12 21:18:58] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 0 ms to minimize.
[2022-06-12 21:18:58] [INFO ] Deduced a trap composed of 68 places in 57 ms of which 7 ms to minimize.
[2022-06-12 21:18:58] [INFO ] Deduced a trap composed of 78 places in 43 ms of which 0 ms to minimize.
[2022-06-12 21:18:58] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 0 ms to minimize.
[2022-06-12 21:18:58] [INFO ] Deduced a trap composed of 75 places in 50 ms of which 0 ms to minimize.
[2022-06-12 21:18:58] [INFO ] Deduced a trap composed of 90 places in 49 ms of which 0 ms to minimize.
[2022-06-12 21:18:58] [INFO ] Deduced a trap composed of 91 places in 50 ms of which 0 ms to minimize.
[2022-06-12 21:18:58] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1315 ms
[2022-06-12 21:18:58] [INFO ] Added : 208 causal constraints over 42 iterations in 5041 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
Incomplete Parikh walk after 331700 steps, including 51195 resets, run finished after 326 ms. (steps per millisecond=1017 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 257400 steps, including 39560 resets, run finished after 276 ms. (steps per millisecond=932 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1229500 steps, including 214471 resets, run finished after 1185 ms. (steps per millisecond=1037 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 6222800 steps, including 1085395 resets, run finished after 6296 ms. (steps per millisecond=988 ) properties (out of 4) seen :0 could not realise parikh vector
Support contains 8 out of 218 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 218/218 places, 223/223 transitions.
Applied a total of 0 rules in 15 ms. Remains 218 /218 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 218/218 places, 223/223 transitions.
Starting structural reductions, iteration 0 : 218/218 places, 223/223 transitions.
Applied a total of 0 rules in 8 ms. Remains 218 /218 variables (removed 0) and now considering 223/223 (removed 0) transitions.
// Phase 1: matrix 223 rows 218 cols
[2022-06-12 21:19:06] [INFO ] Computed 33 place invariants in 14 ms
[2022-06-12 21:19:07] [INFO ] Implicit Places using invariants in 138 ms returned []
// Phase 1: matrix 223 rows 218 cols
[2022-06-12 21:19:07] [INFO ] Computed 33 place invariants in 8 ms
[2022-06-12 21:19:07] [INFO ] State equation strengthened by 34 read => feed constraints.
[2022-06-12 21:19:07] [INFO ] Implicit Places using invariants and state equation in 563 ms returned []
Implicit Place search using SMT with State Equation took 701 ms to find 0 implicit places.
[2022-06-12 21:19:07] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 223 rows 218 cols
[2022-06-12 21:19:07] [INFO ] Computed 33 place invariants in 8 ms
[2022-06-12 21:19:07] [INFO ] Dead Transitions using invariants and state equation in 101 ms returned []
Finished structural reductions, in 1 iterations. Remains : 218/218 places, 223/223 transitions.
Incomplete random walk after 100000 steps, including 14451 resets, run finished after 227 ms. (steps per millisecond=440 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 223 rows 218 cols
[2022-06-12 21:19:08] [INFO ] Computed 33 place invariants in 15 ms
[2022-06-12 21:19:08] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2022-06-12 21:19:08] [INFO ] [Real]Absence check using 15 positive and 18 generalized place invariants in 3 ms returned sat
[2022-06-12 21:19:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:19:08] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2022-06-12 21:19:08] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:19:08] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2022-06-12 21:19:08] [INFO ] [Nat]Absence check using 15 positive and 18 generalized place invariants in 2 ms returned sat
[2022-06-12 21:19:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:19:08] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2022-06-12 21:19:08] [INFO ] State equation strengthened by 34 read => feed constraints.
[2022-06-12 21:19:08] [INFO ] [Nat]Added 34 Read/Feed constraints in 10 ms returned sat
[2022-06-12 21:19:08] [INFO ] Deduced a trap composed of 55 places in 52 ms of which 0 ms to minimize.
[2022-06-12 21:19:08] [INFO ] Deduced a trap composed of 60 places in 74 ms of which 0 ms to minimize.
[2022-06-12 21:19:08] [INFO ] Deduced a trap composed of 61 places in 45 ms of which 0 ms to minimize.
[2022-06-12 21:19:08] [INFO ] Deduced a trap composed of 61 places in 56 ms of which 0 ms to minimize.
[2022-06-12 21:19:08] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 0 ms to minimize.
[2022-06-12 21:19:08] [INFO ] Deduced a trap composed of 63 places in 60 ms of which 0 ms to minimize.
[2022-06-12 21:19:08] [INFO ] Deduced a trap composed of 60 places in 44 ms of which 0 ms to minimize.
[2022-06-12 21:19:08] [INFO ] Deduced a trap composed of 61 places in 57 ms of which 1 ms to minimize.
[2022-06-12 21:19:08] [INFO ] Deduced a trap composed of 79 places in 59 ms of which 1 ms to minimize.
[2022-06-12 21:19:08] [INFO ] Deduced a trap composed of 48 places in 59 ms of which 0 ms to minimize.
[2022-06-12 21:19:09] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 664 ms
[2022-06-12 21:19:09] [INFO ] Computed and/alt/rep : 208/1223/208 causal constraints (skipped 14 transitions) in 11 ms.
[2022-06-12 21:19:10] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 0 ms to minimize.
[2022-06-12 21:19:10] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2022-06-12 21:19:10] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 0 ms to minimize.
[2022-06-12 21:19:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 295 ms
[2022-06-12 21:19:11] [INFO ] Added : 163 causal constraints over 34 iterations in 2039 ms. Result :sat
[2022-06-12 21:19:11] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2022-06-12 21:19:11] [INFO ] [Real]Absence check using 15 positive and 18 generalized place invariants in 2 ms returned sat
[2022-06-12 21:19:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:19:11] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2022-06-12 21:19:11] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:19:11] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2022-06-12 21:19:11] [INFO ] [Nat]Absence check using 15 positive and 18 generalized place invariants in 2 ms returned sat
[2022-06-12 21:19:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:19:11] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2022-06-12 21:19:11] [INFO ] [Nat]Added 34 Read/Feed constraints in 28 ms returned sat
[2022-06-12 21:19:11] [INFO ] Computed and/alt/rep : 208/1223/208 causal constraints (skipped 14 transitions) in 16 ms.
[2022-06-12 21:19:12] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2022-06-12 21:19:12] [INFO ] Deduced a trap composed of 59 places in 59 ms of which 0 ms to minimize.
[2022-06-12 21:19:12] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2022-06-12 21:19:12] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2022-06-12 21:19:13] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2022-06-12 21:19:13] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 0 ms to minimize.
[2022-06-12 21:19:13] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 0 ms to minimize.
[2022-06-12 21:19:13] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 0 ms to minimize.
[2022-06-12 21:19:13] [INFO ] Deduced a trap composed of 68 places in 47 ms of which 0 ms to minimize.
[2022-06-12 21:19:13] [INFO ] Deduced a trap composed of 79 places in 53 ms of which 0 ms to minimize.
[2022-06-12 21:19:13] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 0 ms to minimize.
[2022-06-12 21:19:13] [INFO ] Deduced a trap composed of 79 places in 52 ms of which 1 ms to minimize.
[2022-06-12 21:19:13] [INFO ] Deduced a trap composed of 67 places in 51 ms of which 1 ms to minimize.
[2022-06-12 21:19:13] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 0 ms to minimize.
[2022-06-12 21:19:13] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 0 ms to minimize.
[2022-06-12 21:19:14] [INFO ] Deduced a trap composed of 71 places in 47 ms of which 0 ms to minimize.
[2022-06-12 21:19:14] [INFO ] Deduced a trap composed of 79 places in 51 ms of which 1 ms to minimize.
[2022-06-12 21:19:14] [INFO ] Deduced a trap composed of 74 places in 48 ms of which 1 ms to minimize.
[2022-06-12 21:19:14] [INFO ] Deduced a trap composed of 85 places in 45 ms of which 0 ms to minimize.
[2022-06-12 21:19:14] [INFO ] Deduced a trap composed of 83 places in 55 ms of which 0 ms to minimize.
[2022-06-12 21:19:14] [INFO ] Deduced a trap composed of 74 places in 53 ms of which 0 ms to minimize.
[2022-06-12 21:19:14] [INFO ] Deduced a trap composed of 74 places in 52 ms of which 0 ms to minimize.
[2022-06-12 21:19:14] [INFO ] Deduced a trap composed of 66 places in 51 ms of which 0 ms to minimize.
[2022-06-12 21:19:14] [INFO ] Deduced a trap composed of 66 places in 53 ms of which 1 ms to minimize.
[2022-06-12 21:19:14] [INFO ] Deduced a trap composed of 84 places in 54 ms of which 0 ms to minimize.
[2022-06-12 21:19:14] [INFO ] Deduced a trap composed of 92 places in 49 ms of which 0 ms to minimize.
[2022-06-12 21:19:15] [INFO ] Deduced a trap composed of 56 places in 51 ms of which 0 ms to minimize.
[2022-06-12 21:19:15] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 0 ms to minimize.
[2022-06-12 21:19:15] [INFO ] Deduced a trap composed of 62 places in 42 ms of which 0 ms to minimize.
[2022-06-12 21:19:15] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 2718 ms
[2022-06-12 21:19:15] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 0 ms to minimize.
[2022-06-12 21:19:15] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2022-06-12 21:19:15] [INFO ] Deduced a trap composed of 86 places in 52 ms of which 1 ms to minimize.
[2022-06-12 21:19:15] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 1 ms to minimize.
[2022-06-12 21:19:16] [INFO ] Deduced a trap composed of 55 places in 53 ms of which 0 ms to minimize.
[2022-06-12 21:19:16] [INFO ] Deduced a trap composed of 57 places in 57 ms of which 0 ms to minimize.
[2022-06-12 21:19:16] [INFO ] Deduced a trap composed of 62 places in 50 ms of which 0 ms to minimize.
[2022-06-12 21:19:16] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 0 ms to minimize.
[2022-06-12 21:19:16] [INFO ] Deduced a trap composed of 56 places in 52 ms of which 1 ms to minimize.
[2022-06-12 21:19:16] [INFO ] Deduced a trap composed of 74 places in 52 ms of which 1 ms to minimize.
[2022-06-12 21:19:16] [INFO ] Deduced a trap composed of 77 places in 50 ms of which 0 ms to minimize.
[2022-06-12 21:19:16] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 953 ms
[2022-06-12 21:19:16] [INFO ] Added : 155 causal constraints over 33 iterations in 5305 ms. Result :sat
[2022-06-12 21:19:16] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2022-06-12 21:19:16] [INFO ] [Real]Absence check using 15 positive and 18 generalized place invariants in 3 ms returned sat
[2022-06-12 21:19:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:19:16] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2022-06-12 21:19:16] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:19:16] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2022-06-12 21:19:16] [INFO ] [Nat]Absence check using 15 positive and 18 generalized place invariants in 3 ms returned sat
[2022-06-12 21:19:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:19:16] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2022-06-12 21:19:16] [INFO ] [Nat]Added 34 Read/Feed constraints in 28 ms returned sat
[2022-06-12 21:19:17] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 0 ms to minimize.
[2022-06-12 21:19:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2022-06-12 21:19:17] [INFO ] Computed and/alt/rep : 208/1223/208 causal constraints (skipped 14 transitions) in 9 ms.
[2022-06-12 21:19:20] [INFO ] Deduced a trap composed of 68 places in 55 ms of which 0 ms to minimize.
[2022-06-12 21:19:20] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2022-06-12 21:19:20] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 0 ms to minimize.
[2022-06-12 21:19:20] [INFO ] Deduced a trap composed of 77 places in 51 ms of which 0 ms to minimize.
[2022-06-12 21:19:20] [INFO ] Deduced a trap composed of 66 places in 47 ms of which 1 ms to minimize.
[2022-06-12 21:19:20] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 459 ms
[2022-06-12 21:19:20] [INFO ] Added : 197 causal constraints over 41 iterations in 3507 ms. Result :sat
[2022-06-12 21:19:20] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2022-06-12 21:19:20] [INFO ] [Real]Absence check using 15 positive and 18 generalized place invariants in 3 ms returned sat
[2022-06-12 21:19:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:19:20] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2022-06-12 21:19:20] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:19:20] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2022-06-12 21:19:20] [INFO ] [Nat]Absence check using 15 positive and 18 generalized place invariants in 3 ms returned sat
[2022-06-12 21:19:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:19:20] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2022-06-12 21:19:20] [INFO ] [Nat]Added 34 Read/Feed constraints in 40 ms returned sat
[2022-06-12 21:19:20] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 0 ms to minimize.
[2022-06-12 21:19:20] [INFO ] Deduced a trap composed of 61 places in 50 ms of which 1 ms to minimize.
[2022-06-12 21:19:21] [INFO ] Deduced a trap composed of 65 places in 49 ms of which 0 ms to minimize.
[2022-06-12 21:19:21] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2022-06-12 21:19:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 236 ms
[2022-06-12 21:19:21] [INFO ] Computed and/alt/rep : 208/1223/208 causal constraints (skipped 14 transitions) in 12 ms.
[2022-06-12 21:19:24] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2022-06-12 21:19:25] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2022-06-12 21:19:25] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2022-06-12 21:19:25] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2022-06-12 21:19:25] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 0 ms to minimize.
[2022-06-12 21:19:25] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 0 ms to minimize.
[2022-06-12 21:19:25] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2022-06-12 21:19:25] [INFO ] Deduced a trap composed of 68 places in 48 ms of which 0 ms to minimize.
[2022-06-12 21:19:25] [INFO ] Deduced a trap composed of 78 places in 49 ms of which 1 ms to minimize.
[2022-06-12 21:19:25] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2022-06-12 21:19:25] [INFO ] Deduced a trap composed of 75 places in 47 ms of which 1 ms to minimize.
[2022-06-12 21:19:25] [INFO ] Deduced a trap composed of 90 places in 44 ms of which 0 ms to minimize.
[2022-06-12 21:19:26] [INFO ] Deduced a trap composed of 91 places in 44 ms of which 1 ms to minimize.
[2022-06-12 21:19:26] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1239 ms
[2022-06-12 21:19:26] [INFO ] Added : 208 causal constraints over 42 iterations in 5051 ms. Result :sat
[2022-06-12 21:19:26] [INFO ] Flatten gal took : 21 ms
[2022-06-12 21:19:26] [INFO ] Flatten gal took : 15 ms
[2022-06-12 21:19:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9696147101496054837.gal : 2 ms
[2022-06-12 21:19:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16728283264118244845.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality9696147101496054837.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality16728283264118244845.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/ReachabilityCardinality9696147101496054837.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality16728283264118244845.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality16728283264118244845.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 6
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :6 after 8
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :8 after 14
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :14 after 27
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :27 after 40
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :40 after 139
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :139 after 284
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :284 after 834
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :834 after 2181
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :2181 after 12136
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :12136 after 35780
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :35780 after 101851
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :101851 after 238204
SDD proceeding with computation,4 properties remain. new max is 65536
SDD size :238204 after 525536
Detected timeout of ITS tools.
[2022-06-12 21:19:41] [INFO ] Flatten gal took : 13 ms
[2022-06-12 21:19:41] [INFO ] Applying decomposition
[2022-06-12 21:19:41] [INFO ] Flatten gal took : 12 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/graph17089285616894818867.txt, -o, /tmp/graph17089285616894818867.bin, -w, /tmp/graph17089285616894818867.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/graph17089285616894818867.bin, -l, -1, -v, -w, /tmp/graph17089285616894818867.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:19:41] [INFO ] Decomposing Gal with order
[2022-06-12 21:19:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:19:41] [INFO ] Removed a total of 119 redundant transitions.
[2022-06-12 21:19:41] [INFO ] Flatten gal took : 31 ms
[2022-06-12 21:19:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 86 labels/synchronizations in 8 ms.
[2022-06-12 21:19:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9251785594070526099.gal : 3 ms
[2022-06-12 21:19:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14892753654357093166.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality9251785594070526099.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality14892753654357093166.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/ReachabilityCardinality9251785594070526099.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality14892753654357093166.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality14892753654357093166.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 6
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :6 after 8
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :8 after 14
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :14 after 25
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :25 after 40
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :40 after 150
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :150 after 304
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :304 after 878
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :878 after 2929
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :2929 after 15985
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :15985 after 51984
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :51984 after 133093
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :133093 after 309867
SDD proceeding with computation,4 properties remain. new max is 65536
SDD size :309867 after 659126
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9993513877090437379
[2022-06-12 21:19:56] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9993513877090437379
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/ltsmin9993513877090437379]
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/ltsmin9993513877090437379] 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/ltsmin9993513877090437379] 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)
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 218 transition count 206
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 201 transition count 206
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 40 place count 195 transition count 200
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 195 transition count 200
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 194 transition count 199
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 194 transition count 197
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 192 transition count 197
Applied a total of 52 rules in 31 ms. Remains 192 /218 variables (removed 26) and now considering 197/223 (removed 26) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 197 rows 192 cols
[2022-06-12 21:19:57] [INFO ] Computed 33 place invariants in 8 ms
[2022-06-12 21:19:57] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-06-12 21:19:57] [INFO ] [Real]Absence check using 5 positive and 28 generalized place invariants in 5 ms returned sat
[2022-06-12 21:19:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:19:57] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2022-06-12 21:19:57] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:19:57] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-06-12 21:19:57] [INFO ] [Nat]Absence check using 5 positive and 28 generalized place invariants in 4 ms returned sat
[2022-06-12 21:19:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:19:57] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2022-06-12 21:19:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-12 21:19:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2022-06-12 21:19:57] [INFO ] Deduced a trap composed of 33 places in 17 ms of which 1 ms to minimize.
[2022-06-12 21:19:57] [INFO ] Deduced a trap composed of 29 places in 21 ms of which 0 ms to minimize.
[2022-06-12 21:19:57] [INFO ] Deduced a trap composed of 28 places in 21 ms of which 1 ms to minimize.
[2022-06-12 21:19:57] [INFO ] Deduced a trap composed of 32 places in 23 ms of which 1 ms to minimize.
[2022-06-12 21:19:57] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 136 ms
[2022-06-12 21:19:57] [INFO ] Computed and/alt/rep : 184/1088/184 causal constraints (skipped 12 transitions) in 10 ms.
[2022-06-12 21:19:59] [INFO ] Added : 179 causal constraints over 36 iterations in 1526 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 14 ms.
[2022-06-12 21:19:59] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-06-12 21:19:59] [INFO ] [Real]Absence check using 5 positive and 28 generalized place invariants in 9 ms returned sat
[2022-06-12 21:19:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:19:59] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2022-06-12 21:19:59] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:19:59] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-06-12 21:19:59] [INFO ] [Nat]Absence check using 5 positive and 28 generalized place invariants in 4 ms returned sat
[2022-06-12 21:19:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:19:59] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2022-06-12 21:19:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 9 ms returned sat
[2022-06-12 21:19:59] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2022-06-12 21:19:59] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2022-06-12 21:19:59] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2022-06-12 21:19:59] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 0 ms to minimize.
[2022-06-12 21:19:59] [INFO ] Deduced a trap composed of 28 places in 24 ms of which 1 ms to minimize.
[2022-06-12 21:19:59] [INFO ] Deduced a trap composed of 29 places in 13 ms of which 0 ms to minimize.
[2022-06-12 21:19:59] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 211 ms
[2022-06-12 21:19:59] [INFO ] Computed and/alt/rep : 184/1088/184 causal constraints (skipped 12 transitions) in 9 ms.
[2022-06-12 21:20:01] [INFO ] Added : 156 causal constraints over 32 iterations in 1305 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
[2022-06-12 21:20:01] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-06-12 21:20:01] [INFO ] [Real]Absence check using 5 positive and 28 generalized place invariants in 6 ms returned sat
[2022-06-12 21:20:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:20:01] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2022-06-12 21:20:01] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:20:01] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-06-12 21:20:01] [INFO ] [Nat]Absence check using 5 positive and 28 generalized place invariants in 4 ms returned sat
[2022-06-12 21:20:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:20:01] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2022-06-12 21:20:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2022-06-12 21:20:01] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 0 ms to minimize.
[2022-06-12 21:20:01] [INFO ] Deduced a trap composed of 76 places in 41 ms of which 1 ms to minimize.
[2022-06-12 21:20:01] [INFO ] Deduced a trap composed of 70 places in 50 ms of which 4 ms to minimize.
[2022-06-12 21:20:01] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 0 ms to minimize.
[2022-06-12 21:20:01] [INFO ] Deduced a trap composed of 76 places in 39 ms of which 1 ms to minimize.
[2022-06-12 21:20:01] [INFO ] Deduced a trap composed of 72 places in 40 ms of which 0 ms to minimize.
[2022-06-12 21:20:01] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
[2022-06-12 21:20:01] [INFO ] Deduced a trap composed of 78 places in 42 ms of which 1 ms to minimize.
[2022-06-12 21:20:01] [INFO ] Deduced a trap composed of 76 places in 41 ms of which 1 ms to minimize.
[2022-06-12 21:20:01] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2022-06-12 21:20:02] [INFO ] Deduced a trap composed of 75 places in 44 ms of which 3 ms to minimize.
[2022-06-12 21:20:02] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2022-06-12 21:20:02] [INFO ] Deduced a trap composed of 78 places in 40 ms of which 0 ms to minimize.
[2022-06-12 21:20:02] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2022-06-12 21:20:02] [INFO ] Deduced a trap composed of 76 places in 40 ms of which 0 ms to minimize.
[2022-06-12 21:20:02] [INFO ] Deduced a trap composed of 77 places in 41 ms of which 0 ms to minimize.
[2022-06-12 21:20:02] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2022-06-12 21:20:02] [INFO ] Deduced a trap composed of 77 places in 41 ms of which 0 ms to minimize.
[2022-06-12 21:20:02] [INFO ] Deduced a trap composed of 68 places in 45 ms of which 0 ms to minimize.
[2022-06-12 21:20:02] [INFO ] Deduced a trap composed of 84 places in 38 ms of which 0 ms to minimize.
[2022-06-12 21:20:02] [INFO ] Deduced a trap composed of 80 places in 39 ms of which 0 ms to minimize.
[2022-06-12 21:20:02] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 1066 ms
[2022-06-12 21:20:02] [INFO ] Computed and/alt/rep : 184/1088/184 causal constraints (skipped 12 transitions) in 12 ms.
[2022-06-12 21:20:04] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 0 ms to minimize.
[2022-06-12 21:20:04] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2022-06-12 21:20:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 152 ms
[2022-06-12 21:20:04] [INFO ] Added : 180 causal constraints over 36 iterations in 2325 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 14 ms.
[2022-06-12 21:20:04] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-06-12 21:20:04] [INFO ] [Real]Absence check using 5 positive and 28 generalized place invariants in 5 ms returned sat
[2022-06-12 21:20:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:20:05] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2022-06-12 21:20:05] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:20:05] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-06-12 21:20:05] [INFO ] [Nat]Absence check using 5 positive and 28 generalized place invariants in 5 ms returned sat
[2022-06-12 21:20:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:20:05] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2022-06-12 21:20:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 23 ms returned sat
[2022-06-12 21:20:05] [INFO ] Deduced a trap composed of 33 places in 24 ms of which 0 ms to minimize.
[2022-06-12 21:20:05] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 0 ms to minimize.
[2022-06-12 21:20:05] [INFO ] Deduced a trap composed of 28 places in 14 ms of which 0 ms to minimize.
[2022-06-12 21:20:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 119 ms
[2022-06-12 21:20:05] [INFO ] Computed and/alt/rep : 184/1088/184 causal constraints (skipped 12 transitions) in 9 ms.
[2022-06-12 21:20:07] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2022-06-12 21:20:07] [INFO ] Deduced a trap composed of 79 places in 43 ms of which 0 ms to minimize.
[2022-06-12 21:20:07] [INFO ] Deduced a trap composed of 73 places in 42 ms of which 1 ms to minimize.
[2022-06-12 21:20:07] [INFO ] Deduced a trap composed of 78 places in 42 ms of which 0 ms to minimize.
[2022-06-12 21:20:07] [INFO ] Deduced a trap composed of 78 places in 40 ms of which 1 ms to minimize.
[2022-06-12 21:20:08] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2022-06-12 21:20:08] [INFO ] Deduced a trap composed of 76 places in 40 ms of which 1 ms to minimize.
[2022-06-12 21:20:08] [INFO ] Deduced a trap composed of 77 places in 48 ms of which 0 ms to minimize.
[2022-06-12 21:20:08] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 0 ms to minimize.
[2022-06-12 21:20:08] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 0 ms to minimize.
[2022-06-12 21:20:08] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 757 ms
[2022-06-12 21:20:08] [INFO ] Added : 184 causal constraints over 37 iterations in 3137 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 12 ms.
[2022-06-12 21:20:08] [INFO ] Flatten gal took : 12 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9599287740835822730
[2022-06-12 21:20:08] [INFO ] Applying decomposition
[2022-06-12 21:20:08] [INFO ] Flatten gal took : 16 ms
[2022-06-12 21:20:08] [INFO ] Flatten gal took : 14 ms
[2022-06-12 21:20:08] [INFO ] Computing symmetric may disable matrix : 223 transitions.
[2022-06-12 21:20:08] [INFO ] Computation of Complete disable matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-12 21:20:08] [INFO ] Computing symmetric may enable matrix : 223 transitions.
[2022-06-12 21:20:08] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-12 21:20:08] [INFO ] Computing Do-Not-Accords matrix : 223 transitions.
[2022-06-12 21:20:08] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph5155334890567135424.txt, -o, /tmp/graph5155334890567135424.bin, -w, /tmp/graph5155334890567135424.weights], workingDir=null]
[2022-06-12 21:20:08] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9599287740835822730
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/ltsmin9599287740835822730]
[2022-06-12 21:20:08] [INFO ] Input system was already deterministic with 223 transitions.
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph5155334890567135424.bin, -l, -1, -v, -w, /tmp/graph5155334890567135424.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:20:08] [INFO ] Decomposing Gal with order
[2022-06-12 21:20:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:20:08] [INFO ] Removed a total of 122 redundant transitions.
[2022-06-12 21:20:08] [INFO ] Flatten gal took : 53 ms
[2022-06-12 21:20:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 98 labels/synchronizations in 6 ms.
[2022-06-12 21:20:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13566044167278418126.gal : 18 ms
[2022-06-12 21:20:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11002673089204605307.prop : 25 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/ReachabilityCardinality13566044167278418126.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality11002673089204605307.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/ReachabilityCardinality13566044167278418126.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality11002673089204605307.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality11002673089204605307.prop.
[2022-06-12 21:20:08] [INFO ] Ran tautology test, simplified 0 / 4 in 306 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 6
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :6 after 8
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :8 after 14
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :14 after 31
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :31 after 42
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :42 after 103
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :103 after 304
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :304 after 759
[2022-06-12 21:20:08] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-00(UNSAT) depth K=0 took 23 ms
[2022-06-12 21:20:08] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(UNSAT) depth K=0 took 0 ms
[2022-06-12 21:20:08] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-09(UNSAT) depth K=0 took 0 ms
[2022-06-12 21:20:08] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-13(UNSAT) depth K=0 took 0 ms
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :759 after 2987
[2022-06-12 21:20:08] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-00(UNSAT) depth K=1 took 71 ms
[2022-06-12 21:20:08] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(UNSAT) depth K=1 took 24 ms
[2022-06-12 21:20:08] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-09(UNSAT) depth K=1 took 1 ms
[2022-06-12 21:20:08] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-13(UNSAT) depth K=1 took 1 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 223 rows 218 cols
[2022-06-12 21:20:09] [INFO ] Computed 33 place invariants in 9 ms
inv : p116 + p122 + p124 + p14 + p16 + p169 + p175 + p177 + p22 + p222 + p230 + p234 + p236 + p237 + p24 + p240 + p242 + p243 + p275 + p287 + p289 + p290 + p293 + p299 + p301 + p302 + p305 + p309 + p311 + p313 + p314 + p318 + p319 + p328 + p340 + p342 + p343 + p345 + p346 + p352 + p354 + p355 + p358 + p361 + p362 + p364 + p366 + p381 + p393 + p395 + p396 + p399 + p405 + p407 + p408 + p411 + p417 + p419 + p434 + p446 + p448 + p449 + p452 + p458 + p460 + p461 + p464 + p470 + p472 + p485 + p487 + p499 + p502 + p504 + p505 + p516 + p517 + p523 + p525 + p63 + p69 + p71 = 1
inv : p215 - p216 + p218 - p219 + p240 + p252 = 0
inv : p56 - p57 + p59 - p60 + p81 + p93 = 0
inv : p374 - p375 + p377 - p378 + p399 + p411 = 0
inv : p480 - p481 + p483 - p484 + p505 + p517 = 0
inv : p8 + p9 = 2
inv : p101 + p116 + p128 + p130 + p131 + p134 + p14 + p140 + p142 + p143 + p146 + p152 + p154 + p16 + p169 + p181 + p183 + p184 + p187 + p193 + p195 + p196 + p199 + p205 + p207 + p222 + p234 + p236 + p237 + p240 + p243 + p246 + p248 + p249 + p252 + p256 + p258 + p260 + p275 + p28 + p287 + p289 + p290 + p293 + p299 + p30 + p301 + p302 + p305 + p309 + p31 + p311 + p313 + p314 + p319 + p328 + p34 + p340 + p342 + p343 + p345 + p346 + p352 + p354 + p355 + p358 + p361 + p362 + p364 + p366 + p381 + p393 + p395 + p396 + p399 + p40 + p405 + p407 + p408 + p411 + p417 + p419 + p42 + p43 + p434 + p446 + p448 + p449 + p452 + p458 + p46 + p460 + p461 + p464 + p470 + p472 + p485 + p487 + p499 + p502 + p504 + p505 + p516 + p517 + p52 + p523 + p525 + p54 + p63 + p75 + p77 + p78 + p80 + p81 + p87 + p89 + p90 + p93 + p97 + p99 = 1
inv : p161 - p163 + p164 - p166 + p187 + p199 = 0
inv : p321 - p322 + p324 - p325 + p346 + p358 = 0
inv : p116 + p122 + p124 + p14 + p16 + p169 + p175 + p177 + p22 + p222 + p234 + p236 + p237 + p24 + p240 + p243 + p246 + p248 + p249 + p252 + p256 + p258 + p260 + p263 + p265 + p275 + p287 + p289 + p290 + p293 + p299 + p301 + p302 + p305 + p309 + p311 + p313 + p314 + p319 + p328 + p340 + p342 + p343 + p345 + p346 + p352 + p354 + p355 + p358 + p361 + p362 + p364 + p366 + p381 + p393 + p395 + p396 + p399 + p405 + p407 + p408 + p411 + p417 + p419 + p434 + p446 + p448 + p449 + p452 + p458 + p460 + p461 + p464 + p470 + p472 + p485 + p487 + p499 + p502 + p504 + p505 + p516 + p517 + p523 + p525 + p63 + p69 + p71 = 1
inv : p116 + p122 + p124 + p14 + p16 + p169 + p175 + p177 + p22 + p222 + p228 + p230 + p24 + p275 + p281 + p283 + p328 + p334 + p336 + p381 + p393 + p395 + p396 + p399 + p405 + p407 + p408 + p411 + p417 + p419 + p422 + p424 + p434 + p446 + p448 + p449 + p452 + p458 + p460 + p461 + p464 + p470 + p472 + p485 + p487 + p499 + p502 + p504 + p505 + p516 + p517 + p523 + p525 + p63 + p69 + p71 = 1
inv : p268 - p269 + p271 - p272 + p293 + p305 - p314 = 0
inv : p320 - p322 + p323 - p325 + p346 + p358 = 0
inv : p162 - p163 + p165 - p166 + p187 + p199 = 0
inv : p116 + p122 + p124 + p14 + p16 + p169 + p175 + p177 + p22 + p222 + p228 + p230 + p24 + p275 + p287 + p289 + p290 + p293 + p299 + p301 + p302 + p305 + p309 + p311 + p313 + p314 + p316 + p318 + p319 + p328 + p340 + p342 + p343 + p345 + p346 + p352 + p354 + p355 + p358 + p361 + p362 + p364 + p366 + p381 + p393 + p395 + p396 + p399 + p405 + p407 + p408 + p411 + p417 + p419 + p434 + p446 + p448 + p449 + p452 + p458 + p460 + p461 + p464 + p470 + p472 + p485 + p487 + p499 + p502 + p504 + p505 + p516 + p517 + p523 + p525 + p63 + p69 + p71 = 1
inv : p10 + p11 = 2
inv : p109 - p110 + p112 - p113 + p134 + p146 = 0
inv : p267 - p269 + p270 - p272 + p293 + p305 - p314 = 0
inv : p108 - p110 + p111 - p113 + p134 + p146 = 0
inv : p55 - p57 + p58 - p60 + p81 + p93 = 0
inv : p373 - p375 + p376 - p378 + p399 + p411 = 0
inv : p116 + p122 + p124 + p14 + p16 + p169 + p175 + p177 + p22 + p222 + p228 + p230 + p24 + p275 + p281 + p283 + p328 + p340 + p342 + p343 + p345 + p346 + p352 + p354 + p355 + p358 + p361 + p362 + p364 + p366 + p369 + p371 + p381 + p393 + p395 + p396 + p399 + p405 + p407 + p408 + p411 + p417 + p419 + p434 + p446 + p448 + p449 + p452 + p458 + p460 + p461 + p464 + p470 + p472 + p485 + p487 + p499 + p502 + p504 + p505 + p516 + p517 + p523 + p525 + p63 + p69 + p71 = 1
inv : p101 + p104 + p106 + p116 + p128 + p130 + p131 + p134 + p14 + p140 + p142 + p143 + p146 + p152 + p154 + p16 + p169 + p181 + p183 + p184 + p187 + p193 + p195 + p196 + p199 + p205 + p207 + p22 + p222 + p234 + p236 + p237 + p24 + p240 + p243 + p246 + p248 + p249 + p252 + p256 + p258 + p260 + p275 + p287 + p289 + p290 + p293 + p299 + p301 + p302 + p305 + p309 + p311 + p313 + p314 + p319 + p328 + p340 + p342 + p343 + p345 + p346 + p352 + p354 + p355 + p358 + p361 + p362 + p364 + p366 + p381 + p393 + p395 + p396 + p399 + p405 + p407 + p408 + p411 + p417 + p419 + p434 + p446 + p448 + p449 + p452 + p458 + p460 + p461 + p464 + p470 + p472 + p485 + p487 + p499 + p502 + p504 + p505 + p516 + p517 + p523 + p525 + p63 + p75 + p77 + p78 + p80 + p81 + p87 + p89 + p90 + p93 + p97 + p99 = 1
inv : p116 + p122 + p124 + p14 + p16 + p169 + p175 + p177 + p22 + p222 + p228 + p230 + p24 + p275 + p281 + p283 + p328 + p334 + p352 + p354 + p355 + p358 + p360 + p361 + p381 + p393 + p395 + p396 + p399 + p405 + p407 + p408 + p411 + p417 + p419 + p422 + p434 + p446 + p448 + p449 + p452 + p458 + p460 + p461 + p464 + p470 + p472 + p485 + p487 + p499 + p502 + p504 + p505 + p516 + p517 + p523 + p525 + p63 + p69 + p71 = 1
inv : p427 - p428 + p430 - p431 + p452 + p464 = 0
inv : p116 + p128 + p130 + p131 + p134 + p14 + p140 + p142 + p143 + p146 + p152 + p154 + p157 + p159 + p16 + p169 + p181 + p183 + p184 + p187 + p193 + p195 + p196 + p199 + p205 + p207 + p22 + p222 + p234 + p236 + p237 + p24 + p240 + p243 + p246 + p248 + p249 + p252 + p256 + p258 + p260 + p275 + p287 + p289 + p290 + p293 + p299 + p301 + p302 + p305 + p309 + p311 + p313 + p314 + p319 + p328 + p340 + p342 + p343 + p345 + p346 + p352 + p354 + p355 + p358 + p361 + p362 + p364 + p366 + p381 + p393 + p395 + p396 + p399 + p405 + p407 + p408 + p411 + p417 + p419 + p434 + p446 + p448 + p449 + p452 + p458 + p460 + p461 + p464 + p470 + p472 + p485 + p487 + p499 + p502 + p504 + p505 + p516 + p517 + p523 + p525 + p63 + p69 + p71 = 1
inv : p214 - p216 + p217 - p219 + p240 + p252 = 0
inv : p116 + p122 + p124 + p14 + p16 + p169 + p181 + p183 + p184 + p187 + p193 + p195 + p196 + p199 + p205 + p207 + p210 + p212 + p22 + p222 + p234 + p236 + p237 + p24 + p240 + p243 + p246 + p248 + p249 + p252 + p256 + p258 + p260 + p275 + p287 + p289 + p290 + p293 + p299 + p301 + p302 + p305 + p309 + p311 + p313 + p314 + p319 + p328 + p340 + p342 + p343 + p345 + p346 + p352 + p354 + p355 + p358 + p361 + p362 + p364 + p366 + p381 + p393 + p395 + p396 + p399 + p405 + p407 + p408 + p411 + p417 + p419 + p434 + p446 + p448 + p449 + p452 + p458 + p460 + p461 + p464 + p470 + p472 + p485 + p487 + p499 + p502 + p504 + p505 + p516 + p517 + p523 + p525 + p63 + p69 + p71 = 1
inv : p116 + p122 + p124 + p14 + p16 + p169 + p175 + p177 + p22 + p222 + p228 + p230 + p24 + p275 + p281 + p283 + p328 + p334 + p336 + p381 + p387 + p389 + p434 + p440 + p442 + p485 + p487 + p499 + p502 + p504 + p505 + p516 + p517 + p523 + p525 + p528 + p530 + p63 + p69 + p71 = 1
inv : p101 + p116 + p12 + p128 + p13 + p130 + p131 + p134 + p14 + p140 + p142 + p143 + p146 + p152 + p154 + p16 + p169 + p181 + p183 + p184 + p187 + p193 + p195 + p196 + p199 + p205 + p207 + p222 + p234 + p236 + p237 + p240 + p243 + p246 + p248 + p249 + p252 + p256 + p258 + p260 + p275 + p28 + p287 + p289 + p290 + p293 + p299 + p30 + p301 + p302 + p305 + p309 + p31 + p311 + p313 + p314 + p319 + p328 + p340 + p342 + p343 + p345 + p346 + p352 + p354 + p355 + p358 + p361 + p362 + p364 + p366 + p381 + p393 + p395 + p396 + p399 + p40 + p405 + p407 + p408 + p411 + p417 + p419 + p42 + p43 + p434 + p446 + p448 + p449 + p452 + p458 + p460 + p461 + p464 + p470 + p472 + p485 + p487 + p499 + p502 + p504 + p505 + p516 + p517 + p52 + p523 + p525 + p54 + p63 + p75 + p77 + p78 + p80 + p81 + p87 + p89 + p90 + p93 + p97 + p99 = 3
inv : p116 + p122 + p124 + p14 + p16 + p169 + p175 + p177 + p22 + p222 + p228 + p230 + p24 + p275 + p281 + p283 + p328 + p334 + p336 + p381 + p387 + p389 + p434 + p446 + p448 + p449 + p452 + p458 + p460 + p461 + p464 + p470 + p472 + p475 + p477 + p485 + p487 + p499 + p502 + p504 + p505 + p516 + p517 + p523 + p525 + p63 + p69 + p71 = 1
inv : p479 - p481 + p482 - p484 + p505 + p517 = 0
inv : p426 - p428 + p429 - p431 + p452 + p464 = 0
Total of 33 invariants.
[2022-06-12 21:20:09] [INFO ] Computed 33 place invariants in 10 ms
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :2987 after 26061
[2022-06-12 21:20:09] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-00(UNSAT) depth K=2 took 149 ms
[2022-06-12 21:20:09] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(UNSAT) depth K=2 took 40 ms
[2022-06-12 21:20:09] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-09(UNSAT) depth K=2 took 36 ms
[2022-06-12 21:20:09] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-13(UNSAT) depth K=2 took 28 ms
[2022-06-12 21:20:09] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-00(UNSAT) depth K=3 took 115 ms
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :26061 after 130278
[2022-06-12 21:20:09] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(UNSAT) depth K=3 took 72 ms
[2022-06-12 21:20:09] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-09(UNSAT) depth K=3 took 98 ms
[2022-06-12 21:20:09] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-13(UNSAT) depth K=3 took 92 ms
[2022-06-12 21:20:09] [INFO ] Proved 218 variables to be positive in 777 ms
[2022-06-12 21:20:09] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-00
[2022-06-12 21:20:09] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-00(SAT) depth K=0 took 50 ms
[2022-06-12 21:20:09] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-06
[2022-06-12 21:20:09] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(SAT) depth K=0 took 34 ms
[2022-06-12 21:20:09] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-09
[2022-06-12 21:20:09] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-09(SAT) depth K=0 took 19 ms
[2022-06-12 21:20:09] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-00(UNSAT) depth K=4 took 232 ms
[2022-06-12 21:20:09] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-13
[2022-06-12 21:20:09] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-13(SAT) depth K=0 took 32 ms
[2022-06-12 21:20:09] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(UNSAT) depth K=4 took 63 ms
[2022-06-12 21:20:10] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-00
[2022-06-12 21:20:10] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-00(SAT) depth K=1 took 219 ms
[2022-06-12 21:20:10] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-09(UNSAT) depth K=4 took 249 ms
[2022-06-12 21:20:10] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-06
[2022-06-12 21:20:10] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(SAT) depth K=1 took 69 ms
[2022-06-12 21:20:10] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-09
[2022-06-12 21:20:10] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-09(SAT) depth K=1 took 29 ms
[2022-06-12 21:20:10] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-13(UNSAT) depth K=4 took 55 ms
[2022-06-12 21:20:10] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-13
[2022-06-12 21:20:10] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-13(SAT) depth K=1 took 59 ms
[2022-06-12 21:20:10] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-00(UNSAT) depth K=5 took 236 ms
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :130278 after 416693
Compilation finished in 2358 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin9599287740835822730]
Link finished in 268 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, DoubleExponentPT010ReachabilityCardinality00==true], workingDir=/tmp/ltsmin9599287740835822730]
[2022-06-12 21:20:12] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(UNSAT) depth K=5 took 1738 ms
[2022-06-12 21:20:13] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-00
[2022-06-12 21:20:13] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-00(SAT) depth K=2 took 2741 ms
[2022-06-12 21:20:13] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-09(UNSAT) depth K=5 took 948 ms
[2022-06-12 21:20:14] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-13(UNSAT) depth K=5 took 1104 ms
[2022-06-12 21:20:15] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-00(UNSAT) depth K=6 took 1539 ms
[2022-06-12 21:20:17] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(UNSAT) depth K=6 took 1661 ms
[2022-06-12 21:20:26] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-09(UNSAT) depth K=6 took 8836 ms
[2022-06-12 21:20:28] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-06
[2022-06-12 21:20:28] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(SAT) depth K=2 took 15091 ms
[2022-06-12 21:20:29] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-13(UNSAT) depth K=6 took 3624 ms
[2022-06-12 21:20:34] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-00(UNSAT) depth K=7 took 4769 ms
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :416693 after 6.32215e+06
[2022-06-12 21:20:44] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(UNSAT) depth K=7 took 9314 ms
[2022-06-12 21:20:51] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-09(UNSAT) depth K=7 took 7405 ms
[2022-06-12 21:21:12] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-13(UNSAT) depth K=7 took 20871 ms
[2022-06-12 21:21:17] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-09
[2022-06-12 21:21:17] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-09(SAT) depth K=2 took 49403 ms
[2022-06-12 21:21:19] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-13
[2022-06-12 21:21:19] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-13(SAT) depth K=2 took 2324 ms
[2022-06-12 21:21:38] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-00(UNSAT) depth K=8 took 26271 ms
[2022-06-12 21:21:50] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-00
[2022-06-12 21:21:50] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-00(SAT) depth K=3 took 30330 ms
[2022-06-12 21:21:57] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(UNSAT) depth K=8 took 19291 ms
[2022-06-12 21:22:23] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-09(UNSAT) depth K=8 took 25285 ms
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.025: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.025: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.025: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.026: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.026: Initializing POR dependencies: labels 227, guards 223
pins2lts-mc-linux64( 1/ 8), 0.036: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.036: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.038: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.048: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.048: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.049: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.060: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.060: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.061: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.072: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.072: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.073: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.080: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.080: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.081: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.257: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 2/ 8), 0.270: "DoubleExponentPT010ReachabilityCardinality00==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.270: "DoubleExponentPT010ReachabilityCardinality00==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.271: "DoubleExponentPT010ReachabilityCardinality00==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.271: "DoubleExponentPT010ReachabilityCardinality00==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.270: "DoubleExponentPT010ReachabilityCardinality00==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.270: "DoubleExponentPT010ReachabilityCardinality00==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.271: "DoubleExponentPT010ReachabilityCardinality00==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.270: "DoubleExponentPT010ReachabilityCardinality00==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.271: There are 227 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.271: State length is 218, there are 223 groups
pins2lts-mc-linux64( 0/ 8), 0.271: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.271: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.271: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 0.271: Visible groups: 5 / 223, labels: 1 / 227
pins2lts-mc-linux64( 0/ 8), 0.271: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 0.271: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.761: ~49 levels ~960 states ~1024 transitions
pins2lts-mc-linux64( 0/ 8), 0.872: ~93 levels ~1920 states ~2056 transitions
pins2lts-mc-linux64( 3/ 8), 1.028: ~116 levels ~3840 states ~4160 transitions
pins2lts-mc-linux64( 3/ 8), 1.052: ~126 levels ~7680 states ~8344 transitions
pins2lts-mc-linux64( 3/ 8), 1.073: ~143 levels ~15360 states ~16096 transitions
pins2lts-mc-linux64( 3/ 8), 1.122: ~326 levels ~30720 states ~30944 transitions
pins2lts-mc-linux64( 3/ 8), 1.231: ~501 levels ~61440 states ~62320 transitions
pins2lts-mc-linux64( 3/ 8), 1.506: ~921 levels ~122880 states ~124784 transitions
pins2lts-mc-linux64( 0/ 8), 2.200: ~1182 levels ~245760 states ~250272 transitions
pins2lts-mc-linux64( 0/ 8), 3.784: ~4052 levels ~491520 states ~494448 transitions
pins2lts-mc-linux64( 0/ 8), 6.899: ~8606 levels ~983040 states ~990464 transitions
pins2lts-mc-linux64( 7/ 8), 10.168: ~9886 levels ~1966080 states ~1986488 transitions
pins2lts-mc-linux64( 2/ 8), 17.308: ~9908 levels ~3932160 states ~3975312 transitions
pins2lts-mc-linux64( 7/ 8), 31.084: ~11899 levels ~7864320 states ~7877296 transitions
pins2lts-mc-linux64( 7/ 8), 59.537: ~16253 levels ~15728640 states ~15677080 transitions
pins2lts-mc-linux64( 6/ 8), 117.582: ~23435 levels ~31457280 states ~31326320 transitions
pins2lts-mc-linux64( 2/ 8), 139.621: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 139.692:
pins2lts-mc-linux64( 0/ 8), 139.692: mean standard work distribution: 0.9% (states) 1.3% (transitions)
pins2lts-mc-linux64( 0/ 8), 139.692:
pins2lts-mc-linux64( 0/ 8), 139.692: Explored 36534871 states 36802999 transitions, fanout: 1.007
pins2lts-mc-linux64( 0/ 8), 139.692: Total exploration time 139.420 sec (139.360 sec minimum, 139.385 sec on average)
pins2lts-mc-linux64( 0/ 8), 139.692: States per second: 262049, Transitions per second: 263972
pins2lts-mc-linux64( 0/ 8), 139.692: Ignoring proviso: 3
pins2lts-mc-linux64( 0/ 8), 139.692:
pins2lts-mc-linux64( 0/ 8), 139.692: Queue width: 8B, total height: 330338, memory: 2.52MB
pins2lts-mc-linux64( 0/ 8), 139.692: Tree memory: 536.8MB, 15.3 B/state, compr.: 1.7%
pins2lts-mc-linux64( 0/ 8), 139.692: Tree fill ratio (roots/leafs): 27.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 139.692: Stored 223 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 139.692: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 139.692: Est. total memory use: 539.3MB (~1026.5MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, DoubleExponentPT010ReachabilityCardinality00==true], workingDir=/tmp/ltsmin9599287740835822730]
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, DoubleExponentPT010ReachabilityCardinality00==true], workingDir=/tmp/ltsmin9599287740835822730]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:98)
at java.base/java.lang.Thread.run(Thread.java:834)
[2022-06-12 21:22:38] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-13(UNSAT) depth K=8 took 14824 ms
[2022-06-12 21:22:51] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-00(UNSAT) depth K=9 took 13438 ms
[2022-06-12 21:22:57] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(UNSAT) depth K=9 took 6140 ms
[2022-06-12 21:23:15] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-09(UNSAT) depth K=9 took 17835 ms
[2022-06-12 21:23:18] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-13(UNSAT) depth K=9 took 3500 ms
[2022-06-12 21:23:58] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-00(UNSAT) depth K=10 took 39730 ms
[2022-06-12 21:24:13] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(UNSAT) depth K=10 took 14659 ms
[2022-06-12 21:24:17] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-09(UNSAT) depth K=10 took 4192 ms
[2022-06-12 21:24:31] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-13(UNSAT) depth K=10 took 13677 ms
[2022-06-12 21:25:57] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-00(UNSAT) depth K=11 took 85830 ms
[2022-06-12 21:26:12] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(UNSAT) depth K=11 took 15302 ms
[2022-06-12 21:26:26] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-06
[2022-06-12 21:26:26] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(SAT) depth K=3 took 276314 ms
[2022-06-12 21:26:37] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-09
[2022-06-12 21:26:37] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-09(SAT) depth K=3 took 10553 ms
[2022-06-12 21:26:45] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-13
[2022-06-12 21:26:45] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-13(SAT) depth K=3 took 8519 ms
[2022-06-12 21:26:49] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-09(UNSAT) depth K=11 took 36857 ms
[2022-06-12 21:27:02] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-00
[2022-06-12 21:27:02] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-00(SAT) depth K=4 took 16723 ms
[2022-06-12 21:27:06] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-13(UNSAT) depth K=11 took 16814 ms
[2022-06-12 21:27:22] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-06
[2022-06-12 21:27:22] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(SAT) depth K=4 took 20274 ms
[2022-06-12 21:27:45] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-09
[2022-06-12 21:27:45] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-09(SAT) depth K=4 took 22722 ms
[2022-06-12 21:28:01] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-00(UNSAT) depth K=12 took 55898 ms
[2022-06-12 21:28:10] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-13
[2022-06-12 21:28:10] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-13(SAT) depth K=4 took 25385 ms
[2022-06-12 21:28:17] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(UNSAT) depth K=12 took 15210 ms
[2022-06-12 21:28:44] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-00
[2022-06-12 21:28:44] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-00(SAT) depth K=5 took 34236 ms
[2022-06-12 21:29:13] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-06
[2022-06-12 21:29:13] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(SAT) depth K=5 took 28895 ms
[2022-06-12 21:29:43] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-09
[2022-06-12 21:29:43] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-09(SAT) depth K=5 took 29262 ms
[2022-06-12 21:30:16] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-09(UNSAT) depth K=12 took 119861 ms
[2022-06-12 21:31:48] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-13(UNSAT) depth K=12 took 91919 ms
[2022-06-12 21:35:32] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-00(UNSAT) depth K=13 took 223738 ms
[2022-06-12 21:35:38] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(UNSAT) depth K=13 took 6151 ms
[2022-06-12 21:36:28] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-09(UNSAT) depth K=13 took 49251 ms
[2022-06-12 21:37:13] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-13(UNSAT) depth K=13 took 45234 ms
[2022-06-12 21:37:37] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-00(UNSAT) depth K=14 took 24451 ms
[2022-06-12 21:37:54] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-13
[2022-06-12 21:37:54] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-13(SAT) depth K=5 took 491312 ms
[2022-06-12 21:40:05] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-00
[2022-06-12 21:40:05] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-00(SAT) depth K=6 took 131483 ms
[2022-06-12 21:41:22] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-06
[2022-06-12 21:41:22] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(SAT) depth K=6 took 76365 ms
Detected timeout of ITS tools.
[2022-06-12 21:41:45] [INFO ] Applying decomposition
[2022-06-12 21:41:45] [INFO ] Flatten gal took : 11 ms
[2022-06-12 21:41:45] [INFO ] Decomposing Gal with order
[2022-06-12 21:41:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:41:45] [INFO ] Removed a total of 119 redundant transitions.
[2022-06-12 21:41:45] [INFO ] Flatten gal took : 48 ms
[2022-06-12 21:41:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 86 labels/synchronizations in 6 ms.
[2022-06-12 21:41:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7423697619966220902.gal : 3 ms
[2022-06-12 21:41:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4036526116617665289.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality7423697619966220902.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality4036526116617665289.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/ReachabilityCardinality7423697619966220902.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality4036526116617665289.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality4036526116617665289.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 6
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :6 after 8
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :8 after 14
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :14 after 25
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :25 after 40
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :40 after 150
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :150 after 304
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :304 after 878
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :878 after 2929
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :2929 after 15985
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :15985 after 51984
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :51984 after 133093
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :133093 after 309867
SDD proceeding with computation,4 properties remain. new max is 65536
SDD size :309867 after 659126
[2022-06-12 21:42:32] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-09
[2022-06-12 21:42:32] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-09(SAT) depth K=6 took 70226 ms
[2022-06-12 21:43:36] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-13
[2022-06-12 21:43:36] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-13(SAT) depth K=6 took 63860 ms
[2022-06-12 21:45:05] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(UNSAT) depth K=14 took 447757 ms
[2022-06-12 21:45:32] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-00
[2022-06-12 21:45:32] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-00(SAT) depth K=7 took 115662 ms
[2022-06-12 21:47:14] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-06
[2022-06-12 21:47:14] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(SAT) depth K=7 took 102693 ms
[2022-06-12 21:48:26] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-09
[2022-06-12 21:48:26] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-09(SAT) depth K=7 took 72053 ms
[2022-06-12 21:49:52] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-13
[2022-06-12 21:49:52] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-13(SAT) depth K=7 took 85657 ms
[2022-06-12 21:52:13] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-00
[2022-06-12 21:52:13] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-00(SAT) depth K=8 took 141326 ms
[2022-06-12 21:55:01] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-09(UNSAT) depth K=14 took 595873 ms
[2022-06-12 21:55:17] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-06
[2022-06-12 21:55:17] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(SAT) depth K=8 took 183728 ms
[2022-06-12 21:55:59] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-13(UNSAT) depth K=14 took 57881 ms
[2022-06-12 21:56:44] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-00(UNSAT) depth K=15 took 45290 ms
[2022-06-12 21:56:50] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-09
[2022-06-12 21:56:50] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-09(SAT) depth K=8 took 93240 ms
[2022-06-12 21:59:29] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-13
[2022-06-12 21:59:29] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-13(SAT) depth K=8 took 159216 ms
[2022-06-12 22:02:30] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(UNSAT) depth K=15 took 346172 ms
[2022-06-12 22:02:51] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-00
[2022-06-12 22:02:51] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-00(SAT) depth K=9 took 201036 ms
[2022-06-12 22:02:58] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-09(UNSAT) depth K=15 took 27634 ms
Detected timeout of ITS tools.
[2022-06-12 22:03:22] [INFO ] Flatten gal took : 11 ms
[2022-06-12 22:03:22] [INFO ] Input system was already deterministic with 223 transitions.
[2022-06-12 22:03:22] [INFO ] Transformed 218 places.
[2022-06-12 22:03:22] [INFO ] Transformed 223 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-12 22:03:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1041476867942169875.gal : 2 ms
[2022-06-12 22:03:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10563120925965010029.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality1041476867942169875.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality10563120925965010029.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --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/ReachabilityCardinality1041476867942169875.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality10563120925965010029.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/ReachabilityCardinality10563120925965010029.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 :6 after 7
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :13 after 17
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :29 after 30
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :32 after 84
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :270 after 273
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :547 after 553
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :1173 after 1189
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :43924 after 45874
[2022-06-12 22:03:23] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-13(UNSAT) depth K=15 took 25543 ms
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :105442 after 105443
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :262315 after 262318
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :580828 after 581143
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :886203 after 889345
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :889345 after 904924
[2022-06-12 22:04:50] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-00(UNSAT) depth K=16 took 86763 ms
[2022-06-12 22:06:43] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-06
[2022-06-12 22:06:43] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(SAT) depth K=9 took 232889 ms
[2022-06-12 22:08:24] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(UNSAT) depth K=16 took 213408 ms
[2022-06-12 22:11:18] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-09
[2022-06-12 22:11:18] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-09(SAT) depth K=9 took 274460 ms
[2022-06-12 22:14:38] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-13
[2022-06-12 22:14:38] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-13(SAT) depth K=9 took 200523 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="DoubleExponent-PT-010"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is DoubleExponent-PT-010, 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 r089-tall-165260117600074"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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