Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r268-smll-171654407300270.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is Peterson-PT-4, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r268-smll-171654407300270
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.8M
-rw-r--r-- 1 mcc users 48K Apr 12 02:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 222K Apr 12 02:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 57K Apr 12 02:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 270K Apr 12 02:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 29K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 23K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 75K Apr 12 03:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 304K Apr 12 03:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 212K Apr 12 03:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 982K Apr 12 03:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 8.6K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 298K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-2024-00
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-2024-01
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-2024-02
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-2024-03
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-2024-04
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-2024-05
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-2024-06
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-2024-07
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-2024-08
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-2024-09
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-2024-10
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-2024-11
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-2024-12
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-2024-13
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-2024-14
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716768996365

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-4
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-27 00:16:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-27 00:16:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 00:16:38] [INFO ] Load time of PNML (sax parser for PT used): 167 ms
[2024-05-27 00:16:38] [INFO ] Transformed 480 places.
[2024-05-27 00:16:38] [INFO ] Transformed 690 transitions.
[2024-05-27 00:16:38] [INFO ] Found NUPN structural information;
[2024-05-27 00:16:38] [INFO ] Parsed PT model containing 480 places and 690 transitions and 2120 arcs in 343 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 192 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-PT-4-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-4-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 00:16:39] [INFO ] Flatten gal took : 292 ms
RANDOM walk for 40000 steps (8 resets) in 2955 ms. (13 steps per ms) remains 10/14 properties
FORMULA Peterson-PT-4-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-27 00:16:39] [INFO ] Flatten gal took : 126 ms
BEST_FIRST walk for 40004 steps (8 resets) in 425 ms. (93 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 272 ms. (146 steps per ms) remains 10/10 properties
[2024-05-27 00:16:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16571075840523347035.gal : 103 ms
[2024-05-27 00:16:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18252344061720510642.prop : 18 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16571075840523347035.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18252344061720510642.prop' '--nowitness' '--gen-order' 'FOLLOW'

BEST_FIRST walk for 40004 steps (8 resets) in 684 ms. (58 steps per ms) remains 10/10 properties
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
BEST_FIRST walk for 40004 steps (8 resets) in 270 ms. (147 steps per ms) remains 10/10 properties
Loading property file /tmp/ReachabilityCardinality18252344061720510642.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 234 ms. (170 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 9/10 properties
FORMULA Peterson-PT-4-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 306 ms. (130 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 203 ms. (196 steps per ms) remains 9/9 properties
[2024-05-27 00:16:40] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 5
[2024-05-27 00:16:40] [INFO ] Computed 19 invariants in 25 ms
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :7 after 8
[2024-05-27 00:16:40] [INFO ] State equation strengthened by 116 read => feed constraints.
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :8 after 9
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :9 after 11
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :11 after 33
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :33 after 51
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :51 after 156
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :156 after 247
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :247 after 1253
Problem Peterson-PT-4-ReachabilityCardinality-2024-04 is UNSAT
FORMULA Peterson-PT-4-ReachabilityCardinality-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
SDD proceeding with computation,10 properties remain. new max is 4096
SDD size :1253 after 4497
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/431 variables, 431/431 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/431 variables, 1/432 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/431 variables, 0/432 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Problem Peterson-PT-4-ReachabilityCardinality-2024-00 is UNSAT
FORMULA Peterson-PT-4-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem Peterson-PT-4-ReachabilityCardinality-2024-03 is UNSAT
FORMULA Peterson-PT-4-ReachabilityCardinality-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem Peterson-PT-4-ReachabilityCardinality-2024-05 is UNSAT
FORMULA Peterson-PT-4-ReachabilityCardinality-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem Peterson-PT-4-ReachabilityCardinality-2024-06 is UNSAT
FORMULA Peterson-PT-4-ReachabilityCardinality-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 24/455 variables, 9/441 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/455 variables, 24/465 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/455 variables, 0/465 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 5/460 variables, 5/470 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/460 variables, 5/475 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/460 variables, 0/475 constraints. Problems are: Problem set: 5 solved, 4 unsolved
Invariant property Peterson-PT-4-ReachabilityCardinality-2024-15 does not hold.
At refinement iteration 9 (OVERLAPS) 630/1090 variables, 460/935 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1090 variables, 116/1051 constraints. Problems are: Problem set: 5 solved, 4 unsolved
SDD proceeding with computation,9 properties remain. new max is 4096
SDD size :4497 after 8990
At refinement iteration 11 (INCLUDED_ONLY) 0/1090 variables, 0/1051 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 20/1110 variables, 20/1071 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1110 variables, 20/1091 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1110 variables, 4/1095 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1110 variables, 0/1095 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/1110 variables, 0/1095 constraints. Problems are: Problem set: 5 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1110/1110 variables, and 1095 constraints, problems are : Problem set: 5 solved, 4 unsolved in 1661 ms.
Refiners :[Domain max(s): 480/480 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 480/480 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 263/271 variables, 4/12 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 263/275 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 0/275 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2/273 variables, 2/277 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 2/279 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 0/279 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 3/276 variables, 3/282 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/276 variables, 3/285 constraints. Problems are: Problem set: 5 solved, 4 unsolved
SDD proceeding with computation,9 properties remain. new max is 8192
SDD size :8990 after 27232
[2024-05-27 00:16:43] [INFO ] Deduced a trap composed of 96 places in 225 ms of which 36 ms to minimize.
[2024-05-27 00:16:43] [INFO ] Deduced a trap composed of 64 places in 134 ms of which 3 ms to minimize.
[2024-05-27 00:16:43] [INFO ] Deduced a trap composed of 80 places in 135 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/276 variables, 3/288 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/276 variables, 0/288 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 378/654 variables, 276/564 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/654 variables, 40/604 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/654 variables, 0/604 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 52/706 variables, 20/624 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/706 variables, 20/644 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/706 variables, 4/648 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/706 variables, 4/652 constraints. Problems are: Problem set: 5 solved, 4 unsolved
[2024-05-27 00:16:44] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 3 ms to minimize.
[2024-05-27 00:16:44] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 3 ms to minimize.
SDD proceeding with computation,9 properties remain. new max is 16384
SDD size :27232 after 86195
[2024-05-27 00:16:45] [INFO ] Deduced a trap composed of 13 places in 942 ms of which 4 ms to minimize.
[2024-05-27 00:16:45] [INFO ] Deduced a trap composed of 39 places in 272 ms of which 32 ms to minimize.
[2024-05-27 00:16:46] [INFO ] Deduced a trap composed of 14 places in 672 ms of which 4 ms to minimize.
[2024-05-27 00:16:46] [INFO ] Deduced a trap composed of 17 places in 587 ms of which 3 ms to minimize.
[2024-05-27 00:16:46] [INFO ] Deduced a trap composed of 39 places in 115 ms of which 2 ms to minimize.
[2024-05-27 00:16:47] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 2 ms to minimize.
SDD proceeding with computation,9 properties remain. new max is 32768
SDD size :86195 after 205659
[2024-05-27 00:16:47] [INFO ] Deduced a trap composed of 17 places in 146 ms of which 2 ms to minimize.
[2024-05-27 00:16:47] [INFO ] Deduced a trap composed of 32 places in 128 ms of which 2 ms to minimize.
[2024-05-27 00:16:47] [INFO ] Deduced a trap composed of 76 places in 83 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 706/1110 variables, and 663 constraints, problems are : Problem set: 5 solved, 4 unsolved in 5024 ms.
Refiners :[Domain max(s): 296/480 constraints, Positive P Invariants (semi-flows): 10/14 constraints, Generalized P Invariants (flows): 3/5 constraints, State Equation: 296/480 constraints, ReadFeed: 44/116 constraints, PredecessorRefiner: 0/9 constraints, Known Traps: 14/14 constraints]
After SMT, in 7022ms problems are : Problem set: 5 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 193 transitions
Trivial Post-agglo rules discarded 193 transitions
Performed 193 trivial Post agglomeration. Transition count delta: 193
Iterating post reduction 0 with 193 rules applied. Total rules applied 193 place count 480 transition count 497
Reduce places removed 193 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 196 rules applied. Total rules applied 389 place count 287 transition count 494
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 392 place count 284 transition count 494
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 97 Pre rules applied. Total rules applied 392 place count 284 transition count 397
Deduced a syphon composed of 97 places in 1 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 586 place count 187 transition count 397
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 626 place count 167 transition count 377
Applied a total of 626 rules in 133 ms. Remains 167 /480 variables (removed 313) and now considering 377/690 (removed 313) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 167/480 places, 377/690 transitions.
RANDOM walk for 40000 steps (8 resets) in 474 ms. (84 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 593700 steps, run timeout after 3001 ms. (steps per millisecond=197 ) properties seen :0 out of 4
Probabilistic random walk after 593700 steps, saw 99320 distinct states, run finished after 3020 ms. (steps per millisecond=196 ) properties seen :0
[2024-05-27 00:16:51] [INFO ] Flow matrix only has 317 transitions (discarded 60 similar events)
// Phase 1: matrix 317 rows 167 cols
[2024-05-27 00:16:51] [INFO ] Computed 19 invariants in 3 ms
[2024-05-27 00:16:51] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 78/86 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 78/90 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2/88 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 3/91 variables, 3/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/91 variables, 3/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/91 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 193/284 variables, 91/191 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/284 variables, 40/231 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/284 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 52/336 variables, 20/251 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/336 variables, 20/271 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/336 variables, 4/275 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/336 variables, 4/279 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/336 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 80/416 variables, 16/295 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/416 variables, 16/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/416 variables, 72/383 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/416 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 36/452 variables, 2/385 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/452 variables, 36/421 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/452 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 2/454 variables, 2/423 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/454 variables, 2/425 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/454 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 2/456 variables, 2/427 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/456 variables, 2/429 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/456 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (OVERLAPS) 28/484 variables, 40/469 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/484 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (OVERLAPS) 0/484 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 484/484 variables, and 469 constraints, problems are : Problem set: 0 solved, 4 unsolved in 590 ms.
Refiners :[Domain max(s): 167/167 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 167/167 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 78/86 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 78/90 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2/88 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 3/91 variables, 3/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/91 variables, 3/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-27 00:16:51] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 2 ms to minimize.
[2024-05-27 00:16:51] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 2 ms to minimize.
[2024-05-27 00:16:52] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/91 variables, 3/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/91 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 193/284 variables, 91/194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/284 variables, 40/234 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/284 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 52/336 variables, 20/254 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/336 variables, 20/274 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/336 variables, 4/278 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/336 variables, 4/282 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-27 00:16:52] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-27 00:16:52] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 2 ms to minimize.
[2024-05-27 00:16:52] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 2 ms to minimize.
[2024-05-27 00:16:52] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2024-05-27 00:16:52] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/336 variables, 5/287 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/336 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 80/416 variables, 16/303 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/416 variables, 16/319 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/416 variables, 72/391 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/416 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 36/452 variables, 2/393 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/452 variables, 36/429 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/452 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (OVERLAPS) 2/454 variables, 2/431 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/454 variables, 2/433 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/454 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (OVERLAPS) 2/456 variables, 2/435 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/456 variables, 2/437 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/456 variables, 4/441 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-27 00:16:52] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 2 ms to minimize.
[2024-05-27 00:16:52] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 1 ms to minimize.
[2024-05-27 00:16:53] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 2 ms to minimize.
[2024-05-27 00:16:53] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2024-05-27 00:16:53] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2024-05-27 00:16:53] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 2 ms to minimize.
[2024-05-27 00:16:53] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-05-27 00:16:53] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 2 ms to minimize.
[2024-05-27 00:16:53] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 1 ms to minimize.
[2024-05-27 00:16:53] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 2 ms to minimize.
[2024-05-27 00:16:53] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 2 ms to minimize.
[2024-05-27 00:16:53] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 8 ms to minimize.
[2024-05-27 00:16:54] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 2 ms to minimize.
[2024-05-27 00:16:54] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 2 ms to minimize.
[2024-05-27 00:16:54] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2024-05-27 00:16:54] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 2 ms to minimize.
[2024-05-27 00:16:54] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 3 ms to minimize.
[2024-05-27 00:16:54] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 4 ms to minimize.
[2024-05-27 00:16:54] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 2 ms to minimize.
[2024-05-27 00:16:54] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 1 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/456 variables, 20/461 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,9 properties remain. new max is 65536
SDD size :205659 after 486499
[2024-05-27 00:16:54] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 3 ms to minimize.
[2024-05-27 00:16:54] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 2 ms to minimize.
[2024-05-27 00:16:55] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-05-27 00:16:55] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-05-27 00:16:55] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2024-05-27 00:16:55] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
At refinement iteration 35 (INCLUDED_ONLY) 0/456 variables, 6/467 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-27 00:16:55] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 2 ms to minimize.
At refinement iteration 36 (INCLUDED_ONLY) 0/456 variables, 1/468 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-27 00:16:55] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
[2024-05-27 00:16:55] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 3 ms to minimize.
At refinement iteration 37 (INCLUDED_ONLY) 0/456 variables, 2/470 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/456 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (OVERLAPS) 28/484 variables, 40/510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/484 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (OVERLAPS) 0/484 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 484/484 variables, and 510 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4296 ms.
Refiners :[Domain max(s): 167/167 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 167/167 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 37/37 constraints]
After SMT, in 4904ms problems are : Problem set: 0 solved, 4 unsolved
FORMULA Peterson-PT-4-ReachabilityCardinality-2024-09 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 636 ms.
Support contains 6 out of 167 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 167/167 places, 377/377 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 167 transition count 375
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 165 transition count 375
Applied a total of 4 rules in 29 ms. Remains 165 /167 variables (removed 2) and now considering 375/377 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 165/167 places, 375/377 transitions.
RANDOM walk for 40000 steps (8 resets) in 153 ms. (259 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 792198 steps, run timeout after 3001 ms. (steps per millisecond=263 ) properties seen :0 out of 3
Probabilistic random walk after 792198 steps, saw 132241 distinct states, run finished after 3001 ms. (steps per millisecond=263 ) properties seen :0
[2024-05-27 00:16:59] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 165 cols
[2024-05-27 00:16:59] [INFO ] Computed 19 invariants in 3 ms
[2024-05-27 00:16:59] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 78/84 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 78/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2/86 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 3/89 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/89 variables, 3/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/89 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 191/280 variables, 89/187 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/280 variables, 40/227 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/280 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 52/332 variables, 20/247 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/332 variables, 20/267 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/332 variables, 4/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/332 variables, 4/275 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/332 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 80/412 variables, 16/291 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/412 variables, 16/307 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/412 variables, 72/379 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/412 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 36/448 variables, 2/381 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/448 variables, 36/417 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/448 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 2/450 variables, 2/419 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/450 variables, 2/421 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/450 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 2/452 variables, 2/423 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/452 variables, 2/425 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/452 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (OVERLAPS) 28/480 variables, 40/465 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/480 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (OVERLAPS) 0/480 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 480/480 variables, and 465 constraints, problems are : Problem set: 0 solved, 3 unsolved in 451 ms.
Refiners :[Domain max(s): 165/165 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 165/165 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 78/84 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 78/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2/86 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 3/89 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/89 variables, 3/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-27 00:17:00] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/89 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/89 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 191/280 variables, 89/188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/280 variables, 40/228 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/280 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 52/332 variables, 20/248 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/332 variables, 20/268 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/332 variables, 4/272 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/332 variables, 4/276 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-27 00:17:00] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-27 00:17:00] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2024-05-27 00:17:00] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-27 00:17:00] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 2 ms to minimize.
[2024-05-27 00:17:00] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 2 ms to minimize.
[2024-05-27 00:17:00] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/332 variables, 6/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/332 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 80/412 variables, 16/298 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/412 variables, 16/314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/412 variables, 72/386 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/412 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 36/448 variables, 2/388 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/448 variables, 36/424 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/448 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 2/450 variables, 2/426 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/450 variables, 2/428 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/450 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 2/452 variables, 2/430 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/452 variables, 2/432 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/452 variables, 3/435 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-27 00:17:01] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 2 ms to minimize.
[2024-05-27 00:17:01] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 2 ms to minimize.
[2024-05-27 00:17:01] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 2 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/452 variables, 3/438 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/452 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (OVERLAPS) 28/480 variables, 40/478 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/480 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (OVERLAPS) 0/480 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 480/480 variables, and 478 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1422 ms.
Refiners :[Domain max(s): 165/165 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 165/165 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 10/10 constraints]
After SMT, in 1891ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 114 ms.
Support contains 6 out of 165 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 165/165 places, 375/375 transitions.
Applied a total of 0 rules in 15 ms. Remains 165 /165 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 165/165 places, 375/375 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 165/165 places, 375/375 transitions.
Applied a total of 0 rules in 14 ms. Remains 165 /165 variables (removed 0) and now considering 375/375 (removed 0) transitions.
[2024-05-27 00:17:01] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
[2024-05-27 00:17:01] [INFO ] Invariant cache hit.
[2024-05-27 00:17:02] [INFO ] Implicit Places using invariants in 224 ms returned [155, 156, 157, 158, 159]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 236 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 160/165 places, 375/375 transitions.
Applied a total of 0 rules in 13 ms. Remains 160 /160 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 264 ms. Remains : 160/165 places, 375/375 transitions.
RANDOM walk for 40000 steps (8 resets) in 150 ms. (264 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 3/3 properties
Invariant property Peterson-PT-4-ReachabilityCardinality-2024-08 does not hold.
FORMULA Peterson-PT-4-ReachabilityCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Interrupted probabilistic random walk after 724800 steps, run timeout after 3001 ms. (steps per millisecond=241 ) properties seen :0 out of 3
Probabilistic random walk after 724800 steps, saw 120987 distinct states, run finished after 3001 ms. (steps per millisecond=241 ) properties seen :0
[2024-05-27 00:17:05] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 160 cols
[2024-05-27 00:17:05] [INFO ] Computed 14 invariants in 2 ms
[2024-05-27 00:17:05] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 54/58 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 54/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 28/86 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 28/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 191/277 variables, 86/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/277 variables, 40/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/277 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 52/329 variables, 20/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/329 variables, 20/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/329 variables, 4/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/329 variables, 4/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/329 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 80/409 variables, 16/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/409 variables, 16/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/409 variables, 72/370 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/409 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 36/445 variables, 2/372 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/445 variables, 36/408 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/445 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 2/447 variables, 2/410 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/447 variables, 2/412 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/447 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 28/475 variables, 38/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/475 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 0/475 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 475/475 variables, and 450 constraints, problems are : Problem set: 0 solved, 2 unsolved in 345 ms.
Refiners :[Domain max(s): 160/160 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 160/160 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 54/58 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 54/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 28/86 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 28/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 191/277 variables, 86/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/277 variables, 40/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-27 00:17:05] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/277 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/277 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 52/329 variables, 20/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/329 variables, 20/259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/329 variables, 4/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/329 variables, 4/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/329 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 80/409 variables, 16/283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/409 variables, 16/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/409 variables, 72/371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/409 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 36/445 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/445 variables, 36/409 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/445 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-27 00:17:06] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 2 ms to minimize.
[2024-05-27 00:17:06] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/445 variables, 2/412 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/445 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 2/447 variables, 2/414 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/447 variables, 2/416 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/447 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-27 00:17:06] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 2 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/447 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/447 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 28/475 variables, 38/456 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/475 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 0/475 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 475/475 variables, and 456 constraints, problems are : Problem set: 0 solved, 2 unsolved in 791 ms.
Refiners :[Domain max(s): 160/160 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 160/160 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 1156ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 85 ms.
Support contains 4 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 375/375 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 160 transition count 373
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 158 transition count 373
Applied a total of 4 rules in 18 ms. Remains 158 /160 variables (removed 2) and now considering 373/375 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 158/160 places, 373/375 transitions.
RANDOM walk for 40000 steps (8 resets) in 114 ms. (347 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 725796 steps, run timeout after 3001 ms. (steps per millisecond=241 ) properties seen :0 out of 2
Probabilistic random walk after 725796 steps, saw 121415 distinct states, run finished after 3005 ms. (steps per millisecond=241 ) properties seen :0
[2024-05-27 00:17:09] [INFO ] Flow matrix only has 313 transitions (discarded 60 similar events)
// Phase 1: matrix 313 rows 158 cols
[2024-05-27 00:17:09] [INFO ] Computed 14 invariants in 2 ms
[2024-05-27 00:17:09] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 53/57 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 53/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 27/84 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 27/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 189/273 variables, 84/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 40/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/273 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 52/325 variables, 20/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/325 variables, 20/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/325 variables, 4/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/325 variables, 4/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/325 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 80/405 variables, 16/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/405 variables, 16/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/405 variables, 72/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/405 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 36/441 variables, 2/368 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/441 variables, 36/404 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/441 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 2/443 variables, 2/406 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/443 variables, 2/408 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/443 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 28/471 variables, 38/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/471 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 0/471 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 471/471 variables, and 446 constraints, problems are : Problem set: 0 solved, 2 unsolved in 372 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 158/158 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 53/57 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 53/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 27/84 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 27/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 189/273 variables, 84/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 40/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/273 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 52/325 variables, 20/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/325 variables, 20/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/325 variables, 4/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/325 variables, 4/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/325 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 80/405 variables, 16/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/405 variables, 16/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/405 variables, 72/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/405 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 36/441 variables, 2/368 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/441 variables, 36/404 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/441 variables, 1/405 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-27 00:17:10] [INFO ] Deduced a trap composed of 30 places in 180 ms of which 2 ms to minimize.
[2024-05-27 00:17:10] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/441 variables, 2/407 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/441 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 2/443 variables, 2/409 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/443 variables, 2/411 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/443 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/443 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 28/471 variables, 38/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/471 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 0/471 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 471/471 variables, and 450 constraints, problems are : Problem set: 0 solved, 2 unsolved in 780 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 158/158 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 1171ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 105 ms.
Support contains 4 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 373/373 transitions.
Applied a total of 0 rules in 10 ms. Remains 158 /158 variables (removed 0) and now considering 373/373 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 158/158 places, 373/373 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 373/373 transitions.
Applied a total of 0 rules in 9 ms. Remains 158 /158 variables (removed 0) and now considering 373/373 (removed 0) transitions.
[2024-05-27 00:17:10] [INFO ] Flow matrix only has 313 transitions (discarded 60 similar events)
[2024-05-27 00:17:10] [INFO ] Invariant cache hit.
[2024-05-27 00:17:11] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-27 00:17:11] [INFO ] Flow matrix only has 313 transitions (discarded 60 similar events)
[2024-05-27 00:17:11] [INFO ] Invariant cache hit.
[2024-05-27 00:17:11] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-27 00:17:11] [INFO ] Implicit Places using invariants and state equation in 497 ms returned []
Implicit Place search using SMT with State Equation took 677 ms to find 0 implicit places.
[2024-05-27 00:17:11] [INFO ] Redundant transitions in 25 ms returned []
Running 368 sub problems to find dead transitions.
[2024-05-27 00:17:11] [INFO ] Flow matrix only has 313 transitions (discarded 60 similar events)
[2024-05-27 00:17:11] [INFO ] Invariant cache hit.
[2024-05-27 00:17:11] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 158/158 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 14/172 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-27 00:17:13] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 2 ms to minimize.
[2024-05-27 00:17:13] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 2 ms to minimize.
[2024-05-27 00:17:13] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 2 ms to minimize.
[2024-05-27 00:17:13] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 1 ms to minimize.
[2024-05-27 00:17:14] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2024-05-27 00:17:14] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 2 ms to minimize.
[2024-05-27 00:17:14] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 2 ms to minimize.
[2024-05-27 00:17:14] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 2 ms to minimize.
[2024-05-27 00:17:14] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 1 ms to minimize.
[2024-05-27 00:17:14] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 2 ms to minimize.
[2024-05-27 00:17:14] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 2 ms to minimize.
[2024-05-27 00:17:14] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 2 ms to minimize.
[2024-05-27 00:17:14] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 2 ms to minimize.
SDD proceeding with computation,8 properties remain. new max is 65536
SDD size :486499 after 2.4922e+06
[2024-05-27 00:17:14] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 2 ms to minimize.
[2024-05-27 00:17:14] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
[2024-05-27 00:17:15] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 1 ms to minimize.
[2024-05-27 00:17:15] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 2 ms to minimize.
[2024-05-27 00:17:15] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 5 ms to minimize.
[2024-05-27 00:17:15] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 2 ms to minimize.
[2024-05-27 00:17:15] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-27 00:17:15] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
[2024-05-27 00:17:15] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 2 ms to minimize.
[2024-05-27 00:17:15] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-05-27 00:17:15] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 2 ms to minimize.
[2024-05-27 00:17:16] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-05-27 00:17:16] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 2 ms to minimize.
[2024-05-27 00:17:16] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 2 ms to minimize.
[2024-05-27 00:17:16] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 2 ms to minimize.
[2024-05-27 00:17:16] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 2 ms to minimize.
[2024-05-27 00:17:16] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-05-27 00:17:16] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-05-27 00:17:16] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-27 00:17:16] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 2 ms to minimize.
[2024-05-27 00:17:16] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-05-27 00:17:16] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 2 ms to minimize.
[2024-05-27 00:17:16] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-05-27 00:17:17] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 2 ms to minimize.
[2024-05-27 00:17:17] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 2 ms to minimize.
[2024-05-27 00:17:17] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 2 ms to minimize.
[2024-05-27 00:17:17] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-27 00:17:19] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 2 ms to minimize.
[2024-05-27 00:17:19] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-05-27 00:17:19] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 1 ms to minimize.
[2024-05-27 00:17:19] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 2 ms to minimize.
[2024-05-27 00:17:19] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-27 00:17:19] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-05-27 00:17:19] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2024-05-27 00:17:19] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 2 ms to minimize.
[2024-05-27 00:17:19] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 2 ms to minimize.
[2024-05-27 00:17:19] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-27 00:17:20] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 2 ms to minimize.
[2024-05-27 00:17:20] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 2 ms to minimize.
[2024-05-27 00:17:20] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 2 ms to minimize.
[2024-05-27 00:17:20] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 2 ms to minimize.
[2024-05-27 00:17:20] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-27 00:17:20] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-27 00:17:20] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-27 00:17:20] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 2 ms to minimize.
[2024-05-27 00:17:20] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 2 ms to minimize.
[2024-05-27 00:17:20] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 20/232 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-27 00:17:21] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2024-05-27 00:17:21] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 1 ms to minimize.
[2024-05-27 00:17:22] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 2 ms to minimize.
[2024-05-27 00:17:22] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-27 00:17:22] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-27 00:17:22] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 2 ms to minimize.
[2024-05-27 00:17:22] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 1 ms to minimize.
[2024-05-27 00:17:22] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 4 ms to minimize.
[2024-05-27 00:17:22] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 2 ms to minimize.
[2024-05-27 00:17:22] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 2 ms to minimize.
[2024-05-27 00:17:22] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-05-27 00:17:22] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-05-27 00:17:22] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2024-05-27 00:17:23] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-05-27 00:17:23] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 3 ms to minimize.
[2024-05-27 00:17:23] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 2 ms to minimize.
[2024-05-27 00:17:23] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 2 ms to minimize.
[2024-05-27 00:17:23] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 1 ms to minimize.
[2024-05-27 00:17:23] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
[2024-05-27 00:17:23] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 20/252 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-27 00:17:24] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-27 00:17:24] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 2 ms to minimize.
[2024-05-27 00:17:25] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-27 00:17:25] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-27 00:17:25] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 2 ms to minimize.
[2024-05-27 00:17:25] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 2 ms to minimize.
[2024-05-27 00:17:25] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 2 ms to minimize.
[2024-05-27 00:17:25] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 2 ms to minimize.
[2024-05-27 00:17:25] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 2 ms to minimize.
[2024-05-27 00:17:26] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-05-27 00:17:26] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 2 ms to minimize.
[2024-05-27 00:17:26] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 2 ms to minimize.
[2024-05-27 00:17:26] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-05-27 00:17:26] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-27 00:17:26] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 2 ms to minimize.
[2024-05-27 00:17:26] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 2 ms to minimize.
[2024-05-27 00:17:26] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 1 ms to minimize.
[2024-05-27 00:17:27] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-27 00:17:27] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 2 ms to minimize.
[2024-05-27 00:17:27] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 20/272 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-27 00:17:31] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 2 ms to minimize.
[2024-05-27 00:17:31] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-05-27 00:17:32] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-27 00:17:32] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 2 ms to minimize.
[2024-05-27 00:17:32] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 2 ms to minimize.
[2024-05-27 00:17:32] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 2 ms to minimize.
[2024-05-27 00:17:32] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2024-05-27 00:17:33] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 2 ms to minimize.
[2024-05-27 00:17:33] [INFO ] Deduced a trap composed of 45 places in 73 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 9/281 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-27 00:17:35] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 2 ms to minimize.
[2024-05-27 00:17:35] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2024-05-27 00:17:35] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 2 ms to minimize.
[2024-05-27 00:17:35] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 2 ms to minimize.
[2024-05-27 00:17:36] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
SDD proceeding with computation,8 properties remain. new max is 131072
[2024-05-27 00:17:36] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
SDD size :2.4922e+06 after 3.97084e+06
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 6/287 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-27 00:17:40] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 1 ms to minimize.
[2024-05-27 00:17:40] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 2/289 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 158/471 variables, and 289 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30043 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 0/158 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 117/117 constraints]
Escalating to Integer solving :Problem set: 0 solved, 368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 158/158 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 14/172 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 117/289 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-27 00:17:46] [INFO ] Deduced a trap composed of 19 places in 3402 ms of which 24 ms to minimize.
[2024-05-27 00:17:49] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 2 ms to minimize.
[2024-05-27 00:17:49] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 2 ms to minimize.
[2024-05-27 00:17:50] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 2 ms to minimize.
[2024-05-27 00:17:50] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 2 ms to minimize.
[2024-05-27 00:17:51] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 1 ms to minimize.
[2024-05-27 00:17:51] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 2 ms to minimize.
[2024-05-27 00:17:51] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 2 ms to minimize.
[2024-05-27 00:17:51] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 1 ms to minimize.
[2024-05-27 00:17:51] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 10/299 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-27 00:17:54] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 2 ms to minimize.
[2024-05-27 00:17:55] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 2/301 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (OVERLAPS) 313/471 variables, 158/459 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/471 variables, 116/575 constraints. Problems are: Problem set: 0 solved, 368 unsolved
SDD proceeding with computation,8 properties remain. new max is 262144
SDD size :3.97084e+06 after 9.08895e+06
At refinement iteration 8 (INCLUDED_ONLY) 0/471 variables, 368/943 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 471/471 variables, and 943 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30017 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 158/158 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 129/129 constraints]
After SMT, in 60232ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 60240ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60965 ms. Remains : 158/158 places, 373/373 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 276 edges and 158 vertex of which 97 / 158 are part of one of the 20 SCC in 4 ms
Free SCC test removed 77 places
Drop transitions (Empty/Sink Transition effects.) removed 154 transitions
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 232 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 1 place count 81 transition count 123
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 37 place count 63 transition count 123
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 39 place count 62 transition count 122
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 53 place count 53 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 27 edges and 53 vertex of which 21 / 53 are part of one of the 4 SCC in 0 ms
Free SCC test removed 17 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 55 place count 36 transition count 121
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 22 transitions.
Graph (trivial) has 38 edges and 34 vertex of which 8 / 34 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 1 with 25 rules applied. Total rules applied 80 place count 30 transition count 99
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 113 place count 30 transition count 66
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 118 place count 30 transition count 61
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 119 place count 30 transition count 60
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 120 place count 29 transition count 60
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 124 place count 29 transition count 72
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 4 with 36 rules applied. Total rules applied 160 place count 25 transition count 40
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 164 place count 25 transition count 36
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 165 place count 25 transition count 36
Applied a total of 165 rules in 51 ms. Remains 25 /158 variables (removed 133) and now considering 36/373 (removed 337) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 36 rows 25 cols
[2024-05-27 00:18:11] [INFO ] Computed 8 invariants in 0 ms
[2024-05-27 00:18:12] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-27 00:18:12] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-27 00:18:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-27 00:18:12] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-27 00:18:12] [INFO ] After 63ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-27 00:18:12] [INFO ] After 144ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2024-05-27 00:18:12] [INFO ] Flatten gal took : 14 ms
[2024-05-27 00:18:12] [INFO ] Flatten gal took : 4 ms
[2024-05-27 00:18:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7306344417762918410.gal : 2 ms
[2024-05-27 00:18:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2176562614754850799.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7306344417762918410.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2176562614754850799.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality2176562614754850799.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 32
Reachability property Peterson-PT-4-ReachabilityCardinality-2024-11 is true.
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :32 after 368
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :368 after 1008
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1008 after 1269
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1269 after 1890
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,3888,0.012164,4192,2,95,12,1027,7,0,140,751,0
Total reachable state count : 3888

Verifying 2 reachability properties.
Reachability property Peterson-PT-4-ReachabilityCardinality-2024-11 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Peterson-PT-4-ReachabilityCardinality-2024-11,9,0.012581,4192,2,30,12,1027,8,0,148,751,0
Reachability property Peterson-PT-4-ReachabilityCardinality-2024-13 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Peterson-PT-4-ReachabilityCardinality-2024-13,972,0.01277,4192,2,62,12,1027,8,0,149,751,0
Over-approximation ignoring read arcs solved 0 properties in 427 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-27 00:18:12] [INFO ] Flatten gal took : 86 ms
[2024-05-27 00:18:12] [INFO ] Applying decomposition
[2024-05-27 00:18:12] [INFO ] Flatten gal took : 46 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12090343696048868063.txt' '-o' '/tmp/graph12090343696048868063.bin' '-w' '/tmp/graph12090343696048868063.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12090343696048868063.bin' '-l' '-1' '-v' '-w' '/tmp/graph12090343696048868063.weights' '-q' '0' '-e' '0.001'
[2024-05-27 00:18:12] [INFO ] Decomposing Gal with order
[2024-05-27 00:18:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 00:18:13] [INFO ] Removed a total of 487 redundant transitions.
[2024-05-27 00:18:13] [INFO ] Flatten gal took : 144 ms
[2024-05-27 00:18:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 18 ms.
[2024-05-27 00:18:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5547496064594516566.gal : 20 ms
[2024-05-27 00:18:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5465822495746896594.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5547496064594516566.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5465822495746896594.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality5465822495746896594.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 280
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :280 after 899
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :899 after 1819
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1819 after 123233
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :123233 after 456472
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :456472 after 1.34468e+06
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1.34468e+06 after 1.15784e+07
Reachability property Peterson-PT-4-ReachabilityCardinality-2024-11 is true.
FORMULA Peterson-PT-4-ReachabilityCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.15784e+07 after 5.47305e+07
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :5.47305e+07 after 5.47305e+07
Reachability property Peterson-PT-4-ReachabilityCardinality-2024-13 is true.
FORMULA Peterson-PT-4-ReachabilityCardinality-2024-13 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 2049 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\_mod\_flat,4.79256e+08,1410.41,11454760,37356,448,6.45976e+06,37619,1174,1.15753e+08,157,329311,0
Total reachable state count : 479255982

Verifying 2 reachability properties.
Reachability property Peterson-PT-4-ReachabilityCardinality-2024-11 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Peterson-PT-4-ReachabilityCardinality-2024-11,512,1411.35,11454760,123,42,6.45976e+06,37619,1187,1.15753e+08,164,329311,0
Reachability property Peterson-PT-4-ReachabilityCardinality-2024-13 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Peterson-PT-4-ReachabilityCardinality-2024-13,512,1411.37,11454760,123,42,6.45976e+06,37619,1189,1.15753e+08,164,329311,0
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 1508179 ms.

BK_STOP 1716770506270

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Peterson-PT-4"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is Peterson-PT-4, 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 r268-smll-171654407300270"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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