MCC'2022- Execution of r046-smll-165252115900200

About the Execution of 2021-gold for DES-PT-60a

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
3533.684	3049478.00	10812139.00	1903.00	TFTTTTFTTTTFFTFF	normal

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.r046-smll-165252115900200.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 DES-PT-60a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r046-smll-165252115900200
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 6.4K Apr 29 15:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 29 15:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 29 15:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 29 15:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 07:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 29 15:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Apr 29 15:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 29 15:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 29 15:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 9 07:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 9 07:24 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 110K 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 DES-PT-60a-ReachabilityCardinality-00
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-01
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-02
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-03
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-04
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-05
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-06
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-07
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-08
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-09
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-10
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-11
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-12
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-13
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-14
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1655075600292

Running Version 0
[2022-06-12 23:13:23] [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 23:13:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 23:13:24] [INFO ] Load time of PNML (sax parser for PT used): 225 ms
[2022-06-12 23:13:24] [INFO ] Transformed 354 places.
[2022-06-12 23:13:24] [INFO ] Transformed 311 transitions.
[2022-06-12 23:13:24] [INFO ] Found NUPN structural information;
[2022-06-12 23:13:24] [INFO ] Parsed PT model containing 354 places and 311 transitions in 310 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Incomplete random walk after 10000 steps, including 221 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 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 4 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 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 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 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 5 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Probabilistic random walk after 1000001 steps, saw 145075 distinct states, run finished after 3251 ms. (steps per millisecond=307 ) properties seen :{}
Running SMT prover for 16 properties.
// Phase 1: matrix 297 rows 354 cols
[2022-06-12 23:13:28] [INFO ] Computed 59 place invariants in 59 ms
[2022-06-12 23:13:28] [INFO ] [Real]Absence check using 34 positive place invariants in 40 ms returned sat
[2022-06-12 23:13:28] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 45 ms returned sat
[2022-06-12 23:13:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:13:29] [INFO ] [Real]Absence check using state equation in 604 ms returned sat
[2022-06-12 23:13:29] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:13:29] [INFO ] [Nat]Absence check using 34 positive place invariants in 40 ms returned sat
[2022-06-12 23:13:29] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 185 ms returned sat
[2022-06-12 23:13:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:13:34] [INFO ] [Nat]Absence check using state equation in 4441 ms returned sat
[2022-06-12 23:13:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-12 23:13:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 9 ms returned sat
[2022-06-12 23:13:34] [INFO ] Deduced a trap composed of 10 places in 304 ms of which 8 ms to minimize.
[2022-06-12 23:13:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2022-06-12 23:13:34] [INFO ] [Real]Absence check using 34 positive place invariants in 20 ms returned sat
[2022-06-12 23:13:34] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 28 ms returned sat
[2022-06-12 23:13:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:13:35] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2022-06-12 23:13:35] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:13:35] [INFO ] [Nat]Absence check using 34 positive place invariants in 20 ms returned sat
[2022-06-12 23:13:35] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 126 ms returned sat
[2022-06-12 23:13:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:13:37] [INFO ] [Nat]Absence check using state equation in 1958 ms returned sat
[2022-06-12 23:13:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 22 ms returned sat
[2022-06-12 23:13:37] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 2 ms to minimize.
[2022-06-12 23:13:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 241 ms
[2022-06-12 23:13:37] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 60 ms.
[2022-06-12 23:13:40] [INFO ] Added : 150 causal constraints over 30 iterations in 2524 ms. Result :unknown
[2022-06-12 23:13:40] [INFO ] [Real]Absence check using 34 positive place invariants in 30 ms returned sat
[2022-06-12 23:13:40] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 87 ms returned sat
[2022-06-12 23:13:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:13:44] [INFO ] [Real]Absence check using state equation in 3593 ms returned sat
[2022-06-12 23:13:44] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:13:44] [INFO ] [Real]Absence check using 34 positive place invariants in 15 ms returned sat
[2022-06-12 23:13:44] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 21 ms returned sat
[2022-06-12 23:13:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:13:44] [INFO ] [Real]Absence check using state equation in 501 ms returned sat
[2022-06-12 23:13:44] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:13:44] [INFO ] [Nat]Absence check using 34 positive place invariants in 24 ms returned sat
[2022-06-12 23:13:45] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 254 ms returned sat
[2022-06-12 23:13:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:13:46] [INFO ] [Nat]Absence check using state equation in 1669 ms returned sat
[2022-06-12 23:13:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2022-06-12 23:13:46] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 52 ms.
[2022-06-12 23:13:49] [INFO ] Deduced a trap composed of 9 places in 169 ms of which 2 ms to minimize.
[2022-06-12 23:13:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 237 ms
[2022-06-12 23:13:49] [INFO ] Added : 181 causal constraints over 37 iterations in 2323 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-06-12 23:13:49] [INFO ] [Real]Absence check using 34 positive place invariants in 21 ms returned sat
[2022-06-12 23:13:49] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 34 ms returned sat
[2022-06-12 23:13:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:13:50] [INFO ] [Real]Absence check using state equation in 877 ms returned sat
[2022-06-12 23:13:50] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:13:50] [INFO ] [Nat]Absence check using 34 positive place invariants in 27 ms returned sat
[2022-06-12 23:13:50] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 292 ms returned sat
[2022-06-12 23:13:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:13:55] [INFO ] [Nat]Absence check using state equation in 4510 ms returned sat
[2022-06-12 23:13:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2022-06-12 23:13:55] [INFO ] Deduced a trap composed of 18 places in 164 ms of which 1 ms to minimize.
[2022-06-12 23:13:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
[2022-06-12 23:13:55] [INFO ] [Real]Absence check using 34 positive place invariants in 13 ms returned sat
[2022-06-12 23:13:55] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 22 ms returned sat
[2022-06-12 23:13:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:13:55] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2022-06-12 23:13:55] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:13:55] [INFO ] [Real]Absence check using 34 positive place invariants in 18 ms returned sat
[2022-06-12 23:13:56] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 21 ms returned sat
[2022-06-12 23:13:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:13:56] [INFO ] [Real]Absence check using state equation in 57 ms returned unsat
[2022-06-12 23:13:56] [INFO ] [Real]Absence check using 34 positive place invariants in 21 ms returned sat
[2022-06-12 23:13:56] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 41 ms returned sat
[2022-06-12 23:13:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:13:56] [INFO ] [Real]Absence check using state equation in 407 ms returned sat
[2022-06-12 23:13:56] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:13:56] [INFO ] [Real]Absence check using 34 positive place invariants in 22 ms returned sat
[2022-06-12 23:13:56] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 33 ms returned sat
[2022-06-12 23:13:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:13:57] [INFO ] [Real]Absence check using state equation in 302 ms returned sat
[2022-06-12 23:13:57] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:13:57] [INFO ] [Real]Absence check using 34 positive place invariants in 24 ms returned sat
[2022-06-12 23:13:57] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 64 ms returned sat
[2022-06-12 23:13:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:13:59] [INFO ] [Real]Absence check using state equation in 1516 ms returned sat
[2022-06-12 23:13:59] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:13:59] [INFO ] [Real]Absence check using 34 positive place invariants in 15 ms returned sat
[2022-06-12 23:13:59] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 22 ms returned sat
[2022-06-12 23:13:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:13:59] [INFO ] [Real]Absence check using state equation in 486 ms returned sat
[2022-06-12 23:13:59] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:14:00] [INFO ] [Nat]Absence check using 34 positive place invariants in 27 ms returned unsat
[2022-06-12 23:14:00] [INFO ] [Real]Absence check using 34 positive place invariants in 67 ms returned sat
[2022-06-12 23:14:00] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 97 ms returned sat
[2022-06-12 23:14:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:14:05] [INFO ] [Real]Absence check using state equation in 4630 ms returned sat
[2022-06-12 23:14:05] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:14:05] [INFO ] [Nat]Absence check using 34 positive place invariants in 26 ms returned sat
[2022-06-12 23:14:05] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 240 ms returned sat
[2022-06-12 23:14:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:14:07] [INFO ] [Nat]Absence check using state equation in 1600 ms returned sat
[2022-06-12 23:14:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 15 ms returned sat
[2022-06-12 23:14:07] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 48 ms.
[2022-06-12 23:14:10] [INFO ] Added : 254 causal constraints over 51 iterations in 2969 ms. Result :unknown
[2022-06-12 23:14:10] [INFO ] [Real]Absence check using 34 positive place invariants in 46 ms returned sat
[2022-06-12 23:14:10] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 92 ms returned sat
[2022-06-12 23:14:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:14:11] [INFO ] [Real]Absence check using state equation in 968 ms returned sat
[2022-06-12 23:14:11] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:14:11] [INFO ] [Nat]Absence check using 34 positive place invariants in 16 ms returned sat
[2022-06-12 23:14:11] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 189 ms returned sat
[2022-06-12 23:14:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:14:16] [INFO ] [Nat]Absence check using state equation in 4729 ms returned unknown
[2022-06-12 23:14:16] [INFO ] [Real]Absence check using 34 positive place invariants in 15 ms returned sat
[2022-06-12 23:14:16] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 21 ms returned sat
[2022-06-12 23:14:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:14:16] [INFO ] [Real]Absence check using state equation in 288 ms returned sat
[2022-06-12 23:14:16] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:14:17] [INFO ] [Real]Absence check using 34 positive place invariants in 22 ms returned sat
[2022-06-12 23:14:17] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 35 ms returned sat
[2022-06-12 23:14:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:14:17] [INFO ] [Real]Absence check using state equation in 260 ms returned sat
[2022-06-12 23:14:17] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:14:17] [INFO ] [Nat]Absence check using 34 positive place invariants in 24 ms returned sat
[2022-06-12 23:14:18] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 450 ms returned sat
[2022-06-12 23:14:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:14:18] [INFO ] [Nat]Absence check using state equation in 486 ms returned sat
[2022-06-12 23:14:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-06-12 23:14:18] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 22 ms.
[2022-06-12 23:14:21] [INFO ] Added : 242 causal constraints over 49 iterations in 2944 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-06-12 23:14:21] [INFO ] [Real]Absence check using 34 positive place invariants in 22 ms returned sat
[2022-06-12 23:14:21] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 45 ms returned sat
[2022-06-12 23:14:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:14:22] [INFO ] [Real]Absence check using state equation in 385 ms returned sat
[2022-06-12 23:14:22] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:14:22] [INFO ] [Nat]Absence check using 34 positive place invariants in 25 ms returned sat
[2022-06-12 23:14:22] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 182 ms returned sat
[2022-06-12 23:14:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:14:27] [INFO ] [Nat]Absence check using state equation in 4671 ms returned unknown
FORMULA DES-PT-60a-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-60a-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-60a-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-60a-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-60a-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-60a-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-60a-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-60a-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 16 Parikh solutions to 5 different solutions.
Incomplete Parikh walk after 282000 steps, including 7076 resets, run finished after 1048 ms. (steps per millisecond=269 ) properties (out of 8) seen :0 could not realise parikh vector
Incomplete Parikh walk after 223900 steps, including 5931 resets, run finished after 894 ms. (steps per millisecond=250 ) properties (out of 8) seen :0 could not realise parikh vector
Incomplete Parikh walk after 279400 steps, including 7596 resets, run finished after 938 ms. (steps per millisecond=297 ) properties (out of 8) seen :0 could not realise parikh vector
Incomplete Parikh walk after 281300 steps, including 6778 resets, run finished after 976 ms. (steps per millisecond=288 ) properties (out of 8) seen :1 could not realise parikh vector
FORMULA DES-PT-60a-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 48 out of 354 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 354/354 places, 297/297 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 354 transition count 296
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 6 place count 354 transition count 296
Applied a total of 6 rules in 108 ms. Remains 354 /354 variables (removed 0) and now considering 296/297 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 354/354 places, 296/297 transitions.
[2022-06-12 23:14:31] [INFO ] Flatten gal took : 99 ms
[2022-06-12 23:14:31] [INFO ] Flatten gal took : 44 ms
[2022-06-12 23:14:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality456251613534703082.gal : 29 ms
[2022-06-12 23:14:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1077240065677110620.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/ReachabilityCardinality456251613534703082.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality1077240065677110620.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/ReachabilityCardinality456251613534703082.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality1077240065677110620.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality1077240065677110620.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :5 after 15
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :15 after 17
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :17 after 21
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :21 after 43
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :43 after 51
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :51 after 661
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :661 after 729
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :729 after 1433
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :11045 after 93225
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :93225 after 1.52884e+06
Detected timeout of ITS tools.
[2022-06-12 23:14:46] [INFO ] Flatten gal took : 37 ms
[2022-06-12 23:14:46] [INFO ] Applying decomposition
[2022-06-12 23:14:46] [INFO ] Flatten gal took : 47 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/graph8180529594902717408.txt, -o, /tmp/graph8180529594902717408.bin, -w, /tmp/graph8180529594902717408.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/graph8180529594902717408.bin, -l, -1, -v, -w, /tmp/graph8180529594902717408.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 23:14:47] [INFO ] Decomposing Gal with order
[2022-06-12 23:14:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 23:14:47] [INFO ] Removed a total of 71 redundant transitions.
[2022-06-12 23:14:47] [INFO ] Flatten gal took : 131 ms
[2022-06-12 23:14:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 53 labels/synchronizations in 12 ms.
[2022-06-12 23:14:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12157428688538668069.gal : 13 ms
[2022-06-12 23:14:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17842844286685094812.prop : 23 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/ReachabilityCardinality12157428688538668069.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality17842844286685094812.prop, --nowitness], 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/ReachabilityCardinality12157428688538668069.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality17842844286685094812.prop --nowitness
Loading property file /tmp/ReachabilityCardinality17842844286685094812.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :5 after 9
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :9 after 89
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :89 after 249
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :249 after 6469
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :6469 after 2.51723e+08
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :2.51723e+08 after 5.17168e+08
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :5.17168e+08 after 8.48976e+08
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :8.48976e+08 after 1.41305e+09
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1636688322646235042
[2022-06-12 23:15:02] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1636688322646235042
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/ltsmin1636688322646235042]
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/ltsmin1636688322646235042] 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/ltsmin1636688322646235042] 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 16446 resets, run finished after 4438 ms. (steps per millisecond=225 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3003 resets, run finished after 1224 ms. (steps per millisecond=816 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2988 resets, run finished after 1282 ms. (steps per millisecond=780 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2997 resets, run finished after 1134 ms. (steps per millisecond=881 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3423 resets, run finished after 2164 ms. (steps per millisecond=462 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3022 resets, run finished after 2564 ms. (steps per millisecond=390 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2888 resets, run finished after 1148 ms. (steps per millisecond=871 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3011 resets, run finished after 1155 ms. (steps per millisecond=865 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 12334738 steps, run timeout after 30001 ms. (steps per millisecond=411 ) properties seen :{}
Probabilistic random walk after 12334738 steps, saw 1489632 distinct states, run finished after 30001 ms. (steps per millisecond=411 ) properties seen :{}
Running SMT prover for 7 properties.
// Phase 1: matrix 296 rows 354 cols
[2022-06-12 23:15:48] [INFO ] Computed 60 place invariants in 15 ms
[2022-06-12 23:15:48] [INFO ] [Real]Absence check using 34 positive place invariants in 23 ms returned sat
[2022-06-12 23:15:48] [INFO ] [Real]Absence check using 34 positive and 26 generalized place invariants in 49 ms returned sat
[2022-06-12 23:15:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:15:49] [INFO ] [Real]Absence check using state equation in 333 ms returned sat
[2022-06-12 23:15:49] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:15:49] [INFO ] [Nat]Absence check using 34 positive place invariants in 18 ms returned sat
[2022-06-12 23:15:49] [INFO ] [Nat]Absence check using 34 positive and 26 generalized place invariants in 76 ms returned sat
[2022-06-12 23:15:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:15:50] [INFO ] [Nat]Absence check using state equation in 608 ms returned sat
[2022-06-12 23:15:50] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-06-12 23:15:50] [INFO ] [Nat]Added 4 Read/Feed constraints in 53 ms returned sat
[2022-06-12 23:15:50] [INFO ] Deduced a trap composed of 7 places in 175 ms of which 3 ms to minimize.
[2022-06-12 23:15:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
[2022-06-12 23:15:50] [INFO ] Computed and/alt/rep : 285/890/285 causal constraints (skipped 10 transitions) in 33 ms.
[2022-06-12 23:15:52] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 1 ms to minimize.
[2022-06-12 23:15:52] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 1 ms to minimize.
[2022-06-12 23:15:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 349 ms
[2022-06-12 23:15:52] [INFO ] Added : 161 causal constraints over 33 iterations in 2543 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-06-12 23:15:53] [INFO ] [Real]Absence check using 34 positive place invariants in 17 ms returned sat
[2022-06-12 23:15:53] [INFO ] [Real]Absence check using 34 positive and 26 generalized place invariants in 32 ms returned sat
[2022-06-12 23:15:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:15:53] [INFO ] [Real]Absence check using state equation in 214 ms returned sat
[2022-06-12 23:15:53] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:15:53] [INFO ] [Nat]Absence check using 34 positive place invariants in 24 ms returned sat
[2022-06-12 23:15:53] [INFO ] [Nat]Absence check using 34 positive and 26 generalized place invariants in 298 ms returned sat
[2022-06-12 23:15:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:15:54] [INFO ] [Nat]Absence check using state equation in 1123 ms returned sat
[2022-06-12 23:15:55] [INFO ] [Nat]Added 4 Read/Feed constraints in 714 ms returned sat
[2022-06-12 23:15:55] [INFO ] Computed and/alt/rep : 285/890/285 causal constraints (skipped 10 transitions) in 25 ms.
[2022-06-12 23:15:58] [INFO ] Added : 279 causal constraints over 56 iterations in 2866 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-06-12 23:15:58] [INFO ] [Real]Absence check using 34 positive place invariants in 26 ms returned sat
[2022-06-12 23:15:58] [INFO ] [Real]Absence check using 34 positive and 26 generalized place invariants in 41 ms returned sat
[2022-06-12 23:15:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:15:59] [INFO ] [Real]Absence check using state equation in 401 ms returned sat
[2022-06-12 23:15:59] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:15:59] [INFO ] [Nat]Absence check using 34 positive place invariants in 24 ms returned sat
[2022-06-12 23:15:59] [INFO ] [Nat]Absence check using 34 positive and 26 generalized place invariants in 222 ms returned sat
[2022-06-12 23:15:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:16:02] [INFO ] [Nat]Absence check using state equation in 3069 ms returned sat
[2022-06-12 23:16:02] [INFO ] [Nat]Added 4 Read/Feed constraints in 300 ms returned sat
[2022-06-12 23:16:03] [INFO ] Computed and/alt/rep : 285/890/285 causal constraints (skipped 10 transitions) in 30 ms.
[2022-06-12 23:16:05] [INFO ] Added : 221 causal constraints over 45 iterations in 2006 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-06-12 23:16:05] [INFO ] [Real]Absence check using 34 positive place invariants in 27 ms returned sat
[2022-06-12 23:16:05] [INFO ] [Real]Absence check using 34 positive and 26 generalized place invariants in 56 ms returned sat
[2022-06-12 23:16:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:16:10] [INFO ] [Real]Absence check using state equation in 5096 ms returned sat
[2022-06-12 23:16:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:16:10] [INFO ] [Nat]Absence check using 34 positive place invariants in 16 ms returned sat
[2022-06-12 23:16:11] [INFO ] [Nat]Absence check using 34 positive and 26 generalized place invariants in 690 ms returned sat
[2022-06-12 23:16:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:16:15] [INFO ] [Nat]Absence check using state equation in 4023 ms returned sat
[2022-06-12 23:16:15] [INFO ] [Nat]Added 4 Read/Feed constraints in 141 ms returned sat
[2022-06-12 23:16:15] [INFO ] Computed and/alt/rep : 285/890/285 causal constraints (skipped 10 transitions) in 32 ms.
[2022-06-12 23:16:18] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
[2022-06-12 23:16:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2022-06-12 23:16:19] [INFO ] Added : 249 causal constraints over 50 iterations in 3686 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 29 ms.
[2022-06-12 23:16:19] [INFO ] [Real]Absence check using 34 positive place invariants in 27 ms returned sat
[2022-06-12 23:16:19] [INFO ] [Real]Absence check using 34 positive and 26 generalized place invariants in 62 ms returned sat
[2022-06-12 23:16:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:16:20] [INFO ] [Real]Absence check using state equation in 880 ms returned sat
[2022-06-12 23:16:20] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:16:20] [INFO ] [Nat]Absence check using 34 positive place invariants in 24 ms returned sat
[2022-06-12 23:16:20] [INFO ] [Nat]Absence check using 34 positive and 26 generalized place invariants in 288 ms returned sat
[2022-06-12 23:16:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:16:24] [INFO ] [Nat]Absence check using state equation in 4022 ms returned sat
[2022-06-12 23:16:24] [INFO ] [Nat]Added 4 Read/Feed constraints in 12 ms returned sat
[2022-06-12 23:16:24] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2022-06-12 23:16:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 620 ms
[2022-06-12 23:16:25] [INFO ] Computed and/alt/rep : 285/890/285 causal constraints (skipped 10 transitions) in 28 ms.
[2022-06-12 23:16:25] [INFO ] Added : 41 causal constraints over 9 iterations in 616 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 64 ms.
[2022-06-12 23:16:26] [INFO ] [Real]Absence check using 34 positive place invariants in 20 ms returned sat
[2022-06-12 23:16:26] [INFO ] [Real]Absence check using 34 positive and 26 generalized place invariants in 36 ms returned sat
[2022-06-12 23:16:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:16:26] [INFO ] [Real]Absence check using state equation in 611 ms returned sat
[2022-06-12 23:16:26] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:16:26] [INFO ] [Nat]Absence check using 34 positive place invariants in 16 ms returned sat
[2022-06-12 23:16:27] [INFO ] [Nat]Absence check using 34 positive and 26 generalized place invariants in 106 ms returned sat
[2022-06-12 23:16:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:16:29] [INFO ] [Nat]Absence check using state equation in 2009 ms returned sat
[2022-06-12 23:16:29] [INFO ] [Nat]Added 4 Read/Feed constraints in 189 ms returned sat
[2022-06-12 23:16:29] [INFO ] Computed and/alt/rep : 285/890/285 causal constraints (skipped 10 transitions) in 31 ms.
[2022-06-12 23:16:32] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2022-06-12 23:16:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2022-06-12 23:16:32] [INFO ] Added : 264 causal constraints over 53 iterations in 2812 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-06-12 23:16:32] [INFO ] [Real]Absence check using 34 positive place invariants in 15 ms returned sat
[2022-06-12 23:16:32] [INFO ] [Real]Absence check using 34 positive and 26 generalized place invariants in 28 ms returned sat
[2022-06-12 23:16:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:16:32] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2022-06-12 23:16:32] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:16:32] [INFO ] [Nat]Absence check using 34 positive place invariants in 22 ms returned sat
[2022-06-12 23:16:32] [INFO ] [Nat]Absence check using 34 positive and 26 generalized place invariants in 137 ms returned sat
[2022-06-12 23:16:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:16:33] [INFO ] [Nat]Absence check using state equation in 1034 ms returned sat
[2022-06-12 23:16:34] [INFO ] [Nat]Added 4 Read/Feed constraints in 670 ms returned sat
[2022-06-12 23:16:34] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2022-06-12 23:16:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2022-06-12 23:16:34] [INFO ] Computed and/alt/rep : 285/890/285 causal constraints (skipped 10 transitions) in 31 ms.
[2022-06-12 23:16:36] [INFO ] Added : 143 causal constraints over 29 iterations in 2010 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
Incomplete Parikh walk after 168400 steps, including 4137 resets, run finished after 808 ms. (steps per millisecond=208 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 284300 steps, including 7175 resets, run finished after 948 ms. (steps per millisecond=299 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 207400 steps, including 5037 resets, run finished after 869 ms. (steps per millisecond=238 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 257600 steps, including 5728 resets, run finished after 849 ms. (steps per millisecond=303 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 4600 steps, including 925 resets, run finished after 23 ms. (steps per millisecond=200 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 266700 steps, including 6978 resets, run finished after 887 ms. (steps per millisecond=300 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 146400 steps, including 3102 resets, run finished after 476 ms. (steps per millisecond=307 ) properties (out of 7) seen :0 could not realise parikh vector
Support contains 48 out of 354 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 354/354 places, 296/296 transitions.
Applied a total of 0 rules in 48 ms. Remains 354 /354 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 354/354 places, 296/296 transitions.
Starting structural reductions, iteration 0 : 354/354 places, 296/296 transitions.
Applied a total of 0 rules in 27 ms. Remains 354 /354 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 354 cols
[2022-06-12 23:16:41] [INFO ] Computed 60 place invariants in 10 ms
[2022-06-12 23:16:42] [INFO ] Implicit Places using invariants in 716 ms returned [251]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 721 ms to find 1 implicit places.
[2022-06-12 23:16:42] [INFO ] Redundant transitions in 35 ms returned []
// Phase 1: matrix 296 rows 353 cols
[2022-06-12 23:16:42] [INFO ] Computed 59 place invariants in 11 ms
[2022-06-12 23:16:42] [INFO ] Dead Transitions using invariants and state equation in 606 ms returned []
Starting structural reductions, iteration 1 : 353/354 places, 296/296 transitions.
Applied a total of 0 rules in 19 ms. Remains 353 /353 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2022-06-12 23:16:42] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 296 rows 353 cols
[2022-06-12 23:16:43] [INFO ] Computed 59 place invariants in 10 ms
[2022-06-12 23:16:43] [INFO ] Dead Transitions using invariants and state equation in 463 ms returned []
Finished structural reductions, in 2 iterations. Remains : 353/354 places, 296/296 transitions.
[2022-06-12 23:16:43] [INFO ] Flatten gal took : 30 ms
[2022-06-12 23:16:43] [INFO ] Flatten gal took : 30 ms
[2022-06-12 23:16:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8144427200364619899.gal : 3 ms
[2022-06-12 23:16:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7941701133009550868.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/ReachabilityCardinality8144427200364619899.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality7941701133009550868.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/ReachabilityCardinality8144427200364619899.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality7941701133009550868.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality7941701133009550868.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :5 after 15
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :15 after 17
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :17 after 21
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :21 after 43
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :43 after 51
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :51 after 661
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :661 after 729
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :729 after 1585
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :11045 after 90857
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :90857 after 1.52349e+06
Detected timeout of ITS tools.
[2022-06-12 23:16:58] [INFO ] Flatten gal took : 37 ms
[2022-06-12 23:16:58] [INFO ] Applying decomposition
[2022-06-12 23:16:58] [INFO ] Flatten gal took : 44 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/graph18111727813061837115.txt, -o, /tmp/graph18111727813061837115.bin, -w, /tmp/graph18111727813061837115.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/graph18111727813061837115.bin, -l, -1, -v, -w, /tmp/graph18111727813061837115.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 23:16:58] [INFO ] Decomposing Gal with order
[2022-06-12 23:16:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 23:16:58] [INFO ] Removed a total of 71 redundant transitions.
[2022-06-12 23:16:58] [INFO ] Flatten gal took : 77 ms
[2022-06-12 23:16:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 51 labels/synchronizations in 7 ms.
[2022-06-12 23:16:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1309408931974595864.gal : 8 ms
[2022-06-12 23:16:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8897467717315439159.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/ReachabilityCardinality1309408931974595864.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality8897467717315439159.prop, --nowitness], 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/ReachabilityCardinality1309408931974595864.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality8897467717315439159.prop --nowitness
Loading property file /tmp/ReachabilityCardinality8897467717315439159.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :5 after 101
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :101 after 173
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :173 after 385
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :385 after 6469
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :6469 after 8.25534e+08
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :8.25534e+08 after 1.59921e+09
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :1.59921e+09 after 2.45884e+09
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :2.45884e+09 after 3.83432e+09
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5550617504232093624
[2022-06-12 23:17:13] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5550617504232093624
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/ltsmin5550617504232093624]
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/ltsmin5550617504232093624] 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/ltsmin5550617504232093624] 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 16447 resets, run finished after 3088 ms. (steps per millisecond=323 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2977 resets, run finished after 1149 ms. (steps per millisecond=870 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2923 resets, run finished after 1144 ms. (steps per millisecond=874 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2886 resets, run finished after 1110 ms. (steps per millisecond=900 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3384 resets, run finished after 2152 ms. (steps per millisecond=464 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3055 resets, run finished after 2175 ms. (steps per millisecond=459 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2938 resets, run finished after 1154 ms. (steps per millisecond=866 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2974 resets, run finished after 1162 ms. (steps per millisecond=860 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 12797371 steps, run timeout after 30001 ms. (steps per millisecond=426 ) properties seen :{}
Probabilistic random walk after 12797371 steps, saw 1548953 distinct states, run finished after 30002 ms. (steps per millisecond=426 ) properties seen :{}
Running SMT prover for 7 properties.
// Phase 1: matrix 296 rows 353 cols
[2022-06-12 23:17:58] [INFO ] Computed 59 place invariants in 21 ms
[2022-06-12 23:17:58] [INFO ] [Real]Absence check using 33 positive place invariants in 22 ms returned sat
[2022-06-12 23:17:58] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 39 ms returned sat
[2022-06-12 23:17:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:17:58] [INFO ] [Real]Absence check using state equation in 284 ms returned sat
[2022-06-12 23:17:58] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:17:58] [INFO ] [Nat]Absence check using 33 positive place invariants in 23 ms returned sat
[2022-06-12 23:17:59] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 416 ms returned sat
[2022-06-12 23:17:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:18:01] [INFO ] [Nat]Absence check using state equation in 2037 ms returned sat
[2022-06-12 23:18:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-12 23:18:01] [INFO ] [Nat]Added 2 Read/Feed constraints in 7 ms returned sat
[2022-06-12 23:18:01] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 1 ms to minimize.
[2022-06-12 23:18:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2022-06-12 23:18:01] [INFO ] Computed and/alt/rep : 285/890/285 causal constraints (skipped 10 transitions) in 22 ms.
[2022-06-12 23:18:02] [INFO ] Added : 147 causal constraints over 30 iterations in 1117 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-06-12 23:18:02] [INFO ] [Real]Absence check using 33 positive place invariants in 14 ms returned sat
[2022-06-12 23:18:02] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 23 ms returned sat
[2022-06-12 23:18:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:18:02] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2022-06-12 23:18:02] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:18:02] [INFO ] [Nat]Absence check using 33 positive place invariants in 23 ms returned sat
[2022-06-12 23:18:03] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 310 ms returned sat
[2022-06-12 23:18:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:18:06] [INFO ] [Nat]Absence check using state equation in 2998 ms returned sat
[2022-06-12 23:18:06] [INFO ] [Nat]Added 2 Read/Feed constraints in 115 ms returned sat
[2022-06-12 23:18:06] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 15 ms to minimize.
[2022-06-12 23:18:06] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2022-06-12 23:18:06] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 1 ms to minimize.
[2022-06-12 23:18:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 383 ms
[2022-06-12 23:18:06] [INFO ] Computed and/alt/rep : 285/890/285 causal constraints (skipped 10 transitions) in 21 ms.
[2022-06-12 23:18:07] [INFO ] Added : 120 causal constraints over 24 iterations in 915 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-06-12 23:18:07] [INFO ] [Real]Absence check using 33 positive place invariants in 15 ms returned sat
[2022-06-12 23:18:07] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 25 ms returned sat
[2022-06-12 23:18:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:18:07] [INFO ] [Real]Absence check using state equation in 265 ms returned sat
[2022-06-12 23:18:07] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:18:08] [INFO ] [Nat]Absence check using 33 positive place invariants in 27 ms returned sat
[2022-06-12 23:18:08] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 714 ms returned sat
[2022-06-12 23:18:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:18:11] [INFO ] [Nat]Absence check using state equation in 2462 ms returned sat
[2022-06-12 23:18:11] [INFO ] [Nat]Added 2 Read/Feed constraints in 375 ms returned sat
[2022-06-12 23:18:11] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 0 ms to minimize.
[2022-06-12 23:18:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2022-06-12 23:18:11] [INFO ] Computed and/alt/rep : 285/890/285 causal constraints (skipped 10 transitions) in 24 ms.
[2022-06-12 23:18:13] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2022-06-12 23:18:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2022-06-12 23:18:14] [INFO ] Added : 179 causal constraints over 37 iterations in 2285 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-06-12 23:18:14] [INFO ] [Real]Absence check using 33 positive place invariants in 15 ms returned sat
[2022-06-12 23:18:14] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 38 ms returned sat
[2022-06-12 23:18:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:18:19] [INFO ] [Real]Absence check using state equation in 4932 ms returned sat
[2022-06-12 23:18:19] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:18:19] [INFO ] [Nat]Absence check using 33 positive place invariants in 26 ms returned sat
[2022-06-12 23:18:19] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 574 ms returned sat
[2022-06-12 23:18:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:18:23] [INFO ] [Nat]Absence check using state equation in 3317 ms returned sat
[2022-06-12 23:18:24] [INFO ] [Nat]Added 2 Read/Feed constraints in 1715 ms returned sat
[2022-06-12 23:18:24] [INFO ] Computed and/alt/rep : 285/890/285 causal constraints (skipped 10 transitions) in 29 ms.
[2022-06-12 23:18:27] [INFO ] Added : 248 causal constraints over 50 iterations in 2718 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 20 ms.
[2022-06-12 23:18:27] [INFO ] [Real]Absence check using 33 positive place invariants in 17 ms returned sat
[2022-06-12 23:18:27] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 43 ms returned sat
[2022-06-12 23:18:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:18:28] [INFO ] [Real]Absence check using state equation in 686 ms returned sat
[2022-06-12 23:18:28] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:18:28] [INFO ] [Nat]Absence check using 33 positive place invariants in 27 ms returned sat
[2022-06-12 23:18:29] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 847 ms returned sat
[2022-06-12 23:18:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:18:34] [INFO ] [Nat]Absence check using state equation in 4836 ms returned sat
[2022-06-12 23:18:34] [INFO ] [Nat]Added 2 Read/Feed constraints in 63 ms returned sat
[2022-06-12 23:18:34] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2022-06-12 23:18:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2022-06-12 23:18:34] [INFO ] Computed and/alt/rep : 285/890/285 causal constraints (skipped 10 transitions) in 21 ms.
[2022-06-12 23:18:36] [INFO ] Added : 166 causal constraints over 34 iterations in 1750 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 16 ms.
[2022-06-12 23:18:36] [INFO ] [Real]Absence check using 33 positive place invariants in 17 ms returned sat
[2022-06-12 23:18:36] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 30 ms returned sat
[2022-06-12 23:18:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:18:36] [INFO ] [Real]Absence check using state equation in 322 ms returned sat
[2022-06-12 23:18:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:18:37] [INFO ] [Nat]Absence check using 33 positive place invariants in 23 ms returned sat
[2022-06-12 23:18:38] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 1440 ms returned sat
[2022-06-12 23:18:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:18:40] [INFO ] [Nat]Absence check using state equation in 1991 ms returned sat
[2022-06-12 23:18:40] [INFO ] [Nat]Added 2 Read/Feed constraints in 63 ms returned sat
[2022-06-12 23:18:40] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 1 ms to minimize.
[2022-06-12 23:18:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2022-06-12 23:18:40] [INFO ] Computed and/alt/rep : 285/890/285 causal constraints (skipped 10 transitions) in 21 ms.
[2022-06-12 23:18:44] [INFO ] Added : 274 causal constraints over 55 iterations in 3870 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-06-12 23:18:44] [INFO ] [Real]Absence check using 33 positive place invariants in 13 ms returned sat
[2022-06-12 23:18:44] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 23 ms returned sat
[2022-06-12 23:18:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:18:45] [INFO ] [Real]Absence check using state equation in 356 ms returned sat
[2022-06-12 23:18:45] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:18:45] [INFO ] [Nat]Absence check using 33 positive place invariants in 23 ms returned sat
[2022-06-12 23:18:45] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 785 ms returned sat
[2022-06-12 23:18:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:18:47] [INFO ] [Nat]Absence check using state equation in 1382 ms returned sat
[2022-06-12 23:18:47] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2022-06-12 23:18:47] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 1 ms to minimize.
[2022-06-12 23:18:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2022-06-12 23:18:47] [INFO ] Computed and/alt/rep : 285/890/285 causal constraints (skipped 10 transitions) in 21 ms.
[2022-06-12 23:18:48] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 0 ms to minimize.
[2022-06-12 23:18:49] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 1 ms to minimize.
[2022-06-12 23:18:49] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 1 ms to minimize.
[2022-06-12 23:18:49] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 1 ms to minimize.
[2022-06-12 23:18:49] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 1 ms to minimize.
[2022-06-12 23:18:49] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 0 ms to minimize.
[2022-06-12 23:18:49] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 993 ms
[2022-06-12 23:18:49] [INFO ] Added : 113 causal constraints over 23 iterations in 2368 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
Incomplete Parikh walk after 168000 steps, including 3466 resets, run finished after 890 ms. (steps per millisecond=188 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 203400 steps, including 4558 resets, run finished after 664 ms. (steps per millisecond=306 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 214900 steps, including 5409 resets, run finished after 707 ms. (steps per millisecond=303 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 256200 steps, including 6599 resets, run finished after 848 ms. (steps per millisecond=302 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 197800 steps, including 4133 resets, run finished after 654 ms. (steps per millisecond=302 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 271200 steps, including 5632 resets, run finished after 861 ms. (steps per millisecond=314 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 86000 steps, including 1341 resets, run finished after 270 ms. (steps per millisecond=318 ) properties (out of 7) seen :0 could not realise parikh vector
Support contains 48 out of 353 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 353/353 places, 296/296 transitions.
Applied a total of 0 rules in 17 ms. Remains 353 /353 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 353/353 places, 296/296 transitions.
Starting structural reductions, iteration 0 : 353/353 places, 296/296 transitions.
Applied a total of 0 rules in 17 ms. Remains 353 /353 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 353 cols
[2022-06-12 23:18:54] [INFO ] Computed 59 place invariants in 6 ms
[2022-06-12 23:18:55] [INFO ] Implicit Places using invariants in 483 ms returned []
// Phase 1: matrix 296 rows 353 cols
[2022-06-12 23:18:55] [INFO ] Computed 59 place invariants in 6 ms
[2022-06-12 23:18:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-12 23:18:57] [INFO ] Implicit Places using invariants and state equation in 2665 ms returned []
Implicit Place search using SMT with State Equation took 3160 ms to find 0 implicit places.
[2022-06-12 23:18:58] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 296 rows 353 cols
[2022-06-12 23:18:58] [INFO ] Computed 59 place invariants in 11 ms
[2022-06-12 23:18:58] [INFO ] Dead Transitions using invariants and state equation in 453 ms returned []
Finished structural reductions, in 1 iterations. Remains : 353/353 places, 296/296 transitions.
Incomplete random walk after 100000 steps, including 1637 resets, run finished after 619 ms. (steps per millisecond=161 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 296 rows 353 cols
[2022-06-12 23:18:59] [INFO ] Computed 59 place invariants in 11 ms
[2022-06-12 23:18:59] [INFO ] [Real]Absence check using 33 positive place invariants in 15 ms returned sat
[2022-06-12 23:18:59] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 23 ms returned sat
[2022-06-12 23:18:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:18:59] [INFO ] [Real]Absence check using state equation in 384 ms returned sat
[2022-06-12 23:18:59] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:18:59] [INFO ] [Nat]Absence check using 33 positive place invariants in 23 ms returned sat
[2022-06-12 23:19:00] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 385 ms returned sat
[2022-06-12 23:19:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:19:02] [INFO ] [Nat]Absence check using state equation in 2390 ms returned sat
[2022-06-12 23:19:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-12 23:19:02] [INFO ] [Nat]Added 2 Read/Feed constraints in 12 ms returned sat
[2022-06-12 23:19:02] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 1 ms to minimize.
[2022-06-12 23:19:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2022-06-12 23:19:02] [INFO ] Computed and/alt/rep : 285/890/285 causal constraints (skipped 10 transitions) in 24 ms.
[2022-06-12 23:19:03] [INFO ] Added : 147 causal constraints over 30 iterations in 1014 ms. Result :sat
[2022-06-12 23:19:03] [INFO ] [Real]Absence check using 33 positive place invariants in 14 ms returned sat
[2022-06-12 23:19:03] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 25 ms returned sat
[2022-06-12 23:19:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:19:04] [INFO ] [Real]Absence check using state equation in 210 ms returned sat
[2022-06-12 23:19:04] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:19:04] [INFO ] [Nat]Absence check using 33 positive place invariants in 15 ms returned sat
[2022-06-12 23:19:04] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 256 ms returned sat
[2022-06-12 23:19:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:19:07] [INFO ] [Nat]Absence check using state equation in 3512 ms returned sat
[2022-06-12 23:19:08] [INFO ] [Nat]Added 2 Read/Feed constraints in 117 ms returned sat
[2022-06-12 23:19:08] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 0 ms to minimize.
[2022-06-12 23:19:08] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 0 ms to minimize.
[2022-06-12 23:19:08] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 1 ms to minimize.
[2022-06-12 23:19:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 395 ms
[2022-06-12 23:19:08] [INFO ] Computed and/alt/rep : 285/890/285 causal constraints (skipped 10 transitions) in 25 ms.
[2022-06-12 23:19:09] [INFO ] Added : 120 causal constraints over 24 iterations in 1335 ms. Result :sat
[2022-06-12 23:19:09] [INFO ] [Real]Absence check using 33 positive place invariants in 21 ms returned sat
[2022-06-12 23:19:09] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 38 ms returned sat
[2022-06-12 23:19:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:19:10] [INFO ] [Real]Absence check using state equation in 395 ms returned sat
[2022-06-12 23:19:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:19:10] [INFO ] [Nat]Absence check using 33 positive place invariants in 23 ms returned sat
[2022-06-12 23:19:11] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 677 ms returned sat
[2022-06-12 23:19:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:19:13] [INFO ] [Nat]Absence check using state equation in 2323 ms returned sat
[2022-06-12 23:19:13] [INFO ] [Nat]Added 2 Read/Feed constraints in 373 ms returned sat
[2022-06-12 23:19:13] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2022-06-12 23:19:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2022-06-12 23:19:13] [INFO ] Computed and/alt/rep : 285/890/285 causal constraints (skipped 10 transitions) in 20 ms.
[2022-06-12 23:19:15] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2022-06-12 23:19:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2022-06-12 23:19:16] [INFO ] Added : 179 causal constraints over 37 iterations in 2224 ms. Result :sat
[2022-06-12 23:19:16] [INFO ] [Real]Absence check using 33 positive place invariants in 27 ms returned sat
[2022-06-12 23:19:16] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 68 ms returned sat
[2022-06-12 23:19:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:19:22] [INFO ] [Real]Absence check using state equation in 6033 ms returned sat
[2022-06-12 23:19:22] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:19:22] [INFO ] [Nat]Absence check using 33 positive place invariants in 18 ms returned sat
[2022-06-12 23:19:22] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 334 ms returned sat
[2022-06-12 23:19:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:19:26] [INFO ] [Nat]Absence check using state equation in 3454 ms returned sat
[2022-06-12 23:19:28] [INFO ] [Nat]Added 2 Read/Feed constraints in 1681 ms returned sat
[2022-06-12 23:19:28] [INFO ] Computed and/alt/rep : 285/890/285 causal constraints (skipped 10 transitions) in 29 ms.
[2022-06-12 23:19:31] [INFO ] Added : 248 causal constraints over 50 iterations in 3239 ms. Result :sat
[2022-06-12 23:19:31] [INFO ] [Real]Absence check using 33 positive place invariants in 25 ms returned sat
[2022-06-12 23:19:31] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 68 ms returned sat
[2022-06-12 23:19:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:19:32] [INFO ] [Real]Absence check using state equation in 959 ms returned sat
[2022-06-12 23:19:32] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:19:32] [INFO ] [Nat]Absence check using 33 positive place invariants in 16 ms returned sat
[2022-06-12 23:19:33] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 849 ms returned sat
[2022-06-12 23:19:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:19:38] [INFO ] [Nat]Absence check using state equation in 4780 ms returned sat
[2022-06-12 23:19:38] [INFO ] [Nat]Added 2 Read/Feed constraints in 63 ms returned sat
[2022-06-12 23:19:38] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
[2022-06-12 23:19:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2022-06-12 23:19:38] [INFO ] Computed and/alt/rep : 285/890/285 causal constraints (skipped 10 transitions) in 30 ms.
[2022-06-12 23:19:40] [INFO ] Added : 166 causal constraints over 34 iterations in 1649 ms. Result :sat
[2022-06-12 23:19:40] [INFO ] [Real]Absence check using 33 positive place invariants in 13 ms returned sat
[2022-06-12 23:19:40] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 24 ms returned sat
[2022-06-12 23:19:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:19:40] [INFO ] [Real]Absence check using state equation in 346 ms returned sat
[2022-06-12 23:19:40] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:19:40] [INFO ] [Nat]Absence check using 33 positive place invariants in 23 ms returned sat
[2022-06-12 23:19:42] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 1681 ms returned sat
[2022-06-12 23:19:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:19:44] [INFO ] [Nat]Absence check using state equation in 1986 ms returned sat
[2022-06-12 23:19:44] [INFO ] [Nat]Added 2 Read/Feed constraints in 62 ms returned sat
[2022-06-12 23:19:44] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 0 ms to minimize.
[2022-06-12 23:19:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
[2022-06-12 23:19:44] [INFO ] Computed and/alt/rep : 285/890/285 causal constraints (skipped 10 transitions) in 19 ms.
[2022-06-12 23:19:48] [INFO ] Added : 274 causal constraints over 55 iterations in 4165 ms. Result :sat
[2022-06-12 23:19:48] [INFO ] [Real]Absence check using 33 positive place invariants in 16 ms returned sat
[2022-06-12 23:19:48] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 28 ms returned sat
[2022-06-12 23:19:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:19:49] [INFO ] [Real]Absence check using state equation in 408 ms returned sat
[2022-06-12 23:19:49] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:19:49] [INFO ] [Nat]Absence check using 33 positive place invariants in 25 ms returned sat
[2022-06-12 23:19:50] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 893 ms returned sat
[2022-06-12 23:19:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:19:51] [INFO ] [Nat]Absence check using state equation in 1385 ms returned sat
[2022-06-12 23:19:51] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2022-06-12 23:19:51] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 0 ms to minimize.
[2022-06-12 23:19:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2022-06-12 23:19:51] [INFO ] Computed and/alt/rep : 285/890/285 causal constraints (skipped 10 transitions) in 32 ms.
[2022-06-12 23:19:53] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 1 ms to minimize.
[2022-06-12 23:19:53] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 1 ms to minimize.
[2022-06-12 23:19:53] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 1 ms to minimize.
[2022-06-12 23:19:53] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 1 ms to minimize.
[2022-06-12 23:19:54] [INFO ] Deduced a trap composed of 21 places in 133 ms of which 0 ms to minimize.
[2022-06-12 23:19:54] [INFO ] Deduced a trap composed of 8 places in 193 ms of which 1 ms to minimize.
[2022-06-12 23:19:54] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1124 ms
[2022-06-12 23:19:54] [INFO ] Added : 113 causal constraints over 23 iterations in 2727 ms. Result :sat
[2022-06-12 23:19:54] [INFO ] Flatten gal took : 37 ms
[2022-06-12 23:19:54] [INFO ] Flatten gal took : 34 ms
[2022-06-12 23:19:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17194345238785697568.gal : 3 ms
[2022-06-12 23:19:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8772957293472545068.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/ReachabilityCardinality17194345238785697568.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality8772957293472545068.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/ReachabilityCardinality17194345238785697568.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality8772957293472545068.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality8772957293472545068.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :5 after 15
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :15 after 17
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :17 after 21
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :21 after 43
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :43 after 51
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :51 after 661
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :661 after 729
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :729 after 1585
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :11045 after 90857
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :90857 after 1.52349e+06
Detected timeout of ITS tools.
[2022-06-12 23:20:09] [INFO ] Flatten gal took : 18 ms
[2022-06-12 23:20:09] [INFO ] Applying decomposition
[2022-06-12 23:20:09] [INFO ] Flatten gal took : 17 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/graph15514375403539145697.txt, -o, /tmp/graph15514375403539145697.bin, -w, /tmp/graph15514375403539145697.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/graph15514375403539145697.bin, -l, -1, -v, -w, /tmp/graph15514375403539145697.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 23:20:09] [INFO ] Decomposing Gal with order
[2022-06-12 23:20:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 23:20:09] [INFO ] Removed a total of 23 redundant transitions.
[2022-06-12 23:20:09] [INFO ] Flatten gal took : 29 ms
[2022-06-12 23:20:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3 ms.
[2022-06-12 23:20:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9034389530152623203.gal : 3 ms
[2022-06-12 23:20:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality613972580661217383.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/ReachabilityCardinality9034389530152623203.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality613972580661217383.prop, --nowitness], 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/ReachabilityCardinality9034389530152623203.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality613972580661217383.prop --nowitness
Loading property file /tmp/ReachabilityCardinality613972580661217383.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :5 after 21
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :21 after 139
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :139 after 181
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :181 after 6469
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :6469 after 5.05119e+08
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :5.05119e+08 after 9.03288e+08
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :9.03288e+08 after 1.46736e+09
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14596664304435927194
[2022-06-12 23:20:24] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14596664304435927194
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/ltsmin14596664304435927194]
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/ltsmin14596664304435927194] 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/ltsmin14596664304435927194] 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)
Applied a total of 0 rules in 24 ms. Remains 353 /353 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 296 rows 353 cols
[2022-06-12 23:20:25] [INFO ] Computed 59 place invariants in 6 ms
[2022-06-12 23:20:26] [INFO ] [Real]Absence check using 33 positive place invariants in 22 ms returned sat
[2022-06-12 23:20:26] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 37 ms returned sat
[2022-06-12 23:20:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:20:26] [INFO ] [Real]Absence check using state equation in 351 ms returned sat
[2022-06-12 23:20:26] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:20:26] [INFO ] [Nat]Absence check using 33 positive place invariants in 14 ms returned sat
[2022-06-12 23:20:26] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 241 ms returned sat
[2022-06-12 23:20:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:20:28] [INFO ] [Nat]Absence check using state equation in 1957 ms returned sat
[2022-06-12 23:20:28] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 0 ms to minimize.
[2022-06-12 23:20:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2022-06-12 23:20:28] [INFO ] Computed and/alt/rep : 285/890/285 causal constraints (skipped 10 transitions) in 20 ms.
[2022-06-12 23:20:30] [INFO ] Added : 146 causal constraints over 30 iterations in 1231 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
[2022-06-12 23:20:30] [INFO ] [Real]Absence check using 33 positive place invariants in 15 ms returned sat
[2022-06-12 23:20:30] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 24 ms returned sat
[2022-06-12 23:20:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:20:30] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2022-06-12 23:20:30] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:20:30] [INFO ] [Nat]Absence check using 33 positive place invariants in 22 ms returned sat
[2022-06-12 23:20:30] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 310 ms returned sat
[2022-06-12 23:20:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:20:34] [INFO ] [Nat]Absence check using state equation in 3114 ms returned sat
[2022-06-12 23:20:34] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 0 ms to minimize.
[2022-06-12 23:20:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
[2022-06-12 23:20:34] [INFO ] Computed and/alt/rep : 285/890/285 causal constraints (skipped 10 transitions) in 21 ms.
[2022-06-12 23:20:35] [INFO ] Added : 124 causal constraints over 25 iterations in 1196 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
[2022-06-12 23:20:35] [INFO ] [Real]Absence check using 33 positive place invariants in 14 ms returned sat
[2022-06-12 23:20:35] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 43 ms returned sat
[2022-06-12 23:20:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:20:35] [INFO ] [Real]Absence check using state equation in 277 ms returned sat
[2022-06-12 23:20:35] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:20:35] [INFO ] [Nat]Absence check using 33 positive place invariants in 19 ms returned sat
[2022-06-12 23:20:36] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 414 ms returned sat
[2022-06-12 23:20:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:20:38] [INFO ] [Nat]Absence check using state equation in 2299 ms returned sat
[2022-06-12 23:20:38] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 0 ms to minimize.
[2022-06-12 23:20:38] [INFO ] Deduced a trap composed of 18 places in 147 ms of which 1 ms to minimize.
[2022-06-12 23:20:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 317 ms
[2022-06-12 23:20:39] [INFO ] Computed and/alt/rep : 285/890/285 causal constraints (skipped 10 transitions) in 29 ms.
[2022-06-12 23:20:41] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 3 ms to minimize.
[2022-06-12 23:20:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
[2022-06-12 23:20:41] [INFO ] Added : 181 causal constraints over 37 iterations in 2661 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-06-12 23:20:41] [INFO ] [Real]Absence check using 33 positive place invariants in 18 ms returned sat
[2022-06-12 23:20:41] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 43 ms returned sat
[2022-06-12 23:20:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:20:47] [INFO ] [Real]Absence check using state equation in 5280 ms returned sat
[2022-06-12 23:20:47] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:20:47] [INFO ] [Nat]Absence check using 33 positive place invariants in 17 ms returned sat
[2022-06-12 23:20:47] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 340 ms returned sat
[2022-06-12 23:20:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:20:50] [INFO ] [Nat]Absence check using state equation in 3165 ms returned sat
[2022-06-12 23:20:50] [INFO ] Computed and/alt/rep : 285/890/285 causal constraints (skipped 10 transitions) in 32 ms.
[2022-06-12 23:20:53] [INFO ] Added : 262 causal constraints over 53 iterations in 3231 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
[2022-06-12 23:20:54] [INFO ] [Real]Absence check using 33 positive place invariants in 18 ms returned sat
[2022-06-12 23:20:54] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 43 ms returned sat
[2022-06-12 23:20:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:20:54] [INFO ] [Real]Absence check using state equation in 702 ms returned sat
[2022-06-12 23:20:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:20:55] [INFO ] [Nat]Absence check using 33 positive place invariants in 20 ms returned sat
[2022-06-12 23:20:55] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 639 ms returned sat
[2022-06-12 23:20:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:21:01] [INFO ] [Nat]Absence check using state equation in 5495 ms returned sat
[2022-06-12 23:21:01] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2022-06-12 23:21:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
[2022-06-12 23:21:01] [INFO ] Computed and/alt/rep : 285/890/285 causal constraints (skipped 10 transitions) in 33 ms.
[2022-06-12 23:21:03] [INFO ] Added : 171 causal constraints over 35 iterations in 2499 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 29 ms.
[2022-06-12 23:21:04] [INFO ] [Real]Absence check using 33 positive place invariants in 22 ms returned sat
[2022-06-12 23:21:04] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 40 ms returned sat
[2022-06-12 23:21:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:21:04] [INFO ] [Real]Absence check using state equation in 378 ms returned sat
[2022-06-12 23:21:04] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:21:04] [INFO ] [Nat]Absence check using 33 positive place invariants in 24 ms returned sat
[2022-06-12 23:21:06] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 1411 ms returned sat
[2022-06-12 23:21:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:21:08] [INFO ] [Nat]Absence check using state equation in 1994 ms returned sat
[2022-06-12 23:21:08] [INFO ] Computed and/alt/rep : 285/890/285 causal constraints (skipped 10 transitions) in 20 ms.
[2022-06-12 23:21:09] [INFO ] Added : 215 causal constraints over 44 iterations in 1956 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
[2022-06-12 23:21:10] [INFO ] [Real]Absence check using 33 positive place invariants in 14 ms returned sat
[2022-06-12 23:21:10] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 24 ms returned sat
[2022-06-12 23:21:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:21:10] [INFO ] [Real]Absence check using state equation in 368 ms returned sat
[2022-06-12 23:21:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:21:10] [INFO ] [Nat]Absence check using 33 positive place invariants in 23 ms returned sat
[2022-06-12 23:21:11] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 802 ms returned sat
[2022-06-12 23:21:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:21:12] [INFO ] [Nat]Absence check using state equation in 1438 ms returned sat
[2022-06-12 23:21:12] [INFO ] Computed and/alt/rep : 285/890/285 causal constraints (skipped 10 transitions) in 29 ms.
[2022-06-12 23:21:14] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 1 ms to minimize.
[2022-06-12 23:21:14] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2022-06-12 23:21:15] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 1 ms to minimize.
[2022-06-12 23:21:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 422 ms
[2022-06-12 23:21:15] [INFO ] Added : 117 causal constraints over 25 iterations in 2260 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 12 ms.
[2022-06-12 23:21:15] [INFO ] Flatten gal took : 22 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15816936700253844763
[2022-06-12 23:21:15] [INFO ] Computing symmetric may disable matrix : 296 transitions.
[2022-06-12 23:21:15] [INFO ] Applying decomposition
[2022-06-12 23:21:15] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-12 23:21:15] [INFO ] Computing symmetric may enable matrix : 296 transitions.
[2022-06-12 23:21:15] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-12 23:21:15] [INFO ] Flatten gal took : 27 ms
[2022-06-12 23:21:15] [INFO ] Flatten gal took : 17 ms
[2022-06-12 23:21:15] [INFO ] Computing Do-Not-Accords matrix : 296 transitions.
[2022-06-12 23:21:15] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-12 23:21:15] [INFO ] Built C files in 87ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15816936700253844763
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/ltsmin15816936700253844763]
[2022-06-12 23:21:15] [INFO ] Input system was already deterministic with 296 transitions.
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/graph343795166441407437.txt, -o, /tmp/graph343795166441407437.bin, -w, /tmp/graph343795166441407437.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/graph343795166441407437.bin, -l, -1, -v, -w, /tmp/graph343795166441407437.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 23:21:15] [INFO ] Decomposing Gal with order
[2022-06-12 23:21:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 23:21:15] [INFO ] Removed a total of 26 redundant transitions.
[2022-06-12 23:21:15] [INFO ] Flatten gal took : 133 ms
[2022-06-12 23:21:15] [INFO ] Ran tautology test, simplified 0 / 7 in 413 ms.
[2022-06-12 23:21:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 17 ms.
[2022-06-12 23:21:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1601376013311876650.gal : 25 ms
[2022-06-12 23:21:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16687453335969725482.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/ReachabilityCardinality1601376013311876650.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality16687453335969725482.prop, --nowitness], 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/ReachabilityCardinality1601376013311876650.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality16687453335969725482.prop --nowitness
Loading property file /tmp/ReachabilityCardinality16687453335969725482.prop.
[2022-06-12 23:21:16] [INFO ] BMC solution for property DES-PT-60a-ReachabilityCardinality-00(UNSAT) depth K=0 took 44 ms
[2022-06-12 23:21:16] [INFO ] BMC solution for property DES-PT-60a-ReachabilityCardinality-01(UNSAT) depth K=0 took 1 ms
[2022-06-12 23:21:16] [INFO ] BMC solution for property DES-PT-60a-ReachabilityCardinality-03(UNSAT) depth K=0 took 1 ms
[2022-06-12 23:21:16] [INFO ] BMC solution for property DES-PT-60a-ReachabilityCardinality-11(UNSAT) depth K=0 took 5 ms
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 3
[2022-06-12 23:21:16] [INFO ] BMC solution for property DES-PT-60a-ReachabilityCardinality-12(UNSAT) depth K=0 took 2 ms
[2022-06-12 23:21:16] [INFO ] BMC solution for property DES-PT-60a-ReachabilityCardinality-14(UNSAT) depth K=0 took 1 ms
[2022-06-12 23:21:16] [INFO ] BMC solution for property DES-PT-60a-ReachabilityCardinality-15(UNSAT) depth K=0 took 1 ms
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :5 after 29
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :29 after 53
[2022-06-12 23:21:16] [INFO ] BMC solution for property DES-PT-60a-ReachabilityCardinality-00(UNSAT) depth K=1 took 18 ms
[2022-06-12 23:21:16] [INFO ] BMC solution for property DES-PT-60a-ReachabilityCardinality-01(UNSAT) depth K=1 took 2 ms
[2022-06-12 23:21:16] [INFO ] BMC solution for property DES-PT-60a-ReachabilityCardinality-03(UNSAT) depth K=1 took 7 ms
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :53 after 173
[2022-06-12 23:21:16] [INFO ] BMC solution for property DES-PT-60a-ReachabilityCardinality-11(UNSAT) depth K=1 took 19 ms
[2022-06-12 23:21:16] [INFO ] BMC solution for property DES-PT-60a-ReachabilityCardinality-12(UNSAT) depth K=1 took 14 ms
[2022-06-12 23:21:16] [INFO ] BMC solution for property DES-PT-60a-ReachabilityCardinality-14(UNSAT) depth K=1 took 7 ms
[2022-06-12 23:21:16] [INFO ] BMC solution for property DES-PT-60a-ReachabilityCardinality-15(UNSAT) depth K=1 took 2 ms
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :173 after 6469
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 296 rows 353 cols
[2022-06-12 23:21:16] [INFO ] Computed 59 place invariants in 15 ms
inv : p0 + p285 + p294 - p302 + p310 + p318 - p326 = 1
inv : p0 + p307 + p308 = 1
inv : p0 + p267 + p268 = 1
inv : p0 + p297 + p298 = 1
inv : p0 + p349 + p352 + p353 = 1
inv : p0 + p252 + p253 = 1
inv : p0 + p277 + p278 = 1
inv : p0 + p317 + p318 + p329 + p330 = 1
inv : p0 + p283 + p294 - p300 + p310 + p316 - p326 = 1
inv : p327 + p328 - p329 - p330 = 0
inv : p0 + p281 + p294 - p298 + p310 + p314 - p326 = 1
inv : p0 + p301 + p302 = 1
inv : p0 + p313 + p314 + p329 + p330 = 1
inv : p257 + p258 - p259 - p260 = 0
inv : p0 + p333 + p334 + p335 + p336 + p337 + p340 + p341 = 1
inv : 118*p1 + 2*p2 + 4*p3 + 6*p4 + 8*p5 + 10*p6 + 12*p7 + 14*p8 + 16*p9 + 18*p10 + 20*p11 + 22*p12 + 24*p13 + 26*p14 + 28*p15 + 30*p16 + 32*p17 + 34*p18 + 36*p19 + 38*p20 + 40*p21 + 42*p22 + 44*p23 + 46*p24 + 48*p25 + 50*p26 + 52*p27 + 54*p28 + 56*p29 + 58*p30 + 60*p31 + 62*p32 + 64*p33 + 66*p34 + 68*p35 + 70*p36 + 72*p37 + 74*p38 + 76*p39 + 78*p40 + 80*p41 + 82*p42 + 84*p43 + 86*p44 + 88*p45 + 90*p46 + 92*p47 + 94*p48 + 96*p49 + 98*p50 + 100*p51 + 102*p52 + 104*p53 + 106*p54 + 108*p55 + 110*p56 + 112*p57 + 114*p58 + 116*p59 - 60*p60 - p61 - 2*p62 - 3*p63 - 4*p64 - 5*p65 - 6*p66 - 7*p67 - 8*p68 - 9*p69 - 10*p70 - 11*p71 - 12*p72 - 13*p73 - 14*p74 - 15*p75 - 16*p76 - 17*p77 - 18*p78 - 19*p79 - 20*p80 - 21*p81 - 22*p82 - 23*p83 - 24*p84 - 25*p85 - 26*p86 - 27*p87 - 28*p88 - 29*p89 - 30*p90 - 31*p91 - 32*p92 - 33*p93 - 34*p94 - 35*p95 - 36*p96 - 37*p97 - 38*p98 - 39*p99 - 40*p100 - 41*p101 - 42*p102 - 43*p103 - 44*p104 - 45*p105 - 46*p106 - 47*p107 - 48*p108 - 49*p109 - 50*p110 - 51*p111 - 52*p112 - 53*p113 - 54*p114 - 55*p115 - 56*p116 - 57*p117 - 58*p118 - 59*p119 - 60*p180 - p181 - 2*p182 - 3*p183 - 4*p184 - 5*p185 - 6*p186 - 7*p187 - 8*p188 - 9*p189 - 10*p190 - 11*p191 - 12*p192 - 13*p193 - 14*p194 - 15*p195 - 16*p196 - 17*p197 - 18*p198 - 19*p199 - 20*p200 - 21*p201 - 22*p202 - 23*p203 - 24*p204 - 25*p205 - 26*p206 - 27*p207 - 28*p208 - 29*p209 - 30*p210 - 31*p211 - 32*p212 - 33*p213 - 34*p214 - 35*p215 - 36*p216 - 37*p217 - 38*p218 - 39*p219 - 40*p220 - 41*p221 - 42*p222 - 43*p223 - 44*p224 - 45*p225 - 46*p226 - 47*p227 - 48*p228 - 49*p229 - 50*p230 - 51*p231 - 52*p232 - 53*p233 - 54*p234 - 55*p235 - 56*p236 - 57*p237 - 58*p238 - 59*p239 + p244 + p245 - p250 + p253 - p260 - p261 + p268 - p272 - p274 - p278 + p328 - p330 - p332 - p334 - p336 - p340 + p344 + p349 + p351 = 0
inv : p0 + 118*p1 + 2*p2 + 4*p3 + 6*p4 + 8*p5 + 10*p6 + 12*p7 + 14*p8 + 16*p9 + 18*p10 + 20*p11 + 22*p12 + 24*p13 + 26*p14 + 28*p15 + 30*p16 + 32*p17 + 34*p18 + 36*p19 + 38*p20 + 40*p21 + 42*p22 + 44*p23 + 46*p24 + 48*p25 + 50*p26 + 52*p27 + 54*p28 + 56*p29 + 58*p30 + 60*p31 + 62*p32 + 64*p33 + 66*p34 + 68*p35 + 70*p36 + 72*p37 + 74*p38 + 76*p39 + 78*p40 + 80*p41 + 82*p42 + 84*p43 + 86*p44 + 88*p45 + 90*p46 + 92*p47 + 94*p48 + 96*p49 + 98*p50 + 100*p51 + 102*p52 + 104*p53 + 106*p54 + 108*p55 + 110*p56 + 112*p57 + 114*p58 + 116*p59 - 120*p60 - 2*p61 - 4*p62 - 6*p63 - 8*p64 - 10*p65 - 12*p66 - 14*p67 - 16*p68 - 18*p69 - 20*p70 - 22*p71 - 24*p72 - 26*p73 - 28*p74 - 30*p75 - 32*p76 - 34*p77 - 36*p78 - 38*p79 - 40*p80 - 42*p81 - 44*p82 - 46*p83 - 48*p84 - 50*p85 - 52*p86 - 54*p87 - 56*p88 - 58*p89 - 60*p90 - 62*p91 - 64*p92 - 66*p93 - 68*p94 - 70*p95 - 72*p96 - 74*p97 - 76*p98 - 78*p99 - 80*p100 - 82*p101 - 84*p102 - 86*p103 - 88*p104 - 90*p105 - 92*p106 - 94*p107 - 96*p108 - 98*p109 - 100*p110 - 102*p111 - 104*p112 - 106*p113 - 108*p114 - 110*p115 - 112*p116 - 114*p117 - 116*p118 - 118*p119 - p272 - p274 - p278 - p334 - p336 - p337 + p339 - p340 - p341 + p343 + p344 + p348 + 2*p349 + p351 + p353 = 1
inv : p0 + p279 + p294 - p296 + p310 + p312 - p326 = 1
inv : p0 + p293 + p294 = 1
inv : p0 + p271 + p272 = 1
inv : p292 - p294 + p308 - p310 - p324 + p326 = 0
inv : p0 + p311 + p312 + p329 + p330 = 1
inv : p0 + p240 + p241 = 1
inv : p0 + p265 + p266 = 1
inv : p0 + p305 + p306 = 1
inv : 2*p0 + 59*p1 + p2 + 2*p3 + 3*p4 + 4*p5 + 5*p6 + 6*p7 + 7*p8 + 8*p9 + 9*p10 + 10*p11 + 11*p12 + 12*p13 + 13*p14 + 14*p15 + 15*p16 + 16*p17 + 17*p18 + 18*p19 + 19*p20 + 20*p21 + 21*p22 + 22*p23 + 23*p24 + 24*p25 + 25*p26 + 26*p27 + 27*p28 + 28*p29 + 29*p30 + 30*p31 + 31*p32 + 32*p33 + 33*p34 + 34*p35 + 35*p36 + 36*p37 + 37*p38 + 38*p39 + 39*p40 + 40*p41 + 41*p42 + 42*p43 + 43*p44 + 44*p45 + 45*p46 + 46*p47 + 47*p48 + 48*p49 + 49*p50 + 50*p51 + 51*p52 + 52*p53 + 53*p54 + 54*p55 + 55*p56 + 56*p57 + 57*p58 + 58*p59 - 60*p60 - p61 - 2*p62 - 3*p63 - 4*p64 - 5*p65 - 6*p66 - 7*p67 - 8*p68 - 9*p69 - 10*p70 - 11*p71 - 12*p72 - 13*p73 - 14*p74 - 15*p75 - 16*p76 - 17*p77 - 18*p78 - 19*p79 - 20*p80 - 21*p81 - 22*p82 - 23*p83 - 24*p84 - 25*p85 - 26*p86 - 27*p87 - 28*p88 - 29*p89 - 30*p90 - 31*p91 - 32*p92 - 33*p93 - 34*p94 - 35*p95 - 36*p96 - 37*p97 - 38*p98 - 39*p99 - 40*p100 - 41*p101 - 42*p102 - 43*p103 - 44*p104 - 45*p105 - 46*p106 - 47*p107 - 48*p108 - 49*p109 - 50*p110 - 51*p111 - 52*p112 - 53*p113 - 54*p114 - 55*p115 - 56*p116 - 57*p117 - 58*p118 - 59*p119 - p272 + p275 - p294 - p310 + p326 + p329 - p332 - p334 - p336 - p340 + p349 + p351 = 2
inv : p0 + p325 + p326 + p329 + p330 = 1
inv : p0 + p349 + p350 + p351 = 1
inv : p0 - 118*p1 - 2*p2 - 4*p3 - 6*p4 - 8*p5 - 10*p6 - 12*p7 - 14*p8 - 16*p9 - 18*p10 - 20*p11 - 22*p12 - 24*p13 - 26*p14 - 28*p15 - 30*p16 - 32*p17 - 34*p18 - 36*p19 - 38*p20 - 40*p21 - 42*p22 - 44*p23 - 46*p24 - 48*p25 - 50*p26 - 52*p27 - 54*p28 - 56*p29 - 58*p30 - 60*p31 - 62*p32 - 64*p33 - 66*p34 - 68*p35 - 70*p36 - 72*p37 - 74*p38 - 76*p39 - 78*p40 - 80*p41 - 82*p42 - 84*p43 - 86*p44 - 88*p45 - 90*p46 - 92*p47 - 94*p48 - 96*p49 - 98*p50 - 100*p51 - 102*p52 - 104*p53 - 106*p54 - 108*p55 - 110*p56 - 112*p57 - 114*p58 - 116*p59 + 60*p60 + p61 + 2*p62 + 3*p63 + 4*p64 + 5*p65 + 6*p66 + 7*p67 + 8*p68 + 9*p69 + 10*p70 + 11*p71 + 12*p72 + 13*p73 + 14*p74 + 15*p75 + 16*p76 + 17*p77 + 18*p78 + 19*p79 + 20*p80 + 21*p81 + 22*p82 + 23*p83 + 24*p84 + 25*p85 + 26*p86 + 27*p87 + 28*p88 + 29*p89 + 30*p90 + 31*p91 + 32*p92 + 33*p93 + 34*p94 + 35*p95 + 36*p96 + 37*p97 + 38*p98 + 39*p99 + 40*p100 + 41*p101 + 42*p102 + 43*p103 + 44*p104 + 45*p105 + 46*p106 + 47*p107 + 48*p108 + 49*p109 + 50*p110 + 51*p111 + 52*p112 + 53*p113 + 54*p114 + 55*p115 + 56*p116 + 57*p117 + 58*p118 + 59*p119 + 60*p180 + p181 + 2*p182 + 3*p183 + 4*p184 + 5*p185 + 6*p186 + 7*p187 + 8*p188 + 9*p189 + 10*p190 + 11*p191 + 12*p192 + 13*p193 + 14*p194 + 15*p195 + 16*p196 + 17*p197 + 18*p198 + 19*p199 + 20*p200 + 21*p201 + 22*p202 + 23*p203 + 24*p204 + 25*p205 + 26*p206 + 27*p207 + 28*p208 + 29*p209 + 30*p210 + 31*p211 + 32*p212 + 33*p213 + 34*p214 + 35*p215 + 36*p216 + 37*p217 + 38*p218 + 39*p219 + 40*p220 + 41*p221 + 42*p222 + 43*p223 + 44*p224 + 45*p225 + 46*p226 + 47*p227 + 48*p228 + 49*p229 + 50*p230 + 51*p231 + 52*p232 + 53*p233 + 54*p234 + 55*p235 + 56*p236 + 57*p237 + 58*p238 + 59*p239 + p246 + p250 - p253 + p260 + p261 - p268 + p272 + p274 + p278 - p328 + p330 + p332 + p334 + p336 + p340 - p344 - p349 - p351 = 1
inv : p0 + p315 + p316 + p329 + p330 = 1
inv : p288 - p294 + p304 - p310 - p320 + p326 = 0
inv : -p261 - p262 + p263 + p264 = 0
inv : p0 + p254 + p255 + p256 = 1
inv : p0 + p319 + p320 + p329 + p330 = 1
inv : p0 + p299 + p300 = 1
inv : p0 + p309 + p310 = 1
inv : p286 - p294 + p302 - p310 - p318 + p326 = 0
inv : p0 + p344 + p345 + p346 + p347 + p348 = 1
inv : p0 + p295 + p296 = 1
inv : p290 - p294 + p306 - p310 - p322 + p326 = 0
inv : p0 - 59*p1 - p2 - 2*p3 - 3*p4 - 4*p5 - 5*p6 - 6*p7 - 7*p8 - 8*p9 - 9*p10 - 10*p11 - 11*p12 - 12*p13 - 13*p14 - 14*p15 - 15*p16 - 16*p17 - 17*p18 - 18*p19 - 19*p20 - 20*p21 - 21*p22 - 22*p23 - 23*p24 - 24*p25 - 25*p26 - 26*p27 - 27*p28 - 28*p29 - 29*p30 - 30*p31 - 31*p32 - 32*p33 - 33*p34 - 34*p35 - 35*p36 - 36*p37 - 37*p38 - 38*p39 - 39*p40 - 40*p41 - 41*p42 - 42*p43 - 43*p44 - 44*p45 - 45*p46 - 46*p47 - 47*p48 - 48*p49 - 49*p50 - 50*p51 - 51*p52 - 52*p53 - 53*p54 - 54*p55 - 55*p56 - 56*p57 - 57*p58 - 58*p59 + 60*p60 + p61 + 2*p62 + 3*p63 + 4*p64 + 5*p65 + 6*p66 + 7*p67 + 8*p68 + 9*p69 + 10*p70 + 11*p71 + 12*p72 + 13*p73 + 14*p74 + 15*p75 + 16*p76 + 17*p77 + 18*p78 + 19*p79 + 20*p80 + 21*p81 + 22*p82 + 23*p83 + 24*p84 + 25*p85 + 26*p86 + 27*p87 + 28*p88 + 29*p89 + 30*p90 + 31*p91 + 32*p92 + 33*p93 + 34*p94 + 35*p95 + 36*p96 + 37*p97 + 38*p98 + 39*p99 + 40*p100 + 41*p101 + 42*p102 + 43*p103 + 44*p104 + 45*p105 + 46*p106 + 47*p107 + 48*p108 + 49*p109 + 50*p110 + 51*p111 + 52*p112 + 53*p113 + 54*p114 + 55*p115 + 56*p116 + 57*p117 + 58*p118 + 59*p119 + p247 + p250 + p274 + p278 + p333 + p334 + p336 + p337 + p340 + p341 - p344 - p349 - p351 = 1
inv : p0 + p269 + p270 = 1
inv : -p340 - p341 + p342 + p343 = 0
inv : p0 + p323 + p324 + p329 + p330 = 1
inv : p0 + p242 + p243 = 1
inv : p282 - p294 + p298 - p310 - p314 + p326 = 0
inv : p0 + p291 + p294 - p308 + p310 + p324 - p326 = 1
inv : p0 + p273 + p274 = 1
inv : p0 + p331 + p332 = 1
inv : p0 + p303 + p304 = 1
inv : p0 + p321 + p322 + p329 + p330 = 1
inv : p280 - p294 + p296 - p310 - p312 + p326 = 0
inv : -p0 - 118*p1 - 2*p2 - 4*p3 - 6*p4 - 8*p5 - 10*p6 - 12*p7 - 14*p8 - 16*p9 - 18*p10 - 20*p11 - 22*p12 - 24*p13 - 26*p14 - 28*p15 - 30*p16 - 32*p17 - 34*p18 - 36*p19 - 38*p20 - 40*p21 - 42*p22 - 44*p23 - 46*p24 - 48*p25 - 50*p26 - 52*p27 - 54*p28 - 56*p29 - 58*p30 - 60*p31 - 62*p32 - 64*p33 - 66*p34 - 68*p35 - 70*p36 - 72*p37 - 74*p38 - 76*p39 - 78*p40 - 80*p41 - 82*p42 - 84*p43 - 86*p44 - 88*p45 - 90*p46 - 92*p47 - 94*p48 - 96*p49 - 98*p50 - 100*p51 - 102*p52 - 104*p53 - 106*p54 - 108*p55 - 110*p56 - 112*p57 - 114*p58 - 116*p59 + 120*p60 + 2*p61 + 4*p62 + 6*p63 + 8*p64 + 10*p65 + 12*p66 + 14*p67 + 16*p68 + 18*p69 + 20*p70 + 22*p71 + 24*p72 + 26*p73 + 28*p74 + 30*p75 + 32*p76 + 34*p77 + 36*p78 + 38*p79 + 40*p80 + 42*p81 + 44*p82 + 46*p83 + 48*p84 + 50*p85 + 52*p86 + 54*p87 + 56*p88 + 58*p89 + 60*p90 + 62*p91 + 64*p92 + 66*p93 + 68*p94 + 70*p95 + 72*p96 + 74*p97 + 76*p98 + 78*p99 + 80*p100 + 82*p101 + 84*p102 + 86*p103 + 88*p104 + 90*p105 + 92*p106 + 94*p107 + 96*p108 + 98*p109 + 100*p110 + 102*p111 + 104*p112 + 106*p113 + 108*p114 + 110*p115 + 112*p116 + 114*p117 + 116*p118 + 118*p119 + p272 + p274 + p278 + p334 + p338 + p340 + p341 - p343 - p344 - p348 - 2*p349 - p351 - p353 = -1
inv : p0 + p289 + p294 - p306 + p310 + p322 - p326 = 1
inv : p284 - p294 + p300 - p310 - p316 + p326 = 0
inv : -p0 - 59*p1 - p2 - 2*p3 - 3*p4 - 4*p5 - 5*p6 - 6*p7 - 7*p8 - 8*p9 - 9*p10 - 10*p11 - 11*p12 - 12*p13 - 13*p14 - 14*p15 - 15*p16 - 16*p17 - 17*p18 - 18*p19 - 19*p20 - 20*p21 - 21*p22 - 22*p23 - 23*p24 - 24*p25 - 25*p26 - 26*p27 - 27*p28 - 28*p29 - 29*p30 - 30*p31 - 31*p32 - 32*p33 - 33*p34 - 34*p35 - 35*p36 - 36*p37 - 37*p38 - 38*p39 - 39*p40 - 40*p41 - 41*p42 - 42*p43 - 43*p44 - 44*p45 - 45*p46 - 46*p47 - 47*p48 - 48*p49 - 49*p50 - 50*p51 - 51*p52 - 52*p53 - 53*p54 - 54*p55 - 55*p56 - 56*p57 - 57*p58 - 58*p59 + 60*p60 + p61 + 2*p62 + 3*p63 + 4*p64 + 5*p65 + 6*p66 + 7*p67 + 8*p68 + 9*p69 + 10*p70 + 11*p71 + 12*p72 + 13*p73 + 14*p74 + 15*p75 + 16*p76 + 17*p77 + 18*p78 + 19*p79 + 20*p80 + 21*p81 + 22*p82 + 23*p83 + 24*p84 + 25*p85 + 26*p86 + 27*p87 + 28*p88 + 29*p89 + 30*p90 + 31*p91 + 32*p92 + 33*p93 + 34*p94 + 35*p95 + 36*p96 + 37*p97 + 38*p98 + 39*p99 + 40*p100 + 41*p101 + 42*p102 + 43*p103 + 44*p104 + 45*p105 + 46*p106 + 47*p107 + 48*p108 + 49*p109 + 50*p110 + 51*p111 + 52*p112 + 53*p113 + 54*p114 + 55*p115 + 56*p116 + 57*p117 + 58*p118 + 59*p119 + p272 + p276 + p294 + p310 - p326 - p329 + p332 + p334 + p336 + p340 - p349 - p351 = -1
inv : 59*p1 + p2 + 2*p3 + 3*p4 + 4*p5 + 5*p6 + 6*p7 + 7*p8 + 8*p9 + 9*p10 + 10*p11 + 11*p12 + 12*p13 + 13*p14 + 14*p15 + 15*p16 + 16*p17 + 17*p18 + 18*p19 + 19*p20 + 20*p21 + 21*p22 + 22*p23 + 23*p24 + 24*p25 + 25*p26 + 26*p27 + 27*p28 + 28*p29 + 29*p30 + 30*p31 + 31*p32 + 32*p33 + 33*p34 + 34*p35 + 35*p36 + 36*p37 + 37*p38 + 38*p39 + 39*p40 + 40*p41 + 41*p42 + 42*p43 + 43*p44 + 44*p45 + 45*p46 + 46*p47 + 47*p48 + 48*p49 + 49*p50 + 50*p51 + 51*p52 + 52*p53 + 53*p54 + 54*p55 + 55*p56 + 56*p57 + 57*p58 + 58*p59 - 60*p60 - p61 - 2*p62 - 3*p63 - 4*p64 - 5*p65 - 6*p66 - 7*p67 - 8*p68 - 9*p69 - 10*p70 - 11*p71 - 12*p72 - 13*p73 - 14*p74 - 15*p75 - 16*p76 - 17*p77 - 18*p78 - 19*p79 - 20*p80 - 21*p81 - 22*p82 - 23*p83 - 24*p84 - 25*p85 - 26*p86 - 27*p87 - 28*p88 - 29*p89 - 30*p90 - 31*p91 - 32*p92 - 33*p93 - 34*p94 - 35*p95 - 36*p96 - 37*p97 - 38*p98 - 39*p99 - 40*p100 - 41*p101 - 42*p102 - 43*p103 - 44*p104 - 45*p105 - 46*p106 - 47*p107 - 48*p108 - 49*p109 - 50*p110 - 51*p111 - 52*p112 - 53*p113 - 54*p114 - 55*p115 - 56*p116 - 57*p117 - 58*p118 - 59*p119 + p248 - p250 - p274 - p278 - p333 - p334 - p336 - p337 - p340 - p341 + p344 + p349 + p351 = 0
inv : p0 + p287 + p294 - p304 + p310 + p320 - p326 = 1
inv : p0 + p249 + p250 = 1
Total of 59 invariants.
[2022-06-12 23:21:16] [INFO ] Computed 59 place invariants in 17 ms
[2022-06-12 23:21:16] [INFO ] BMC solution for property DES-PT-60a-ReachabilityCardinality-00(UNSAT) depth K=2 took 254 ms
[2022-06-12 23:21:16] [INFO ] BMC solution for property DES-PT-60a-ReachabilityCardinality-01(UNSAT) depth K=2 took 3 ms
[2022-06-12 23:21:16] [INFO ] BMC solution for property DES-PT-60a-ReachabilityCardinality-03(UNSAT) depth K=2 took 1 ms
[2022-06-12 23:21:16] [INFO ] BMC solution for property DES-PT-60a-ReachabilityCardinality-11(UNSAT) depth K=2 took 6 ms
[2022-06-12 23:21:16] [INFO ] BMC solution for property DES-PT-60a-ReachabilityCardinality-12(UNSAT) depth K=2 took 3 ms
[2022-06-12 23:21:16] [INFO ] BMC solution for property DES-PT-60a-ReachabilityCardinality-14(UNSAT) depth K=2 took 1 ms
[2022-06-12 23:21:16] [INFO ] BMC solution for property DES-PT-60a-ReachabilityCardinality-15(UNSAT) depth K=2 took 2 ms
[2022-06-12 23:21:16] [INFO ] BMC solution for property DES-PT-60a-ReachabilityCardinality-00(UNSAT) depth K=3 took 225 ms
[2022-06-12 23:21:16] [INFO ] BMC solution for property DES-PT-60a-ReachabilityCardinality-01(UNSAT) depth K=3 took 159 ms
[2022-06-12 23:21:16] [INFO ] BMC solution for property DES-PT-60a-ReachabilityCardinality-03(UNSAT) depth K=3 took 158 ms
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :6469 after 4.71938e+08
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :4.71938e+08 after 9.03288e+08
[2022-06-12 23:21:17] [INFO ] BMC solution for property DES-PT-60a-ReachabilityCardinality-11(UNSAT) depth K=3 took 540 ms
[2022-06-12 23:21:17] [INFO ] BMC solution for property DES-PT-60a-ReachabilityCardinality-12(UNSAT) depth K=3 took 137 ms
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :9.03288e+08 after 1.46736e+09
[2022-06-12 23:21:17] [INFO ] BMC solution for property DES-PT-60a-ReachabilityCardinality-14(UNSAT) depth K=3 took 84 ms
[2022-06-12 23:21:17] [INFO ] BMC solution for property DES-PT-60a-ReachabilityCardinality-15(UNSAT) depth K=3 took 77 ms
[2022-06-12 23:21:17] [INFO ] Proved 353 variables to be positive in 1507 ms
[2022-06-12 23:21:17] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-60a-ReachabilityCardinality-00
[2022-06-12 23:21:17] [INFO ] KInduction solution for property DES-PT-60a-ReachabilityCardinality-00(SAT) depth K=0 took 92 ms
Compilation finished in 3074 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin15816936700253844763]
[2022-06-12 23:21:18] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-60a-ReachabilityCardinality-01
[2022-06-12 23:21:18] [INFO ] KInduction solution for property DES-PT-60a-ReachabilityCardinality-01(SAT) depth K=0 took 538 ms
Link finished in 64 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, DESPT60aReachabilityCardinality00==true], workingDir=/tmp/ltsmin15816936700253844763]
[2022-06-12 23:21:18] [INFO ] BMC solution for property DES-PT-60a-ReachabilityCardinality-00(UNSAT) depth K=4 took 757 ms
[2022-06-12 23:21:18] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-60a-ReachabilityCardinality-03
[2022-06-12 23:21:18] [INFO ] KInduction solution for property DES-PT-60a-ReachabilityCardinality-03(SAT) depth K=0 took 149 ms
[2022-06-12 23:21:18] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-60a-ReachabilityCardinality-11
[2022-06-12 23:21:18] [INFO ] KInduction solution for property DES-PT-60a-ReachabilityCardinality-11(SAT) depth K=0 took 355 ms
[2022-06-12 23:21:19] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-60a-ReachabilityCardinality-12
[2022-06-12 23:21:19] [INFO ] KInduction solution for property DES-PT-60a-ReachabilityCardinality-12(SAT) depth K=0 took 355 ms
[2022-06-12 23:21:19] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-60a-ReachabilityCardinality-14
[2022-06-12 23:21:19] [INFO ] KInduction solution for property DES-PT-60a-ReachabilityCardinality-14(SAT) depth K=0 took 273 ms
[2022-06-12 23:21:19] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-60a-ReachabilityCardinality-15
[2022-06-12 23:21:19] [INFO ] KInduction solution for property DES-PT-60a-ReachabilityCardinality-15(SAT) depth K=0 took 367 ms
[2022-06-12 23:21:23] [INFO ] BMC solution for property DES-PT-60a-ReachabilityCardinality-01(UNSAT) depth K=4 took 5211 ms
[2022-06-12 23:21:25] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-60a-ReachabilityCardinality-00
[2022-06-12 23:21:25] [INFO ] KInduction solution for property DES-PT-60a-ReachabilityCardinality-00(SAT) depth K=1 took 5695 ms
[2022-06-12 23:21:26] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-60a-ReachabilityCardinality-01
[2022-06-12 23:21:26] [INFO ] KInduction solution for property DES-PT-60a-ReachabilityCardinality-01(SAT) depth K=1 took 360 ms
[2022-06-12 23:21:27] [INFO ] BMC solution for property DES-PT-60a-ReachabilityCardinality-03(UNSAT) depth K=4 took 3886 ms
[2022-06-12 23:21:30] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-60a-ReachabilityCardinality-03
[2022-06-12 23:21:30] [INFO ] KInduction solution for property DES-PT-60a-ReachabilityCardinality-03(SAT) depth K=1 took 4805 ms
[2022-06-12 23:21:31] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-60a-ReachabilityCardinality-11
[2022-06-12 23:21:31] [INFO ] KInduction solution for property DES-PT-60a-ReachabilityCardinality-11(SAT) depth K=1 took 704 ms
[2022-06-12 23:21:31] [INFO ] BMC solution for property DES-PT-60a-ReachabilityCardinality-11(UNSAT) depth K=4 took 4214 ms
[2022-06-12 23:21:33] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-60a-ReachabilityCardinality-12
[2022-06-12 23:21:33] [INFO ] KInduction solution for property DES-PT-60a-ReachabilityCardinality-12(SAT) depth K=1 took 2372 ms
[2022-06-12 23:21:34] [INFO ] BMC solution for property DES-PT-60a-ReachabilityCardinality-12(UNSAT) depth K=4 took 2715 ms
[2022-06-12 23:21:34] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-60a-ReachabilityCardinality-14
[2022-06-12 23:21:34] [INFO ] KInduction solution for property DES-PT-60a-ReachabilityCardinality-14(SAT) depth K=1 took 727 ms
[2022-06-12 23:21:35] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-60a-ReachabilityCardinality-15
[2022-06-12 23:21:35] [INFO ] KInduction solution for property DES-PT-60a-ReachabilityCardinality-15(SAT) depth K=1 took 549 ms
[2022-06-12 23:21:38] [INFO ] BMC solution for property DES-PT-60a-ReachabilityCardinality-14(UNSAT) depth K=4 took 3657 ms
[2022-06-12 23:21:40] [INFO ] BMC solution for property DES-PT-60a-ReachabilityCardinality-15(UNSAT) depth K=4 took 1994 ms
[2022-06-12 23:21:47] [INFO ] BMC solution for property DES-PT-60a-ReachabilityCardinality-00(UNSAT) depth K=5 took 7622 ms
[2022-06-12 23:22:14] [INFO ] BMC solution for property DES-PT-60a-ReachabilityCardinality-01(UNSAT) depth K=5 took 26700 ms
[2022-06-12 23:22:25] [INFO ] BMC solution for property DES-PT-60a-ReachabilityCardinality-03(UNSAT) depth K=5 took 11266 ms
Invariant property DES-PT-60a-ReachabilityCardinality-01 does not hold.
FORMULA DES-PT-60a-ReachabilityCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :3.47411e+12 after 4.42995e+12
[2022-06-12 23:23:52] [INFO ] BMC solution for property DES-PT-60a-ReachabilityCardinality-11(UNSAT) depth K=5 took 87114 ms
[2022-06-12 23:23:54] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-60a-ReachabilityCardinality-00
[2022-06-12 23:23:54] [INFO ] KInduction solution for property DES-PT-60a-ReachabilityCardinality-00(SAT) depth K=2 took 139058 ms
[2022-06-12 23:24:06] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-60a-ReachabilityCardinality-03
[2022-06-12 23:24:06] [INFO ] KInduction solution for property DES-PT-60a-ReachabilityCardinality-03(SAT) depth K=2 took 11966 ms
[2022-06-12 23:24:30] [INFO ] BMC solution for property DES-PT-60a-ReachabilityCardinality-12(UNSAT) depth K=5 took 37337 ms
[2022-06-12 23:24:54] [INFO ] BMC solution for property DES-PT-60a-ReachabilityCardinality-14(UNSAT) depth K=5 took 23891 ms
[2022-06-12 23:26:03] [INFO ] BMC solution for property DES-PT-60a-ReachabilityCardinality-15(UNSAT) depth K=5 took 68887 ms
[2022-06-12 23:27:10] [INFO ] BMC solution for property DES-PT-60a-ReachabilityCardinality-00(UNSAT) depth K=6 took 67248 ms
[2022-06-12 23:28:10] [INFO ] BMC solution for property DES-PT-60a-ReachabilityCardinality-03(UNSAT) depth K=6 took 60303 ms
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :1.3075e+13 after 1.34441e+13
[2022-06-12 23:29:12] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-60a-ReachabilityCardinality-11
[2022-06-12 23:29:12] [INFO ] KInduction solution for property DES-PT-60a-ReachabilityCardinality-11(SAT) depth K=2 took 306004 ms
WARNING : LTSmin timed out (>514 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, DESPT60aReachabilityCardinality00==true], workingDir=/tmp/ltsmin15816936700253844763]
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, DESPT60aReachabilityCardinality03==true], workingDir=/tmp/ltsmin15816936700253844763]
Invariant property DES-PT-60a-ReachabilityCardinality-15 does not hold.
FORMULA DES-PT-60a-ReachabilityCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
[2022-06-12 23:31:05] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-60a-ReachabilityCardinality-12
[2022-06-12 23:31:05] [INFO ] KInduction solution for property DES-PT-60a-ReachabilityCardinality-12(SAT) depth K=2 took 113336 ms
[2022-06-12 23:31:19] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-60a-ReachabilityCardinality-14
[2022-06-12 23:31:19] [INFO ] KInduction solution for property DES-PT-60a-ReachabilityCardinality-14(SAT) depth K=2 took 14359 ms
[2022-06-12 23:33:28] [INFO ] BMC solution for property DES-PT-60a-ReachabilityCardinality-11(UNSAT) depth K=6 took 318234 ms
Reachability property DES-PT-60a-ReachabilityCardinality-00 is true.
FORMULA DES-PT-60a-ReachabilityCardinality-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :2.26763e+13 after 2.2749e+13
[2022-06-12 23:37:47] [INFO ] BMC solution for property DES-PT-60a-ReachabilityCardinality-12(UNSAT) depth K=6 took 258554 ms
WARNING : LTSmin timed out (>514 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, DESPT60aReachabilityCardinality03==true], workingDir=/tmp/ltsmin15816936700253844763]
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, DESPT60aReachabilityCardinality11==true], workingDir=/tmp/ltsmin15816936700253844763]
[2022-06-12 23:40:36] [INFO ] BMC solution for property DES-PT-60a-ReachabilityCardinality-14(UNSAT) depth K=6 took 169352 ms
Detected timeout of ITS tools.
[2022-06-12 23:43:52] [INFO ] Applying decomposition
[2022-06-12 23:43:52] [INFO ] Flatten gal took : 88 ms
[2022-06-12 23:43:53] [INFO ] Decomposing Gal with order
[2022-06-12 23:43:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 23:43:53] [INFO ] Removed a total of 23 redundant transitions.
[2022-06-12 23:43:53] [INFO ] Flatten gal took : 119 ms
[2022-06-12 23:43:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2022-06-12 23:43:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17043117273906327784.gal : 16 ms
[2022-06-12 23:43:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality844427157924273499.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/ReachabilityCardinality17043117273906327784.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality844427157924273499.prop, --nowitness], 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/ReachabilityCardinality17043117273906327784.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality844427157924273499.prop --nowitness
Loading property file /tmp/ReachabilityCardinality844427157924273499.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :5 after 45
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :45 after 69
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :69 after 181
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :181 after 6469
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :6469 after 3.85399e+08
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :3.85399e+08 after 6.86717e+08
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :6.86717e+08 after 1.11359e+09
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :4.48058e+12 after 4.51428e+12
[2022-06-12 23:45:08] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-60a-ReachabilityCardinality-00
[2022-06-12 23:45:08] [INFO ] KInduction solution for property DES-PT-60a-ReachabilityCardinality-00(SAT) depth K=3 took 828887 ms
[2022-06-12 23:45:10] [INFO ] BMC solution for property DES-PT-60a-ReachabilityCardinality-03(UNSAT) depth K=7 took 273644 ms
[2022-06-12 23:45:50] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-60a-ReachabilityCardinality-03
[2022-06-12 23:45:50] [INFO ] KInduction solution for property DES-PT-60a-ReachabilityCardinality-03(SAT) depth K=3 took 41933 ms
WARNING : LTSmin timed out (>514 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, DESPT60aReachabilityCardinality11==true], workingDir=/tmp/ltsmin15816936700253844763]
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, DESPT60aReachabilityCardinality12==true], workingDir=/tmp/ltsmin15816936700253844763]
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :1.98428e+13 after 2.08029e+13
Invariant property DES-PT-60a-ReachabilityCardinality-12 does not hold.
FORMULA DES-PT-60a-ReachabilityCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
WARNING : LTSmin timed out (>514 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, DESPT60aReachabilityCardinality12==true], workingDir=/tmp/ltsmin15816936700253844763]
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, DESPT60aReachabilityCardinality14==true], workingDir=/tmp/ltsmin15816936700253844763]
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :3.71253e+13 after 3.73338e+13
[2022-06-12 23:56:47] [INFO ] BMC solution for property DES-PT-60a-ReachabilityCardinality-11(UNSAT) depth K=7 took 697223 ms
Invariant property DES-PT-60a-ReachabilityCardinality-14 does not hold.
FORMULA DES-PT-60a-ReachabilityCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
[2022-06-13 00:02:29] [INFO ] BMC solution for property DES-PT-60a-ReachabilityCardinality-14(UNSAT) depth K=7 took 341565 ms
Invariant property DES-PT-60a-ReachabilityCardinality-11 does not hold.
FORMULA DES-PT-60a-ReachabilityCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property DES-PT-60a-ReachabilityCardinality-03 is true.
FORMULA DES-PT-60a-ReachabilityCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 4097 fixpoint passes
WARNING : LTSmin timed out (>514 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, DESPT60aReachabilityCardinality14==true], workingDir=/tmp/ltsmin15816936700253844763]
[2022-06-13 00:04:08] [WARNING] Interrupting SMT solver.
ITS tools runner thread asked to quit. Dying gracefully.
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1305)
at java.base/java.lang.Thread.join(Thread.java:1380)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.checkProperties(Gal2SMTFrontEnd.java:184)
at fr.lip6.move.gal.application.SMTRunner$2.run(SMTRunner.java:103)
at java.base/java.lang.Thread.run(Thread.java:834)
[2022-06-13 00:04:08] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:320)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:586)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:306)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$1(Gal2SMTFrontEnd.java:279)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:834)
[2022-06-13 00:04:08] [WARNING] Unexpected error occurred while running SMT. Was verifying DES-PT-60a-ReachabilityCardinality-11 K-induction depth 3
Exception in thread "Thread-22" java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:344)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$1(Gal2SMTFrontEnd.java:279)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:834)
Caused by: java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:320)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:586)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:306)
... 3 more
[2022-06-13 00:04:08] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$0(Gal2SMTFrontEnd.java:357)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
at java.base/java.lang.Thread.run(Thread.java:834)
[2022-06-13 00:04:08] [WARNING] Unexpected error occurred while running SMT. Was verifying DES-PT-60a-ReachabilityCardinality-03 SMT depth 8
java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:411)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$0(Gal2SMTFrontEnd.java:357)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
at java.base/java.lang.Thread.run(Thread.java:834)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
... 3 more
[2022-06-13 00:04:08] [INFO ] During BMC, SMT solver timed out at depth 8
[2022-06-13 00:04:08] [INFO ] BMC solving timed out (3600000 secs) at depth 8

BK_STOP 1655078649770

--------------------
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="DES-PT-60a"
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 DES-PT-60a, 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 r046-smll-165252115900200"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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