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.r072-tall-165254781200383.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 Dekker-PT-020, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r072-tall-165254781200383
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 7.7K Apr 30 05:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 30 05:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 30 05:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 30 05:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K May 9 07:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 07:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 07:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 07:36 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 247K 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

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1652610959918

Running Version 0
[2022-05-15 10:36:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -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, 1800]
[2022-05-15 10:36:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 10:36:01] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2022-05-15 10:36:01] [INFO ] Transformed 100 places.
[2022-05-15 10:36:01] [INFO ] Transformed 440 transitions.
[2022-05-15 10:36:01] [INFO ] Found NUPN structural information;
[2022-05-15 10:36:01] [INFO ] Parsed PT model containing 100 places and 440 transitions in 117 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 100) seen :80
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2022-05-15 10:36:01] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 100 cols
[2022-05-15 10:36:01] [INFO ] Computed 60 place invariants in 11 ms
[2022-05-15 10:36:01] [INFO ] [Real]Absence check using 40 positive place invariants in 13 ms returned sat
[2022-05-15 10:36:01] [INFO ] [Real]Absence check using 40 positive and 20 generalized place invariants in 3 ms returned sat
[2022-05-15 10:36:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 10:36:01] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2022-05-15 10:36:02] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-05-15 10:36:02] [INFO ] [Real]Added 20 Read/Feed constraints in 4 ms returned sat
[2022-05-15 10:36:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 10:36:02] [INFO ] [Nat]Absence check using 40 positive place invariants in 6 ms returned sat
[2022-05-15 10:36:02] [INFO ] [Nat]Absence check using 40 positive and 20 generalized place invariants in 3 ms returned sat
[2022-05-15 10:36:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 10:36:02] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2022-05-15 10:36:02] [INFO ] [Nat]Added 20 Read/Feed constraints in 3 ms returned sat
[2022-05-15 10:36:02] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 2 ms to minimize.
[2022-05-15 10:36:02] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2022-05-15 10:36:02] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2022-05-15 10:36:02] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2022-05-15 10:36:02] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2022-05-15 10:36:02] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2022-05-15 10:36:02] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2022-05-15 10:36:02] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2022-05-15 10:36:02] [INFO ] Deduced a trap composed of 6 places in 13 ms of which 1 ms to minimize.
[2022-05-15 10:36:02] [INFO ] Deduced a trap composed of 6 places in 13 ms of which 0 ms to minimize.
[2022-05-15 10:36:02] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2022-05-15 10:36:02] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2022-05-15 10:36:02] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
[2022-05-15 10:36:02] [INFO ] Deduced a trap composed of 6 places in 13 ms of which 0 ms to minimize.
[2022-05-15 10:36:02] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2022-05-15 10:36:02] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 0 ms to minimize.
[2022-05-15 10:36:02] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 0 ms to minimize.
[2022-05-15 10:36:02] [INFO ] Deduced a trap composed of 4 places in 11 ms of which 0 ms to minimize.
[2022-05-15 10:36:02] [INFO ] Deduced a trap composed of 4 places in 8 ms of which 0 ms to minimize.
[2022-05-15 10:36:02] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2022-05-15 10:36:02] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 1 ms to minimize.
[2022-05-15 10:36:02] [INFO ] Deduced a trap composed of 6 places in 12 ms of which 1 ms to minimize.
[2022-05-15 10:36:02] [INFO ] Deduced a trap composed of 4 places in 11 ms of which 0 ms to minimize.
[2022-05-15 10:36:02] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 0 ms to minimize.
[2022-05-15 10:36:02] [INFO ] Deduced a trap composed of 6 places in 12 ms of which 1 ms to minimize.
[2022-05-15 10:36:02] [INFO ] Deduced a trap composed of 4 places in 10 ms of which 1 ms to minimize.
[2022-05-15 10:36:02] [INFO ] Deduced a trap composed of 6 places in 13 ms of which 0 ms to minimize.
[2022-05-15 10:36:02] [INFO ] Deduced a trap composed of 4 places in 11 ms of which 0 ms to minimize.
[2022-05-15 10:36:02] [INFO ] Deduced a trap composed of 4 places in 11 ms of which 1 ms to minimize.
[2022-05-15 10:36:02] [INFO ] Deduced a trap composed of 4 places in 10 ms of which 0 ms to minimize.
[2022-05-15 10:36:02] [INFO ] Deduced a trap composed of 4 places in 7 ms of which 0 ms to minimize.
[2022-05-15 10:36:02] [INFO ] Deduced a trap composed of 6 places in 13 ms of which 1 ms to minimize.
[2022-05-15 10:36:02] [INFO ] Deduced a trap composed of 6 places in 12 ms of which 0 ms to minimize.
[2022-05-15 10:36:02] [INFO ] Deduced a trap composed of 4 places in 11 ms of which 0 ms to minimize.
[2022-05-15 10:36:02] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 5 ms to minimize.
[2022-05-15 10:36:02] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 0 ms to minimize.
[2022-05-15 10:36:02] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2022-05-15 10:36:02] [INFO ] Deduced a trap composed of 4 places in 10 ms of which 1 ms to minimize.
[2022-05-15 10:36:02] [INFO ] Deduced a trap composed of 4 places in 8 ms of which 0 ms to minimize.
[2022-05-15 10:36:02] [INFO ] Deduced a trap composed of 6 places in 12 ms of which 1 ms to minimize.
[2022-05-15 10:36:02] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2022-05-15 10:36:02] [INFO ] Deduced a trap composed of 4 places in 10 ms of which 0 ms to minimize.
[2022-05-15 10:36:03] [INFO ] Deduced a trap composed of 4 places in 7 ms of which 0 ms to minimize.
[2022-05-15 10:36:03] [INFO ] Deduced a trap composed of 4 places in 11 ms of which 0 ms to minimize.
[2022-05-15 10:36:03] [INFO ] Deduced a trap composed of 4 places in 9 ms of which 0 ms to minimize.
[2022-05-15 10:36:03] [INFO ] Deduced a trap composed of 4 places in 8 ms of which 1 ms to minimize.
[2022-05-15 10:36:03] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 1 ms to minimize.
[2022-05-15 10:36:03] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2022-05-15 10:36:03] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2022-05-15 10:36:03] [INFO ] Deduced a trap composed of 4 places in 9 ms of which 0 ms to minimize.
[2022-05-15 10:36:03] [INFO ] Deduced a trap composed of 4 places in 11 ms of which 1 ms to minimize.
[2022-05-15 10:36:03] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2022-05-15 10:36:03] [INFO ] Deduced a trap composed of 4 places in 10 ms of which 0 ms to minimize.
[2022-05-15 10:36:03] [INFO ] Deduced a trap composed of 4 places in 11 ms of which 1 ms to minimize.
[2022-05-15 10:36:03] [INFO ] Deduced a trap composed of 4 places in 8 ms of which 0 ms to minimize.
[2022-05-15 10:36:03] [INFO ] Deduced a trap composed of 4 places in 10 ms of which 0 ms to minimize.
[2022-05-15 10:36:03] [INFO ] Trap strengthening (SAT) tested/added 57/56 trap constraints in 1127 ms
[2022-05-15 10:36:03] [INFO ] Computed and/alt/rep : 40/60/40 causal constraints (skipped 20 transitions) in 11 ms.
[2022-05-15 10:36:03] [INFO ] Added : 1 causal constraints over 1 iterations in 36 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-15 10:36:03] [INFO ] [Real]Absence check using 40 positive place invariants in 5 ms returned sat
[2022-05-15 10:36:03] [INFO ] [Real]Absence check using 40 positive and 20 generalized place invariants in 2 ms returned sat
[2022-05-15 10:36:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 10:36:03] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-15 10:36:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 10:36:03] [INFO ] [Nat]Absence check using 40 positive place invariants in 6 ms returned sat
[2022-05-15 10:36:03] [INFO ] [Nat]Absence check using 40 positive and 20 generalized place invariants in 2 ms returned sat
[2022-05-15 10:36:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 10:36:03] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-05-15 10:36:03] [INFO ] [Nat]Added 20 Read/Feed constraints in 3 ms returned sat
[2022-05-15 10:36:03] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2022-05-15 10:36:03] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2022-05-15 10:36:03] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2022-05-15 10:36:03] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2022-05-15 10:36:03] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2022-05-15 10:36:03] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2022-05-15 10:36:03] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2022-05-15 10:36:03] [INFO ] Deduced a trap composed of 6 places in 13 ms of which 0 ms to minimize.
[2022-05-15 10:36:03] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2022-05-15 10:36:03] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 6 ms to minimize.
[2022-05-15 10:36:03] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 2 ms to minimize.
[2022-05-15 10:36:03] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2022-05-15 10:36:03] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 0 ms to minimize.
[2022-05-15 10:36:03] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 0 ms to minimize.
[2022-05-15 10:36:03] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2022-05-15 10:36:03] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 0 ms to minimize.
[2022-05-15 10:36:03] [INFO ] Deduced a trap composed of 4 places in 11 ms of which 0 ms to minimize.
[2022-05-15 10:36:03] [INFO ] Deduced a trap composed of 4 places in 11 ms of which 0 ms to minimize.
[2022-05-15 10:36:03] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2022-05-15 10:36:03] [INFO ] Deduced a trap composed of 6 places in 12 ms of which 0 ms to minimize.
[2022-05-15 10:36:03] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 0 ms to minimize.
[2022-05-15 10:36:03] [INFO ] Deduced a trap composed of 4 places in 11 ms of which 0 ms to minimize.
[2022-05-15 10:36:03] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2022-05-15 10:36:03] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2022-05-15 10:36:03] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2022-05-15 10:36:03] [INFO ] Deduced a trap composed of 4 places in 11 ms of which 0 ms to minimize.
[2022-05-15 10:36:03] [INFO ] Deduced a trap composed of 4 places in 10 ms of which 1 ms to minimize.
[2022-05-15 10:36:03] [INFO ] Deduced a trap composed of 4 places in 11 ms of which 0 ms to minimize.
[2022-05-15 10:36:03] [INFO ] Deduced a trap composed of 4 places in 8 ms of which 0 ms to minimize.
[2022-05-15 10:36:04] [INFO ] Deduced a trap composed of 4 places in 11 ms of which 1 ms to minimize.
[2022-05-15 10:36:04] [INFO ] Deduced a trap composed of 4 places in 10 ms of which 1 ms to minimize.
[2022-05-15 10:36:04] [INFO ] Deduced a trap composed of 4 places in 10 ms of which 0 ms to minimize.
[2022-05-15 10:36:04] [INFO ] Deduced a trap composed of 4 places in 8 ms of which 0 ms to minimize.
[2022-05-15 10:36:04] [INFO ] Deduced a trap composed of 4 places in 7 ms of which 0 ms to minimize.
[2022-05-15 10:36:04] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 674 ms
[2022-05-15 10:36:04] [INFO ] Computed and/alt/rep : 40/60/40 causal constraints (skipped 20 transitions) in 10 ms.
[2022-05-15 10:36:04] [INFO ] Added : 1 causal constraints over 1 iterations in 22 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-15 10:36:04] [INFO ] [Real]Absence check using 40 positive place invariants in 10 ms returned sat
[2022-05-15 10:36:04] [INFO ] [Real]Absence check using 40 positive and 20 generalized place invariants in 2 ms returned sat
[2022-05-15 10:36:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 10:36:04] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-05-15 10:36:04] [INFO ] [Real]Added 20 Read/Feed constraints in 3 ms returned sat
[2022-05-15 10:36:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 10:36:04] [INFO ] [Nat]Absence check using 40 positive place invariants in 6 ms returned sat
[2022-05-15 10:36:04] [INFO ] [Nat]Absence check using 40 positive and 20 generalized place invariants in 2 ms returned sat
[2022-05-15 10:36:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 10:36:04] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2022-05-15 10:36:04] [INFO ] [Nat]Added 20 Read/Feed constraints in 3 ms returned sat
[2022-05-15 10:36:04] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2022-05-15 10:36:04] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2022-05-15 10:36:04] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2022-05-15 10:36:04] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2022-05-15 10:36:04] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2022-05-15 10:36:04] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2022-05-15 10:36:04] [INFO ] Deduced a trap composed of 5 places in 13 ms of which 0 ms to minimize.
[2022-05-15 10:36:04] [INFO ] Deduced a trap composed of 6 places in 11 ms of which 0 ms to minimize.
[2022-05-15 10:36:04] [INFO ] Deduced a trap composed of 5 places in 10 ms of which 0 ms to minimize.
[2022-05-15 10:36:04] [INFO ] Deduced a trap composed of 6 places in 8 ms of which 1 ms to minimize.
[2022-05-15 10:36:04] [INFO ] Deduced a trap composed of 4 places in 7 ms of which 1 ms to minimize.
[2022-05-15 10:36:04] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2022-05-15 10:36:04] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2022-05-15 10:36:04] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 0 ms to minimize.
[2022-05-15 10:36:04] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 1 ms to minimize.
[2022-05-15 10:36:04] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2022-05-15 10:36:04] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 0 ms to minimize.
[2022-05-15 10:36:04] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2022-05-15 10:36:04] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 1 ms to minimize.
[2022-05-15 10:36:04] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2022-05-15 10:36:04] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2022-05-15 10:36:04] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 0 ms to minimize.
[2022-05-15 10:36:04] [INFO ] Deduced a trap composed of 6 places in 13 ms of which 1 ms to minimize.
[2022-05-15 10:36:04] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 3 ms to minimize.
[2022-05-15 10:36:04] [INFO ] Deduced a trap composed of 4 places in 10 ms of which 1 ms to minimize.
[2022-05-15 10:36:04] [INFO ] Deduced a trap composed of 6 places in 8 ms of which 1 ms to minimize.
[2022-05-15 10:36:04] [INFO ] Deduced a trap composed of 5 places in 10 ms of which 1 ms to minimize.
[2022-05-15 10:36:04] [INFO ] Deduced a trap composed of 6 places in 9 ms of which 0 ms to minimize.
[2022-05-15 10:36:04] [INFO ] Deduced a trap composed of 5 places in 11 ms of which 0 ms to minimize.
[2022-05-15 10:36:04] [INFO ] Deduced a trap composed of 6 places in 9 ms of which 1 ms to minimize.
[2022-05-15 10:36:04] [INFO ] Deduced a trap composed of 6 places in 9 ms of which 0 ms to minimize.
[2022-05-15 10:36:04] [INFO ] Deduced a trap composed of 4 places in 9 ms of which 0 ms to minimize.
[2022-05-15 10:36:04] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2022-05-15 10:36:04] [INFO ] Deduced a trap composed of 4 places in 9 ms of which 1 ms to minimize.
[2022-05-15 10:36:04] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 0 ms to minimize.
[2022-05-15 10:36:04] [INFO ] Deduced a trap composed of 4 places in 9 ms of which 1 ms to minimize.
[2022-05-15 10:36:04] [INFO ] Deduced a trap composed of 4 places in 8 ms of which 0 ms to minimize.
[2022-05-15 10:36:04] [INFO ] Deduced a trap composed of 4 places in 10 ms of which 0 ms to minimize.
[2022-05-15 10:36:04] [INFO ] Deduced a trap composed of 4 places in 10 ms of which 1 ms to minimize.
[2022-05-15 10:36:04] [INFO ] Deduced a trap composed of 4 places in 7 ms of which 0 ms to minimize.
[2022-05-15 10:36:04] [INFO ] Trap strengthening (SAT) tested/added 41/40 trap constraints in 716 ms
[2022-05-15 10:36:04] [INFO ] Computed and/alt/rep : 40/60/40 causal constraints (skipped 20 transitions) in 13 ms.
[2022-05-15 10:36:04] [INFO ] Added : 1 causal constraints over 1 iterations in 29 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-15 10:36:04] [INFO ] [Real]Absence check using 40 positive place invariants in 5 ms returned sat
[2022-05-15 10:36:04] [INFO ] [Real]Absence check using 40 positive and 20 generalized place invariants in 2 ms returned sat
[2022-05-15 10:36:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 10:36:05] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-15 10:36:05] [INFO ] [Real]Added 20 Read/Feed constraints in 2 ms returned sat
[2022-05-15 10:36:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 10:36:05] [INFO ] [Nat]Absence check using 40 positive place invariants in 6 ms returned sat
[2022-05-15 10:36:05] [INFO ] [Nat]Absence check using 40 positive and 20 generalized place invariants in 2 ms returned sat
[2022-05-15 10:36:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 10:36:05] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2022-05-15 10:36:05] [INFO ] [Nat]Added 20 Read/Feed constraints in 2 ms returned sat
[2022-05-15 10:36:05] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2022-05-15 10:36:05] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2022-05-15 10:36:05] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2022-05-15 10:36:05] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2022-05-15 10:36:05] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 0 ms to minimize.
[2022-05-15 10:36:05] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 1 ms to minimize.
[2022-05-15 10:36:05] [INFO ] Deduced a trap composed of 4 places in 10 ms of which 0 ms to minimize.
[2022-05-15 10:36:05] [INFO ] Deduced a trap composed of 4 places in 11 ms of which 0 ms to minimize.
[2022-05-15 10:36:05] [INFO ] Deduced a trap composed of 5 places in 10 ms of which 1 ms to minimize.
[2022-05-15 10:36:05] [INFO ] Deduced a trap composed of 6 places in 9 ms of which 0 ms to minimize.
[2022-05-15 10:36:05] [INFO ] Deduced a trap composed of 4 places in 8 ms of which 1 ms to minimize.
[2022-05-15 10:36:05] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2022-05-15 10:36:05] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2022-05-15 10:36:05] [INFO ] Deduced a trap composed of 5 places in 12 ms of which 0 ms to minimize.
[2022-05-15 10:36:05] [INFO ] Deduced a trap composed of 5 places in 11 ms of which 0 ms to minimize.
[2022-05-15 10:36:05] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2022-05-15 10:36:05] [INFO ] Deduced a trap composed of 6 places in 12 ms of which 0 ms to minimize.
[2022-05-15 10:36:05] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2022-05-15 10:36:05] [INFO ] Deduced a trap composed of 4 places in 10 ms of which 1 ms to minimize.
[2022-05-15 10:36:05] [INFO ] Deduced a trap composed of 6 places in 10 ms of which 0 ms to minimize.
[2022-05-15 10:36:05] [INFO ] Deduced a trap composed of 4 places in 8 ms of which 1 ms to minimize.
[2022-05-15 10:36:05] [INFO ] Deduced a trap composed of 6 places in 11 ms of which 0 ms to minimize.
[2022-05-15 10:36:05] [INFO ] Deduced a trap composed of 4 places in 7 ms of which 0 ms to minimize.
[2022-05-15 10:36:05] [INFO ] Deduced a trap composed of 4 places in 8 ms of which 0 ms to minimize.
[2022-05-15 10:36:05] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 440 ms
[2022-05-15 10:36:05] [INFO ] Computed and/alt/rep : 40/60/40 causal constraints (skipped 20 transitions) in 11 ms.
[2022-05-15 10:36:05] [INFO ] Added : 1 causal constraints over 1 iterations in 25 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 0 ms.
[2022-05-15 10:36:05] [INFO ] [Real]Absence check using 40 positive place invariants in 5 ms returned sat
[2022-05-15 10:36:05] [INFO ] [Real]Absence check using 40 positive and 20 generalized place invariants in 2 ms returned sat
[2022-05-15 10:36:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 10:36:05] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-15 10:36:05] [INFO ] [Real]Added 20 Read/Feed constraints in 2 ms returned sat
[2022-05-15 10:36:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 10:36:05] [INFO ] [Nat]Absence check using 40 positive place invariants in 5 ms returned sat
[2022-05-15 10:36:05] [INFO ] [Nat]Absence check using 40 positive and 20 generalized place invariants in 2 ms returned sat
[2022-05-15 10:36:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 10:36:05] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2022-05-15 10:36:05] [INFO ] [Nat]Added 20 Read/Feed constraints in 2 ms returned sat
[2022-05-15 10:36:05] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2022-05-15 10:36:05] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2022-05-15 10:36:05] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2022-05-15 10:36:05] [INFO ] Deduced a trap composed of 5 places in 13 ms of which 0 ms to minimize.
[2022-05-15 10:36:05] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2022-05-15 10:36:05] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2022-05-15 10:36:05] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2022-05-15 10:36:05] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 0 ms to minimize.
[2022-05-15 10:36:05] [INFO ] Deduced a trap composed of 5 places in 12 ms of which 0 ms to minimize.
[2022-05-15 10:36:05] [INFO ] Deduced a trap composed of 6 places in 9 ms of which 0 ms to minimize.
[2022-05-15 10:36:05] [INFO ] Deduced a trap composed of 4 places in 8 ms of which 0 ms to minimize.
[2022-05-15 10:36:05] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2022-05-15 10:36:05] [INFO ] Deduced a trap composed of 6 places in 10 ms of which 0 ms to minimize.
[2022-05-15 10:36:05] [INFO ] Deduced a trap composed of 4 places in 8 ms of which 0 ms to minimize.
[2022-05-15 10:36:05] [INFO ] Deduced a trap composed of 6 places in 13 ms of which 0 ms to minimize.
[2022-05-15 10:36:05] [INFO ] Deduced a trap composed of 4 places in 9 ms of which 0 ms to minimize.
[2022-05-15 10:36:05] [INFO ] Deduced a trap composed of 4 places in 10 ms of which 0 ms to minimize.
[2022-05-15 10:36:05] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 308 ms
[2022-05-15 10:36:05] [INFO ] Computed and/alt/rep : 40/60/40 causal constraints (skipped 20 transitions) in 11 ms.
[2022-05-15 10:36:05] [INFO ] Added : 1 causal constraints over 1 iterations in 25 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-15 10:36:06] [INFO ] [Real]Absence check using 40 positive place invariants in 5 ms returned sat
[2022-05-15 10:36:06] [INFO ] [Real]Absence check using 40 positive and 20 generalized place invariants in 3 ms returned sat
[2022-05-15 10:36:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 10:36:06] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-15 10:36:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 10:36:06] [INFO ] [Nat]Absence check using 40 positive place invariants in 5 ms returned sat
[2022-05-15 10:36:06] [INFO ] [Nat]Absence check using 40 positive and 20 generalized place invariants in 2 ms returned sat
[2022-05-15 10:36:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 10:36:06] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2022-05-15 10:36:06] [INFO ] [Nat]Added 20 Read/Feed constraints in 2 ms returned sat
[2022-05-15 10:36:06] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2022-05-15 10:36:06] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2022-05-15 10:36:06] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2022-05-15 10:36:06] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2022-05-15 10:36:06] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2022-05-15 10:36:06] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2022-05-15 10:36:06] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2022-05-15 10:36:06] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2022-05-15 10:36:06] [INFO ] Deduced a trap composed of 6 places in 12 ms of which 0 ms to minimize.
[2022-05-15 10:36:06] [INFO ] Deduced a trap composed of 6 places in 12 ms of which 0 ms to minimize.
[2022-05-15 10:36:06] [INFO ] Deduced a trap composed of 5 places in 10 ms of which 0 ms to minimize.
[2022-05-15 10:36:06] [INFO ] Deduced a trap composed of 6 places in 12 ms of which 0 ms to minimize.
[2022-05-15 10:36:06] [INFO ] Deduced a trap composed of 5 places in 11 ms of which 0 ms to minimize.
[2022-05-15 10:36:06] [INFO ] Deduced a trap composed of 5 places in 11 ms of which 0 ms to minimize.
[2022-05-15 10:36:06] [INFO ] Deduced a trap composed of 6 places in 9 ms of which 0 ms to minimize.
[2022-05-15 10:36:06] [INFO ] Deduced a trap composed of 4 places in 9 ms of which 0 ms to minimize.
[2022-05-15 10:36:06] [INFO ] Deduced a trap composed of 5 places in 13 ms of which 0 ms to minimize.
[2022-05-15 10:36:06] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2022-05-15 10:36:06] [INFO ] Deduced a trap composed of 4 places in 11 ms of which 0 ms to minimize.
[2022-05-15 10:36:06] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 0 ms to minimize.
[2022-05-15 10:36:06] [INFO ] Deduced a trap composed of 4 places in 11 ms of which 0 ms to minimize.
[2022-05-15 10:36:06] [INFO ] Deduced a trap composed of 5 places in 13 ms of which 0 ms to minimize.
[2022-05-15 10:36:06] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2022-05-15 10:36:06] [INFO ] Deduced a trap composed of 5 places in 13 ms of which 0 ms to minimize.
[2022-05-15 10:36:06] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 0 ms to minimize.
[2022-05-15 10:36:06] [INFO ] Deduced a trap composed of 4 places in 10 ms of which 0 ms to minimize.
[2022-05-15 10:36:06] [INFO ] Deduced a trap composed of 5 places in 9 ms of which 0 ms to minimize.
[2022-05-15 10:36:06] [INFO ] Deduced a trap composed of 4 places in 10 ms of which 0 ms to minimize.
[2022-05-15 10:36:06] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 0 ms to minimize.
[2022-05-15 10:36:06] [INFO ] Deduced a trap composed of 4 places in 10 ms of which 0 ms to minimize.
[2022-05-15 10:36:06] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 0 ms to minimize.
[2022-05-15 10:36:06] [INFO ] Deduced a trap composed of 4 places in 11 ms of which 1 ms to minimize.
[2022-05-15 10:36:06] [INFO ] Deduced a trap composed of 4 places in 11 ms of which 0 ms to minimize.
[2022-05-15 10:36:06] [INFO ] Deduced a trap composed of 4 places in 10 ms of which 0 ms to minimize.
[2022-05-15 10:36:06] [INFO ] Deduced a trap composed of 4 places in 10 ms of which 0 ms to minimize.
[2022-05-15 10:36:06] [INFO ] Deduced a trap composed of 4 places in 9 ms of which 0 ms to minimize.
[2022-05-15 10:36:06] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 636 ms
[2022-05-15 10:36:06] [INFO ] Computed and/alt/rep : 40/60/40 causal constraints (skipped 20 transitions) in 12 ms.
[2022-05-15 10:36:06] [INFO ] Added : 1 causal constraints over 1 iterations in 25 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-15 10:36:06] [INFO ] [Real]Absence check using 40 positive place invariants in 4 ms returned sat
[2022-05-15 10:36:06] [INFO ] [Real]Absence check using 40 positive and 20 generalized place invariants in 2 ms returned sat
[2022-05-15 10:36:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 10:36:06] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-15 10:36:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 10:36:06] [INFO ] [Nat]Absence check using 40 positive place invariants in 6 ms returned sat
[2022-05-15 10:36:06] [INFO ] [Nat]Absence check using 40 positive and 20 generalized place invariants in 2 ms returned sat
[2022-05-15 10:36:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 10:36:06] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-05-15 10:36:06] [INFO ] [Nat]Added 20 Read/Feed constraints in 2 ms returned sat
[2022-05-15 10:36:06] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2022-05-15 10:36:06] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2022-05-15 10:36:06] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2022-05-15 10:36:06] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2022-05-15 10:36:06] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2022-05-15 10:36:06] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2022-05-15 10:36:06] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2022-05-15 10:36:07] [INFO ] Deduced a trap composed of 4 places in 10 ms of which 0 ms to minimize.
[2022-05-15 10:36:07] [INFO ] Deduced a trap composed of 5 places in 10 ms of which 0 ms to minimize.
[2022-05-15 10:36:07] [INFO ] Deduced a trap composed of 5 places in 10 ms of which 0 ms to minimize.
[2022-05-15 10:36:07] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2022-05-15 10:36:07] [INFO ] Deduced a trap composed of 5 places in 11 ms of which 0 ms to minimize.
[2022-05-15 10:36:07] [INFO ] Deduced a trap composed of 5 places in 12 ms of which 0 ms to minimize.
[2022-05-15 10:36:07] [INFO ] Deduced a trap composed of 5 places in 9 ms of which 0 ms to minimize.
[2022-05-15 10:36:07] [INFO ] Deduced a trap composed of 6 places in 9 ms of which 0 ms to minimize.
[2022-05-15 10:36:07] [INFO ] Deduced a trap composed of 4 places in 9 ms of which 0 ms to minimize.
[2022-05-15 10:36:07] [INFO ] Deduced a trap composed of 4 places in 9 ms of which 0 ms to minimize.
[2022-05-15 10:36:07] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 327 ms
[2022-05-15 10:36:07] [INFO ] Computed and/alt/rep : 40/60/40 causal constraints (skipped 20 transitions) in 10 ms.
[2022-05-15 10:36:07] [INFO ] Added : 1 causal constraints over 1 iterations in 25 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 0 ms.
[2022-05-15 10:36:07] [INFO ] [Real]Absence check using 40 positive place invariants in 5 ms returned sat
[2022-05-15 10:36:07] [INFO ] [Real]Absence check using 40 positive and 20 generalized place invariants in 2 ms returned sat
[2022-05-15 10:36:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 10:36:07] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-15 10:36:07] [INFO ] [Real]Added 20 Read/Feed constraints in 2 ms returned sat
[2022-05-15 10:36:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 10:36:07] [INFO ] [Nat]Absence check using 40 positive place invariants in 5 ms returned sat
[2022-05-15 10:36:07] [INFO ] [Nat]Absence check using 40 positive and 20 generalized place invariants in 2 ms returned sat
[2022-05-15 10:36:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 10:36:07] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2022-05-15 10:36:07] [INFO ] [Nat]Added 20 Read/Feed constraints in 2 ms returned sat
[2022-05-15 10:36:07] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2022-05-15 10:36:07] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2022-05-15 10:36:07] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2022-05-15 10:36:07] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2022-05-15 10:36:07] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2022-05-15 10:36:07] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2022-05-15 10:36:07] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2022-05-15 10:36:07] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2022-05-15 10:36:07] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2022-05-15 10:36:07] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2022-05-15 10:36:07] [INFO ] Deduced a trap composed of 5 places in 11 ms of which 0 ms to minimize.
[2022-05-15 10:36:07] [INFO ] Deduced a trap composed of 6 places in 9 ms of which 0 ms to minimize.
[2022-05-15 10:36:07] [INFO ] Deduced a trap composed of 4 places in 8 ms of which 1 ms to minimize.
[2022-05-15 10:36:07] [INFO ] Deduced a trap composed of 4 places in 8 ms of which 0 ms to minimize.
[2022-05-15 10:36:07] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 275 ms
[2022-05-15 10:36:07] [INFO ] Computed and/alt/rep : 40/60/40 causal constraints (skipped 20 transitions) in 10 ms.
[2022-05-15 10:36:07] [INFO ] Added : 1 causal constraints over 1 iterations in 27 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 0 ms.
[2022-05-15 10:36:07] [INFO ] [Real]Absence check using 40 positive place invariants in 5 ms returned sat
[2022-05-15 10:36:07] [INFO ] [Real]Absence check using 40 positive and 20 generalized place invariants in 2 ms returned sat
[2022-05-15 10:36:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 10:36:07] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-15 10:36:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 10:36:07] [INFO ] [Nat]Absence check using 40 positive place invariants in 6 ms returned sat
[2022-05-15 10:36:07] [INFO ] [Nat]Absence check using 40 positive and 20 generalized place invariants in 2 ms returned sat
[2022-05-15 10:36:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 10:36:07] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-05-15 10:36:07] [INFO ] [Nat]Added 20 Read/Feed constraints in 2 ms returned sat
[2022-05-15 10:36:07] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
[2022-05-15 10:36:07] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2022-05-15 10:36:07] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2022-05-15 10:36:07] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2022-05-15 10:36:07] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2022-05-15 10:36:07] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2022-05-15 10:36:07] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2022-05-15 10:36:07] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2022-05-15 10:36:07] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2022-05-15 10:36:07] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 4 ms to minimize.
[2022-05-15 10:36:07] [INFO ] Deduced a trap composed of 6 places in 11 ms of which 0 ms to minimize.
[2022-05-15 10:36:07] [INFO ] Deduced a trap composed of 4 places in 9 ms of which 0 ms to minimize.
[2022-05-15 10:36:07] [INFO ] Deduced a trap composed of 4 places in 9 ms of which 0 ms to minimize.
[2022-05-15 10:36:07] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 293 ms
[2022-05-15 10:36:08] [INFO ] Computed and/alt/rep : 40/60/40 causal constraints (skipped 20 transitions) in 28 ms.
[2022-05-15 10:36:08] [INFO ] Added : 1 causal constraints over 1 iterations in 40 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-15 10:36:08] [INFO ] [Real]Absence check using 40 positive place invariants in 6 ms returned sat
[2022-05-15 10:36:08] [INFO ] [Real]Absence check using 40 positive and 20 generalized place invariants in 8 ms returned sat
[2022-05-15 10:36:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 10:36:08] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-05-15 10:36:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 10:36:08] [INFO ] [Nat]Absence check using 40 positive place invariants in 5 ms returned sat
[2022-05-15 10:36:08] [INFO ] [Nat]Absence check using 40 positive and 20 generalized place invariants in 2 ms returned sat
[2022-05-15 10:36:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 10:36:08] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2022-05-15 10:36:08] [INFO ] [Nat]Added 20 Read/Feed constraints in 2 ms returned sat
[2022-05-15 10:36:08] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2022-05-15 10:36:08] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 0 ms to minimize.
[2022-05-15 10:36:08] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2022-05-15 10:36:08] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2022-05-15 10:36:08] [INFO ] Deduced a trap composed of 5 places in 13 ms of which 0 ms to minimize.
[2022-05-15 10:36:08] [INFO ] Deduced a trap composed of 5 places in 12 ms of which 0 ms to minimize.
[2022-05-15 10:36:08] [INFO ] Deduced a trap composed of 4 places in 11 ms of which 0 ms to minimize.
[2022-05-15 10:36:08] [INFO ] Deduced a trap composed of 5 places in 12 ms of which 0 ms to minimize.
[2022-05-15 10:36:08] [INFO ] Deduced a trap composed of 4 places in 11 ms of which 0 ms to minimize.
[2022-05-15 10:36:08] [INFO ] Deduced a trap composed of 5 places in 10 ms of which 0 ms to minimize.
[2022-05-15 10:36:08] [INFO ] Deduced a trap composed of 6 places in 9 ms of which 0 ms to minimize.
[2022-05-15 10:36:08] [INFO ] Deduced a trap composed of 4 places in 7 ms of which 1 ms to minimize.
[2022-05-15 10:36:08] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2022-05-15 10:36:08] [INFO ] Deduced a trap composed of 5 places in 12 ms of which 0 ms to minimize.
[2022-05-15 10:36:08] [INFO ] Deduced a trap composed of 4 places in 11 ms of which 0 ms to minimize.
[2022-05-15 10:36:08] [INFO ] Deduced a trap composed of 5 places in 9 ms of which 0 ms to minimize.
[2022-05-15 10:36:08] [INFO ] Deduced a trap composed of 4 places in 10 ms of which 0 ms to minimize.
[2022-05-15 10:36:08] [INFO ] Deduced a trap composed of 5 places in 9 ms of which 0 ms to minimize.
[2022-05-15 10:36:08] [INFO ] Deduced a trap composed of 5 places in 9 ms of which 0 ms to minimize.
[2022-05-15 10:36:08] [INFO ] Deduced a trap composed of 4 places in 7 ms of which 0 ms to minimize.
[2022-05-15 10:36:08] [INFO ] Deduced a trap composed of 5 places in 9 ms of which 1 ms to minimize.
[2022-05-15 10:36:08] [INFO ] Deduced a trap composed of 4 places in 7 ms of which 0 ms to minimize.
[2022-05-15 10:36:08] [INFO ] Deduced a trap composed of 4 places in 7 ms of which 0 ms to minimize.
[2022-05-15 10:36:08] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 351 ms
[2022-05-15 10:36:08] [INFO ] Computed and/alt/rep : 40/60/40 causal constraints (skipped 20 transitions) in 9 ms.
[2022-05-15 10:36:08] [INFO ] Added : 1 causal constraints over 1 iterations in 22 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 0 ms.
[2022-05-15 10:36:08] [INFO ] [Real]Absence check using 40 positive place invariants in 5 ms returned sat
[2022-05-15 10:36:08] [INFO ] [Real]Absence check using 40 positive and 20 generalized place invariants in 2 ms returned sat
[2022-05-15 10:36:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 10:36:08] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-15 10:36:08] [INFO ] [Real]Added 20 Read/Feed constraints in 3 ms returned sat
[2022-05-15 10:36:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 10:36:08] [INFO ] [Nat]Absence check using 40 positive place invariants in 6 ms returned sat
[2022-05-15 10:36:08] [INFO ] [Nat]Absence check using 40 positive and 20 generalized place invariants in 2 ms returned sat
[2022-05-15 10:36:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 10:36:08] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2022-05-15 10:36:08] [INFO ] [Nat]Added 20 Read/Feed constraints in 2 ms returned sat
[2022-05-15 10:36:08] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2022-05-15 10:36:08] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2022-05-15 10:36:08] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2022-05-15 10:36:08] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2022-05-15 10:36:08] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2022-05-15 10:36:08] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2022-05-15 10:36:08] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2022-05-15 10:36:08] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2022-05-15 10:36:08] [INFO ] Deduced a trap composed of 6 places in 12 ms of which 0 ms to minimize.
[2022-05-15 10:36:08] [INFO ] Deduced a trap composed of 6 places in 13 ms of which 0 ms to minimize.
[2022-05-15 10:36:08] [INFO ] Deduced a trap composed of 5 places in 11 ms of which 0 ms to minimize.
[2022-05-15 10:36:08] [INFO ] Deduced a trap composed of 6 places in 10 ms of which 1 ms to minimize.
[2022-05-15 10:36:08] [INFO ] Deduced a trap composed of 4 places in 8 ms of which 1 ms to minimize.
[2022-05-15 10:36:08] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2022-05-15 10:36:08] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2022-05-15 10:36:08] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2022-05-15 10:36:08] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 0 ms to minimize.
[2022-05-15 10:36:08] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2022-05-15 10:36:08] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 5 ms to minimize.
[2022-05-15 10:36:09] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2022-05-15 10:36:09] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2022-05-15 10:36:09] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2022-05-15 10:36:09] [INFO ] Deduced a trap composed of 4 places in 10 ms of which 0 ms to minimize.
[2022-05-15 10:36:09] [INFO ] Deduced a trap composed of 4 places in 10 ms of which 0 ms to minimize.
[2022-05-15 10:36:09] [INFO ] Deduced a trap composed of 4 places in 9 ms of which 0 ms to minimize.
[2022-05-15 10:36:09] [INFO ] Deduced a trap composed of 4 places in 8 ms of which 0 ms to minimize.
[2022-05-15 10:36:09] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 519 ms
[2022-05-15 10:36:09] [INFO ] Computed and/alt/rep : 40/60/40 causal constraints (skipped 20 transitions) in 13 ms.
[2022-05-15 10:36:09] [INFO ] Added : 1 causal constraints over 1 iterations in 34 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-15 10:36:09] [INFO ] [Real]Absence check using 40 positive place invariants in 5 ms returned sat
[2022-05-15 10:36:09] [INFO ] [Real]Absence check using 40 positive and 20 generalized place invariants in 2 ms returned sat
[2022-05-15 10:36:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 10:36:09] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-15 10:36:09] [INFO ] [Real]Added 20 Read/Feed constraints in 2 ms returned sat
[2022-05-15 10:36:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 10:36:09] [INFO ] [Nat]Absence check using 40 positive place invariants in 5 ms returned sat
[2022-05-15 10:36:09] [INFO ] [Nat]Absence check using 40 positive and 20 generalized place invariants in 2 ms returned sat
[2022-05-15 10:36:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 10:36:09] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-05-15 10:36:09] [INFO ] [Nat]Added 20 Read/Feed constraints in 5 ms returned sat
[2022-05-15 10:36:09] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2022-05-15 10:36:09] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2022-05-15 10:36:09] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2022-05-15 10:36:09] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2022-05-15 10:36:09] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 1 ms to minimize.
[2022-05-15 10:36:09] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2022-05-15 10:36:09] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2022-05-15 10:36:09] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2022-05-15 10:36:09] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 1 ms to minimize.
[2022-05-15 10:36:09] [INFO ] Deduced a trap composed of 5 places in 10 ms of which 0 ms to minimize.
[2022-05-15 10:36:09] [INFO ] Deduced a trap composed of 6 places in 13 ms of which 0 ms to minimize.
[2022-05-15 10:36:09] [INFO ] Deduced a trap composed of 4 places in 7 ms of which 0 ms to minimize.
[2022-05-15 10:36:09] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2022-05-15 10:36:09] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2022-05-15 10:36:09] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2022-05-15 10:36:09] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2022-05-15 10:36:09] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 326 ms
[2022-05-15 10:36:09] [INFO ] Computed and/alt/rep : 40/60/40 causal constraints (skipped 20 transitions) in 9 ms.
[2022-05-15 10:36:09] [INFO ] Added : 1 causal constraints over 1 iterations in 28 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-15 10:36:09] [INFO ] [Real]Absence check using 40 positive place invariants in 5 ms returned sat
[2022-05-15 10:36:09] [INFO ] [Real]Absence check using 40 positive and 20 generalized place invariants in 2 ms returned sat
[2022-05-15 10:36:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 10:36:09] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-15 10:36:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 10:36:09] [INFO ] [Nat]Absence check using 40 positive place invariants in 6 ms returned sat
[2022-05-15 10:36:09] [INFO ] [Nat]Absence check using 40 positive and 20 generalized place invariants in 4 ms returned sat
[2022-05-15 10:36:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 10:36:09] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-05-15 10:36:09] [INFO ] [Nat]Added 20 Read/Feed constraints in 5 ms returned sat
[2022-05-15 10:36:09] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2022-05-15 10:36:09] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2022-05-15 10:36:09] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2022-05-15 10:36:09] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2022-05-15 10:36:09] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 1 ms to minimize.
[2022-05-15 10:36:09] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2022-05-15 10:36:09] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2022-05-15 10:36:09] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2022-05-15 10:36:09] [INFO ] Deduced a trap composed of 4 places in 11 ms of which 0 ms to minimize.
[2022-05-15 10:36:09] [INFO ] Deduced a trap composed of 5 places in 13 ms of which 0 ms to minimize.
[2022-05-15 10:36:09] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 0 ms to minimize.
[2022-05-15 10:36:09] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2022-05-15 10:36:10] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 0 ms to minimize.
[2022-05-15 10:36:10] [INFO ] Deduced a trap composed of 4 places in 11 ms of which 1 ms to minimize.
[2022-05-15 10:36:10] [INFO ] Deduced a trap composed of 4 places in 8 ms of which 1 ms to minimize.
[2022-05-15 10:36:10] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 330 ms
[2022-05-15 10:36:10] [INFO ] Computed and/alt/rep : 40/60/40 causal constraints (skipped 20 transitions) in 10 ms.
[2022-05-15 10:36:10] [INFO ] Added : 1 causal constraints over 1 iterations in 22 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 0 ms.
[2022-05-15 10:36:10] [INFO ] [Real]Absence check using 40 positive place invariants in 5 ms returned sat
[2022-05-15 10:36:10] [INFO ] [Real]Absence check using 40 positive and 20 generalized place invariants in 2 ms returned sat
[2022-05-15 10:36:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 10:36:10] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-15 10:36:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 10:36:10] [INFO ] [Nat]Absence check using 40 positive place invariants in 6 ms returned sat
[2022-05-15 10:36:10] [INFO ] [Nat]Absence check using 40 positive and 20 generalized place invariants in 2 ms returned sat
[2022-05-15 10:36:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 10:36:10] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-05-15 10:36:10] [INFO ] [Nat]Added 20 Read/Feed constraints in 2 ms returned sat
[2022-05-15 10:36:10] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2022-05-15 10:36:10] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2022-05-15 10:36:10] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2022-05-15 10:36:10] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2022-05-15 10:36:10] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2022-05-15 10:36:10] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2022-05-15 10:36:10] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 1 ms to minimize.
[2022-05-15 10:36:10] [INFO ] Deduced a trap composed of 6 places in 13 ms of which 0 ms to minimize.
[2022-05-15 10:36:10] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2022-05-15 10:36:10] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
[2022-05-15 10:36:10] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2022-05-15 10:36:10] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2022-05-15 10:36:10] [INFO ] Deduced a trap composed of 6 places in 12 ms of which 0 ms to minimize.
[2022-05-15 10:36:10] [INFO ] Deduced a trap composed of 5 places in 11 ms of which 0 ms to minimize.
[2022-05-15 10:36:10] [INFO ] Deduced a trap composed of 6 places in 9 ms of which 0 ms to minimize.
[2022-05-15 10:36:10] [INFO ] Deduced a trap composed of 4 places in 8 ms of which 0 ms to minimize.
[2022-05-15 10:36:10] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2022-05-15 10:36:10] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2022-05-15 10:36:10] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2022-05-15 10:36:10] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 1 ms to minimize.
[2022-05-15 10:36:10] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2022-05-15 10:36:10] [INFO ] Deduced a trap composed of 5 places in 10 ms of which 0 ms to minimize.
[2022-05-15 10:36:10] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 0 ms to minimize.
[2022-05-15 10:36:10] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2022-05-15 10:36:10] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2022-05-15 10:36:10] [INFO ] Deduced a trap composed of 6 places in 9 ms of which 0 ms to minimize.
[2022-05-15 10:36:10] [INFO ] Deduced a trap composed of 4 places in 9 ms of which 1 ms to minimize.
[2022-05-15 10:36:10] [INFO ] Deduced a trap composed of 4 places in 8 ms of which 1 ms to minimize.
[2022-05-15 10:36:10] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 584 ms
[2022-05-15 10:36:10] [INFO ] Computed and/alt/rep : 40/60/40 causal constraints (skipped 20 transitions) in 12 ms.
[2022-05-15 10:36:10] [INFO ] Added : 1 causal constraints over 1 iterations in 23 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 0 ms.
[2022-05-15 10:36:10] [INFO ] [Real]Absence check using 40 positive place invariants in 5 ms returned sat
[2022-05-15 10:36:10] [INFO ] [Real]Absence check using 40 positive and 20 generalized place invariants in 3 ms returned sat
[2022-05-15 10:36:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 10:36:10] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-15 10:36:10] [INFO ] [Real]Added 20 Read/Feed constraints in 3 ms returned sat
[2022-05-15 10:36:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 10:36:10] [INFO ] [Nat]Absence check using 40 positive place invariants in 6 ms returned sat
[2022-05-15 10:36:10] [INFO ] [Nat]Absence check using 40 positive and 20 generalized place invariants in 2 ms returned sat
[2022-05-15 10:36:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 10:36:10] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-05-15 10:36:10] [INFO ] [Nat]Added 20 Read/Feed constraints in 2 ms returned sat
[2022-05-15 10:36:10] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2022-05-15 10:36:10] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2022-05-15 10:36:10] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2022-05-15 10:36:11] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2022-05-15 10:36:11] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2022-05-15 10:36:11] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2022-05-15 10:36:11] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2022-05-15 10:36:11] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2022-05-15 10:36:11] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2022-05-15 10:36:11] [INFO ] Deduced a trap composed of 5 places in 12 ms of which 0 ms to minimize.
[2022-05-15 10:36:11] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 0 ms to minimize.
[2022-05-15 10:36:11] [INFO ] Deduced a trap composed of 5 places in 10 ms of which 0 ms to minimize.
[2022-05-15 10:36:11] [INFO ] Deduced a trap composed of 6 places in 11 ms of which 0 ms to minimize.
[2022-05-15 10:36:11] [INFO ] Deduced a trap composed of 4 places in 8 ms of which 1 ms to minimize.
[2022-05-15 10:36:11] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
[2022-05-15 10:36:11] [INFO ] Deduced a trap composed of 6 places in 13 ms of which 1 ms to minimize.
[2022-05-15 10:36:11] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2022-05-15 10:36:11] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2022-05-15 10:36:11] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 393 ms
[2022-05-15 10:36:11] [INFO ] Computed and/alt/rep : 40/60/40 causal constraints (skipped 20 transitions) in 12 ms.
[2022-05-15 10:36:11] [INFO ] Added : 1 causal constraints over 1 iterations in 27 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 0 ms.
[2022-05-15 10:36:11] [INFO ] [Real]Absence check using 40 positive place invariants in 6 ms returned sat
[2022-05-15 10:36:11] [INFO ] [Real]Absence check using 40 positive and 20 generalized place invariants in 2 ms returned sat
[2022-05-15 10:36:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 10:36:11] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-15 10:36:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 10:36:11] [INFO ] [Nat]Absence check using 40 positive place invariants in 6 ms returned sat
[2022-05-15 10:36:11] [INFO ] [Nat]Absence check using 40 positive and 20 generalized place invariants in 2 ms returned sat
[2022-05-15 10:36:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 10:36:11] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-05-15 10:36:11] [INFO ] [Nat]Added 20 Read/Feed constraints in 2 ms returned sat
[2022-05-15 10:36:11] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2022-05-15 10:36:11] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2022-05-15 10:36:11] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2022-05-15 10:36:11] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2022-05-15 10:36:11] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2022-05-15 10:36:11] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2022-05-15 10:36:11] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2022-05-15 10:36:11] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2022-05-15 10:36:11] [INFO ] Deduced a trap composed of 5 places in 11 ms of which 0 ms to minimize.
[2022-05-15 10:36:11] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2022-05-15 10:36:11] [INFO ] Deduced a trap composed of 5 places in 12 ms of which 1 ms to minimize.
[2022-05-15 10:36:11] [INFO ] Deduced a trap composed of 4 places in 11 ms of which 0 ms to minimize.
[2022-05-15 10:36:11] [INFO ] Deduced a trap composed of 5 places in 11 ms of which 1 ms to minimize.
[2022-05-15 10:36:11] [INFO ] Deduced a trap composed of 5 places in 11 ms of which 1 ms to minimize.
[2022-05-15 10:36:11] [INFO ] Deduced a trap composed of 6 places in 9 ms of which 0 ms to minimize.
[2022-05-15 10:36:11] [INFO ] Deduced a trap composed of 4 places in 9 ms of which 1 ms to minimize.
[2022-05-15 10:36:11] [INFO ] Deduced a trap composed of 4 places in 11 ms of which 0 ms to minimize.
[2022-05-15 10:36:11] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 339 ms
[2022-05-15 10:36:11] [INFO ] Computed and/alt/rep : 40/60/40 causal constraints (skipped 20 transitions) in 11 ms.
[2022-05-15 10:36:11] [INFO ] Added : 1 causal constraints over 1 iterations in 22 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-15 10:36:11] [INFO ] [Real]Absence check using 40 positive place invariants in 5 ms returned sat
[2022-05-15 10:36:11] [INFO ] [Real]Absence check using 40 positive and 20 generalized place invariants in 2 ms returned sat
[2022-05-15 10:36:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 10:36:11] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-15 10:36:11] [INFO ] [Real]Added 20 Read/Feed constraints in 3 ms returned sat
[2022-05-15 10:36:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 10:36:11] [INFO ] [Nat]Absence check using 40 positive place invariants in 5 ms returned sat
[2022-05-15 10:36:11] [INFO ] [Nat]Absence check using 40 positive and 20 generalized place invariants in 6 ms returned sat
[2022-05-15 10:36:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 10:36:11] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2022-05-15 10:36:11] [INFO ] [Nat]Added 20 Read/Feed constraints in 2 ms returned sat
[2022-05-15 10:36:11] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2022-05-15 10:36:11] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2022-05-15 10:36:11] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2022-05-15 10:36:11] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2022-05-15 10:36:11] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2022-05-15 10:36:12] [INFO ] Deduced a trap composed of 5 places in 10 ms of which 0 ms to minimize.
[2022-05-15 10:36:12] [INFO ] Deduced a trap composed of 6 places in 10 ms of which 0 ms to minimize.
[2022-05-15 10:36:12] [INFO ] Deduced a trap composed of 4 places in 7 ms of which 0 ms to minimize.
[2022-05-15 10:36:12] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2022-05-15 10:36:12] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2022-05-15 10:36:12] [INFO ] Deduced a trap composed of 5 places in 10 ms of which 1 ms to minimize.
[2022-05-15 10:36:12] [INFO ] Deduced a trap composed of 6 places in 10 ms of which 0 ms to minimize.
[2022-05-15 10:36:12] [INFO ] Deduced a trap composed of 4 places in 9 ms of which 1 ms to minimize.
[2022-05-15 10:36:12] [INFO ] Deduced a trap composed of 5 places in 11 ms of which 0 ms to minimize.
[2022-05-15 10:36:12] [INFO ] Deduced a trap composed of 6 places in 10 ms of which 0 ms to minimize.
[2022-05-15 10:36:12] [INFO ] Deduced a trap composed of 4 places in 9 ms of which 1 ms to minimize.
[2022-05-15 10:36:12] [INFO ] Deduced a trap composed of 4 places in 9 ms of which 0 ms to minimize.
[2022-05-15 10:36:12] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 321 ms
[2022-05-15 10:36:12] [INFO ] Computed and/alt/rep : 40/60/40 causal constraints (skipped 20 transitions) in 11 ms.
[2022-05-15 10:36:12] [INFO ] Added : 1 causal constraints over 1 iterations in 26 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 0 ms.
[2022-05-15 10:36:12] [INFO ] [Real]Absence check using 40 positive place invariants in 5 ms returned sat
[2022-05-15 10:36:12] [INFO ] [Real]Absence check using 40 positive and 20 generalized place invariants in 4 ms returned sat
[2022-05-15 10:36:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 10:36:12] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-15 10:36:12] [INFO ] [Real]Added 20 Read/Feed constraints in 3 ms returned sat
[2022-05-15 10:36:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 10:36:12] [INFO ] [Nat]Absence check using 40 positive place invariants in 6 ms returned sat
[2022-05-15 10:36:12] [INFO ] [Nat]Absence check using 40 positive and 20 generalized place invariants in 2 ms returned sat
[2022-05-15 10:36:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 10:36:12] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2022-05-15 10:36:12] [INFO ] [Nat]Added 20 Read/Feed constraints in 2 ms returned sat
[2022-05-15 10:36:12] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2022-05-15 10:36:12] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2022-05-15 10:36:12] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2022-05-15 10:36:12] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2022-05-15 10:36:12] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2022-05-15 10:36:12] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 1 ms to minimize.
[2022-05-15 10:36:12] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2022-05-15 10:36:12] [INFO ] Deduced a trap composed of 5 places in 10 ms of which 0 ms to minimize.
[2022-05-15 10:36:12] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2022-05-15 10:36:12] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2022-05-15 10:36:12] [INFO ] Deduced a trap composed of 5 places in 10 ms of which 0 ms to minimize.
[2022-05-15 10:36:12] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 1 ms to minimize.
[2022-05-15 10:36:12] [INFO ] Deduced a trap composed of 5 places in 11 ms of which 0 ms to minimize.
[2022-05-15 10:36:12] [INFO ] Deduced a trap composed of 4 places in 11 ms of which 0 ms to minimize.
[2022-05-15 10:36:12] [INFO ] Deduced a trap composed of 5 places in 11 ms of which 1 ms to minimize.
[2022-05-15 10:36:12] [INFO ] Deduced a trap composed of 6 places in 10 ms of which 0 ms to minimize.
[2022-05-15 10:36:12] [INFO ] Deduced a trap composed of 4 places in 7 ms of which 0 ms to minimize.
[2022-05-15 10:36:12] [INFO ] Deduced a trap composed of 6 places in 11 ms of which 0 ms to minimize.
[2022-05-15 10:36:12] [INFO ] Deduced a trap composed of 4 places in 9 ms of which 0 ms to minimize.
[2022-05-15 10:36:12] [INFO ] Deduced a trap composed of 4 places in 8 ms of which 1 ms to minimize.
[2022-05-15 10:36:12] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 375 ms
[2022-05-15 10:36:12] [INFO ] Computed and/alt/rep : 40/60/40 causal constraints (skipped 20 transitions) in 11 ms.
[2022-05-15 10:36:12] [INFO ] Added : 1 causal constraints over 1 iterations in 25 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
Incomplete Parikh walk after 580 steps, including 10 resets, run finished after 9 ms. (steps per millisecond=64 ) properties (out of 18) seen :0 could not realise parikh vector
Incomplete Parikh walk after 560 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=80 ) properties (out of 18) seen :0 could not realise parikh vector
Incomplete Parikh walk after 530 steps, including 10 resets, run finished after 6 ms. (steps per millisecond=88 ) properties (out of 18) seen :0 could not realise parikh vector
Incomplete Parikh walk after 510 steps, including 10 resets, run finished after 6 ms. (steps per millisecond=85 ) properties (out of 18) seen :0 could not realise parikh vector
Incomplete Parikh walk after 540 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=90 ) properties (out of 18) seen :0 could not realise parikh vector
Incomplete Parikh walk after 520 steps, including 10 resets, run finished after 6 ms. (steps per millisecond=86 ) properties (out of 18) seen :0 could not realise parikh vector
Incomplete Parikh walk after 530 steps, including 10 resets, run finished after 6 ms. (steps per millisecond=88 ) properties (out of 18) seen :0 could not realise parikh vector
Incomplete Parikh walk after 480 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=96 ) properties (out of 18) seen :1 could not realise parikh vector
Incomplete Parikh walk after 500 steps, including 10 resets, run finished after 5 ms. (steps per millisecond=100 ) properties (out of 17) seen :0 could not realise parikh vector
Incomplete Parikh walk after 500 steps, including 9 resets, run finished after 13 ms. (steps per millisecond=38 ) properties (out of 17) seen :0 could not realise parikh vector
Incomplete Parikh walk after 550 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=78 ) properties (out of 17) seen :0 could not realise parikh vector
Incomplete Parikh walk after 520 steps, including 10 resets, run finished after 5 ms. (steps per millisecond=104 ) properties (out of 17) seen :0 could not realise parikh vector
Incomplete Parikh walk after 540 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=108 ) properties (out of 17) seen :0 could not realise parikh vector
Incomplete Parikh walk after 540 steps, including 10 resets, run finished after 5 ms. (steps per millisecond=108 ) properties (out of 17) seen :0 could not realise parikh vector
Incomplete Parikh walk after 540 steps, including 10 resets, run finished after 5 ms. (steps per millisecond=108 ) properties (out of 17) seen :0 could not realise parikh vector
Incomplete Parikh walk after 560 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=112 ) properties (out of 17) seen :0 could not realise parikh vector
Incomplete Parikh walk after 540 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=108 ) properties (out of 17) seen :0 could not realise parikh vector
Incomplete Parikh walk after 550 steps, including 10 resets, run finished after 5 ms. (steps per millisecond=110 ) properties (out of 17) seen :1 could not realise parikh vector
Support contains 16 out of 100 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 100/100 places, 440/440 transitions.
Applied a total of 0 rules in 40 ms. Remains 100 /100 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 440/440 transitions.
[2022-05-15 10:36:13] [INFO ] Flatten gal took : 80 ms
[2022-05-15 10:36:13] [INFO ] Flatten gal took : 45 ms
[2022-05-15 10:36:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5758484898251692351.gal : 22 ms
[2022-05-15 10:36:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16477916375650784544.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/ReachabilityCardinality5758484898251692351.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality16477916375650784544.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/ReachabilityCardinality5758484898251692351.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality16477916375650784544.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality16477916375650784544.prop.
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :4 after 16
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :16 after 128
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :128 after 8192
Invariant property smplace_93 does not hold.
Invariant property smplace_90 does not hold.
Invariant property smplace_84 does not hold.
Invariant property smplace_78 does not hold.
Invariant property smplace_75 does not hold.
Invariant property smplace_72 does not hold.
Invariant property smplace_69 does not hold.
Invariant property smplace_66 does not hold.
Invariant property smplace_63 does not hold.
Invariant property smplace_60 does not hold.
Invariant property smplace_57 does not hold.
Invariant property smplace_54 does not hold.
Invariant property smplace_51 does not hold.
Invariant property smplace_48 does not hold.
Invariant property smplace_45 does not hold.
Invariant property smplace_42 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,524380,0.109023,9492,2,394,25,6506,6,0,843,1906,0
Total reachable state count : 524380

Verifying 16 reachability properties.
Invariant property smplace_42 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_42,1,0.109861,9492,2,101,25,6506,7,0,846,1906,0
Invariant property smplace_45 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_45,2,0.110106,9492,2,104,25,6506,8,0,848,1906,0
Invariant property smplace_48 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_48,4,0.110293,9492,2,107,25,6506,9,0,850,1906,0
Invariant property smplace_51 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_51,8,0.110479,9492,2,110,25,6506,10,0,852,1906,0
Invariant property smplace_54 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_54,4,0.110752,9492,2,107,25,6506,11,0,854,1906,0
Invariant property smplace_57 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_57,4,0.110928,9492,2,107,25,6506,12,0,856,1906,0
Invariant property smplace_60 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_60,4,0.111095,9492,2,107,25,6506,13,0,858,1906,0
Invariant property smplace_63 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_63,4,0.111256,9492,2,107,25,6506,14,0,860,1906,0
Invariant property smplace_66 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_66,4,0.111418,9492,2,107,25,6506,15,0,862,1906,0
Invariant property smplace_69 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_69,4,0.111573,9492,2,107,25,6506,16,0,864,1906,0
Invariant property smplace_72 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_72,4,0.111729,9492,2,107,25,6506,17,0,866,1906,0
Invariant property smplace_75 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_75,4,0.11188,9492,2,107,25,6506,18,0,868,1906,0
Invariant property smplace_78 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_78,4,0.112028,9492,2,107,25,6506,19,0,870,1906,0
Invariant property smplace_84 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_84,4,0.112164,9492,2,107,25,6506,20,0,872,1906,0
Invariant property smplace_90 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_90,4,0.112294,9492,2,107,25,6506,21,0,874,1906,0
Invariant property smplace_93 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_93,4,0.112417,9492,2,107,25,6506,22,0,876,1906,0
Able to resolve query StableMarking after proving 100 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK DECISION_DIAGRAMS COLLATERAL_PROCESSING BESTFIRST_WALK TOPOLOGICAL

BK_STOP 1652610974391

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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 StableMarking -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 1800 -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="Dekker-PT-020"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="gold2021"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 Dekker-PT-020, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r072-tall-165254781200383"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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