MCC'2025- Execution of r041-smll-174853822500034

About the Execution of 2024-gold for CANInsertWithFailure-PT-020

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
15690.300	3600000.00	5261876.00	10481.50	1 ? ? ? ? ? ? ? ? ? ? ? ? ? ? ?	normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r041-smll-174853822500034.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is CANInsertWithFailure-PT-020, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-smll-174853822500034
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.1M
-rw-r--r-- 1 mcc users 8.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 179K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.4K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 2.6M May 29 14:32 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME CANInsertWithFailure-PT-020-UpperBounds-00
FORMULA_NAME CANInsertWithFailure-PT-020-UpperBounds-01
FORMULA_NAME CANInsertWithFailure-PT-020-UpperBounds-02
FORMULA_NAME CANInsertWithFailure-PT-020-UpperBounds-03
FORMULA_NAME CANInsertWithFailure-PT-020-UpperBounds-04
FORMULA_NAME CANInsertWithFailure-PT-020-UpperBounds-05
FORMULA_NAME CANInsertWithFailure-PT-020-UpperBounds-06
FORMULA_NAME CANInsertWithFailure-PT-020-UpperBounds-07
FORMULA_NAME CANInsertWithFailure-PT-020-UpperBounds-08
FORMULA_NAME CANInsertWithFailure-PT-020-UpperBounds-09
FORMULA_NAME CANInsertWithFailure-PT-020-UpperBounds-10
FORMULA_NAME CANInsertWithFailure-PT-020-UpperBounds-11
FORMULA_NAME CANInsertWithFailure-PT-020-UpperBounds-12
FORMULA_NAME CANInsertWithFailure-PT-020-UpperBounds-13
FORMULA_NAME CANInsertWithFailure-PT-020-UpperBounds-14
FORMULA_NAME CANInsertWithFailure-PT-020-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748547942762

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-020
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-29 19:45:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-29 19:45:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 19:45:45] [INFO ] Load time of PNML (sax parser for PT used): 341 ms
[2025-05-29 19:45:45] [INFO ] Transformed 1044 places.
[2025-05-29 19:45:45] [INFO ] Transformed 2520 transitions.
[2025-05-29 19:45:45] [INFO ] Parsed PT model containing 1044 places and 2520 transitions and 6800 arcs in 529 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 2520 rows 1044 cols
[2025-05-29 19:45:45] [INFO ] Computed 23 invariants in 159 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20]
RANDOM walk for 10000 steps (21 resets) in 125 ms. (79 steps per ms)
FORMULA CANInsertWithFailure-PT-020-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 150015 steps (30 resets) in 307 ms. (487 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20]
[2025-05-29 19:45:45] [INFO ] Invariant cache hit.
[2025-05-29 19:45:46] [INFO ] [Real]Absence check using 21 positive place invariants in 44 ms returned sat
[2025-05-29 19:45:46] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 15 ms returned sat
[2025-05-29 19:45:47] [INFO ] [Real]Absence check using state equation in 1305 ms returned sat
[2025-05-29 19:45:48] [INFO ] State equation strengthened by 780 read => feed constraints.
[2025-05-29 19:45:48] [INFO ] [Real]Added 780 Read/Feed constraints in 225 ms returned sat
[2025-05-29 19:45:48] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:45:48] [INFO ] [Nat]Absence check using 21 positive place invariants in 36 ms returned sat
[2025-05-29 19:45:48] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 13 ms returned sat
[2025-05-29 19:45:49] [INFO ] [Nat]Absence check using state equation in 926 ms returned sat
[2025-05-29 19:45:50] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-29 19:45:50] [INFO ] [Nat]Added 780 Read/Feed constraints in 741 ms returned sat
[2025-05-29 19:45:50] [INFO ] Computed and/alt/rep : 2440/3980/2440 causal constraints (skipped 60 transitions) in 216 ms.
[2025-05-29 19:45:52] [INFO ] Added : 29 causal constraints over 6 iterations in 1919 ms. Result :sat
Minimization took 808 ms.
[2025-05-29 19:45:53] [INFO ] [Real]Absence check using 21 positive place invariants in 22 ms returned sat
[2025-05-29 19:45:53] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 8 ms returned sat
[2025-05-29 19:45:54] [INFO ] [Real]Absence check using state equation in 791 ms returned sat
[2025-05-29 19:45:54] [INFO ] [Real]Added 780 Read/Feed constraints in 116 ms returned sat
[2025-05-29 19:45:54] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:45:54] [INFO ] [Nat]Absence check using 21 positive place invariants in 23 ms returned sat
[2025-05-29 19:45:54] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 9 ms returned sat
[2025-05-29 19:45:55] [INFO ] [Nat]Absence check using state equation in 1000 ms returned sat
[2025-05-29 19:45:56] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-29 19:45:56] [INFO ] [Nat]Added 780 Read/Feed constraints in 614 ms returned sat
[2025-05-29 19:45:56] [INFO ] Computed and/alt/rep : 2440/3980/2440 causal constraints (skipped 60 transitions) in 191 ms.
[2025-05-29 19:45:58] [INFO ] Added : 55 causal constraints over 11 iterations in 2337 ms. Result :sat
Minimization took 706 ms.
[2025-05-29 19:45:59] [INFO ] [Real]Absence check using 21 positive place invariants in 21 ms returned sat
[2025-05-29 19:45:59] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 8 ms returned sat
[2025-05-29 19:46:01] [INFO ] [Real]Absence check using state equation in 1203 ms returned sat
[2025-05-29 19:46:01] [INFO ] [Real]Added 780 Read/Feed constraints in 164 ms returned sat
[2025-05-29 19:46:01] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:46:01] [INFO ] [Nat]Absence check using 21 positive place invariants in 36 ms returned sat
[2025-05-29 19:46:01] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 14 ms returned sat
[2025-05-29 19:46:02] [INFO ] [Nat]Absence check using state equation in 1076 ms returned sat
[2025-05-29 19:46:03] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-29 19:46:03] [INFO ] [Nat]Added 780 Read/Feed constraints in 849 ms returned sat
[2025-05-29 19:46:03] [INFO ] Computed and/alt/rep : 2440/3980/2440 causal constraints (skipped 60 transitions) in 216 ms.
[2025-05-29 19:46:06] [INFO ] Added : 54 causal constraints over 11 iterations in 2313 ms. Result :sat
Minimization took 364 ms.
[2025-05-29 19:46:06] [INFO ] [Real]Absence check using 21 positive place invariants in 37 ms returned sat
[2025-05-29 19:46:06] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 14 ms returned sat
[2025-05-29 19:46:07] [INFO ] [Real]Absence check using state equation in 1046 ms returned sat
[2025-05-29 19:46:07] [INFO ] [Real]Added 780 Read/Feed constraints in 131 ms returned sat
[2025-05-29 19:46:08] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:46:08] [INFO ] [Nat]Absence check using 21 positive place invariants in 22 ms returned sat
[2025-05-29 19:46:08] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 9 ms returned sat
[2025-05-29 19:46:09] [INFO ] [Nat]Absence check using state equation in 790 ms returned sat
[2025-05-29 19:46:09] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-29 19:46:10] [INFO ] [Nat]Added 780 Read/Feed constraints in 1052 ms returned sat
[2025-05-29 19:46:10] [INFO ] Computed and/alt/rep : 2440/3980/2440 causal constraints (skipped 60 transitions) in 175 ms.
[2025-05-29 19:46:13] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-29 19:46:13] [INFO ] [Real]Absence check using 21 positive place invariants in 37 ms returned sat
[2025-05-29 19:46:13] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 14 ms returned sat
[2025-05-29 19:46:14] [INFO ] [Real]Absence check using state equation in 1045 ms returned sat
[2025-05-29 19:46:14] [INFO ] [Real]Added 780 Read/Feed constraints in 114 ms returned sat
[2025-05-29 19:46:14] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:46:14] [INFO ] [Nat]Absence check using 21 positive place invariants in 22 ms returned sat
[2025-05-29 19:46:14] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 9 ms returned sat
[2025-05-29 19:46:15] [INFO ] [Nat]Absence check using state equation in 1023 ms returned sat
[2025-05-29 19:46:16] [INFO ] [Nat]Added 780 Read/Feed constraints in 550 ms returned sat
[2025-05-29 19:46:16] [INFO ] Computed and/alt/rep : 2440/3980/2440 causal constraints (skipped 60 transitions) in 160 ms.
[2025-05-29 19:46:18] [INFO ] Added : 37 causal constraints over 8 iterations in 1697 ms. Result :sat
Minimization took 708 ms.
[2025-05-29 19:46:19] [INFO ] [Real]Absence check using 21 positive place invariants in 22 ms returned sat
[2025-05-29 19:46:19] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 8 ms returned sat
[2025-05-29 19:46:20] [INFO ] [Real]Absence check using state equation in 881 ms returned sat
[2025-05-29 19:46:20] [INFO ] [Real]Added 780 Read/Feed constraints in 197 ms returned sat
[2025-05-29 19:46:20] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:46:20] [INFO ] [Nat]Absence check using 21 positive place invariants in 35 ms returned sat
[2025-05-29 19:46:20] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 13 ms returned sat
[2025-05-29 19:46:22] [INFO ] [Nat]Absence check using state equation in 1263 ms returned sat
[2025-05-29 19:46:22] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-29 19:46:23] [INFO ] [Nat]Added 780 Read/Feed constraints in 1068 ms returned unknown
[2025-05-29 19:46:23] [INFO ] [Real]Absence check using 21 positive place invariants in 21 ms returned sat
[2025-05-29 19:46:23] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 8 ms returned sat
[2025-05-29 19:46:24] [INFO ] [Real]Absence check using state equation in 925 ms returned sat
[2025-05-29 19:46:24] [INFO ] [Real]Added 780 Read/Feed constraints in 115 ms returned sat
[2025-05-29 19:46:24] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:46:24] [INFO ] [Nat]Absence check using 21 positive place invariants in 22 ms returned sat
[2025-05-29 19:46:24] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 8 ms returned sat
[2025-05-29 19:46:25] [INFO ] [Nat]Absence check using state equation in 938 ms returned sat
[2025-05-29 19:46:26] [INFO ] [Nat]Added 780 Read/Feed constraints in 484 ms returned sat
[2025-05-29 19:46:26] [INFO ] Computed and/alt/rep : 2440/3980/2440 causal constraints (skipped 60 transitions) in 185 ms.
[2025-05-29 19:46:28] [INFO ] Added : 37 causal constraints over 8 iterations in 2005 ms. Result :sat
Minimization took 798 ms.
[2025-05-29 19:46:29] [INFO ] [Real]Absence check using 21 positive place invariants in 22 ms returned sat
[2025-05-29 19:46:29] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 9 ms returned sat
[2025-05-29 19:46:30] [INFO ] [Real]Absence check using state equation in 1004 ms returned sat
[2025-05-29 19:46:30] [INFO ] [Real]Added 780 Read/Feed constraints in 148 ms returned sat
[2025-05-29 19:46:30] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:46:30] [INFO ] [Nat]Absence check using 21 positive place invariants in 37 ms returned sat
[2025-05-29 19:46:30] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 15 ms returned sat
[2025-05-29 19:46:31] [INFO ] [Nat]Absence check using state equation in 1206 ms returned sat
[2025-05-29 19:46:32] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-29 19:46:32] [INFO ] [Nat]Added 780 Read/Feed constraints in 755 ms returned sat
[2025-05-29 19:46:32] [INFO ] Computed and/alt/rep : 2440/3980/2440 causal constraints (skipped 60 transitions) in 181 ms.
[2025-05-29 19:46:34] [INFO ] Added : 46 causal constraints over 10 iterations in 2113 ms. Result :sat
Minimization took 584 ms.
[2025-05-29 19:46:35] [INFO ] [Real]Absence check using 21 positive place invariants in 23 ms returned sat
[2025-05-29 19:46:35] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 9 ms returned sat
[2025-05-29 19:46:36] [INFO ] [Real]Absence check using state equation in 723 ms returned sat
[2025-05-29 19:46:36] [INFO ] [Real]Added 780 Read/Feed constraints in 116 ms returned sat
[2025-05-29 19:46:36] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:46:36] [INFO ] [Nat]Absence check using 21 positive place invariants in 22 ms returned sat
[2025-05-29 19:46:36] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 8 ms returned sat
[2025-05-29 19:46:37] [INFO ] [Nat]Absence check using state equation in 908 ms returned sat
[2025-05-29 19:46:38] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-29 19:46:38] [INFO ] [Nat]Added 780 Read/Feed constraints in 628 ms returned sat
[2025-05-29 19:46:38] [INFO ] Computed and/alt/rep : 2440/3980/2440 causal constraints (skipped 60 transitions) in 180 ms.
[2025-05-29 19:46:40] [INFO ] Added : 49 causal constraints over 10 iterations in 2010 ms. Result :sat
Minimization took 776 ms.
[2025-05-29 19:46:41] [INFO ] [Real]Absence check using 21 positive place invariants in 37 ms returned sat
[2025-05-29 19:46:41] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 15 ms returned sat
[2025-05-29 19:46:42] [INFO ] [Real]Absence check using state equation in 1017 ms returned sat
[2025-05-29 19:46:42] [INFO ] [Real]Added 780 Read/Feed constraints in 96 ms returned sat
[2025-05-29 19:46:42] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:46:43] [INFO ] [Nat]Absence check using 21 positive place invariants in 35 ms returned sat
[2025-05-29 19:46:43] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 14 ms returned sat
[2025-05-29 19:46:44] [INFO ] [Nat]Absence check using state equation in 1013 ms returned sat
[2025-05-29 19:46:44] [INFO ] [Nat]Added 780 Read/Feed constraints in 559 ms returned sat
[2025-05-29 19:46:44] [INFO ] Computed and/alt/rep : 2440/3980/2440 causal constraints (skipped 60 transitions) in 172 ms.
[2025-05-29 19:46:46] [INFO ] Added : 55 causal constraints over 11 iterations in 1994 ms. Result :sat
Minimization took 756 ms.
[2025-05-29 19:46:47] [INFO ] [Real]Absence check using 21 positive place invariants in 35 ms returned sat
[2025-05-29 19:46:47] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 9 ms returned sat
[2025-05-29 19:46:48] [INFO ] [Real]Absence check using state equation in 866 ms returned sat
[2025-05-29 19:46:48] [INFO ] [Real]Added 780 Read/Feed constraints in 136 ms returned sat
[2025-05-29 19:46:48] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:46:49] [INFO ] [Nat]Absence check using 21 positive place invariants in 25 ms returned sat
[2025-05-29 19:46:49] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 9 ms returned sat
[2025-05-29 19:46:50] [INFO ] [Nat]Absence check using state equation in 887 ms returned sat
[2025-05-29 19:46:50] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-29 19:46:50] [INFO ] [Nat]Added 780 Read/Feed constraints in 848 ms returned sat
[2025-05-29 19:46:51] [INFO ] Computed and/alt/rep : 2440/3980/2440 causal constraints (skipped 60 transitions) in 271 ms.
[2025-05-29 19:46:52] [INFO ] Added : 38 causal constraints over 8 iterations in 1725 ms. Result :sat
Minimization took 761 ms.
[2025-05-29 19:46:53] [INFO ] [Real]Absence check using 21 positive place invariants in 24 ms returned sat
[2025-05-29 19:46:53] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 9 ms returned sat
[2025-05-29 19:46:54] [INFO ] [Real]Absence check using state equation in 761 ms returned sat
[2025-05-29 19:46:54] [INFO ] [Real]Added 780 Read/Feed constraints in 92 ms returned sat
[2025-05-29 19:46:54] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:46:54] [INFO ] [Nat]Absence check using 21 positive place invariants in 21 ms returned sat
[2025-05-29 19:46:54] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 8 ms returned sat
[2025-05-29 19:46:55] [INFO ] [Nat]Absence check using state equation in 830 ms returned sat
[2025-05-29 19:46:56] [INFO ] [Nat]Added 780 Read/Feed constraints in 455 ms returned sat
[2025-05-29 19:46:56] [INFO ] Computed and/alt/rep : 2440/3980/2440 causal constraints (skipped 60 transitions) in 183 ms.
[2025-05-29 19:46:57] [INFO ] Added : 29 causal constraints over 6 iterations in 1233 ms. Result :sat
Minimization took 704 ms.
[2025-05-29 19:46:58] [INFO ] [Real]Absence check using 21 positive place invariants in 22 ms returned sat
[2025-05-29 19:46:58] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 9 ms returned sat
[2025-05-29 19:46:59] [INFO ] [Real]Absence check using state equation in 927 ms returned sat
[2025-05-29 19:46:59] [INFO ] [Real]Added 780 Read/Feed constraints in 155 ms returned sat
[2025-05-29 19:46:59] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:47:00] [INFO ] [Nat]Absence check using 21 positive place invariants in 36 ms returned sat
[2025-05-29 19:47:00] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 14 ms returned sat
[2025-05-29 19:47:01] [INFO ] [Nat]Absence check using state equation in 992 ms returned sat
[2025-05-29 19:47:01] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-29 19:47:02] [INFO ] [Nat]Added 780 Read/Feed constraints in 1088 ms returned unknown
[2025-05-29 19:47:02] [INFO ] [Real]Absence check using 21 positive place invariants in 22 ms returned sat
[2025-05-29 19:47:02] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 9 ms returned sat
[2025-05-29 19:47:03] [INFO ] [Real]Absence check using state equation in 1014 ms returned sat
[2025-05-29 19:47:03] [INFO ] [Real]Added 780 Read/Feed constraints in 178 ms returned sat
[2025-05-29 19:47:03] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:47:03] [INFO ] [Nat]Absence check using 21 positive place invariants in 33 ms returned sat
[2025-05-29 19:47:03] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 13 ms returned sat
[2025-05-29 19:47:05] [INFO ] [Nat]Absence check using state equation in 1088 ms returned sat
[2025-05-29 19:47:05] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-29 19:47:05] [INFO ] [Nat]Added 780 Read/Feed constraints in 891 ms returned sat
[2025-05-29 19:47:06] [INFO ] Computed and/alt/rep : 2440/3980/2440 causal constraints (skipped 60 transitions) in 177 ms.
[2025-05-29 19:47:07] [INFO ] Added : 48 causal constraints over 10 iterations in 1759 ms. Result :sat
Minimization took 734 ms.
[2025-05-29 19:47:08] [INFO ] [Real]Absence check using 21 positive place invariants in 20 ms returned sat
[2025-05-29 19:47:08] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 9 ms returned sat
[2025-05-29 19:47:09] [INFO ] [Real]Absence check using state equation in 1018 ms returned sat
[2025-05-29 19:47:10] [INFO ] [Real]Added 780 Read/Feed constraints in 165 ms returned sat
[2025-05-29 19:47:10] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:47:10] [INFO ] [Nat]Absence check using 21 positive place invariants in 35 ms returned sat
[2025-05-29 19:47:10] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 13 ms returned sat
[2025-05-29 19:47:11] [INFO ] [Nat]Absence check using state equation in 803 ms returned sat
[2025-05-29 19:47:11] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-29 19:47:11] [INFO ] [Nat]Added 780 Read/Feed constraints in 611 ms returned sat
[2025-05-29 19:47:12] [INFO ] Computed and/alt/rep : 2440/3980/2440 causal constraints (skipped 60 transitions) in 171 ms.
[2025-05-29 19:47:13] [INFO ] Added : 38 causal constraints over 8 iterations in 1362 ms. Result :sat
Minimization took 770 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20]
Support contains 15 out of 1044 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1044/1044 places, 2520/2520 transitions.
Graph (complete) has 3501 edges and 1044 vertex of which 1043 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 141 place count 1043 transition count 2380
Reduce places removed 140 places and 0 transitions.
Iterating post reduction 1 with 140 rules applied. Total rules applied 281 place count 903 transition count 2380
Performed 372 Post agglomeration using F-continuation condition.Transition count delta: 372
Deduced a syphon composed of 372 places in 1 ms
Reduce places removed 372 places and 0 transitions.
Iterating global reduction 2 with 744 rules applied. Total rules applied 1025 place count 531 transition count 2008
Drop transitions (Redundant composition of simpler transitions.) removed 334 transitions
Redundant transition composition rules discarded 334 transitions
Iterating global reduction 2 with 334 rules applied. Total rules applied 1359 place count 531 transition count 1674
Partial Free-agglomeration rule applied 431 times.
Drop transitions (Partial Free agglomeration) removed 431 transitions
Iterating global reduction 2 with 431 rules applied. Total rules applied 1790 place count 531 transition count 1674
Applied a total of 1790 rules in 530 ms. Remains 531 /1044 variables (removed 513) and now considering 1674/2520 (removed 846) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 548 ms. Remains : 531/1044 places, 1674/2520 transitions.
// Phase 1: matrix 1674 rows 531 cols
[2025-05-29 19:47:14] [INFO ] Computed 22 invariants in 100 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20]
RANDOM walk for 1000000 steps (10448 resets) in 5902 ms. (169 steps per ms)
BEST_FIRST walk for 15000014 steps (7105 resets) in 14831 ms. (1011 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20]
[2025-05-29 19:47:35] [INFO ] Invariant cache hit.
[2025-05-29 19:47:35] [INFO ] [Real]Absence check using 20 positive place invariants in 13 ms returned sat
[2025-05-29 19:47:35] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2025-05-29 19:47:35] [INFO ] [Real]Absence check using state equation in 435 ms returned sat
[2025-05-29 19:47:36] [INFO ] State equation strengthened by 1582 read => feed constraints.
[2025-05-29 19:47:36] [INFO ] [Real]Added 1582 Read/Feed constraints in 188 ms returned sat
[2025-05-29 19:47:36] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:47:36] [INFO ] [Nat]Absence check using 20 positive place invariants in 16 ms returned sat
[2025-05-29 19:47:36] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2025-05-29 19:47:37] [INFO ] [Nat]Absence check using state equation in 658 ms returned sat
[2025-05-29 19:47:37] [INFO ] [Nat]Added 1582 Read/Feed constraints in 267 ms returned sat
[2025-05-29 19:47:37] [INFO ] Computed and/alt/rep : 1160/3017/1160 causal constraints (skipped 494 transitions) in 163 ms.
[2025-05-29 19:47:37] [INFO ] Added : 6 causal constraints over 2 iterations in 558 ms. Result :sat
Minimization took 4503 ms.
[2025-05-29 19:47:42] [INFO ] [Real]Absence check using 20 positive place invariants in 14 ms returned sat
[2025-05-29 19:47:42] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2025-05-29 19:47:43] [INFO ] [Real]Absence check using state equation in 481 ms returned sat
[2025-05-29 19:47:43] [INFO ] [Real]Added 1582 Read/Feed constraints in 275 ms returned sat
[2025-05-29 19:47:43] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:47:43] [INFO ] [Nat]Absence check using 20 positive place invariants in 22 ms returned sat
[2025-05-29 19:47:43] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 8 ms returned sat
[2025-05-29 19:47:44] [INFO ] [Nat]Absence check using state equation in 666 ms returned sat
[2025-05-29 19:47:44] [INFO ] [Nat]Added 1582 Read/Feed constraints in 249 ms returned sat
[2025-05-29 19:47:44] [INFO ] Computed and/alt/rep : 1160/3017/1160 causal constraints (skipped 494 transitions) in 120 ms.
[2025-05-29 19:47:45] [INFO ] Added : 10 causal constraints over 2 iterations in 478 ms. Result :sat
Minimization took 4502 ms.
[2025-05-29 19:47:49] [INFO ] [Real]Absence check using 20 positive place invariants in 13 ms returned sat
[2025-05-29 19:47:49] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2025-05-29 19:47:50] [INFO ] [Real]Absence check using state equation in 534 ms returned sat
[2025-05-29 19:47:50] [INFO ] [Real]Added 1582 Read/Feed constraints in 275 ms returned sat
[2025-05-29 19:47:50] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:47:50] [INFO ] [Nat]Absence check using 20 positive place invariants in 23 ms returned sat
[2025-05-29 19:47:50] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 9 ms returned sat
[2025-05-29 19:47:51] [INFO ] [Nat]Absence check using state equation in 626 ms returned sat
[2025-05-29 19:47:51] [INFO ] [Nat]Added 1582 Read/Feed constraints in 189 ms returned sat
[2025-05-29 19:47:51] [INFO ] Computed and/alt/rep : 1160/3017/1160 causal constraints (skipped 494 transitions) in 112 ms.
[2025-05-29 19:47:52] [INFO ] Added : 8 causal constraints over 2 iterations in 431 ms. Result :sat
Minimization took 4529 ms.
[2025-05-29 19:47:56] [INFO ] [Real]Absence check using 20 positive place invariants in 13 ms returned sat
[2025-05-29 19:47:56] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2025-05-29 19:47:57] [INFO ] [Real]Absence check using state equation in 430 ms returned sat
[2025-05-29 19:47:57] [INFO ] [Real]Added 1582 Read/Feed constraints in 168 ms returned sat
[2025-05-29 19:47:57] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:47:57] [INFO ] [Nat]Absence check using 20 positive place invariants in 12 ms returned sat
[2025-05-29 19:47:57] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2025-05-29 19:47:57] [INFO ] [Nat]Absence check using state equation in 418 ms returned sat
[2025-05-29 19:47:58] [INFO ] [Nat]Added 1582 Read/Feed constraints in 210 ms returned sat
[2025-05-29 19:47:58] [INFO ] Computed and/alt/rep : 1160/3017/1160 causal constraints (skipped 494 transitions) in 115 ms.
[2025-05-29 19:47:58] [INFO ] Added : 9 causal constraints over 2 iterations in 393 ms. Result :sat
Minimization took 4510 ms.
[2025-05-29 19:48:03] [INFO ] [Real]Absence check using 20 positive place invariants in 12 ms returned sat
[2025-05-29 19:48:03] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2025-05-29 19:48:03] [INFO ] [Real]Absence check using state equation in 556 ms returned sat
[2025-05-29 19:48:04] [INFO ] [Real]Added 1582 Read/Feed constraints in 285 ms returned sat
[2025-05-29 19:48:04] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:48:04] [INFO ] [Nat]Absence check using 20 positive place invariants in 23 ms returned sat
[2025-05-29 19:48:04] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 9 ms returned sat
[2025-05-29 19:48:05] [INFO ] [Nat]Absence check using state equation in 620 ms returned sat
[2025-05-29 19:48:05] [INFO ] [Nat]Added 1582 Read/Feed constraints in 184 ms returned sat
[2025-05-29 19:48:05] [INFO ] Computed and/alt/rep : 1160/3017/1160 causal constraints (skipped 494 transitions) in 114 ms.
[2025-05-29 19:48:05] [INFO ] Added : 7 causal constraints over 3 iterations in 456 ms. Result :sat
Minimization took 4501 ms.
[2025-05-29 19:48:10] [INFO ] [Real]Absence check using 20 positive place invariants in 13 ms returned sat
[2025-05-29 19:48:10] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2025-05-29 19:48:10] [INFO ] [Real]Absence check using state equation in 422 ms returned sat
[2025-05-29 19:48:10] [INFO ] [Real]Added 1582 Read/Feed constraints in 174 ms returned sat
[2025-05-29 19:48:11] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:48:11] [INFO ] [Nat]Absence check using 20 positive place invariants in 20 ms returned sat
[2025-05-29 19:48:11] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 8 ms returned sat
[2025-05-29 19:48:11] [INFO ] [Nat]Absence check using state equation in 618 ms returned sat
[2025-05-29 19:48:12] [INFO ] [Nat]Added 1582 Read/Feed constraints in 343 ms returned sat
[2025-05-29 19:48:12] [INFO ] Computed and/alt/rep : 1160/3017/1160 causal constraints (skipped 494 transitions) in 187 ms.
[2025-05-29 19:48:12] [INFO ] Added : 9 causal constraints over 2 iterations in 641 ms. Result :sat
Minimization took 4502 ms.
[2025-05-29 19:48:17] [INFO ] [Real]Absence check using 20 positive place invariants in 14 ms returned sat
[2025-05-29 19:48:17] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2025-05-29 19:48:17] [INFO ] [Real]Absence check using state equation in 435 ms returned sat
[2025-05-29 19:48:18] [INFO ] [Real]Added 1582 Read/Feed constraints in 269 ms returned sat
[2025-05-29 19:48:18] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:48:18] [INFO ] [Nat]Absence check using 20 positive place invariants in 22 ms returned sat
[2025-05-29 19:48:18] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 8 ms returned sat
[2025-05-29 19:48:19] [INFO ] [Nat]Absence check using state equation in 659 ms returned sat
[2025-05-29 19:48:19] [INFO ] [Nat]Added 1582 Read/Feed constraints in 285 ms returned sat
[2025-05-29 19:48:19] [INFO ] Computed and/alt/rep : 1160/3017/1160 causal constraints (skipped 494 transitions) in 112 ms.
[2025-05-29 19:48:19] [INFO ] Added : 5 causal constraints over 1 iterations in 312 ms. Result :sat
Minimization took 4520 ms.
[2025-05-29 19:48:24] [INFO ] [Real]Absence check using 20 positive place invariants in 12 ms returned sat
[2025-05-29 19:48:24] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2025-05-29 19:48:24] [INFO ] [Real]Absence check using state equation in 473 ms returned sat
[2025-05-29 19:48:25] [INFO ] [Real]Added 1582 Read/Feed constraints in 203 ms returned sat
[2025-05-29 19:48:25] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:48:25] [INFO ] [Nat]Absence check using 20 positive place invariants in 14 ms returned sat
[2025-05-29 19:48:25] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2025-05-29 19:48:25] [INFO ] [Nat]Absence check using state equation in 432 ms returned sat
[2025-05-29 19:48:25] [INFO ] [Nat]Added 1582 Read/Feed constraints in 245 ms returned sat
[2025-05-29 19:48:26] [INFO ] Computed and/alt/rep : 1160/3017/1160 causal constraints (skipped 494 transitions) in 189 ms.
[2025-05-29 19:48:26] [INFO ] Added : 13 causal constraints over 3 iterations in 757 ms. Result :sat
Minimization took 4505 ms.
[2025-05-29 19:48:31] [INFO ] [Real]Absence check using 20 positive place invariants in 13 ms returned sat
[2025-05-29 19:48:31] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2025-05-29 19:48:31] [INFO ] [Real]Absence check using state equation in 570 ms returned sat
[2025-05-29 19:48:32] [INFO ] [Real]Added 1582 Read/Feed constraints in 171 ms returned sat
[2025-05-29 19:48:32] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:48:32] [INFO ] [Nat]Absence check using 20 positive place invariants in 13 ms returned sat
[2025-05-29 19:48:32] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2025-05-29 19:48:32] [INFO ] [Nat]Absence check using state equation in 478 ms returned sat
[2025-05-29 19:48:33] [INFO ] [Nat]Added 1582 Read/Feed constraints in 214 ms returned sat
[2025-05-29 19:48:33] [INFO ] Computed and/alt/rep : 1160/3017/1160 causal constraints (skipped 494 transitions) in 118 ms.
[2025-05-29 19:48:33] [INFO ] Added : 7 causal constraints over 2 iterations in 393 ms. Result :sat
Minimization took 4525 ms.
[2025-05-29 19:48:38] [INFO ] [Real]Absence check using 20 positive place invariants in 12 ms returned sat
[2025-05-29 19:48:38] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2025-05-29 19:48:38] [INFO ] [Real]Absence check using state equation in 410 ms returned sat
[2025-05-29 19:48:38] [INFO ] [Real]Added 1582 Read/Feed constraints in 188 ms returned sat
[2025-05-29 19:48:38] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:48:38] [INFO ] [Nat]Absence check using 20 positive place invariants in 15 ms returned sat
[2025-05-29 19:48:38] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2025-05-29 19:48:39] [INFO ] [Nat]Absence check using state equation in 556 ms returned sat
[2025-05-29 19:48:39] [INFO ] [Nat]Added 1582 Read/Feed constraints in 189 ms returned sat
[2025-05-29 19:48:39] [INFO ] Computed and/alt/rep : 1160/3017/1160 causal constraints (skipped 494 transitions) in 106 ms.
[2025-05-29 19:48:40] [INFO ] Added : 8 causal constraints over 2 iterations in 381 ms. Result :sat
Minimization took 4501 ms.
[2025-05-29 19:48:44] [INFO ] [Real]Absence check using 20 positive place invariants in 14 ms returned sat
[2025-05-29 19:48:44] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2025-05-29 19:48:45] [INFO ] [Real]Absence check using state equation in 464 ms returned sat
[2025-05-29 19:48:45] [INFO ] [Real]Added 1582 Read/Feed constraints in 194 ms returned sat
[2025-05-29 19:48:45] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:48:45] [INFO ] [Nat]Absence check using 20 positive place invariants in 13 ms returned sat
[2025-05-29 19:48:45] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2025-05-29 19:48:45] [INFO ] [Nat]Absence check using state equation in 419 ms returned sat
[2025-05-29 19:48:46] [INFO ] [Nat]Added 1582 Read/Feed constraints in 184 ms returned sat
[2025-05-29 19:48:46] [INFO ] Computed and/alt/rep : 1160/3017/1160 causal constraints (skipped 494 transitions) in 119 ms.
[2025-05-29 19:48:46] [INFO ] Added : 9 causal constraints over 2 iterations in 411 ms. Result :sat
Minimization took 4501 ms.
[2025-05-29 19:48:51] [INFO ] [Real]Absence check using 20 positive place invariants in 14 ms returned sat
[2025-05-29 19:48:51] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2025-05-29 19:48:51] [INFO ] [Real]Absence check using state equation in 540 ms returned sat
[2025-05-29 19:48:52] [INFO ] [Real]Added 1582 Read/Feed constraints in 205 ms returned sat
[2025-05-29 19:48:52] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:48:52] [INFO ] [Nat]Absence check using 20 positive place invariants in 14 ms returned sat
[2025-05-29 19:48:52] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2025-05-29 19:48:52] [INFO ] [Nat]Absence check using state equation in 446 ms returned sat
[2025-05-29 19:48:52] [INFO ] [Nat]Added 1582 Read/Feed constraints in 201 ms returned sat
[2025-05-29 19:48:52] [INFO ] Computed and/alt/rep : 1160/3017/1160 causal constraints (skipped 494 transitions) in 116 ms.
[2025-05-29 19:48:53] [INFO ] Added : 7 causal constraints over 2 iterations in 406 ms. Result :sat
Minimization took 4528 ms.
[2025-05-29 19:48:57] [INFO ] [Real]Absence check using 20 positive place invariants in 13 ms returned sat
[2025-05-29 19:48:57] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 8 ms returned sat
[2025-05-29 19:48:58] [INFO ] [Real]Absence check using state equation in 454 ms returned sat
[2025-05-29 19:48:58] [INFO ] [Real]Added 1582 Read/Feed constraints in 168 ms returned sat
[2025-05-29 19:48:58] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:48:58] [INFO ] [Nat]Absence check using 20 positive place invariants in 13 ms returned sat
[2025-05-29 19:48:58] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2025-05-29 19:48:59] [INFO ] [Nat]Absence check using state equation in 435 ms returned sat
[2025-05-29 19:48:59] [INFO ] [Nat]Added 1582 Read/Feed constraints in 187 ms returned sat
[2025-05-29 19:48:59] [INFO ] Computed and/alt/rep : 1160/3017/1160 causal constraints (skipped 494 transitions) in 115 ms.
[2025-05-29 19:48:59] [INFO ] Added : 6 causal constraints over 2 iterations in 402 ms. Result :sat
Minimization took 4501 ms.
[2025-05-29 19:49:04] [INFO ] [Real]Absence check using 20 positive place invariants in 13 ms returned sat
[2025-05-29 19:49:04] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2025-05-29 19:49:04] [INFO ] [Real]Absence check using state equation in 449 ms returned sat
[2025-05-29 19:49:05] [INFO ] [Real]Added 1582 Read/Feed constraints in 181 ms returned sat
[2025-05-29 19:49:05] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:49:05] [INFO ] [Nat]Absence check using 20 positive place invariants in 13 ms returned sat
[2025-05-29 19:49:05] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2025-05-29 19:49:05] [INFO ] [Nat]Absence check using state equation in 440 ms returned sat
[2025-05-29 19:49:05] [INFO ] [Nat]Added 1582 Read/Feed constraints in 185 ms returned sat
[2025-05-29 19:49:06] [INFO ] Computed and/alt/rep : 1160/3017/1160 causal constraints (skipped 494 transitions) in 119 ms.
[2025-05-29 19:49:06] [INFO ] Added : 8 causal constraints over 2 iterations in 405 ms. Result :sat
Minimization took 4502 ms.
[2025-05-29 19:49:10] [INFO ] [Real]Absence check using 20 positive place invariants in 13 ms returned sat
[2025-05-29 19:49:10] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2025-05-29 19:49:11] [INFO ] [Real]Absence check using state equation in 433 ms returned sat
[2025-05-29 19:49:11] [INFO ] [Real]Added 1582 Read/Feed constraints in 183 ms returned sat
[2025-05-29 19:49:11] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:49:11] [INFO ] [Nat]Absence check using 20 positive place invariants in 13 ms returned sat
[2025-05-29 19:49:11] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2025-05-29 19:49:12] [INFO ] [Nat]Absence check using state equation in 428 ms returned sat
[2025-05-29 19:49:12] [INFO ] [Nat]Added 1582 Read/Feed constraints in 181 ms returned sat
[2025-05-29 19:49:12] [INFO ] Computed and/alt/rep : 1160/3017/1160 causal constraints (skipped 494 transitions) in 117 ms.
[2025-05-29 19:49:12] [INFO ] Added : 6 causal constraints over 2 iterations in 413 ms. Result :sat
Minimization took 4502 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20]
Support contains 15 out of 531 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 531/531 places, 1674/1674 transitions.
Applied a total of 0 rules in 69 ms. Remains 531 /531 variables (removed 0) and now considering 1674/1674 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 531/531 places, 1674/1674 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 531/531 places, 1674/1674 transitions.
Applied a total of 0 rules in 49 ms. Remains 531 /531 variables (removed 0) and now considering 1674/1674 (removed 0) transitions.
[2025-05-29 19:49:17] [INFO ] Invariant cache hit.
[2025-05-29 19:49:18] [INFO ] Implicit Places using invariants in 638 ms returned []
[2025-05-29 19:49:18] [INFO ] Invariant cache hit.
[2025-05-29 19:49:18] [INFO ] State equation strengthened by 1582 read => feed constraints.
[2025-05-29 19:49:24] [INFO ] Implicit Places using invariants and state equation in 6664 ms returned []
Implicit Place search using SMT with State Equation took 7305 ms to find 0 implicit places.
[2025-05-29 19:49:24] [INFO ] Redundant transitions in 142 ms returned []
Running 1654 sub problems to find dead transitions.
[2025-05-29 19:49:24] [INFO ] Invariant cache hit.
[2025-05-29 19:49:25] [INFO ] State equation strengthened by 1582 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1654 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1654 unsolved
[2025-05-29 19:49:51] [INFO ] Deduced a trap composed of 2 places in 449 ms of which 44 ms to minimize.
[2025-05-29 19:49:52] [INFO ] Deduced a trap composed of 30 places in 477 ms of which 8 ms to minimize.
[2025-05-29 19:49:52] [INFO ] Deduced a trap composed of 27 places in 602 ms of which 7 ms to minimize.
[2025-05-29 19:49:53] [INFO ] Deduced a trap composed of 31 places in 255 ms of which 5 ms to minimize.
[2025-05-29 19:49:53] [INFO ] Deduced a trap composed of 25 places in 214 ms of which 3 ms to minimize.
[2025-05-29 19:49:53] [INFO ] Deduced a trap composed of 25 places in 167 ms of which 3 ms to minimize.
[2025-05-29 19:49:53] [INFO ] Deduced a trap composed of 25 places in 166 ms of which 3 ms to minimize.
[2025-05-29 19:49:54] [INFO ] Deduced a trap composed of 30 places in 146 ms of which 3 ms to minimize.
[2025-05-29 19:49:54] [INFO ] Deduced a trap composed of 27 places in 171 ms of which 3 ms to minimize.
[2025-05-29 19:49:54] [INFO ] Deduced a trap composed of 26 places in 167 ms of which 3 ms to minimize.
[2025-05-29 19:49:54] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 3 ms to minimize.
[2025-05-29 19:49:54] [INFO ] Deduced a trap composed of 26 places in 164 ms of which 4 ms to minimize.
[2025-05-29 19:49:54] [INFO ] Deduced a trap composed of 26 places in 169 ms of which 3 ms to minimize.
[2025-05-29 19:49:55] [INFO ] Deduced a trap composed of 26 places in 294 ms of which 4 ms to minimize.
[2025-05-29 19:49:55] [INFO ] Deduced a trap composed of 25 places in 201 ms of which 3 ms to minimize.
[2025-05-29 19:49:55] [INFO ] Deduced a trap composed of 26 places in 152 ms of which 3 ms to minimize.
[2025-05-29 19:49:55] [INFO ] Deduced a trap composed of 26 places in 153 ms of which 3 ms to minimize.
[2025-05-29 19:49:55] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 2 ms to minimize.
[2025-05-29 19:49:56] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 2 ms to minimize.
SMT process timed out in 31094ms, After SMT, problems are : Problem set: 0 solved, 1654 unsolved
Search for dead transitions found 0 dead transitions in 31137ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38669 ms. Remains : 531/531 places, 1674/1674 transitions.
[2025-05-29 19:49:57] [INFO ] Flatten gal took : 366 ms
RANDOM walk for 40000 steps (417 resets) in 2816 ms. (14 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 30/30 properties
[2025-05-29 19:49:57] [INFO ] Flatten gal took : 279 ms
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
[2025-05-29 19:49:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16275056195036237451.gal : 106 ms
[2025-05-29 19:49:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11714788387338545905.prop : 2 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/ReachabilityCardinality16275056195036237451.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11714788387338545905.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 ...330
Loading property file /tmp/ReachabilityCardinality11714788387338545905.prop.
SDD proceeding with computation,30 properties remain. new max is 4
SDD size :1 after 147
SDD proceeding with computation,30 properties remain. new max is 8
SDD size :147 after 150
SDD proceeding with computation,30 properties remain. new max is 16
SDD size :150 after 151
SDD proceeding with computation,30 properties remain. new max is 32
SDD size :151 after 155
SDD proceeding with computation,30 properties remain. new max is 64
SDD size :155 after 156
SDD proceeding with computation,30 properties remain. new max is 128
SDD size :156 after 157
SDD proceeding with computation,30 properties remain. new max is 256
SDD size :157 after 163
SDD proceeding with computation,30 properties remain. new max is 512
SDD size :163 after 174
Interrupted probabilistic random walk after 235266 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :0 out of 30
Probabilistic random walk after 235266 steps, saw 34127 distinct states, run finished after 3009 ms. (steps per millisecond=78 ) properties seen :0
[2025-05-29 19:50:00] [INFO ] Invariant cache hit.
[2025-05-29 19:50:00] [INFO ] State equation strengthened by 1582 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
SDD proceeding with computation,30 properties remain. new max is 1024
SDD size :174 after 199
At refinement iteration 1 (OVERLAPS) 474/489 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2025-05-29 19:50:00] [INFO ] Deduced a trap composed of 2 places in 65 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
[2025-05-29 19:50:00] [INFO ] Deduced a trap composed of 2 places in 57 ms of which 1 ms to minimize.
[2025-05-29 19:50:00] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2025-05-29 19:50:00] [INFO ] Deduced a trap composed of 2 places in 58 ms of which 1 ms to minimize.
[2025-05-29 19:50:00] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2025-05-29 19:50:01] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
[2025-05-29 19:50:01] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
[2025-05-29 19:50:01] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2025-05-29 19:50:01] [INFO ] Deduced a trap composed of 2 places in 56 ms of which 1 ms to minimize.
[2025-05-29 19:50:01] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2025-05-29 19:50:01] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
[2025-05-29 19:50:01] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2025-05-29 19:50:01] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
SDD proceeding with computation,30 properties remain. new max is 2048
SDD size :199 after 236
[2025-05-29 19:50:01] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
[2025-05-29 19:50:01] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
[2025-05-29 19:50:01] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2025-05-29 19:50:01] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2025-05-29 19:50:01] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
[2025-05-29 19:50:01] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
Problem MAX1 is UNSAT
Problem MAX2 is UNSAT
Problem MAX3 is UNSAT
Problem MAX4 is UNSAT
Problem MAX5 is UNSAT
Problem MAX6 is UNSAT
Problem MAX7 is UNSAT
Problem MAX8 is UNSAT
Problem MAX9 is UNSAT
Problem MAX10 is UNSAT
Problem MAX11 is UNSAT
Problem MAX12 is UNSAT
Problem MAX13 is UNSAT
Problem MAX14 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/489 variables, 19/20 constraints. Problems are: Problem set: 15 solved, 15 unsolved
SDD proceeding with computation,30 properties remain. new max is 4096
SDD size :236 after 320
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/489 variables, 0/20 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 38/527 variables, 19/39 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/527 variables, 0/39 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 2/529 variables, 2/41 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/529 variables, 0/41 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 1674/2203 variables, 529/570 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2203 variables, 1582/2152 constraints. Problems are: Problem set: 15 solved, 15 unsolved
SDD proceeding with computation,30 properties remain. new max is 8192
SDD size :320 after 453
At refinement iteration 10 (INCLUDED_ONLY) 0/2203 variables, 0/2152 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 2/2205 variables, 2/2154 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2205 variables, 0/2154 constraints. Problems are: Problem set: 15 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2205/2205 variables, and 2154 constraints, problems are : Problem set: 15 solved, 15 unsolved in 5025 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 531/531 constraints, ReadFeed: 1582/1582 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 15 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 474/489 variables, 1/1 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/489 variables, 19/20 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/489 variables, 0/20 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 38/527 variables, 19/39 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/527 variables, 0/39 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 2/529 variables, 2/41 constraints. Problems are: Problem set: 15 solved, 15 unsolved
[2025-05-29 19:50:06] [INFO ] Deduced a trap composed of 24 places in 398 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/529 variables, 1/42 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/529 variables, 0/42 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 1674/2203 variables, 529/571 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2203 variables, 1582/2153 constraints. Problems are: Problem set: 15 solved, 15 unsolved
SDD proceeding with computation,30 properties remain. new max is 16384
SDD size :453 after 7517
At refinement iteration 11 (INCLUDED_ONLY) 0/2203 variables, 15/2168 constraints. Problems are: Problem set: 15 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2203/2205 variables, and 2168 constraints, problems are : Problem set: 15 solved, 15 unsolved in 5026 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 529/531 constraints, ReadFeed: 1582/1582 constraints, PredecessorRefiner: 15/30 constraints, Known Traps: 20/20 constraints]
After SMT, in 10135ms problems are : Problem set: 15 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 15 out of 531 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 531/531 places, 1674/1674 transitions.
Applied a total of 0 rules in 81 ms. Remains 531 /531 variables (removed 0) and now considering 1674/1674 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 531/531 places, 1674/1674 transitions.
RANDOM walk for 40000 steps (419 resets) in 986 ms. (40 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 229806 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :0 out of 15
Probabilistic random walk after 229806 steps, saw 33498 distinct states, run finished after 3001 ms. (steps per millisecond=76 ) properties seen :0
[2025-05-29 19:50:14] [INFO ] Invariant cache hit.
[2025-05-29 19:50:14] [INFO ] State equation strengthened by 1582 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 474/489 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/489 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 38/527 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 2/529 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/529 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 1674/2203 variables, 529/551 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2203 variables, 1582/2133 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2203 variables, 0/2133 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 2/2205 variables, 2/2135 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2205 variables, 0/2135 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 0/2205 variables, 0/2135 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2205/2205 variables, and 2135 constraints, problems are : Problem set: 0 solved, 15 unsolved in 4500 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 531/531 constraints, ReadFeed: 1582/1582 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 474/489 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2025-05-29 19:50:18] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
[2025-05-29 19:50:19] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 2 ms to minimize.
[2025-05-29 19:50:19] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2025-05-29 19:50:19] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
[2025-05-29 19:50:19] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
[2025-05-29 19:50:19] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
[2025-05-29 19:50:19] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
[2025-05-29 19:50:19] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
[2025-05-29 19:50:19] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
[2025-05-29 19:50:19] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
[2025-05-29 19:50:19] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2025-05-29 19:50:19] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 2 ms to minimize.
[2025-05-29 19:50:19] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
[2025-05-29 19:50:19] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2025-05-29 19:50:19] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
[2025-05-29 19:50:19] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2025-05-29 19:50:19] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
[2025-05-29 19:50:19] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 13 ms to minimize.
[2025-05-29 19:50:19] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/489 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/489 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 38/527 variables, 19/39 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/527 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 2/529 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2025-05-29 19:50:20] [INFO ] Deduced a trap composed of 27 places in 387 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/529 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/529 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 1674/2203 variables, 529/571 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2203 variables, 1582/2153 constraints. Problems are: Problem set: 0 solved, 15 unsolved
SDD proceeding with computation,30 properties remain. new max is 32768
SDD size :7517 after 9303
At refinement iteration 11 (INCLUDED_ONLY) 0/2203 variables, 15/2168 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2203 variables, 0/2168 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (OVERLAPS) 2/2205 variables, 2/2170 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2205 variables, 0/2170 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Detected timeout of ITS tools.
[2025-05-29 19:50:47] [INFO ] Flatten gal took : 121 ms
[2025-05-29 19:50:47] [INFO ] Applying decomposition
[2025-05-29 19:50:47] [INFO ] Flatten gal took : 80 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/graph17056846721398246830.txt' '-o' '/tmp/graph17056846721398246830.bin' '-w' '/tmp/graph17056846721398246830.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17056846721398246830.bin' '-l' '-1' '-v' '-w' '/tmp/graph17056846721398246830.weights' '-q' '0' '-e' '0.001'
[2025-05-29 19:50:48] [INFO ] Decomposing Gal with order
[2025-05-29 19:50:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 19:50:48] [INFO ] Removed a total of 1268 redundant transitions.
[2025-05-29 19:50:48] [INFO ] Flatten gal took : 395 ms
[2025-05-29 19:50:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 1221 labels/synchronizations in 134 ms.
[2025-05-29 19:50:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1920631855293331594.gal : 44 ms
[2025-05-29 19:50:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4514657427676004637.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/ReachabilityCardinality1920631855293331594.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4514657427676004637.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/ReachabilityCardinality4514657427676004637.prop.
SDD proceeding with computation,15 properties remain. new max is 4
SDD size :1 after 374
SDD proceeding with computation,15 properties remain. new max is 8
SDD size :374 after 374
SDD proceeding with computation,15 properties remain. new max is 16
SDD size :374 after 374
SDD proceeding with computation,15 properties remain. new max is 32
SDD size :374 after 374
SDD proceeding with computation,15 properties remain. new max is 64
SDD size :374 after 374
SDD proceeding with computation,15 properties remain. new max is 128
SDD size :374 after 397
SDD proceeding with computation,15 properties remain. new max is 256
SDD size :397 after 403
SDD proceeding with computation,15 properties remain. new max is 512
SDD size :403 after 456
SDD proceeding with computation,15 properties remain. new max is 1024
SDD size :456 after 22310
SDD proceeding with computation,15 properties remain. new max is 2048
SDD size :22310 after 71006
SDD proceeding with computation,15 properties remain. new max is 4096
SDD size :71006 after 1.55515e+06
At refinement iteration 15 (OVERLAPS) 0/2205 variables, 0/2170 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2205/2205 variables, and 2170 constraints, problems are : Problem set: 0 solved, 15 unsolved in 44005 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 531/531 constraints, ReadFeed: 1582/1582 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 20/20 constraints]
After SMT, in 48553ms problems are : Problem set: 0 solved, 15 unsolved
Fused 15 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 4249 ms.
Support contains 15 out of 531 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 531/531 places, 1674/1674 transitions.
Applied a total of 0 rules in 34 ms. Remains 531 /531 variables (removed 0) and now considering 1674/1674 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 531/531 places, 1674/1674 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 531/531 places, 1674/1674 transitions.
Applied a total of 0 rules in 32 ms. Remains 531 /531 variables (removed 0) and now considering 1674/1674 (removed 0) transitions.
[2025-05-29 19:51:07] [INFO ] Invariant cache hit.
[2025-05-29 19:51:07] [INFO ] Implicit Places using invariants in 567 ms returned []
[2025-05-29 19:51:07] [INFO ] Invariant cache hit.
[2025-05-29 19:51:08] [INFO ] State equation strengthened by 1582 read => feed constraints.
SDD proceeding with computation,15 properties remain. new max is 8192
SDD size :1.55515e+06 after 3.57199e+07
[2025-05-29 19:51:14] [INFO ] Implicit Places using invariants and state equation in 7173 ms returned []
Implicit Place search using SMT with State Equation took 7742 ms to find 0 implicit places.
[2025-05-29 19:51:14] [INFO ] Redundant transitions in 39 ms returned []
Running 1654 sub problems to find dead transitions.
[2025-05-29 19:51:14] [INFO ] Invariant cache hit.
[2025-05-29 19:51:14] [INFO ] State equation strengthened by 1582 read => feed constraints.
SDD proceeding with computation,15 properties remain. new max is 16384
SDD size :3.57199e+07 after 3.9017e+07
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1654 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1654 unsolved
[2025-05-29 19:51:35] [INFO ] Deduced a trap composed of 2 places in 422 ms of which 20 ms to minimize.
[2025-05-29 19:51:35] [INFO ] Deduced a trap composed of 30 places in 265 ms of which 4 ms to minimize.
[2025-05-29 19:51:35] [INFO ] Deduced a trap composed of 27 places in 331 ms of which 4 ms to minimize.
[2025-05-29 19:51:36] [INFO ] Deduced a trap composed of 31 places in 165 ms of which 3 ms to minimize.
[2025-05-29 19:51:36] [INFO ] Deduced a trap composed of 25 places in 164 ms of which 3 ms to minimize.
[2025-05-29 19:51:36] [INFO ] Deduced a trap composed of 25 places in 147 ms of which 3 ms to minimize.
[2025-05-29 19:51:36] [INFO ] Deduced a trap composed of 25 places in 149 ms of which 3 ms to minimize.
[2025-05-29 19:51:36] [INFO ] Deduced a trap composed of 30 places in 134 ms of which 2 ms to minimize.
[2025-05-29 19:51:37] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 3 ms to minimize.
[2025-05-29 19:51:37] [INFO ] Deduced a trap composed of 26 places in 142 ms of which 2 ms to minimize.
[2025-05-29 19:51:37] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 2 ms to minimize.
[2025-05-29 19:51:37] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 3 ms to minimize.
[2025-05-29 19:51:37] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 3 ms to minimize.
[2025-05-29 19:51:37] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 2 ms to minimize.
[2025-05-29 19:51:37] [INFO ] Deduced a trap composed of 25 places in 144 ms of which 3 ms to minimize.
[2025-05-29 19:51:38] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 3 ms to minimize.
[2025-05-29 19:51:38] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 2 ms to minimize.
[2025-05-29 19:51:38] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 2 ms to minimize.
[2025-05-29 19:51:38] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 1 ms to minimize.
[2025-05-29 19:51:38] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/530 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1654 unsolved
[2025-05-29 19:51:39] [INFO ] Deduced a trap composed of 27 places in 152 ms of which 3 ms to minimize.
Detected timeout of ITS tools.
[2025-05-29 19:51:39] [INFO ] Deduced a trap composed of 27 places in 202 ms of which 3 ms to minimize.
[2025-05-29 19:51:39] [INFO ] Deduced a trap composed of 27 places in 160 ms of which 3 ms to minimize.
[2025-05-29 19:51:39] [INFO ] Deduced a trap composed of 26 places in 219 ms of which 3 ms to minimize.
[2025-05-29 19:51:39] [INFO ] Deduced a trap composed of 25 places in 216 ms of which 4 ms to minimize.
[2025-05-29 19:51:40] [INFO ] Deduced a trap composed of 27 places in 216 ms of which 3 ms to minimize.
[2025-05-29 19:51:40] [INFO ] Deduced a trap composed of 27 places in 235 ms of which 4 ms to minimize.
[2025-05-29 19:51:40] [INFO ] Deduced a trap composed of 26 places in 261 ms of which 4 ms to minimize.
[2025-05-29 19:51:40] [INFO ] Deduced a trap composed of 25 places in 233 ms of which 3 ms to minimize.
[2025-05-29 19:51:41] [INFO ] Deduced a trap composed of 26 places in 180 ms of which 3 ms to minimize.
[2025-05-29 19:51:41] [INFO ] Deduced a trap composed of 25 places in 205 ms of which 3 ms to minimize.
[2025-05-29 19:51:41] [INFO ] Deduced a trap composed of 26 places in 192 ms of which 3 ms to minimize.
[2025-05-29 19:51:41] [INFO ] Deduced a trap composed of 26 places in 202 ms of which 3 ms to minimize.
[2025-05-29 19:51:42] [INFO ] Deduced a trap composed of 25 places in 190 ms of which 4 ms to minimize.
[2025-05-29 19:51:42] [INFO ] Deduced a trap composed of 27 places in 171 ms of which 3 ms to minimize.
[2025-05-29 19:51:42] [INFO ] Deduced a trap composed of 25 places in 164 ms of which 2 ms to minimize.
[2025-05-29 19:51:42] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 3 ms to minimize.
[2025-05-29 19:51:42] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 2 ms to minimize.
[2025-05-29 19:51:43] [INFO ] Deduced a trap composed of 26 places in 600 ms of which 7 ms to minimize.
[2025-05-29 19:51:44] [INFO ] Deduced a trap composed of 31 places in 698 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/530 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1654 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 530/2205 variables, and 62 constraints, problems are : Problem set: 0 solved, 1654 unsolved in 30089 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/531 constraints, ReadFeed: 0/1582 constraints, PredecessorRefiner: 1654/1654 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1654 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1654 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1654 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/530 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1654 unsolved
[2025-05-29 19:51:48] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2025-05-29 19:51:48] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2025-05-29 19:51:49] [INFO ] Deduced a trap composed of 33 places in 407 ms of which 5 ms to minimize.
[2025-05-29 19:51:49] [INFO ] Deduced a trap composed of 25 places in 375 ms of which 4 ms to minimize.
[2025-05-29 19:51:50] [INFO ] Deduced a trap composed of 28 places in 401 ms of which 5 ms to minimize.
[2025-05-29 19:51:50] [INFO ] Deduced a trap composed of 28 places in 347 ms of which 4 ms to minimize.
[2025-05-29 19:51:50] [INFO ] Deduced a trap composed of 30 places in 311 ms of which 5 ms to minimize.
[2025-05-29 19:51:51] [INFO ] Deduced a trap composed of 27 places in 426 ms of which 4 ms to minimize.
[2025-05-29 19:51:51] [INFO ] Deduced a trap composed of 30 places in 421 ms of which 5 ms to minimize.
[2025-05-29 19:51:52] [INFO ] Deduced a trap composed of 33 places in 437 ms of which 4 ms to minimize.
[2025-05-29 19:51:52] [INFO ] Deduced a trap composed of 31 places in 445 ms of which 5 ms to minimize.
[2025-05-29 19:51:53] [INFO ] Deduced a trap composed of 26 places in 448 ms of which 5 ms to minimize.
[2025-05-29 19:51:53] [INFO ] Deduced a trap composed of 25 places in 448 ms of which 4 ms to minimize.
[2025-05-29 19:51:54] [INFO ] Deduced a trap composed of 25 places in 401 ms of which 4 ms to minimize.
[2025-05-29 19:51:54] [INFO ] Deduced a trap composed of 27 places in 452 ms of which 5 ms to minimize.
[2025-05-29 19:51:54] [INFO ] Deduced a trap composed of 28 places in 436 ms of which 5 ms to minimize.
[2025-05-29 19:51:55] [INFO ] Deduced a trap composed of 25 places in 428 ms of which 5 ms to minimize.
[2025-05-29 19:51:55] [INFO ] Deduced a trap composed of 50 places in 392 ms of which 5 ms to minimize.
[2025-05-29 19:51:55] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 2 ms to minimize.
[2025-05-29 19:51:56] [INFO ] Deduced a trap composed of 44 places in 401 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/530 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1654 unsolved
[2025-05-29 19:51:57] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2025-05-29 19:51:57] [INFO ] Deduced a trap composed of 27 places in 320 ms of which 4 ms to minimize.
[2025-05-29 19:51:57] [INFO ] Deduced a trap composed of 27 places in 307 ms of which 3 ms to minimize.
[2025-05-29 19:51:58] [INFO ] Deduced a trap composed of 29 places in 326 ms of which 4 ms to minimize.
[2025-05-29 19:51:58] [INFO ] Deduced a trap composed of 27 places in 294 ms of which 4 ms to minimize.
[2025-05-29 19:51:58] [INFO ] Deduced a trap composed of 30 places in 297 ms of which 4 ms to minimize.
[2025-05-29 19:51:59] [INFO ] Deduced a trap composed of 31 places in 296 ms of which 3 ms to minimize.
[2025-05-29 19:51:59] [INFO ] Deduced a trap composed of 26 places in 239 ms of which 3 ms to minimize.
[2025-05-29 19:51:59] [INFO ] Deduced a trap composed of 28 places in 222 ms of which 3 ms to minimize.
[2025-05-29 19:51:59] [INFO ] Deduced a trap composed of 27 places in 273 ms of which 3 ms to minimize.
[2025-05-29 19:52:00] [INFO ] Deduced a trap composed of 37 places in 200 ms of which 3 ms to minimize.
[2025-05-29 19:52:00] [INFO ] Deduced a trap composed of 29 places in 190 ms of which 2 ms to minimize.
[2025-05-29 19:52:00] [INFO ] Deduced a trap composed of 32 places in 196 ms of which 2 ms to minimize.
[2025-05-29 19:52:00] [INFO ] Deduced a trap composed of 29 places in 196 ms of which 3 ms to minimize.
[2025-05-29 19:52:00] [INFO ] Deduced a trap composed of 29 places in 186 ms of which 3 ms to minimize.
[2025-05-29 19:52:01] [INFO ] Deduced a trap composed of 28 places in 188 ms of which 3 ms to minimize.
[2025-05-29 19:52:01] [INFO ] Deduced a trap composed of 28 places in 190 ms of which 3 ms to minimize.
[2025-05-29 19:52:01] [INFO ] Deduced a trap composed of 26 places in 189 ms of which 3 ms to minimize.
[2025-05-29 19:52:01] [INFO ] Deduced a trap composed of 26 places in 181 ms of which 2 ms to minimize.
[2025-05-29 19:52:01] [INFO ] Deduced a trap composed of 25 places in 188 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/530 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1654 unsolved
[2025-05-29 19:52:03] [INFO ] Deduced a trap composed of 22 places in 440 ms of which 4 ms to minimize.
[2025-05-29 19:52:04] [INFO ] Deduced a trap composed of 22 places in 539 ms of which 7 ms to minimize.
[2025-05-29 19:52:04] [INFO ] Deduced a trap composed of 25 places in 373 ms of which 6 ms to minimize.
[2025-05-29 19:52:04] [INFO ] Deduced a trap composed of 33 places in 339 ms of which 5 ms to minimize.
[2025-05-29 19:52:05] [INFO ] Deduced a trap composed of 29 places in 302 ms of which 4 ms to minimize.
[2025-05-29 19:52:05] [INFO ] Deduced a trap composed of 29 places in 280 ms of which 3 ms to minimize.
[2025-05-29 19:52:05] [INFO ] Deduced a trap composed of 28 places in 262 ms of which 3 ms to minimize.
[2025-05-29 19:52:06] [INFO ] Deduced a trap composed of 28 places in 253 ms of which 3 ms to minimize.
[2025-05-29 19:52:06] [INFO ] Deduced a trap composed of 28 places in 252 ms of which 4 ms to minimize.
[2025-05-29 19:52:06] [INFO ] Deduced a trap composed of 27 places in 267 ms of which 3 ms to minimize.
[2025-05-29 19:52:06] [INFO ] Deduced a trap composed of 26 places in 262 ms of which 4 ms to minimize.
[2025-05-29 19:52:07] [INFO ] Deduced a trap composed of 28 places in 196 ms of which 3 ms to minimize.
[2025-05-29 19:52:07] [INFO ] Deduced a trap composed of 25 places in 207 ms of which 3 ms to minimize.
[2025-05-29 19:52:07] [INFO ] Deduced a trap composed of 25 places in 176 ms of which 2 ms to minimize.
[2025-05-29 19:52:07] [INFO ] Deduced a trap composed of 27 places in 153 ms of which 3 ms to minimize.
[2025-05-29 19:52:07] [INFO ] Deduced a trap composed of 27 places in 140 ms of which 3 ms to minimize.
[2025-05-29 19:52:07] [INFO ] Deduced a trap composed of 28 places in 135 ms of which 2 ms to minimize.
[2025-05-29 19:52:08] [INFO ] Deduced a trap composed of 27 places in 150 ms of which 2 ms to minimize.
[2025-05-29 19:52:08] [INFO ] Deduced a trap composed of 26 places in 154 ms of which 2 ms to minimize.
[2025-05-29 19:52:08] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/530 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1654 unsolved
[2025-05-29 19:52:09] [INFO ] Deduced a trap composed of 27 places in 395 ms of which 5 ms to minimize.
[2025-05-29 19:52:10] [INFO ] Deduced a trap composed of 25 places in 393 ms of which 5 ms to minimize.
[2025-05-29 19:52:10] [INFO ] Deduced a trap composed of 29 places in 372 ms of which 4 ms to minimize.
[2025-05-29 19:52:10] [INFO ] Deduced a trap composed of 25 places in 378 ms of which 5 ms to minimize.
[2025-05-29 19:52:11] [INFO ] Deduced a trap composed of 36 places in 369 ms of which 4 ms to minimize.
[2025-05-29 19:52:11] [INFO ] Deduced a trap composed of 36 places in 303 ms of which 4 ms to minimize.
[2025-05-29 19:52:11] [INFO ] Deduced a trap composed of 25 places in 334 ms of which 4 ms to minimize.
[2025-05-29 19:52:12] [INFO ] Deduced a trap composed of 26 places in 334 ms of which 4 ms to minimize.
[2025-05-29 19:52:12] [INFO ] Deduced a trap composed of 27 places in 337 ms of which 4 ms to minimize.
[2025-05-29 19:52:12] [INFO ] Deduced a trap composed of 28 places in 226 ms of which 3 ms to minimize.
[2025-05-29 19:52:13] [INFO ] Deduced a trap composed of 25 places in 327 ms of which 4 ms to minimize.
[2025-05-29 19:52:13] [INFO ] Deduced a trap composed of 27 places in 240 ms of which 3 ms to minimize.
[2025-05-29 19:52:13] [INFO ] Deduced a trap composed of 26 places in 321 ms of which 3 ms to minimize.
[2025-05-29 19:52:14] [INFO ] Deduced a trap composed of 27 places in 307 ms of which 5 ms to minimize.
[2025-05-29 19:52:14] [INFO ] Deduced a trap composed of 27 places in 404 ms of which 4 ms to minimize.
[2025-05-29 19:52:14] [INFO ] Deduced a trap composed of 27 places in 271 ms of which 3 ms to minimize.
[2025-05-29 19:52:14] [INFO ] Deduced a trap composed of 26 places in 236 ms of which 3 ms to minimize.
[2025-05-29 19:52:15] [INFO ] Deduced a trap composed of 28 places in 225 ms of which 3 ms to minimize.
[2025-05-29 19:52:15] [INFO ] Deduced a trap composed of 26 places in 157 ms of which 3 ms to minimize.
[2025-05-29 19:52:15] [INFO ] Deduced a trap composed of 30 places in 193 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/530 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 1654 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 530/2205 variables, and 142 constraints, problems are : Problem set: 0 solved, 1654 unsolved in 30063 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/531 constraints, ReadFeed: 0/1582 constraints, PredecessorRefiner: 0/1654 constraints, Known Traps: 120/120 constraints]
After SMT, in 61185ms problems are : Problem set: 0 solved, 1654 unsolved
Search for dead transitions found 0 dead transitions in 61219ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69052 ms. Remains : 531/531 places, 1674/1674 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20]
Starting property specific reduction for CANInsertWithFailure-PT-020-UpperBounds-01
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[20]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[20]
[2025-05-29 19:52:16] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[20]
RANDOM walk for 10000 steps (104 resets) in 53 ms. (185 steps per ms)
BEST_FIRST walk for 10001 steps (5 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[20]
[2025-05-29 19:52:16] [INFO ] Invariant cache hit.
[2025-05-29 19:52:16] [INFO ] [Real]Absence check using 20 positive place invariants in 21 ms returned sat
[2025-05-29 19:52:16] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 8 ms returned sat
[2025-05-29 19:52:16] [INFO ] [Real]Absence check using state equation in 571 ms returned sat
[2025-05-29 19:52:16] [INFO ] State equation strengthened by 1582 read => feed constraints.
[2025-05-29 19:52:17] [INFO ] [Real]Added 1582 Read/Feed constraints in 190 ms returned sat
[2025-05-29 19:52:17] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:52:17] [INFO ] [Nat]Absence check using 20 positive place invariants in 14 ms returned sat
[2025-05-29 19:52:17] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2025-05-29 19:52:17] [INFO ] [Nat]Absence check using state equation in 575 ms returned sat
[2025-05-29 19:52:18] [INFO ] [Nat]Added 1582 Read/Feed constraints in 205 ms returned sat
[2025-05-29 19:52:18] [INFO ] Computed and/alt/rep : 1160/3017/1160 causal constraints (skipped 494 transitions) in 127 ms.
[2025-05-29 19:52:18] [INFO ] Added : 6 causal constraints over 2 iterations in 434 ms. Result :sat
Minimization took 599 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[20]
Support contains 1 out of 531 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 531/531 places, 1674/1674 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 524 transition count 1667
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 524 transition count 1666
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 16 place count 523 transition count 1666
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 24 place count 523 transition count 1666
Applied a total of 24 rules in 118 ms. Remains 523 /531 variables (removed 8) and now considering 1666/1674 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 523/531 places, 1666/1674 transitions.
// Phase 1: matrix 1666 rows 523 cols
[2025-05-29 19:52:19] [INFO ] Computed 22 invariants in 21 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[20]
RANDOM walk for 1000000 steps (10519 resets) in 5195 ms. (192 steps per ms)
BEST_FIRST walk for 1000001 steps (479 resets) in 955 ms. (1046 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[20]
[2025-05-29 19:52:25] [INFO ] Invariant cache hit.
[2025-05-29 19:52:25] [INFO ] [Real]Absence check using 20 positive place invariants in 13 ms returned sat
[2025-05-29 19:52:25] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2025-05-29 19:52:26] [INFO ] [Real]Absence check using state equation in 435 ms returned sat
[2025-05-29 19:52:26] [INFO ] State equation strengthened by 1604 read => feed constraints.
[2025-05-29 19:52:26] [INFO ] [Real]Added 1604 Read/Feed constraints in 185 ms returned sat
[2025-05-29 19:52:26] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:52:26] [INFO ] [Nat]Absence check using 20 positive place invariants in 14 ms returned sat
[2025-05-29 19:52:26] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2025-05-29 19:52:26] [INFO ] [Nat]Absence check using state equation in 459 ms returned sat
[2025-05-29 19:52:27] [INFO ] [Nat]Added 1604 Read/Feed constraints in 204 ms returned sat
[2025-05-29 19:52:27] [INFO ] Computed and/alt/rep : 1152/3047/1152 causal constraints (skipped 494 transitions) in 124 ms.
[2025-05-29 19:52:27] [INFO ] Added : 8 causal constraints over 2 iterations in 459 ms. Result :sat
Minimization took 3866 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[20]
Support contains 1 out of 523 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1666/1666 transitions.
Applied a total of 0 rules in 34 ms. Remains 523 /523 variables (removed 0) and now considering 1666/1666 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 523/523 places, 1666/1666 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1666/1666 transitions.
Applied a total of 0 rules in 29 ms. Remains 523 /523 variables (removed 0) and now considering 1666/1666 (removed 0) transitions.
[2025-05-29 19:52:31] [INFO ] Invariant cache hit.
[2025-05-29 19:52:32] [INFO ] Implicit Places using invariants in 1001 ms returned []
[2025-05-29 19:52:32] [INFO ] Invariant cache hit.
[2025-05-29 19:52:33] [INFO ] State equation strengthened by 1604 read => feed constraints.
[2025-05-29 19:52:39] [INFO ] Implicit Places using invariants and state equation in 7341 ms returned []
Implicit Place search using SMT with State Equation took 8350 ms to find 0 implicit places.
[2025-05-29 19:52:40] [INFO ] Redundant transitions in 146 ms returned []
Running 1646 sub problems to find dead transitions.
[2025-05-29 19:52:40] [INFO ] Invariant cache hit.
[2025-05-29 19:52:40] [INFO ] State equation strengthened by 1604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/522 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/522 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
[2025-05-29 19:53:05] [INFO ] Deduced a trap composed of 26 places in 238 ms of which 3 ms to minimize.
[2025-05-29 19:53:05] [INFO ] Deduced a trap composed of 25 places in 360 ms of which 6 ms to minimize.
[2025-05-29 19:53:05] [INFO ] Deduced a trap composed of 25 places in 342 ms of which 6 ms to minimize.
[2025-05-29 19:53:06] [INFO ] Deduced a trap composed of 26 places in 243 ms of which 4 ms to minimize.
[2025-05-29 19:53:06] [INFO ] Deduced a trap composed of 26 places in 309 ms of which 5 ms to minimize.
[2025-05-29 19:53:06] [INFO ] Deduced a trap composed of 25 places in 353 ms of which 5 ms to minimize.
[2025-05-29 19:53:07] [INFO ] Deduced a trap composed of 25 places in 307 ms of which 4 ms to minimize.
[2025-05-29 19:53:07] [INFO ] Deduced a trap composed of 29 places in 282 ms of which 4 ms to minimize.
[2025-05-29 19:53:07] [INFO ] Deduced a trap composed of 26 places in 185 ms of which 2 ms to minimize.
[2025-05-29 19:53:07] [INFO ] Deduced a trap composed of 25 places in 276 ms of which 4 ms to minimize.
[2025-05-29 19:53:08] [INFO ] Deduced a trap composed of 26 places in 262 ms of which 4 ms to minimize.
[2025-05-29 19:53:08] [INFO ] Deduced a trap composed of 25 places in 269 ms of which 4 ms to minimize.
[2025-05-29 19:53:08] [INFO ] Deduced a trap composed of 26 places in 198 ms of which 2 ms to minimize.
[2025-05-29 19:53:08] [INFO ] Deduced a trap composed of 27 places in 179 ms of which 2 ms to minimize.
[2025-05-29 19:53:09] [INFO ] Deduced a trap composed of 25 places in 216 ms of which 4 ms to minimize.
[2025-05-29 19:53:09] [INFO ] Deduced a trap composed of 28 places in 133 ms of which 2 ms to minimize.
[2025-05-29 19:53:09] [INFO ] Deduced a trap composed of 27 places in 192 ms of which 4 ms to minimize.
[2025-05-29 19:53:09] [INFO ] Deduced a trap composed of 25 places in 192 ms of which 3 ms to minimize.
[2025-05-29 19:53:09] [INFO ] Deduced a trap composed of 26 places in 173 ms of which 3 ms to minimize.
[2025-05-29 19:53:10] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/522 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
[2025-05-29 19:53:10] [INFO ] Deduced a trap composed of 26 places in 149 ms of which 3 ms to minimize.
[2025-05-29 19:53:11] [INFO ] Deduced a trap composed of 25 places in 169 ms of which 3 ms to minimize.
[2025-05-29 19:53:11] [INFO ] Deduced a trap composed of 28 places in 144 ms of which 2 ms to minimize.
SMT process timed out in 31024ms, After SMT, problems are : Problem set: 0 solved, 1646 unsolved
Search for dead transitions found 0 dead transitions in 31047ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39584 ms. Remains : 523/523 places, 1666/1666 transitions.
[2025-05-29 19:53:11] [INFO ] Flatten gal took : 69 ms
[2025-05-29 19:53:11] [INFO ] Flatten gal took : 65 ms
[2025-05-29 19:53:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality432234588410000269.gal : 17 ms
[2025-05-29 19:53:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality87241766497402972.prop : 0 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/ReachabilityCardinality432234588410000269.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality87241766497402972.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 ...325
RANDOM walk for 40000 steps (420 resets) in 743 ms. (53 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (17 resets) in 81 ms. (487 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (16 resets) in 85 ms. (465 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality87241766497402972.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 147
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :147 after 150
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :150 after 151
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :151 after 155
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :155 after 156
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :156 after 157
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :157 after 163
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :163 after 174
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :174 after 199
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :199 after 235
Interrupted probabilistic random walk after 287748 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :0 out of 2
Probabilistic random walk after 287748 steps, saw 40915 distinct states, run finished after 3001 ms. (steps per millisecond=95 ) properties seen :0
[2025-05-29 19:53:14] [INFO ] Invariant cache hit.
[2025-05-29 19:53:14] [INFO ] State equation strengthened by 1604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 480/481 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-29 19:53:14] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 2 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 38/519 variables, 19/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/519 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/521 variables, 2/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :235 after 319
[2025-05-29 19:53:15] [INFO ] Deduced a trap composed of 25 places in 564 ms of which 8 ms to minimize.
[2025-05-29 19:53:15] [INFO ] Deduced a trap composed of 32 places in 358 ms of which 5 ms to minimize.
[2025-05-29 19:53:16] [INFO ] Deduced a trap composed of 31 places in 343 ms of which 5 ms to minimize.
[2025-05-29 19:53:16] [INFO ] Deduced a trap composed of 33 places in 348 ms of which 5 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
[2025-05-29 19:53:16] [INFO ] Deduced a trap composed of 32 places in 302 ms of which 4 ms to minimize.
SDD size :319 after 452
[2025-05-29 19:53:17] [INFO ] Deduced a trap composed of 29 places in 394 ms of which 4 ms to minimize.
[2025-05-29 19:53:17] [INFO ] Deduced a trap composed of 25 places in 331 ms of which 5 ms to minimize.
[2025-05-29 19:53:18] [INFO ] Deduced a trap composed of 27 places in 410 ms of which 4 ms to minimize.
[2025-05-29 19:53:18] [INFO ] Deduced a trap composed of 30 places in 381 ms of which 4 ms to minimize.
[2025-05-29 19:53:18] [INFO ] Deduced a trap composed of 29 places in 390 ms of which 4 ms to minimize.
[2025-05-29 19:53:19] [INFO ] Deduced a trap composed of 28 places in 354 ms of which 4 ms to minimize.
[2025-05-29 19:53:19] [INFO ] Deduced a trap composed of 29 places in 293 ms of which 3 ms to minimize.
[2025-05-29 19:53:19] [INFO ] Deduced a trap composed of 30 places in 253 ms of which 3 ms to minimize.
SMT process timed out in 5287ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 523 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1666/1666 transitions.
Applied a total of 0 rules in 30 ms. Remains 523 /523 variables (removed 0) and now considering 1666/1666 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 523/523 places, 1666/1666 transitions.
RANDOM walk for 40000 steps (420 resets) in 342 ms. (116 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (16 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :452 after 7464
Interrupted probabilistic random walk after 399269 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :0 out of 1
Probabilistic random walk after 399269 steps, saw 53123 distinct states, run finished after 3001 ms. (steps per millisecond=133 ) properties seen :0
[2025-05-29 19:53:22] [INFO ] Invariant cache hit.
[2025-05-29 19:53:23] [INFO ] State equation strengthened by 1604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 480/481 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 19:53:23] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 0 ms to minimize.
[2025-05-29 19:53:23] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2025-05-29 19:53:23] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2025-05-29 19:53:23] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2025-05-29 19:53:23] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2025-05-29 19:53:23] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2025-05-29 19:53:23] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2025-05-29 19:53:23] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 2 ms to minimize.
[2025-05-29 19:53:23] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
[2025-05-29 19:53:23] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
[2025-05-29 19:53:23] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2025-05-29 19:53:23] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 0 ms to minimize.
[2025-05-29 19:53:23] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
[2025-05-29 19:53:23] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 2 ms to minimize.
[2025-05-29 19:53:23] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 2 ms to minimize.
[2025-05-29 19:53:23] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 38/519 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/519 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/521 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/521 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1666/2187 variables, 521/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2187 variables, 1604/2163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2187 variables, 0/2163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/2189 variables, 2/2165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2189 variables, 0/2165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/2189 variables, 0/2165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2189/2189 variables, and 2165 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1773 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 523/523 constraints, ReadFeed: 1604/1604 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 480/481 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 19:53:24] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2025-05-29 19:53:24] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2025-05-29 19:53:25] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/481 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 38/519 variables, 19/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/519 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/521 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 19:53:25] [INFO ] Deduced a trap composed of 25 places in 549 ms of which 5 ms to minimize.
[2025-05-29 19:53:26] [INFO ] Deduced a trap composed of 25 places in 548 ms of which 5 ms to minimize.
[2025-05-29 19:53:26] [INFO ] Deduced a trap composed of 25 places in 572 ms of which 5 ms to minimize.
[2025-05-29 19:53:27] [INFO ] Deduced a trap composed of 25 places in 572 ms of which 5 ms to minimize.
[2025-05-29 19:53:28] [INFO ] Deduced a trap composed of 29 places in 584 ms of which 5 ms to minimize.
[2025-05-29 19:53:28] [INFO ] Deduced a trap composed of 26 places in 505 ms of which 5 ms to minimize.
[2025-05-29 19:53:29] [INFO ] Deduced a trap composed of 25 places in 538 ms of which 5 ms to minimize.
[2025-05-29 19:53:29] [INFO ] Deduced a trap composed of 26 places in 566 ms of which 5 ms to minimize.
[2025-05-29 19:53:30] [INFO ] Deduced a trap composed of 25 places in 595 ms of which 5 ms to minimize.
[2025-05-29 19:53:30] [INFO ] Deduced a trap composed of 32 places in 459 ms of which 6 ms to minimize.
[2025-05-29 19:53:31] [INFO ] Deduced a trap composed of 29 places in 598 ms of which 6 ms to minimize.
[2025-05-29 19:53:31] [INFO ] Deduced a trap composed of 26 places in 557 ms of which 8 ms to minimize.
[2025-05-29 19:53:32] [INFO ] Deduced a trap composed of 26 places in 514 ms of which 7 ms to minimize.
[2025-05-29 19:53:33] [INFO ] Deduced a trap composed of 28 places in 510 ms of which 5 ms to minimize.
[2025-05-29 19:53:33] [INFO ] Deduced a trap composed of 26 places in 502 ms of which 5 ms to minimize.
[2025-05-29 19:53:34] [INFO ] Deduced a trap composed of 24 places in 494 ms of which 5 ms to minimize.
[2025-05-29 19:53:34] [INFO ] Deduced a trap composed of 25 places in 494 ms of which 5 ms to minimize.
[2025-05-29 19:53:35] [INFO ] Deduced a trap composed of 31 places in 492 ms of which 5 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :7464 after 9175
[2025-05-29 19:53:35] [INFO ] Deduced a trap composed of 27 places in 471 ms of which 5 ms to minimize.
[2025-05-29 19:53:36] [INFO ] Deduced a trap composed of 25 places in 508 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/521 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/521 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1666/2187 variables, 521/582 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2187 variables, 1604/2186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2187 variables, 1/2187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2187 variables, 0/2187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/2189 variables, 2/2189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2189 variables, 0/2189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/2189 variables, 0/2189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2189/2189 variables, and 2189 constraints, problems are : Problem set: 0 solved, 1 unsolved in 12384 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 523/523 constraints, ReadFeed: 1604/1604 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 39/39 constraints]
After SMT, in 14185ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 523 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1666/1666 transitions.
Applied a total of 0 rules in 48 ms. Remains 523 /523 variables (removed 0) and now considering 1666/1666 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 523/523 places, 1666/1666 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1666/1666 transitions.
Applied a total of 0 rules in 47 ms. Remains 523 /523 variables (removed 0) and now considering 1666/1666 (removed 0) transitions.
[2025-05-29 19:53:37] [INFO ] Invariant cache hit.
[2025-05-29 19:53:37] [INFO ] Implicit Places using invariants in 692 ms returned []
[2025-05-29 19:53:37] [INFO ] Invariant cache hit.
[2025-05-29 19:53:38] [INFO ] State equation strengthened by 1604 read => feed constraints.
[2025-05-29 19:53:45] [INFO ] Implicit Places using invariants and state equation in 7098 ms returned []
Implicit Place search using SMT with State Equation took 7796 ms to find 0 implicit places.
[2025-05-29 19:53:45] [INFO ] Redundant transitions in 90 ms returned []
Running 1646 sub problems to find dead transitions.
[2025-05-29 19:53:45] [INFO ] Invariant cache hit.
[2025-05-29 19:53:45] [INFO ] State equation strengthened by 1604 read => feed constraints.
Detected timeout of ITS tools.
[2025-05-29 19:54:01] [INFO ] Flatten gal took : 55 ms
[2025-05-29 19:54:01] [INFO ] Applying decomposition
[2025-05-29 19:54:01] [INFO ] Flatten gal took : 56 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/graph8636721521845314330.txt' '-o' '/tmp/graph8636721521845314330.bin' '-w' '/tmp/graph8636721521845314330.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8636721521845314330.bin' '-l' '-1' '-v' '-w' '/tmp/graph8636721521845314330.weights' '-q' '0' '-e' '0.001'
[2025-05-29 19:54:01] [INFO ] Decomposing Gal with order
[2025-05-29 19:54:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 19:54:01] [INFO ] Removed a total of 1287 redundant transitions.
[2025-05-29 19:54:01] [INFO ] Flatten gal took : 142 ms
[2025-05-29 19:54:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 1500 labels/synchronizations in 94 ms.
[2025-05-29 19:54:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6526586162557809933.gal : 26 ms
[2025-05-29 19:54:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5527412844296540769.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/ReachabilityCardinality6526586162557809933.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5527412844296540769.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/ReachabilityCardinality5527412844296540769.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 61
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :61 after 61
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :61 after 61
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :61 after 61
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :61 after 61
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :61 after 61
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :61 after 61
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :61 after 74
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :74 after 3529
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3529 after 134316
At refinement iteration 0 (INCLUDED_ONLY) 0/522 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/522 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
[2025-05-29 19:54:07] [INFO ] Deduced a trap composed of 26 places in 335 ms of which 5 ms to minimize.
[2025-05-29 19:54:07] [INFO ] Deduced a trap composed of 25 places in 354 ms of which 5 ms to minimize.
[2025-05-29 19:54:07] [INFO ] Deduced a trap composed of 25 places in 346 ms of which 5 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :134316 after 4.4308e+06
[2025-05-29 19:54:07] [INFO ] Deduced a trap composed of 26 places in 227 ms of which 4 ms to minimize.
[2025-05-29 19:54:08] [INFO ] Deduced a trap composed of 26 places in 313 ms of which 5 ms to minimize.
[2025-05-29 19:54:08] [INFO ] Deduced a trap composed of 25 places in 345 ms of which 5 ms to minimize.
[2025-05-29 19:54:08] [INFO ] Deduced a trap composed of 25 places in 324 ms of which 4 ms to minimize.
[2025-05-29 19:54:09] [INFO ] Deduced a trap composed of 29 places in 279 ms of which 4 ms to minimize.
[2025-05-29 19:54:09] [INFO ] Deduced a trap composed of 26 places in 251 ms of which 4 ms to minimize.
[2025-05-29 19:54:09] [INFO ] Deduced a trap composed of 25 places in 276 ms of which 4 ms to minimize.
[2025-05-29 19:54:10] [INFO ] Deduced a trap composed of 26 places in 250 ms of which 3 ms to minimize.
[2025-05-29 19:54:10] [INFO ] Deduced a trap composed of 25 places in 247 ms of which 4 ms to minimize.
[2025-05-29 19:54:10] [INFO ] Deduced a trap composed of 26 places in 239 ms of which 4 ms to minimize.
[2025-05-29 19:54:10] [INFO ] Deduced a trap composed of 27 places in 222 ms of which 3 ms to minimize.
[2025-05-29 19:54:11] [INFO ] Deduced a trap composed of 25 places in 187 ms of which 3 ms to minimize.
[2025-05-29 19:54:11] [INFO ] Deduced a trap composed of 28 places in 163 ms of which 3 ms to minimize.
[2025-05-29 19:54:11] [INFO ] Deduced a trap composed of 27 places in 160 ms of which 3 ms to minimize.
[2025-05-29 19:54:11] [INFO ] Deduced a trap composed of 25 places in 165 ms of which 2 ms to minimize.
[2025-05-29 19:54:11] [INFO ] Deduced a trap composed of 26 places in 145 ms of which 2 ms to minimize.
[2025-05-29 19:54:11] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/522 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
[2025-05-29 19:54:12] [INFO ] Deduced a trap composed of 26 places in 234 ms of which 4 ms to minimize.
[2025-05-29 19:54:13] [INFO ] Deduced a trap composed of 25 places in 198 ms of which 3 ms to minimize.
[2025-05-29 19:54:13] [INFO ] Deduced a trap composed of 28 places in 149 ms of which 3 ms to minimize.
[2025-05-29 19:54:13] [INFO ] Deduced a trap composed of 28 places in 175 ms of which 3 ms to minimize.
[2025-05-29 19:54:13] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 3 ms to minimize.
[2025-05-29 19:54:13] [INFO ] Deduced a trap composed of 25 places in 126 ms of which 2 ms to minimize.
[2025-05-29 19:54:13] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 2 ms to minimize.
[2025-05-29 19:54:14] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 2 ms to minimize.
[2025-05-29 19:54:14] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 2 ms to minimize.
[2025-05-29 19:54:14] [INFO ] Deduced a trap composed of 22 places in 430 ms of which 6 ms to minimize.
[2025-05-29 19:54:15] [INFO ] Deduced a trap composed of 2 places in 410 ms of which 6 ms to minimize.
[2025-05-29 19:54:15] [INFO ] Deduced a trap composed of 22 places in 378 ms of which 5 ms to minimize.
[2025-05-29 19:54:15] [INFO ] Deduced a trap composed of 22 places in 344 ms of which 4 ms to minimize.
[2025-05-29 19:54:16] [INFO ] Deduced a trap composed of 2 places in 306 ms of which 4 ms to minimize.
[2025-05-29 19:54:16] [INFO ] Deduced a trap composed of 2 places in 302 ms of which 4 ms to minimize.
SMT process timed out in 31220ms, After SMT, problems are : Problem set: 0 solved, 1646 unsolved
Search for dead transitions found 0 dead transitions in 31256ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39203 ms. Remains : 523/523 places, 1666/1666 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1543 edges and 523 vertex of which 439 / 523 are part of one of the 2 SCC in 6 ms
Free SCC test removed 437 places
Drop transitions (Empty/Sink Transition effects.) removed 1165 transitions
Ensure Unique test removed 412 transitions
Reduce isomorphic transitions removed 1577 transitions.
Graph (complete) has 211 edges and 86 vertex of which 25 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.0 ms
Discarding 61 places :
Also discarding 19 output transitions
Drop transitions (Output transitions of discarded places.) removed 19 transitions
Drop transitions (Empty/Sink Transition effects.) removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 25 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 24 transition count 28
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 63 place count 6 transition count 10
Iterating global reduction 2 with 18 rules applied. Total rules applied 81 place count 6 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 83 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 86 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 4 transition count 5
Applied a total of 87 rules in 27 ms. Remains 4 /523 variables (removed 519) and now considering 5/1666 (removed 1661) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 4 cols
[2025-05-29 19:54:16] [INFO ] Computed 0 invariants in 0 ms
[2025-05-29 19:54:16] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-29 19:54:16] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-29 19:54:16] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-29 19:54:16] [INFO ] After 24ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-05-29 19:54:16] [INFO ] Flatten gal took : 1 ms
[2025-05-29 19:54:16] [INFO ] Flatten gal took : 0 ms
[2025-05-29 19:54:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7635892713365632349.gal : 1 ms
[2025-05-29 19:54:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8329054418601441534.prop : 0 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/ReachabilityCardinality7635892713365632349.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8329054418601441534.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/ReachabilityCardinality8329054418601441534.prop.
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 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,6,0.002778,3512,2,7,6,33,6,0,21,18,0
Total reachable state count : 6

Verifying 1 reachability properties.
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,0.003114,3884,2,5,6,33,7,0,24,18,0
Over-approximation ignoring read arcs solved 0 properties in 94 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[20]
Ending property specific reduction for CANInsertWithFailure-PT-020-UpperBounds-01 in 120490 ms.
Starting property specific reduction for CANInsertWithFailure-PT-020-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[20]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[20]
// Phase 1: matrix 1674 rows 531 cols
[2025-05-29 19:54:16] [INFO ] Computed 22 invariants in 28 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[20]
RANDOM walk for 10000 steps (107 resets) in 71 ms. (138 steps per ms)
BEST_FIRST walk for 10001 steps (5 resets) in 13 ms. (714 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[20]
[2025-05-29 19:54:16] [INFO ] Invariant cache hit.
[2025-05-29 19:54:16] [INFO ] [Real]Absence check using 20 positive place invariants in 13 ms returned sat
[2025-05-29 19:54:16] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2025-05-29 19:54:17] [INFO ] [Real]Absence check using state equation in 495 ms returned sat
[2025-05-29 19:54:17] [INFO ] State equation strengthened by 1582 read => feed constraints.
[2025-05-29 19:54:17] [INFO ] [Real]Added 1582 Read/Feed constraints in 269 ms returned sat
[2025-05-29 19:54:17] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:54:17] [INFO ] [Nat]Absence check using 20 positive place invariants in 16 ms returned sat
[2025-05-29 19:54:17] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2025-05-29 19:54:18] [INFO ] [Nat]Absence check using state equation in 441 ms returned sat
[2025-05-29 19:54:18] [INFO ] [Nat]Added 1582 Read/Feed constraints in 222 ms returned sat
[2025-05-29 19:54:18] [INFO ] Computed and/alt/rep : 1160/3017/1160 causal constraints (skipped 494 transitions) in 121 ms.
[2025-05-29 19:54:18] [INFO ] Added : 10 causal constraints over 2 iterations in 404 ms. Result :sat
Minimization took 569 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[20]
Support contains 1 out of 531 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 531/531 places, 1674/1674 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 523 transition count 1666
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 22 place count 523 transition count 1666
Applied a total of 22 rules in 101 ms. Remains 523 /531 variables (removed 8) and now considering 1666/1674 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 523/531 places, 1666/1674 transitions.
// Phase 1: matrix 1666 rows 523 cols
[2025-05-29 19:54:19] [INFO ] Computed 22 invariants in 19 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[20]
RANDOM walk for 1000000 steps (10535 resets) in 5552 ms. (180 steps per ms)
BEST_FIRST walk for 1000001 steps (478 resets) in 978 ms. (1021 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[20]
[2025-05-29 19:54:26] [INFO ] Invariant cache hit.
[2025-05-29 19:54:26] [INFO ] [Real]Absence check using 20 positive place invariants in 13 ms returned sat
[2025-05-29 19:54:26] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2025-05-29 19:54:26] [INFO ] [Real]Absence check using state equation in 468 ms returned sat
[2025-05-29 19:54:26] [INFO ] State equation strengthened by 1604 read => feed constraints.
[2025-05-29 19:54:27] [INFO ] [Real]Added 1604 Read/Feed constraints in 197 ms returned sat
[2025-05-29 19:54:27] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:54:27] [INFO ] [Nat]Absence check using 20 positive place invariants in 14 ms returned sat
[2025-05-29 19:54:27] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2025-05-29 19:54:27] [INFO ] [Nat]Absence check using state equation in 456 ms returned sat
[2025-05-29 19:54:27] [INFO ] [Nat]Added 1604 Read/Feed constraints in 226 ms returned sat
[2025-05-29 19:54:28] [INFO ] Computed and/alt/rep : 1152/3051/1152 causal constraints (skipped 494 transitions) in 147 ms.
[2025-05-29 19:54:28] [INFO ] Added : 9 causal constraints over 2 iterations in 546 ms. Result :sat
Minimization took 4503 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[20]
Support contains 1 out of 523 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1666/1666 transitions.
Applied a total of 0 rules in 55 ms. Remains 523 /523 variables (removed 0) and now considering 1666/1666 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 523/523 places, 1666/1666 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1666/1666 transitions.
Applied a total of 0 rules in 60 ms. Remains 523 /523 variables (removed 0) and now considering 1666/1666 (removed 0) transitions.
[2025-05-29 19:54:33] [INFO ] Invariant cache hit.
[2025-05-29 19:54:34] [INFO ] Implicit Places using invariants in 1056 ms returned []
[2025-05-29 19:54:34] [INFO ] Invariant cache hit.
[2025-05-29 19:54:34] [INFO ] State equation strengthened by 1604 read => feed constraints.
[2025-05-29 19:54:43] [INFO ] Implicit Places using invariants and state equation in 8842 ms returned []
Implicit Place search using SMT with State Equation took 9901 ms to find 0 implicit places.
[2025-05-29 19:54:43] [INFO ] Redundant transitions in 60 ms returned []
Running 1646 sub problems to find dead transitions.
[2025-05-29 19:54:43] [INFO ] Invariant cache hit.
[2025-05-29 19:54:43] [INFO ] State equation strengthened by 1604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/522 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/522 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
[2025-05-29 19:55:06] [INFO ] Deduced a trap composed of 24 places in 252 ms of which 4 ms to minimize.
[2025-05-29 19:55:06] [INFO ] Deduced a trap composed of 26 places in 233 ms of which 3 ms to minimize.
[2025-05-29 19:55:06] [INFO ] Deduced a trap composed of 34 places in 233 ms of which 3 ms to minimize.
[2025-05-29 19:55:07] [INFO ] Deduced a trap composed of 26 places in 239 ms of which 3 ms to minimize.
[2025-05-29 19:55:07] [INFO ] Deduced a trap composed of 25 places in 222 ms of which 3 ms to minimize.
[2025-05-29 19:55:07] [INFO ] Deduced a trap composed of 26 places in 194 ms of which 3 ms to minimize.
[2025-05-29 19:55:07] [INFO ] Deduced a trap composed of 26 places in 224 ms of which 3 ms to minimize.
[2025-05-29 19:55:08] [INFO ] Deduced a trap composed of 25 places in 233 ms of which 3 ms to minimize.
[2025-05-29 19:55:08] [INFO ] Deduced a trap composed of 26 places in 211 ms of which 3 ms to minimize.
[2025-05-29 19:55:08] [INFO ] Deduced a trap composed of 27 places in 185 ms of which 2 ms to minimize.
[2025-05-29 19:55:08] [INFO ] Deduced a trap composed of 25 places in 169 ms of which 2 ms to minimize.
[2025-05-29 19:55:08] [INFO ] Deduced a trap composed of 27 places in 154 ms of which 3 ms to minimize.
[2025-05-29 19:55:08] [INFO ] Deduced a trap composed of 28 places in 146 ms of which 3 ms to minimize.
[2025-05-29 19:55:09] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 2 ms to minimize.
[2025-05-29 19:55:09] [INFO ] Deduced a trap composed of 28 places in 137 ms of which 2 ms to minimize.
[2025-05-29 19:55:09] [INFO ] Deduced a trap composed of 25 places in 154 ms of which 2 ms to minimize.
[2025-05-29 19:55:09] [INFO ] Deduced a trap composed of 26 places in 166 ms of which 2 ms to minimize.
[2025-05-29 19:55:09] [INFO ] Deduced a trap composed of 27 places in 154 ms of which 2 ms to minimize.
[2025-05-29 19:55:09] [INFO ] Deduced a trap composed of 28 places in 159 ms of which 2 ms to minimize.
[2025-05-29 19:55:10] [INFO ] Deduced a trap composed of 28 places in 177 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/522 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
[2025-05-29 19:55:10] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 2 ms to minimize.
[2025-05-29 19:55:11] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 2 ms to minimize.
[2025-05-29 19:55:11] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 2 ms to minimize.
[2025-05-29 19:55:11] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 2 ms to minimize.
[2025-05-29 19:55:11] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 2 ms to minimize.
[2025-05-29 19:55:11] [INFO ] Deduced a trap composed of 2 places in 398 ms of which 4 ms to minimize.
[2025-05-29 19:55:12] [INFO ] Deduced a trap composed of 3 places in 384 ms of which 4 ms to minimize.
[2025-05-29 19:55:12] [INFO ] Deduced a trap composed of 27 places in 408 ms of which 4 ms to minimize.
[2025-05-29 19:55:13] [INFO ] Deduced a trap composed of 32 places in 378 ms of which 4 ms to minimize.
[2025-05-29 19:55:13] [INFO ] Deduced a trap composed of 24 places in 279 ms of which 4 ms to minimize.
[2025-05-29 19:55:13] [INFO ] Deduced a trap composed of 29 places in 398 ms of which 5 ms to minimize.
[2025-05-29 19:55:14] [INFO ] Deduced a trap composed of 35 places in 362 ms of which 4 ms to minimize.
[2025-05-29 19:55:14] [INFO ] Deduced a trap composed of 26 places in 368 ms of which 4 ms to minimize.
SMT process timed out in 31481ms, After SMT, problems are : Problem set: 0 solved, 1646 unsolved
Search for dead transitions found 0 dead transitions in 31510ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41550 ms. Remains : 523/523 places, 1666/1666 transitions.
[2025-05-29 19:55:14] [INFO ] Flatten gal took : 63 ms
[2025-05-29 19:55:14] [INFO ] Flatten gal took : 109 ms
[2025-05-29 19:55:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8040501873343800886.gal : 12 ms
[2025-05-29 19:55:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5445114726498345211.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/ReachabilityCardinality8040501873343800886.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5445114726498345211.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
RANDOM walk for 40000 steps (422 resets) in 666 ms. (59 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (17 resets) in 134 ms. (296 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (17 resets) in 112 ms. (354 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality5445114726498345211.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 147
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :147 after 150
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :150 after 151
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :151 after 155
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :155 after 156
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :156 after 157
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :157 after 163
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :163 after 174
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :174 after 199
Interrupted probabilistic random walk after 295611 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :0 out of 2
Probabilistic random walk after 295611 steps, saw 41914 distinct states, run finished after 3002 ms. (steps per millisecond=98 ) properties seen :0
[2025-05-29 19:55:17] [INFO ] Invariant cache hit.
[2025-05-29 19:55:17] [INFO ] State equation strengthened by 1604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 480/481 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-29 19:55:18] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :199 after 235
At refinement iteration 4 (OVERLAPS) 38/519 variables, 19/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/519 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/521 variables, 2/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-05-29 19:55:18] [INFO ] Deduced a trap composed of 32 places in 338 ms of which 4 ms to minimize.
[2025-05-29 19:55:18] [INFO ] Deduced a trap composed of 34 places in 332 ms of which 5 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :235 after 319
[2025-05-29 19:55:19] [INFO ] Deduced a trap composed of 31 places in 523 ms of which 6 ms to minimize.
[2025-05-29 19:55:19] [INFO ] Deduced a trap composed of 31 places in 421 ms of which 5 ms to minimize.
[2025-05-29 19:55:20] [INFO ] Deduced a trap composed of 31 places in 416 ms of which 5 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :319 after 452
[2025-05-29 19:55:20] [INFO ] Deduced a trap composed of 30 places in 400 ms of which 5 ms to minimize.
[2025-05-29 19:55:21] [INFO ] Deduced a trap composed of 31 places in 407 ms of which 5 ms to minimize.
[2025-05-29 19:55:21] [INFO ] Deduced a trap composed of 34 places in 412 ms of which 5 ms to minimize.
[2025-05-29 19:55:21] [INFO ] Deduced a trap composed of 33 places in 417 ms of which 4 ms to minimize.
[2025-05-29 19:55:22] [INFO ] Deduced a trap composed of 30 places in 310 ms of which 5 ms to minimize.
[2025-05-29 19:55:22] [INFO ] Deduced a trap composed of 25 places in 388 ms of which 5 ms to minimize.
[2025-05-29 19:55:23] [INFO ] Deduced a trap composed of 25 places in 375 ms of which 4 ms to minimize.
SMT process timed out in 5125ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 523 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1666/1666 transitions.
Applied a total of 0 rules in 59 ms. Remains 523 /523 variables (removed 0) and now considering 1666/1666 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 523/523 places, 1666/1666 transitions.
RANDOM walk for 40000 steps (423 resets) in 400 ms. (99 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (17 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 392971 steps, run timeout after 3001 ms. (steps per millisecond=130 ) properties seen :0 out of 1
Probabilistic random walk after 392971 steps, saw 52506 distinct states, run finished after 3001 ms. (steps per millisecond=130 ) properties seen :0
[2025-05-29 19:55:26] [INFO ] Invariant cache hit.
[2025-05-29 19:55:26] [INFO ] State equation strengthened by 1604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 480/481 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 19:55:26] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
[2025-05-29 19:55:26] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
[2025-05-29 19:55:26] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 1 ms to minimize.
[2025-05-29 19:55:26] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 1 ms to minimize.
[2025-05-29 19:55:26] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
[2025-05-29 19:55:26] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
[2025-05-29 19:55:26] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 1 ms to minimize.
[2025-05-29 19:55:26] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 0 ms to minimize.
[2025-05-29 19:55:26] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 0 ms to minimize.
[2025-05-29 19:55:26] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
[2025-05-29 19:55:26] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2025-05-29 19:55:26] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2025-05-29 19:55:26] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2025-05-29 19:55:26] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2025-05-29 19:55:26] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2025-05-29 19:55:27] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 38/519 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/519 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 16384
At refinement iteration 6 (OVERLAPS) 2/521 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/521 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD size :452 after 7492
At refinement iteration 8 (OVERLAPS) 1666/2187 variables, 521/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2187 variables, 1604/2163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2187 variables, 0/2163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/2189 variables, 2/2165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2189 variables, 0/2165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/2189 variables, 0/2165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2189/2189 variables, and 2165 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1522 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 523/523 constraints, ReadFeed: 1604/1604 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 480/481 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 19:55:27] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2025-05-29 19:55:27] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
[2025-05-29 19:55:28] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/481 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 38/519 variables, 19/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/519 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/521 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 19:55:28] [INFO ] Deduced a trap composed of 28 places in 506 ms of which 5 ms to minimize.
[2025-05-29 19:55:29] [INFO ] Deduced a trap composed of 25 places in 493 ms of which 5 ms to minimize.
[2025-05-29 19:55:29] [INFO ] Deduced a trap composed of 26 places in 489 ms of which 5 ms to minimize.
[2025-05-29 19:55:30] [INFO ] Deduced a trap composed of 25 places in 503 ms of which 5 ms to minimize.
[2025-05-29 19:55:30] [INFO ] Deduced a trap composed of 26 places in 530 ms of which 7 ms to minimize.
[2025-05-29 19:55:31] [INFO ] Deduced a trap composed of 29 places in 527 ms of which 5 ms to minimize.
[2025-05-29 19:55:31] [INFO ] Deduced a trap composed of 25 places in 461 ms of which 5 ms to minimize.
[2025-05-29 19:55:32] [INFO ] Deduced a trap composed of 32 places in 461 ms of which 5 ms to minimize.
[2025-05-29 19:55:32] [INFO ] Deduced a trap composed of 26 places in 436 ms of which 4 ms to minimize.
[2025-05-29 19:55:33] [INFO ] Deduced a trap composed of 29 places in 432 ms of which 4 ms to minimize.
[2025-05-29 19:55:33] [INFO ] Deduced a trap composed of 32 places in 433 ms of which 5 ms to minimize.
[2025-05-29 19:55:33] [INFO ] Deduced a trap composed of 25 places in 423 ms of which 4 ms to minimize.
[2025-05-29 19:55:34] [INFO ] Deduced a trap composed of 25 places in 424 ms of which 5 ms to minimize.
[2025-05-29 19:55:34] [INFO ] Deduced a trap composed of 26 places in 430 ms of which 5 ms to minimize.
[2025-05-29 19:55:35] [INFO ] Deduced a trap composed of 31 places in 431 ms of which 5 ms to minimize.
[2025-05-29 19:55:35] [INFO ] Deduced a trap composed of 25 places in 468 ms of which 5 ms to minimize.
[2025-05-29 19:55:36] [INFO ] Deduced a trap composed of 24 places in 477 ms of which 6 ms to minimize.
[2025-05-29 19:55:36] [INFO ] Deduced a trap composed of 25 places in 439 ms of which 4 ms to minimize.
[2025-05-29 19:55:37] [INFO ] Deduced a trap composed of 26 places in 438 ms of which 5 ms to minimize.
[2025-05-29 19:55:37] [INFO ] Deduced a trap composed of 32 places in 409 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/521 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 19:55:37] [INFO ] Deduced a trap composed of 34 places in 401 ms of which 5 ms to minimize.
[2025-05-29 19:55:38] [INFO ] Deduced a trap composed of 31 places in 397 ms of which 4 ms to minimize.
[2025-05-29 19:55:38] [INFO ] Deduced a trap composed of 25 places in 382 ms of which 4 ms to minimize.
[2025-05-29 19:55:39] [INFO ] Deduced a trap composed of 26 places in 344 ms of which 4 ms to minimize.
[2025-05-29 19:55:39] [INFO ] Deduced a trap composed of 25 places in 324 ms of which 4 ms to minimize.
[2025-05-29 19:55:39] [INFO ] Deduced a trap composed of 28 places in 305 ms of which 3 ms to minimize.
[2025-05-29 19:55:40] [INFO ] Deduced a trap composed of 25 places in 309 ms of which 3 ms to minimize.
[2025-05-29 19:55:40] [INFO ] Deduced a trap composed of 28 places in 287 ms of which 4 ms to minimize.
[2025-05-29 19:55:40] [INFO ] Deduced a trap composed of 25 places in 257 ms of which 3 ms to minimize.
[2025-05-29 19:55:40] [INFO ] Deduced a trap composed of 27 places in 244 ms of which 3 ms to minimize.
[2025-05-29 19:55:41] [INFO ] Deduced a trap composed of 30 places in 224 ms of which 3 ms to minimize.
[2025-05-29 19:55:41] [INFO ] Deduced a trap composed of 25 places in 188 ms of which 3 ms to minimize.
[2025-05-29 19:55:41] [INFO ] Deduced a trap composed of 30 places in 162 ms of which 3 ms to minimize.
[2025-05-29 19:55:41] [INFO ] Deduced a trap composed of 29 places in 159 ms of which 2 ms to minimize.
[2025-05-29 19:55:41] [INFO ] Deduced a trap composed of 28 places in 166 ms of which 2 ms to minimize.
[2025-05-29 19:55:42] [INFO ] Deduced a trap composed of 28 places in 161 ms of which 3 ms to minimize.
[2025-05-29 19:55:42] [INFO ] Deduced a trap composed of 28 places in 143 ms of which 2 ms to minimize.
[2025-05-29 19:55:42] [INFO ] Deduced a trap composed of 28 places in 159 ms of which 3 ms to minimize.
[2025-05-29 19:55:42] [INFO ] Deduced a trap composed of 30 places in 161 ms of which 3 ms to minimize.
[2025-05-29 19:55:42] [INFO ] Deduced a trap composed of 28 places in 159 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/521 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 19:55:42] [INFO ] Deduced a trap composed of 28 places in 160 ms of which 2 ms to minimize.
[2025-05-29 19:55:43] [INFO ] Deduced a trap composed of 25 places in 141 ms of which 2 ms to minimize.
[2025-05-29 19:55:43] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 2 ms to minimize.
[2025-05-29 19:55:43] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 2 ms to minimize.
[2025-05-29 19:55:43] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 32768
[2025-05-29 19:55:43] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 2 ms to minimize.
SDD size :7492 after 9198
[2025-05-29 19:55:43] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 1 ms to minimize.
[2025-05-29 19:55:43] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/521 variables, 8/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/521 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1666/2187 variables, 521/610 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2187 variables, 1604/2214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2187 variables, 1/2215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2187 variables, 0/2215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/2189 variables, 2/2217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2189 variables, 0/2217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2189 variables, 0/2217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2189/2189 variables, and 2217 constraints, problems are : Problem set: 0 solved, 1 unsolved in 16972 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 523/523 constraints, ReadFeed: 1604/1604 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 67/67 constraints]
After SMT, in 18523ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 523 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1666/1666 transitions.
Applied a total of 0 rules in 31 ms. Remains 523 /523 variables (removed 0) and now considering 1666/1666 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 523/523 places, 1666/1666 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1666/1666 transitions.
Applied a total of 0 rules in 29 ms. Remains 523 /523 variables (removed 0) and now considering 1666/1666 (removed 0) transitions.
[2025-05-29 19:55:44] [INFO ] Invariant cache hit.
[2025-05-29 19:55:45] [INFO ] Implicit Places using invariants in 612 ms returned []
[2025-05-29 19:55:45] [INFO ] Invariant cache hit.
[2025-05-29 19:55:46] [INFO ] State equation strengthened by 1604 read => feed constraints.
[2025-05-29 19:55:53] [INFO ] Implicit Places using invariants and state equation in 8339 ms returned []
Implicit Place search using SMT with State Equation took 8952 ms to find 0 implicit places.
[2025-05-29 19:55:53] [INFO ] Redundant transitions in 37 ms returned []
Running 1646 sub problems to find dead transitions.
[2025-05-29 19:55:53] [INFO ] Invariant cache hit.
[2025-05-29 19:55:53] [INFO ] State equation strengthened by 1604 read => feed constraints.
Detected timeout of ITS tools.
[2025-05-29 19:56:04] [INFO ] Flatten gal took : 49 ms
[2025-05-29 19:56:04] [INFO ] Applying decomposition
[2025-05-29 19:56:05] [INFO ] Flatten gal took : 60 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/graph15374657262283032751.txt' '-o' '/tmp/graph15374657262283032751.bin' '-w' '/tmp/graph15374657262283032751.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15374657262283032751.bin' '-l' '-1' '-v' '-w' '/tmp/graph15374657262283032751.weights' '-q' '0' '-e' '0.001'
[2025-05-29 19:56:05] [INFO ] Decomposing Gal with order
[2025-05-29 19:56:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 19:56:05] [INFO ] Removed a total of 1292 redundant transitions.
[2025-05-29 19:56:05] [INFO ] Flatten gal took : 113 ms
[2025-05-29 19:56:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 1539 labels/synchronizations in 79 ms.
[2025-05-29 19:56:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6833688757404678596.gal : 18 ms
[2025-05-29 19:56:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7717593948884471609.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/ReachabilityCardinality6833688757404678596.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7717593948884471609.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/ReachabilityCardinality7717593948884471609.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 80
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :80 after 80
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :80 after 80
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :80 after 80
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :80 after 80
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :80 after 80
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :80 after 80
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :80 after 80
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :80 after 3279
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3279 after 184606
At refinement iteration 0 (INCLUDED_ONLY) 0/522 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/522 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
[2025-05-29 19:56:12] [INFO ] Deduced a trap composed of 24 places in 236 ms of which 3 ms to minimize.
[2025-05-29 19:56:13] [INFO ] Deduced a trap composed of 26 places in 177 ms of which 3 ms to minimize.
[2025-05-29 19:56:13] [INFO ] Deduced a trap composed of 34 places in 219 ms of which 3 ms to minimize.
[2025-05-29 19:56:13] [INFO ] Deduced a trap composed of 26 places in 242 ms of which 4 ms to minimize.
[2025-05-29 19:56:13] [INFO ] Deduced a trap composed of 25 places in 186 ms of which 3 ms to minimize.
[2025-05-29 19:56:13] [INFO ] Deduced a trap composed of 26 places in 177 ms of which 4 ms to minimize.
[2025-05-29 19:56:14] [INFO ] Deduced a trap composed of 26 places in 317 ms of which 4 ms to minimize.
[2025-05-29 19:56:14] [INFO ] Deduced a trap composed of 25 places in 325 ms of which 4 ms to minimize.
[2025-05-29 19:56:14] [INFO ] Deduced a trap composed of 26 places in 297 ms of which 2 ms to minimize.
[2025-05-29 19:56:15] [INFO ] Deduced a trap composed of 27 places in 159 ms of which 2 ms to minimize.
[2025-05-29 19:56:15] [INFO ] Deduced a trap composed of 25 places in 140 ms of which 2 ms to minimize.
[2025-05-29 19:56:15] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 2 ms to minimize.
[2025-05-29 19:56:15] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 2 ms to minimize.
[2025-05-29 19:56:15] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 2 ms to minimize.
[2025-05-29 19:56:15] [INFO ] Deduced a trap composed of 28 places in 134 ms of which 2 ms to minimize.
[2025-05-29 19:56:16] [INFO ] Deduced a trap composed of 25 places in 191 ms of which 4 ms to minimize.
[2025-05-29 19:56:16] [INFO ] Deduced a trap composed of 26 places in 235 ms of which 4 ms to minimize.
[2025-05-29 19:56:16] [INFO ] Deduced a trap composed of 27 places in 232 ms of which 4 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :184606 after 1.07418e+07
[2025-05-29 19:56:16] [INFO ] Deduced a trap composed of 28 places in 233 ms of which 3 ms to minimize.
[2025-05-29 19:56:17] [INFO ] Deduced a trap composed of 28 places in 218 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/522 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
[2025-05-29 19:56:17] [INFO ] Deduced a trap composed of 26 places in 163 ms of which 2 ms to minimize.
[2025-05-29 19:56:17] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 2 ms to minimize.
[2025-05-29 19:56:18] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 2 ms to minimize.
[2025-05-29 19:56:18] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 2 ms to minimize.
[2025-05-29 19:56:18] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 1 ms to minimize.
[2025-05-29 19:56:18] [INFO ] Deduced a trap composed of 2 places in 361 ms of which 4 ms to minimize.
[2025-05-29 19:56:19] [INFO ] Deduced a trap composed of 3 places in 396 ms of which 6 ms to minimize.
[2025-05-29 19:56:19] [INFO ] Deduced a trap composed of 27 places in 472 ms of which 6 ms to minimize.
[2025-05-29 19:56:20] [INFO ] Deduced a trap composed of 32 places in 463 ms of which 6 ms to minimize.
[2025-05-29 19:56:20] [INFO ] Deduced a trap composed of 24 places in 444 ms of which 5 ms to minimize.
[2025-05-29 19:56:21] [INFO ] Deduced a trap composed of 29 places in 453 ms of which 5 ms to minimize.
[2025-05-29 19:56:21] [INFO ] Deduced a trap composed of 35 places in 411 ms of which 5 ms to minimize.
[2025-05-29 19:56:21] [INFO ] Deduced a trap composed of 26 places in 381 ms of which 4 ms to minimize.
[2025-05-29 19:56:22] [INFO ] Deduced a trap composed of 26 places in 380 ms of which 4 ms to minimize.
[2025-05-29 19:56:22] [INFO ] Deduced a trap composed of 28 places in 382 ms of which 5 ms to minimize.
[2025-05-29 19:56:23] [INFO ] Deduced a trap composed of 26 places in 358 ms of which 4 ms to minimize.
[2025-05-29 19:56:23] [INFO ] Deduced a trap composed of 27 places in 362 ms of which 4 ms to minimize.
[2025-05-29 19:56:23] [INFO ] Deduced a trap composed of 25 places in 341 ms of which 4 ms to minimize.
[2025-05-29 19:56:24] [INFO ] Deduced a trap composed of 28 places in 437 ms of which 7 ms to minimize.
[2025-05-29 19:56:24] [INFO ] Deduced a trap composed of 35 places in 521 ms of which 8 ms to minimize.
SMT process timed out in 30880ms, After SMT, problems are : Problem set: 0 solved, 1646 unsolved
Search for dead transitions found 0 dead transitions in 30899ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39928 ms. Remains : 523/523 places, 1666/1666 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1544 edges and 523 vertex of which 438 / 523 are part of one of the 2 SCC in 1 ms
Free SCC test removed 436 places
Drop transitions (Empty/Sink Transition effects.) removed 1165 transitions
Ensure Unique test removed 410 transitions
Reduce isomorphic transitions removed 1575 transitions.
Graph (complete) has 214 edges and 87 vertex of which 25 are kept as prefixes of interest. Removing 62 places using SCC suffix rule.0 ms
Discarding 62 places :
Also discarding 20 output transitions
Drop transitions (Output transitions of discarded places.) removed 20 transitions
Drop transitions (Empty/Sink Transition effects.) removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 25 transition count 30
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 62 place count 6 transition count 11
Iterating global reduction 1 with 19 rules applied. Total rules applied 81 place count 6 transition count 11
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 1 with 2 rules applied. Total rules applied 83 place count 5 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 85 place count 5 transition count 8
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 4 transition count 7
Applied a total of 86 rules in 13 ms. Remains 4 /523 variables (removed 519) and now considering 7/1666 (removed 1659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 7 rows 4 cols
[2025-05-29 19:56:24] [INFO ] Computed 0 invariants in 1 ms
[2025-05-29 19:56:24] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-29 19:56:24] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-29 19:56:24] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-29 19:56:24] [INFO ] After 35ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-05-29 19:56:24] [INFO ] Flatten gal took : 1 ms
[2025-05-29 19:56:24] [INFO ] Flatten gal took : 1 ms
[2025-05-29 19:56:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3061131469632224071.gal : 0 ms
[2025-05-29 19:56:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14219921978604231324.prop : 0 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/ReachabilityCardinality3061131469632224071.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14219921978604231324.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 ...329
Loading property file /tmp/ReachabilityCardinality14219921978604231324.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 17 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,1052,0.018294,3900,2,108,9,1794,6,0,24,2085,0
Total reachable state count : 1052

Verifying 1 reachability properties.
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,124,0.018773,3900,2,23,9,1794,7,0,27,2085,0
Over-approximation ignoring read arcs solved 0 properties in 113 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[20]
Ending property specific reduction for CANInsertWithFailure-PT-020-UpperBounds-02 in 128349 ms.
Starting property specific reduction for CANInsertWithFailure-PT-020-UpperBounds-03
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[20]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[20]
// Phase 1: matrix 1674 rows 531 cols
[2025-05-29 19:56:24] [INFO ] Computed 22 invariants in 23 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[20]
RANDOM walk for 10000 steps (105 resets) in 72 ms. (136 steps per ms)
BEST_FIRST walk for 10001 steps (4 resets) in 15 ms. (625 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[20]
[2025-05-29 19:56:25] [INFO ] Invariant cache hit.
[2025-05-29 19:56:25] [INFO ] [Real]Absence check using 20 positive place invariants in 17 ms returned sat
[2025-05-29 19:56:25] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 8 ms returned sat
[2025-05-29 19:56:25] [INFO ] [Real]Absence check using state equation in 506 ms returned sat
[2025-05-29 19:56:25] [INFO ] State equation strengthened by 1582 read => feed constraints.
[2025-05-29 19:56:25] [INFO ] [Real]Added 1582 Read/Feed constraints in 181 ms returned sat
[2025-05-29 19:56:26] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:56:26] [INFO ] [Nat]Absence check using 20 positive place invariants in 13 ms returned sat
[2025-05-29 19:56:26] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2025-05-29 19:56:26] [INFO ] [Nat]Absence check using state equation in 485 ms returned sat
[2025-05-29 19:56:26] [INFO ] [Nat]Added 1582 Read/Feed constraints in 281 ms returned sat
[2025-05-29 19:56:27] [INFO ] Computed and/alt/rep : 1160/3017/1160 causal constraints (skipped 494 transitions) in 121 ms.
[2025-05-29 19:56:27] [INFO ] Added : 8 causal constraints over 2 iterations in 405 ms. Result :sat
Minimization took 581 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[20]
Support contains 1 out of 531 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 531/531 places, 1674/1674 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 523 transition count 1666
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 523 transition count 1665
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 18 place count 522 transition count 1665
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 25 place count 522 transition count 1665
Applied a total of 25 rules in 111 ms. Remains 522 /531 variables (removed 9) and now considering 1665/1674 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 522/531 places, 1665/1674 transitions.
// Phase 1: matrix 1665 rows 522 cols
[2025-05-29 19:56:28] [INFO ] Computed 22 invariants in 15 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[20]
RANDOM walk for 1000000 steps (10544 resets) in 5303 ms. (188 steps per ms)
BEST_FIRST walk for 1000001 steps (474 resets) in 950 ms. (1051 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[20]
[2025-05-29 19:56:34] [INFO ] Invariant cache hit.
[2025-05-29 19:56:34] [INFO ] [Real]Absence check using 20 positive place invariants in 13 ms returned sat
[2025-05-29 19:56:34] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 8 ms returned sat
[2025-05-29 19:56:35] [INFO ] [Real]Absence check using state equation in 579 ms returned sat
[2025-05-29 19:56:35] [INFO ] State equation strengthened by 1605 read => feed constraints.
[2025-05-29 19:56:35] [INFO ] [Real]Added 1605 Read/Feed constraints in 172 ms returned sat
[2025-05-29 19:56:35] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:56:35] [INFO ] [Nat]Absence check using 20 positive place invariants in 12 ms returned sat
[2025-05-29 19:56:35] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2025-05-29 19:56:35] [INFO ] [Nat]Absence check using state equation in 429 ms returned sat
[2025-05-29 19:56:36] [INFO ] [Nat]Added 1605 Read/Feed constraints in 198 ms returned sat
[2025-05-29 19:56:36] [INFO ] Computed and/alt/rep : 1151/3051/1151 causal constraints (skipped 494 transitions) in 119 ms.
[2025-05-29 19:56:36] [INFO ] Added : 7 causal constraints over 2 iterations in 425 ms. Result :sat
Minimization took 3778 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[20]
Support contains 1 out of 522 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 522/522 places, 1665/1665 transitions.
Applied a total of 0 rules in 29 ms. Remains 522 /522 variables (removed 0) and now considering 1665/1665 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 522/522 places, 1665/1665 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 522/522 places, 1665/1665 transitions.
Applied a total of 0 rules in 28 ms. Remains 522 /522 variables (removed 0) and now considering 1665/1665 (removed 0) transitions.
[2025-05-29 19:56:40] [INFO ] Invariant cache hit.
[2025-05-29 19:56:41] [INFO ] Implicit Places using invariants in 1123 ms returned []
[2025-05-29 19:56:41] [INFO ] Invariant cache hit.
[2025-05-29 19:56:42] [INFO ] State equation strengthened by 1605 read => feed constraints.
[2025-05-29 19:56:48] [INFO ] Implicit Places using invariants and state equation in 7094 ms returned []
Implicit Place search using SMT with State Equation took 8225 ms to find 0 implicit places.
[2025-05-29 19:56:48] [INFO ] Redundant transitions in 36 ms returned []
Running 1645 sub problems to find dead transitions.
[2025-05-29 19:56:48] [INFO ] Invariant cache hit.
[2025-05-29 19:56:48] [INFO ] State equation strengthened by 1605 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/521 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/521 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
[2025-05-29 19:57:18] [INFO ] Deduced a trap composed of 26 places in 492 ms of which 6 ms to minimize.
[2025-05-29 19:57:19] [INFO ] Deduced a trap composed of 24 places in 383 ms of which 5 ms to minimize.
[2025-05-29 19:57:20] [INFO ] Deduced a trap composed of 25 places in 668 ms of which 7 ms to minimize.
SMT process timed out in 31390ms, After SMT, problems are : Problem set: 0 solved, 1645 unsolved
Search for dead transitions found 0 dead transitions in 31406ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39711 ms. Remains : 522/522 places, 1665/1665 transitions.
[2025-05-29 19:57:20] [INFO ] Flatten gal took : 82 ms
[2025-05-29 19:57:20] [INFO ] Flatten gal took : 82 ms
[2025-05-29 19:57:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7786892970700530718.gal : 10 ms
[2025-05-29 19:57:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3666771842715746323.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/ReachabilityCardinality7786892970700530718.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3666771842715746323.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
RANDOM walk for 40000 steps (420 resets) in 1036 ms. (38 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (17 resets) in 145 ms. (274 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (17 resets) in 152 ms. (261 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality3666771842715746323.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 147
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :147 after 150
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :150 after 151
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :151 after 155
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :155 after 156
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :156 after 157
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :157 after 163
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :163 after 174
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :174 after 199
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :199 after 236
Interrupted probabilistic random walk after 261510 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :0 out of 2
Probabilistic random walk after 261510 steps, saw 37880 distinct states, run finished after 3001 ms. (steps per millisecond=87 ) properties seen :0
[2025-05-29 19:57:23] [INFO ] Invariant cache hit.
[2025-05-29 19:57:23] [INFO ] State equation strengthened by 1605 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 479/480 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-29 19:57:23] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/480 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/480 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 38/518 variables, 19/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/518 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/520 variables, 2/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :236 after 320
[2025-05-29 19:57:24] [INFO ] Deduced a trap composed of 27 places in 424 ms of which 5 ms to minimize.
[2025-05-29 19:57:24] [INFO ] Deduced a trap composed of 28 places in 448 ms of which 5 ms to minimize.
[2025-05-29 19:57:25] [INFO ] Deduced a trap composed of 28 places in 405 ms of which 5 ms to minimize.
[2025-05-29 19:57:25] [INFO ] Deduced a trap composed of 33 places in 507 ms of which 6 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :320 after 453
[2025-05-29 19:57:26] [INFO ] Deduced a trap composed of 29 places in 448 ms of which 6 ms to minimize.
[2025-05-29 19:57:26] [INFO ] Deduced a trap composed of 29 places in 400 ms of which 5 ms to minimize.
[2025-05-29 19:57:26] [INFO ] Deduced a trap composed of 29 places in 409 ms of which 5 ms to minimize.
[2025-05-29 19:57:27] [INFO ] Deduced a trap composed of 33 places in 406 ms of which 6 ms to minimize.
[2025-05-29 19:57:27] [INFO ] Deduced a trap composed of 27 places in 400 ms of which 5 ms to minimize.
[2025-05-29 19:57:28] [INFO ] Deduced a trap composed of 26 places in 401 ms of which 5 ms to minimize.
[2025-05-29 19:57:28] [INFO ] Deduced a trap composed of 27 places in 358 ms of which 4 ms to minimize.
[2025-05-29 19:57:28] [INFO ] Deduced a trap composed of 27 places in 334 ms of which 4 ms to minimize.
SMT process timed out in 5339ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 522 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 522/522 places, 1665/1665 transitions.
Applied a total of 0 rules in 44 ms. Remains 522 /522 variables (removed 0) and now considering 1665/1665 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 522/522 places, 1665/1665 transitions.
RANDOM walk for 40000 steps (422 resets) in 401 ms. (99 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (18 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :453 after 7511
Interrupted probabilistic random walk after 384678 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :0 out of 1
Probabilistic random walk after 384678 steps, saw 51234 distinct states, run finished after 3001 ms. (steps per millisecond=128 ) properties seen :0
[2025-05-29 19:57:32] [INFO ] Invariant cache hit.
[2025-05-29 19:57:32] [INFO ] State equation strengthened by 1605 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 479/480 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 19:57:32] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2025-05-29 19:57:32] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2025-05-29 19:57:32] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2025-05-29 19:57:32] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2025-05-29 19:57:32] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2025-05-29 19:57:32] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2025-05-29 19:57:32] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2025-05-29 19:57:32] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2025-05-29 19:57:32] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 2 ms to minimize.
[2025-05-29 19:57:32] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
[2025-05-29 19:57:32] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2025-05-29 19:57:32] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
[2025-05-29 19:57:32] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 0 ms to minimize.
[2025-05-29 19:57:32] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
[2025-05-29 19:57:33] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
[2025-05-29 19:57:33] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/480 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/480 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 38/518 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/518 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/520 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1665/2185 variables, 520/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2185 variables, 1605/2163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2185 variables, 0/2163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/2187 variables, 2/2165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2187 variables, 0/2165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/2187 variables, 0/2165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2187/2187 variables, and 2165 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1877 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 522/522 constraints, ReadFeed: 1605/1605 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 479/480 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/480 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 19:57:34] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2025-05-29 19:57:34] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2025-05-29 19:57:34] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/480 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 38/518 variables, 19/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/518 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/520 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 19:57:34] [INFO ] Deduced a trap composed of 27 places in 568 ms of which 8 ms to minimize.
[2025-05-29 19:57:35] [INFO ] Deduced a trap composed of 25 places in 533 ms of which 5 ms to minimize.
[2025-05-29 19:57:35] [INFO ] Deduced a trap composed of 31 places in 412 ms of which 5 ms to minimize.
[2025-05-29 19:57:36] [INFO ] Deduced a trap composed of 27 places in 547 ms of which 8 ms to minimize.
[2025-05-29 19:57:36] [INFO ] Deduced a trap composed of 25 places in 432 ms of which 5 ms to minimize.
[2025-05-29 19:57:37] [INFO ] Deduced a trap composed of 26 places in 431 ms of which 4 ms to minimize.
[2025-05-29 19:57:37] [INFO ] Deduced a trap composed of 24 places in 531 ms of which 8 ms to minimize.
[2025-05-29 19:57:38] [INFO ] Deduced a trap composed of 25 places in 458 ms of which 5 ms to minimize.
[2025-05-29 19:57:38] [INFO ] Deduced a trap composed of 36 places in 577 ms of which 7 ms to minimize.
[2025-05-29 19:57:39] [INFO ] Deduced a trap composed of 31 places in 568 ms of which 6 ms to minimize.
[2025-05-29 19:57:40] [INFO ] Deduced a trap composed of 25 places in 569 ms of which 6 ms to minimize.
[2025-05-29 19:57:40] [INFO ] Deduced a trap composed of 28 places in 533 ms of which 6 ms to minimize.
[2025-05-29 19:57:41] [INFO ] Deduced a trap composed of 29 places in 511 ms of which 6 ms to minimize.
[2025-05-29 19:57:41] [INFO ] Deduced a trap composed of 26 places in 496 ms of which 6 ms to minimize.
[2025-05-29 19:57:42] [INFO ] Deduced a trap composed of 27 places in 463 ms of which 4 ms to minimize.
[2025-05-29 19:57:42] [INFO ] Deduced a trap composed of 26 places in 423 ms of which 4 ms to minimize.
[2025-05-29 19:57:42] [INFO ] Deduced a trap composed of 25 places in 437 ms of which 5 ms to minimize.
[2025-05-29 19:57:43] [INFO ] Deduced a trap composed of 27 places in 425 ms of which 5 ms to minimize.
[2025-05-29 19:57:43] [INFO ] Deduced a trap composed of 25 places in 430 ms of which 5 ms to minimize.
[2025-05-29 19:57:44] [INFO ] Deduced a trap composed of 25 places in 543 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/520 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1665/2185 variables, 520/581 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2185 variables, 1605/2186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2185 variables, 1/2187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2185 variables, 0/2187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/2187 variables, 2/2189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2187 variables, 0/2189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/2187 variables, 0/2189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2187/2187 variables, and 2189 constraints, problems are : Problem set: 0 solved, 1 unsolved in 11425 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 522/522 constraints, ReadFeed: 1605/1605 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 39/39 constraints]
After SMT, in 13332ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 20 ms.
Support contains 1 out of 522 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 522/522 places, 1665/1665 transitions.
Applied a total of 0 rules in 30 ms. Remains 522 /522 variables (removed 0) and now considering 1665/1665 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 522/522 places, 1665/1665 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 522/522 places, 1665/1665 transitions.
Applied a total of 0 rules in 37 ms. Remains 522 /522 variables (removed 0) and now considering 1665/1665 (removed 0) transitions.
[2025-05-29 19:57:45] [INFO ] Invariant cache hit.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :7511 after 9229
[2025-05-29 19:57:46] [INFO ] Implicit Places using invariants in 584 ms returned []
[2025-05-29 19:57:46] [INFO ] Invariant cache hit.
[2025-05-29 19:57:46] [INFO ] State equation strengthened by 1605 read => feed constraints.
[2025-05-29 19:57:53] [INFO ] Implicit Places using invariants and state equation in 7330 ms returned []
Implicit Place search using SMT with State Equation took 7918 ms to find 0 implicit places.
[2025-05-29 19:57:53] [INFO ] Redundant transitions in 37 ms returned []
Running 1645 sub problems to find dead transitions.
[2025-05-29 19:57:53] [INFO ] Invariant cache hit.
[2025-05-29 19:57:53] [INFO ] State equation strengthened by 1605 read => feed constraints.
Detected timeout of ITS tools.
[2025-05-29 19:58:10] [INFO ] Flatten gal took : 37 ms
[2025-05-29 19:58:10] [INFO ] Applying decomposition
[2025-05-29 19:58:10] [INFO ] Flatten gal took : 37 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/graph14353705587822413516.txt' '-o' '/tmp/graph14353705587822413516.bin' '-w' '/tmp/graph14353705587822413516.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14353705587822413516.bin' '-l' '-1' '-v' '-w' '/tmp/graph14353705587822413516.weights' '-q' '0' '-e' '0.001'
[2025-05-29 19:58:10] [INFO ] Decomposing Gal with order
[2025-05-29 19:58:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 19:58:10] [INFO ] Removed a total of 1288 redundant transitions.
[2025-05-29 19:58:10] [INFO ] Flatten gal took : 98 ms
[2025-05-29 19:58:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 1466 labels/synchronizations in 75 ms.
[2025-05-29 19:58:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1157069510388033855.gal : 22 ms
[2025-05-29 19:58:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1822820393427945902.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/ReachabilityCardinality1157069510388033855.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1822820393427945902.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/ReachabilityCardinality1822820393427945902.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 58
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :58 after 58
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :58 after 58
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :58 after 58
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :58 after 58
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :58 after 58
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :58 after 58
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :58 after 58
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :58 after 1811
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1811 after 4829
At refinement iteration 0 (INCLUDED_ONLY) 0/521 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/521 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
[2025-05-29 19:58:13] [INFO ] Deduced a trap composed of 26 places in 280 ms of which 3 ms to minimize.
[2025-05-29 19:58:13] [INFO ] Deduced a trap composed of 24 places in 261 ms of which 3 ms to minimize.
[2025-05-29 19:58:14] [INFO ] Deduced a trap composed of 25 places in 369 ms of which 4 ms to minimize.
[2025-05-29 19:58:14] [INFO ] Deduced a trap composed of 2 places in 378 ms of which 4 ms to minimize.
[2025-05-29 19:58:14] [INFO ] Deduced a trap composed of 29 places in 189 ms of which 5 ms to minimize.
[2025-05-29 19:58:15] [INFO ] Deduced a trap composed of 25 places in 189 ms of which 3 ms to minimize.
[2025-05-29 19:58:15] [INFO ] Deduced a trap composed of 25 places in 193 ms of which 3 ms to minimize.
[2025-05-29 19:58:15] [INFO ] Deduced a trap composed of 25 places in 176 ms of which 3 ms to minimize.
[2025-05-29 19:58:15] [INFO ] Deduced a trap composed of 28 places in 164 ms of which 3 ms to minimize.
[2025-05-29 19:58:15] [INFO ] Deduced a trap composed of 33 places in 203 ms of which 4 ms to minimize.
[2025-05-29 19:58:16] [INFO ] Deduced a trap composed of 25 places in 173 ms of which 3 ms to minimize.
[2025-05-29 19:58:16] [INFO ] Deduced a trap composed of 29 places in 155 ms of which 2 ms to minimize.
[2025-05-29 19:58:16] [INFO ] Deduced a trap composed of 28 places in 183 ms of which 3 ms to minimize.
[2025-05-29 19:58:16] [INFO ] Deduced a trap composed of 29 places in 160 ms of which 6 ms to minimize.
[2025-05-29 19:58:16] [INFO ] Deduced a trap composed of 25 places in 182 ms of which 3 ms to minimize.
[2025-05-29 19:58:16] [INFO ] Deduced a trap composed of 31 places in 146 ms of which 3 ms to minimize.
[2025-05-29 19:58:17] [INFO ] Deduced a trap composed of 31 places in 186 ms of which 2 ms to minimize.
[2025-05-29 19:58:17] [INFO ] Deduced a trap composed of 32 places in 210 ms of which 3 ms to minimize.
[2025-05-29 19:58:17] [INFO ] Deduced a trap composed of 29 places in 171 ms of which 2 ms to minimize.
[2025-05-29 19:58:17] [INFO ] Deduced a trap composed of 25 places in 197 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/521 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
[2025-05-29 19:58:18] [INFO ] Deduced a trap composed of 27 places in 216 ms of which 2 ms to minimize.
[2025-05-29 19:58:18] [INFO ] Deduced a trap composed of 28 places in 214 ms of which 2 ms to minimize.
[2025-05-29 19:58:19] [INFO ] Deduced a trap composed of 29 places in 131 ms of which 2 ms to minimize.
[2025-05-29 19:58:19] [INFO ] Deduced a trap composed of 29 places in 137 ms of which 2 ms to minimize.
[2025-05-29 19:58:19] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 2 ms to minimize.
[2025-05-29 19:58:19] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 2 ms to minimize.
[2025-05-29 19:58:19] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 2 ms to minimize.
[2025-05-29 19:58:19] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 2 ms to minimize.
[2025-05-29 19:58:19] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 2 ms to minimize.
[2025-05-29 19:58:19] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
[2025-05-29 19:58:19] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 2 ms to minimize.
[2025-05-29 19:58:20] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 2 ms to minimize.
[2025-05-29 19:58:20] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 2 ms to minimize.
[2025-05-29 19:58:20] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 2 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :4829 after 1.01228e+07
[2025-05-29 19:58:20] [INFO ] Deduced a trap composed of 28 places in 397 ms of which 5 ms to minimize.
[2025-05-29 19:58:20] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2025-05-29 19:58:23] [INFO ] Deduced a trap composed of 26 places in 179 ms of which 3 ms to minimize.
[2025-05-29 19:58:24] [INFO ] Deduced a trap composed of 26 places in 179 ms of which 3 ms to minimize.
[2025-05-29 19:58:24] [INFO ] Deduced a trap composed of 26 places in 228 ms of which 4 ms to minimize.
SMT process timed out in 30805ms, After SMT, problems are : Problem set: 0 solved, 1645 unsolved
Search for dead transitions found 0 dead transitions in 30827ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38833 ms. Remains : 522/522 places, 1665/1665 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1542 edges and 522 vertex of which 438 / 522 are part of one of the 2 SCC in 2 ms
Free SCC test removed 436 places
Drop transitions (Empty/Sink Transition effects.) removed 1164 transitions
Ensure Unique test removed 412 transitions
Reduce isomorphic transitions removed 1576 transitions.
Graph (complete) has 211 edges and 86 vertex of which 25 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.1 ms
Discarding 61 places :
Also discarding 19 output transitions
Drop transitions (Output transitions of discarded places.) removed 19 transitions
Drop transitions (Empty/Sink Transition effects.) removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 25 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 24 transition count 28
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 63 place count 6 transition count 10
Iterating global reduction 2 with 18 rules applied. Total rules applied 81 place count 6 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 83 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 86 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 4 transition count 5
Applied a total of 87 rules in 15 ms. Remains 4 /522 variables (removed 518) and now considering 5/1665 (removed 1660) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 4 cols
[2025-05-29 19:58:24] [INFO ] Computed 0 invariants in 4 ms
[2025-05-29 19:58:24] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-29 19:58:24] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-29 19:58:24] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-29 19:58:24] [INFO ] After 28ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-05-29 19:58:24] [INFO ] Flatten gal took : 1 ms
[2025-05-29 19:58:24] [INFO ] Flatten gal took : 0 ms
[2025-05-29 19:58:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9331409317623635855.gal : 1 ms
[2025-05-29 19:58:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9716050802381252790.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/ReachabilityCardinality9331409317623635855.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9716050802381252790.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/ReachabilityCardinality9716050802381252790.prop.
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 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,6,0.00329,3520,2,7,6,33,6,0,21,18,0
Total reachable state count : 6

Verifying 1 reachability properties.
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,0.003733,3896,2,5,6,33,7,0,24,18,0
Over-approximation ignoring read arcs solved 0 properties in 87 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[20]
Ending property specific reduction for CANInsertWithFailure-PT-020-UpperBounds-03 in 119551 ms.
Starting property specific reduction for CANInsertWithFailure-PT-020-UpperBounds-04
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[20]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[20]
// Phase 1: matrix 1674 rows 531 cols
[2025-05-29 19:58:24] [INFO ] Computed 22 invariants in 15 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[20]
RANDOM walk for 10000 steps (103 resets) in 58 ms. (169 steps per ms)
BEST_FIRST walk for 10001 steps (4 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[20]
[2025-05-29 19:58:24] [INFO ] Invariant cache hit.
[2025-05-29 19:58:24] [INFO ] [Real]Absence check using 20 positive place invariants in 13 ms returned sat
[2025-05-29 19:58:24] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2025-05-29 19:58:25] [INFO ] [Real]Absence check using state equation in 568 ms returned sat
[2025-05-29 19:58:25] [INFO ] State equation strengthened by 1582 read => feed constraints.
[2025-05-29 19:58:25] [INFO ] [Real]Added 1582 Read/Feed constraints in 209 ms returned sat
[2025-05-29 19:58:25] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:58:25] [INFO ] [Nat]Absence check using 20 positive place invariants in 13 ms returned sat
[2025-05-29 19:58:25] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2025-05-29 19:58:26] [INFO ] [Nat]Absence check using state equation in 592 ms returned sat
[2025-05-29 19:58:26] [INFO ] [Nat]Added 1582 Read/Feed constraints in 340 ms returned sat
[2025-05-29 19:58:26] [INFO ] Computed and/alt/rep : 1160/3017/1160 causal constraints (skipped 494 transitions) in 201 ms.
[2025-05-29 19:58:27] [INFO ] Added : 9 causal constraints over 2 iterations in 621 ms. Result :sat
Minimization took 581 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[20]
Support contains 1 out of 531 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 531/531 places, 1674/1674 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 523 transition count 1666
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 523 transition count 1665
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 18 place count 522 transition count 1665
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 25 place count 522 transition count 1665
Applied a total of 25 rules in 107 ms. Remains 522 /531 variables (removed 9) and now considering 1665/1674 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 522/531 places, 1665/1674 transitions.
// Phase 1: matrix 1665 rows 522 cols
[2025-05-29 19:58:28] [INFO ] Computed 22 invariants in 24 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[20]
RANDOM walk for 1000000 steps (10518 resets) in 5382 ms. (185 steps per ms)
BEST_FIRST walk for 1000001 steps (475 resets) in 946 ms. (1055 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[20]
[2025-05-29 19:58:34] [INFO ] Invariant cache hit.
[2025-05-29 19:58:34] [INFO ] [Real]Absence check using 20 positive place invariants in 13 ms returned sat
[2025-05-29 19:58:34] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2025-05-29 19:58:34] [INFO ] [Real]Absence check using state equation in 463 ms returned sat
[2025-05-29 19:58:35] [INFO ] State equation strengthened by 1605 read => feed constraints.
[2025-05-29 19:58:35] [INFO ] [Real]Added 1605 Read/Feed constraints in 223 ms returned sat
[2025-05-29 19:58:35] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:58:35] [INFO ] [Nat]Absence check using 20 positive place invariants in 16 ms returned sat
[2025-05-29 19:58:35] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2025-05-29 19:58:35] [INFO ] [Nat]Absence check using state equation in 452 ms returned sat
[2025-05-29 19:58:36] [INFO ] [Nat]Added 1605 Read/Feed constraints in 249 ms returned sat
[2025-05-29 19:58:36] [INFO ] Computed and/alt/rep : 1151/3051/1151 causal constraints (skipped 494 transitions) in 127 ms.
[2025-05-29 19:58:36] [INFO ] Added : 8 causal constraints over 2 iterations in 443 ms. Result :sat
Minimization took 4516 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[20]
Support contains 1 out of 522 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 522/522 places, 1665/1665 transitions.
Applied a total of 0 rules in 30 ms. Remains 522 /522 variables (removed 0) and now considering 1665/1665 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 522/522 places, 1665/1665 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 522/522 places, 1665/1665 transitions.
Applied a total of 0 rules in 30 ms. Remains 522 /522 variables (removed 0) and now considering 1665/1665 (removed 0) transitions.
[2025-05-29 19:58:41] [INFO ] Invariant cache hit.
[2025-05-29 19:58:42] [INFO ] Implicit Places using invariants in 1071 ms returned []
[2025-05-29 19:58:42] [INFO ] Invariant cache hit.
[2025-05-29 19:58:43] [INFO ] State equation strengthened by 1605 read => feed constraints.
[2025-05-29 19:58:51] [INFO ] Implicit Places using invariants and state equation in 8928 ms returned []
Implicit Place search using SMT with State Equation took 10002 ms to find 0 implicit places.
[2025-05-29 19:58:51] [INFO ] Redundant transitions in 37 ms returned []
Running 1645 sub problems to find dead transitions.
[2025-05-29 19:58:51] [INFO ] Invariant cache hit.
[2025-05-29 19:58:51] [INFO ] State equation strengthened by 1605 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/521 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/521 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
[2025-05-29 19:59:18] [INFO ] Deduced a trap composed of 30 places in 371 ms of which 5 ms to minimize.
[2025-05-29 19:59:18] [INFO ] Deduced a trap composed of 29 places in 336 ms of which 5 ms to minimize.
[2025-05-29 19:59:19] [INFO ] Deduced a trap composed of 32 places in 386 ms of which 5 ms to minimize.
[2025-05-29 19:59:19] [INFO ] Deduced a trap composed of 33 places in 345 ms of which 5 ms to minimize.
[2025-05-29 19:59:19] [INFO ] Deduced a trap composed of 28 places in 390 ms of which 4 ms to minimize.
[2025-05-29 19:59:20] [INFO ] Deduced a trap composed of 36 places in 337 ms of which 4 ms to minimize.
[2025-05-29 19:59:20] [INFO ] Deduced a trap composed of 25 places in 323 ms of which 4 ms to minimize.
[2025-05-29 19:59:20] [INFO ] Deduced a trap composed of 26 places in 321 ms of which 4 ms to minimize.
[2025-05-29 19:59:21] [INFO ] Deduced a trap composed of 25 places in 297 ms of which 4 ms to minimize.
[2025-05-29 19:59:21] [INFO ] Deduced a trap composed of 33 places in 259 ms of which 3 ms to minimize.
[2025-05-29 19:59:21] [INFO ] Deduced a trap composed of 33 places in 260 ms of which 4 ms to minimize.
[2025-05-29 19:59:22] [INFO ] Deduced a trap composed of 27 places in 238 ms of which 3 ms to minimize.
[2025-05-29 19:59:22] [INFO ] Deduced a trap composed of 26 places in 285 ms of which 4 ms to minimize.
SMT process timed out in 30991ms, After SMT, problems are : Problem set: 0 solved, 1645 unsolved
Search for dead transitions found 0 dead transitions in 31008ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41088 ms. Remains : 522/522 places, 1665/1665 transitions.
[2025-05-29 19:59:22] [INFO ] Flatten gal took : 60 ms
[2025-05-29 19:59:22] [INFO ] Flatten gal took : 59 ms
[2025-05-29 19:59:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14114573833935586951.gal : 11 ms
[2025-05-29 19:59:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5525032502480789153.prop : 0 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/ReachabilityCardinality14114573833935586951.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5525032502480789153.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 ...329
RANDOM walk for 40000 steps (422 resets) in 834 ms. (47 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (16 resets) in 115 ms. (344 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (16 resets) in 144 ms. (275 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality5525032502480789153.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 147
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :147 after 150
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :150 after 151
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :151 after 155
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :155 after 156
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :156 after 157
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :157 after 163
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :163 after 174
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :174 after 199
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :199 after 235
Interrupted probabilistic random walk after 311205 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :0 out of 2
Probabilistic random walk after 311205 steps, saw 43491 distinct states, run finished after 3001 ms. (steps per millisecond=103 ) properties seen :0
[2025-05-29 19:59:25] [INFO ] Invariant cache hit.
[2025-05-29 19:59:25] [INFO ] State equation strengthened by 1605 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 479/480 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-29 19:59:25] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/480 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/480 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 38/518 variables, 19/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/518 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/520 variables, 2/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :235 after 319
[2025-05-29 19:59:26] [INFO ] Deduced a trap composed of 25 places in 455 ms of which 5 ms to minimize.
[2025-05-29 19:59:27] [INFO ] Deduced a trap composed of 25 places in 541 ms of which 7 ms to minimize.
[2025-05-29 19:59:27] [INFO ] Deduced a trap composed of 24 places in 403 ms of which 5 ms to minimize.
[2025-05-29 19:59:27] [INFO ] Deduced a trap composed of 25 places in 375 ms of which 4 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :319 after 452
[2025-05-29 19:59:28] [INFO ] Deduced a trap composed of 25 places in 346 ms of which 4 ms to minimize.
[2025-05-29 19:59:28] [INFO ] Deduced a trap composed of 25 places in 316 ms of which 4 ms to minimize.
[2025-05-29 19:59:28] [INFO ] Deduced a trap composed of 27 places in 288 ms of which 4 ms to minimize.
[2025-05-29 19:59:29] [INFO ] Deduced a trap composed of 25 places in 260 ms of which 4 ms to minimize.
[2025-05-29 19:59:29] [INFO ] Deduced a trap composed of 25 places in 233 ms of which 3 ms to minimize.
[2025-05-29 19:59:29] [INFO ] Deduced a trap composed of 25 places in 208 ms of which 3 ms to minimize.
[2025-05-29 19:59:29] [INFO ] Deduced a trap composed of 25 places in 184 ms of which 3 ms to minimize.
[2025-05-29 19:59:29] [INFO ] Deduced a trap composed of 31 places in 164 ms of which 2 ms to minimize.
[2025-05-29 19:59:30] [INFO ] Deduced a trap composed of 27 places in 145 ms of which 3 ms to minimize.
[2025-05-29 19:59:30] [INFO ] Deduced a trap composed of 26 places in 141 ms of which 3 ms to minimize.
[2025-05-29 19:59:30] [INFO ] Deduced a trap composed of 29 places in 121 ms of which 2 ms to minimize.
[2025-05-29 19:59:30] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 2 ms to minimize.
[2025-05-29 19:59:30] [INFO ] Deduced a trap composed of 34 places in 119 ms of which 2 ms to minimize.
[2025-05-29 19:59:30] [INFO ] Deduced a trap composed of 34 places in 133 ms of which 2 ms to minimize.
SMT process timed out in 5102ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 522 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 522/522 places, 1665/1665 transitions.
Applied a total of 0 rules in 29 ms. Remains 522 /522 variables (removed 0) and now considering 1665/1665 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 522/522 places, 1665/1665 transitions.
RANDOM walk for 40000 steps (422 resets) in 413 ms. (96 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (19 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :452 after 7470
Interrupted probabilistic random walk after 390357 steps, run timeout after 3001 ms. (steps per millisecond=130 ) properties seen :0 out of 1
Probabilistic random walk after 390357 steps, saw 52004 distinct states, run finished after 3001 ms. (steps per millisecond=130 ) properties seen :0
[2025-05-29 19:59:34] [INFO ] Invariant cache hit.
[2025-05-29 19:59:34] [INFO ] State equation strengthened by 1605 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 479/480 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 19:59:34] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2025-05-29 19:59:34] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2025-05-29 19:59:34] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2025-05-29 19:59:34] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 2 ms to minimize.
[2025-05-29 19:59:34] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2025-05-29 19:59:34] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 2 ms to minimize.
[2025-05-29 19:59:34] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
[2025-05-29 19:59:34] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
[2025-05-29 19:59:34] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
[2025-05-29 19:59:34] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
[2025-05-29 19:59:34] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2025-05-29 19:59:34] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
[2025-05-29 19:59:34] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
[2025-05-29 19:59:34] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
[2025-05-29 19:59:34] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
[2025-05-29 19:59:34] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/480 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/480 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 38/518 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/518 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/520 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1665/2185 variables, 520/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2185 variables, 1605/2163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2185 variables, 0/2163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/2187 variables, 2/2165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2187 variables, 0/2165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/2187 variables, 0/2165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2187/2187 variables, and 2165 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1736 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 522/522 constraints, ReadFeed: 1605/1605 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 479/480 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/480 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 19:59:35] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
[2025-05-29 19:59:35] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 1 ms to minimize.
[2025-05-29 19:59:36] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/480 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 38/518 variables, 19/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/518 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/520 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 19:59:36] [INFO ] Deduced a trap composed of 27 places in 579 ms of which 7 ms to minimize.
[2025-05-29 19:59:37] [INFO ] Deduced a trap composed of 25 places in 562 ms of which 7 ms to minimize.
[2025-05-29 19:59:37] [INFO ] Deduced a trap composed of 31 places in 539 ms of which 7 ms to minimize.
[2025-05-29 19:59:38] [INFO ] Deduced a trap composed of 28 places in 527 ms of which 6 ms to minimize.
[2025-05-29 19:59:38] [INFO ] Deduced a trap composed of 25 places in 592 ms of which 6 ms to minimize.
[2025-05-29 19:59:39] [INFO ] Deduced a trap composed of 34 places in 512 ms of which 5 ms to minimize.
[2025-05-29 19:59:39] [INFO ] Deduced a trap composed of 29 places in 464 ms of which 5 ms to minimize.
[2025-05-29 19:59:40] [INFO ] Deduced a trap composed of 25 places in 448 ms of which 5 ms to minimize.
[2025-05-29 19:59:40] [INFO ] Deduced a trap composed of 31 places in 539 ms of which 5 ms to minimize.
[2025-05-29 19:59:41] [INFO ] Deduced a trap composed of 32 places in 448 ms of which 5 ms to minimize.
[2025-05-29 19:59:41] [INFO ] Deduced a trap composed of 26 places in 554 ms of which 6 ms to minimize.
[2025-05-29 19:59:42] [INFO ] Deduced a trap composed of 26 places in 522 ms of which 6 ms to minimize.
[2025-05-29 19:59:43] [INFO ] Deduced a trap composed of 26 places in 497 ms of which 5 ms to minimize.
[2025-05-29 19:59:43] [INFO ] Deduced a trap composed of 26 places in 479 ms of which 6 ms to minimize.
[2025-05-29 19:59:43] [INFO ] Deduced a trap composed of 25 places in 471 ms of which 5 ms to minimize.
[2025-05-29 19:59:44] [INFO ] Deduced a trap composed of 26 places in 436 ms of which 4 ms to minimize.
[2025-05-29 19:59:44] [INFO ] Deduced a trap composed of 27 places in 439 ms of which 5 ms to minimize.
[2025-05-29 19:59:45] [INFO ] Deduced a trap composed of 29 places in 557 ms of which 5 ms to minimize.
[2025-05-29 19:59:45] [INFO ] Deduced a trap composed of 26 places in 431 ms of which 5 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :7470 after 9180
[2025-05-29 19:59:46] [INFO ] Deduced a trap composed of 25 places in 540 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 19:59:46] [INFO ] Deduced a trap composed of 27 places in 413 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/520 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/520 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1665/2185 variables, 520/582 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2185 variables, 1605/2187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2185 variables, 1/2188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2185 variables, 0/2188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/2187 variables, 2/2190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2187 variables, 0/2190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2187 variables, 0/2190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2187/2187 variables, and 2190 constraints, problems are : Problem set: 0 solved, 1 unsolved in 12626 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 522/522 constraints, ReadFeed: 1605/1605 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 40/40 constraints]
After SMT, in 14389ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 522 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 522/522 places, 1665/1665 transitions.
Applied a total of 0 rules in 30 ms. Remains 522 /522 variables (removed 0) and now considering 1665/1665 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 522/522 places, 1665/1665 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 522/522 places, 1665/1665 transitions.
Applied a total of 0 rules in 30 ms. Remains 522 /522 variables (removed 0) and now considering 1665/1665 (removed 0) transitions.
[2025-05-29 19:59:48] [INFO ] Invariant cache hit.
[2025-05-29 19:59:49] [INFO ] Implicit Places using invariants in 601 ms returned []
[2025-05-29 19:59:49] [INFO ] Invariant cache hit.
[2025-05-29 19:59:49] [INFO ] State equation strengthened by 1605 read => feed constraints.
[2025-05-29 19:59:56] [INFO ] Implicit Places using invariants and state equation in 6932 ms returned []
Implicit Place search using SMT with State Equation took 7544 ms to find 0 implicit places.
[2025-05-29 19:59:56] [INFO ] Redundant transitions in 60 ms returned []
Running 1645 sub problems to find dead transitions.
[2025-05-29 19:59:56] [INFO ] Invariant cache hit.
[2025-05-29 19:59:56] [INFO ] State equation strengthened by 1605 read => feed constraints.
Detected timeout of ITS tools.
[2025-05-29 20:00:12] [INFO ] Flatten gal took : 36 ms
[2025-05-29 20:00:12] [INFO ] Applying decomposition
[2025-05-29 20:00:12] [INFO ] Flatten gal took : 39 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/graph1748642060408372847.txt' '-o' '/tmp/graph1748642060408372847.bin' '-w' '/tmp/graph1748642060408372847.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1748642060408372847.bin' '-l' '-1' '-v' '-w' '/tmp/graph1748642060408372847.weights' '-q' '0' '-e' '0.001'
[2025-05-29 20:00:12] [INFO ] Decomposing Gal with order
[2025-05-29 20:00:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 20:00:12] [INFO ] Removed a total of 1286 redundant transitions.
[2025-05-29 20:00:12] [INFO ] Flatten gal took : 112 ms
[2025-05-29 20:00:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 1464 labels/synchronizations in 54 ms.
[2025-05-29 20:00:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3110018172554298977.gal : 22 ms
[2025-05-29 20:00:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14682939879428600539.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/ReachabilityCardinality3110018172554298977.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14682939879428600539.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 ...308
Loading property file /tmp/ReachabilityCardinality14682939879428600539.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 71
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :71 after 71
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :71 after 71
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :71 after 71
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :71 after 71
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :71 after 71
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :71 after 71
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :71 after 71
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :71 after 4753
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :4753 after 212277
At refinement iteration 0 (INCLUDED_ONLY) 0/521 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/521 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
[2025-05-29 20:00:18] [INFO ] Deduced a trap composed of 30 places in 228 ms of which 3 ms to minimize.
[2025-05-29 20:00:19] [INFO ] Deduced a trap composed of 29 places in 279 ms of which 3 ms to minimize.
[2025-05-29 20:00:19] [INFO ] Deduced a trap composed of 32 places in 246 ms of which 4 ms to minimize.
[2025-05-29 20:00:19] [INFO ] Deduced a trap composed of 33 places in 242 ms of which 3 ms to minimize.
[2025-05-29 20:00:19] [INFO ] Deduced a trap composed of 28 places in 265 ms of which 3 ms to minimize.
[2025-05-29 20:00:20] [INFO ] Deduced a trap composed of 36 places in 251 ms of which 4 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :212277 after 8.32761e+06
[2025-05-29 20:00:20] [INFO ] Deduced a trap composed of 25 places in 226 ms of which 3 ms to minimize.
[2025-05-29 20:00:20] [INFO ] Deduced a trap composed of 26 places in 213 ms of which 3 ms to minimize.
[2025-05-29 20:00:20] [INFO ] Deduced a trap composed of 25 places in 207 ms of which 3 ms to minimize.
[2025-05-29 20:00:21] [INFO ] Deduced a trap composed of 33 places in 176 ms of which 3 ms to minimize.
[2025-05-29 20:00:21] [INFO ] Deduced a trap composed of 33 places in 185 ms of which 2 ms to minimize.
[2025-05-29 20:00:21] [INFO ] Deduced a trap composed of 27 places in 167 ms of which 2 ms to minimize.
[2025-05-29 20:00:21] [INFO ] Deduced a trap composed of 26 places in 153 ms of which 2 ms to minimize.
[2025-05-29 20:00:21] [INFO ] Deduced a trap composed of 33 places in 187 ms of which 2 ms to minimize.
[2025-05-29 20:00:22] [INFO ] Deduced a trap composed of 31 places in 191 ms of which 3 ms to minimize.
[2025-05-29 20:00:22] [INFO ] Deduced a trap composed of 30 places in 210 ms of which 3 ms to minimize.
[2025-05-29 20:00:22] [INFO ] Deduced a trap composed of 27 places in 211 ms of which 3 ms to minimize.
[2025-05-29 20:00:22] [INFO ] Deduced a trap composed of 30 places in 206 ms of which 3 ms to minimize.
[2025-05-29 20:00:23] [INFO ] Deduced a trap composed of 26 places in 226 ms of which 2 ms to minimize.
[2025-05-29 20:00:23] [INFO ] Deduced a trap composed of 25 places in 175 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/521 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
[2025-05-29 20:00:24] [INFO ] Deduced a trap composed of 25 places in 204 ms of which 3 ms to minimize.
[2025-05-29 20:00:24] [INFO ] Deduced a trap composed of 24 places in 202 ms of which 3 ms to minimize.
[2025-05-29 20:00:24] [INFO ] Deduced a trap composed of 26 places in 184 ms of which 3 ms to minimize.
[2025-05-29 20:00:24] [INFO ] Deduced a trap composed of 26 places in 218 ms of which 3 ms to minimize.
[2025-05-29 20:00:24] [INFO ] Deduced a trap composed of 27 places in 189 ms of which 2 ms to minimize.
[2025-05-29 20:00:25] [INFO ] Deduced a trap composed of 27 places in 184 ms of which 3 ms to minimize.
[2025-05-29 20:00:25] [INFO ] Deduced a trap composed of 27 places in 190 ms of which 2 ms to minimize.
[2025-05-29 20:00:25] [INFO ] Deduced a trap composed of 26 places in 178 ms of which 2 ms to minimize.
[2025-05-29 20:00:25] [INFO ] Deduced a trap composed of 26 places in 174 ms of which 2 ms to minimize.
[2025-05-29 20:00:25] [INFO ] Deduced a trap composed of 27 places in 145 ms of which 2 ms to minimize.
[2025-05-29 20:00:26] [INFO ] Deduced a trap composed of 2 places in 425 ms of which 4 ms to minimize.
[2025-05-29 20:00:26] [INFO ] Deduced a trap composed of 22 places in 454 ms of which 4 ms to minimize.
[2025-05-29 20:00:27] [INFO ] Deduced a trap composed of 2 places in 404 ms of which 4 ms to minimize.
[2025-05-29 20:00:27] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 2 ms to minimize.
SMT process timed out in 31138ms, After SMT, problems are : Problem set: 0 solved, 1645 unsolved
Search for dead transitions found 0 dead transitions in 31167ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38814 ms. Remains : 522/522 places, 1665/1665 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1542 edges and 522 vertex of which 438 / 522 are part of one of the 2 SCC in 1 ms
Free SCC test removed 436 places
Drop transitions (Empty/Sink Transition effects.) removed 1164 transitions
Ensure Unique test removed 412 transitions
Reduce isomorphic transitions removed 1576 transitions.
Graph (complete) has 211 edges and 86 vertex of which 25 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.0 ms
Discarding 61 places :
Also discarding 19 output transitions
Drop transitions (Output transitions of discarded places.) removed 19 transitions
Drop transitions (Empty/Sink Transition effects.) removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 25 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 24 transition count 28
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 63 place count 6 transition count 10
Iterating global reduction 2 with 18 rules applied. Total rules applied 81 place count 6 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 83 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 86 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 4 transition count 5
Applied a total of 87 rules in 12 ms. Remains 4 /522 variables (removed 518) and now considering 5/1665 (removed 1660) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 4 cols
[2025-05-29 20:00:27] [INFO ] Computed 0 invariants in 0 ms
[2025-05-29 20:00:27] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-29 20:00:27] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-29 20:00:27] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-29 20:00:27] [INFO ] After 29ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-05-29 20:00:27] [INFO ] Flatten gal took : 0 ms
[2025-05-29 20:00:27] [INFO ] Flatten gal took : 1 ms
[2025-05-29 20:00:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10013640402814214937.gal : 2 ms
[2025-05-29 20:00:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5423667855728004963.prop : 0 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/ReachabilityCardinality10013640402814214937.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5423667855728004963.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 ...329
Loading property file /tmp/ReachabilityCardinality5423667855728004963.prop.
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 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,6,0.001972,3520,2,7,6,33,6,0,21,18,0
Total reachable state count : 6

Verifying 1 reachability properties.
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,0.002303,3896,2,5,6,33,7,0,24,18,0
Over-approximation ignoring read arcs solved 0 properties in 83 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[20]
Ending property specific reduction for CANInsertWithFailure-PT-020-UpperBounds-04 in 122922 ms.
Starting property specific reduction for CANInsertWithFailure-PT-020-UpperBounds-05
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[20]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[20]
// Phase 1: matrix 1674 rows 531 cols
[2025-05-29 20:00:27] [INFO ] Computed 22 invariants in 14 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[20]
RANDOM walk for 10000 steps (103 resets) in 51 ms. (192 steps per ms)
BEST_FIRST walk for 10001 steps (4 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[20]
[2025-05-29 20:00:27] [INFO ] Invariant cache hit.
[2025-05-29 20:00:27] [INFO ] [Real]Absence check using 20 positive place invariants in 12 ms returned sat
[2025-05-29 20:00:27] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2025-05-29 20:00:28] [INFO ] [Real]Absence check using state equation in 474 ms returned sat
[2025-05-29 20:00:28] [INFO ] State equation strengthened by 1582 read => feed constraints.
[2025-05-29 20:00:28] [INFO ] [Real]Added 1582 Read/Feed constraints in 296 ms returned sat
[2025-05-29 20:00:28] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:00:28] [INFO ] [Nat]Absence check using 20 positive place invariants in 20 ms returned sat
[2025-05-29 20:00:28] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 9 ms returned sat
[2025-05-29 20:00:29] [INFO ] [Nat]Absence check using state equation in 698 ms returned sat
[2025-05-29 20:00:29] [INFO ] [Nat]Added 1582 Read/Feed constraints in 282 ms returned sat
[2025-05-29 20:00:29] [INFO ] Computed and/alt/rep : 1160/3017/1160 causal constraints (skipped 494 transitions) in 187 ms.
[2025-05-29 20:00:30] [INFO ] Added : 7 causal constraints over 3 iterations in 737 ms. Result :sat
Minimization took 577 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[20]
Support contains 1 out of 531 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 531/531 places, 1674/1674 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 524 transition count 1667
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 524 transition count 1666
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 16 place count 523 transition count 1666
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 24 place count 523 transition count 1666
Applied a total of 24 rules in 170 ms. Remains 523 /531 variables (removed 8) and now considering 1666/1674 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 523/531 places, 1666/1674 transitions.
// Phase 1: matrix 1666 rows 523 cols
[2025-05-29 20:00:31] [INFO ] Computed 22 invariants in 22 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[20]
RANDOM walk for 1000000 steps (10505 resets) in 5067 ms. (197 steps per ms)
BEST_FIRST walk for 1000001 steps (479 resets) in 930 ms. (1074 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[20]
[2025-05-29 20:00:37] [INFO ] Invariant cache hit.
[2025-05-29 20:00:37] [INFO ] [Real]Absence check using 20 positive place invariants in 13 ms returned sat
[2025-05-29 20:00:37] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2025-05-29 20:00:37] [INFO ] [Real]Absence check using state equation in 610 ms returned sat
[2025-05-29 20:00:38] [INFO ] State equation strengthened by 1604 read => feed constraints.
[2025-05-29 20:00:38] [INFO ] [Real]Added 1604 Read/Feed constraints in 185 ms returned sat
[2025-05-29 20:00:38] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:00:38] [INFO ] [Nat]Absence check using 20 positive place invariants in 13 ms returned sat
[2025-05-29 20:00:38] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2025-05-29 20:00:39] [INFO ] [Nat]Absence check using state equation in 609 ms returned sat
[2025-05-29 20:00:39] [INFO ] [Nat]Added 1604 Read/Feed constraints in 195 ms returned sat
[2025-05-29 20:00:39] [INFO ] Computed and/alt/rep : 1152/3049/1152 causal constraints (skipped 494 transitions) in 118 ms.
[2025-05-29 20:00:39] [INFO ] Added : 8 causal constraints over 2 iterations in 405 ms. Result :sat
Minimization took 3765 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[20]
Support contains 1 out of 523 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1666/1666 transitions.
Applied a total of 0 rules in 28 ms. Remains 523 /523 variables (removed 0) and now considering 1666/1666 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 523/523 places, 1666/1666 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1666/1666 transitions.
Applied a total of 0 rules in 28 ms. Remains 523 /523 variables (removed 0) and now considering 1666/1666 (removed 0) transitions.
[2025-05-29 20:00:43] [INFO ] Invariant cache hit.
[2025-05-29 20:00:44] [INFO ] Implicit Places using invariants in 820 ms returned []
[2025-05-29 20:00:44] [INFO ] Invariant cache hit.
[2025-05-29 20:00:45] [INFO ] State equation strengthened by 1604 read => feed constraints.
[2025-05-29 20:00:52] [INFO ] Implicit Places using invariants and state equation in 7801 ms returned []
Implicit Place search using SMT with State Equation took 8627 ms to find 0 implicit places.
[2025-05-29 20:00:52] [INFO ] Redundant transitions in 45 ms returned []
Running 1646 sub problems to find dead transitions.
[2025-05-29 20:00:52] [INFO ] Invariant cache hit.
[2025-05-29 20:00:52] [INFO ] State equation strengthened by 1604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/522 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/522 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
[2025-05-29 20:01:20] [INFO ] Deduced a trap composed of 25 places in 382 ms of which 6 ms to minimize.
[2025-05-29 20:01:20] [INFO ] Deduced a trap composed of 25 places in 377 ms of which 5 ms to minimize.
[2025-05-29 20:01:21] [INFO ] Deduced a trap composed of 27 places in 317 ms of which 4 ms to minimize.
[2025-05-29 20:01:21] [INFO ] Deduced a trap composed of 24 places in 316 ms of which 5 ms to minimize.
[2025-05-29 20:01:22] [INFO ] Deduced a trap composed of 26 places in 268 ms of which 4 ms to minimize.
[2025-05-29 20:01:22] [INFO ] Deduced a trap composed of 27 places in 276 ms of which 4 ms to minimize.
[2025-05-29 20:01:22] [INFO ] Deduced a trap composed of 27 places in 256 ms of which 4 ms to minimize.
[2025-05-29 20:01:22] [INFO ] Deduced a trap composed of 26 places in 252 ms of which 3 ms to minimize.
[2025-05-29 20:01:23] [INFO ] Deduced a trap composed of 26 places in 221 ms of which 3 ms to minimize.
[2025-05-29 20:01:23] [INFO ] Deduced a trap composed of 27 places in 224 ms of which 3 ms to minimize.
SMT process timed out in 31157ms, After SMT, problems are : Problem set: 0 solved, 1646 unsolved
Search for dead transitions found 0 dead transitions in 31178ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39889 ms. Remains : 523/523 places, 1666/1666 transitions.
[2025-05-29 20:01:23] [INFO ] Flatten gal took : 134 ms
[2025-05-29 20:01:23] [INFO ] Flatten gal took : 65 ms
[2025-05-29 20:01:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10390182865026420529.gal : 8 ms
[2025-05-29 20:01:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2986683522571652691.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/ReachabilityCardinality10390182865026420529.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2986683522571652691.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 ...329
RANDOM walk for 40000 steps (418 resets) in 1098 ms. (36 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (18 resets) in 124 ms. (320 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (16 resets) in 92 ms. (430 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality2986683522571652691.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 147
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :147 after 150
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :150 after 151
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :151 after 155
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :155 after 156
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :156 after 157
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :157 after 163
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :163 after 174
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :174 after 199
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :199 after 235
Interrupted probabilistic random walk after 279750 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :0 out of 2
Probabilistic random walk after 279750 steps, saw 39581 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :0
[2025-05-29 20:01:26] [INFO ] Invariant cache hit.
[2025-05-29 20:01:26] [INFO ] State equation strengthened by 1604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 480/481 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-29 20:01:27] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 38/519 variables, 19/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/519 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/521 variables, 2/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :235 after 319
[2025-05-29 20:01:27] [INFO ] Deduced a trap composed of 25 places in 435 ms of which 5 ms to minimize.
[2025-05-29 20:01:28] [INFO ] Deduced a trap composed of 31 places in 432 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/521 variables, 2/25 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/521 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1666/2187 variables, 521/546 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2187 variables, 1604/2150 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2187 variables, 0/2150 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/2189 variables, 2/2152 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2189 variables, 0/2152 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2189 variables, 0/2152 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2189/2189 variables, and 2152 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1945 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 523/523 constraints, ReadFeed: 1604/1604 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 480/481 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 38/519 variables, 19/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/519 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/521 variables, 2/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/521 variables, 2/25 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :319 after 453
[2025-05-29 20:01:29] [INFO ] Deduced a trap composed of 31 places in 447 ms of which 5 ms to minimize.
[2025-05-29 20:01:29] [INFO ] Deduced a trap composed of 31 places in 443 ms of which 5 ms to minimize.
[2025-05-29 20:01:30] [INFO ] Deduced a trap composed of 31 places in 445 ms of which 5 ms to minimize.
[2025-05-29 20:01:30] [INFO ] Deduced a trap composed of 29 places in 437 ms of which 5 ms to minimize.
[2025-05-29 20:01:31] [INFO ] Deduced a trap composed of 28 places in 442 ms of which 5 ms to minimize.
[2025-05-29 20:01:31] [INFO ] Deduced a trap composed of 27 places in 438 ms of which 5 ms to minimize.
[2025-05-29 20:01:32] [INFO ] Deduced a trap composed of 26 places in 440 ms of which 4 ms to minimize.
[2025-05-29 20:01:32] [INFO ] Deduced a trap composed of 29 places in 400 ms of which 4 ms to minimize.
[2025-05-29 20:01:32] [INFO ] Deduced a trap composed of 29 places in 411 ms of which 5 ms to minimize.
[2025-05-29 20:01:33] [INFO ] Deduced a trap composed of 29 places in 402 ms of which 5 ms to minimize.
[2025-05-29 20:01:33] [INFO ] Deduced a trap composed of 26 places in 382 ms of which 5 ms to minimize.
[2025-05-29 20:01:34] [INFO ] Deduced a trap composed of 25 places in 358 ms of which 4 ms to minimize.
SMT process timed out in 7273ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 523 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1666/1666 transitions.
Applied a total of 0 rules in 29 ms. Remains 523 /523 variables (removed 0) and now considering 1666/1666 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 523/523 places, 1666/1666 transitions.
RANDOM walk for 40000 steps (419 resets) in 312 ms. (127 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (17 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :453 after 7474
Interrupted probabilistic random walk after 389685 steps, run timeout after 3001 ms. (steps per millisecond=129 ) properties seen :0 out of 1
Probabilistic random walk after 389685 steps, saw 51465 distinct states, run finished after 3001 ms. (steps per millisecond=129 ) properties seen :0
[2025-05-29 20:01:37] [INFO ] Invariant cache hit.
[2025-05-29 20:01:37] [INFO ] State equation strengthened by 1604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 480/481 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:01:37] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
[2025-05-29 20:01:37] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 1 ms to minimize.
[2025-05-29 20:01:37] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 1 ms to minimize.
[2025-05-29 20:01:37] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 1 ms to minimize.
[2025-05-29 20:01:37] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
[2025-05-29 20:01:37] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
[2025-05-29 20:01:37] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 1 ms to minimize.
[2025-05-29 20:01:37] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 0 ms to minimize.
[2025-05-29 20:01:37] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
[2025-05-29 20:01:37] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
[2025-05-29 20:01:37] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2025-05-29 20:01:37] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2025-05-29 20:01:37] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
[2025-05-29 20:01:37] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2025-05-29 20:01:38] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
[2025-05-29 20:01:38] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 38/519 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/519 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/521 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/521 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1666/2187 variables, 521/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2187 variables, 1604/2163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2187 variables, 0/2163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/2189 variables, 2/2165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2189 variables, 0/2165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/2189 variables, 0/2165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2189/2189 variables, and 2165 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1586 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 523/523 constraints, ReadFeed: 1604/1604 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 480/481 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:01:39] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2025-05-29 20:01:39] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2025-05-29 20:01:39] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/481 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 38/519 variables, 19/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/519 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/521 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:01:39] [INFO ] Deduced a trap composed of 25 places in 461 ms of which 5 ms to minimize.
[2025-05-29 20:01:40] [INFO ] Deduced a trap composed of 25 places in 440 ms of which 6 ms to minimize.
[2025-05-29 20:01:40] [INFO ] Deduced a trap composed of 25 places in 447 ms of which 5 ms to minimize.
[2025-05-29 20:01:41] [INFO ] Deduced a trap composed of 25 places in 454 ms of which 6 ms to minimize.
[2025-05-29 20:01:41] [INFO ] Deduced a trap composed of 29 places in 457 ms of which 5 ms to minimize.
[2025-05-29 20:01:41] [INFO ] Deduced a trap composed of 26 places in 456 ms of which 5 ms to minimize.
[2025-05-29 20:01:42] [INFO ] Deduced a trap composed of 25 places in 454 ms of which 5 ms to minimize.
[2025-05-29 20:01:42] [INFO ] Deduced a trap composed of 26 places in 436 ms of which 5 ms to minimize.
[2025-05-29 20:01:43] [INFO ] Deduced a trap composed of 25 places in 453 ms of which 5 ms to minimize.
[2025-05-29 20:01:43] [INFO ] Deduced a trap composed of 32 places in 458 ms of which 5 ms to minimize.
[2025-05-29 20:01:44] [INFO ] Deduced a trap composed of 29 places in 447 ms of which 5 ms to minimize.
[2025-05-29 20:01:44] [INFO ] Deduced a trap composed of 26 places in 446 ms of which 5 ms to minimize.
[2025-05-29 20:01:45] [INFO ] Deduced a trap composed of 26 places in 448 ms of which 5 ms to minimize.
[2025-05-29 20:01:45] [INFO ] Deduced a trap composed of 28 places in 449 ms of which 5 ms to minimize.
[2025-05-29 20:01:46] [INFO ] Deduced a trap composed of 26 places in 435 ms of which 5 ms to minimize.
[2025-05-29 20:01:46] [INFO ] Deduced a trap composed of 24 places in 445 ms of which 5 ms to minimize.
[2025-05-29 20:01:47] [INFO ] Deduced a trap composed of 25 places in 444 ms of which 5 ms to minimize.
[2025-05-29 20:01:47] [INFO ] Deduced a trap composed of 31 places in 454 ms of which 5 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :7474 after 9188
[2025-05-29 20:01:47] [INFO ] Deduced a trap composed of 32 places in 461 ms of which 5 ms to minimize.
[2025-05-29 20:01:48] [INFO ] Deduced a trap composed of 25 places in 436 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/521 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:01:48] [INFO ] Deduced a trap composed of 27 places in 441 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/521 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/521 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1666/2187 variables, 521/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2187 variables, 1604/2187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2187 variables, 1/2188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2187 variables, 0/2188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/2189 variables, 2/2190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2189 variables, 0/2190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2189 variables, 0/2190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2189/2189 variables, and 2190 constraints, problems are : Problem set: 0 solved, 1 unsolved in 11441 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 523/523 constraints, ReadFeed: 1604/1604 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 40/40 constraints]
After SMT, in 13051ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 523 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1666/1666 transitions.
Applied a total of 0 rules in 29 ms. Remains 523 /523 variables (removed 0) and now considering 1666/1666 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 523/523 places, 1666/1666 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1666/1666 transitions.
Applied a total of 0 rules in 29 ms. Remains 523 /523 variables (removed 0) and now considering 1666/1666 (removed 0) transitions.
[2025-05-29 20:01:50] [INFO ] Invariant cache hit.
[2025-05-29 20:01:51] [INFO ] Implicit Places using invariants in 604 ms returned []
[2025-05-29 20:01:51] [INFO ] Invariant cache hit.
[2025-05-29 20:01:51] [INFO ] State equation strengthened by 1604 read => feed constraints.
[2025-05-29 20:01:59] [INFO ] Implicit Places using invariants and state equation in 8057 ms returned []
Implicit Place search using SMT with State Equation took 8664 ms to find 0 implicit places.
[2025-05-29 20:01:59] [INFO ] Redundant transitions in 38 ms returned []
Running 1646 sub problems to find dead transitions.
[2025-05-29 20:01:59] [INFO ] Invariant cache hit.
[2025-05-29 20:01:59] [INFO ] State equation strengthened by 1604 read => feed constraints.
Detected timeout of ITS tools.
[2025-05-29 20:02:13] [INFO ] Flatten gal took : 36 ms
[2025-05-29 20:02:13] [INFO ] Applying decomposition
[2025-05-29 20:02:13] [INFO ] Flatten gal took : 38 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/graph3229624885811521923.txt' '-o' '/tmp/graph3229624885811521923.bin' '-w' '/tmp/graph3229624885811521923.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3229624885811521923.bin' '-l' '-1' '-v' '-w' '/tmp/graph3229624885811521923.weights' '-q' '0' '-e' '0.001'
[2025-05-29 20:02:14] [INFO ] Decomposing Gal with order
[2025-05-29 20:02:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 20:02:14] [INFO ] Removed a total of 1283 redundant transitions.
[2025-05-29 20:02:14] [INFO ] Flatten gal took : 91 ms
[2025-05-29 20:02:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 1428 labels/synchronizations in 37 ms.
[2025-05-29 20:02:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13020425814870869989.gal : 16 ms
[2025-05-29 20:02:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3407555855008620719.prop : 0 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/ReachabilityCardinality13020425814870869989.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3407555855008620719.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 ...308
Loading property file /tmp/ReachabilityCardinality3407555855008620719.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 617
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :617 after 617
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :617 after 617
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :617 after 617
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :617 after 617
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :617 after 617
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :617 after 617
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :617 after 617
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :617 after 2008
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2008 after 106291
At refinement iteration 0 (INCLUDED_ONLY) 0/522 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :106291 after 3.32583e+06
At refinement iteration 1 (INCLUDED_ONLY) 0/522 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
[2025-05-29 20:02:20] [INFO ] Deduced a trap composed of 25 places in 309 ms of which 3 ms to minimize.
[2025-05-29 20:02:20] [INFO ] Deduced a trap composed of 25 places in 308 ms of which 3 ms to minimize.
[2025-05-29 20:02:20] [INFO ] Deduced a trap composed of 27 places in 256 ms of which 5 ms to minimize.
[2025-05-29 20:02:20] [INFO ] Deduced a trap composed of 24 places in 247 ms of which 3 ms to minimize.
[2025-05-29 20:02:21] [INFO ] Deduced a trap composed of 26 places in 200 ms of which 3 ms to minimize.
[2025-05-29 20:02:21] [INFO ] Deduced a trap composed of 27 places in 189 ms of which 2 ms to minimize.
[2025-05-29 20:02:21] [INFO ] Deduced a trap composed of 27 places in 155 ms of which 2 ms to minimize.
[2025-05-29 20:02:21] [INFO ] Deduced a trap composed of 26 places in 175 ms of which 2 ms to minimize.
[2025-05-29 20:02:21] [INFO ] Deduced a trap composed of 26 places in 154 ms of which 2 ms to minimize.
[2025-05-29 20:02:22] [INFO ] Deduced a trap composed of 27 places in 151 ms of which 2 ms to minimize.
[2025-05-29 20:02:22] [INFO ] Deduced a trap composed of 26 places in 136 ms of which 2 ms to minimize.
[2025-05-29 20:02:22] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 2 ms to minimize.
[2025-05-29 20:02:22] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 2 ms to minimize.
[2025-05-29 20:02:22] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 2 ms to minimize.
[2025-05-29 20:02:22] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 2 ms to minimize.
[2025-05-29 20:02:22] [INFO ] Deduced a trap composed of 25 places in 172 ms of which 6 ms to minimize.
[2025-05-29 20:02:23] [INFO ] Deduced a trap composed of 22 places in 485 ms of which 5 ms to minimize.
[2025-05-29 20:02:23] [INFO ] Deduced a trap composed of 22 places in 337 ms of which 4 ms to minimize.
[2025-05-29 20:02:24] [INFO ] Deduced a trap composed of 2 places in 680 ms of which 11 ms to minimize.
[2025-05-29 20:02:24] [INFO ] Deduced a trap composed of 3 places in 530 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/522 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :3.32583e+06 after 4.40399e+06
[2025-05-29 20:02:26] [INFO ] Deduced a trap composed of 27 places in 386 ms of which 6 ms to minimize.
[2025-05-29 20:02:26] [INFO ] Deduced a trap composed of 27 places in 293 ms of which 5 ms to minimize.
[2025-05-29 20:02:26] [INFO ] Deduced a trap composed of 25 places in 289 ms of which 14 ms to minimize.
[2025-05-29 20:02:26] [INFO ] Deduced a trap composed of 25 places in 211 ms of which 2 ms to minimize.
[2025-05-29 20:02:27] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 1 ms to minimize.
[2025-05-29 20:02:27] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2025-05-29 20:02:27] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2025-05-29 20:02:27] [INFO ] Deduced a trap composed of 25 places in 312 ms of which 4 ms to minimize.
[2025-05-29 20:02:27] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2025-05-29 20:02:27] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2025-05-29 20:02:27] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2025-05-29 20:02:27] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2025-05-29 20:02:27] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2025-05-29 20:02:28] [INFO ] Deduced a trap composed of 29 places in 236 ms of which 3 ms to minimize.
[2025-05-29 20:02:28] [INFO ] Deduced a trap composed of 28 places in 215 ms of which 4 ms to minimize.
[2025-05-29 20:02:28] [INFO ] Deduced a trap composed of 29 places in 199 ms of which 3 ms to minimize.
[2025-05-29 20:02:28] [INFO ] Deduced a trap composed of 28 places in 163 ms of which 3 ms to minimize.
[2025-05-29 20:02:29] [INFO ] Deduced a trap composed of 26 places in 194 ms of which 3 ms to minimize.
[2025-05-29 20:02:29] [INFO ] Deduced a trap composed of 26 places in 194 ms of which 2 ms to minimize.
[2025-05-29 20:02:29] [INFO ] Deduced a trap composed of 26 places in 216 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/522 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 522/2189 variables, and 62 constraints, problems are : Problem set: 0 solved, 1646 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/523 constraints, ReadFeed: 0/1604 constraints, PredecessorRefiner: 1646/1646 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1646 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/522 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/522 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/522 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
[2025-05-29 20:02:33] [INFO ] Deduced a trap composed of 31 places in 299 ms of which 5 ms to minimize.
[2025-05-29 20:02:33] [INFO ] Deduced a trap composed of 33 places in 367 ms of which 5 ms to minimize.
[2025-05-29 20:02:34] [INFO ] Deduced a trap composed of 32 places in 347 ms of which 4 ms to minimize.
[2025-05-29 20:02:34] [INFO ] Deduced a trap composed of 33 places in 280 ms of which 4 ms to minimize.
[2025-05-29 20:02:34] [INFO ] Deduced a trap composed of 32 places in 282 ms of which 4 ms to minimize.
[2025-05-29 20:02:35] [INFO ] Deduced a trap composed of 30 places in 264 ms of which 4 ms to minimize.
[2025-05-29 20:02:35] [INFO ] Deduced a trap composed of 28 places in 270 ms of which 4 ms to minimize.
[2025-05-29 20:02:35] [INFO ] Deduced a trap composed of 27 places in 272 ms of which 4 ms to minimize.
[2025-05-29 20:02:36] [INFO ] Deduced a trap composed of 32 places in 280 ms of which 4 ms to minimize.
[2025-05-29 20:02:36] [INFO ] Deduced a trap composed of 32 places in 273 ms of which 4 ms to minimize.
[2025-05-29 20:02:36] [INFO ] Deduced a trap composed of 33 places in 272 ms of which 4 ms to minimize.
[2025-05-29 20:02:36] [INFO ] Deduced a trap composed of 28 places in 288 ms of which 4 ms to minimize.
[2025-05-29 20:02:37] [INFO ] Deduced a trap composed of 39 places in 266 ms of which 3 ms to minimize.
[2025-05-29 20:02:37] [INFO ] Deduced a trap composed of 32 places in 304 ms of which 5 ms to minimize.
[2025-05-29 20:02:37] [INFO ] Deduced a trap composed of 30 places in 363 ms of which 6 ms to minimize.
[2025-05-29 20:02:38] [INFO ] Deduced a trap composed of 32 places in 322 ms of which 5 ms to minimize.
[2025-05-29 20:02:38] [INFO ] Deduced a trap composed of 26 places in 342 ms of which 5 ms to minimize.
[2025-05-29 20:02:38] [INFO ] Deduced a trap composed of 31 places in 308 ms of which 4 ms to minimize.
[2025-05-29 20:02:39] [INFO ] Deduced a trap composed of 32 places in 294 ms of which 5 ms to minimize.
[2025-05-29 20:02:39] [INFO ] Deduced a trap composed of 32 places in 302 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/522 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
[2025-05-29 20:02:40] [INFO ] Deduced a trap composed of 26 places in 290 ms of which 5 ms to minimize.
[2025-05-29 20:02:41] [INFO ] Deduced a trap composed of 26 places in 284 ms of which 5 ms to minimize.
[2025-05-29 20:02:41] [INFO ] Deduced a trap composed of 27 places in 305 ms of which 4 ms to minimize.
[2025-05-29 20:02:41] [INFO ] Deduced a trap composed of 27 places in 293 ms of which 5 ms to minimize.
[2025-05-29 20:02:41] [INFO ] Deduced a trap composed of 27 places in 261 ms of which 4 ms to minimize.
[2025-05-29 20:02:42] [INFO ] Deduced a trap composed of 28 places in 280 ms of which 4 ms to minimize.
[2025-05-29 20:02:42] [INFO ] Deduced a trap composed of 28 places in 249 ms of which 4 ms to minimize.
[2025-05-29 20:02:42] [INFO ] Deduced a trap composed of 27 places in 251 ms of which 3 ms to minimize.
[2025-05-29 20:02:42] [INFO ] Deduced a trap composed of 26 places in 247 ms of which 3 ms to minimize.
[2025-05-29 20:02:43] [INFO ] Deduced a trap composed of 27 places in 222 ms of which 4 ms to minimize.
[2025-05-29 20:02:43] [INFO ] Deduced a trap composed of 27 places in 219 ms of which 4 ms to minimize.
[2025-05-29 20:02:43] [INFO ] Deduced a trap composed of 25 places in 194 ms of which 3 ms to minimize.
[2025-05-29 20:02:43] [INFO ] Deduced a trap composed of 28 places in 204 ms of which 3 ms to minimize.
[2025-05-29 20:02:44] [INFO ] Deduced a trap composed of 30 places in 181 ms of which 3 ms to minimize.
[2025-05-29 20:02:44] [INFO ] Deduced a trap composed of 26 places in 162 ms of which 3 ms to minimize.
[2025-05-29 20:02:44] [INFO ] Deduced a trap composed of 29 places in 173 ms of which 3 ms to minimize.
[2025-05-29 20:02:44] [INFO ] Deduced a trap composed of 25 places in 148 ms of which 2 ms to minimize.
[2025-05-29 20:02:44] [INFO ] Deduced a trap composed of 26 places in 151 ms of which 3 ms to minimize.
[2025-05-29 20:02:44] [INFO ] Deduced a trap composed of 27 places in 150 ms of which 2 ms to minimize.
[2025-05-29 20:02:45] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/522 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
[2025-05-29 20:02:46] [INFO ] Deduced a trap composed of 24 places in 215 ms of which 4 ms to minimize.
[2025-05-29 20:02:46] [INFO ] Deduced a trap composed of 29 places in 249 ms of which 4 ms to minimize.
[2025-05-29 20:02:46] [INFO ] Deduced a trap composed of 25 places in 258 ms of which 4 ms to minimize.
[2025-05-29 20:02:47] [INFO ] Deduced a trap composed of 25 places in 231 ms of which 3 ms to minimize.
[2025-05-29 20:02:47] [INFO ] Deduced a trap composed of 27 places in 230 ms of which 4 ms to minimize.
[2025-05-29 20:02:47] [INFO ] Deduced a trap composed of 26 places in 252 ms of which 4 ms to minimize.
[2025-05-29 20:02:47] [INFO ] Deduced a trap composed of 27 places in 226 ms of which 4 ms to minimize.
[2025-05-29 20:02:47] [INFO ] Deduced a trap composed of 27 places in 175 ms of which 4 ms to minimize.
[2025-05-29 20:02:48] [INFO ] Deduced a trap composed of 26 places in 180 ms of which 3 ms to minimize.
[2025-05-29 20:02:48] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 3 ms to minimize.
[2025-05-29 20:02:48] [INFO ] Deduced a trap composed of 26 places in 133 ms of which 3 ms to minimize.
[2025-05-29 20:02:48] [INFO ] Deduced a trap composed of 28 places in 151 ms of which 2 ms to minimize.
[2025-05-29 20:02:48] [INFO ] Deduced a trap composed of 27 places in 186 ms of which 3 ms to minimize.
[2025-05-29 20:02:48] [INFO ] Deduced a trap composed of 26 places in 183 ms of which 3 ms to minimize.
[2025-05-29 20:02:49] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 2 ms to minimize.
[2025-05-29 20:02:49] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 2 ms to minimize.
[2025-05-29 20:02:49] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 2 ms to minimize.
[2025-05-29 20:02:49] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 3 ms to minimize.
[2025-05-29 20:02:49] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 3 ms to minimize.
[2025-05-29 20:02:49] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/522 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
[2025-05-29 20:02:50] [INFO ] Deduced a trap composed of 29 places in 233 ms of which 4 ms to minimize.
[2025-05-29 20:02:51] [INFO ] Deduced a trap composed of 27 places in 178 ms of which 4 ms to minimize.
[2025-05-29 20:02:51] [INFO ] Deduced a trap composed of 25 places in 195 ms of which 3 ms to minimize.
[2025-05-29 20:02:51] [INFO ] Deduced a trap composed of 26 places in 150 ms of which 3 ms to minimize.
[2025-05-29 20:02:51] [INFO ] Deduced a trap composed of 26 places in 230 ms of which 4 ms to minimize.
[2025-05-29 20:02:51] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 2 ms to minimize.
[2025-05-29 20:02:52] [INFO ] Deduced a trap composed of 28 places in 201 ms of which 3 ms to minimize.
[2025-05-29 20:02:52] [INFO ] Deduced a trap composed of 25 places in 210 ms of which 3 ms to minimize.
[2025-05-29 20:02:52] [INFO ] Deduced a trap composed of 24 places in 140 ms of which 3 ms to minimize.
[2025-05-29 20:02:52] [INFO ] Deduced a trap composed of 24 places in 160 ms of which 3 ms to minimize.
[2025-05-29 20:02:52] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 3 ms to minimize.
[2025-05-29 20:02:53] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 3 ms to minimize.
[2025-05-29 20:02:53] [INFO ] Deduced a trap composed of 35 places in 140 ms of which 3 ms to minimize.
[2025-05-29 20:02:53] [INFO ] Deduced a trap composed of 27 places in 155 ms of which 3 ms to minimize.
[2025-05-29 20:02:53] [INFO ] Deduced a trap composed of 29 places in 139 ms of which 3 ms to minimize.
[2025-05-29 20:02:53] [INFO ] Deduced a trap composed of 29 places in 134 ms of which 3 ms to minimize.
[2025-05-29 20:02:53] [INFO ] Deduced a trap composed of 27 places in 188 ms of which 3 ms to minimize.
[2025-05-29 20:02:54] [INFO ] Deduced a trap composed of 29 places in 137 ms of which 3 ms to minimize.
[2025-05-29 20:02:54] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 3 ms to minimize.
[2025-05-29 20:02:54] [INFO ] Deduced a trap composed of 27 places in 198 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
[2025-05-29 20:02:55] [INFO ] Deduced a trap composed of 26 places in 235 ms of which 4 ms to minimize.
[2025-05-29 20:02:56] [INFO ] Deduced a trap composed of 27 places in 280 ms of which 5 ms to minimize.
[2025-05-29 20:02:56] [INFO ] Deduced a trap composed of 29 places in 275 ms of which 4 ms to minimize.
[2025-05-29 20:02:56] [INFO ] Deduced a trap composed of 25 places in 240 ms of which 4 ms to minimize.
[2025-05-29 20:02:56] [INFO ] Deduced a trap composed of 32 places in 242 ms of which 4 ms to minimize.
[2025-05-29 20:02:56] [INFO ] Deduced a trap composed of 30 places in 147 ms of which 3 ms to minimize.
[2025-05-29 20:02:57] [INFO ] Deduced a trap composed of 27 places in 243 ms of which 4 ms to minimize.
[2025-05-29 20:02:57] [INFO ] Deduced a trap composed of 24 places in 175 ms of which 4 ms to minimize.
[2025-05-29 20:02:57] [INFO ] Deduced a trap composed of 29 places in 213 ms of which 4 ms to minimize.
[2025-05-29 20:02:57] [INFO ] Deduced a trap composed of 26 places in 245 ms of which 4 ms to minimize.
[2025-05-29 20:02:58] [INFO ] Deduced a trap composed of 34 places in 153 ms of which 3 ms to minimize.
[2025-05-29 20:02:58] [INFO ] Deduced a trap composed of 30 places in 153 ms of which 3 ms to minimize.
[2025-05-29 20:02:58] [INFO ] Deduced a trap composed of 29 places in 241 ms of which 4 ms to minimize.
[2025-05-29 20:02:58] [INFO ] Deduced a trap composed of 30 places in 246 ms of which 4 ms to minimize.
[2025-05-29 20:02:59] [INFO ] Deduced a trap composed of 33 places in 154 ms of which 4 ms to minimize.
[2025-05-29 20:02:59] [INFO ] Deduced a trap composed of 34 places in 183 ms of which 3 ms to minimize.
[2025-05-29 20:02:59] [INFO ] Deduced a trap composed of 26 places in 211 ms of which 4 ms to minimize.
[2025-05-29 20:02:59] [INFO ] Deduced a trap composed of 29 places in 156 ms of which 3 ms to minimize.
[2025-05-29 20:02:59] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 3 ms to minimize.
[2025-05-29 20:03:00] [INFO ] Deduced a trap composed of 29 places in 173 ms of which 3 ms to minimize.
SMT process timed out in 60865ms, After SMT, problems are : Problem set: 0 solved, 1646 unsolved
Search for dead transitions found 0 dead transitions in 60884ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69628 ms. Remains : 523/523 places, 1666/1666 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1543 edges and 523 vertex of which 439 / 523 are part of one of the 2 SCC in 0 ms
Free SCC test removed 437 places
Drop transitions (Empty/Sink Transition effects.) removed 1165 transitions
Ensure Unique test removed 412 transitions
Reduce isomorphic transitions removed 1577 transitions.
Graph (complete) has 211 edges and 86 vertex of which 25 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.0 ms
Discarding 61 places :
Also discarding 19 output transitions
Drop transitions (Output transitions of discarded places.) removed 19 transitions
Drop transitions (Empty/Sink Transition effects.) removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 25 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 24 transition count 28
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 63 place count 6 transition count 10
Iterating global reduction 2 with 18 rules applied. Total rules applied 81 place count 6 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 83 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 86 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 4 transition count 5
Applied a total of 87 rules in 8 ms. Remains 4 /523 variables (removed 519) and now considering 5/1666 (removed 1661) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 4 cols
[2025-05-29 20:03:00] [INFO ] Computed 0 invariants in 1 ms
[2025-05-29 20:03:00] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-29 20:03:00] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-29 20:03:00] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-29 20:03:00] [INFO ] After 26ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-05-29 20:03:00] [INFO ] Flatten gal took : 1 ms
[2025-05-29 20:03:00] [INFO ] Flatten gal took : 0 ms
[2025-05-29 20:03:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15877124180722825636.gal : 0 ms
[2025-05-29 20:03:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2735079156942555884.prop : 0 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/ReachabilityCardinality15877124180722825636.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2735079156942555884.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 ...329
Loading property file /tmp/ReachabilityCardinality2735079156942555884.prop.
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 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,6,0.004322,3520,2,7,6,33,6,0,21,18,0
Total reachable state count : 6

Verifying 1 reachability properties.
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,0.004905,3896,2,5,6,33,7,0,24,18,0
Over-approximation ignoring read arcs solved 0 properties in 85 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[20]
Ending property specific reduction for CANInsertWithFailure-PT-020-UpperBounds-05 in 152782 ms.
Starting property specific reduction for CANInsertWithFailure-PT-020-UpperBounds-06
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[20]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[20]
// Phase 1: matrix 1674 rows 531 cols
[2025-05-29 20:03:00] [INFO ] Computed 22 invariants in 23 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[20]
RANDOM walk for 10000 steps (105 resets) in 50 ms. (196 steps per ms)
BEST_FIRST walk for 10001 steps (4 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[20]
[2025-05-29 20:03:00] [INFO ] Invariant cache hit.
[2025-05-29 20:03:00] [INFO ] [Real]Absence check using 20 positive place invariants in 13 ms returned sat
[2025-05-29 20:03:00] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2025-05-29 20:03:00] [INFO ] [Real]Absence check using state equation in 499 ms returned sat
[2025-05-29 20:03:00] [INFO ] State equation strengthened by 1582 read => feed constraints.
[2025-05-29 20:03:01] [INFO ] [Real]Added 1582 Read/Feed constraints in 197 ms returned sat
[2025-05-29 20:03:01] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:03:01] [INFO ] [Nat]Absence check using 20 positive place invariants in 14 ms returned sat
[2025-05-29 20:03:01] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2025-05-29 20:03:01] [INFO ] [Nat]Absence check using state equation in 548 ms returned sat
[2025-05-29 20:03:02] [INFO ] [Nat]Added 1582 Read/Feed constraints in 244 ms returned sat
[2025-05-29 20:03:02] [INFO ] Computed and/alt/rep : 1160/3017/1160 causal constraints (skipped 494 transitions) in 125 ms.
[2025-05-29 20:03:02] [INFO ] Added : 9 causal constraints over 2 iterations in 506 ms. Result :sat
Minimization took 563 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[20]
Support contains 1 out of 531 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 531/531 places, 1674/1674 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 523 transition count 1666
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 523 transition count 1665
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 18 place count 522 transition count 1665
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 25 place count 522 transition count 1665
Applied a total of 25 rules in 101 ms. Remains 522 /531 variables (removed 9) and now considering 1665/1674 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 522/531 places, 1665/1674 transitions.
// Phase 1: matrix 1665 rows 522 cols
[2025-05-29 20:03:03] [INFO ] Computed 22 invariants in 14 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[20]
RANDOM walk for 1000000 steps (10535 resets) in 5156 ms. (193 steps per ms)
BEST_FIRST walk for 1000001 steps (476 resets) in 919 ms. (1086 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[20]
[2025-05-29 20:03:09] [INFO ] Invariant cache hit.
[2025-05-29 20:03:09] [INFO ] [Real]Absence check using 20 positive place invariants in 12 ms returned sat
[2025-05-29 20:03:09] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2025-05-29 20:03:09] [INFO ] [Real]Absence check using state equation in 416 ms returned sat
[2025-05-29 20:03:09] [INFO ] State equation strengthened by 1605 read => feed constraints.
[2025-05-29 20:03:10] [INFO ] [Real]Added 1605 Read/Feed constraints in 169 ms returned sat
[2025-05-29 20:03:10] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:03:10] [INFO ] [Nat]Absence check using 20 positive place invariants in 20 ms returned sat
[2025-05-29 20:03:10] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 8 ms returned sat
[2025-05-29 20:03:10] [INFO ] [Nat]Absence check using state equation in 645 ms returned sat
[2025-05-29 20:03:11] [INFO ] [Nat]Added 1605 Read/Feed constraints in 342 ms returned sat
[2025-05-29 20:03:11] [INFO ] Computed and/alt/rep : 1151/3051/1151 causal constraints (skipped 494 transitions) in 179 ms.
[2025-05-29 20:03:12] [INFO ] Added : 8 causal constraints over 2 iterations in 632 ms. Result :sat
Minimization took 4541 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[20]
Support contains 1 out of 522 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 522/522 places, 1665/1665 transitions.
Applied a total of 0 rules in 32 ms. Remains 522 /522 variables (removed 0) and now considering 1665/1665 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 522/522 places, 1665/1665 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 522/522 places, 1665/1665 transitions.
Applied a total of 0 rules in 32 ms. Remains 522 /522 variables (removed 0) and now considering 1665/1665 (removed 0) transitions.
[2025-05-29 20:03:16] [INFO ] Invariant cache hit.
[2025-05-29 20:03:17] [INFO ] Implicit Places using invariants in 987 ms returned []
[2025-05-29 20:03:17] [INFO ] Invariant cache hit.
[2025-05-29 20:03:18] [INFO ] State equation strengthened by 1605 read => feed constraints.
[2025-05-29 20:03:26] [INFO ] Implicit Places using invariants and state equation in 8514 ms returned []
Implicit Place search using SMT with State Equation took 9504 ms to find 0 implicit places.
[2025-05-29 20:03:26] [INFO ] Redundant transitions in 60 ms returned []
Running 1645 sub problems to find dead transitions.
[2025-05-29 20:03:26] [INFO ] Invariant cache hit.
[2025-05-29 20:03:26] [INFO ] State equation strengthened by 1605 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/521 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/521 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
[2025-05-29 20:03:55] [INFO ] Deduced a trap composed of 25 places in 207 ms of which 3 ms to minimize.
[2025-05-29 20:03:55] [INFO ] Deduced a trap composed of 25 places in 308 ms of which 3 ms to minimize.
[2025-05-29 20:03:55] [INFO ] Deduced a trap composed of 27 places in 306 ms of which 4 ms to minimize.
[2025-05-29 20:03:56] [INFO ] Deduced a trap composed of 26 places in 336 ms of which 4 ms to minimize.
[2025-05-29 20:03:56] [INFO ] Deduced a trap composed of 25 places in 287 ms of which 4 ms to minimize.
[2025-05-29 20:03:56] [INFO ] Deduced a trap composed of 26 places in 253 ms of which 3 ms to minimize.
[2025-05-29 20:03:57] [INFO ] Deduced a trap composed of 31 places in 192 ms of which 3 ms to minimize.
[2025-05-29 20:03:57] [INFO ] Deduced a trap composed of 28 places in 186 ms of which 3 ms to minimize.
SMT process timed out in 31007ms, After SMT, problems are : Problem set: 0 solved, 1645 unsolved
Search for dead transitions found 0 dead transitions in 31036ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40647 ms. Remains : 522/522 places, 1665/1665 transitions.
[2025-05-29 20:03:57] [INFO ] Flatten gal took : 119 ms
[2025-05-29 20:03:57] [INFO ] Flatten gal took : 58 ms
[2025-05-29 20:03:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13030749628822923802.gal : 11 ms
[2025-05-29 20:03:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12577747312388032901.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/ReachabilityCardinality13030749628822923802.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12577747312388032901.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 ...330
RANDOM walk for 40000 steps (422 resets) in 671 ms. (59 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (19 resets) in 105 ms. (377 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (16 resets) in 115 ms. (344 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality12577747312388032901.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 147
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :147 after 150
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :150 after 151
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :151 after 155
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :155 after 156
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :156 after 157
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :157 after 163
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :163 after 174
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :174 after 199
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :199 after 235
Interrupted probabilistic random walk after 271852 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :0 out of 2
Probabilistic random walk after 271852 steps, saw 39119 distinct states, run finished after 3001 ms. (steps per millisecond=90 ) properties seen :0
[2025-05-29 20:04:00] [INFO ] Invariant cache hit.
[2025-05-29 20:04:00] [INFO ] State equation strengthened by 1605 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 479/480 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-29 20:04:00] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 2 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/480 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/480 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 38/518 variables, 19/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/518 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/520 variables, 2/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :235 after 319
[2025-05-29 20:04:01] [INFO ] Deduced a trap composed of 25 places in 446 ms of which 5 ms to minimize.
[2025-05-29 20:04:01] [INFO ] Deduced a trap composed of 25 places in 416 ms of which 5 ms to minimize.
[2025-05-29 20:04:02] [INFO ] Deduced a trap composed of 25 places in 404 ms of which 5 ms to minimize.
[2025-05-29 20:04:02] [INFO ] Deduced a trap composed of 28 places in 391 ms of which 5 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :319 after 452
[2025-05-29 20:04:02] [INFO ] Deduced a trap composed of 25 places in 424 ms of which 4 ms to minimize.
[2025-05-29 20:04:03] [INFO ] Deduced a trap composed of 25 places in 366 ms of which 4 ms to minimize.
[2025-05-29 20:04:03] [INFO ] Deduced a trap composed of 25 places in 337 ms of which 4 ms to minimize.
[2025-05-29 20:04:04] [INFO ] Deduced a trap composed of 28 places in 310 ms of which 4 ms to minimize.
[2025-05-29 20:04:04] [INFO ] Deduced a trap composed of 25 places in 295 ms of which 4 ms to minimize.
[2025-05-29 20:04:04] [INFO ] Deduced a trap composed of 25 places in 261 ms of which 3 ms to minimize.
[2025-05-29 20:04:04] [INFO ] Deduced a trap composed of 25 places in 240 ms of which 3 ms to minimize.
[2025-05-29 20:04:05] [INFO ] Deduced a trap composed of 25 places in 221 ms of which 3 ms to minimize.
[2025-05-29 20:04:05] [INFO ] Deduced a trap composed of 34 places in 183 ms of which 2 ms to minimize.
[2025-05-29 20:04:05] [INFO ] Deduced a trap composed of 34 places in 181 ms of which 2 ms to minimize.
[2025-05-29 20:04:05] [INFO ] Deduced a trap composed of 33 places in 184 ms of which 3 ms to minimize.
SMT process timed out in 5086ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 522 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 522/522 places, 1665/1665 transitions.
Applied a total of 0 rules in 52 ms. Remains 522 /522 variables (removed 0) and now considering 1665/1665 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 522/522 places, 1665/1665 transitions.
RANDOM walk for 40000 steps (418 resets) in 353 ms. (112 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (18 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :452 after 7470
Interrupted probabilistic random walk after 388102 steps, run timeout after 3001 ms. (steps per millisecond=129 ) properties seen :0 out of 1
Probabilistic random walk after 388102 steps, saw 51697 distinct states, run finished after 3002 ms. (steps per millisecond=129 ) properties seen :0
[2025-05-29 20:04:08] [INFO ] Invariant cache hit.
[2025-05-29 20:04:08] [INFO ] State equation strengthened by 1605 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 479/480 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:04:09] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
[2025-05-29 20:04:09] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 1 ms to minimize.
[2025-05-29 20:04:09] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 1 ms to minimize.
[2025-05-29 20:04:09] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 1 ms to minimize.
[2025-05-29 20:04:09] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 0 ms to minimize.
[2025-05-29 20:04:09] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 1 ms to minimize.
[2025-05-29 20:04:09] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 1 ms to minimize.
[2025-05-29 20:04:09] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
[2025-05-29 20:04:09] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 1 ms to minimize.
[2025-05-29 20:04:09] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
[2025-05-29 20:04:09] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 2 ms to minimize.
[2025-05-29 20:04:09] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 2 ms to minimize.
[2025-05-29 20:04:09] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
[2025-05-29 20:04:09] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
[2025-05-29 20:04:09] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
[2025-05-29 20:04:09] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/480 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/480 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 38/518 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/518 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/520 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1665/2185 variables, 520/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2185 variables, 1605/2163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2185 variables, 0/2163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/2187 variables, 2/2165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2187 variables, 0/2165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/2187 variables, 0/2165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2187/2187 variables, and 2165 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1643 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 522/522 constraints, ReadFeed: 1605/1605 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 479/480 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/480 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:04:10] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
[2025-05-29 20:04:10] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 0 ms to minimize.
[2025-05-29 20:04:10] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/480 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 38/518 variables, 19/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/518 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/520 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:04:11] [INFO ] Deduced a trap composed of 28 places in 455 ms of which 5 ms to minimize.
[2025-05-29 20:04:11] [INFO ] Deduced a trap composed of 31 places in 450 ms of which 5 ms to minimize.
[2025-05-29 20:04:12] [INFO ] Deduced a trap composed of 31 places in 452 ms of which 6 ms to minimize.
[2025-05-29 20:04:12] [INFO ] Deduced a trap composed of 26 places in 417 ms of which 5 ms to minimize.
[2025-05-29 20:04:13] [INFO ] Deduced a trap composed of 26 places in 441 ms of which 5 ms to minimize.
[2025-05-29 20:04:13] [INFO ] Deduced a trap composed of 26 places in 704 ms of which 16 ms to minimize.
[2025-05-29 20:04:14] [INFO ] Deduced a trap composed of 25 places in 427 ms of which 5 ms to minimize.
[2025-05-29 20:04:14] [INFO ] Deduced a trap composed of 37 places in 400 ms of which 4 ms to minimize.
[2025-05-29 20:04:15] [INFO ] Deduced a trap composed of 25 places in 440 ms of which 5 ms to minimize.
[2025-05-29 20:04:15] [INFO ] Deduced a trap composed of 26 places in 451 ms of which 5 ms to minimize.
[2025-05-29 20:04:16] [INFO ] Deduced a trap composed of 25 places in 440 ms of which 5 ms to minimize.
[2025-05-29 20:04:16] [INFO ] Deduced a trap composed of 25 places in 441 ms of which 5 ms to minimize.
[2025-05-29 20:04:16] [INFO ] Deduced a trap composed of 29 places in 445 ms of which 5 ms to minimize.
[2025-05-29 20:04:17] [INFO ] Deduced a trap composed of 26 places in 445 ms of which 5 ms to minimize.
[2025-05-29 20:04:17] [INFO ] Deduced a trap composed of 27 places in 469 ms of which 5 ms to minimize.
[2025-05-29 20:04:18] [INFO ] Deduced a trap composed of 26 places in 477 ms of which 5 ms to minimize.
[2025-05-29 20:04:19] [INFO ] Deduced a trap composed of 25 places in 617 ms of which 6 ms to minimize.
[2025-05-29 20:04:19] [INFO ] Deduced a trap composed of 27 places in 411 ms of which 6 ms to minimize.
[2025-05-29 20:04:19] [INFO ] Deduced a trap composed of 32 places in 388 ms of which 5 ms to minimize.
[2025-05-29 20:04:20] [INFO ] Deduced a trap composed of 26 places in 450 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:04:20] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/520 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/520 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1665/2185 variables, 520/582 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2185 variables, 1605/2187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2185 variables, 1/2188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2185 variables, 0/2188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :7470 after 9180
At refinement iteration 15 (OVERLAPS) 2/2187 variables, 2/2190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2187 variables, 0/2190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2187 variables, 0/2190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2187/2187 variables, and 2190 constraints, problems are : Problem set: 0 solved, 1 unsolved in 10984 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 522/522 constraints, ReadFeed: 1605/1605 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 40/40 constraints]
After SMT, in 12651ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 20 ms.
Support contains 1 out of 522 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 522/522 places, 1665/1665 transitions.
Applied a total of 0 rules in 48 ms. Remains 522 /522 variables (removed 0) and now considering 1665/1665 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 522/522 places, 1665/1665 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 522/522 places, 1665/1665 transitions.
Applied a total of 0 rules in 29 ms. Remains 522 /522 variables (removed 0) and now considering 1665/1665 (removed 0) transitions.
[2025-05-29 20:04:21] [INFO ] Invariant cache hit.
[2025-05-29 20:04:22] [INFO ] Implicit Places using invariants in 603 ms returned []
[2025-05-29 20:04:22] [INFO ] Invariant cache hit.
[2025-05-29 20:04:22] [INFO ] State equation strengthened by 1605 read => feed constraints.
[2025-05-29 20:04:29] [INFO ] Implicit Places using invariants and state equation in 7128 ms returned []
Implicit Place search using SMT with State Equation took 7737 ms to find 0 implicit places.
[2025-05-29 20:04:29] [INFO ] Redundant transitions in 38 ms returned []
Running 1645 sub problems to find dead transitions.
[2025-05-29 20:04:29] [INFO ] Invariant cache hit.
[2025-05-29 20:04:29] [INFO ] State equation strengthened by 1605 read => feed constraints.
Detected timeout of ITS tools.
[2025-05-29 20:04:47] [INFO ] Flatten gal took : 36 ms
[2025-05-29 20:04:47] [INFO ] Applying decomposition
[2025-05-29 20:04:47] [INFO ] Flatten gal took : 36 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/graph5784134982183089483.txt' '-o' '/tmp/graph5784134982183089483.bin' '-w' '/tmp/graph5784134982183089483.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5784134982183089483.bin' '-l' '-1' '-v' '-w' '/tmp/graph5784134982183089483.weights' '-q' '0' '-e' '0.001'
[2025-05-29 20:04:47] [INFO ] Decomposing Gal with order
[2025-05-29 20:04:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 20:04:47] [INFO ] Removed a total of 1286 redundant transitions.
[2025-05-29 20:04:47] [INFO ] Flatten gal took : 90 ms
[2025-05-29 20:04:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 1464 labels/synchronizations in 40 ms.
[2025-05-29 20:04:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1612146380646604181.gal : 16 ms
[2025-05-29 20:04:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13344100136293280869.prop : 0 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/ReachabilityCardinality1612146380646604181.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13344100136293280869.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 ...308
At refinement iteration 0 (INCLUDED_ONLY) 0/521 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
Loading property file /tmp/ReachabilityCardinality13344100136293280869.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 96
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :96 after 96
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :96 after 96
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :96 after 96
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :96 after 96
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :96 after 96
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :96 after 96
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :96 after 96
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :96 after 3449
At refinement iteration 1 (INCLUDED_ONLY) 0/521 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
[2025-05-29 20:04:48] [INFO ] Deduced a trap composed of 25 places in 246 ms of which 3 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3449 after 7041
[2025-05-29 20:04:49] [INFO ] Deduced a trap composed of 25 places in 220 ms of which 4 ms to minimize.
[2025-05-29 20:04:49] [INFO ] Deduced a trap composed of 27 places in 154 ms of which 2 ms to minimize.
[2025-05-29 20:04:49] [INFO ] Deduced a trap composed of 26 places in 207 ms of which 3 ms to minimize.
[2025-05-29 20:04:49] [INFO ] Deduced a trap composed of 25 places in 179 ms of which 3 ms to minimize.
[2025-05-29 20:04:49] [INFO ] Deduced a trap composed of 26 places in 157 ms of which 2 ms to minimize.
[2025-05-29 20:04:50] [INFO ] Deduced a trap composed of 31 places in 140 ms of which 2 ms to minimize.
[2025-05-29 20:04:50] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 2 ms to minimize.
[2025-05-29 20:04:50] [INFO ] Deduced a trap composed of 29 places in 121 ms of which 2 ms to minimize.
[2025-05-29 20:04:50] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 2 ms to minimize.
[2025-05-29 20:04:50] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 2 ms to minimize.
[2025-05-29 20:04:50] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 2 ms to minimize.
[2025-05-29 20:04:50] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 2 ms to minimize.
[2025-05-29 20:04:50] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 2 ms to minimize.
[2025-05-29 20:04:51] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 2 ms to minimize.
[2025-05-29 20:04:51] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 2 ms to minimize.
[2025-05-29 20:04:51] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 2 ms to minimize.
[2025-05-29 20:04:51] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 2 ms to minimize.
[2025-05-29 20:04:51] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 1 ms to minimize.
[2025-05-29 20:04:51] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/521 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
[2025-05-29 20:04:52] [INFO ] Deduced a trap composed of 26 places in 158 ms of which 2 ms to minimize.
[2025-05-29 20:04:52] [INFO ] Deduced a trap composed of 25 places in 154 ms of which 3 ms to minimize.
[2025-05-29 20:04:52] [INFO ] Deduced a trap composed of 25 places in 133 ms of which 3 ms to minimize.
[2025-05-29 20:04:52] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 2 ms to minimize.
[2025-05-29 20:04:53] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 2 ms to minimize.
[2025-05-29 20:04:53] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 1 ms to minimize.
[2025-05-29 20:04:53] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 2 ms to minimize.
[2025-05-29 20:04:53] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 1 ms to minimize.
[2025-05-29 20:04:53] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 2 ms to minimize.
[2025-05-29 20:04:53] [INFO ] Deduced a trap composed of 3 places in 291 ms of which 3 ms to minimize.
[2025-05-29 20:04:54] [INFO ] Deduced a trap composed of 26 places in 398 ms of which 4 ms to minimize.
[2025-05-29 20:04:54] [INFO ] Deduced a trap composed of 30 places in 406 ms of which 4 ms to minimize.
[2025-05-29 20:04:55] [INFO ] Deduced a trap composed of 28 places in 403 ms of which 5 ms to minimize.
[2025-05-29 20:04:55] [INFO ] Deduced a trap composed of 33 places in 405 ms of which 5 ms to minimize.
[2025-05-29 20:04:55] [INFO ] Deduced a trap composed of 25 places in 409 ms of which 5 ms to minimize.
[2025-05-29 20:04:56] [INFO ] Deduced a trap composed of 26 places in 412 ms of which 5 ms to minimize.
[2025-05-29 20:04:56] [INFO ] Deduced a trap composed of 33 places in 438 ms of which 4 ms to minimize.
[2025-05-29 20:04:57] [INFO ] Deduced a trap composed of 25 places in 333 ms of which 3 ms to minimize.
[2025-05-29 20:04:57] [INFO ] Deduced a trap composed of 25 places in 295 ms of which 3 ms to minimize.
[2025-05-29 20:04:57] [INFO ] Deduced a trap composed of 28 places in 326 ms of which 4 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :7041 after 1.14065e+07
Error getting values : (error "ParserException while parsing response: ((s0 9.0)
(s1 1.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/521 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 521/2187 variables, and 62 constraints, problems are : Problem set: 0 solved, 1645 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/522 constraints, ReadFeed: 0/1605 constraints, PredecessorRefiner: 1645/1645 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1645 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/521 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/521 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/521 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
[2025-05-29 20:05:03] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 2 ms to minimize.
[2025-05-29 20:05:03] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 2 ms to minimize.
[2025-05-29 20:05:04] [INFO ] Deduced a trap composed of 36 places in 392 ms of which 4 ms to minimize.
[2025-05-29 20:05:04] [INFO ] Deduced a trap composed of 29 places in 318 ms of which 4 ms to minimize.
[2025-05-29 20:05:04] [INFO ] Deduced a trap composed of 27 places in 373 ms of which 4 ms to minimize.
[2025-05-29 20:05:04] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2025-05-29 20:05:04] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2025-05-29 20:05:05] [INFO ] Deduced a trap composed of 29 places in 263 ms of which 3 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.14065e+07 after 1.28059e+07
[2025-05-29 20:05:05] [INFO ] Deduced a trap composed of 29 places in 265 ms of which 4 ms to minimize.
[2025-05-29 20:05:05] [INFO ] Deduced a trap composed of 28 places in 241 ms of which 3 ms to minimize.
[2025-05-29 20:05:05] [INFO ] Deduced a trap composed of 28 places in 227 ms of which 3 ms to minimize.
[2025-05-29 20:05:06] [INFO ] Deduced a trap composed of 29 places in 173 ms of which 3 ms to minimize.
[2025-05-29 20:05:06] [INFO ] Deduced a trap composed of 28 places in 223 ms of which 3 ms to minimize.
[2025-05-29 20:05:06] [INFO ] Deduced a trap composed of 28 places in 207 ms of which 3 ms to minimize.
[2025-05-29 20:05:06] [INFO ] Deduced a trap composed of 28 places in 188 ms of which 3 ms to minimize.
[2025-05-29 20:05:06] [INFO ] Deduced a trap composed of 26 places in 167 ms of which 2 ms to minimize.
[2025-05-29 20:05:07] [INFO ] Deduced a trap composed of 26 places in 138 ms of which 2 ms to minimize.
[2025-05-29 20:05:07] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 2 ms to minimize.
[2025-05-29 20:05:07] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 2 ms to minimize.
[2025-05-29 20:05:07] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/521 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
[2025-05-29 20:05:08] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 1 ms to minimize.
[2025-05-29 20:05:08] [INFO ] Deduced a trap composed of 27 places in 200 ms of which 3 ms to minimize.
[2025-05-29 20:05:08] [INFO ] Deduced a trap composed of 27 places in 155 ms of which 3 ms to minimize.
[2025-05-29 20:05:09] [INFO ] Deduced a trap composed of 27 places in 161 ms of which 3 ms to minimize.
[2025-05-29 20:05:09] [INFO ] Deduced a trap composed of 26 places in 177 ms of which 3 ms to minimize.
[2025-05-29 20:05:09] [INFO ] Deduced a trap composed of 26 places in 157 ms of which 3 ms to minimize.
[2025-05-29 20:05:09] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 2 ms to minimize.
[2025-05-29 20:05:09] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 2 ms to minimize.
[2025-05-29 20:05:09] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 2 ms to minimize.
[2025-05-29 20:05:09] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 2 ms to minimize.
[2025-05-29 20:05:09] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 2 ms to minimize.
[2025-05-29 20:05:10] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2025-05-29 20:05:10] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2025-05-29 20:05:10] [INFO ] Deduced a trap composed of 25 places in 283 ms of which 3 ms to minimize.
[2025-05-29 20:05:10] [INFO ] Deduced a trap composed of 25 places in 262 ms of which 3 ms to minimize.
[2025-05-29 20:05:10] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2025-05-29 20:05:10] [INFO ] Deduced a trap composed of 32 places in 193 ms of which 3 ms to minimize.
[2025-05-29 20:05:11] [INFO ] Deduced a trap composed of 28 places in 244 ms of which 3 ms to minimize.
[2025-05-29 20:05:11] [INFO ] Deduced a trap composed of 33 places in 242 ms of which 3 ms to minimize.
[2025-05-29 20:05:11] [INFO ] Deduced a trap composed of 32 places in 220 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/521 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
[2025-05-29 20:05:12] [INFO ] Deduced a trap composed of 33 places in 194 ms of which 2 ms to minimize.
[2025-05-29 20:05:13] [INFO ] Deduced a trap composed of 27 places in 161 ms of which 3 ms to minimize.
[2025-05-29 20:05:13] [INFO ] Deduced a trap composed of 31 places in 211 ms of which 3 ms to minimize.
[2025-05-29 20:05:13] [INFO ] Deduced a trap composed of 37 places in 186 ms of which 3 ms to minimize.
[2025-05-29 20:05:13] [INFO ] Deduced a trap composed of 30 places in 159 ms of which 3 ms to minimize.
[2025-05-29 20:05:13] [INFO ] Deduced a trap composed of 31 places in 186 ms of which 3 ms to minimize.
[2025-05-29 20:05:14] [INFO ] Deduced a trap composed of 28 places in 201 ms of which 3 ms to minimize.
[2025-05-29 20:05:14] [INFO ] Deduced a trap composed of 28 places in 169 ms of which 2 ms to minimize.
[2025-05-29 20:05:14] [INFO ] Deduced a trap composed of 33 places in 162 ms of which 3 ms to minimize.
[2025-05-29 20:05:14] [INFO ] Deduced a trap composed of 30 places in 175 ms of which 3 ms to minimize.
[2025-05-29 20:05:14] [INFO ] Deduced a trap composed of 31 places in 174 ms of which 2 ms to minimize.
[2025-05-29 20:05:15] [INFO ] Deduced a trap composed of 36 places in 176 ms of which 2 ms to minimize.
[2025-05-29 20:05:15] [INFO ] Deduced a trap composed of 30 places in 174 ms of which 3 ms to minimize.
[2025-05-29 20:05:15] [INFO ] Deduced a trap composed of 30 places in 176 ms of which 2 ms to minimize.
[2025-05-29 20:05:15] [INFO ] Deduced a trap composed of 31 places in 147 ms of which 2 ms to minimize.
[2025-05-29 20:05:15] [INFO ] Deduced a trap composed of 32 places in 171 ms of which 2 ms to minimize.
[2025-05-29 20:05:15] [INFO ] Deduced a trap composed of 25 places in 146 ms of which 2 ms to minimize.
[2025-05-29 20:05:16] [INFO ] Deduced a trap composed of 29 places in 134 ms of which 2 ms to minimize.
[2025-05-29 20:05:16] [INFO ] Deduced a trap composed of 29 places in 129 ms of which 3 ms to minimize.
[2025-05-29 20:05:16] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/521 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
[2025-05-29 20:05:17] [INFO ] Deduced a trap composed of 26 places in 190 ms of which 3 ms to minimize.
[2025-05-29 20:05:17] [INFO ] Deduced a trap composed of 25 places in 222 ms of which 2 ms to minimize.
[2025-05-29 20:05:17] [INFO ] Deduced a trap composed of 25 places in 219 ms of which 3 ms to minimize.
[2025-05-29 20:05:18] [INFO ] Deduced a trap composed of 28 places in 224 ms of which 3 ms to minimize.
[2025-05-29 20:05:18] [INFO ] Deduced a trap composed of 33 places in 224 ms of which 3 ms to minimize.
[2025-05-29 20:05:18] [INFO ] Deduced a trap composed of 28 places in 243 ms of which 4 ms to minimize.
[2025-05-29 20:05:18] [INFO ] Deduced a trap composed of 26 places in 247 ms of which 3 ms to minimize.
[2025-05-29 20:05:19] [INFO ] Deduced a trap composed of 26 places in 229 ms of which 3 ms to minimize.
[2025-05-29 20:05:19] [INFO ] Deduced a trap composed of 25 places in 209 ms of which 4 ms to minimize.
[2025-05-29 20:05:19] [INFO ] Deduced a trap composed of 25 places in 200 ms of which 3 ms to minimize.
[2025-05-29 20:05:19] [INFO ] Deduced a trap composed of 29 places in 191 ms of which 3 ms to minimize.
[2025-05-29 20:05:20] [INFO ] Deduced a trap composed of 26 places in 228 ms of which 3 ms to minimize.
[2025-05-29 20:05:20] [INFO ] Deduced a trap composed of 31 places in 221 ms of which 3 ms to minimize.
[2025-05-29 20:05:20] [INFO ] Deduced a trap composed of 28 places in 230 ms of which 3 ms to minimize.
[2025-05-29 20:05:20] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2025-05-29 20:05:20] [INFO ] Deduced a trap composed of 35 places in 254 ms of which 3 ms to minimize.
[2025-05-29 20:05:21] [INFO ] Deduced a trap composed of 28 places in 255 ms of which 3 ms to minimize.
[2025-05-29 20:05:21] [INFO ] Deduced a trap composed of 26 places in 257 ms of which 3 ms to minimize.
[2025-05-29 20:05:21] [INFO ] Deduced a trap composed of 27 places in 238 ms of which 3 ms to minimize.
[2025-05-29 20:05:21] [INFO ] Deduced a trap composed of 25 places in 215 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/521 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
[2025-05-29 20:05:22] [INFO ] Deduced a trap composed of 28 places in 149 ms of which 2 ms to minimize.
[2025-05-29 20:05:23] [INFO ] Deduced a trap composed of 33 places in 125 ms of which 2 ms to minimize.
[2025-05-29 20:05:23] [INFO ] Deduced a trap composed of 25 places in 177 ms of which 3 ms to minimize.
[2025-05-29 20:05:23] [INFO ] Deduced a trap composed of 25 places in 156 ms of which 3 ms to minimize.
[2025-05-29 20:05:23] [INFO ] Deduced a trap composed of 28 places in 157 ms of which 3 ms to minimize.
[2025-05-29 20:05:23] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 2 ms to minimize.
[2025-05-29 20:05:23] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 2 ms to minimize.
[2025-05-29 20:05:23] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 2 ms to minimize.
[2025-05-29 20:05:24] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 2 ms to minimize.
[2025-05-29 20:05:24] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 2 ms to minimize.
[2025-05-29 20:05:24] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 2 ms to minimize.
[2025-05-29 20:05:24] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 2 ms to minimize.
[2025-05-29 20:05:24] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 2 ms to minimize.
[2025-05-29 20:05:24] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 1 ms to minimize.
[2025-05-29 20:05:24] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 2 ms to minimize.
[2025-05-29 20:05:24] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 2 ms to minimize.
[2025-05-29 20:05:24] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 1 ms to minimize.
[2025-05-29 20:05:24] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 1 ms to minimize.
[2025-05-29 20:05:25] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 2 ms to minimize.
[2025-05-29 20:05:25] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/521 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
[2025-05-29 20:05:26] [INFO ] Deduced a trap composed of 26 places in 169 ms of which 2 ms to minimize.
[2025-05-29 20:05:26] [INFO ] Deduced a trap composed of 24 places in 192 ms of which 2 ms to minimize.
[2025-05-29 20:05:26] [INFO ] Deduced a trap composed of 25 places in 188 ms of which 3 ms to minimize.
[2025-05-29 20:05:27] [INFO ] Deduced a trap composed of 26 places in 194 ms of which 4 ms to minimize.
[2025-05-29 20:05:27] [INFO ] Deduced a trap composed of 32 places in 177 ms of which 3 ms to minimize.
[2025-05-29 20:05:27] [INFO ] Deduced a trap composed of 27 places in 174 ms of which 3 ms to minimize.
[2025-05-29 20:05:27] [INFO ] Deduced a trap composed of 30 places in 152 ms of which 3 ms to minimize.
[2025-05-29 20:05:27] [INFO ] Deduced a trap composed of 29 places in 184 ms of which 3 ms to minimize.
[2025-05-29 20:05:28] [INFO ] Deduced a trap composed of 31 places in 142 ms of which 2 ms to minimize.
[2025-05-29 20:05:28] [INFO ] Deduced a trap composed of 28 places in 142 ms of which 3 ms to minimize.
[2025-05-29 20:05:28] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 2 ms to minimize.
[2025-05-29 20:05:28] [INFO ] Deduced a trap composed of 28 places in 111 ms of which 3 ms to minimize.
[2025-05-29 20:05:28] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 2 ms to minimize.
[2025-05-29 20:05:28] [INFO ] Deduced a trap composed of 29 places in 113 ms of which 2 ms to minimize.
[2025-05-29 20:05:28] [INFO ] Deduced a trap composed of 29 places in 118 ms of which 3 ms to minimize.
[2025-05-29 20:05:29] [INFO ] Deduced a trap composed of 28 places in 116 ms of which 2 ms to minimize.
[2025-05-29 20:05:29] [INFO ] Deduced a trap composed of 29 places in 127 ms of which 3 ms to minimize.
[2025-05-29 20:05:29] [INFO ] Deduced a trap composed of 30 places in 127 ms of which 3 ms to minimize.
[2025-05-29 20:05:29] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 2 ms to minimize.
[2025-05-29 20:05:29] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/521 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 521/2187 variables, and 182 constraints, problems are : Problem set: 0 solved, 1645 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/522 constraints, ReadFeed: 0/1605 constraints, PredecessorRefiner: 0/1645 constraints, Known Traps: 160/160 constraints]
After SMT, in 60997ms problems are : Problem set: 0 solved, 1645 unsolved
Search for dead transitions found 0 dead transitions in 61018ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68832 ms. Remains : 522/522 places, 1665/1665 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1542 edges and 522 vertex of which 438 / 522 are part of one of the 2 SCC in 1 ms
Free SCC test removed 436 places
Drop transitions (Empty/Sink Transition effects.) removed 1164 transitions
Ensure Unique test removed 412 transitions
Reduce isomorphic transitions removed 1576 transitions.
Graph (complete) has 211 edges and 86 vertex of which 25 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.1 ms
Discarding 61 places :
Also discarding 19 output transitions
Drop transitions (Output transitions of discarded places.) removed 19 transitions
Drop transitions (Empty/Sink Transition effects.) removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 25 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 24 transition count 28
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 63 place count 6 transition count 10
Iterating global reduction 2 with 18 rules applied. Total rules applied 81 place count 6 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 83 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 86 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 4 transition count 5
Applied a total of 87 rules in 11 ms. Remains 4 /522 variables (removed 518) and now considering 5/1665 (removed 1660) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 4 cols
[2025-05-29 20:05:30] [INFO ] Computed 0 invariants in 0 ms
[2025-05-29 20:05:30] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-29 20:05:30] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-29 20:05:30] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-29 20:05:30] [INFO ] After 25ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-05-29 20:05:30] [INFO ] Flatten gal took : 1 ms
[2025-05-29 20:05:30] [INFO ] Flatten gal took : 1 ms
[2025-05-29 20:05:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2397868407427367243.gal : 0 ms
[2025-05-29 20:05:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5929466393548238851.prop : 0 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/ReachabilityCardinality2397868407427367243.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5929466393548238851.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/ReachabilityCardinality5929466393548238851.prop.
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 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,6,0.002886,3520,2,7,6,33,6,0,21,18,0
Total reachable state count : 6

Verifying 1 reachability properties.
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,0.003301,3896,2,5,6,33,7,0,24,18,0
Over-approximation ignoring read arcs solved 0 properties in 78 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[20]
Ending property specific reduction for CANInsertWithFailure-PT-020-UpperBounds-06 in 150410 ms.
Starting property specific reduction for CANInsertWithFailure-PT-020-UpperBounds-07
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[20]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[20]
// Phase 1: matrix 1674 rows 531 cols
[2025-05-29 20:05:30] [INFO ] Computed 22 invariants in 14 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[20]
RANDOM walk for 10000 steps (105 resets) in 50 ms. (196 steps per ms)
BEST_FIRST walk for 10001 steps (4 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[20]
[2025-05-29 20:05:30] [INFO ] Invariant cache hit.
[2025-05-29 20:05:30] [INFO ] [Real]Absence check using 20 positive place invariants in 13 ms returned sat
[2025-05-29 20:05:30] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2025-05-29 20:05:31] [INFO ] [Real]Absence check using state equation in 588 ms returned sat
[2025-05-29 20:05:31] [INFO ] State equation strengthened by 1582 read => feed constraints.
[2025-05-29 20:05:31] [INFO ] [Real]Added 1582 Read/Feed constraints in 297 ms returned sat
[2025-05-29 20:05:31] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:05:32] [INFO ] [Nat]Absence check using 20 positive place invariants in 22 ms returned sat
[2025-05-29 20:05:32] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 9 ms returned sat
[2025-05-29 20:05:32] [INFO ] [Nat]Absence check using state equation in 695 ms returned sat
[2025-05-29 20:05:32] [INFO ] [Nat]Added 1582 Read/Feed constraints in 265 ms returned sat
[2025-05-29 20:05:33] [INFO ] Computed and/alt/rep : 1160/3017/1160 causal constraints (skipped 494 transitions) in 204 ms.
[2025-05-29 20:05:33] [INFO ] Added : 5 causal constraints over 1 iterations in 504 ms. Result :sat
Minimization took 579 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[20]
Support contains 1 out of 531 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 531/531 places, 1674/1674 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 524 transition count 1667
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 524 transition count 1666
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 16 place count 523 transition count 1666
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 24 place count 523 transition count 1666
Applied a total of 24 rules in 190 ms. Remains 523 /531 variables (removed 8) and now considering 1666/1674 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 194 ms. Remains : 523/531 places, 1666/1674 transitions.
// Phase 1: matrix 1666 rows 523 cols
[2025-05-29 20:05:34] [INFO ] Computed 22 invariants in 22 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[20]
RANDOM walk for 1000000 steps (10539 resets) in 5406 ms. (184 steps per ms)
BEST_FIRST walk for 1000001 steps (483 resets) in 937 ms. (1066 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[20]
[2025-05-29 20:05:40] [INFO ] Invariant cache hit.
[2025-05-29 20:05:40] [INFO ] [Real]Absence check using 20 positive place invariants in 20 ms returned sat
[2025-05-29 20:05:40] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 12 ms returned sat
[2025-05-29 20:05:41] [INFO ] [Real]Absence check using state equation in 580 ms returned sat
[2025-05-29 20:05:41] [INFO ] State equation strengthened by 1604 read => feed constraints.
[2025-05-29 20:05:41] [INFO ] [Real]Added 1604 Read/Feed constraints in 226 ms returned sat
[2025-05-29 20:05:41] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:05:41] [INFO ] [Nat]Absence check using 20 positive place invariants in 22 ms returned sat
[2025-05-29 20:05:41] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 9 ms returned sat
[2025-05-29 20:05:42] [INFO ] [Nat]Absence check using state equation in 714 ms returned sat
[2025-05-29 20:05:42] [INFO ] [Nat]Added 1604 Read/Feed constraints in 271 ms returned sat
[2025-05-29 20:05:43] [INFO ] Computed and/alt/rep : 1152/3049/1152 causal constraints (skipped 494 transitions) in 165 ms.
[2025-05-29 20:05:43] [INFO ] Added : 4 causal constraints over 1 iterations in 440 ms. Result :sat
Minimization took 4502 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[20]
Support contains 1 out of 523 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1666/1666 transitions.
Applied a total of 0 rules in 29 ms. Remains 523 /523 variables (removed 0) and now considering 1666/1666 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 523/523 places, 1666/1666 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1666/1666 transitions.
Applied a total of 0 rules in 32 ms. Remains 523 /523 variables (removed 0) and now considering 1666/1666 (removed 0) transitions.
[2025-05-29 20:05:48] [INFO ] Invariant cache hit.
[2025-05-29 20:05:48] [INFO ] Implicit Places using invariants in 808 ms returned []
[2025-05-29 20:05:48] [INFO ] Invariant cache hit.
[2025-05-29 20:05:49] [INFO ] State equation strengthened by 1604 read => feed constraints.
[2025-05-29 20:05:56] [INFO ] Implicit Places using invariants and state equation in 7302 ms returned []
Implicit Place search using SMT with State Equation took 8117 ms to find 0 implicit places.
[2025-05-29 20:05:56] [INFO ] Redundant transitions in 56 ms returned []
Running 1646 sub problems to find dead transitions.
[2025-05-29 20:05:56] [INFO ] Invariant cache hit.
[2025-05-29 20:05:56] [INFO ] State equation strengthened by 1604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/522 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/522 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
[2025-05-29 20:06:23] [INFO ] Deduced a trap composed of 26 places in 235 ms of which 3 ms to minimize.
[2025-05-29 20:06:24] [INFO ] Deduced a trap composed of 27 places in 209 ms of which 3 ms to minimize.
[2025-05-29 20:06:24] [INFO ] Deduced a trap composed of 2 places in 404 ms of which 4 ms to minimize.
[2025-05-29 20:06:24] [INFO ] Deduced a trap composed of 25 places in 176 ms of which 3 ms to minimize.
[2025-05-29 20:06:24] [INFO ] Deduced a trap composed of 28 places in 202 ms of which 4 ms to minimize.
[2025-05-29 20:06:25] [INFO ] Deduced a trap composed of 29 places in 252 ms of which 3 ms to minimize.
[2025-05-29 20:06:25] [INFO ] Deduced a trap composed of 25 places in 222 ms of which 4 ms to minimize.
[2025-05-29 20:06:25] [INFO ] Deduced a trap composed of 27 places in 226 ms of which 3 ms to minimize.
[2025-05-29 20:06:26] [INFO ] Deduced a trap composed of 27 places in 150 ms of which 2 ms to minimize.
[2025-05-29 20:06:26] [INFO ] Deduced a trap composed of 27 places in 198 ms of which 3 ms to minimize.
[2025-05-29 20:06:26] [INFO ] Deduced a trap composed of 31 places in 172 ms of which 2 ms to minimize.
[2025-05-29 20:06:26] [INFO ] Deduced a trap composed of 31 places in 201 ms of which 3 ms to minimize.
[2025-05-29 20:06:26] [INFO ] Deduced a trap composed of 28 places in 208 ms of which 3 ms to minimize.
[2025-05-29 20:06:27] [INFO ] Deduced a trap composed of 27 places in 201 ms of which 3 ms to minimize.
[2025-05-29 20:06:27] [INFO ] Deduced a trap composed of 28 places in 169 ms of which 2 ms to minimize.
SMT process timed out in 31091ms, After SMT, problems are : Problem set: 0 solved, 1646 unsolved
Search for dead transitions found 0 dead transitions in 31118ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39336 ms. Remains : 523/523 places, 1666/1666 transitions.
[2025-05-29 20:06:27] [INFO ] Flatten gal took : 58 ms
[2025-05-29 20:06:27] [INFO ] Flatten gal took : 57 ms
[2025-05-29 20:06:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18314734351135965456.gal : 10 ms
[2025-05-29 20:06:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10860448954502635011.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/ReachabilityCardinality18314734351135965456.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10860448954502635011.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 ...330
RANDOM walk for 40000 steps (416 resets) in 713 ms. (56 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (17 resets) in 184 ms. (216 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (17 resets) in 181 ms. (219 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality10860448954502635011.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 147
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :147 after 150
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :150 after 151
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :151 after 155
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :155 after 156
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :156 after 157
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :157 after 163
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :163 after 174
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :174 after 199
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :199 after 235
Interrupted probabilistic random walk after 292179 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :0 out of 2
Probabilistic random walk after 292179 steps, saw 41380 distinct states, run finished after 3004 ms. (steps per millisecond=97 ) properties seen :0
[2025-05-29 20:06:30] [INFO ] Invariant cache hit.
[2025-05-29 20:06:30] [INFO ] State equation strengthened by 1604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 480/481 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-29 20:06:30] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 38/519 variables, 19/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/519 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/521 variables, 2/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :235 after 319
[2025-05-29 20:06:31] [INFO ] Deduced a trap composed of 25 places in 473 ms of which 5 ms to minimize.
[2025-05-29 20:06:31] [INFO ] Deduced a trap composed of 31 places in 449 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/521 variables, 2/25 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/521 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1666/2187 variables, 521/546 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :319 after 452
At refinement iteration 10 (INCLUDED_ONLY) 0/2187 variables, 1604/2150 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2187 variables, 0/2150 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/2189 variables, 2/2152 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2189 variables, 0/2152 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2189 variables, 0/2152 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2189/2189 variables, and 2152 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2253 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 523/523 constraints, ReadFeed: 1604/1604 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 480/481 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 38/519 variables, 19/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/519 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/521 variables, 2/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/521 variables, 2/25 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-05-29 20:06:33] [INFO ] Deduced a trap composed of 31 places in 473 ms of which 5 ms to minimize.
[2025-05-29 20:06:34] [INFO ] Deduced a trap composed of 31 places in 456 ms of which 5 ms to minimize.
[2025-05-29 20:06:34] [INFO ] Deduced a trap composed of 31 places in 448 ms of which 5 ms to minimize.
[2025-05-29 20:06:35] [INFO ] Deduced a trap composed of 29 places in 436 ms of which 5 ms to minimize.
[2025-05-29 20:06:35] [INFO ] Deduced a trap composed of 28 places in 432 ms of which 5 ms to minimize.
[2025-05-29 20:06:35] [INFO ] Deduced a trap composed of 27 places in 426 ms of which 4 ms to minimize.
[2025-05-29 20:06:36] [INFO ] Deduced a trap composed of 26 places in 429 ms of which 4 ms to minimize.
[2025-05-29 20:06:36] [INFO ] Deduced a trap composed of 29 places in 400 ms of which 4 ms to minimize.
[2025-05-29 20:06:37] [INFO ] Deduced a trap composed of 29 places in 402 ms of which 4 ms to minimize.
[2025-05-29 20:06:37] [INFO ] Deduced a trap composed of 29 places in 402 ms of which 4 ms to minimize.
[2025-05-29 20:06:38] [INFO ] Deduced a trap composed of 26 places in 407 ms of which 5 ms to minimize.
SMT process timed out in 7317ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 523 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1666/1666 transitions.
Applied a total of 0 rules in 34 ms. Remains 523 /523 variables (removed 0) and now considering 1666/1666 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 523/523 places, 1666/1666 transitions.
RANDOM walk for 40000 steps (417 resets) in 368 ms. (108 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (17 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :452 after 7452
Interrupted probabilistic random walk after 389081 steps, run timeout after 3001 ms. (steps per millisecond=129 ) properties seen :0 out of 1
Probabilistic random walk after 389081 steps, saw 51835 distinct states, run finished after 3001 ms. (steps per millisecond=129 ) properties seen :0
[2025-05-29 20:06:41] [INFO ] Invariant cache hit.
[2025-05-29 20:06:41] [INFO ] State equation strengthened by 1604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 480/481 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:06:41] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2025-05-29 20:06:41] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2025-05-29 20:06:41] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 1 ms to minimize.
[2025-05-29 20:06:41] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2025-05-29 20:06:41] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 2 ms to minimize.
[2025-05-29 20:06:41] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2025-05-29 20:06:41] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2025-05-29 20:06:41] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
[2025-05-29 20:06:41] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2025-05-29 20:06:41] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
[2025-05-29 20:06:41] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
[2025-05-29 20:06:41] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
[2025-05-29 20:06:42] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2025-05-29 20:06:42] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
[2025-05-29 20:06:42] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
[2025-05-29 20:06:42] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 38/519 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/519 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/521 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/521 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1666/2187 variables, 521/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2187 variables, 1604/2163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2187 variables, 0/2163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/2189 variables, 2/2165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2189 variables, 0/2165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/2189 variables, 0/2165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2189/2189 variables, and 2165 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1804 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 523/523 constraints, ReadFeed: 1604/1604 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 480/481 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:06:43] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
[2025-05-29 20:06:43] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
[2025-05-29 20:06:43] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/481 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 38/519 variables, 19/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/519 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/521 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:06:43] [INFO ] Deduced a trap composed of 26 places in 495 ms of which 5 ms to minimize.
[2025-05-29 20:06:44] [INFO ] Deduced a trap composed of 25 places in 530 ms of which 6 ms to minimize.
[2025-05-29 20:06:44] [INFO ] Deduced a trap composed of 24 places in 533 ms of which 5 ms to minimize.
[2025-05-29 20:06:45] [INFO ] Deduced a trap composed of 24 places in 497 ms of which 5 ms to minimize.
[2025-05-29 20:06:46] [INFO ] Deduced a trap composed of 29 places in 544 ms of which 6 ms to minimize.
[2025-05-29 20:06:46] [INFO ] Deduced a trap composed of 25 places in 530 ms of which 5 ms to minimize.
[2025-05-29 20:06:47] [INFO ] Deduced a trap composed of 25 places in 543 ms of which 6 ms to minimize.
[2025-05-29 20:06:47] [INFO ] Deduced a trap composed of 25 places in 529 ms of which 5 ms to minimize.
[2025-05-29 20:06:48] [INFO ] Deduced a trap composed of 26 places in 523 ms of which 5 ms to minimize.
[2025-05-29 20:06:48] [INFO ] Deduced a trap composed of 25 places in 524 ms of which 5 ms to minimize.
[2025-05-29 20:06:49] [INFO ] Deduced a trap composed of 25 places in 539 ms of which 5 ms to minimize.
[2025-05-29 20:06:49] [INFO ] Deduced a trap composed of 32 places in 528 ms of which 6 ms to minimize.
[2025-05-29 20:06:50] [INFO ] Deduced a trap composed of 26 places in 533 ms of which 5 ms to minimize.
[2025-05-29 20:06:50] [INFO ] Deduced a trap composed of 26 places in 531 ms of which 6 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :7452 after 9178
[2025-05-29 20:06:51] [INFO ] Deduced a trap composed of 28 places in 550 ms of which 6 ms to minimize.
[2025-05-29 20:06:52] [INFO ] Deduced a trap composed of 25 places in 546 ms of which 5 ms to minimize.
[2025-05-29 20:06:52] [INFO ] Deduced a trap composed of 25 places in 495 ms of which 5 ms to minimize.
[2025-05-29 20:06:53] [INFO ] Deduced a trap composed of 32 places in 501 ms of which 5 ms to minimize.
[2025-05-29 20:06:53] [INFO ] Deduced a trap composed of 26 places in 479 ms of which 5 ms to minimize.
[2025-05-29 20:06:54] [INFO ] Deduced a trap composed of 31 places in 507 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/521 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:06:54] [INFO ] Deduced a trap composed of 27 places in 486 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/521 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/521 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1666/2187 variables, 521/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2187 variables, 1604/2187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2187 variables, 1/2188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2187 variables, 0/2188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/2189 variables, 2/2190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2189 variables, 0/2190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2189 variables, 0/2190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2189/2189 variables, and 2190 constraints, problems are : Problem set: 0 solved, 1 unsolved in 13004 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 523/523 constraints, ReadFeed: 1604/1604 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 40/40 constraints]
After SMT, in 14831ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 26 ms.
Support contains 1 out of 523 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1666/1666 transitions.
Applied a total of 0 rules in 47 ms. Remains 523 /523 variables (removed 0) and now considering 1666/1666 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 523/523 places, 1666/1666 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1666/1666 transitions.
Applied a total of 0 rules in 46 ms. Remains 523 /523 variables (removed 0) and now considering 1666/1666 (removed 0) transitions.
[2025-05-29 20:06:56] [INFO ] Invariant cache hit.
[2025-05-29 20:06:57] [INFO ] Implicit Places using invariants in 869 ms returned []
[2025-05-29 20:06:57] [INFO ] Invariant cache hit.
[2025-05-29 20:06:57] [INFO ] State equation strengthened by 1604 read => feed constraints.
[2025-05-29 20:07:04] [INFO ] Implicit Places using invariants and state equation in 7313 ms returned []
Implicit Place search using SMT with State Equation took 8184 ms to find 0 implicit places.
[2025-05-29 20:07:04] [INFO ] Redundant transitions in 38 ms returned []
Running 1646 sub problems to find dead transitions.
[2025-05-29 20:07:04] [INFO ] Invariant cache hit.
[2025-05-29 20:07:04] [INFO ] State equation strengthened by 1604 read => feed constraints.
Detected timeout of ITS tools.
[2025-05-29 20:07:17] [INFO ] Flatten gal took : 38 ms
[2025-05-29 20:07:17] [INFO ] Applying decomposition
[2025-05-29 20:07:17] [INFO ] Flatten gal took : 39 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/graph666589212018494024.txt' '-o' '/tmp/graph666589212018494024.bin' '-w' '/tmp/graph666589212018494024.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph666589212018494024.bin' '-l' '-1' '-v' '-w' '/tmp/graph666589212018494024.weights' '-q' '0' '-e' '0.001'
[2025-05-29 20:07:17] [INFO ] Decomposing Gal with order
[2025-05-29 20:07:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 20:07:17] [INFO ] Removed a total of 1287 redundant transitions.
[2025-05-29 20:07:17] [INFO ] Flatten gal took : 87 ms
[2025-05-29 20:07:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 1468 labels/synchronizations in 33 ms.
[2025-05-29 20:07:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10461520925895908484.gal : 22 ms
[2025-05-29 20:07:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18109711007968449542.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/ReachabilityCardinality10461520925895908484.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18109711007968449542.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 ...309
Loading property file /tmp/ReachabilityCardinality18109711007968449542.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 386
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :386 after 386
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :386 after 386
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :386 after 386
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :386 after 393
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :393 after 397
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :397 after 406
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :406 after 415
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :415 after 1032
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1032 after 64014
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :64014 after 1.75162e+06
At refinement iteration 0 (INCLUDED_ONLY) 0/522 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/522 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
[2025-05-29 20:07:26] [INFO ] Deduced a trap composed of 26 places in 215 ms of which 3 ms to minimize.
[2025-05-29 20:07:26] [INFO ] Deduced a trap composed of 27 places in 188 ms of which 3 ms to minimize.
[2025-05-29 20:07:27] [INFO ] Deduced a trap composed of 2 places in 608 ms of which 8 ms to minimize.
[2025-05-29 20:07:27] [INFO ] Deduced a trap composed of 25 places in 276 ms of which 4 ms to minimize.
[2025-05-29 20:07:27] [INFO ] Deduced a trap composed of 28 places in 228 ms of which 4 ms to minimize.
[2025-05-29 20:07:27] [INFO ] Deduced a trap composed of 29 places in 226 ms of which 4 ms to minimize.
[2025-05-29 20:07:28] [INFO ] Deduced a trap composed of 25 places in 198 ms of which 3 ms to minimize.
[2025-05-29 20:07:28] [INFO ] Deduced a trap composed of 27 places in 195 ms of which 3 ms to minimize.
[2025-05-29 20:07:28] [INFO ] Deduced a trap composed of 27 places in 161 ms of which 3 ms to minimize.
[2025-05-29 20:07:28] [INFO ] Deduced a trap composed of 27 places in 168 ms of which 2 ms to minimize.
[2025-05-29 20:07:28] [INFO ] Deduced a trap composed of 31 places in 138 ms of which 2 ms to minimize.
[2025-05-29 20:07:29] [INFO ] Deduced a trap composed of 31 places in 144 ms of which 2 ms to minimize.
[2025-05-29 20:07:29] [INFO ] Deduced a trap composed of 28 places in 152 ms of which 2 ms to minimize.
[2025-05-29 20:07:29] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 2 ms to minimize.
[2025-05-29 20:07:29] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 2 ms to minimize.
[2025-05-29 20:07:29] [INFO ] Deduced a trap composed of 26 places in 122 ms of which 2 ms to minimize.
[2025-05-29 20:07:29] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 1 ms to minimize.
[2025-05-29 20:07:29] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2025-05-29 20:07:30] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 2 ms to minimize.
[2025-05-29 20:07:30] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/522 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
[2025-05-29 20:07:31] [INFO ] Deduced a trap composed of 28 places in 258 ms of which 4 ms to minimize.
[2025-05-29 20:07:31] [INFO ] Deduced a trap composed of 26 places in 226 ms of which 3 ms to minimize.
[2025-05-29 20:07:31] [INFO ] Deduced a trap composed of 28 places in 246 ms of which 3 ms to minimize.
[2025-05-29 20:07:31] [INFO ] Deduced a trap composed of 26 places in 276 ms of which 3 ms to minimize.
[2025-05-29 20:07:32] [INFO ] Deduced a trap composed of 27 places in 249 ms of which 3 ms to minimize.
[2025-05-29 20:07:32] [INFO ] Deduced a trap composed of 27 places in 270 ms of which 4 ms to minimize.
[2025-05-29 20:07:32] [INFO ] Deduced a trap composed of 25 places in 250 ms of which 3 ms to minimize.
[2025-05-29 20:07:32] [INFO ] Deduced a trap composed of 27 places in 228 ms of which 3 ms to minimize.
[2025-05-29 20:07:33] [INFO ] Deduced a trap composed of 27 places in 210 ms of which 3 ms to minimize.
[2025-05-29 20:07:33] [INFO ] Deduced a trap composed of 27 places in 212 ms of which 3 ms to minimize.
[2025-05-29 20:07:33] [INFO ] Deduced a trap composed of 27 places in 211 ms of which 3 ms to minimize.
[2025-05-29 20:07:33] [INFO ] Deduced a trap composed of 26 places in 187 ms of which 3 ms to minimize.
[2025-05-29 20:07:33] [INFO ] Deduced a trap composed of 24 places in 157 ms of which 2 ms to minimize.
[2025-05-29 20:07:34] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 2 ms to minimize.
[2025-05-29 20:07:34] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 2 ms to minimize.
[2025-05-29 20:07:34] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 2 ms to minimize.
[2025-05-29 20:07:34] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 2 ms to minimize.
[2025-05-29 20:07:34] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 2 ms to minimize.
[2025-05-29 20:07:34] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2025-05-29 20:07:34] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/522 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 522/2189 variables, and 62 constraints, problems are : Problem set: 0 solved, 1646 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/523 constraints, ReadFeed: 0/1604 constraints, PredecessorRefiner: 1646/1646 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1646 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/522 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/522 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/522 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
[2025-05-29 20:07:38] [INFO ] Deduced a trap composed of 26 places in 178 ms of which 2 ms to minimize.
[2025-05-29 20:07:38] [INFO ] Deduced a trap composed of 26 places in 148 ms of which 2 ms to minimize.
[2025-05-29 20:07:38] [INFO ] Deduced a trap composed of 25 places in 147 ms of which 2 ms to minimize.
[2025-05-29 20:07:38] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 2 ms to minimize.
[2025-05-29 20:07:38] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 2 ms to minimize.
[2025-05-29 20:07:38] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 2 ms to minimize.
[2025-05-29 20:07:39] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 2 ms to minimize.
[2025-05-29 20:07:39] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2025-05-29 20:07:39] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2025-05-29 20:07:39] [INFO ] Deduced a trap composed of 25 places in 198 ms of which 2 ms to minimize.
[2025-05-29 20:07:39] [INFO ] Deduced a trap composed of 28 places in 171 ms of which 3 ms to minimize.
[2025-05-29 20:07:39] [INFO ] Deduced a trap composed of 29 places in 190 ms of which 4 ms to minimize.
[2025-05-29 20:07:40] [INFO ] Deduced a trap composed of 29 places in 177 ms of which 2 ms to minimize.
[2025-05-29 20:07:40] [INFO ] Deduced a trap composed of 33 places in 151 ms of which 3 ms to minimize.
[2025-05-29 20:07:40] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 2 ms to minimize.
[2025-05-29 20:07:40] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 2 ms to minimize.
[2025-05-29 20:07:40] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 2 ms to minimize.
[2025-05-29 20:07:40] [INFO ] Deduced a trap composed of 33 places in 149 ms of which 2 ms to minimize.
[2025-05-29 20:07:40] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 2 ms to minimize.
[2025-05-29 20:07:41] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/522 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
[2025-05-29 20:07:41] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 2 ms to minimize.
[2025-05-29 20:07:42] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 2 ms to minimize.
[2025-05-29 20:07:42] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 2 ms to minimize.
[2025-05-29 20:07:42] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 1 ms to minimize.
[2025-05-29 20:07:42] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 2 ms to minimize.
[2025-05-29 20:07:42] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2025-05-29 20:07:42] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 2 ms to minimize.
[2025-05-29 20:07:43] [INFO ] Deduced a trap composed of 25 places in 436 ms of which 4 ms to minimize.
[2025-05-29 20:07:43] [INFO ] Deduced a trap composed of 34 places in 452 ms of which 5 ms to minimize.
[2025-05-29 20:07:44] [INFO ] Deduced a trap composed of 27 places in 409 ms of which 5 ms to minimize.
[2025-05-29 20:07:44] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.75162e+06 after 3.82302e+07
[2025-05-29 20:07:44] [INFO ] Deduced a trap composed of 26 places in 309 ms of which 3 ms to minimize.
[2025-05-29 20:07:44] [INFO ] Deduced a trap composed of 25 places in 362 ms of which 4 ms to minimize.
[2025-05-29 20:07:44] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2025-05-29 20:07:45] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 1 ms to minimize.
[2025-05-29 20:07:45] [INFO ] Deduced a trap composed of 29 places in 133 ms of which 2 ms to minimize.
[2025-05-29 20:07:45] [INFO ] Deduced a trap composed of 33 places in 92 ms of which 1 ms to minimize.
[2025-05-29 20:07:45] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2025-05-29 20:07:45] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2025-05-29 20:07:53] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/522 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
[2025-05-29 20:07:54] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 2 ms to minimize.
[2025-05-29 20:07:54] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 2 ms to minimize.
[2025-05-29 20:07:54] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 1 ms to minimize.
[2025-05-29 20:07:54] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 2 ms to minimize.
[2025-05-29 20:07:55] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 2 ms to minimize.
[2025-05-29 20:07:55] [INFO ] Deduced a trap composed of 29 places in 247 ms of which 3 ms to minimize.
[2025-05-29 20:07:55] [INFO ] Deduced a trap composed of 32 places in 232 ms of which 3 ms to minimize.
[2025-05-29 20:07:55] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2025-05-29 20:07:55] [INFO ] Deduced a trap composed of 34 places in 239 ms of which 3 ms to minimize.
[2025-05-29 20:07:56] [INFO ] Deduced a trap composed of 32 places in 210 ms of which 3 ms to minimize.
[2025-05-29 20:07:56] [INFO ] Deduced a trap composed of 33 places in 168 ms of which 3 ms to minimize.
[2025-05-29 20:07:56] [INFO ] Deduced a trap composed of 32 places in 167 ms of which 3 ms to minimize.
[2025-05-29 20:07:56] [INFO ] Deduced a trap composed of 29 places in 175 ms of which 3 ms to minimize.
[2025-05-29 20:07:56] [INFO ] Deduced a trap composed of 29 places in 178 ms of which 3 ms to minimize.
[2025-05-29 20:07:57] [INFO ] Deduced a trap composed of 29 places in 177 ms of which 3 ms to minimize.
[2025-05-29 20:07:57] [INFO ] Deduced a trap composed of 28 places in 169 ms of which 3 ms to minimize.
[2025-05-29 20:07:57] [INFO ] Deduced a trap composed of 28 places in 171 ms of which 3 ms to minimize.
[2025-05-29 20:07:57] [INFO ] Deduced a trap composed of 28 places in 169 ms of which 3 ms to minimize.
[2025-05-29 20:07:57] [INFO ] Deduced a trap composed of 28 places in 177 ms of which 3 ms to minimize.
[2025-05-29 20:07:58] [INFO ] Deduced a trap composed of 28 places in 173 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/522 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
[2025-05-29 20:07:59] [INFO ] Deduced a trap composed of 28 places in 205 ms of which 3 ms to minimize.
[2025-05-29 20:07:59] [INFO ] Deduced a trap composed of 26 places in 229 ms of which 2 ms to minimize.
[2025-05-29 20:07:59] [INFO ] Deduced a trap composed of 25 places in 234 ms of which 3 ms to minimize.
[2025-05-29 20:08:00] [INFO ] Deduced a trap composed of 26 places in 229 ms of which 3 ms to minimize.
[2025-05-29 20:08:00] [INFO ] Deduced a trap composed of 28 places in 227 ms of which 3 ms to minimize.
[2025-05-29 20:08:00] [INFO ] Deduced a trap composed of 33 places in 240 ms of which 3 ms to minimize.
[2025-05-29 20:08:00] [INFO ] Deduced a trap composed of 29 places in 232 ms of which 3 ms to minimize.
[2025-05-29 20:08:01] [INFO ] Deduced a trap composed of 33 places in 194 ms of which 3 ms to minimize.
[2025-05-29 20:08:01] [INFO ] Deduced a trap composed of 27 places in 166 ms of which 3 ms to minimize.
[2025-05-29 20:08:01] [INFO ] Deduced a trap composed of 26 places in 163 ms of which 3 ms to minimize.
[2025-05-29 20:08:01] [INFO ] Deduced a trap composed of 25 places in 163 ms of which 2 ms to minimize.
[2025-05-29 20:08:01] [INFO ] Deduced a trap composed of 30 places in 140 ms of which 2 ms to minimize.
[2025-05-29 20:08:02] [INFO ] Deduced a trap composed of 30 places in 164 ms of which 2 ms to minimize.
[2025-05-29 20:08:02] [INFO ] Deduced a trap composed of 26 places in 159 ms of which 3 ms to minimize.
[2025-05-29 20:08:02] [INFO ] Deduced a trap composed of 26 places in 157 ms of which 2 ms to minimize.
[2025-05-29 20:08:02] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 3 ms to minimize.
[2025-05-29 20:08:02] [INFO ] Deduced a trap composed of 29 places in 127 ms of which 2 ms to minimize.
[2025-05-29 20:08:02] [INFO ] Deduced a trap composed of 29 places in 145 ms of which 3 ms to minimize.
[2025-05-29 20:08:02] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 2 ms to minimize.
[2025-05-29 20:08:03] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
[2025-05-29 20:08:04] [INFO ] Deduced a trap composed of 26 places in 213 ms of which 2 ms to minimize.
[2025-05-29 20:08:04] [INFO ] Deduced a trap composed of 25 places in 189 ms of which 3 ms to minimize.
[2025-05-29 20:08:04] [INFO ] Deduced a trap composed of 27 places in 241 ms of which 3 ms to minimize.
[2025-05-29 20:08:05] [INFO ] Deduced a trap composed of 25 places in 167 ms of which 2 ms to minimize.
[2025-05-29 20:08:05] [INFO ] Deduced a trap composed of 25 places in 194 ms of which 3 ms to minimize.
[2025-05-29 20:08:05] [INFO ] Deduced a trap composed of 26 places in 199 ms of which 2 ms to minimize.
SMT process timed out in 61091ms, After SMT, problems are : Problem set: 0 solved, 1646 unsolved
Search for dead transitions found 0 dead transitions in 61110ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69389 ms. Remains : 523/523 places, 1666/1666 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1543 edges and 523 vertex of which 439 / 523 are part of one of the 2 SCC in 1 ms
Free SCC test removed 437 places
Drop transitions (Empty/Sink Transition effects.) removed 1165 transitions
Ensure Unique test removed 412 transitions
Reduce isomorphic transitions removed 1577 transitions.
Graph (complete) has 211 edges and 86 vertex of which 25 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.0 ms
Discarding 61 places :
Also discarding 19 output transitions
Drop transitions (Output transitions of discarded places.) removed 19 transitions
Drop transitions (Empty/Sink Transition effects.) removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 25 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 24 transition count 28
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 63 place count 6 transition count 10
Iterating global reduction 2 with 18 rules applied. Total rules applied 81 place count 6 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 83 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 86 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 4 transition count 5
Applied a total of 87 rules in 7 ms. Remains 4 /523 variables (removed 519) and now considering 5/1666 (removed 1661) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 4 cols
[2025-05-29 20:08:05] [INFO ] Computed 0 invariants in 1 ms
[2025-05-29 20:08:05] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-29 20:08:05] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-29 20:08:05] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-29 20:08:05] [INFO ] After 27ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-05-29 20:08:05] [INFO ] Flatten gal took : 1 ms
[2025-05-29 20:08:05] [INFO ] Flatten gal took : 1 ms
[2025-05-29 20:08:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10694385245527716331.gal : 1 ms
[2025-05-29 20:08:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15065534528706753319.prop : 0 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/ReachabilityCardinality10694385245527716331.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15065534528706753319.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 ...330
Loading property file /tmp/ReachabilityCardinality15065534528706753319.prop.
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 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,6,0.002602,3516,2,7,6,33,6,0,21,18,0
Total reachable state count : 6

Verifying 1 reachability properties.
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,0.002965,3892,2,5,6,33,7,0,24,18,0
Over-approximation ignoring read arcs solved 0 properties in 77 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[20]
Ending property specific reduction for CANInsertWithFailure-PT-020-UpperBounds-07 in 155109 ms.
Starting property specific reduction for CANInsertWithFailure-PT-020-UpperBounds-08
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[20]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[20]
// Phase 1: matrix 1674 rows 531 cols
[2025-05-29 20:08:05] [INFO ] Computed 22 invariants in 14 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[20]
RANDOM walk for 10000 steps (105 resets) in 90 ms. (109 steps per ms)
BEST_FIRST walk for 10001 steps (5 resets) in 18 ms. (526 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[20]
[2025-05-29 20:08:05] [INFO ] Invariant cache hit.
[2025-05-29 20:08:05] [INFO ] [Real]Absence check using 20 positive place invariants in 12 ms returned sat
[2025-05-29 20:08:05] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2025-05-29 20:08:06] [INFO ] [Real]Absence check using state equation in 437 ms returned sat
[2025-05-29 20:08:06] [INFO ] State equation strengthened by 1582 read => feed constraints.
[2025-05-29 20:08:06] [INFO ] [Real]Added 1582 Read/Feed constraints in 191 ms returned sat
[2025-05-29 20:08:06] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:08:06] [INFO ] [Nat]Absence check using 20 positive place invariants in 18 ms returned sat
[2025-05-29 20:08:06] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 8 ms returned sat
[2025-05-29 20:08:07] [INFO ] [Nat]Absence check using state equation in 521 ms returned sat
[2025-05-29 20:08:07] [INFO ] [Nat]Added 1582 Read/Feed constraints in 245 ms returned sat
[2025-05-29 20:08:07] [INFO ] Computed and/alt/rep : 1160/3017/1160 causal constraints (skipped 494 transitions) in 124 ms.
[2025-05-29 20:08:08] [INFO ] Added : 13 causal constraints over 3 iterations in 489 ms. Result :sat
Minimization took 563 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[20]
Support contains 1 out of 531 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 531/531 places, 1674/1674 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 524 transition count 1667
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 524 transition count 1666
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 16 place count 523 transition count 1666
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 24 place count 523 transition count 1666
Applied a total of 24 rules in 99 ms. Remains 523 /531 variables (removed 8) and now considering 1666/1674 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 523/531 places, 1666/1674 transitions.
// Phase 1: matrix 1666 rows 523 cols
[2025-05-29 20:08:08] [INFO ] Computed 22 invariants in 14 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[20]
RANDOM walk for 1000000 steps (10538 resets) in 5128 ms. (194 steps per ms)
BEST_FIRST walk for 1000001 steps (478 resets) in 931 ms. (1072 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[20]
[2025-05-29 20:08:14] [INFO ] Invariant cache hit.
[2025-05-29 20:08:14] [INFO ] [Real]Absence check using 20 positive place invariants in 13 ms returned sat
[2025-05-29 20:08:14] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2025-05-29 20:08:15] [INFO ] [Real]Absence check using state equation in 449 ms returned sat
[2025-05-29 20:08:15] [INFO ] State equation strengthened by 1604 read => feed constraints.
[2025-05-29 20:08:15] [INFO ] [Real]Added 1604 Read/Feed constraints in 183 ms returned sat
[2025-05-29 20:08:15] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:08:15] [INFO ] [Nat]Absence check using 20 positive place invariants in 13 ms returned sat
[2025-05-29 20:08:15] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2025-05-29 20:08:16] [INFO ] [Nat]Absence check using state equation in 436 ms returned sat
[2025-05-29 20:08:16] [INFO ] [Nat]Added 1604 Read/Feed constraints in 186 ms returned sat
[2025-05-29 20:08:16] [INFO ] Computed and/alt/rep : 1152/3049/1152 causal constraints (skipped 494 transitions) in 115 ms.
[2025-05-29 20:08:16] [INFO ] Added : 7 causal constraints over 2 iterations in 405 ms. Result :sat
Minimization took 4531 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[20]
Support contains 1 out of 523 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1666/1666 transitions.
Applied a total of 0 rules in 28 ms. Remains 523 /523 variables (removed 0) and now considering 1666/1666 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 523/523 places, 1666/1666 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1666/1666 transitions.
Applied a total of 0 rules in 27 ms. Remains 523 /523 variables (removed 0) and now considering 1666/1666 (removed 0) transitions.
[2025-05-29 20:08:21] [INFO ] Invariant cache hit.
[2025-05-29 20:08:22] [INFO ] Implicit Places using invariants in 731 ms returned []
[2025-05-29 20:08:22] [INFO ] Invariant cache hit.
[2025-05-29 20:08:22] [INFO ] State equation strengthened by 1604 read => feed constraints.
[2025-05-29 20:08:29] [INFO ] Implicit Places using invariants and state equation in 6982 ms returned []
Implicit Place search using SMT with State Equation took 7715 ms to find 0 implicit places.
[2025-05-29 20:08:29] [INFO ] Redundant transitions in 36 ms returned []
Running 1646 sub problems to find dead transitions.
[2025-05-29 20:08:29] [INFO ] Invariant cache hit.
[2025-05-29 20:08:29] [INFO ] State equation strengthened by 1604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/522 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/522 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
[2025-05-29 20:08:57] [INFO ] Deduced a trap composed of 25 places in 176 ms of which 3 ms to minimize.
[2025-05-29 20:08:57] [INFO ] Deduced a trap composed of 24 places in 234 ms of which 3 ms to minimize.
[2025-05-29 20:08:57] [INFO ] Deduced a trap composed of 26 places in 303 ms of which 5 ms to minimize.
[2025-05-29 20:08:58] [INFO ] Deduced a trap composed of 25 places in 346 ms of which 4 ms to minimize.
[2025-05-29 20:08:58] [INFO ] Deduced a trap composed of 29 places in 286 ms of which 4 ms to minimize.
[2025-05-29 20:08:58] [INFO ] Deduced a trap composed of 28 places in 291 ms of which 4 ms to minimize.
[2025-05-29 20:08:59] [INFO ] Deduced a trap composed of 33 places in 257 ms of which 4 ms to minimize.
[2025-05-29 20:08:59] [INFO ] Deduced a trap composed of 29 places in 264 ms of which 4 ms to minimize.
[2025-05-29 20:08:59] [INFO ] Deduced a trap composed of 27 places in 248 ms of which 3 ms to minimize.
[2025-05-29 20:09:00] [INFO ] Deduced a trap composed of 26 places in 239 ms of which 3 ms to minimize.
[2025-05-29 20:09:00] [INFO ] Deduced a trap composed of 27 places in 209 ms of which 3 ms to minimize.
SMT process timed out in 30974ms, After SMT, problems are : Problem set: 0 solved, 1646 unsolved
Search for dead transitions found 0 dead transitions in 30992ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38779 ms. Remains : 523/523 places, 1666/1666 transitions.
[2025-05-29 20:09:00] [INFO ] Flatten gal took : 120 ms
[2025-05-29 20:09:00] [INFO ] Flatten gal took : 62 ms
[2025-05-29 20:09:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11434777016802200431.gal : 10 ms
[2025-05-29 20:09:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17201802045149318463.prop : 0 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/ReachabilityCardinality11434777016802200431.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17201802045149318463.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 ...330
RANDOM walk for 40000 steps (418 resets) in 885 ms. (45 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (17 resets) in 105 ms. (377 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (19 resets) in 99 ms. (400 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality17201802045149318463.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 147
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :147 after 150
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :150 after 151
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :151 after 155
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :155 after 156
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :156 after 157
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :157 after 163
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :163 after 174
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :174 after 199
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :199 after 235
Interrupted probabilistic random walk after 308444 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :0 out of 2
Probabilistic random walk after 308444 steps, saw 43179 distinct states, run finished after 3001 ms. (steps per millisecond=102 ) properties seen :0
[2025-05-29 20:09:03] [INFO ] Invariant cache hit.
[2025-05-29 20:09:03] [INFO ] State equation strengthened by 1604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 480/481 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-29 20:09:03] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 38/519 variables, 19/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/519 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/521 variables, 2/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :235 after 319
[2025-05-29 20:09:04] [INFO ] Deduced a trap composed of 25 places in 468 ms of which 5 ms to minimize.
[2025-05-29 20:09:04] [INFO ] Deduced a trap composed of 31 places in 417 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/521 variables, 2/25 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/521 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1666/2187 variables, 521/546 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :319 after 454
At refinement iteration 10 (INCLUDED_ONLY) 0/2187 variables, 1604/2150 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2187 variables, 0/2150 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/2189 variables, 2/2152 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2189 variables, 0/2152 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2189 variables, 0/2152 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2189/2189 variables, and 2152 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2246 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 523/523 constraints, ReadFeed: 1604/1604 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 480/481 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 38/519 variables, 19/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/519 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/521 variables, 2/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/521 variables, 2/25 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-05-29 20:09:06] [INFO ] Deduced a trap composed of 31 places in 433 ms of which 5 ms to minimize.
[2025-05-29 20:09:07] [INFO ] Deduced a trap composed of 31 places in 431 ms of which 4 ms to minimize.
[2025-05-29 20:09:07] [INFO ] Deduced a trap composed of 31 places in 432 ms of which 5 ms to minimize.
[2025-05-29 20:09:07] [INFO ] Deduced a trap composed of 29 places in 437 ms of which 4 ms to minimize.
[2025-05-29 20:09:08] [INFO ] Deduced a trap composed of 28 places in 411 ms of which 5 ms to minimize.
[2025-05-29 20:09:08] [INFO ] Deduced a trap composed of 27 places in 414 ms of which 5 ms to minimize.
[2025-05-29 20:09:09] [INFO ] Deduced a trap composed of 26 places in 426 ms of which 4 ms to minimize.
[2025-05-29 20:09:09] [INFO ] Deduced a trap composed of 29 places in 415 ms of which 5 ms to minimize.
[2025-05-29 20:09:10] [INFO ] Deduced a trap composed of 29 places in 431 ms of which 5 ms to minimize.
[2025-05-29 20:09:10] [INFO ] Deduced a trap composed of 29 places in 412 ms of which 4 ms to minimize.
[2025-05-29 20:09:10] [INFO ] Deduced a trap composed of 26 places in 373 ms of which 5 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :454 after 7503
[2025-05-29 20:09:11] [INFO ] Deduced a trap composed of 25 places in 349 ms of which 4 ms to minimize.
SMT process timed out in 7565ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 523 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1666/1666 transitions.
Applied a total of 0 rules in 46 ms. Remains 523 /523 variables (removed 0) and now considering 1666/1666 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 523/523 places, 1666/1666 transitions.
RANDOM walk for 40000 steps (418 resets) in 432 ms. (92 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (16 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 380792 steps, run timeout after 3001 ms. (steps per millisecond=126 ) properties seen :0 out of 1
Probabilistic random walk after 380792 steps, saw 50637 distinct states, run finished after 3001 ms. (steps per millisecond=126 ) properties seen :0
[2025-05-29 20:09:14] [INFO ] Invariant cache hit.
[2025-05-29 20:09:14] [INFO ] State equation strengthened by 1604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 480/481 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:09:14] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
[2025-05-29 20:09:14] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
[2025-05-29 20:09:14] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 1 ms to minimize.
[2025-05-29 20:09:14] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 1 ms to minimize.
[2025-05-29 20:09:14] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
[2025-05-29 20:09:14] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 1 ms to minimize.
[2025-05-29 20:09:14] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
[2025-05-29 20:09:14] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 0 ms to minimize.
[2025-05-29 20:09:15] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
[2025-05-29 20:09:15] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2025-05-29 20:09:15] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
[2025-05-29 20:09:15] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
[2025-05-29 20:09:15] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
[2025-05-29 20:09:15] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
[2025-05-29 20:09:15] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 0 ms to minimize.
[2025-05-29 20:09:15] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 38/519 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/519 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/521 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/521 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1666/2187 variables, 521/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2187 variables, 1604/2163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2187 variables, 0/2163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/2189 variables, 2/2165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2189 variables, 0/2165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/2189 variables, 0/2165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2189/2189 variables, and 2165 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1828 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 523/523 constraints, ReadFeed: 1604/1604 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 480/481 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:09:16] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2025-05-29 20:09:16] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2025-05-29 20:09:16] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/481 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 38/519 variables, 19/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/519 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/521 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:09:17] [INFO ] Deduced a trap composed of 28 places in 445 ms of which 5 ms to minimize.
[2025-05-29 20:09:17] [INFO ] Deduced a trap composed of 26 places in 441 ms of which 4 ms to minimize.
[2025-05-29 20:09:18] [INFO ] Deduced a trap composed of 25 places in 453 ms of which 5 ms to minimize.
[2025-05-29 20:09:18] [INFO ] Deduced a trap composed of 29 places in 494 ms of which 5 ms to minimize.
[2025-05-29 20:09:19] [INFO ] Deduced a trap composed of 25 places in 457 ms of which 5 ms to minimize.
[2025-05-29 20:09:19] [INFO ] Deduced a trap composed of 25 places in 444 ms of which 5 ms to minimize.
[2025-05-29 20:09:19] [INFO ] Deduced a trap composed of 26 places in 447 ms of which 5 ms to minimize.
[2025-05-29 20:09:20] [INFO ] Deduced a trap composed of 29 places in 441 ms of which 5 ms to minimize.
[2025-05-29 20:09:20] [INFO ] Deduced a trap composed of 25 places in 425 ms of which 5 ms to minimize.
[2025-05-29 20:09:21] [INFO ] Deduced a trap composed of 31 places in 491 ms of which 5 ms to minimize.
[2025-05-29 20:09:21] [INFO ] Deduced a trap composed of 32 places in 419 ms of which 4 ms to minimize.
[2025-05-29 20:09:22] [INFO ] Deduced a trap composed of 25 places in 399 ms of which 7 ms to minimize.
[2025-05-29 20:09:22] [INFO ] Deduced a trap composed of 25 places in 399 ms of which 4 ms to minimize.
[2025-05-29 20:09:23] [INFO ] Deduced a trap composed of 25 places in 543 ms of which 5 ms to minimize.
[2025-05-29 20:09:23] [INFO ] Deduced a trap composed of 32 places in 484 ms of which 5 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :7503 after 9207
[2025-05-29 20:09:24] [INFO ] Deduced a trap composed of 25 places in 430 ms of which 4 ms to minimize.
[2025-05-29 20:09:24] [INFO ] Deduced a trap composed of 28 places in 377 ms of which 5 ms to minimize.
[2025-05-29 20:09:24] [INFO ] Deduced a trap composed of 26 places in 495 ms of which 5 ms to minimize.
[2025-05-29 20:09:25] [INFO ] Deduced a trap composed of 26 places in 471 ms of which 5 ms to minimize.
[2025-05-29 20:09:25] [INFO ] Deduced a trap composed of 24 places in 449 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/521 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:09:26] [INFO ] Deduced a trap composed of 38 places in 362 ms of which 5 ms to minimize.
[2025-05-29 20:09:26] [INFO ] Deduced a trap composed of 32 places in 341 ms of which 5 ms to minimize.
[2025-05-29 20:09:27] [INFO ] Deduced a trap composed of 25 places in 363 ms of which 4 ms to minimize.
[2025-05-29 20:09:27] [INFO ] Deduced a trap composed of 27 places in 482 ms of which 5 ms to minimize.
[2025-05-29 20:09:27] [INFO ] Deduced a trap composed of 29 places in 464 ms of which 5 ms to minimize.
[2025-05-29 20:09:28] [INFO ] Deduced a trap composed of 30 places in 437 ms of which 5 ms to minimize.
[2025-05-29 20:09:28] [INFO ] Deduced a trap composed of 26 places in 392 ms of which 4 ms to minimize.
[2025-05-29 20:09:29] [INFO ] Deduced a trap composed of 26 places in 440 ms of which 4 ms to minimize.
[2025-05-29 20:09:29] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/521 variables, 9/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/521 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1666/2187 variables, 521/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2187 variables, 1604/2195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2187 variables, 1/2196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2187 variables, 0/2196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/2189 variables, 2/2198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2189 variables, 0/2198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2189 variables, 0/2198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2189/2189 variables, and 2198 constraints, problems are : Problem set: 0 solved, 1 unsolved in 14420 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 523/523 constraints, ReadFeed: 1604/1604 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 48/48 constraints]
After SMT, in 16271ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 44 ms.
Support contains 1 out of 523 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1666/1666 transitions.
Applied a total of 0 rules in 42 ms. Remains 523 /523 variables (removed 0) and now considering 1666/1666 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 523/523 places, 1666/1666 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1666/1666 transitions.
Applied a total of 0 rules in 42 ms. Remains 523 /523 variables (removed 0) and now considering 1666/1666 (removed 0) transitions.
[2025-05-29 20:09:30] [INFO ] Invariant cache hit.
[2025-05-29 20:09:31] [INFO ] Implicit Places using invariants in 835 ms returned []
[2025-05-29 20:09:31] [INFO ] Invariant cache hit.
[2025-05-29 20:09:32] [INFO ] State equation strengthened by 1604 read => feed constraints.
[2025-05-29 20:09:38] [INFO ] Implicit Places using invariants and state equation in 6574 ms returned []
Implicit Place search using SMT with State Equation took 7410 ms to find 0 implicit places.
[2025-05-29 20:09:38] [INFO ] Redundant transitions in 37 ms returned []
Running 1646 sub problems to find dead transitions.
[2025-05-29 20:09:38] [INFO ] Invariant cache hit.
[2025-05-29 20:09:38] [INFO ] State equation strengthened by 1604 read => feed constraints.
Detected timeout of ITS tools.
[2025-05-29 20:09:50] [INFO ] Flatten gal took : 56 ms
[2025-05-29 20:09:50] [INFO ] Applying decomposition
[2025-05-29 20:09:50] [INFO ] Flatten gal took : 55 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/graph7795996603639455620.txt' '-o' '/tmp/graph7795996603639455620.bin' '-w' '/tmp/graph7795996603639455620.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7795996603639455620.bin' '-l' '-1' '-v' '-w' '/tmp/graph7795996603639455620.weights' '-q' '0' '-e' '0.001'
[2025-05-29 20:09:50] [INFO ] Decomposing Gal with order
[2025-05-29 20:09:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 20:09:50] [INFO ] Removed a total of 1287 redundant transitions.
[2025-05-29 20:09:50] [INFO ] Flatten gal took : 133 ms
[2025-05-29 20:09:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 1504 labels/synchronizations in 46 ms.
[2025-05-29 20:09:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2091343788470020047.gal : 20 ms
[2025-05-29 20:09:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5988221333335294287.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/ReachabilityCardinality2091343788470020047.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5988221333335294287.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/ReachabilityCardinality5988221333335294287.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 812
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :812 after 812
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :812 after 812
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :812 after 812
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :812 after 812
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :812 after 812
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :812 after 837
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :837 after 845
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :845 after 2786
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2786 after 157029
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :157029 after 7.26852e+06
At refinement iteration 0 (INCLUDED_ONLY) 0/522 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :7.26852e+06 after 9.23149e+06
At refinement iteration 1 (INCLUDED_ONLY) 0/522 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
[2025-05-29 20:10:03] [INFO ] Deduced a trap composed of 25 places in 230 ms of which 3 ms to minimize.
[2025-05-29 20:10:04] [INFO ] Deduced a trap composed of 24 places in 307 ms of which 4 ms to minimize.
[2025-05-29 20:10:04] [INFO ] Deduced a trap composed of 26 places in 313 ms of which 4 ms to minimize.
[2025-05-29 20:10:04] [INFO ] Deduced a trap composed of 25 places in 303 ms of which 4 ms to minimize.
[2025-05-29 20:10:05] [INFO ] Deduced a trap composed of 29 places in 281 ms of which 4 ms to minimize.
[2025-05-29 20:10:05] [INFO ] Deduced a trap composed of 28 places in 276 ms of which 4 ms to minimize.
[2025-05-29 20:10:05] [INFO ] Deduced a trap composed of 33 places in 248 ms of which 3 ms to minimize.
[2025-05-29 20:10:05] [INFO ] Deduced a trap composed of 29 places in 249 ms of which 4 ms to minimize.
[2025-05-29 20:10:06] [INFO ] Deduced a trap composed of 27 places in 213 ms of which 3 ms to minimize.
[2025-05-29 20:10:06] [INFO ] Deduced a trap composed of 26 places in 220 ms of which 3 ms to minimize.
[2025-05-29 20:10:06] [INFO ] Deduced a trap composed of 27 places in 191 ms of which 3 ms to minimize.
[2025-05-29 20:10:06] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 3 ms to minimize.
[2025-05-29 20:10:07] [INFO ] Deduced a trap composed of 2 places in 664 ms of which 7 ms to minimize.
[2025-05-29 20:10:08] [INFO ] Deduced a trap composed of 22 places in 679 ms of which 7 ms to minimize.
[2025-05-29 20:10:09] [INFO ] Deduced a trap composed of 22 places in 657 ms of which 8 ms to minimize.
[2025-05-29 20:10:09] [INFO ] Deduced a trap composed of 22 places in 715 ms of which 7 ms to minimize.
SMT process timed out in 31426ms, After SMT, problems are : Problem set: 0 solved, 1646 unsolved
Search for dead transitions found 0 dead transitions in 31444ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38945 ms. Remains : 523/523 places, 1666/1666 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1543 edges and 523 vertex of which 439 / 523 are part of one of the 2 SCC in 1 ms
Free SCC test removed 437 places
Drop transitions (Empty/Sink Transition effects.) removed 1165 transitions
Ensure Unique test removed 412 transitions
Reduce isomorphic transitions removed 1577 transitions.
Graph (complete) has 211 edges and 86 vertex of which 25 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.0 ms
Discarding 61 places :
Also discarding 19 output transitions
Drop transitions (Output transitions of discarded places.) removed 19 transitions
Drop transitions (Empty/Sink Transition effects.) removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 25 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 24 transition count 28
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 63 place count 6 transition count 10
Iterating global reduction 2 with 18 rules applied. Total rules applied 81 place count 6 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 83 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 86 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 4 transition count 5
Applied a total of 87 rules in 12 ms. Remains 4 /523 variables (removed 519) and now considering 5/1666 (removed 1661) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 4 cols
[2025-05-29 20:10:09] [INFO ] Computed 0 invariants in 1 ms
[2025-05-29 20:10:09] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-29 20:10:09] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-29 20:10:09] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-29 20:10:09] [INFO ] After 40ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-05-29 20:10:09] [INFO ] Flatten gal took : 0 ms
[2025-05-29 20:10:09] [INFO ] Flatten gal took : 0 ms
[2025-05-29 20:10:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9716178292005337300.gal : 1 ms
[2025-05-29 20:10:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11968898347961686613.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/ReachabilityCardinality9716178292005337300.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11968898347961686613.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 ...329
Loading property file /tmp/ReachabilityCardinality11968898347961686613.prop.
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 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,6,0.003854,3516,2,7,6,33,6,0,21,18,0
Total reachable state count : 6

Verifying 1 reachability properties.
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,0.005258,3892,2,5,6,33,7,0,24,18,0
Over-approximation ignoring read arcs solved 0 properties in 106 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[20]
Ending property specific reduction for CANInsertWithFailure-PT-020-UpperBounds-08 in 124242 ms.
Starting property specific reduction for CANInsertWithFailure-PT-020-UpperBounds-09
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[20]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[20]
// Phase 1: matrix 1674 rows 531 cols
[2025-05-29 20:10:09] [INFO ] Computed 22 invariants in 21 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[20]
RANDOM walk for 10000 steps (106 resets) in 83 ms. (119 steps per ms)
BEST_FIRST walk for 10001 steps (5 resets) in 17 ms. (555 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[20]
[2025-05-29 20:10:10] [INFO ] Invariant cache hit.
[2025-05-29 20:10:10] [INFO ] [Real]Absence check using 20 positive place invariants in 22 ms returned sat
[2025-05-29 20:10:10] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 9 ms returned sat
[2025-05-29 20:10:10] [INFO ] [Real]Absence check using state equation in 678 ms returned sat
[2025-05-29 20:10:10] [INFO ] State equation strengthened by 1582 read => feed constraints.
[2025-05-29 20:10:11] [INFO ] [Real]Added 1582 Read/Feed constraints in 240 ms returned sat
[2025-05-29 20:10:11] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:10:11] [INFO ] [Nat]Absence check using 20 positive place invariants in 18 ms returned sat
[2025-05-29 20:10:11] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 8 ms returned sat
[2025-05-29 20:10:11] [INFO ] [Nat]Absence check using state equation in 560 ms returned sat
[2025-05-29 20:10:12] [INFO ] [Nat]Added 1582 Read/Feed constraints in 210 ms returned sat
[2025-05-29 20:10:12] [INFO ] Computed and/alt/rep : 1160/3017/1160 causal constraints (skipped 494 transitions) in 128 ms.
[2025-05-29 20:10:12] [INFO ] Added : 7 causal constraints over 2 iterations in 419 ms. Result :sat
Minimization took 570 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[20]
Support contains 1 out of 531 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 531/531 places, 1674/1674 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 524 transition count 1667
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 524 transition count 1666
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 16 place count 523 transition count 1666
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 24 place count 523 transition count 1666
Applied a total of 24 rules in 152 ms. Remains 523 /531 variables (removed 8) and now considering 1666/1674 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 153 ms. Remains : 523/531 places, 1666/1674 transitions.
// Phase 1: matrix 1666 rows 523 cols
[2025-05-29 20:10:13] [INFO ] Computed 22 invariants in 15 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[20]
RANDOM walk for 1000000 steps (10537 resets) in 5354 ms. (186 steps per ms)
BEST_FIRST walk for 1000001 steps (481 resets) in 934 ms. (1069 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[20]
[2025-05-29 20:10:19] [INFO ] Invariant cache hit.
[2025-05-29 20:10:19] [INFO ] [Real]Absence check using 20 positive place invariants in 20 ms returned sat
[2025-05-29 20:10:19] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 8 ms returned sat
[2025-05-29 20:10:20] [INFO ] [Real]Absence check using state equation in 593 ms returned sat
[2025-05-29 20:10:20] [INFO ] State equation strengthened by 1604 read => feed constraints.
[2025-05-29 20:10:20] [INFO ] [Real]Added 1604 Read/Feed constraints in 182 ms returned sat
[2025-05-29 20:10:20] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:10:20] [INFO ] [Nat]Absence check using 20 positive place invariants in 14 ms returned sat
[2025-05-29 20:10:20] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2025-05-29 20:10:21] [INFO ] [Nat]Absence check using state equation in 567 ms returned sat
[2025-05-29 20:10:21] [INFO ] [Nat]Added 1604 Read/Feed constraints in 208 ms returned sat
[2025-05-29 20:10:21] [INFO ] Computed and/alt/rep : 1152/3049/1152 causal constraints (skipped 494 transitions) in 123 ms.
[2025-05-29 20:10:22] [INFO ] Added : 10 causal constraints over 2 iterations in 430 ms. Result :sat
Minimization took 4506 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[20]
Support contains 1 out of 523 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1666/1666 transitions.
Applied a total of 0 rules in 35 ms. Remains 523 /523 variables (removed 0) and now considering 1666/1666 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 523/523 places, 1666/1666 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1666/1666 transitions.
Applied a total of 0 rules in 35 ms. Remains 523 /523 variables (removed 0) and now considering 1666/1666 (removed 0) transitions.
[2025-05-29 20:10:26] [INFO ] Invariant cache hit.
[2025-05-29 20:10:27] [INFO ] Implicit Places using invariants in 1022 ms returned []
[2025-05-29 20:10:27] [INFO ] Invariant cache hit.
[2025-05-29 20:10:28] [INFO ] State equation strengthened by 1604 read => feed constraints.
[2025-05-29 20:10:35] [INFO ] Implicit Places using invariants and state equation in 7950 ms returned []
Implicit Place search using SMT with State Equation took 8974 ms to find 0 implicit places.
[2025-05-29 20:10:35] [INFO ] Redundant transitions in 36 ms returned []
Running 1646 sub problems to find dead transitions.
[2025-05-29 20:10:35] [INFO ] Invariant cache hit.
[2025-05-29 20:10:35] [INFO ] State equation strengthened by 1604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/522 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/522 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
[2025-05-29 20:11:01] [INFO ] Deduced a trap composed of 25 places in 287 ms of which 5 ms to minimize.
[2025-05-29 20:11:01] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 2 ms to minimize.
[2025-05-29 20:11:01] [INFO ] Deduced a trap composed of 25 places in 249 ms of which 4 ms to minimize.
[2025-05-29 20:11:01] [INFO ] Deduced a trap composed of 26 places in 281 ms of which 4 ms to minimize.
[2025-05-29 20:11:02] [INFO ] Deduced a trap composed of 25 places in 285 ms of which 5 ms to minimize.
[2025-05-29 20:11:02] [INFO ] Deduced a trap composed of 25 places in 261 ms of which 4 ms to minimize.
[2025-05-29 20:11:02] [INFO ] Deduced a trap composed of 25 places in 261 ms of which 4 ms to minimize.
[2025-05-29 20:11:02] [INFO ] Deduced a trap composed of 28 places in 235 ms of which 3 ms to minimize.
[2025-05-29 20:11:03] [INFO ] Deduced a trap composed of 27 places in 258 ms of which 4 ms to minimize.
[2025-05-29 20:11:03] [INFO ] Deduced a trap composed of 26 places in 255 ms of which 4 ms to minimize.
[2025-05-29 20:11:03] [INFO ] Deduced a trap composed of 28 places in 294 ms of which 4 ms to minimize.
[2025-05-29 20:11:04] [INFO ] Deduced a trap composed of 25 places in 288 ms of which 4 ms to minimize.
[2025-05-29 20:11:04] [INFO ] Deduced a trap composed of 26 places in 252 ms of which 4 ms to minimize.
[2025-05-29 20:11:04] [INFO ] Deduced a trap composed of 27 places in 218 ms of which 3 ms to minimize.
[2025-05-29 20:11:04] [INFO ] Deduced a trap composed of 25 places in 246 ms of which 4 ms to minimize.
[2025-05-29 20:11:05] [INFO ] Deduced a trap composed of 25 places in 219 ms of which 4 ms to minimize.
[2025-05-29 20:11:05] [INFO ] Deduced a trap composed of 26 places in 191 ms of which 3 ms to minimize.
[2025-05-29 20:11:05] [INFO ] Deduced a trap composed of 28 places in 167 ms of which 2 ms to minimize.
[2025-05-29 20:11:05] [INFO ] Deduced a trap composed of 30 places in 165 ms of which 3 ms to minimize.
[2025-05-29 20:11:05] [INFO ] Deduced a trap composed of 26 places in 139 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/522 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 522/2189 variables, and 42 constraints, problems are : Problem set: 0 solved, 1646 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/523 constraints, ReadFeed: 0/1604 constraints, PredecessorRefiner: 1646/1646 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1646 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/522 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/522 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/522 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
[2025-05-29 20:11:09] [INFO ] Deduced a trap composed of 26 places in 132 ms of which 3 ms to minimize.
[2025-05-29 20:11:09] [INFO ] Deduced a trap composed of 26 places in 141 ms of which 3 ms to minimize.
[2025-05-29 20:11:10] [INFO ] Deduced a trap composed of 28 places in 173 ms of which 4 ms to minimize.
[2025-05-29 20:11:10] [INFO ] Deduced a trap composed of 25 places in 146 ms of which 2 ms to minimize.
[2025-05-29 20:11:10] [INFO ] Deduced a trap composed of 25 places in 147 ms of which 3 ms to minimize.
[2025-05-29 20:11:10] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 2 ms to minimize.
[2025-05-29 20:11:10] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 2 ms to minimize.
[2025-05-29 20:11:10] [INFO ] Deduced a trap composed of 27 places in 151 ms of which 2 ms to minimize.
[2025-05-29 20:11:11] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 3 ms to minimize.
[2025-05-29 20:11:11] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 2 ms to minimize.
[2025-05-29 20:11:11] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 1 ms to minimize.
[2025-05-29 20:11:11] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 2 ms to minimize.
[2025-05-29 20:11:12] [INFO ] Deduced a trap composed of 3 places in 506 ms of which 7 ms to minimize.
[2025-05-29 20:11:12] [INFO ] Deduced a trap composed of 25 places in 472 ms of which 6 ms to minimize.
[2025-05-29 20:11:12] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2025-05-29 20:11:13] [INFO ] Deduced a trap composed of 25 places in 338 ms of which 5 ms to minimize.
[2025-05-29 20:11:13] [INFO ] Deduced a trap composed of 28 places in 308 ms of which 5 ms to minimize.
[2025-05-29 20:11:13] [INFO ] Deduced a trap composed of 28 places in 309 ms of which 4 ms to minimize.
[2025-05-29 20:11:14] [INFO ] Deduced a trap composed of 27 places in 303 ms of which 4 ms to minimize.
[2025-05-29 20:11:14] [INFO ] Deduced a trap composed of 27 places in 284 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/522 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
[2025-05-29 20:11:15] [INFO ] Deduced a trap composed of 29 places in 192 ms of which 3 ms to minimize.
[2025-05-29 20:11:15] [INFO ] Deduced a trap composed of 33 places in 226 ms of which 3 ms to minimize.
[2025-05-29 20:11:16] [INFO ] Deduced a trap composed of 25 places in 220 ms of which 3 ms to minimize.
[2025-05-29 20:11:16] [INFO ] Deduced a trap composed of 26 places in 234 ms of which 3 ms to minimize.
[2025-05-29 20:11:16] [INFO ] Deduced a trap composed of 28 places in 321 ms of which 4 ms to minimize.
[2025-05-29 20:11:17] [INFO ] Deduced a trap composed of 28 places in 316 ms of which 5 ms to minimize.
[2025-05-29 20:11:17] [INFO ] Deduced a trap composed of 28 places in 315 ms of which 5 ms to minimize.
[2025-05-29 20:11:17] [INFO ] Deduced a trap composed of 31 places in 288 ms of which 4 ms to minimize.
[2025-05-29 20:11:17] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 2 ms to minimize.
[2025-05-29 20:11:18] [INFO ] Deduced a trap composed of 29 places in 317 ms of which 5 ms to minimize.
[2025-05-29 20:11:18] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 2 ms to minimize.
[2025-05-29 20:11:18] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 2 ms to minimize.
[2025-05-29 20:11:18] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 2 ms to minimize.
[2025-05-29 20:11:18] [INFO ] Deduced a trap composed of 27 places in 288 ms of which 4 ms to minimize.
[2025-05-29 20:11:19] [INFO ] Deduced a trap composed of 28 places in 383 ms of which 5 ms to minimize.
[2025-05-29 20:11:19] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 2 ms to minimize.
[2025-05-29 20:11:19] [INFO ] Deduced a trap composed of 26 places in 353 ms of which 4 ms to minimize.
[2025-05-29 20:11:19] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 2 ms to minimize.
[2025-05-29 20:11:20] [INFO ] Deduced a trap composed of 35 places in 333 ms of which 5 ms to minimize.
[2025-05-29 20:11:20] [INFO ] Deduced a trap composed of 28 places in 345 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/522 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
[2025-05-29 20:11:22] [INFO ] Deduced a trap composed of 28 places in 317 ms of which 4 ms to minimize.
[2025-05-29 20:11:22] [INFO ] Deduced a trap composed of 34 places in 316 ms of which 5 ms to minimize.
[2025-05-29 20:11:23] [INFO ] Deduced a trap composed of 30 places in 290 ms of which 4 ms to minimize.
[2025-05-29 20:11:23] [INFO ] Deduced a trap composed of 25 places in 282 ms of which 4 ms to minimize.
[2025-05-29 20:11:23] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 2 ms to minimize.
[2025-05-29 20:11:23] [INFO ] Deduced a trap composed of 26 places in 261 ms of which 3 ms to minimize.
[2025-05-29 20:11:23] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 2 ms to minimize.
[2025-05-29 20:11:24] [INFO ] Deduced a trap composed of 28 places in 246 ms of which 4 ms to minimize.
[2025-05-29 20:11:24] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 2 ms to minimize.
[2025-05-29 20:11:24] [INFO ] Deduced a trap composed of 27 places in 259 ms of which 4 ms to minimize.
[2025-05-29 20:11:24] [INFO ] Deduced a trap composed of 27 places in 252 ms of which 4 ms to minimize.
[2025-05-29 20:11:25] [INFO ] Deduced a trap composed of 28 places in 244 ms of which 3 ms to minimize.
[2025-05-29 20:11:25] [INFO ] Deduced a trap composed of 27 places in 232 ms of which 3 ms to minimize.
[2025-05-29 20:11:25] [INFO ] Deduced a trap composed of 26 places in 212 ms of which 3 ms to minimize.
[2025-05-29 20:11:25] [INFO ] Deduced a trap composed of 26 places in 208 ms of which 3 ms to minimize.
[2025-05-29 20:11:26] [INFO ] Deduced a trap composed of 26 places in 204 ms of which 3 ms to minimize.
[2025-05-29 20:11:26] [INFO ] Deduced a trap composed of 25 places in 197 ms of which 3 ms to minimize.
[2025-05-29 20:11:26] [INFO ] Deduced a trap composed of 25 places in 200 ms of which 4 ms to minimize.
[2025-05-29 20:11:26] [INFO ] Deduced a trap composed of 25 places in 197 ms of which 3 ms to minimize.
[2025-05-29 20:11:27] [INFO ] Deduced a trap composed of 24 places in 197 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/522 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
[2025-05-29 20:11:28] [INFO ] Deduced a trap composed of 25 places in 303 ms of which 4 ms to minimize.
[2025-05-29 20:11:28] [INFO ] Deduced a trap composed of 26 places in 287 ms of which 4 ms to minimize.
[2025-05-29 20:11:29] [INFO ] Deduced a trap composed of 26 places in 295 ms of which 4 ms to minimize.
[2025-05-29 20:11:29] [INFO ] Deduced a trap composed of 26 places in 272 ms of which 4 ms to minimize.
[2025-05-29 20:11:29] [INFO ] Deduced a trap composed of 34 places in 198 ms of which 4 ms to minimize.
[2025-05-29 20:11:30] [INFO ] Deduced a trap composed of 32 places in 289 ms of which 4 ms to minimize.
[2025-05-29 20:11:30] [INFO ] Deduced a trap composed of 29 places in 290 ms of which 4 ms to minimize.
[2025-05-29 20:11:30] [INFO ] Deduced a trap composed of 29 places in 319 ms of which 4 ms to minimize.
[2025-05-29 20:11:31] [INFO ] Deduced a trap composed of 34 places in 297 ms of which 4 ms to minimize.
[2025-05-29 20:11:31] [INFO ] Deduced a trap composed of 31 places in 256 ms of which 4 ms to minimize.
[2025-05-29 20:11:31] [INFO ] Deduced a trap composed of 34 places in 256 ms of which 3 ms to minimize.
[2025-05-29 20:11:31] [INFO ] Deduced a trap composed of 32 places in 243 ms of which 3 ms to minimize.
[2025-05-29 20:11:32] [INFO ] Deduced a trap composed of 25 places in 243 ms of which 3 ms to minimize.
[2025-05-29 20:11:32] [INFO ] Deduced a trap composed of 25 places in 231 ms of which 3 ms to minimize.
[2025-05-29 20:11:32] [INFO ] Deduced a trap composed of 28 places in 231 ms of which 3 ms to minimize.
[2025-05-29 20:11:32] [INFO ] Deduced a trap composed of 25 places in 212 ms of which 3 ms to minimize.
[2025-05-29 20:11:33] [INFO ] Deduced a trap composed of 38 places in 203 ms of which 3 ms to minimize.
[2025-05-29 20:11:33] [INFO ] Deduced a trap composed of 29 places in 173 ms of which 3 ms to minimize.
[2025-05-29 20:11:33] [INFO ] Deduced a trap composed of 25 places in 212 ms of which 3 ms to minimize.
[2025-05-29 20:11:33] [INFO ] Deduced a trap composed of 25 places in 231 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
[2025-05-29 20:11:35] [INFO ] Deduced a trap composed of 29 places in 207 ms of which 3 ms to minimize.
[2025-05-29 20:11:35] [INFO ] Deduced a trap composed of 31 places in 219 ms of which 3 ms to minimize.
[2025-05-29 20:11:36] [INFO ] Deduced a trap composed of 30 places in 206 ms of which 3 ms to minimize.
[2025-05-29 20:11:36] [INFO ] Deduced a trap composed of 28 places in 207 ms of which 3 ms to minimize.
[2025-05-29 20:11:36] [INFO ] Deduced a trap composed of 28 places in 204 ms of which 3 ms to minimize.
SMT process timed out in 60928ms, After SMT, problems are : Problem set: 0 solved, 1646 unsolved
Search for dead transitions found 0 dead transitions in 60944ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70002 ms. Remains : 523/523 places, 1666/1666 transitions.
[2025-05-29 20:11:36] [INFO ] Flatten gal took : 70 ms
[2025-05-29 20:11:36] [INFO ] Flatten gal took : 68 ms
[2025-05-29 20:11:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16343605544041522547.gal : 15 ms
[2025-05-29 20:11:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12887726028936012562.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/ReachabilityCardinality16343605544041522547.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12887726028936012562.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 ...330
RANDOM walk for 40000 steps (422 resets) in 474 ms. (84 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (17 resets) in 136 ms. (291 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (16 resets) in 111 ms. (357 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality12887726028936012562.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 147
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :147 after 150
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :150 after 151
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :151 after 155
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :155 after 156
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :156 after 157
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :157 after 163
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :163 after 174
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :174 after 199
Interrupted probabilistic random walk after 306379 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :0 out of 2
Probabilistic random walk after 306379 steps, saw 42919 distinct states, run finished after 3001 ms. (steps per millisecond=102 ) properties seen :0
[2025-05-29 20:11:39] [INFO ] Invariant cache hit.
[2025-05-29 20:11:39] [INFO ] State equation strengthened by 1604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 480/481 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :199 after 235
[2025-05-29 20:11:40] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 0 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 38/519 variables, 19/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/519 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/521 variables, 2/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-05-29 20:11:40] [INFO ] Deduced a trap composed of 26 places in 444 ms of which 5 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :235 after 319
[2025-05-29 20:11:41] [INFO ] Deduced a trap composed of 31 places in 428 ms of which 5 ms to minimize.
[2025-05-29 20:11:41] [INFO ] Deduced a trap composed of 31 places in 417 ms of which 5 ms to minimize.
[2025-05-29 20:11:41] [INFO ] Deduced a trap composed of 32 places in 411 ms of which 5 ms to minimize.
[2025-05-29 20:11:42] [INFO ] Deduced a trap composed of 25 places in 388 ms of which 5 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :319 after 452
[2025-05-29 20:11:42] [INFO ] Deduced a trap composed of 31 places in 338 ms of which 4 ms to minimize.
[2025-05-29 20:11:42] [INFO ] Deduced a trap composed of 29 places in 339 ms of which 4 ms to minimize.
[2025-05-29 20:11:43] [INFO ] Deduced a trap composed of 28 places in 337 ms of which 4 ms to minimize.
[2025-05-29 20:11:43] [INFO ] Deduced a trap composed of 26 places in 318 ms of which 4 ms to minimize.
[2025-05-29 20:11:43] [INFO ] Deduced a trap composed of 32 places in 293 ms of which 4 ms to minimize.
[2025-05-29 20:11:44] [INFO ] Deduced a trap composed of 32 places in 301 ms of which 3 ms to minimize.
[2025-05-29 20:11:44] [INFO ] Deduced a trap composed of 27 places in 275 ms of which 4 ms to minimize.
[2025-05-29 20:11:44] [INFO ] Deduced a trap composed of 33 places in 265 ms of which 4 ms to minimize.
[2025-05-29 20:11:45] [INFO ] Deduced a trap composed of 31 places in 251 ms of which 4 ms to minimize.
SMT process timed out in 5200ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 523 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1666/1666 transitions.
Applied a total of 0 rules in 28 ms. Remains 523 /523 variables (removed 0) and now considering 1666/1666 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 523/523 places, 1666/1666 transitions.
RANDOM walk for 40000 steps (417 resets) in 297 ms. (134 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (16 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 395570 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :0 out of 1
Probabilistic random walk after 395570 steps, saw 52644 distinct states, run finished after 3001 ms. (steps per millisecond=131 ) properties seen :0
[2025-05-29 20:11:48] [INFO ] Invariant cache hit.
[2025-05-29 20:11:48] [INFO ] State equation strengthened by 1604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 16384
At refinement iteration 1 (OVERLAPS) 480/481 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD size :452 after 7490
[2025-05-29 20:11:48] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 0 ms to minimize.
[2025-05-29 20:11:48] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 1 ms to minimize.
[2025-05-29 20:11:48] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 1 ms to minimize.
[2025-05-29 20:11:48] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 0 ms to minimize.
[2025-05-29 20:11:48] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 0 ms to minimize.
[2025-05-29 20:11:48] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 0 ms to minimize.
[2025-05-29 20:11:48] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
[2025-05-29 20:11:48] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
[2025-05-29 20:11:48] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
[2025-05-29 20:11:48] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
[2025-05-29 20:11:48] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 0 ms to minimize.
[2025-05-29 20:11:48] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2025-05-29 20:11:48] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2025-05-29 20:11:48] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2025-05-29 20:11:48] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2025-05-29 20:11:48] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 38/519 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/519 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/521 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/521 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1666/2187 variables, 521/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2187 variables, 1604/2163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2187 variables, 0/2163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/2189 variables, 2/2165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2189 variables, 0/2165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/2189 variables, 0/2165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2189/2189 variables, and 2165 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1662 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 523/523 constraints, ReadFeed: 1604/1604 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 480/481 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:11:50] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2025-05-29 20:11:50] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2025-05-29 20:11:50] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/481 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 38/519 variables, 19/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/519 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/521 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:11:50] [INFO ] Deduced a trap composed of 25 places in 428 ms of which 5 ms to minimize.
[2025-05-29 20:11:51] [INFO ] Deduced a trap composed of 26 places in 433 ms of which 5 ms to minimize.
[2025-05-29 20:11:51] [INFO ] Deduced a trap composed of 25 places in 429 ms of which 5 ms to minimize.
[2025-05-29 20:11:51] [INFO ] Deduced a trap composed of 26 places in 420 ms of which 5 ms to minimize.
[2025-05-29 20:11:52] [INFO ] Deduced a trap composed of 31 places in 491 ms of which 5 ms to minimize.
[2025-05-29 20:11:52] [INFO ] Deduced a trap composed of 25 places in 441 ms of which 5 ms to minimize.
[2025-05-29 20:11:53] [INFO ] Deduced a trap composed of 28 places in 441 ms of which 5 ms to minimize.
[2025-05-29 20:11:53] [INFO ] Deduced a trap composed of 24 places in 436 ms of which 5 ms to minimize.
[2025-05-29 20:11:54] [INFO ] Deduced a trap composed of 25 places in 434 ms of which 5 ms to minimize.
[2025-05-29 20:11:54] [INFO ] Deduced a trap composed of 32 places in 437 ms of which 5 ms to minimize.
[2025-05-29 20:11:55] [INFO ] Deduced a trap composed of 26 places in 442 ms of which 5 ms to minimize.
[2025-05-29 20:11:55] [INFO ] Deduced a trap composed of 26 places in 353 ms of which 5 ms to minimize.
[2025-05-29 20:11:55] [INFO ] Deduced a trap composed of 25 places in 458 ms of which 5 ms to minimize.
[2025-05-29 20:11:56] [INFO ] Deduced a trap composed of 32 places in 459 ms of which 5 ms to minimize.
[2025-05-29 20:11:56] [INFO ] Deduced a trap composed of 29 places in 449 ms of which 5 ms to minimize.
[2025-05-29 20:11:57] [INFO ] Deduced a trap composed of 25 places in 457 ms of which 5 ms to minimize.
[2025-05-29 20:11:57] [INFO ] Deduced a trap composed of 26 places in 439 ms of which 5 ms to minimize.
[2025-05-29 20:11:58] [INFO ] Deduced a trap composed of 26 places in 432 ms of which 5 ms to minimize.
[2025-05-29 20:11:58] [INFO ] Deduced a trap composed of 29 places in 427 ms of which 5 ms to minimize.
[2025-05-29 20:11:59] [INFO ] Deduced a trap composed of 25 places in 430 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/521 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:11:59] [INFO ] Deduced a trap composed of 31 places in 414 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/521 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/521 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1666/2187 variables, 521/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2187 variables, 1604/2187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2187 variables, 1/2188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2187 variables, 0/2188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/2189 variables, 2/2190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2189 variables, 0/2190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2189 variables, 0/2190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2189/2189 variables, and 2190 constraints, problems are : Problem set: 0 solved, 1 unsolved in 11007 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 523/523 constraints, ReadFeed: 1604/1604 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 40/40 constraints]
After SMT, in 12691ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 523 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1666/1666 transitions.
Applied a total of 0 rules in 34 ms. Remains 523 /523 variables (removed 0) and now considering 1666/1666 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 523/523 places, 1666/1666 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1666/1666 transitions.
Applied a total of 0 rules in 31 ms. Remains 523 /523 variables (removed 0) and now considering 1666/1666 (removed 0) transitions.
[2025-05-29 20:12:01] [INFO ] Invariant cache hit.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :7490 after 9206
[2025-05-29 20:12:01] [INFO ] Implicit Places using invariants in 737 ms returned []
[2025-05-29 20:12:01] [INFO ] Invariant cache hit.
[2025-05-29 20:12:02] [INFO ] State equation strengthened by 1604 read => feed constraints.
[2025-05-29 20:12:08] [INFO ] Implicit Places using invariants and state equation in 6561 ms returned []
Implicit Place search using SMT with State Equation took 7305 ms to find 0 implicit places.
[2025-05-29 20:12:08] [INFO ] Redundant transitions in 38 ms returned []
Running 1646 sub problems to find dead transitions.
[2025-05-29 20:12:08] [INFO ] Invariant cache hit.
[2025-05-29 20:12:08] [INFO ] State equation strengthened by 1604 read => feed constraints.
Detected timeout of ITS tools.
[2025-05-29 20:12:26] [INFO ] Flatten gal took : 35 ms
[2025-05-29 20:12:26] [INFO ] Applying decomposition
[2025-05-29 20:12:26] [INFO ] Flatten gal took : 36 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/graph2629345803710214180.txt' '-o' '/tmp/graph2629345803710214180.bin' '-w' '/tmp/graph2629345803710214180.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2629345803710214180.bin' '-l' '-1' '-v' '-w' '/tmp/graph2629345803710214180.weights' '-q' '0' '-e' '0.001'
[2025-05-29 20:12:27] [INFO ] Decomposing Gal with order
[2025-05-29 20:12:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 20:12:27] [INFO ] Removed a total of 1283 redundant transitions.
[2025-05-29 20:12:27] [INFO ] Flatten gal took : 83 ms
[2025-05-29 20:12:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 1396 labels/synchronizations in 84 ms.
[2025-05-29 20:12:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2510511133928961635.gal : 14 ms
[2025-05-29 20:12:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16725414934384978540.prop : 0 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/ReachabilityCardinality2510511133928961635.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16725414934384978540.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 ...308
Loading property file /tmp/ReachabilityCardinality16725414934384978540.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 96
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :96 after 96
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :96 after 96
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :96 after 96
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :96 after 96
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :96 after 96
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :96 after 96
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :96 after 96
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :96 after 4372
At refinement iteration 0 (INCLUDED_ONLY) 0/522 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :4372 after 240762
At refinement iteration 1 (INCLUDED_ONLY) 0/522 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
[2025-05-29 20:12:29] [INFO ] Deduced a trap composed of 25 places in 237 ms of which 3 ms to minimize.
[2025-05-29 20:12:29] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2025-05-29 20:12:29] [INFO ] Deduced a trap composed of 25 places in 188 ms of which 2 ms to minimize.
[2025-05-29 20:12:30] [INFO ] Deduced a trap composed of 26 places in 188 ms of which 2 ms to minimize.
[2025-05-29 20:12:30] [INFO ] Deduced a trap composed of 25 places in 186 ms of which 3 ms to minimize.
[2025-05-29 20:12:30] [INFO ] Deduced a trap composed of 25 places in 158 ms of which 3 ms to minimize.
[2025-05-29 20:12:30] [INFO ] Deduced a trap composed of 25 places in 163 ms of which 2 ms to minimize.
[2025-05-29 20:12:30] [INFO ] Deduced a trap composed of 28 places in 144 ms of which 3 ms to minimize.
[2025-05-29 20:12:31] [INFO ] Deduced a trap composed of 27 places in 178 ms of which 3 ms to minimize.
[2025-05-29 20:12:31] [INFO ] Deduced a trap composed of 26 places in 177 ms of which 3 ms to minimize.
[2025-05-29 20:12:31] [INFO ] Deduced a trap composed of 28 places in 199 ms of which 3 ms to minimize.
[2025-05-29 20:12:31] [INFO ] Deduced a trap composed of 25 places in 196 ms of which 2 ms to minimize.
[2025-05-29 20:12:31] [INFO ] Deduced a trap composed of 26 places in 180 ms of which 2 ms to minimize.
[2025-05-29 20:12:31] [INFO ] Deduced a trap composed of 27 places in 153 ms of which 2 ms to minimize.
[2025-05-29 20:12:32] [INFO ] Deduced a trap composed of 25 places in 174 ms of which 3 ms to minimize.
[2025-05-29 20:12:32] [INFO ] Deduced a trap composed of 25 places in 150 ms of which 3 ms to minimize.
[2025-05-29 20:12:32] [INFO ] Deduced a trap composed of 26 places in 136 ms of which 2 ms to minimize.
[2025-05-29 20:12:32] [INFO ] Deduced a trap composed of 28 places in 111 ms of which 2 ms to minimize.
[2025-05-29 20:12:32] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 2 ms to minimize.
[2025-05-29 20:12:32] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/522 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
[2025-05-29 20:12:33] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 1 ms to minimize.
[2025-05-29 20:12:33] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 2 ms to minimize.
[2025-05-29 20:12:33] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 2 ms to minimize.
[2025-05-29 20:12:33] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 2 ms to minimize.
[2025-05-29 20:12:33] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 2 ms to minimize.
[2025-05-29 20:12:34] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 2 ms to minimize.
[2025-05-29 20:12:34] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 2 ms to minimize.
[2025-05-29 20:12:34] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 2 ms to minimize.
[2025-05-29 20:12:34] [INFO ] Deduced a trap composed of 2 places in 335 ms of which 4 ms to minimize.
[2025-05-29 20:12:34] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 2 ms to minimize.
[2025-05-29 20:12:35] [INFO ] Deduced a trap composed of 27 places in 388 ms of which 5 ms to minimize.
[2025-05-29 20:12:35] [INFO ] Deduced a trap composed of 26 places in 387 ms of which 4 ms to minimize.
[2025-05-29 20:12:36] [INFO ] Deduced a trap composed of 27 places in 357 ms of which 4 ms to minimize.
[2025-05-29 20:12:36] [INFO ] Deduced a trap composed of 25 places in 212 ms of which 3 ms to minimize.
[2025-05-29 20:12:36] [INFO ] Deduced a trap composed of 28 places in 266 ms of which 4 ms to minimize.
[2025-05-29 20:12:36] [INFO ] Deduced a trap composed of 28 places in 262 ms of which 3 ms to minimize.
[2025-05-29 20:12:37] [INFO ] Deduced a trap composed of 27 places in 261 ms of which 4 ms to minimize.
[2025-05-29 20:12:37] [INFO ] Deduced a trap composed of 26 places in 260 ms of which 3 ms to minimize.
[2025-05-29 20:12:37] [INFO ] Deduced a trap composed of 27 places in 263 ms of which 3 ms to minimize.
[2025-05-29 20:12:37] [INFO ] Deduced a trap composed of 26 places in 260 ms of which 3 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :240762 after 1.50259e+07
At refinement iteration 3 (INCLUDED_ONLY) 0/522 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 522/2189 variables, and 62 constraints, problems are : Problem set: 0 solved, 1646 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/523 constraints, ReadFeed: 0/1604 constraints, PredecessorRefiner: 1646/1646 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1646 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/522 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/522 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/522 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
[2025-05-29 20:12:42] [INFO ] Deduced a trap composed of 31 places in 250 ms of which 3 ms to minimize.
[2025-05-29 20:12:42] [INFO ] Deduced a trap composed of 25 places in 225 ms of which 4 ms to minimize.
[2025-05-29 20:12:42] [INFO ] Deduced a trap composed of 28 places in 276 ms of which 5 ms to minimize.
[2025-05-29 20:12:43] [INFO ] Deduced a trap composed of 33 places in 368 ms of which 5 ms to minimize.
[2025-05-29 20:12:43] [INFO ] Deduced a trap composed of 25 places in 192 ms of which 3 ms to minimize.
[2025-05-29 20:12:43] [INFO ] Deduced a trap composed of 25 places in 302 ms of which 5 ms to minimize.
[2025-05-29 20:12:44] [INFO ] Deduced a trap composed of 32 places in 305 ms of which 5 ms to minimize.
[2025-05-29 20:12:44] [INFO ] Deduced a trap composed of 30 places in 301 ms of which 4 ms to minimize.
[2025-05-29 20:12:44] [INFO ] Deduced a trap composed of 29 places in 295 ms of which 4 ms to minimize.
[2025-05-29 20:12:44] [INFO ] Deduced a trap composed of 29 places in 293 ms of which 4 ms to minimize.
[2025-05-29 20:12:45] [INFO ] Deduced a trap composed of 30 places in 251 ms of which 4 ms to minimize.
[2025-05-29 20:12:45] [INFO ] Deduced a trap composed of 25 places in 253 ms of which 4 ms to minimize.
[2025-05-29 20:12:45] [INFO ] Deduced a trap composed of 30 places in 225 ms of which 4 ms to minimize.
[2025-05-29 20:12:45] [INFO ] Deduced a trap composed of 32 places in 223 ms of which 3 ms to minimize.
[2025-05-29 20:12:46] [INFO ] Deduced a trap composed of 31 places in 221 ms of which 3 ms to minimize.
[2025-05-29 20:12:46] [INFO ] Deduced a trap composed of 31 places in 218 ms of which 3 ms to minimize.
[2025-05-29 20:12:46] [INFO ] Deduced a trap composed of 31 places in 213 ms of which 3 ms to minimize.
[2025-05-29 20:12:46] [INFO ] Deduced a trap composed of 29 places in 187 ms of which 3 ms to minimize.
[2025-05-29 20:12:47] [INFO ] Deduced a trap composed of 29 places in 193 ms of which 3 ms to minimize.
[2025-05-29 20:12:47] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/522 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
[2025-05-29 20:12:48] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 1 ms to minimize.
[2025-05-29 20:12:48] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 2 ms to minimize.
[2025-05-29 20:12:48] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 2 ms to minimize.
[2025-05-29 20:12:48] [INFO ] Deduced a trap composed of 26 places in 176 ms of which 4 ms to minimize.
[2025-05-29 20:12:48] [INFO ] Deduced a trap composed of 27 places in 199 ms of which 3 ms to minimize.
[2025-05-29 20:12:48] [INFO ] Deduced a trap composed of 25 places in 194 ms of which 3 ms to minimize.
[2025-05-29 20:12:49] [INFO ] Deduced a trap composed of 29 places in 136 ms of which 3 ms to minimize.
[2025-05-29 20:12:49] [INFO ] Deduced a trap composed of 29 places in 171 ms of which 3 ms to minimize.
[2025-05-29 20:12:49] [INFO ] Deduced a trap composed of 29 places in 136 ms of which 3 ms to minimize.
[2025-05-29 20:12:49] [INFO ] Deduced a trap composed of 34 places in 134 ms of which 3 ms to minimize.
[2025-05-29 20:12:49] [INFO ] Deduced a trap composed of 30 places in 133 ms of which 3 ms to minimize.
[2025-05-29 20:12:49] [INFO ] Deduced a trap composed of 28 places in 116 ms of which 3 ms to minimize.
[2025-05-29 20:12:50] [INFO ] Deduced a trap composed of 28 places in 119 ms of which 2 ms to minimize.
[2025-05-29 20:12:50] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 3 ms to minimize.
[2025-05-29 20:12:50] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 2 ms to minimize.
[2025-05-29 20:12:50] [INFO ] Deduced a trap composed of 26 places in 416 ms of which 6 ms to minimize.
[2025-05-29 20:12:50] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2025-05-29 20:12:50] [INFO ] Deduced a trap composed of 29 places in 172 ms of which 3 ms to minimize.
[2025-05-29 20:12:51] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 3 ms to minimize.
[2025-05-29 20:12:51] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/522 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
[2025-05-29 20:12:52] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2025-05-29 20:12:52] [INFO ] Deduced a trap composed of 30 places in 240 ms of which 4 ms to minimize.
[2025-05-29 20:12:52] [INFO ] Deduced a trap composed of 25 places in 271 ms of which 4 ms to minimize.
[2025-05-29 20:12:53] [INFO ] Deduced a trap composed of 27 places in 243 ms of which 4 ms to minimize.
[2025-05-29 20:12:53] [INFO ] Deduced a trap composed of 24 places in 241 ms of which 3 ms to minimize.
[2025-05-29 20:12:53] [INFO ] Deduced a trap composed of 30 places in 271 ms of which 5 ms to minimize.
[2025-05-29 20:12:53] [INFO ] Deduced a trap composed of 25 places in 243 ms of which 4 ms to minimize.
[2025-05-29 20:12:54] [INFO ] Deduced a trap composed of 25 places in 274 ms of which 5 ms to minimize.
[2025-05-29 20:12:54] [INFO ] Deduced a trap composed of 25 places in 243 ms of which 3 ms to minimize.
[2025-05-29 20:12:54] [INFO ] Deduced a trap composed of 25 places in 260 ms of which 4 ms to minimize.
[2025-05-29 20:12:54] [INFO ] Deduced a trap composed of 31 places in 237 ms of which 4 ms to minimize.
[2025-05-29 20:12:55] [INFO ] Deduced a trap composed of 25 places in 234 ms of which 4 ms to minimize.
[2025-05-29 20:12:55] [INFO ] Deduced a trap composed of 25 places in 209 ms of which 4 ms to minimize.
[2025-05-29 20:12:55] [INFO ] Deduced a trap composed of 28 places in 259 ms of which 4 ms to minimize.
[2025-05-29 20:12:55] [INFO ] Deduced a trap composed of 28 places in 261 ms of which 4 ms to minimize.
[2025-05-29 20:12:56] [INFO ] Deduced a trap composed of 36 places in 252 ms of which 4 ms to minimize.
[2025-05-29 20:12:56] [INFO ] Deduced a trap composed of 30 places in 245 ms of which 3 ms to minimize.
[2025-05-29 20:12:56] [INFO ] Deduced a trap composed of 30 places in 247 ms of which 3 ms to minimize.
[2025-05-29 20:12:56] [INFO ] Deduced a trap composed of 25 places in 226 ms of which 3 ms to minimize.
[2025-05-29 20:12:57] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/522 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
[2025-05-29 20:12:58] [INFO ] Deduced a trap composed of 28 places in 195 ms of which 4 ms to minimize.
[2025-05-29 20:12:58] [INFO ] Deduced a trap composed of 26 places in 153 ms of which 3 ms to minimize.
[2025-05-29 20:12:58] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 2 ms to minimize.
[2025-05-29 20:12:58] [INFO ] Deduced a trap composed of 32 places in 165 ms of which 3 ms to minimize.
[2025-05-29 20:12:58] [INFO ] Deduced a trap composed of 31 places in 190 ms of which 3 ms to minimize.
[2025-05-29 20:12:59] [INFO ] Deduced a trap composed of 31 places in 188 ms of which 3 ms to minimize.
[2025-05-29 20:12:59] [INFO ] Deduced a trap composed of 30 places in 134 ms of which 3 ms to minimize.
[2025-05-29 20:12:59] [INFO ] Deduced a trap composed of 25 places in 191 ms of which 3 ms to minimize.
[2025-05-29 20:12:59] [INFO ] Deduced a trap composed of 33 places in 154 ms of which 3 ms to minimize.
[2025-05-29 20:12:59] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2025-05-29 20:12:59] [INFO ] Deduced a trap composed of 33 places in 285 ms of which 5 ms to minimize.
[2025-05-29 20:13:00] [INFO ] Deduced a trap composed of 31 places in 273 ms of which 4 ms to minimize.
[2025-05-29 20:13:00] [INFO ] Deduced a trap composed of 31 places in 276 ms of which 4 ms to minimize.
[2025-05-29 20:13:00] [INFO ] Deduced a trap composed of 39 places in 249 ms of which 4 ms to minimize.
[2025-05-29 20:13:01] [INFO ] Deduced a trap composed of 35 places in 249 ms of which 4 ms to minimize.
[2025-05-29 20:13:01] [INFO ] Deduced a trap composed of 35 places in 247 ms of which 4 ms to minimize.
[2025-05-29 20:13:01] [INFO ] Deduced a trap composed of 34 places in 251 ms of which 4 ms to minimize.
[2025-05-29 20:13:01] [INFO ] Deduced a trap composed of 33 places in 248 ms of which 4 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 8192
[2025-05-29 20:13:02] [INFO ] Deduced a trap composed of 31 places in 277 ms of which 4 ms to minimize.
SDD size :1.50259e+07 after 1.82453e+07
[2025-05-29 20:13:02] [INFO ] Deduced a trap composed of 35 places in 275 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
[2025-05-29 20:13:03] [INFO ] Deduced a trap composed of 25 places in 243 ms of which 4 ms to minimize.
[2025-05-29 20:13:03] [INFO ] Deduced a trap composed of 26 places in 243 ms of which 4 ms to minimize.
[2025-05-29 20:13:04] [INFO ] Deduced a trap composed of 25 places in 231 ms of which 4 ms to minimize.
[2025-05-29 20:13:04] [INFO ] Deduced a trap composed of 30 places in 164 ms of which 3 ms to minimize.
[2025-05-29 20:13:04] [INFO ] Deduced a trap composed of 29 places in 216 ms of which 4 ms to minimize.
[2025-05-29 20:13:04] [INFO ] Deduced a trap composed of 33 places in 245 ms of which 4 ms to minimize.
[2025-05-29 20:13:05] [INFO ] Deduced a trap composed of 27 places in 268 ms of which 4 ms to minimize.
[2025-05-29 20:13:05] [INFO ] Deduced a trap composed of 27 places in 195 ms of which 4 ms to minimize.
[2025-05-29 20:13:05] [INFO ] Deduced a trap composed of 37 places in 281 ms of which 4 ms to minimize.
[2025-05-29 20:13:05] [INFO ] Deduced a trap composed of 28 places in 175 ms of which 3 ms to minimize.
[2025-05-29 20:13:06] [INFO ] Deduced a trap composed of 28 places in 240 ms of which 4 ms to minimize.
[2025-05-29 20:13:06] [INFO ] Deduced a trap composed of 32 places in 192 ms of which 4 ms to minimize.
[2025-05-29 20:13:06] [INFO ] Deduced a trap composed of 30 places in 216 ms of which 3 ms to minimize.
[2025-05-29 20:13:06] [INFO ] Deduced a trap composed of 29 places in 247 ms of which 4 ms to minimize.
[2025-05-29 20:13:07] [INFO ] Deduced a trap composed of 25 places in 223 ms of which 4 ms to minimize.
[2025-05-29 20:13:07] [INFO ] Deduced a trap composed of 25 places in 245 ms of which 4 ms to minimize.
[2025-05-29 20:13:07] [INFO ] Deduced a trap composed of 26 places in 244 ms of which 4 ms to minimize.
[2025-05-29 20:13:08] [INFO ] Deduced a trap composed of 37 places in 285 ms of which 4 ms to minimize.
[2025-05-29 20:13:08] [INFO ] Deduced a trap composed of 25 places in 297 ms of which 5 ms to minimize.
[2025-05-29 20:13:08] [INFO ] Deduced a trap composed of 25 places in 277 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/522 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 522/2189 variables, and 162 constraints, problems are : Problem set: 0 solved, 1646 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/523 constraints, ReadFeed: 0/1604 constraints, PredecessorRefiner: 0/1646 constraints, Known Traps: 140/140 constraints]
After SMT, in 60851ms problems are : Problem set: 0 solved, 1646 unsolved
Search for dead transitions found 0 dead transitions in 60869ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68255 ms. Remains : 523/523 places, 1666/1666 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1543 edges and 523 vertex of which 439 / 523 are part of one of the 2 SCC in 0 ms
Free SCC test removed 437 places
Drop transitions (Empty/Sink Transition effects.) removed 1165 transitions
Ensure Unique test removed 412 transitions
Reduce isomorphic transitions removed 1577 transitions.
Graph (complete) has 211 edges and 86 vertex of which 25 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.0 ms
Discarding 61 places :
Also discarding 19 output transitions
Drop transitions (Output transitions of discarded places.) removed 19 transitions
Drop transitions (Empty/Sink Transition effects.) removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 25 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 24 transition count 28
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 63 place count 6 transition count 10
Iterating global reduction 2 with 18 rules applied. Total rules applied 81 place count 6 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 83 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 86 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 4 transition count 5
Applied a total of 87 rules in 11 ms. Remains 4 /523 variables (removed 519) and now considering 5/1666 (removed 1661) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 4 cols
[2025-05-29 20:13:09] [INFO ] Computed 0 invariants in 1 ms
[2025-05-29 20:13:09] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-29 20:13:09] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-29 20:13:09] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-29 20:13:09] [INFO ] After 25ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-05-29 20:13:09] [INFO ] Flatten gal took : 0 ms
[2025-05-29 20:13:09] [INFO ] Flatten gal took : 0 ms
[2025-05-29 20:13:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6035028829585754407.gal : 1 ms
[2025-05-29 20:13:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11816150488329588840.prop : 0 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/ReachabilityCardinality6035028829585754407.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11816150488329588840.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 ...329
Loading property file /tmp/ReachabilityCardinality11816150488329588840.prop.
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 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,6,0.002238,3520,2,7,6,33,6,0,21,18,0
Total reachable state count : 6

Verifying 1 reachability properties.
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,0.002704,3896,2,5,6,33,7,0,24,18,0
Over-approximation ignoring read arcs solved 0 properties in 70 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[20]
Ending property specific reduction for CANInsertWithFailure-PT-020-UpperBounds-09 in 179406 ms.
Starting property specific reduction for CANInsertWithFailure-PT-020-UpperBounds-10
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[20]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[20]
// Phase 1: matrix 1674 rows 531 cols
[2025-05-29 20:13:09] [INFO ] Computed 22 invariants in 18 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[20]
RANDOM walk for 10000 steps (106 resets) in 52 ms. (188 steps per ms)
BEST_FIRST walk for 10001 steps (4 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[20]
[2025-05-29 20:13:09] [INFO ] Invariant cache hit.
[2025-05-29 20:13:09] [INFO ] [Real]Absence check using 20 positive place invariants in 13 ms returned sat
[2025-05-29 20:13:09] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2025-05-29 20:13:09] [INFO ] [Real]Absence check using state equation in 442 ms returned sat
[2025-05-29 20:13:10] [INFO ] State equation strengthened by 1582 read => feed constraints.
[2025-05-29 20:13:10] [INFO ] [Real]Added 1582 Read/Feed constraints in 177 ms returned sat
[2025-05-29 20:13:10] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:13:10] [INFO ] [Nat]Absence check using 20 positive place invariants in 27 ms returned sat
[2025-05-29 20:13:10] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 18 ms returned sat
[2025-05-29 20:13:11] [INFO ] [Nat]Absence check using state equation in 573 ms returned sat
[2025-05-29 20:13:11] [INFO ] [Nat]Added 1582 Read/Feed constraints in 357 ms returned sat
[2025-05-29 20:13:11] [INFO ] Computed and/alt/rep : 1160/3017/1160 causal constraints (skipped 494 transitions) in 310 ms.
[2025-05-29 20:13:12] [INFO ] Added : 8 causal constraints over 2 iterations in 823 ms. Result :sat
Minimization took 563 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[20]
Support contains 1 out of 531 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 531/531 places, 1674/1674 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 523 transition count 1666
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 523 transition count 1665
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 18 place count 522 transition count 1665
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 25 place count 522 transition count 1665
Applied a total of 25 rules in 98 ms. Remains 522 /531 variables (removed 9) and now considering 1665/1674 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 522/531 places, 1665/1674 transitions.
// Phase 1: matrix 1665 rows 522 cols
[2025-05-29 20:13:12] [INFO ] Computed 22 invariants in 14 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[20]
RANDOM walk for 1000000 steps (10516 resets) in 5053 ms. (197 steps per ms)
BEST_FIRST walk for 1000001 steps (475 resets) in 942 ms. (1060 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[20]
[2025-05-29 20:13:18] [INFO ] Invariant cache hit.
[2025-05-29 20:13:19] [INFO ] [Real]Absence check using 20 positive place invariants in 13 ms returned sat
[2025-05-29 20:13:19] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2025-05-29 20:13:19] [INFO ] [Real]Absence check using state equation in 441 ms returned sat
[2025-05-29 20:13:19] [INFO ] State equation strengthened by 1605 read => feed constraints.
[2025-05-29 20:13:19] [INFO ] [Real]Added 1605 Read/Feed constraints in 175 ms returned sat
[2025-05-29 20:13:19] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:13:19] [INFO ] [Nat]Absence check using 20 positive place invariants in 15 ms returned sat
[2025-05-29 20:13:19] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2025-05-29 20:13:20] [INFO ] [Nat]Absence check using state equation in 548 ms returned sat
[2025-05-29 20:13:20] [INFO ] [Nat]Added 1605 Read/Feed constraints in 228 ms returned sat
[2025-05-29 20:13:20] [INFO ] Computed and/alt/rep : 1151/3051/1151 causal constraints (skipped 494 transitions) in 164 ms.
[2025-05-29 20:13:21] [INFO ] Added : 6 causal constraints over 2 iterations in 528 ms. Result :sat
Minimization took 3468 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[20]
Support contains 1 out of 522 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 522/522 places, 1665/1665 transitions.
Applied a total of 0 rules in 27 ms. Remains 522 /522 variables (removed 0) and now considering 1665/1665 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 522/522 places, 1665/1665 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 522/522 places, 1665/1665 transitions.
Applied a total of 0 rules in 26 ms. Remains 522 /522 variables (removed 0) and now considering 1665/1665 (removed 0) transitions.
[2025-05-29 20:13:24] [INFO ] Invariant cache hit.
[2025-05-29 20:13:25] [INFO ] Implicit Places using invariants in 755 ms returned []
[2025-05-29 20:13:25] [INFO ] Invariant cache hit.
[2025-05-29 20:13:26] [INFO ] State equation strengthened by 1605 read => feed constraints.
[2025-05-29 20:13:32] [INFO ] Implicit Places using invariants and state equation in 7114 ms returned []
Implicit Place search using SMT with State Equation took 7870 ms to find 0 implicit places.
[2025-05-29 20:13:32] [INFO ] Redundant transitions in 36 ms returned []
Running 1645 sub problems to find dead transitions.
[2025-05-29 20:13:32] [INFO ] Invariant cache hit.
[2025-05-29 20:13:32] [INFO ] State equation strengthened by 1605 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/521 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/521 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
[2025-05-29 20:13:57] [INFO ] Deduced a trap composed of 31 places in 257 ms of which 3 ms to minimize.
[2025-05-29 20:13:58] [INFO ] Deduced a trap composed of 27 places in 356 ms of which 5 ms to minimize.
[2025-05-29 20:13:58] [INFO ] Deduced a trap composed of 25 places in 464 ms of which 6 ms to minimize.
[2025-05-29 20:13:59] [INFO ] Deduced a trap composed of 26 places in 431 ms of which 6 ms to minimize.
[2025-05-29 20:13:59] [INFO ] Deduced a trap composed of 26 places in 429 ms of which 5 ms to minimize.
[2025-05-29 20:13:59] [INFO ] Deduced a trap composed of 26 places in 394 ms of which 6 ms to minimize.
[2025-05-29 20:14:00] [INFO ] Deduced a trap composed of 24 places in 400 ms of which 5 ms to minimize.
[2025-05-29 20:14:00] [INFO ] Deduced a trap composed of 25 places in 309 ms of which 4 ms to minimize.
[2025-05-29 20:14:00] [INFO ] Deduced a trap composed of 26 places in 239 ms of which 2 ms to minimize.
[2025-05-29 20:14:01] [INFO ] Deduced a trap composed of 27 places in 177 ms of which 3 ms to minimize.
[2025-05-29 20:14:01] [INFO ] Deduced a trap composed of 25 places in 175 ms of which 3 ms to minimize.
[2025-05-29 20:14:01] [INFO ] Deduced a trap composed of 26 places in 240 ms of which 4 ms to minimize.
[2025-05-29 20:14:01] [INFO ] Deduced a trap composed of 27 places in 282 ms of which 4 ms to minimize.
[2025-05-29 20:14:02] [INFO ] Deduced a trap composed of 25 places in 266 ms of which 4 ms to minimize.
[2025-05-29 20:14:02] [INFO ] Deduced a trap composed of 26 places in 269 ms of which 4 ms to minimize.
[2025-05-29 20:14:02] [INFO ] Deduced a trap composed of 26 places in 259 ms of which 3 ms to minimize.
[2025-05-29 20:14:03] [INFO ] Deduced a trap composed of 25 places in 235 ms of which 3 ms to minimize.
[2025-05-29 20:14:03] [INFO ] Deduced a trap composed of 26 places in 208 ms of which 3 ms to minimize.
[2025-05-29 20:14:03] [INFO ] Deduced a trap composed of 25 places in 179 ms of which 3 ms to minimize.
[2025-05-29 20:14:03] [INFO ] Deduced a trap composed of 26 places in 141 ms of which 3 ms to minimize.
SMT process timed out in 30778ms, After SMT, problems are : Problem set: 0 solved, 1645 unsolved
Search for dead transitions found 0 dead transitions in 30795ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38747 ms. Remains : 522/522 places, 1665/1665 transitions.
[2025-05-29 20:14:03] [INFO ] Flatten gal took : 114 ms
[2025-05-29 20:14:03] [INFO ] Flatten gal took : 97 ms
[2025-05-29 20:14:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2283657063557771110.gal : 25 ms
[2025-05-29 20:14:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18031990106794572057.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/ReachabilityCardinality2283657063557771110.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18031990106794572057.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 ...329
RANDOM walk for 40000 steps (422 resets) in 1799 ms. (22 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (18 resets) in 120 ms. (330 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (17 resets) in 126 ms. (314 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality18031990106794572057.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 147
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :147 after 150
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :150 after 151
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :151 after 155
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :155 after 156
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :156 after 157
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :157 after 163
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :163 after 174
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :174 after 199
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :199 after 235
Interrupted probabilistic random walk after 296225 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :0 out of 2
Probabilistic random walk after 296225 steps, saw 41816 distinct states, run finished after 3001 ms. (steps per millisecond=98 ) properties seen :0
[2025-05-29 20:14:07] [INFO ] Invariant cache hit.
[2025-05-29 20:14:07] [INFO ] State equation strengthened by 1605 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 479/480 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-29 20:14:07] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/480 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/480 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 38/518 variables, 19/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/518 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/520 variables, 2/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :235 after 319
[2025-05-29 20:14:07] [INFO ] Deduced a trap composed of 25 places in 505 ms of which 5 ms to minimize.
[2025-05-29 20:14:08] [INFO ] Deduced a trap composed of 25 places in 493 ms of which 5 ms to minimize.
[2025-05-29 20:14:08] [INFO ] Deduced a trap composed of 25 places in 454 ms of which 4 ms to minimize.
[2025-05-29 20:14:09] [INFO ] Deduced a trap composed of 25 places in 396 ms of which 4 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :319 after 452
[2025-05-29 20:14:09] [INFO ] Deduced a trap composed of 25 places in 412 ms of which 5 ms to minimize.
[2025-05-29 20:14:10] [INFO ] Deduced a trap composed of 30 places in 335 ms of which 4 ms to minimize.
[2025-05-29 20:14:10] [INFO ] Deduced a trap composed of 25 places in 322 ms of which 4 ms to minimize.
[2025-05-29 20:14:10] [INFO ] Deduced a trap composed of 25 places in 319 ms of which 3 ms to minimize.
[2025-05-29 20:14:11] [INFO ] Deduced a trap composed of 28 places in 318 ms of which 4 ms to minimize.
[2025-05-29 20:14:11] [INFO ] Deduced a trap composed of 25 places in 301 ms of which 3 ms to minimize.
[2025-05-29 20:14:11] [INFO ] Deduced a trap composed of 30 places in 242 ms of which 3 ms to minimize.
[2025-05-29 20:14:11] [INFO ] Deduced a trap composed of 29 places in 237 ms of which 3 ms to minimize.
[2025-05-29 20:14:12] [INFO ] Deduced a trap composed of 25 places in 221 ms of which 2 ms to minimize.
[2025-05-29 20:14:12] [INFO ] Deduced a trap composed of 25 places in 191 ms of which 3 ms to minimize.
SMT process timed out in 5200ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 522 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 522/522 places, 1665/1665 transitions.
Applied a total of 0 rules in 29 ms. Remains 522 /522 variables (removed 0) and now considering 1665/1665 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 522/522 places, 1665/1665 transitions.
RANDOM walk for 40000 steps (419 resets) in 299 ms. (133 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (16 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :452 after 7476
Interrupted probabilistic random walk after 348845 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :0 out of 1
Probabilistic random walk after 348845 steps, saw 47561 distinct states, run finished after 3001 ms. (steps per millisecond=116 ) properties seen :0
[2025-05-29 20:14:15] [INFO ] Invariant cache hit.
[2025-05-29 20:14:15] [INFO ] State equation strengthened by 1605 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 479/480 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:14:15] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
[2025-05-29 20:14:15] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 1 ms to minimize.
[2025-05-29 20:14:15] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 0 ms to minimize.
[2025-05-29 20:14:15] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 0 ms to minimize.
[2025-05-29 20:14:15] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
[2025-05-29 20:14:15] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
[2025-05-29 20:14:15] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
[2025-05-29 20:14:16] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
[2025-05-29 20:14:16] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
[2025-05-29 20:14:16] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 1 ms to minimize.
[2025-05-29 20:14:16] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
[2025-05-29 20:14:16] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2025-05-29 20:14:16] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2025-05-29 20:14:16] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 0 ms to minimize.
[2025-05-29 20:14:16] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2025-05-29 20:14:16] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/480 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/480 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 38/518 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/518 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/520 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1665/2185 variables, 520/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2185 variables, 1605/2163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2185 variables, 0/2163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/2187 variables, 2/2165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2187 variables, 0/2165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/2187 variables, 0/2165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2187/2187 variables, and 2165 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1546 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 522/522 constraints, ReadFeed: 1605/1605 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 479/480 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/480 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:14:17] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2025-05-29 20:14:17] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
[2025-05-29 20:14:17] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/480 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 38/518 variables, 19/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/518 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/520 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:14:17] [INFO ] Deduced a trap composed of 26 places in 433 ms of which 5 ms to minimize.
[2025-05-29 20:14:18] [INFO ] Deduced a trap composed of 25 places in 435 ms of which 5 ms to minimize.
[2025-05-29 20:14:18] [INFO ] Deduced a trap composed of 28 places in 439 ms of which 5 ms to minimize.
[2025-05-29 20:14:19] [INFO ] Deduced a trap composed of 25 places in 444 ms of which 5 ms to minimize.
[2025-05-29 20:14:19] [INFO ] Deduced a trap composed of 33 places in 450 ms of which 5 ms to minimize.
[2025-05-29 20:14:20] [INFO ] Deduced a trap composed of 25 places in 428 ms of which 5 ms to minimize.
[2025-05-29 20:14:20] [INFO ] Deduced a trap composed of 25 places in 428 ms of which 6 ms to minimize.
[2025-05-29 20:14:20] [INFO ] Deduced a trap composed of 30 places in 428 ms of which 5 ms to minimize.
[2025-05-29 20:14:21] [INFO ] Deduced a trap composed of 26 places in 417 ms of which 5 ms to minimize.
[2025-05-29 20:14:21] [INFO ] Deduced a trap composed of 31 places in 441 ms of which 6 ms to minimize.
[2025-05-29 20:14:22] [INFO ] Deduced a trap composed of 33 places in 438 ms of which 5 ms to minimize.
[2025-05-29 20:14:22] [INFO ] Deduced a trap composed of 28 places in 457 ms of which 5 ms to minimize.
[2025-05-29 20:14:23] [INFO ] Deduced a trap composed of 26 places in 470 ms of which 5 ms to minimize.
[2025-05-29 20:14:23] [INFO ] Deduced a trap composed of 25 places in 451 ms of which 5 ms to minimize.
[2025-05-29 20:14:24] [INFO ] Deduced a trap composed of 26 places in 441 ms of which 5 ms to minimize.
[2025-05-29 20:14:24] [INFO ] Deduced a trap composed of 25 places in 435 ms of which 5 ms to minimize.
[2025-05-29 20:14:25] [INFO ] Deduced a trap composed of 31 places in 433 ms of which 4 ms to minimize.
[2025-05-29 20:14:25] [INFO ] Deduced a trap composed of 32 places in 403 ms of which 5 ms to minimize.
[2025-05-29 20:14:25] [INFO ] Deduced a trap composed of 29 places in 429 ms of which 5 ms to minimize.
[2025-05-29 20:14:26] [INFO ] Deduced a trap composed of 25 places in 431 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:14:26] [INFO ] Deduced a trap composed of 25 places in 396 ms of which 4 ms to minimize.
[2025-05-29 20:14:26] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2025-05-29 20:14:26] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/520 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/520 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1665/2185 variables, 520/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :7476 after 9192
At refinement iteration 12 (INCLUDED_ONLY) 0/2185 variables, 1605/2189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2185 variables, 1/2190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2185 variables, 0/2190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/2187 variables, 2/2192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2187 variables, 0/2192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2187 variables, 0/2192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2187/2187 variables, and 2192 constraints, problems are : Problem set: 0 solved, 1 unsolved in 11239 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 522/522 constraints, ReadFeed: 1605/1605 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 42/42 constraints]
After SMT, in 12821ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 1 out of 522 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 522/522 places, 1665/1665 transitions.
Applied a total of 0 rules in 30 ms. Remains 522 /522 variables (removed 0) and now considering 1665/1665 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 522/522 places, 1665/1665 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 522/522 places, 1665/1665 transitions.
Applied a total of 0 rules in 33 ms. Remains 522 /522 variables (removed 0) and now considering 1665/1665 (removed 0) transitions.
[2025-05-29 20:14:28] [INFO ] Invariant cache hit.
[2025-05-29 20:14:29] [INFO ] Implicit Places using invariants in 583 ms returned []
[2025-05-29 20:14:29] [INFO ] Invariant cache hit.
[2025-05-29 20:14:29] [INFO ] State equation strengthened by 1605 read => feed constraints.
[2025-05-29 20:14:36] [INFO ] Implicit Places using invariants and state equation in 7189 ms returned []
Implicit Place search using SMT with State Equation took 7782 ms to find 0 implicit places.
[2025-05-29 20:14:36] [INFO ] Redundant transitions in 38 ms returned []
Running 1645 sub problems to find dead transitions.
[2025-05-29 20:14:36] [INFO ] Invariant cache hit.
[2025-05-29 20:14:36] [INFO ] State equation strengthened by 1605 read => feed constraints.
Detected timeout of ITS tools.
[2025-05-29 20:14:54] [INFO ] Flatten gal took : 33 ms
[2025-05-29 20:14:54] [INFO ] Applying decomposition
[2025-05-29 20:14:54] [INFO ] Flatten gal took : 33 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/graph13291795630013660272.txt' '-o' '/tmp/graph13291795630013660272.bin' '-w' '/tmp/graph13291795630013660272.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13291795630013660272.bin' '-l' '-1' '-v' '-w' '/tmp/graph13291795630013660272.weights' '-q' '0' '-e' '0.001'
[2025-05-29 20:14:54] [INFO ] Decomposing Gal with order
[2025-05-29 20:14:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 20:14:54] [INFO ] Removed a total of 1286 redundant transitions.
[2025-05-29 20:14:54] [INFO ] Flatten gal took : 76 ms
[2025-05-29 20:14:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 1432 labels/synchronizations in 27 ms.
[2025-05-29 20:14:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6198402443427145558.gal : 13 ms
[2025-05-29 20:14:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12118298897275552173.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/ReachabilityCardinality6198402443427145558.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12118298897275552173.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 ...308
Loading property file /tmp/ReachabilityCardinality12118298897275552173.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 883
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :883 after 883
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :883 after 883
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :883 after 883
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :883 after 883
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :883 after 883
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :883 after 883
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :883 after 883
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :883 after 3083
At refinement iteration 0 (INCLUDED_ONLY) 0/521 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3083 after 172997
At refinement iteration 1 (INCLUDED_ONLY) 0/521 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
[2025-05-29 20:14:56] [INFO ] Deduced a trap composed of 31 places in 253 ms of which 3 ms to minimize.
[2025-05-29 20:14:57] [INFO ] Deduced a trap composed of 27 places in 270 ms of which 3 ms to minimize.
[2025-05-29 20:14:57] [INFO ] Deduced a trap composed of 25 places in 286 ms of which 3 ms to minimize.
[2025-05-29 20:14:57] [INFO ] Deduced a trap composed of 26 places in 262 ms of which 4 ms to minimize.
[2025-05-29 20:14:58] [INFO ] Deduced a trap composed of 26 places in 281 ms of which 4 ms to minimize.
[2025-05-29 20:14:58] [INFO ] Deduced a trap composed of 26 places in 274 ms of which 3 ms to minimize.
[2025-05-29 20:14:58] [INFO ] Deduced a trap composed of 24 places in 280 ms of which 3 ms to minimize.
[2025-05-29 20:14:58] [INFO ] Deduced a trap composed of 25 places in 249 ms of which 3 ms to minimize.
[2025-05-29 20:14:59] [INFO ] Deduced a trap composed of 26 places in 226 ms of which 3 ms to minimize.
[2025-05-29 20:14:59] [INFO ] Deduced a trap composed of 27 places in 214 ms of which 2 ms to minimize.
[2025-05-29 20:14:59] [INFO ] Deduced a trap composed of 25 places in 210 ms of which 3 ms to minimize.
[2025-05-29 20:14:59] [INFO ] Deduced a trap composed of 26 places in 182 ms of which 2 ms to minimize.
[2025-05-29 20:15:00] [INFO ] Deduced a trap composed of 27 places in 201 ms of which 3 ms to minimize.
[2025-05-29 20:15:00] [INFO ] Deduced a trap composed of 25 places in 193 ms of which 2 ms to minimize.
[2025-05-29 20:15:00] [INFO ] Deduced a trap composed of 26 places in 203 ms of which 3 ms to minimize.
[2025-05-29 20:15:00] [INFO ] Deduced a trap composed of 26 places in 178 ms of which 3 ms to minimize.
[2025-05-29 20:15:00] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 2 ms to minimize.
[2025-05-29 20:15:00] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 2 ms to minimize.
[2025-05-29 20:15:01] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 2 ms to minimize.
[2025-05-29 20:15:01] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/521 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
[2025-05-29 20:15:02] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 2 ms to minimize.
[2025-05-29 20:15:02] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 2 ms to minimize.
[2025-05-29 20:15:02] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 2 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :172997 after 8.44528e+06
[2025-05-29 20:15:02] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 2 ms to minimize.
[2025-05-29 20:15:02] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 2 ms to minimize.
[2025-05-29 20:15:02] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 2 ms to minimize.
[2025-05-29 20:15:02] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 2 ms to minimize.
[2025-05-29 20:15:02] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 1 ms to minimize.
[2025-05-29 20:15:03] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 2 ms to minimize.
[2025-05-29 20:15:03] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 2 ms to minimize.
[2025-05-29 20:15:03] [INFO ] Deduced a trap composed of 2 places in 479 ms of which 5 ms to minimize.
[2025-05-29 20:15:04] [INFO ] Deduced a trap composed of 26 places in 452 ms of which 5 ms to minimize.
[2025-05-29 20:15:04] [INFO ] Deduced a trap composed of 26 places in 396 ms of which 4 ms to minimize.
[2025-05-29 20:15:04] [INFO ] Deduced a trap composed of 26 places in 350 ms of which 4 ms to minimize.
[2025-05-29 20:15:05] [INFO ] Deduced a trap composed of 34 places in 358 ms of which 4 ms to minimize.
[2025-05-29 20:15:05] [INFO ] Deduced a trap composed of 30 places in 306 ms of which 4 ms to minimize.
[2025-05-29 20:15:05] [INFO ] Deduced a trap composed of 27 places in 309 ms of which 4 ms to minimize.
[2025-05-29 20:15:06] [INFO ] Deduced a trap composed of 30 places in 279 ms of which 4 ms to minimize.
[2025-05-29 20:15:06] [INFO ] Deduced a trap composed of 30 places in 264 ms of which 3 ms to minimize.
[2025-05-29 20:15:06] [INFO ] Deduced a trap composed of 26 places in 273 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/521 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 521/2187 variables, and 62 constraints, problems are : Problem set: 0 solved, 1645 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/522 constraints, ReadFeed: 0/1605 constraints, PredecessorRefiner: 1645/1645 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1645 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/521 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/521 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/521 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
[2025-05-29 20:15:10] [INFO ] Deduced a trap composed of 26 places in 354 ms of which 4 ms to minimize.
[2025-05-29 20:15:10] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2025-05-29 20:15:10] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2025-05-29 20:15:10] [INFO ] Deduced a trap composed of 27 places in 284 ms of which 4 ms to minimize.
[2025-05-29 20:15:10] [INFO ] Deduced a trap composed of 28 places in 265 ms of which 4 ms to minimize.
[2025-05-29 20:15:11] [INFO ] Deduced a trap composed of 31 places in 314 ms of which 4 ms to minimize.
[2025-05-29 20:15:11] [INFO ] Deduced a trap composed of 30 places in 325 ms of which 4 ms to minimize.
[2025-05-29 20:15:11] [INFO ] Deduced a trap composed of 29 places in 322 ms of which 4 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :8.44528e+06 after 1.13939e+07
[2025-05-29 20:15:12] [INFO ] Deduced a trap composed of 40 places in 306 ms of which 3 ms to minimize.
[2025-05-29 20:15:12] [INFO ] Deduced a trap composed of 32 places in 284 ms of which 4 ms to minimize.
[2025-05-29 20:15:12] [INFO ] Deduced a trap composed of 29 places in 309 ms of which 3 ms to minimize.
[2025-05-29 20:15:13] [INFO ] Deduced a trap composed of 31 places in 287 ms of which 3 ms to minimize.
[2025-05-29 20:15:13] [INFO ] Deduced a trap composed of 31 places in 268 ms of which 4 ms to minimize.
[2025-05-29 20:15:13] [INFO ] Deduced a trap composed of 31 places in 250 ms of which 3 ms to minimize.
[2025-05-29 20:15:13] [INFO ] Deduced a trap composed of 28 places in 241 ms of which 2 ms to minimize.
[2025-05-29 20:15:14] [INFO ] Deduced a trap composed of 28 places in 238 ms of which 3 ms to minimize.
[2025-05-29 20:15:14] [INFO ] Deduced a trap composed of 27 places in 230 ms of which 3 ms to minimize.
[2025-05-29 20:15:14] [INFO ] Deduced a trap composed of 29 places in 250 ms of which 3 ms to minimize.
[2025-05-29 20:15:14] [INFO ] Deduced a trap composed of 35 places in 224 ms of which 3 ms to minimize.
[2025-05-29 20:15:15] [INFO ] Deduced a trap composed of 35 places in 225 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/521 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
[2025-05-29 20:15:16] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 2 ms to minimize.
[2025-05-29 20:15:16] [INFO ] Deduced a trap composed of 31 places in 427 ms of which 4 ms to minimize.
[2025-05-29 20:15:16] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2025-05-29 20:15:16] [INFO ] Deduced a trap composed of 26 places in 313 ms of which 4 ms to minimize.
[2025-05-29 20:15:17] [INFO ] Deduced a trap composed of 25 places in 309 ms of which 3 ms to minimize.
[2025-05-29 20:15:17] [INFO ] Deduced a trap composed of 27 places in 326 ms of which 4 ms to minimize.
[2025-05-29 20:15:18] [INFO ] Deduced a trap composed of 33 places in 335 ms of which 3 ms to minimize.
[2025-05-29 20:15:18] [INFO ] Deduced a trap composed of 25 places in 234 ms of which 4 ms to minimize.
[2025-05-29 20:15:18] [INFO ] Deduced a trap composed of 27 places in 335 ms of which 3 ms to minimize.
[2025-05-29 20:15:18] [INFO ] Deduced a trap composed of 33 places in 338 ms of which 3 ms to minimize.
[2025-05-29 20:15:19] [INFO ] Deduced a trap composed of 32 places in 300 ms of which 4 ms to minimize.
[2025-05-29 20:15:19] [INFO ] Deduced a trap composed of 33 places in 298 ms of which 4 ms to minimize.
[2025-05-29 20:15:19] [INFO ] Deduced a trap composed of 32 places in 301 ms of which 3 ms to minimize.
[2025-05-29 20:15:20] [INFO ] Deduced a trap composed of 33 places in 296 ms of which 3 ms to minimize.
[2025-05-29 20:15:20] [INFO ] Deduced a trap composed of 33 places in 297 ms of which 3 ms to minimize.
[2025-05-29 20:15:20] [INFO ] Deduced a trap composed of 33 places in 302 ms of which 4 ms to minimize.
[2025-05-29 20:15:21] [INFO ] Deduced a trap composed of 33 places in 369 ms of which 4 ms to minimize.
[2025-05-29 20:15:21] [INFO ] Deduced a trap composed of 33 places in 303 ms of which 3 ms to minimize.
[2025-05-29 20:15:21] [INFO ] Deduced a trap composed of 29 places in 282 ms of which 3 ms to minimize.
[2025-05-29 20:15:22] [INFO ] Deduced a trap composed of 34 places in 285 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/521 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
[2025-05-29 20:15:23] [INFO ] Deduced a trap composed of 27 places in 211 ms of which 3 ms to minimize.
[2025-05-29 20:15:23] [INFO ] Deduced a trap composed of 26 places in 213 ms of which 2 ms to minimize.
[2025-05-29 20:15:23] [INFO ] Deduced a trap composed of 27 places in 234 ms of which 2 ms to minimize.
[2025-05-29 20:15:23] [INFO ] Deduced a trap composed of 25 places in 226 ms of which 3 ms to minimize.
[2025-05-29 20:15:24] [INFO ] Deduced a trap composed of 27 places in 153 ms of which 3 ms to minimize.
[2025-05-29 20:15:24] [INFO ] Deduced a trap composed of 30 places in 153 ms of which 2 ms to minimize.
[2025-05-29 20:15:24] [INFO ] Deduced a trap composed of 25 places in 143 ms of which 2 ms to minimize.
[2025-05-29 20:15:24] [INFO ] Deduced a trap composed of 29 places in 129 ms of which 2 ms to minimize.
[2025-05-29 20:15:24] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 2 ms to minimize.
[2025-05-29 20:15:24] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 2 ms to minimize.
[2025-05-29 20:15:25] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 2 ms to minimize.
[2025-05-29 20:15:25] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 2 ms to minimize.
[2025-05-29 20:15:25] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 2 ms to minimize.
[2025-05-29 20:15:25] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 2 ms to minimize.
[2025-05-29 20:15:25] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 2 ms to minimize.
[2025-05-29 20:15:25] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 2 ms to minimize.
[2025-05-29 20:15:25] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 1 ms to minimize.
[2025-05-29 20:15:25] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
[2025-05-29 20:15:25] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 2 ms to minimize.
[2025-05-29 20:15:26] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/521 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
[2025-05-29 20:15:27] [INFO ] Deduced a trap composed of 25 places in 171 ms of which 2 ms to minimize.
[2025-05-29 20:15:27] [INFO ] Deduced a trap composed of 34 places in 155 ms of which 3 ms to minimize.
[2025-05-29 20:15:27] [INFO ] Deduced a trap composed of 28 places in 158 ms of which 2 ms to minimize.
[2025-05-29 20:15:27] [INFO ] Deduced a trap composed of 29 places in 162 ms of which 2 ms to minimize.
[2025-05-29 20:15:28] [INFO ] Deduced a trap composed of 36 places in 169 ms of which 2 ms to minimize.
[2025-05-29 20:15:28] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 2 ms to minimize.
[2025-05-29 20:15:28] [INFO ] Deduced a trap composed of 28 places in 162 ms of which 2 ms to minimize.
[2025-05-29 20:15:28] [INFO ] Deduced a trap composed of 27 places in 187 ms of which 3 ms to minimize.
[2025-05-29 20:15:28] [INFO ] Deduced a trap composed of 32 places in 188 ms of which 2 ms to minimize.
[2025-05-29 20:15:28] [INFO ] Deduced a trap composed of 32 places in 200 ms of which 2 ms to minimize.
[2025-05-29 20:15:29] [INFO ] Deduced a trap composed of 31 places in 188 ms of which 2 ms to minimize.
[2025-05-29 20:15:29] [INFO ] Deduced a trap composed of 27 places in 167 ms of which 2 ms to minimize.
[2025-05-29 20:15:29] [INFO ] Deduced a trap composed of 27 places in 156 ms of which 2 ms to minimize.
[2025-05-29 20:15:29] [INFO ] Deduced a trap composed of 30 places in 126 ms of which 2 ms to minimize.
[2025-05-29 20:15:29] [INFO ] Deduced a trap composed of 38 places in 185 ms of which 2 ms to minimize.
[2025-05-29 20:15:30] [INFO ] Deduced a trap composed of 35 places in 141 ms of which 2 ms to minimize.
[2025-05-29 20:15:30] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 1 ms to minimize.
[2025-05-29 20:15:30] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 2 ms to minimize.
[2025-05-29 20:15:30] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 2 ms to minimize.
[2025-05-29 20:15:30] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/521 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
[2025-05-29 20:15:31] [INFO ] Deduced a trap composed of 29 places in 162 ms of which 3 ms to minimize.
[2025-05-29 20:15:31] [INFO ] Deduced a trap composed of 25 places in 166 ms of which 2 ms to minimize.
[2025-05-29 20:15:32] [INFO ] Deduced a trap composed of 26 places in 162 ms of which 3 ms to minimize.
[2025-05-29 20:15:32] [INFO ] Deduced a trap composed of 31 places in 201 ms of which 3 ms to minimize.
[2025-05-29 20:15:32] [INFO ] Deduced a trap composed of 25 places in 201 ms of which 2 ms to minimize.
[2025-05-29 20:15:32] [INFO ] Deduced a trap composed of 25 places in 224 ms of which 3 ms to minimize.
[2025-05-29 20:15:32] [INFO ] Deduced a trap composed of 30 places in 168 ms of which 3 ms to minimize.
[2025-05-29 20:15:33] [INFO ] Deduced a trap composed of 29 places in 131 ms of which 2 ms to minimize.
[2025-05-29 20:15:33] [INFO ] Deduced a trap composed of 33 places in 128 ms of which 2 ms to minimize.
[2025-05-29 20:15:33] [INFO ] Deduced a trap composed of 29 places in 161 ms of which 2 ms to minimize.
[2025-05-29 20:15:33] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 2 ms to minimize.
[2025-05-29 20:15:33] [INFO ] Deduced a trap composed of 30 places in 168 ms of which 2 ms to minimize.
[2025-05-29 20:15:33] [INFO ] Deduced a trap composed of 31 places in 171 ms of which 3 ms to minimize.
[2025-05-29 20:15:34] [INFO ] Deduced a trap composed of 31 places in 162 ms of which 3 ms to minimize.
[2025-05-29 20:15:34] [INFO ] Deduced a trap composed of 29 places in 129 ms of which 2 ms to minimize.
[2025-05-29 20:15:34] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 3 ms to minimize.
[2025-05-29 20:15:34] [INFO ] Deduced a trap composed of 29 places in 118 ms of which 1 ms to minimize.
[2025-05-29 20:15:34] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 2 ms to minimize.
[2025-05-29 20:15:34] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 2 ms to minimize.
[2025-05-29 20:15:34] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/521 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
[2025-05-29 20:15:35] [INFO ] Deduced a trap composed of 26 places in 171 ms of which 2 ms to minimize.
[2025-05-29 20:15:36] [INFO ] Deduced a trap composed of 25 places in 235 ms of which 3 ms to minimize.
[2025-05-29 20:15:36] [INFO ] Deduced a trap composed of 28 places in 191 ms of which 2 ms to minimize.
[2025-05-29 20:15:36] [INFO ] Deduced a trap composed of 26 places in 197 ms of which 3 ms to minimize.
[2025-05-29 20:15:36] [INFO ] Deduced a trap composed of 29 places in 225 ms of which 3 ms to minimize.
[2025-05-29 20:15:37] [INFO ] Deduced a trap composed of 26 places in 219 ms of which 3 ms to minimize.
[2025-05-29 20:15:37] [INFO ] Deduced a trap composed of 25 places in 196 ms of which 2 ms to minimize.
SMT process timed out in 60993ms, After SMT, problems are : Problem set: 0 solved, 1645 unsolved
Search for dead transitions found 0 dead transitions in 61011ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68874 ms. Remains : 522/522 places, 1665/1665 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1542 edges and 522 vertex of which 438 / 522 are part of one of the 2 SCC in 1 ms
Free SCC test removed 436 places
Drop transitions (Empty/Sink Transition effects.) removed 1164 transitions
Ensure Unique test removed 412 transitions
Reduce isomorphic transitions removed 1576 transitions.
Graph (complete) has 211 edges and 86 vertex of which 25 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.0 ms
Discarding 61 places :
Also discarding 19 output transitions
Drop transitions (Output transitions of discarded places.) removed 19 transitions
Drop transitions (Empty/Sink Transition effects.) removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 25 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 24 transition count 28
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 63 place count 6 transition count 10
Iterating global reduction 2 with 18 rules applied. Total rules applied 81 place count 6 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 83 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 86 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 4 transition count 5
Applied a total of 87 rules in 10 ms. Remains 4 /522 variables (removed 518) and now considering 5/1665 (removed 1660) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 4 cols
[2025-05-29 20:15:37] [INFO ] Computed 0 invariants in 1 ms
[2025-05-29 20:15:37] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-29 20:15:37] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-29 20:15:37] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-29 20:15:37] [INFO ] After 27ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-05-29 20:15:37] [INFO ] Flatten gal took : 1 ms
[2025-05-29 20:15:37] [INFO ] Flatten gal took : 0 ms
[2025-05-29 20:15:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9321877163772506216.gal : 1 ms
[2025-05-29 20:15:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8119912184627050040.prop : 0 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/ReachabilityCardinality9321877163772506216.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8119912184627050040.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/ReachabilityCardinality8119912184627050040.prop.
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 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,6,0.003046,3520,2,7,6,33,6,0,21,18,0
Total reachable state count : 6

Verifying 1 reachability properties.
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,0.003793,3896,2,5,6,33,7,0,24,18,0
Over-approximation ignoring read arcs solved 0 properties in 78 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[20]
Ending property specific reduction for CANInsertWithFailure-PT-020-UpperBounds-10 in 148092 ms.
Starting property specific reduction for CANInsertWithFailure-PT-020-UpperBounds-11
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[20]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[20]
// Phase 1: matrix 1674 rows 531 cols
[2025-05-29 20:15:37] [INFO ] Computed 22 invariants in 13 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[20]
RANDOM walk for 10000 steps (104 resets) in 84 ms. (117 steps per ms)
BEST_FIRST walk for 10001 steps (5 resets) in 16 ms. (588 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[20]
[2025-05-29 20:15:37] [INFO ] Invariant cache hit.
[2025-05-29 20:15:37] [INFO ] [Real]Absence check using 20 positive place invariants in 13 ms returned sat
[2025-05-29 20:15:37] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2025-05-29 20:15:38] [INFO ] [Real]Absence check using state equation in 548 ms returned sat
[2025-05-29 20:15:38] [INFO ] State equation strengthened by 1582 read => feed constraints.
[2025-05-29 20:15:38] [INFO ] [Real]Added 1582 Read/Feed constraints in 225 ms returned sat
[2025-05-29 20:15:38] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:15:38] [INFO ] [Nat]Absence check using 20 positive place invariants in 17 ms returned sat
[2025-05-29 20:15:38] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2025-05-29 20:15:39] [INFO ] [Nat]Absence check using state equation in 618 ms returned sat
[2025-05-29 20:15:39] [INFO ] [Nat]Added 1582 Read/Feed constraints in 199 ms returned sat
[2025-05-29 20:15:39] [INFO ] Computed and/alt/rep : 1160/3017/1160 causal constraints (skipped 494 transitions) in 127 ms.
[2025-05-29 20:15:40] [INFO ] Added : 9 causal constraints over 2 iterations in 463 ms. Result :sat
Minimization took 577 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[20]
Support contains 1 out of 531 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 531/531 places, 1674/1674 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 524 transition count 1667
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 524 transition count 1666
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 16 place count 523 transition count 1666
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 24 place count 523 transition count 1666
Applied a total of 24 rules in 165 ms. Remains 523 /531 variables (removed 8) and now considering 1666/1674 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 523/531 places, 1666/1674 transitions.
// Phase 1: matrix 1666 rows 523 cols
[2025-05-29 20:15:40] [INFO ] Computed 22 invariants in 21 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[20]
RANDOM walk for 1000000 steps (10508 resets) in 5236 ms. (190 steps per ms)
BEST_FIRST walk for 1000000 steps (479 resets) in 937 ms. (1066 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[20]
[2025-05-29 20:15:47] [INFO ] Invariant cache hit.
[2025-05-29 20:15:47] [INFO ] [Real]Absence check using 20 positive place invariants in 19 ms returned sat
[2025-05-29 20:15:47] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 9 ms returned sat
[2025-05-29 20:15:47] [INFO ] [Real]Absence check using state equation in 577 ms returned sat
[2025-05-29 20:15:47] [INFO ] State equation strengthened by 1604 read => feed constraints.
[2025-05-29 20:15:48] [INFO ] [Real]Added 1604 Read/Feed constraints in 250 ms returned sat
[2025-05-29 20:15:48] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:15:48] [INFO ] [Nat]Absence check using 20 positive place invariants in 18 ms returned sat
[2025-05-29 20:15:48] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 8 ms returned sat
[2025-05-29 20:15:48] [INFO ] [Nat]Absence check using state equation in 589 ms returned sat
[2025-05-29 20:15:49] [INFO ] [Nat]Added 1604 Read/Feed constraints in 284 ms returned sat
[2025-05-29 20:15:49] [INFO ] Computed and/alt/rep : 1152/3049/1152 causal constraints (skipped 494 transitions) in 144 ms.
[2025-05-29 20:15:49] [INFO ] Added : 9 causal constraints over 2 iterations in 641 ms. Result :sat
Minimization took 4502 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[20]
Support contains 1 out of 523 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1666/1666 transitions.
Applied a total of 0 rules in 28 ms. Remains 523 /523 variables (removed 0) and now considering 1666/1666 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 523/523 places, 1666/1666 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1666/1666 transitions.
Applied a total of 0 rules in 36 ms. Remains 523 /523 variables (removed 0) and now considering 1666/1666 (removed 0) transitions.
[2025-05-29 20:15:54] [INFO ] Invariant cache hit.
[2025-05-29 20:15:55] [INFO ] Implicit Places using invariants in 1013 ms returned []
[2025-05-29 20:15:55] [INFO ] Invariant cache hit.
[2025-05-29 20:15:56] [INFO ] State equation strengthened by 1604 read => feed constraints.
[2025-05-29 20:16:02] [INFO ] Implicit Places using invariants and state equation in 7411 ms returned []
Implicit Place search using SMT with State Equation took 8448 ms to find 0 implicit places.
[2025-05-29 20:16:02] [INFO ] Redundant transitions in 36 ms returned []
Running 1646 sub problems to find dead transitions.
[2025-05-29 20:16:02] [INFO ] Invariant cache hit.
[2025-05-29 20:16:02] [INFO ] State equation strengthened by 1604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/522 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/522 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
[2025-05-29 20:16:29] [INFO ] Deduced a trap composed of 25 places in 365 ms of which 5 ms to minimize.
[2025-05-29 20:16:30] [INFO ] Deduced a trap composed of 22 places in 754 ms of which 8 ms to minimize.
[2025-05-29 20:16:31] [INFO ] Deduced a trap composed of 3 places in 566 ms of which 7 ms to minimize.
[2025-05-29 20:16:31] [INFO ] Deduced a trap composed of 24 places in 333 ms of which 4 ms to minimize.
[2025-05-29 20:16:32] [INFO ] Deduced a trap composed of 26 places in 282 ms of which 4 ms to minimize.
[2025-05-29 20:16:32] [INFO ] Deduced a trap composed of 26 places in 288 ms of which 4 ms to minimize.
[2025-05-29 20:16:32] [INFO ] Deduced a trap composed of 25 places in 294 ms of which 4 ms to minimize.
[2025-05-29 20:16:32] [INFO ] Deduced a trap composed of 26 places in 262 ms of which 3 ms to minimize.
[2025-05-29 20:16:33] [INFO ] Deduced a trap composed of 27 places in 233 ms of which 3 ms to minimize.
[2025-05-29 20:16:33] [INFO ] Deduced a trap composed of 26 places in 239 ms of which 4 ms to minimize.
[2025-05-29 20:16:33] [INFO ] Deduced a trap composed of 26 places in 234 ms of which 4 ms to minimize.
[2025-05-29 20:16:33] [INFO ] Deduced a trap composed of 26 places in 196 ms of which 3 ms to minimize.
SMT process timed out in 30972ms, After SMT, problems are : Problem set: 0 solved, 1646 unsolved
Search for dead transitions found 0 dead transitions in 30992ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39523 ms. Remains : 523/523 places, 1666/1666 transitions.
[2025-05-29 20:16:34] [INFO ] Flatten gal took : 97 ms
[2025-05-29 20:16:34] [INFO ] Flatten gal took : 59 ms
[2025-05-29 20:16:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13125160226437060257.gal : 11 ms
[2025-05-29 20:16:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16096167747379492457.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/ReachabilityCardinality13125160226437060257.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16096167747379492457.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 ...330
RANDOM walk for 40000 steps (420 resets) in 1783 ms. (22 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (18 resets) in 98 ms. (404 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (17 resets) in 69 ms. (571 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality16096167747379492457.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 147
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :147 after 150
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :150 after 151
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :151 after 155
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :155 after 156
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :156 after 157
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :157 after 163
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :163 after 174
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :174 after 199
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :199 after 235
Interrupted probabilistic random walk after 272326 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :0 out of 2
Probabilistic random walk after 272326 steps, saw 39164 distinct states, run finished after 3001 ms. (steps per millisecond=90 ) properties seen :0
[2025-05-29 20:16:37] [INFO ] Invariant cache hit.
[2025-05-29 20:16:37] [INFO ] State equation strengthened by 1604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 480/481 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-29 20:16:37] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 38/519 variables, 19/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/519 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/521 variables, 2/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :235 after 319
[2025-05-29 20:16:38] [INFO ] Deduced a trap composed of 25 places in 479 ms of which 5 ms to minimize.
[2025-05-29 20:16:38] [INFO ] Deduced a trap composed of 31 places in 423 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/521 variables, 2/25 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/521 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1666/2187 variables, 521/546 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2187 variables, 1604/2150 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2187 variables, 0/2150 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/2189 variables, 2/2152 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2189 variables, 0/2152 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2189 variables, 0/2152 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2189/2189 variables, and 2152 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2018 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 523/523 constraints, ReadFeed: 1604/1604 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 480/481 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 38/519 variables, 19/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/519 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/521 variables, 2/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/521 variables, 2/25 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :319 after 453
[2025-05-29 20:16:40] [INFO ] Deduced a trap composed of 31 places in 410 ms of which 4 ms to minimize.
[2025-05-29 20:16:40] [INFO ] Deduced a trap composed of 31 places in 378 ms of which 6 ms to minimize.
[2025-05-29 20:16:40] [INFO ] Deduced a trap composed of 31 places in 437 ms of which 5 ms to minimize.
[2025-05-29 20:16:41] [INFO ] Deduced a trap composed of 29 places in 458 ms of which 5 ms to minimize.
[2025-05-29 20:16:41] [INFO ] Deduced a trap composed of 28 places in 444 ms of which 5 ms to minimize.
[2025-05-29 20:16:42] [INFO ] Deduced a trap composed of 27 places in 440 ms of which 5 ms to minimize.
[2025-05-29 20:16:42] [INFO ] Deduced a trap composed of 26 places in 550 ms of which 5 ms to minimize.
[2025-05-29 20:16:43] [INFO ] Deduced a trap composed of 29 places in 412 ms of which 4 ms to minimize.
[2025-05-29 20:16:43] [INFO ] Deduced a trap composed of 29 places in 375 ms of which 4 ms to minimize.
[2025-05-29 20:16:44] [INFO ] Deduced a trap composed of 29 places in 445 ms of which 4 ms to minimize.
[2025-05-29 20:16:44] [INFO ] Deduced a trap composed of 26 places in 390 ms of which 5 ms to minimize.
SMT process timed out in 7115ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 523 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1666/1666 transitions.
Applied a total of 0 rules in 29 ms. Remains 523 /523 variables (removed 0) and now considering 1666/1666 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 523/523 places, 1666/1666 transitions.
RANDOM walk for 40000 steps (419 resets) in 310 ms. (128 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (18 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :453 after 7476
Interrupted probabilistic random walk after 366442 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :0 out of 1
Probabilistic random walk after 366442 steps, saw 49346 distinct states, run finished after 3001 ms. (steps per millisecond=122 ) properties seen :0
[2025-05-29 20:16:47] [INFO ] Invariant cache hit.
[2025-05-29 20:16:47] [INFO ] State equation strengthened by 1604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 480/481 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:16:47] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
[2025-05-29 20:16:47] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
[2025-05-29 20:16:47] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 0 ms to minimize.
[2025-05-29 20:16:48] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 1 ms to minimize.
[2025-05-29 20:16:48] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 1 ms to minimize.
[2025-05-29 20:16:48] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 1 ms to minimize.
[2025-05-29 20:16:48] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 1 ms to minimize.
[2025-05-29 20:16:48] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
[2025-05-29 20:16:48] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
[2025-05-29 20:16:48] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 0 ms to minimize.
[2025-05-29 20:16:48] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
[2025-05-29 20:16:48] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
[2025-05-29 20:16:48] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2025-05-29 20:16:48] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2025-05-29 20:16:48] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 0 ms to minimize.
[2025-05-29 20:16:48] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 38/519 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/519 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/521 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/521 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1666/2187 variables, 521/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2187 variables, 1604/2163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2187 variables, 0/2163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/2189 variables, 2/2165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2189 variables, 0/2165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/2189 variables, 0/2165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2189/2189 variables, and 2165 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1619 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 523/523 constraints, ReadFeed: 1604/1604 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 480/481 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:16:49] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2025-05-29 20:16:49] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
[2025-05-29 20:16:49] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/481 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 38/519 variables, 19/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/519 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/521 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:16:50] [INFO ] Deduced a trap composed of 28 places in 430 ms of which 5 ms to minimize.
[2025-05-29 20:16:50] [INFO ] Deduced a trap composed of 31 places in 452 ms of which 5 ms to minimize.
[2025-05-29 20:16:51] [INFO ] Deduced a trap composed of 25 places in 491 ms of which 5 ms to minimize.
[2025-05-29 20:16:51] [INFO ] Deduced a trap composed of 26 places in 518 ms of which 5 ms to minimize.
[2025-05-29 20:16:52] [INFO ] Deduced a trap composed of 26 places in 460 ms of which 5 ms to minimize.
[2025-05-29 20:16:52] [INFO ] Deduced a trap composed of 25 places in 436 ms of which 5 ms to minimize.
[2025-05-29 20:16:53] [INFO ] Deduced a trap composed of 32 places in 477 ms of which 5 ms to minimize.
[2025-05-29 20:16:53] [INFO ] Deduced a trap composed of 25 places in 535 ms of which 4 ms to minimize.
[2025-05-29 20:16:54] [INFO ] Deduced a trap composed of 25 places in 488 ms of which 5 ms to minimize.
[2025-05-29 20:16:54] [INFO ] Deduced a trap composed of 29 places in 508 ms of which 5 ms to minimize.
[2025-05-29 20:16:55] [INFO ] Deduced a trap composed of 32 places in 485 ms of which 6 ms to minimize.
[2025-05-29 20:16:55] [INFO ] Deduced a trap composed of 26 places in 500 ms of which 5 ms to minimize.
[2025-05-29 20:16:56] [INFO ] Deduced a trap composed of 25 places in 572 ms of which 5 ms to minimize.
[2025-05-29 20:16:56] [INFO ] Deduced a trap composed of 24 places in 501 ms of which 4 ms to minimize.
[2025-05-29 20:16:57] [INFO ] Deduced a trap composed of 29 places in 454 ms of which 5 ms to minimize.
[2025-05-29 20:16:57] [INFO ] Deduced a trap composed of 26 places in 450 ms of which 5 ms to minimize.
[2025-05-29 20:16:58] [INFO ] Deduced a trap composed of 25 places in 429 ms of which 5 ms to minimize.
[2025-05-29 20:16:58] [INFO ] Deduced a trap composed of 25 places in 424 ms of which 5 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :7476 after 9186
[2025-05-29 20:16:58] [INFO ] Deduced a trap composed of 26 places in 433 ms of which 5 ms to minimize.
[2025-05-29 20:16:59] [INFO ] Deduced a trap composed of 25 places in 428 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/521 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:16:59] [INFO ] Deduced a trap composed of 25 places in 428 ms of which 5 ms to minimize.
[2025-05-29 20:17:00] [INFO ] Deduced a trap composed of 26 places in 386 ms of which 5 ms to minimize.
[2025-05-29 20:17:00] [INFO ] Deduced a trap composed of 26 places in 372 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/521 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/521 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1666/2187 variables, 521/585 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2187 variables, 1604/2189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2187 variables, 1/2190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2187 variables, 0/2190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/2189 variables, 2/2192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2189 variables, 0/2192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2189 variables, 0/2192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2189/2189 variables, and 2192 constraints, problems are : Problem set: 0 solved, 1 unsolved in 12435 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 523/523 constraints, ReadFeed: 1604/1604 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 42/42 constraints]
After SMT, in 14080ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 1 out of 523 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1666/1666 transitions.
Applied a total of 0 rules in 28 ms. Remains 523 /523 variables (removed 0) and now considering 1666/1666 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 523/523 places, 1666/1666 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1666/1666 transitions.
Applied a total of 0 rules in 35 ms. Remains 523 /523 variables (removed 0) and now considering 1666/1666 (removed 0) transitions.
[2025-05-29 20:17:01] [INFO ] Invariant cache hit.
[2025-05-29 20:17:02] [INFO ] Implicit Places using invariants in 796 ms returned []
[2025-05-29 20:17:02] [INFO ] Invariant cache hit.
[2025-05-29 20:17:03] [INFO ] State equation strengthened by 1604 read => feed constraints.
[2025-05-29 20:17:09] [INFO ] Implicit Places using invariants and state equation in 7254 ms returned []
Implicit Place search using SMT with State Equation took 8056 ms to find 0 implicit places.
[2025-05-29 20:17:10] [INFO ] Redundant transitions in 37 ms returned []
Running 1646 sub problems to find dead transitions.
[2025-05-29 20:17:10] [INFO ] Invariant cache hit.
[2025-05-29 20:17:10] [INFO ] State equation strengthened by 1604 read => feed constraints.
Detected timeout of ITS tools.
[2025-05-29 20:17:24] [INFO ] Flatten gal took : 52 ms
[2025-05-29 20:17:24] [INFO ] Applying decomposition
[2025-05-29 20:17:24] [INFO ] Flatten gal took : 35 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/graph3251829546694943071.txt' '-o' '/tmp/graph3251829546694943071.bin' '-w' '/tmp/graph3251829546694943071.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3251829546694943071.bin' '-l' '-1' '-v' '-w' '/tmp/graph3251829546694943071.weights' '-q' '0' '-e' '0.001'
[2025-05-29 20:17:24] [INFO ] Decomposing Gal with order
[2025-05-29 20:17:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 20:17:24] [INFO ] Removed a total of 1287 redundant transitions.
[2025-05-29 20:17:24] [INFO ] Flatten gal took : 131 ms
[2025-05-29 20:17:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 1504 labels/synchronizations in 48 ms.
[2025-05-29 20:17:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17986829325579415828.gal : 20 ms
[2025-05-29 20:17:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10989139869777150922.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/ReachabilityCardinality17986829325579415828.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10989139869777150922.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 ...309
Loading property file /tmp/ReachabilityCardinality10989139869777150922.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 914
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :914 after 914
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :914 after 914
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :914 after 914
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :914 after 914
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :914 after 914
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :914 after 940
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :940 after 949
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :949 after 991
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :991 after 93725
At refinement iteration 0 (INCLUDED_ONLY) 0/522 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/522 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
[2025-05-29 20:17:29] [INFO ] Deduced a trap composed of 25 places in 219 ms of which 3 ms to minimize.
[2025-05-29 20:17:30] [INFO ] Deduced a trap composed of 22 places in 431 ms of which 5 ms to minimize.
[2025-05-29 20:17:30] [INFO ] Deduced a trap composed of 3 places in 398 ms of which 4 ms to minimize.
[2025-05-29 20:17:30] [INFO ] Deduced a trap composed of 24 places in 207 ms of which 2 ms to minimize.
[2025-05-29 20:17:31] [INFO ] Deduced a trap composed of 26 places in 175 ms of which 2 ms to minimize.
[2025-05-29 20:17:31] [INFO ] Deduced a trap composed of 26 places in 182 ms of which 3 ms to minimize.
[2025-05-29 20:17:31] [INFO ] Deduced a trap composed of 25 places in 205 ms of which 3 ms to minimize.
[2025-05-29 20:17:31] [INFO ] Deduced a trap composed of 26 places in 209 ms of which 2 ms to minimize.
[2025-05-29 20:17:31] [INFO ] Deduced a trap composed of 27 places in 172 ms of which 3 ms to minimize.
[2025-05-29 20:17:32] [INFO ] Deduced a trap composed of 26 places in 134 ms of which 2 ms to minimize.
[2025-05-29 20:17:32] [INFO ] Deduced a trap composed of 26 places in 143 ms of which 2 ms to minimize.
[2025-05-29 20:17:32] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 2 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4096
[2025-05-29 20:17:32] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 2 ms to minimize.
SDD size :6.18363e+06 after 1.09977e+07
[2025-05-29 20:17:32] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 2 ms to minimize.
[2025-05-29 20:17:32] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 2 ms to minimize.
[2025-05-29 20:17:32] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
[2025-05-29 20:17:32] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2025-05-29 20:17:33] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 2 ms to minimize.
[2025-05-29 20:17:33] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 2 ms to minimize.
[2025-05-29 20:17:33] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/522 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
[2025-05-29 20:17:34] [INFO ] Deduced a trap composed of 31 places in 314 ms of which 4 ms to minimize.
[2025-05-29 20:17:34] [INFO ] Deduced a trap composed of 27 places in 255 ms of which 3 ms to minimize.
[2025-05-29 20:17:34] [INFO ] Deduced a trap composed of 27 places in 225 ms of which 3 ms to minimize.
[2025-05-29 20:17:35] [INFO ] Deduced a trap composed of 32 places in 254 ms of which 4 ms to minimize.
[2025-05-29 20:17:35] [INFO ] Deduced a trap composed of 25 places in 235 ms of which 3 ms to minimize.
[2025-05-29 20:17:35] [INFO ] Deduced a trap composed of 25 places in 211 ms of which 3 ms to minimize.
[2025-05-29 20:17:35] [INFO ] Deduced a trap composed of 26 places in 217 ms of which 3 ms to minimize.
[2025-05-29 20:17:36] [INFO ] Deduced a trap composed of 27 places in 282 ms of which 3 ms to minimize.
[2025-05-29 20:17:36] [INFO ] Deduced a trap composed of 25 places in 244 ms of which 3 ms to minimize.
[2025-05-29 20:17:36] [INFO ] Deduced a trap composed of 25 places in 220 ms of which 3 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.09977e+07 after 1.1886e+07
[2025-05-29 20:17:36] [INFO ] Deduced a trap composed of 26 places in 226 ms of which 3 ms to minimize.
[2025-05-29 20:17:37] [INFO ] Deduced a trap composed of 27 places in 167 ms of which 2 ms to minimize.
[2025-05-29 20:17:37] [INFO ] Deduced a trap composed of 25 places in 143 ms of which 2 ms to minimize.
[2025-05-29 20:17:37] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 2 ms to minimize.
[2025-05-29 20:17:37] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 2 ms to minimize.
[2025-05-29 20:17:37] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 1 ms to minimize.
[2025-05-29 20:17:37] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 2 ms to minimize.
[2025-05-29 20:17:37] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 2 ms to minimize.
[2025-05-29 20:17:37] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 2 ms to minimize.
[2025-05-29 20:17:38] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 2 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 3 (INCLUDED_ONLY) 0/522 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 522/2189 variables, and 62 constraints, problems are : Problem set: 0 solved, 1646 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/523 constraints, ReadFeed: 0/1604 constraints, PredecessorRefiner: 1646/1646 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1646 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/522 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/522 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/522 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
[2025-05-29 20:17:43] [INFO ] Deduced a trap composed of 26 places in 200 ms of which 3 ms to minimize.
[2025-05-29 20:17:43] [INFO ] Deduced a trap composed of 25 places in 164 ms of which 3 ms to minimize.
[2025-05-29 20:17:43] [INFO ] Deduced a trap composed of 26 places in 161 ms of which 2 ms to minimize.
[2025-05-29 20:17:43] [INFO ] Deduced a trap composed of 25 places in 158 ms of which 2 ms to minimize.
[2025-05-29 20:17:44] [INFO ] Deduced a trap composed of 26 places in 146 ms of which 3 ms to minimize.
[2025-05-29 20:17:44] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 2 ms to minimize.
[2025-05-29 20:17:44] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 2 ms to minimize.
[2025-05-29 20:17:44] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 2 ms to minimize.
[2025-05-29 20:17:44] [INFO ] Deduced a trap composed of 22 places in 360 ms of which 4 ms to minimize.
[2025-05-29 20:17:45] [INFO ] Deduced a trap composed of 22 places in 347 ms of which 4 ms to minimize.
[2025-05-29 20:17:45] [INFO ] Deduced a trap composed of 22 places in 310 ms of which 4 ms to minimize.
[2025-05-29 20:17:45] [INFO ] Deduced a trap composed of 2 places in 313 ms of which 4 ms to minimize.
[2025-05-29 20:17:46] [INFO ] Deduced a trap composed of 26 places in 293 ms of which 3 ms to minimize.
[2025-05-29 20:17:46] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2025-05-29 20:17:46] [INFO ] Deduced a trap composed of 25 places in 233 ms of which 4 ms to minimize.
[2025-05-29 20:17:46] [INFO ] Deduced a trap composed of 28 places in 195 ms of which 3 ms to minimize.
[2025-05-29 20:17:47] [INFO ] Deduced a trap composed of 29 places in 241 ms of which 3 ms to minimize.
[2025-05-29 20:17:47] [INFO ] Deduced a trap composed of 27 places in 237 ms of which 3 ms to minimize.
[2025-05-29 20:17:47] [INFO ] Deduced a trap composed of 29 places in 244 ms of which 3 ms to minimize.
[2025-05-29 20:17:47] [INFO ] Deduced a trap composed of 33 places in 224 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/522 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
[2025-05-29 20:17:48] [INFO ] Deduced a trap composed of 27 places in 158 ms of which 3 ms to minimize.
[2025-05-29 20:17:48] [INFO ] Deduced a trap composed of 28 places in 127 ms of which 2 ms to minimize.
[2025-05-29 20:17:49] [INFO ] Deduced a trap composed of 26 places in 155 ms of which 2 ms to minimize.
[2025-05-29 20:17:49] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 3 ms to minimize.
[2025-05-29 20:17:49] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 2 ms to minimize.
[2025-05-29 20:17:49] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 2 ms to minimize.
[2025-05-29 20:17:49] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 1 ms to minimize.
[2025-05-29 20:17:49] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 2 ms to minimize.
[2025-05-29 20:17:49] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2025-05-29 20:17:50] [INFO ] Deduced a trap composed of 26 places in 376 ms of which 5 ms to minimize.
[2025-05-29 20:17:50] [INFO ] Deduced a trap composed of 26 places in 348 ms of which 4 ms to minimize.
[2025-05-29 20:17:50] [INFO ] Deduced a trap composed of 25 places in 263 ms of which 3 ms to minimize.
[2025-05-29 20:17:51] [INFO ] Deduced a trap composed of 25 places in 237 ms of which 3 ms to minimize.
[2025-05-29 20:17:51] [INFO ] Deduced a trap composed of 36 places in 226 ms of which 3 ms to minimize.
[2025-05-29 20:17:51] [INFO ] Deduced a trap composed of 37 places in 214 ms of which 3 ms to minimize.
[2025-05-29 20:17:51] [INFO ] Deduced a trap composed of 32 places in 198 ms of which 3 ms to minimize.
[2025-05-29 20:17:52] [INFO ] Deduced a trap composed of 32 places in 206 ms of which 3 ms to minimize.
[2025-05-29 20:17:52] [INFO ] Deduced a trap composed of 34 places in 202 ms of which 3 ms to minimize.
[2025-05-29 20:17:52] [INFO ] Deduced a trap composed of 25 places in 179 ms of which 2 ms to minimize.
[2025-05-29 20:17:52] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/522 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
[2025-05-29 20:17:53] [INFO ] Deduced a trap composed of 25 places in 222 ms of which 3 ms to minimize.
[2025-05-29 20:17:54] [INFO ] Deduced a trap composed of 25 places in 187 ms of which 3 ms to minimize.
[2025-05-29 20:17:54] [INFO ] Deduced a trap composed of 28 places in 208 ms of which 3 ms to minimize.
[2025-05-29 20:17:54] [INFO ] Deduced a trap composed of 27 places in 187 ms of which 3 ms to minimize.
[2025-05-29 20:17:54] [INFO ] Deduced a trap composed of 27 places in 166 ms of which 2 ms to minimize.
[2025-05-29 20:17:54] [INFO ] Deduced a trap composed of 28 places in 180 ms of which 3 ms to minimize.
[2025-05-29 20:17:55] [INFO ] Deduced a trap composed of 26 places in 172 ms of which 3 ms to minimize.
[2025-05-29 20:17:55] [INFO ] Deduced a trap composed of 25 places in 139 ms of which 3 ms to minimize.
[2025-05-29 20:17:55] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 2 ms to minimize.
[2025-05-29 20:17:55] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 2 ms to minimize.
[2025-05-29 20:17:55] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 2 ms to minimize.
[2025-05-29 20:17:55] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 2 ms to minimize.
[2025-05-29 20:17:55] [INFO ] Deduced a trap composed of 26 places in 156 ms of which 2 ms to minimize.
[2025-05-29 20:17:56] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 2 ms to minimize.
[2025-05-29 20:17:56] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 2 ms to minimize.
[2025-05-29 20:17:56] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 2 ms to minimize.
[2025-05-29 20:17:56] [INFO ] Deduced a trap composed of 26 places in 136 ms of which 3 ms to minimize.
[2025-05-29 20:17:56] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 2 ms to minimize.
[2025-05-29 20:17:56] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 2 ms to minimize.
[2025-05-29 20:17:56] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/522 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
[2025-05-29 20:17:57] [INFO ] Deduced a trap composed of 27 places in 217 ms of which 3 ms to minimize.
[2025-05-29 20:17:58] [INFO ] Deduced a trap composed of 29 places in 151 ms of which 3 ms to minimize.
[2025-05-29 20:17:58] [INFO ] Deduced a trap composed of 25 places in 151 ms of which 3 ms to minimize.
[2025-05-29 20:17:58] [INFO ] Deduced a trap composed of 26 places in 177 ms of which 3 ms to minimize.
[2025-05-29 20:17:58] [INFO ] Deduced a trap composed of 28 places in 157 ms of which 2 ms to minimize.
[2025-05-29 20:17:58] [INFO ] Deduced a trap composed of 26 places in 175 ms of which 3 ms to minimize.
[2025-05-29 20:17:58] [INFO ] Deduced a trap composed of 30 places in 164 ms of which 2 ms to minimize.
[2025-05-29 20:17:59] [INFO ] Deduced a trap composed of 28 places in 153 ms of which 2 ms to minimize.
[2025-05-29 20:17:59] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 2 ms to minimize.
[2025-05-29 20:17:59] [INFO ] Deduced a trap composed of 26 places in 154 ms of which 3 ms to minimize.
[2025-05-29 20:17:59] [INFO ] Deduced a trap composed of 26 places in 145 ms of which 3 ms to minimize.
[2025-05-29 20:17:59] [INFO ] Deduced a trap composed of 28 places in 131 ms of which 2 ms to minimize.
[2025-05-29 20:17:59] [INFO ] Deduced a trap composed of 29 places in 132 ms of which 2 ms to minimize.
[2025-05-29 20:18:00] [INFO ] Deduced a trap composed of 27 places in 173 ms of which 3 ms to minimize.
[2025-05-29 20:18:00] [INFO ] Deduced a trap composed of 28 places in 157 ms of which 2 ms to minimize.
[2025-05-29 20:18:00] [INFO ] Deduced a trap composed of 25 places in 153 ms of which 3 ms to minimize.
[2025-05-29 20:18:00] [INFO ] Deduced a trap composed of 28 places in 151 ms of which 2 ms to minimize.
[2025-05-29 20:18:00] [INFO ] Deduced a trap composed of 28 places in 157 ms of which 3 ms to minimize.
[2025-05-29 20:18:00] [INFO ] Deduced a trap composed of 27 places in 157 ms of which 2 ms to minimize.
[2025-05-29 20:18:01] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
[2025-05-29 20:18:02] [INFO ] Deduced a trap composed of 29 places in 315 ms of which 5 ms to minimize.
[2025-05-29 20:18:02] [INFO ] Deduced a trap composed of 30 places in 148 ms of which 2 ms to minimize.
[2025-05-29 20:18:02] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 2 ms to minimize.
[2025-05-29 20:18:02] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 3 ms to minimize.
[2025-05-29 20:18:02] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2025-05-29 20:18:03] [INFO ] Deduced a trap composed of 27 places in 157 ms of which 2 ms to minimize.
[2025-05-29 20:18:03] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2025-05-29 20:18:03] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 3 ms to minimize.
[2025-05-29 20:18:03] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2025-05-29 20:18:03] [INFO ] Deduced a trap composed of 35 places in 137 ms of which 2 ms to minimize.
[2025-05-29 20:18:03] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2025-05-29 20:18:03] [INFO ] Deduced a trap composed of 27 places in 179 ms of which 2 ms to minimize.
[2025-05-29 20:18:04] [INFO ] Deduced a trap composed of 27 places in 221 ms of which 4 ms to minimize.
[2025-05-29 20:18:04] [INFO ] Deduced a trap composed of 28 places in 236 ms of which 4 ms to minimize.
[2025-05-29 20:18:04] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2025-05-29 20:18:04] [INFO ] Deduced a trap composed of 26 places in 152 ms of which 3 ms to minimize.
[2025-05-29 20:18:04] [INFO ] Deduced a trap composed of 31 places in 153 ms of which 3 ms to minimize.
[2025-05-29 20:18:05] [INFO ] Deduced a trap composed of 31 places in 199 ms of which 3 ms to minimize.
[2025-05-29 20:18:05] [INFO ] Deduced a trap composed of 29 places in 244 ms of which 3 ms to minimize.
[2025-05-29 20:18:05] [INFO ] Deduced a trap composed of 25 places in 176 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/522 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
[2025-05-29 20:18:06] [INFO ] Deduced a trap composed of 25 places in 172 ms of which 2 ms to minimize.
[2025-05-29 20:18:06] [INFO ] Deduced a trap composed of 25 places in 174 ms of which 2 ms to minimize.
[2025-05-29 20:18:07] [INFO ] Deduced a trap composed of 31 places in 181 ms of which 3 ms to minimize.
[2025-05-29 20:18:07] [INFO ] Deduced a trap composed of 29 places in 205 ms of which 3 ms to minimize.
[2025-05-29 20:18:07] [INFO ] Deduced a trap composed of 25 places in 182 ms of which 3 ms to minimize.
[2025-05-29 20:18:07] [INFO ] Deduced a trap composed of 26 places in 152 ms of which 3 ms to minimize.
[2025-05-29 20:18:07] [INFO ] Deduced a trap composed of 28 places in 212 ms of which 4 ms to minimize.
[2025-05-29 20:18:08] [INFO ] Deduced a trap composed of 27 places in 173 ms of which 4 ms to minimize.
[2025-05-29 20:18:08] [INFO ] Deduced a trap composed of 27 places in 236 ms of which 4 ms to minimize.
[2025-05-29 20:18:08] [INFO ] Deduced a trap composed of 27 places in 218 ms of which 3 ms to minimize.
[2025-05-29 20:18:08] [INFO ] Deduced a trap composed of 25 places in 195 ms of which 3 ms to minimize.
[2025-05-29 20:18:08] [INFO ] Deduced a trap composed of 28 places in 172 ms of which 3 ms to minimize.
[2025-05-29 20:18:09] [INFO ] Deduced a trap composed of 28 places in 169 ms of which 3 ms to minimize.
[2025-05-29 20:18:09] [INFO ] Deduced a trap composed of 27 places in 173 ms of which 3 ms to minimize.
[2025-05-29 20:18:09] [INFO ] Deduced a trap composed of 26 places in 173 ms of which 3 ms to minimize.
[2025-05-29 20:18:09] [INFO ] Deduced a trap composed of 26 places in 167 ms of which 3 ms to minimize.
[2025-05-29 20:18:09] [INFO ] Deduced a trap composed of 29 places in 188 ms of which 3 ms to minimize.
[2025-05-29 20:18:10] [INFO ] Deduced a trap composed of 26 places in 212 ms of which 4 ms to minimize.
[2025-05-29 20:18:10] [INFO ] Deduced a trap composed of 25 places in 223 ms of which 3 ms to minimize.
[2025-05-29 20:18:10] [INFO ] Deduced a trap composed of 25 places in 208 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/522 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 522/2189 variables, and 182 constraints, problems are : Problem set: 0 solved, 1646 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/523 constraints, ReadFeed: 0/1604 constraints, PredecessorRefiner: 0/1646 constraints, Known Traps: 160/160 constraints]
After SMT, in 60878ms problems are : Problem set: 0 solved, 1646 unsolved
Search for dead transitions found 0 dead transitions in 60897ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69035 ms. Remains : 523/523 places, 1666/1666 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1543 edges and 523 vertex of which 439 / 523 are part of one of the 2 SCC in 1 ms
Free SCC test removed 437 places
Drop transitions (Empty/Sink Transition effects.) removed 1165 transitions
Ensure Unique test removed 412 transitions
Reduce isomorphic transitions removed 1577 transitions.
Graph (complete) has 211 edges and 86 vertex of which 25 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.0 ms
Discarding 61 places :
Also discarding 19 output transitions
Drop transitions (Output transitions of discarded places.) removed 19 transitions
Drop transitions (Empty/Sink Transition effects.) removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 25 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 24 transition count 28
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 63 place count 6 transition count 10
Iterating global reduction 2 with 18 rules applied. Total rules applied 81 place count 6 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 83 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 86 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 4 transition count 5
Applied a total of 87 rules in 8 ms. Remains 4 /523 variables (removed 519) and now considering 5/1666 (removed 1661) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 4 cols
[2025-05-29 20:18:10] [INFO ] Computed 0 invariants in 1 ms
[2025-05-29 20:18:10] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-29 20:18:10] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-29 20:18:10] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-29 20:18:10] [INFO ] After 26ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-05-29 20:18:10] [INFO ] Flatten gal took : 0 ms
[2025-05-29 20:18:10] [INFO ] Flatten gal took : 0 ms
[2025-05-29 20:18:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10029193977401894763.gal : 0 ms
[2025-05-29 20:18:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10213692650527794458.prop : 0 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/ReachabilityCardinality10029193977401894763.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10213692650527794458.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 ...330
Loading property file /tmp/ReachabilityCardinality10213692650527794458.prop.
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 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,6,0.003166,3516,2,7,6,33,6,0,21,18,0
Total reachable state count : 6

Verifying 1 reachability properties.
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,0.003559,3892,2,5,6,33,7,0,24,18,0
Over-approximation ignoring read arcs solved 0 properties in 71 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[20]
Ending property specific reduction for CANInsertWithFailure-PT-020-UpperBounds-11 in 153615 ms.
Starting property specific reduction for CANInsertWithFailure-PT-020-UpperBounds-12
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[20]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[20]
// Phase 1: matrix 1674 rows 531 cols
[2025-05-29 20:18:11] [INFO ] Computed 22 invariants in 13 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[20]
RANDOM walk for 10000 steps (104 resets) in 52 ms. (188 steps per ms)
BEST_FIRST walk for 10001 steps (4 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[20]
[2025-05-29 20:18:11] [INFO ] Invariant cache hit.
[2025-05-29 20:18:11] [INFO ] [Real]Absence check using 20 positive place invariants in 12 ms returned sat
[2025-05-29 20:18:11] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2025-05-29 20:18:11] [INFO ] [Real]Absence check using state equation in 588 ms returned sat
[2025-05-29 20:18:11] [INFO ] State equation strengthened by 1582 read => feed constraints.
[2025-05-29 20:18:12] [INFO ] [Real]Added 1582 Read/Feed constraints in 237 ms returned sat
[2025-05-29 20:18:12] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:18:12] [INFO ] [Nat]Absence check using 20 positive place invariants in 20 ms returned sat
[2025-05-29 20:18:12] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 8 ms returned sat
[2025-05-29 20:18:13] [INFO ] [Nat]Absence check using state equation in 633 ms returned sat
[2025-05-29 20:18:13] [INFO ] [Nat]Added 1582 Read/Feed constraints in 192 ms returned sat
[2025-05-29 20:18:13] [INFO ] Computed and/alt/rep : 1160/3017/1160 causal constraints (skipped 494 transitions) in 122 ms.
[2025-05-29 20:18:13] [INFO ] Added : 7 causal constraints over 2 iterations in 410 ms. Result :sat
Minimization took 563 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[20]
Support contains 1 out of 531 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 531/531 places, 1674/1674 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 524 transition count 1667
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 524 transition count 1666
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 16 place count 523 transition count 1666
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 24 place count 523 transition count 1666
Applied a total of 24 rules in 100 ms. Remains 523 /531 variables (removed 8) and now considering 1666/1674 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 523/531 places, 1666/1674 transitions.
// Phase 1: matrix 1666 rows 523 cols
[2025-05-29 20:18:14] [INFO ] Computed 22 invariants in 24 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[20]
RANDOM walk for 1000000 steps (10533 resets) in 5333 ms. (187 steps per ms)
BEST_FIRST walk for 1000001 steps (476 resets) in 922 ms. (1083 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[20]
[2025-05-29 20:18:20] [INFO ] Invariant cache hit.
[2025-05-29 20:18:20] [INFO ] [Real]Absence check using 20 positive place invariants in 12 ms returned sat
[2025-05-29 20:18:20] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2025-05-29 20:18:21] [INFO ] [Real]Absence check using state equation in 493 ms returned sat
[2025-05-29 20:18:21] [INFO ] State equation strengthened by 1604 read => feed constraints.
[2025-05-29 20:18:21] [INFO ] [Real]Added 1604 Read/Feed constraints in 264 ms returned sat
[2025-05-29 20:18:21] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:18:21] [INFO ] [Nat]Absence check using 20 positive place invariants in 22 ms returned sat
[2025-05-29 20:18:21] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 8 ms returned sat
[2025-05-29 20:18:22] [INFO ] [Nat]Absence check using state equation in 656 ms returned sat
[2025-05-29 20:18:22] [INFO ] [Nat]Added 1604 Read/Feed constraints in 198 ms returned sat
[2025-05-29 20:18:22] [INFO ] Computed and/alt/rep : 1152/3049/1152 causal constraints (skipped 494 transitions) in 115 ms.
[2025-05-29 20:18:23] [INFO ] Added : 10 causal constraints over 2 iterations in 442 ms. Result :sat
Minimization took 4502 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[20]
Support contains 1 out of 523 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1666/1666 transitions.
Applied a total of 0 rules in 29 ms. Remains 523 /523 variables (removed 0) and now considering 1666/1666 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 523/523 places, 1666/1666 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1666/1666 transitions.
Applied a total of 0 rules in 30 ms. Remains 523 /523 variables (removed 0) and now considering 1666/1666 (removed 0) transitions.
[2025-05-29 20:18:27] [INFO ] Invariant cache hit.
[2025-05-29 20:18:28] [INFO ] Implicit Places using invariants in 773 ms returned []
[2025-05-29 20:18:28] [INFO ] Invariant cache hit.
[2025-05-29 20:18:29] [INFO ] State equation strengthened by 1604 read => feed constraints.
[2025-05-29 20:18:36] [INFO ] Implicit Places using invariants and state equation in 8094 ms returned []
Implicit Place search using SMT with State Equation took 8868 ms to find 0 implicit places.
[2025-05-29 20:18:36] [INFO ] Redundant transitions in 36 ms returned []
Running 1646 sub problems to find dead transitions.
[2025-05-29 20:18:36] [INFO ] Invariant cache hit.
[2025-05-29 20:18:36] [INFO ] State equation strengthened by 1604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/522 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/522 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
[2025-05-29 20:19:05] [INFO ] Deduced a trap composed of 30 places in 404 ms of which 5 ms to minimize.
[2025-05-29 20:19:06] [INFO ] Deduced a trap composed of 28 places in 445 ms of which 5 ms to minimize.
[2025-05-29 20:19:06] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 2 ms to minimize.
[2025-05-29 20:19:07] [INFO ] Deduced a trap composed of 2 places in 619 ms of which 7 ms to minimize.
[2025-05-29 20:19:07] [INFO ] Deduced a trap composed of 25 places in 407 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 522/2189 variables, and 27 constraints, problems are : Problem set: 0 solved, 1646 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/523 constraints, ReadFeed: 0/1604 constraints, PredecessorRefiner: 1646/1646 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1646 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/522 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/522 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/522 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
[2025-05-29 20:19:12] [INFO ] Deduced a trap composed of 2 places in 604 ms of which 7 ms to minimize.
[2025-05-29 20:19:12] [INFO ] Deduced a trap composed of 30 places in 436 ms of which 6 ms to minimize.
[2025-05-29 20:19:13] [INFO ] Deduced a trap composed of 25 places in 401 ms of which 5 ms to minimize.
[2025-05-29 20:19:13] [INFO ] Deduced a trap composed of 29 places in 365 ms of which 5 ms to minimize.
[2025-05-29 20:19:13] [INFO ] Deduced a trap composed of 29 places in 408 ms of which 5 ms to minimize.
[2025-05-29 20:19:14] [INFO ] Deduced a trap composed of 28 places in 422 ms of which 5 ms to minimize.
[2025-05-29 20:19:14] [INFO ] Deduced a trap composed of 27 places in 459 ms of which 5 ms to minimize.
[2025-05-29 20:19:15] [INFO ] Deduced a trap composed of 31 places in 398 ms of which 5 ms to minimize.
[2025-05-29 20:19:15] [INFO ] Deduced a trap composed of 26 places in 425 ms of which 5 ms to minimize.
[2025-05-29 20:19:16] [INFO ] Deduced a trap composed of 31 places in 367 ms of which 5 ms to minimize.
[2025-05-29 20:19:16] [INFO ] Deduced a trap composed of 28 places in 382 ms of which 5 ms to minimize.
[2025-05-29 20:19:16] [INFO ] Deduced a trap composed of 32 places in 383 ms of which 4 ms to minimize.
[2025-05-29 20:19:17] [INFO ] Deduced a trap composed of 29 places in 427 ms of which 5 ms to minimize.
[2025-05-29 20:19:17] [INFO ] Deduced a trap composed of 28 places in 416 ms of which 6 ms to minimize.
[2025-05-29 20:19:18] [INFO ] Deduced a trap composed of 29 places in 420 ms of which 6 ms to minimize.
[2025-05-29 20:19:18] [INFO ] Deduced a trap composed of 25 places in 462 ms of which 6 ms to minimize.
[2025-05-29 20:19:19] [INFO ] Deduced a trap composed of 29 places in 436 ms of which 6 ms to minimize.
[2025-05-29 20:19:19] [INFO ] Deduced a trap composed of 26 places in 372 ms of which 5 ms to minimize.
[2025-05-29 20:19:19] [INFO ] Deduced a trap composed of 25 places in 374 ms of which 5 ms to minimize.
[2025-05-29 20:19:20] [INFO ] Deduced a trap composed of 27 places in 337 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/522 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
[2025-05-29 20:19:21] [INFO ] Deduced a trap composed of 27 places in 385 ms of which 5 ms to minimize.
[2025-05-29 20:19:22] [INFO ] Deduced a trap composed of 29 places in 389 ms of which 5 ms to minimize.
[2025-05-29 20:19:22] [INFO ] Deduced a trap composed of 29 places in 383 ms of which 5 ms to minimize.
[2025-05-29 20:19:22] [INFO ] Deduced a trap composed of 28 places in 371 ms of which 5 ms to minimize.
[2025-05-29 20:19:23] [INFO ] Deduced a trap composed of 28 places in 329 ms of which 5 ms to minimize.
[2025-05-29 20:19:23] [INFO ] Deduced a trap composed of 27 places in 359 ms of which 5 ms to minimize.
[2025-05-29 20:19:23] [INFO ] Deduced a trap composed of 26 places in 344 ms of which 5 ms to minimize.
[2025-05-29 20:19:24] [INFO ] Deduced a trap composed of 26 places in 351 ms of which 4 ms to minimize.
[2025-05-29 20:19:24] [INFO ] Deduced a trap composed of 26 places in 322 ms of which 5 ms to minimize.
[2025-05-29 20:19:24] [INFO ] Deduced a trap composed of 28 places in 360 ms of which 5 ms to minimize.
[2025-05-29 20:19:25] [INFO ] Deduced a trap composed of 25 places in 371 ms of which 5 ms to minimize.
[2025-05-29 20:19:25] [INFO ] Deduced a trap composed of 26 places in 313 ms of which 4 ms to minimize.
[2025-05-29 20:19:26] [INFO ] Deduced a trap composed of 25 places in 304 ms of which 5 ms to minimize.
[2025-05-29 20:19:26] [INFO ] Deduced a trap composed of 27 places in 324 ms of which 4 ms to minimize.
[2025-05-29 20:19:26] [INFO ] Deduced a trap composed of 25 places in 322 ms of which 5 ms to minimize.
[2025-05-29 20:19:27] [INFO ] Deduced a trap composed of 28 places in 269 ms of which 4 ms to minimize.
[2025-05-29 20:19:27] [INFO ] Deduced a trap composed of 26 places in 264 ms of which 3 ms to minimize.
[2025-05-29 20:19:27] [INFO ] Deduced a trap composed of 25 places in 235 ms of which 3 ms to minimize.
[2025-05-29 20:19:27] [INFO ] Deduced a trap composed of 26 places in 211 ms of which 3 ms to minimize.
[2025-05-29 20:19:28] [INFO ] Deduced a trap composed of 25 places in 215 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/522 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
[2025-05-29 20:19:29] [INFO ] Deduced a trap composed of 29 places in 139 ms of which 3 ms to minimize.
[2025-05-29 20:19:29] [INFO ] Deduced a trap composed of 27 places in 168 ms of which 2 ms to minimize.
[2025-05-29 20:19:29] [INFO ] Deduced a trap composed of 27 places in 181 ms of which 3 ms to minimize.
[2025-05-29 20:19:29] [INFO ] Deduced a trap composed of 30 places in 167 ms of which 3 ms to minimize.
[2025-05-29 20:19:30] [INFO ] Deduced a trap composed of 26 places in 173 ms of which 3 ms to minimize.
[2025-05-29 20:19:30] [INFO ] Deduced a trap composed of 26 places in 164 ms of which 3 ms to minimize.
[2025-05-29 20:19:30] [INFO ] Deduced a trap composed of 26 places in 203 ms of which 2 ms to minimize.
[2025-05-29 20:19:30] [INFO ] Deduced a trap composed of 29 places in 241 ms of which 3 ms to minimize.
[2025-05-29 20:19:30] [INFO ] Deduced a trap composed of 29 places in 173 ms of which 2 ms to minimize.
[2025-05-29 20:19:31] [INFO ] Deduced a trap composed of 28 places in 170 ms of which 3 ms to minimize.
[2025-05-29 20:19:31] [INFO ] Deduced a trap composed of 29 places in 153 ms of which 3 ms to minimize.
[2025-05-29 20:19:31] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 2 ms to minimize.
[2025-05-29 20:19:31] [INFO ] Deduced a trap composed of 29 places in 279 ms of which 5 ms to minimize.
[2025-05-29 20:19:32] [INFO ] Deduced a trap composed of 29 places in 267 ms of which 4 ms to minimize.
[2025-05-29 20:19:32] [INFO ] Deduced a trap composed of 29 places in 275 ms of which 4 ms to minimize.
[2025-05-29 20:19:32] [INFO ] Deduced a trap composed of 31 places in 272 ms of which 4 ms to minimize.
[2025-05-29 20:19:32] [INFO ] Deduced a trap composed of 25 places in 235 ms of which 3 ms to minimize.
[2025-05-29 20:19:33] [INFO ] Deduced a trap composed of 30 places in 168 ms of which 3 ms to minimize.
[2025-05-29 20:19:33] [INFO ] Deduced a trap composed of 25 places in 177 ms of which 3 ms to minimize.
[2025-05-29 20:19:33] [INFO ] Deduced a trap composed of 31 places in 148 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/522 variables, 20/87 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
[2025-05-29 20:19:35] [INFO ] Deduced a trap composed of 29 places in 238 ms of which 3 ms to minimize.
[2025-05-29 20:19:35] [INFO ] Deduced a trap composed of 31 places in 209 ms of which 3 ms to minimize.
[2025-05-29 20:19:35] [INFO ] Deduced a trap composed of 30 places in 205 ms of which 3 ms to minimize.
[2025-05-29 20:19:36] [INFO ] Deduced a trap composed of 26 places in 198 ms of which 3 ms to minimize.
[2025-05-29 20:19:36] [INFO ] Deduced a trap composed of 30 places in 229 ms of which 3 ms to minimize.
[2025-05-29 20:19:36] [INFO ] Deduced a trap composed of 30 places in 207 ms of which 3 ms to minimize.
[2025-05-29 20:19:36] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 2 ms to minimize.
[2025-05-29 20:19:36] [INFO ] Deduced a trap composed of 32 places in 206 ms of which 3 ms to minimize.
[2025-05-29 20:19:37] [INFO ] Deduced a trap composed of 36 places in 213 ms of which 3 ms to minimize.
[2025-05-29 20:19:37] [INFO ] Deduced a trap composed of 29 places in 171 ms of which 3 ms to minimize.
[2025-05-29 20:19:37] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 2 ms to minimize.
[2025-05-29 20:19:37] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 522/2189 variables, and 99 constraints, problems are : Problem set: 0 solved, 1646 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/523 constraints, ReadFeed: 0/1604 constraints, PredecessorRefiner: 0/1646 constraints, Known Traps: 77/77 constraints]
After SMT, in 61060ms problems are : Problem set: 0 solved, 1646 unsolved
Search for dead transitions found 0 dead transitions in 61078ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70023 ms. Remains : 523/523 places, 1666/1666 transitions.
[2025-05-29 20:19:37] [INFO ] Flatten gal took : 116 ms
[2025-05-29 20:19:37] [INFO ] Flatten gal took : 127 ms
[2025-05-29 20:19:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality450168988522492691.gal : 27 ms
[2025-05-29 20:19:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3132679958813243536.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/ReachabilityCardinality450168988522492691.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3132679958813243536.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 ...327
RANDOM walk for 40000 steps (418 resets) in 1455 ms. (27 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality3132679958813243536.prop.
BEST_FIRST walk for 40004 steps (18 resets) in 120 ms. (330 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (16 resets) in 160 ms. (248 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 147
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :147 after 150
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :150 after 151
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :151 after 155
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :155 after 156
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :156 after 157
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :157 after 163
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :163 after 174
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :174 after 199
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :199 after 235
Interrupted probabilistic random walk after 257074 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :0 out of 2
Probabilistic random walk after 257074 steps, saw 37360 distinct states, run finished after 3004 ms. (steps per millisecond=85 ) properties seen :0
[2025-05-29 20:19:41] [INFO ] Invariant cache hit.
[2025-05-29 20:19:41] [INFO ] State equation strengthened by 1604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 480/481 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-29 20:19:41] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 38/519 variables, 19/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/519 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/521 variables, 2/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :235 after 319
[2025-05-29 20:19:42] [INFO ] Deduced a trap composed of 25 places in 639 ms of which 8 ms to minimize.
[2025-05-29 20:19:42] [INFO ] Deduced a trap composed of 31 places in 624 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/521 variables, 2/25 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/521 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1666/2187 variables, 521/546 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2187 variables, 1604/2150 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2187 variables, 0/2150 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/2189 variables, 2/2152 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2189 variables, 0/2152 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2189 variables, 0/2152 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2189/2189 variables, and 2152 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2625 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 523/523 constraints, ReadFeed: 1604/1604 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :319 after 452
At refinement iteration 1 (OVERLAPS) 480/481 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 38/519 variables, 19/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/519 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/521 variables, 2/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/521 variables, 2/25 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-05-29 20:19:44] [INFO ] Deduced a trap composed of 31 places in 530 ms of which 6 ms to minimize.
[2025-05-29 20:19:45] [INFO ] Deduced a trap composed of 31 places in 508 ms of which 5 ms to minimize.
[2025-05-29 20:19:45] [INFO ] Deduced a trap composed of 31 places in 477 ms of which 5 ms to minimize.
[2025-05-29 20:19:46] [INFO ] Deduced a trap composed of 29 places in 456 ms of which 5 ms to minimize.
[2025-05-29 20:19:46] [INFO ] Deduced a trap composed of 28 places in 453 ms of which 5 ms to minimize.
[2025-05-29 20:19:47] [INFO ] Deduced a trap composed of 27 places in 496 ms of which 7 ms to minimize.
[2025-05-29 20:19:47] [INFO ] Deduced a trap composed of 26 places in 595 ms of which 7 ms to minimize.
[2025-05-29 20:19:48] [INFO ] Deduced a trap composed of 29 places in 547 ms of which 6 ms to minimize.
[2025-05-29 20:19:48] [INFO ] Deduced a trap composed of 29 places in 477 ms of which 5 ms to minimize.
[2025-05-29 20:19:49] [INFO ] Deduced a trap composed of 29 places in 549 ms of which 6 ms to minimize.
SMT process timed out in 8036ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 523 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1666/1666 transitions.
Applied a total of 0 rules in 43 ms. Remains 523 /523 variables (removed 0) and now considering 1666/1666 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 523/523 places, 1666/1666 transitions.
RANDOM walk for 40000 steps (420 resets) in 301 ms. (132 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (16 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :452 after 7462
Interrupted probabilistic random walk after 336572 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :0 out of 1
Probabilistic random walk after 336572 steps, saw 46255 distinct states, run finished after 3001 ms. (steps per millisecond=112 ) properties seen :0
[2025-05-29 20:19:52] [INFO ] Invariant cache hit.
[2025-05-29 20:19:52] [INFO ] State equation strengthened by 1604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 480/481 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:19:52] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2025-05-29 20:19:52] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2025-05-29 20:19:52] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2025-05-29 20:19:52] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2025-05-29 20:19:52] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2025-05-29 20:19:52] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2025-05-29 20:19:53] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2025-05-29 20:19:53] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
[2025-05-29 20:19:53] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2025-05-29 20:19:53] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 0 ms to minimize.
[2025-05-29 20:19:53] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2025-05-29 20:19:53] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2025-05-29 20:19:53] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2025-05-29 20:19:53] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2025-05-29 20:19:53] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 0 ms to minimize.
[2025-05-29 20:19:53] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 38/519 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/519 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/521 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/521 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1666/2187 variables, 521/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2187 variables, 1604/2163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2187 variables, 0/2163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/2189 variables, 2/2165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2189 variables, 0/2165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/2189 variables, 0/2165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2189/2189 variables, and 2165 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2068 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 523/523 constraints, ReadFeed: 1604/1604 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 480/481 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:19:54] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
[2025-05-29 20:19:54] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 1 ms to minimize.
[2025-05-29 20:19:54] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/481 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 38/519 variables, 19/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/519 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/521 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:19:55] [INFO ] Deduced a trap composed of 25 places in 433 ms of which 5 ms to minimize.
[2025-05-29 20:19:55] [INFO ] Deduced a trap composed of 25 places in 425 ms of which 5 ms to minimize.
[2025-05-29 20:19:56] [INFO ] Deduced a trap composed of 25 places in 436 ms of which 5 ms to minimize.
[2025-05-29 20:19:56] [INFO ] Deduced a trap composed of 25 places in 434 ms of which 5 ms to minimize.
[2025-05-29 20:19:57] [INFO ] Deduced a trap composed of 29 places in 450 ms of which 4 ms to minimize.
[2025-05-29 20:19:57] [INFO ] Deduced a trap composed of 26 places in 437 ms of which 5 ms to minimize.
[2025-05-29 20:19:58] [INFO ] Deduced a trap composed of 25 places in 434 ms of which 5 ms to minimize.
[2025-05-29 20:19:58] [INFO ] Deduced a trap composed of 26 places in 411 ms of which 5 ms to minimize.
[2025-05-29 20:19:59] [INFO ] Deduced a trap composed of 25 places in 540 ms of which 6 ms to minimize.
[2025-05-29 20:19:59] [INFO ] Deduced a trap composed of 32 places in 522 ms of which 5 ms to minimize.
[2025-05-29 20:20:00] [INFO ] Deduced a trap composed of 29 places in 477 ms of which 6 ms to minimize.
[2025-05-29 20:20:00] [INFO ] Deduced a trap composed of 26 places in 535 ms of which 6 ms to minimize.
[2025-05-29 20:20:01] [INFO ] Deduced a trap composed of 26 places in 519 ms of which 5 ms to minimize.
[2025-05-29 20:20:01] [INFO ] Deduced a trap composed of 28 places in 501 ms of which 6 ms to minimize.
[2025-05-29 20:20:02] [INFO ] Deduced a trap composed of 26 places in 568 ms of which 5 ms to minimize.
[2025-05-29 20:20:02] [INFO ] Deduced a trap composed of 25 places in 602 ms of which 5 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 32768
[2025-05-29 20:20:04] [INFO ] Deduced a trap composed of 25 places in 1084 ms of which 7 ms to minimize.
SDD size :7462 after 9175
[2025-05-29 20:20:04] [INFO ] Deduced a trap composed of 32 places in 618 ms of which 7 ms to minimize.
[2025-05-29 20:20:05] [INFO ] Deduced a trap composed of 31 places in 586 ms of which 7 ms to minimize.
[2025-05-29 20:20:05] [INFO ] Deduced a trap composed of 25 places in 520 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/521 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:20:06] [INFO ] Deduced a trap composed of 25 places in 476 ms of which 6 ms to minimize.
[2025-05-29 20:20:06] [INFO ] Deduced a trap composed of 24 places in 408 ms of which 5 ms to minimize.
[2025-05-29 20:20:07] [INFO ] Deduced a trap composed of 25 places in 363 ms of which 5 ms to minimize.
[2025-05-29 20:20:07] [INFO ] Deduced a trap composed of 25 places in 351 ms of which 5 ms to minimize.
[2025-05-29 20:20:07] [INFO ] Deduced a trap composed of 25 places in 384 ms of which 4 ms to minimize.
[2025-05-29 20:20:08] [INFO ] Deduced a trap composed of 25 places in 302 ms of which 4 ms to minimize.
[2025-05-29 20:20:08] [INFO ] Deduced a trap composed of 25 places in 267 ms of which 3 ms to minimize.
[2025-05-29 20:20:08] [INFO ] Deduced a trap composed of 28 places in 246 ms of which 3 ms to minimize.
[2025-05-29 20:20:09] [INFO ] Deduced a trap composed of 25 places in 249 ms of which 3 ms to minimize.
[2025-05-29 20:20:09] [INFO ] Deduced a trap composed of 27 places in 224 ms of which 3 ms to minimize.
[2025-05-29 20:20:09] [INFO ] Deduced a trap composed of 30 places in 235 ms of which 4 ms to minimize.
[2025-05-29 20:20:09] [INFO ] Deduced a trap composed of 29 places in 274 ms of which 4 ms to minimize.
[2025-05-29 20:20:10] [INFO ] Deduced a trap composed of 29 places in 231 ms of which 2 ms to minimize.
[2025-05-29 20:20:10] [INFO ] Deduced a trap composed of 29 places in 202 ms of which 2 ms to minimize.
[2025-05-29 20:20:10] [INFO ] Deduced a trap composed of 29 places in 205 ms of which 3 ms to minimize.
[2025-05-29 20:20:10] [INFO ] Deduced a trap composed of 29 places in 192 ms of which 3 ms to minimize.
[2025-05-29 20:20:10] [INFO ] Deduced a trap composed of 34 places in 173 ms of which 3 ms to minimize.
[2025-05-29 20:20:10] [INFO ] Deduced a trap composed of 29 places in 150 ms of which 2 ms to minimize.
[2025-05-29 20:20:11] [INFO ] Deduced a trap composed of 33 places in 150 ms of which 3 ms to minimize.
[2025-05-29 20:20:11] [INFO ] Deduced a trap composed of 34 places in 146 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/521 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:20:11] [INFO ] Deduced a trap composed of 35 places in 192 ms of which 4 ms to minimize.
[2025-05-29 20:20:11] [INFO ] Deduced a trap composed of 29 places in 176 ms of which 4 ms to minimize.
[2025-05-29 20:20:11] [INFO ] Deduced a trap composed of 30 places in 224 ms of which 4 ms to minimize.
[2025-05-29 20:20:12] [INFO ] Deduced a trap composed of 34 places in 210 ms of which 3 ms to minimize.
[2025-05-29 20:20:12] [INFO ] Deduced a trap composed of 32 places in 192 ms of which 3 ms to minimize.
[2025-05-29 20:20:12] [INFO ] Deduced a trap composed of 32 places in 191 ms of which 3 ms to minimize.
[2025-05-29 20:20:12] [INFO ] Deduced a trap composed of 31 places in 192 ms of which 3 ms to minimize.
[2025-05-29 20:20:12] [INFO ] Deduced a trap composed of 32 places in 162 ms of which 2 ms to minimize.
[2025-05-29 20:20:13] [INFO ] Deduced a trap composed of 33 places in 133 ms of which 2 ms to minimize.
[2025-05-29 20:20:13] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 2 ms to minimize.
[2025-05-29 20:20:13] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 2 ms to minimize.
[2025-05-29 20:20:13] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 2 ms to minimize.
[2025-05-29 20:20:13] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 2 ms to minimize.
[2025-05-29 20:20:13] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 2 ms to minimize.
[2025-05-29 20:20:13] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 2 ms to minimize.
[2025-05-29 20:20:13] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 2 ms to minimize.
[2025-05-29 20:20:14] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 1 ms to minimize.
[2025-05-29 20:20:14] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 2 ms to minimize.
[2025-05-29 20:20:14] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 1 ms to minimize.
[2025-05-29 20:20:14] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/521 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:20:14] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 1 ms to minimize.
[2025-05-29 20:20:14] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 2 ms to minimize.
[2025-05-29 20:20:14] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/521 variables, 3/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/521 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1666/2187 variables, 521/625 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2187 variables, 1604/2229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2187 variables, 1/2230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2187 variables, 0/2230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/2189 variables, 2/2232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2189 variables, 0/2232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/2189 variables, 0/2232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2189/2189 variables, and 2232 constraints, problems are : Problem set: 0 solved, 1 unsolved in 21266 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 523/523 constraints, ReadFeed: 1604/1604 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 82/82 constraints]
After SMT, in 23371ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 523 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1666/1666 transitions.
Applied a total of 0 rules in 28 ms. Remains 523 /523 variables (removed 0) and now considering 1666/1666 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 523/523 places, 1666/1666 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1666/1666 transitions.
Applied a total of 0 rules in 27 ms. Remains 523 /523 variables (removed 0) and now considering 1666/1666 (removed 0) transitions.
[2025-05-29 20:20:15] [INFO ] Invariant cache hit.
[2025-05-29 20:20:16] [INFO ] Implicit Places using invariants in 763 ms returned []
[2025-05-29 20:20:16] [INFO ] Invariant cache hit.
[2025-05-29 20:20:17] [INFO ] State equation strengthened by 1604 read => feed constraints.
[2025-05-29 20:20:24] [INFO ] Implicit Places using invariants and state equation in 7549 ms returned []
Implicit Place search using SMT with State Equation took 8318 ms to find 0 implicit places.
[2025-05-29 20:20:24] [INFO ] Redundant transitions in 55 ms returned []
Running 1646 sub problems to find dead transitions.
[2025-05-29 20:20:24] [INFO ] Invariant cache hit.
[2025-05-29 20:20:24] [INFO ] State equation strengthened by 1604 read => feed constraints.
Detected timeout of ITS tools.
[2025-05-29 20:20:28] [INFO ] Flatten gal took : 35 ms
[2025-05-29 20:20:28] [INFO ] Applying decomposition
[2025-05-29 20:20:28] [INFO ] Flatten gal took : 36 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/graph15753091972909446347.txt' '-o' '/tmp/graph15753091972909446347.bin' '-w' '/tmp/graph15753091972909446347.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15753091972909446347.bin' '-l' '-1' '-v' '-w' '/tmp/graph15753091972909446347.weights' '-q' '0' '-e' '0.001'
[2025-05-29 20:20:28] [INFO ] Decomposing Gal with order
[2025-05-29 20:20:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 20:20:28] [INFO ] Removed a total of 1283 redundant transitions.
[2025-05-29 20:20:28] [INFO ] Flatten gal took : 83 ms
[2025-05-29 20:20:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 1396 labels/synchronizations in 47 ms.
[2025-05-29 20:20:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2508676764089696669.gal : 20 ms
[2025-05-29 20:20:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13202373442224389670.prop : 0 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/ReachabilityCardinality2508676764089696669.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13202373442224389670.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 ...308
Loading property file /tmp/ReachabilityCardinality13202373442224389670.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 971
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :971 after 971
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :971 after 971
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :971 after 971
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :971 after 971
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :971 after 971
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :971 after 1000
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1000 after 1008
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1008 after 1102
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1102 after 109656
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :109656 after 1.03689e+07
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.03689e+07 after 1.13516e+07
At refinement iteration 0 (INCLUDED_ONLY) 0/522 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/522 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
[2025-05-29 20:20:48] [INFO ] Deduced a trap composed of 30 places in 260 ms of which 3 ms to minimize.
[2025-05-29 20:20:49] [INFO ] Deduced a trap composed of 28 places in 282 ms of which 4 ms to minimize.
[2025-05-29 20:20:49] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 2 ms to minimize.
[2025-05-29 20:20:49] [INFO ] Deduced a trap composed of 2 places in 497 ms of which 6 ms to minimize.
[2025-05-29 20:20:50] [INFO ] Deduced a trap composed of 25 places in 349 ms of which 5 ms to minimize.
[2025-05-29 20:20:50] [INFO ] Deduced a trap composed of 26 places in 325 ms of which 5 ms to minimize.
[2025-05-29 20:20:50] [INFO ] Deduced a trap composed of 32 places in 332 ms of which 4 ms to minimize.
[2025-05-29 20:20:51] [INFO ] Deduced a trap composed of 32 places in 368 ms of which 5 ms to minimize.
[2025-05-29 20:20:51] [INFO ] Deduced a trap composed of 30 places in 351 ms of which 4 ms to minimize.
[2025-05-29 20:20:51] [INFO ] Deduced a trap composed of 32 places in 348 ms of which 5 ms to minimize.
[2025-05-29 20:20:52] [INFO ] Deduced a trap composed of 28 places in 320 ms of which 5 ms to minimize.
[2025-05-29 20:20:52] [INFO ] Deduced a trap composed of 32 places in 355 ms of which 5 ms to minimize.
[2025-05-29 20:20:52] [INFO ] Deduced a trap composed of 29 places in 348 ms of which 4 ms to minimize.
[2025-05-29 20:20:53] [INFO ] Deduced a trap composed of 30 places in 319 ms of which 4 ms to minimize.
[2025-05-29 20:20:53] [INFO ] Deduced a trap composed of 27 places in 286 ms of which 4 ms to minimize.
[2025-05-29 20:20:53] [INFO ] Deduced a trap composed of 30 places in 260 ms of which 4 ms to minimize.
[2025-05-29 20:20:54] [INFO ] Deduced a trap composed of 31 places in 294 ms of which 4 ms to minimize.
[2025-05-29 20:20:54] [INFO ] Deduced a trap composed of 29 places in 315 ms of which 5 ms to minimize.
[2025-05-29 20:20:54] [INFO ] Deduced a trap composed of 29 places in 326 ms of which 4 ms to minimize.
[2025-05-29 20:20:55] [INFO ] Deduced a trap composed of 25 places in 319 ms of which 5 ms to minimize.
SMT process timed out in 30851ms, After SMT, problems are : Problem set: 0 solved, 1646 unsolved
Search for dead transitions found 0 dead transitions in 30877ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39290 ms. Remains : 523/523 places, 1666/1666 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1543 edges and 523 vertex of which 439 / 523 are part of one of the 2 SCC in 0 ms
Free SCC test removed 437 places
Drop transitions (Empty/Sink Transition effects.) removed 1165 transitions
Ensure Unique test removed 412 transitions
Reduce isomorphic transitions removed 1577 transitions.
Graph (complete) has 211 edges and 86 vertex of which 25 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.0 ms
Discarding 61 places :
Also discarding 19 output transitions
Drop transitions (Output transitions of discarded places.) removed 19 transitions
Drop transitions (Empty/Sink Transition effects.) removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 25 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 24 transition count 28
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 63 place count 6 transition count 10
Iterating global reduction 2 with 18 rules applied. Total rules applied 81 place count 6 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 83 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 86 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 4 transition count 5
Applied a total of 87 rules in 5 ms. Remains 4 /523 variables (removed 519) and now considering 5/1666 (removed 1661) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 4 cols
[2025-05-29 20:20:55] [INFO ] Computed 0 invariants in 0 ms
[2025-05-29 20:20:55] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-29 20:20:55] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-29 20:20:55] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-29 20:20:55] [INFO ] After 35ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-05-29 20:20:55] [INFO ] Flatten gal took : 1 ms
[2025-05-29 20:20:55] [INFO ] Flatten gal took : 1 ms
[2025-05-29 20:20:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18368262030029693408.gal : 2 ms
[2025-05-29 20:20:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9658074910331460347.prop : 0 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/ReachabilityCardinality18368262030029693408.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9658074910331460347.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 ...329
Loading property file /tmp/ReachabilityCardinality9658074910331460347.prop.
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 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,6,0.005076,3516,2,7,6,33,6,0,21,18,0
Total reachable state count : 6

Verifying 1 reachability properties.
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,0.00646,3892,2,5,6,33,7,0,24,18,0
Over-approximation ignoring read arcs solved 0 properties in 89 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[20]
Ending property specific reduction for CANInsertWithFailure-PT-020-UpperBounds-12 in 164290 ms.
Starting property specific reduction for CANInsertWithFailure-PT-020-UpperBounds-13
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[20]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[20]
// Phase 1: matrix 1674 rows 531 cols
[2025-05-29 20:20:55] [INFO ] Computed 22 invariants in 22 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[20]
RANDOM walk for 10000 steps (103 resets) in 84 ms. (117 steps per ms)
BEST_FIRST walk for 10001 steps (5 resets) in 17 ms. (555 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[20]
[2025-05-29 20:20:55] [INFO ] Invariant cache hit.
[2025-05-29 20:20:55] [INFO ] [Real]Absence check using 20 positive place invariants in 22 ms returned sat
[2025-05-29 20:20:55] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 9 ms returned sat
[2025-05-29 20:20:56] [INFO ] [Real]Absence check using state equation in 687 ms returned sat
[2025-05-29 20:20:56] [INFO ] State equation strengthened by 1582 read => feed constraints.
[2025-05-29 20:20:56] [INFO ] [Real]Added 1582 Read/Feed constraints in 250 ms returned sat
[2025-05-29 20:20:56] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:20:56] [INFO ] [Nat]Absence check using 20 positive place invariants in 19 ms returned sat
[2025-05-29 20:20:56] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 9 ms returned sat
[2025-05-29 20:20:57] [INFO ] [Nat]Absence check using state equation in 691 ms returned sat
[2025-05-29 20:20:57] [INFO ] [Nat]Added 1582 Read/Feed constraints in 297 ms returned sat
[2025-05-29 20:20:58] [INFO ] Computed and/alt/rep : 1160/3017/1160 causal constraints (skipped 494 transitions) in 118 ms.
[2025-05-29 20:20:58] [INFO ] Added : 6 causal constraints over 2 iterations in 410 ms. Result :sat
Minimization took 582 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[20]
Support contains 1 out of 531 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 531/531 places, 1674/1674 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 523 transition count 1666
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 523 transition count 1665
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 18 place count 522 transition count 1665
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 25 place count 522 transition count 1665
Applied a total of 25 rules in 160 ms. Remains 522 /531 variables (removed 9) and now considering 1665/1674 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 522/531 places, 1665/1674 transitions.
// Phase 1: matrix 1665 rows 522 cols
[2025-05-29 20:20:59] [INFO ] Computed 22 invariants in 23 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[20]
RANDOM walk for 1000000 steps (10548 resets) in 5308 ms. (188 steps per ms)
BEST_FIRST walk for 1000001 steps (475 resets) in 937 ms. (1066 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[20]
[2025-05-29 20:21:05] [INFO ] Invariant cache hit.
[2025-05-29 20:21:05] [INFO ] [Real]Absence check using 20 positive place invariants in 18 ms returned sat
[2025-05-29 20:21:05] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 8 ms returned sat
[2025-05-29 20:21:06] [INFO ] [Real]Absence check using state equation in 629 ms returned sat
[2025-05-29 20:21:06] [INFO ] State equation strengthened by 1605 read => feed constraints.
[2025-05-29 20:21:06] [INFO ] [Real]Added 1605 Read/Feed constraints in 219 ms returned sat
[2025-05-29 20:21:06] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:21:06] [INFO ] [Nat]Absence check using 20 positive place invariants in 15 ms returned sat
[2025-05-29 20:21:06] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 8 ms returned sat
[2025-05-29 20:21:07] [INFO ] [Nat]Absence check using state equation in 669 ms returned sat
[2025-05-29 20:21:07] [INFO ] [Nat]Added 1605 Read/Feed constraints in 218 ms returned sat
[2025-05-29 20:21:07] [INFO ] Computed and/alt/rep : 1151/3051/1151 causal constraints (skipped 494 transitions) in 116 ms.
[2025-05-29 20:21:08] [INFO ] Added : 6 causal constraints over 2 iterations in 427 ms. Result :sat
Minimization took 4088 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[20]
Support contains 1 out of 522 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 522/522 places, 1665/1665 transitions.
Applied a total of 0 rules in 27 ms. Remains 522 /522 variables (removed 0) and now considering 1665/1665 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 522/522 places, 1665/1665 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 522/522 places, 1665/1665 transitions.
Applied a total of 0 rules in 27 ms. Remains 522 /522 variables (removed 0) and now considering 1665/1665 (removed 0) transitions.
[2025-05-29 20:21:12] [INFO ] Invariant cache hit.
[2025-05-29 20:21:13] [INFO ] Implicit Places using invariants in 975 ms returned []
[2025-05-29 20:21:13] [INFO ] Invariant cache hit.
[2025-05-29 20:21:14] [INFO ] State equation strengthened by 1605 read => feed constraints.
[2025-05-29 20:21:21] [INFO ] Implicit Places using invariants and state equation in 7979 ms returned []
Implicit Place search using SMT with State Equation took 8954 ms to find 0 implicit places.
[2025-05-29 20:21:21] [INFO ] Redundant transitions in 36 ms returned []
Running 1645 sub problems to find dead transitions.
[2025-05-29 20:21:21] [INFO ] Invariant cache hit.
[2025-05-29 20:21:21] [INFO ] State equation strengthened by 1605 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/521 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/521 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
[2025-05-29 20:21:50] [INFO ] Deduced a trap composed of 25 places in 353 ms of which 5 ms to minimize.
[2025-05-29 20:21:50] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 2 ms to minimize.
[2025-05-29 20:21:51] [INFO ] Deduced a trap composed of 22 places in 651 ms of which 8 ms to minimize.
[2025-05-29 20:21:52] [INFO ] Deduced a trap composed of 2 places in 641 ms of which 7 ms to minimize.
SMT process timed out in 31204ms, After SMT, problems are : Problem set: 0 solved, 1645 unsolved
Search for dead transitions found 0 dead transitions in 31221ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40247 ms. Remains : 522/522 places, 1665/1665 transitions.
[2025-05-29 20:21:52] [INFO ] Flatten gal took : 211 ms
RANDOM walk for 40000 steps (419 resets) in 1160 ms. (34 steps per ms) remains 2/2 properties
[2025-05-29 20:21:52] [INFO ] Flatten gal took : 75 ms
BEST_FIRST walk for 40004 steps (18 resets) in 120 ms. (330 steps per ms) remains 2/2 properties
[2025-05-29 20:21:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12221461219810994593.gal : 25 ms
[2025-05-29 20:21:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3002770199285627397.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/ReachabilityCardinality12221461219810994593.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3002770199285627397.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 ...329
BEST_FIRST walk for 40004 steps (16 resets) in 142 ms. (279 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality3002770199285627397.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 147
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :147 after 150
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :150 after 151
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :151 after 155
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :155 after 156
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :156 after 157
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :157 after 163
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :163 after 174
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :174 after 199
Interrupted probabilistic random walk after 278693 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :0 out of 2
Probabilistic random walk after 278693 steps, saw 39907 distinct states, run finished after 3001 ms. (steps per millisecond=92 ) properties seen :0
[2025-05-29 20:21:55] [INFO ] Invariant cache hit.
[2025-05-29 20:21:55] [INFO ] State equation strengthened by 1605 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :199 after 235
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 479/480 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-29 20:21:56] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/480 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/480 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 38/518 variables, 19/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/518 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/520 variables, 2/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-05-29 20:21:56] [INFO ] Deduced a trap composed of 26 places in 456 ms of which 4 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :235 after 319
[2025-05-29 20:21:57] [INFO ] Deduced a trap composed of 27 places in 462 ms of which 5 ms to minimize.
[2025-05-29 20:21:57] [INFO ] Deduced a trap composed of 31 places in 431 ms of which 5 ms to minimize.
[2025-05-29 20:21:58] [INFO ] Deduced a trap composed of 30 places in 425 ms of which 5 ms to minimize.
[2025-05-29 20:21:58] [INFO ] Deduced a trap composed of 37 places in 409 ms of which 5 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :319 after 452
[2025-05-29 20:21:58] [INFO ] Deduced a trap composed of 27 places in 397 ms of which 5 ms to minimize.
[2025-05-29 20:21:59] [INFO ] Deduced a trap composed of 26 places in 385 ms of which 4 ms to minimize.
[2025-05-29 20:21:59] [INFO ] Deduced a trap composed of 25 places in 344 ms of which 4 ms to minimize.
[2025-05-29 20:21:59] [INFO ] Deduced a trap composed of 27 places in 332 ms of which 4 ms to minimize.
[2025-05-29 20:22:00] [INFO ] Deduced a trap composed of 25 places in 303 ms of which 3 ms to minimize.
[2025-05-29 20:22:00] [INFO ] Deduced a trap composed of 29 places in 269 ms of which 3 ms to minimize.
[2025-05-29 20:22:00] [INFO ] Deduced a trap composed of 29 places in 248 ms of which 3 ms to minimize.
[2025-05-29 20:22:01] [INFO ] Deduced a trap composed of 27 places in 247 ms of which 3 ms to minimize.
SMT process timed out in 5145ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 522 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 522/522 places, 1665/1665 transitions.
Applied a total of 0 rules in 28 ms. Remains 522 /522 variables (removed 0) and now considering 1665/1665 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 522/522 places, 1665/1665 transitions.
RANDOM walk for 40000 steps (419 resets) in 287 ms. (138 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (17 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 383805 steps, run timeout after 3001 ms. (steps per millisecond=127 ) properties seen :0 out of 1
Probabilistic random walk after 383805 steps, saw 51118 distinct states, run finished after 3001 ms. (steps per millisecond=127 ) properties seen :0
[2025-05-29 20:22:04] [INFO ] Invariant cache hit.
[2025-05-29 20:22:04] [INFO ] State equation strengthened by 1605 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 479/480 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:22:04] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
[2025-05-29 20:22:04] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
[2025-05-29 20:22:04] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 1 ms to minimize.
[2025-05-29 20:22:04] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 0 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 16384
[2025-05-29 20:22:04] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 1 ms to minimize.
SDD size :452 after 7468
[2025-05-29 20:22:04] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 0 ms to minimize.
[2025-05-29 20:22:04] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 1 ms to minimize.
[2025-05-29 20:22:04] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 1 ms to minimize.
[2025-05-29 20:22:04] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 1 ms to minimize.
[2025-05-29 20:22:04] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 0 ms to minimize.
[2025-05-29 20:22:04] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
[2025-05-29 20:22:04] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2025-05-29 20:22:04] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2025-05-29 20:22:04] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2025-05-29 20:22:04] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2025-05-29 20:22:04] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/480 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/480 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 38/518 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/518 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/520 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1665/2185 variables, 520/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2185 variables, 1605/2163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2185 variables, 0/2163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/2187 variables, 2/2165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2187 variables, 0/2165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/2187 variables, 0/2165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2187/2187 variables, and 2165 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1577 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 522/522 constraints, ReadFeed: 1605/1605 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 479/480 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/480 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:22:05] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2025-05-29 20:22:05] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2025-05-29 20:22:05] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/480 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 38/518 variables, 19/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/518 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/520 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:22:06] [INFO ] Deduced a trap composed of 31 places in 441 ms of which 5 ms to minimize.
[2025-05-29 20:22:06] [INFO ] Deduced a trap composed of 30 places in 440 ms of which 5 ms to minimize.
[2025-05-29 20:22:07] [INFO ] Deduced a trap composed of 27 places in 431 ms of which 5 ms to minimize.
[2025-05-29 20:22:07] [INFO ] Deduced a trap composed of 26 places in 411 ms of which 4 ms to minimize.
[2025-05-29 20:22:08] [INFO ] Deduced a trap composed of 27 places in 445 ms of which 5 ms to minimize.
[2025-05-29 20:22:08] [INFO ] Deduced a trap composed of 25 places in 441 ms of which 4 ms to minimize.
[2025-05-29 20:22:09] [INFO ] Deduced a trap composed of 43 places in 444 ms of which 5 ms to minimize.
[2025-05-29 20:22:09] [INFO ] Deduced a trap composed of 33 places in 452 ms of which 5 ms to minimize.
[2025-05-29 20:22:10] [INFO ] Deduced a trap composed of 25 places in 439 ms of which 4 ms to minimize.
[2025-05-29 20:22:10] [INFO ] Deduced a trap composed of 29 places in 447 ms of which 5 ms to minimize.
[2025-05-29 20:22:11] [INFO ] Deduced a trap composed of 26 places in 444 ms of which 4 ms to minimize.
[2025-05-29 20:22:11] [INFO ] Deduced a trap composed of 30 places in 448 ms of which 5 ms to minimize.
[2025-05-29 20:22:11] [INFO ] Deduced a trap composed of 25 places in 439 ms of which 4 ms to minimize.
[2025-05-29 20:22:12] [INFO ] Deduced a trap composed of 25 places in 446 ms of which 4 ms to minimize.
[2025-05-29 20:22:12] [INFO ] Deduced a trap composed of 25 places in 444 ms of which 4 ms to minimize.
[2025-05-29 20:22:13] [INFO ] Deduced a trap composed of 28 places in 447 ms of which 5 ms to minimize.
[2025-05-29 20:22:13] [INFO ] Deduced a trap composed of 28 places in 444 ms of which 5 ms to minimize.
[2025-05-29 20:22:14] [INFO ] Deduced a trap composed of 25 places in 440 ms of which 5 ms to minimize.
[2025-05-29 20:22:14] [INFO ] Deduced a trap composed of 29 places in 442 ms of which 4 ms to minimize.
[2025-05-29 20:22:15] [INFO ] Deduced a trap composed of 27 places in 448 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:22:15] [INFO ] Deduced a trap composed of 31 places in 405 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/520 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/520 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1665/2185 variables, 520/582 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2185 variables, 1605/2187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2185 variables, 1/2188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2185 variables, 0/2188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/2187 variables, 2/2190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2187 variables, 0/2190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2187 variables, 0/2190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2187/2187 variables, and 2190 constraints, problems are : Problem set: 0 solved, 1 unsolved in 10928 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 522/522 constraints, ReadFeed: 1605/1605 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 40/40 constraints]
After SMT, in 12526ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 27 ms.
Support contains 1 out of 522 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 522/522 places, 1665/1665 transitions.
Applied a total of 0 rules in 28 ms. Remains 522 /522 variables (removed 0) and now considering 1665/1665 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 522/522 places, 1665/1665 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 522/522 places, 1665/1665 transitions.
Applied a total of 0 rules in 41 ms. Remains 522 /522 variables (removed 0) and now considering 1665/1665 (removed 0) transitions.
[2025-05-29 20:22:16] [INFO ] Invariant cache hit.
[2025-05-29 20:22:17] [INFO ] Implicit Places using invariants in 761 ms returned []
[2025-05-29 20:22:17] [INFO ] Invariant cache hit.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :7468 after 9180
[2025-05-29 20:22:18] [INFO ] State equation strengthened by 1605 read => feed constraints.
[2025-05-29 20:22:24] [INFO ] Implicit Places using invariants and state equation in 7354 ms returned []
Implicit Place search using SMT with State Equation took 8122 ms to find 0 implicit places.
[2025-05-29 20:22:24] [INFO ] Redundant transitions in 38 ms returned []
Running 1645 sub problems to find dead transitions.
[2025-05-29 20:22:25] [INFO ] Invariant cache hit.
[2025-05-29 20:22:25] [INFO ] State equation strengthened by 1605 read => feed constraints.
Detected timeout of ITS tools.
[2025-05-29 20:22:42] [INFO ] Flatten gal took : 35 ms
[2025-05-29 20:22:42] [INFO ] Applying decomposition
[2025-05-29 20:22:43] [INFO ] Flatten gal took : 36 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/graph11400762580594372559.txt' '-o' '/tmp/graph11400762580594372559.bin' '-w' '/tmp/graph11400762580594372559.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11400762580594372559.bin' '-l' '-1' '-v' '-w' '/tmp/graph11400762580594372559.weights' '-q' '0' '-e' '0.001'
[2025-05-29 20:22:43] [INFO ] Decomposing Gal with order
[2025-05-29 20:22:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 20:22:43] [INFO ] Removed a total of 1284 redundant transitions.
[2025-05-29 20:22:43] [INFO ] Flatten gal took : 82 ms
[2025-05-29 20:22:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 1390 labels/synchronizations in 29 ms.
[2025-05-29 20:22:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14341229439914299339.gal : 14 ms
[2025-05-29 20:22:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7696038982717520350.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/ReachabilityCardinality14341229439914299339.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7696038982717520350.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 ...308
Loading property file /tmp/ReachabilityCardinality7696038982717520350.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 866
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :866 after 866
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :866 after 866
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :866 after 866
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :866 after 879
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :879 after 887
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :887 after 891
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :891 after 899
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :899 after 1087
At refinement iteration 0 (INCLUDED_ONLY) 0/521 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/521 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
[2025-05-29 20:22:45] [INFO ] Deduced a trap composed of 25 places in 309 ms of which 5 ms to minimize.
[2025-05-29 20:22:45] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1087 after 203364
[2025-05-29 20:22:46] [INFO ] Deduced a trap composed of 22 places in 546 ms of which 7 ms to minimize.
[2025-05-29 20:22:46] [INFO ] Deduced a trap composed of 2 places in 495 ms of which 6 ms to minimize.
[2025-05-29 20:22:47] [INFO ] Deduced a trap composed of 22 places in 484 ms of which 6 ms to minimize.
[2025-05-29 20:22:47] [INFO ] Deduced a trap composed of 22 places in 431 ms of which 5 ms to minimize.
[2025-05-29 20:22:48] [INFO ] Deduced a trap composed of 22 places in 405 ms of which 5 ms to minimize.
[2025-05-29 20:22:48] [INFO ] Deduced a trap composed of 22 places in 362 ms of which 5 ms to minimize.
[2025-05-29 20:22:48] [INFO ] Deduced a trap composed of 25 places in 336 ms of which 4 ms to minimize.
[2025-05-29 20:22:49] [INFO ] Deduced a trap composed of 2 places in 329 ms of which 4 ms to minimize.
[2025-05-29 20:22:49] [INFO ] Deduced a trap composed of 25 places in 236 ms of which 3 ms to minimize.
[2025-05-29 20:22:49] [INFO ] Deduced a trap composed of 25 places in 196 ms of which 2 ms to minimize.
[2025-05-29 20:22:49] [INFO ] Deduced a trap composed of 27 places in 164 ms of which 3 ms to minimize.
[2025-05-29 20:22:49] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 2 ms to minimize.
[2025-05-29 20:22:50] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 3 ms to minimize.
[2025-05-29 20:22:50] [INFO ] Deduced a trap composed of 29 places in 135 ms of which 3 ms to minimize.
[2025-05-29 20:22:50] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 2 ms to minimize.
[2025-05-29 20:22:50] [INFO ] Deduced a trap composed of 25 places in 188 ms of which 3 ms to minimize.
[2025-05-29 20:22:50] [INFO ] Deduced a trap composed of 29 places in 197 ms of which 3 ms to minimize.
[2025-05-29 20:22:51] [INFO ] Deduced a trap composed of 26 places in 224 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/521 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
[2025-05-29 20:22:52] [INFO ] Deduced a trap composed of 27 places in 321 ms of which 4 ms to minimize.
[2025-05-29 20:22:52] [INFO ] Deduced a trap composed of 27 places in 370 ms of which 60 ms to minimize.
[2025-05-29 20:22:52] [INFO ] Deduced a trap composed of 27 places in 301 ms of which 3 ms to minimize.
[2025-05-29 20:22:53] [INFO ] Deduced a trap composed of 27 places in 299 ms of which 3 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :203364 after 9.1468e+06
[2025-05-29 20:22:53] [INFO ] Deduced a trap composed of 26 places in 294 ms of which 5 ms to minimize.
[2025-05-29 20:22:53] [INFO ] Deduced a trap composed of 27 places in 317 ms of which 4 ms to minimize.
[2025-05-29 20:22:54] [INFO ] Deduced a trap composed of 27 places in 286 ms of which 3 ms to minimize.
[2025-05-29 20:22:54] [INFO ] Deduced a trap composed of 36 places in 193 ms of which 3 ms to minimize.
[2025-05-29 20:22:54] [INFO ] Deduced a trap composed of 27 places in 246 ms of which 3 ms to minimize.
[2025-05-29 20:22:54] [INFO ] Deduced a trap composed of 26 places in 222 ms of which 4 ms to minimize.
[2025-05-29 20:22:54] [INFO ] Deduced a trap composed of 28 places in 201 ms of which 3 ms to minimize.
[2025-05-29 20:22:55] [INFO ] Deduced a trap composed of 28 places in 166 ms of which 3 ms to minimize.
[2025-05-29 20:22:55] [INFO ] Deduced a trap composed of 27 places in 197 ms of which 2 ms to minimize.
[2025-05-29 20:22:55] [INFO ] Deduced a trap composed of 27 places in 181 ms of which 2 ms to minimize.
[2025-05-29 20:22:55] [INFO ] Deduced a trap composed of 28 places in 179 ms of which 3 ms to minimize.
[2025-05-29 20:22:55] [INFO ] Deduced a trap composed of 28 places in 162 ms of which 2 ms to minimize.
SMT process timed out in 30908ms, After SMT, problems are : Problem set: 0 solved, 1645 unsolved
Search for dead transitions found 0 dead transitions in 30926ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39142 ms. Remains : 522/522 places, 1665/1665 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1542 edges and 522 vertex of which 438 / 522 are part of one of the 2 SCC in 0 ms
Free SCC test removed 436 places
Drop transitions (Empty/Sink Transition effects.) removed 1164 transitions
Ensure Unique test removed 412 transitions
Reduce isomorphic transitions removed 1576 transitions.
Graph (complete) has 211 edges and 86 vertex of which 25 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.0 ms
Discarding 61 places :
Also discarding 19 output transitions
Drop transitions (Output transitions of discarded places.) removed 19 transitions
Drop transitions (Empty/Sink Transition effects.) removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 25 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 24 transition count 28
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 63 place count 6 transition count 10
Iterating global reduction 2 with 18 rules applied. Total rules applied 81 place count 6 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 83 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 86 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 4 transition count 5
Applied a total of 87 rules in 9 ms. Remains 4 /522 variables (removed 518) and now considering 5/1665 (removed 1660) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 4 cols
[2025-05-29 20:22:55] [INFO ] Computed 0 invariants in 0 ms
[2025-05-29 20:22:55] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-29 20:22:55] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-29 20:22:55] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-29 20:22:55] [INFO ] After 33ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-05-29 20:22:56] [INFO ] Flatten gal took : 1 ms
[2025-05-29 20:22:56] [INFO ] Flatten gal took : 0 ms
[2025-05-29 20:22:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17768576811448739662.gal : 0 ms
[2025-05-29 20:22:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15817242400174107542.prop : 0 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/ReachabilityCardinality17768576811448739662.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15817242400174107542.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 ...330
Loading property file /tmp/ReachabilityCardinality15817242400174107542.prop.
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 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,6,0.0025,3516,2,7,6,33,6,0,21,18,0
Total reachable state count : 6

Verifying 1 reachability properties.
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,0.002874,3892,2,5,6,33,7,0,24,18,0
Over-approximation ignoring read arcs solved 0 properties in 80 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[20]
Ending property specific reduction for CANInsertWithFailure-PT-020-UpperBounds-13 in 120692 ms.
Starting property specific reduction for CANInsertWithFailure-PT-020-UpperBounds-14
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[20]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[20]
// Phase 1: matrix 1674 rows 531 cols
[2025-05-29 20:22:56] [INFO ] Computed 22 invariants in 13 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[20]
RANDOM walk for 10000 steps (106 resets) in 53 ms. (185 steps per ms)
BEST_FIRST walk for 10001 steps (4 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[20]
[2025-05-29 20:22:56] [INFO ] Invariant cache hit.
[2025-05-29 20:22:56] [INFO ] [Real]Absence check using 20 positive place invariants in 13 ms returned sat
[2025-05-29 20:22:56] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2025-05-29 20:22:56] [INFO ] [Real]Absence check using state equation in 467 ms returned sat
[2025-05-29 20:22:56] [INFO ] State equation strengthened by 1582 read => feed constraints.
[2025-05-29 20:22:56] [INFO ] [Real]Added 1582 Read/Feed constraints in 196 ms returned sat
[2025-05-29 20:22:57] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:22:57] [INFO ] [Nat]Absence check using 20 positive place invariants in 12 ms returned sat
[2025-05-29 20:22:57] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2025-05-29 20:22:57] [INFO ] [Nat]Absence check using state equation in 465 ms returned sat
[2025-05-29 20:22:57] [INFO ] [Nat]Added 1582 Read/Feed constraints in 214 ms returned sat
[2025-05-29 20:22:57] [INFO ] Computed and/alt/rep : 1160/3017/1160 causal constraints (skipped 494 transitions) in 138 ms.
[2025-05-29 20:22:58] [INFO ] Added : 8 causal constraints over 2 iterations in 464 ms. Result :sat
Minimization took 569 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[20]
Support contains 1 out of 531 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 531/531 places, 1674/1674 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 523 transition count 1666
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 523 transition count 1665
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 18 place count 522 transition count 1665
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 25 place count 522 transition count 1665
Applied a total of 25 rules in 103 ms. Remains 522 /531 variables (removed 9) and now considering 1665/1674 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 522/531 places, 1665/1674 transitions.
// Phase 1: matrix 1665 rows 522 cols
[2025-05-29 20:22:58] [INFO ] Computed 22 invariants in 14 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[20]
RANDOM walk for 1000000 steps (10556 resets) in 4964 ms. (201 steps per ms)
BEST_FIRST walk for 1000001 steps (472 resets) in 931 ms. (1072 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[20]
[2025-05-29 20:23:04] [INFO ] Invariant cache hit.
[2025-05-29 20:23:04] [INFO ] [Real]Absence check using 20 positive place invariants in 13 ms returned sat
[2025-05-29 20:23:04] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2025-05-29 20:23:05] [INFO ] [Real]Absence check using state equation in 441 ms returned sat
[2025-05-29 20:23:05] [INFO ] State equation strengthened by 1605 read => feed constraints.
[2025-05-29 20:23:05] [INFO ] [Real]Added 1605 Read/Feed constraints in 173 ms returned sat
[2025-05-29 20:23:05] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:23:05] [INFO ] [Nat]Absence check using 20 positive place invariants in 15 ms returned sat
[2025-05-29 20:23:05] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2025-05-29 20:23:06] [INFO ] [Nat]Absence check using state equation in 439 ms returned sat
[2025-05-29 20:23:06] [INFO ] [Nat]Added 1605 Read/Feed constraints in 191 ms returned sat
[2025-05-29 20:23:06] [INFO ] Computed and/alt/rep : 1151/3051/1151 causal constraints (skipped 494 transitions) in 134 ms.
[2025-05-29 20:23:06] [INFO ] Added : 6 causal constraints over 2 iterations in 469 ms. Result :sat
Minimization took 4404 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[20]
Support contains 1 out of 522 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 522/522 places, 1665/1665 transitions.
Applied a total of 0 rules in 27 ms. Remains 522 /522 variables (removed 0) and now considering 1665/1665 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 522/522 places, 1665/1665 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 522/522 places, 1665/1665 transitions.
Applied a total of 0 rules in 26 ms. Remains 522 /522 variables (removed 0) and now considering 1665/1665 (removed 0) transitions.
[2025-05-29 20:23:11] [INFO ] Invariant cache hit.
[2025-05-29 20:23:12] [INFO ] Implicit Places using invariants in 818 ms returned []
[2025-05-29 20:23:12] [INFO ] Invariant cache hit.
[2025-05-29 20:23:12] [INFO ] State equation strengthened by 1605 read => feed constraints.
[2025-05-29 20:23:19] [INFO ] Implicit Places using invariants and state equation in 7123 ms returned []
Implicit Place search using SMT with State Equation took 7943 ms to find 0 implicit places.
[2025-05-29 20:23:19] [INFO ] Redundant transitions in 35 ms returned []
Running 1645 sub problems to find dead transitions.
[2025-05-29 20:23:19] [INFO ] Invariant cache hit.
[2025-05-29 20:23:19] [INFO ] State equation strengthened by 1605 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/521 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/521 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
[2025-05-29 20:23:39] [INFO ] Deduced a trap composed of 25 places in 354 ms of which 5 ms to minimize.
[2025-05-29 20:23:39] [INFO ] Deduced a trap composed of 2 places in 409 ms of which 4 ms to minimize.
[2025-05-29 20:23:40] [INFO ] Deduced a trap composed of 33 places in 202 ms of which 4 ms to minimize.
[2025-05-29 20:23:40] [INFO ] Deduced a trap composed of 30 places in 258 ms of which 4 ms to minimize.
[2025-05-29 20:23:40] [INFO ] Deduced a trap composed of 25 places in 244 ms of which 3 ms to minimize.
[2025-05-29 20:23:40] [INFO ] Deduced a trap composed of 33 places in 303 ms of which 4 ms to minimize.
[2025-05-29 20:23:41] [INFO ] Deduced a trap composed of 34 places in 150 ms of which 2 ms to minimize.
[2025-05-29 20:23:41] [INFO ] Deduced a trap composed of 33 places in 141 ms of which 2 ms to minimize.
[2025-05-29 20:23:41] [INFO ] Deduced a trap composed of 33 places in 137 ms of which 2 ms to minimize.
[2025-05-29 20:23:41] [INFO ] Deduced a trap composed of 33 places in 236 ms of which 3 ms to minimize.
[2025-05-29 20:23:41] [INFO ] Deduced a trap composed of 32 places in 254 ms of which 4 ms to minimize.
[2025-05-29 20:23:42] [INFO ] Deduced a trap composed of 32 places in 154 ms of which 2 ms to minimize.
[2025-05-29 20:23:42] [INFO ] Deduced a trap composed of 33 places in 141 ms of which 2 ms to minimize.
[2025-05-29 20:23:42] [INFO ] Deduced a trap composed of 33 places in 135 ms of which 3 ms to minimize.
[2025-05-29 20:23:42] [INFO ] Deduced a trap composed of 27 places in 194 ms of which 3 ms to minimize.
[2025-05-29 20:23:42] [INFO ] Deduced a trap composed of 33 places in 200 ms of which 3 ms to minimize.
[2025-05-29 20:23:42] [INFO ] Deduced a trap composed of 32 places in 157 ms of which 2 ms to minimize.
[2025-05-29 20:23:43] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 2 ms to minimize.
[2025-05-29 20:23:43] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 2 ms to minimize.
[2025-05-29 20:23:43] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/521 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
[2025-05-29 20:23:44] [INFO ] Deduced a trap composed of 31 places in 188 ms of which 3 ms to minimize.
[2025-05-29 20:23:44] [INFO ] Deduced a trap composed of 26 places in 200 ms of which 2 ms to minimize.
[2025-05-29 20:23:44] [INFO ] Deduced a trap composed of 32 places in 231 ms of which 3 ms to minimize.
[2025-05-29 20:23:45] [INFO ] Deduced a trap composed of 27 places in 234 ms of which 3 ms to minimize.
[2025-05-29 20:23:45] [INFO ] Deduced a trap composed of 28 places in 224 ms of which 2 ms to minimize.
[2025-05-29 20:23:45] [INFO ] Deduced a trap composed of 26 places in 223 ms of which 3 ms to minimize.
[2025-05-29 20:23:45] [INFO ] Deduced a trap composed of 30 places in 242 ms of which 3 ms to minimize.
[2025-05-29 20:23:46] [INFO ] Deduced a trap composed of 25 places in 271 ms of which 3 ms to minimize.
[2025-05-29 20:23:46] [INFO ] Deduced a trap composed of 25 places in 256 ms of which 3 ms to minimize.
[2025-05-29 20:23:46] [INFO ] Deduced a trap composed of 26 places in 289 ms of which 5 ms to minimize.
[2025-05-29 20:23:46] [INFO ] Deduced a trap composed of 26 places in 323 ms of which 3 ms to minimize.
[2025-05-29 20:23:47] [INFO ] Deduced a trap composed of 25 places in 210 ms of which 3 ms to minimize.
[2025-05-29 20:23:47] [INFO ] Deduced a trap composed of 25 places in 182 ms of which 3 ms to minimize.
[2025-05-29 20:23:47] [INFO ] Deduced a trap composed of 26 places in 174 ms of which 2 ms to minimize.
[2025-05-29 20:23:47] [INFO ] Deduced a trap composed of 26 places in 175 ms of which 3 ms to minimize.
[2025-05-29 20:23:47] [INFO ] Deduced a trap composed of 25 places in 169 ms of which 2 ms to minimize.
[2025-05-29 20:23:48] [INFO ] Deduced a trap composed of 26 places in 175 ms of which 2 ms to minimize.
[2025-05-29 20:23:48] [INFO ] Deduced a trap composed of 25 places in 169 ms of which 2 ms to minimize.
[2025-05-29 20:23:48] [INFO ] Deduced a trap composed of 25 places in 151 ms of which 2 ms to minimize.
[2025-05-29 20:23:48] [INFO ] Deduced a trap composed of 26 places in 138 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/521 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 521/2187 variables, and 62 constraints, problems are : Problem set: 0 solved, 1645 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/522 constraints, ReadFeed: 0/1605 constraints, PredecessorRefiner: 1645/1645 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1645 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/521 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/521 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/521 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
[2025-05-29 20:23:53] [INFO ] Deduced a trap composed of 28 places in 116 ms of which 3 ms to minimize.
[2025-05-29 20:23:53] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 2 ms to minimize.
[2025-05-29 20:23:53] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 2 ms to minimize.
[2025-05-29 20:23:53] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 2 ms to minimize.
[2025-05-29 20:23:53] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 1 ms to minimize.
[2025-05-29 20:23:53] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 1 ms to minimize.
[2025-05-29 20:23:53] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
[2025-05-29 20:23:54] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 2 ms to minimize.
[2025-05-29 20:23:54] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 2 ms to minimize.
[2025-05-29 20:23:54] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 2 ms to minimize.
[2025-05-29 20:23:54] [INFO ] Deduced a trap composed of 25 places in 403 ms of which 4 ms to minimize.
[2025-05-29 20:23:55] [INFO ] Deduced a trap composed of 31 places in 404 ms of which 5 ms to minimize.
[2025-05-29 20:23:55] [INFO ] Deduced a trap composed of 25 places in 395 ms of which 5 ms to minimize.
[2025-05-29 20:23:55] [INFO ] Deduced a trap composed of 32 places in 403 ms of which 4 ms to minimize.
[2025-05-29 20:23:56] [INFO ] Deduced a trap composed of 32 places in 406 ms of which 5 ms to minimize.
[2025-05-29 20:23:56] [INFO ] Deduced a trap composed of 26 places in 399 ms of which 4 ms to minimize.
[2025-05-29 20:23:57] [INFO ] Deduced a trap composed of 34 places in 351 ms of which 5 ms to minimize.
[2025-05-29 20:23:57] [INFO ] Deduced a trap composed of 28 places in 405 ms of which 4 ms to minimize.
[2025-05-29 20:23:57] [INFO ] Deduced a trap composed of 25 places in 390 ms of which 5 ms to minimize.
[2025-05-29 20:23:58] [INFO ] Deduced a trap composed of 28 places in 381 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/521 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
[2025-05-29 20:23:59] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 1 ms to minimize.
[2025-05-29 20:23:59] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 2 ms to minimize.
[2025-05-29 20:23:59] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 1 ms to minimize.
[2025-05-29 20:23:59] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2025-05-29 20:23:59] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2025-05-29 20:24:00] [INFO ] Deduced a trap composed of 27 places in 394 ms of which 5 ms to minimize.
[2025-05-29 20:24:00] [INFO ] Deduced a trap composed of 33 places in 428 ms of which 5 ms to minimize.
[2025-05-29 20:24:01] [INFO ] Deduced a trap composed of 31 places in 396 ms of which 5 ms to minimize.
[2025-05-29 20:24:01] [INFO ] Deduced a trap composed of 27 places in 353 ms of which 4 ms to minimize.
[2025-05-29 20:24:01] [INFO ] Deduced a trap composed of 26 places in 324 ms of which 4 ms to minimize.
[2025-05-29 20:24:02] [INFO ] Deduced a trap composed of 29 places in 258 ms of which 4 ms to minimize.
[2025-05-29 20:24:02] [INFO ] Deduced a trap composed of 27 places in 267 ms of which 3 ms to minimize.
[2025-05-29 20:24:02] [INFO ] Deduced a trap composed of 26 places in 261 ms of which 3 ms to minimize.
[2025-05-29 20:24:03] [INFO ] Deduced a trap composed of 26 places in 272 ms of which 3 ms to minimize.
[2025-05-29 20:24:03] [INFO ] Deduced a trap composed of 27 places in 247 ms of which 3 ms to minimize.
[2025-05-29 20:24:03] [INFO ] Deduced a trap composed of 26 places in 247 ms of which 3 ms to minimize.
[2025-05-29 20:24:03] [INFO ] Deduced a trap composed of 29 places in 231 ms of which 3 ms to minimize.
[2025-05-29 20:24:03] [INFO ] Deduced a trap composed of 28 places in 200 ms of which 3 ms to minimize.
[2025-05-29 20:24:04] [INFO ] Deduced a trap composed of 31 places in 185 ms of which 3 ms to minimize.
[2025-05-29 20:24:04] [INFO ] Deduced a trap composed of 32 places in 152 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/521 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
[2025-05-29 20:24:05] [INFO ] Deduced a trap composed of 29 places in 228 ms of which 3 ms to minimize.
[2025-05-29 20:24:05] [INFO ] Deduced a trap composed of 29 places in 225 ms of which 3 ms to minimize.
[2025-05-29 20:24:05] [INFO ] Deduced a trap composed of 27 places in 197 ms of which 3 ms to minimize.
[2025-05-29 20:24:06] [INFO ] Deduced a trap composed of 25 places in 172 ms of which 3 ms to minimize.
[2025-05-29 20:24:06] [INFO ] Deduced a trap composed of 27 places in 158 ms of which 2 ms to minimize.
[2025-05-29 20:24:06] [INFO ] Deduced a trap composed of 26 places in 155 ms of which 2 ms to minimize.
[2025-05-29 20:24:06] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 2 ms to minimize.
[2025-05-29 20:24:06] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 2 ms to minimize.
[2025-05-29 20:24:06] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 2 ms to minimize.
[2025-05-29 20:24:06] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
[2025-05-29 20:24:06] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 1 ms to minimize.
[2025-05-29 20:24:07] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 2 ms to minimize.
[2025-05-29 20:24:07] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2025-05-29 20:24:07] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2025-05-29 20:24:07] [INFO ] Deduced a trap composed of 25 places in 253 ms of which 3 ms to minimize.
[2025-05-29 20:24:07] [INFO ] Deduced a trap composed of 32 places in 234 ms of which 3 ms to minimize.
[2025-05-29 20:24:07] [INFO ] Deduced a trap composed of 35 places in 231 ms of which 3 ms to minimize.
[2025-05-29 20:24:08] [INFO ] Deduced a trap composed of 25 places in 195 ms of which 3 ms to minimize.
[2025-05-29 20:24:08] [INFO ] Deduced a trap composed of 33 places in 234 ms of which 3 ms to minimize.
[2025-05-29 20:24:08] [INFO ] Deduced a trap composed of 30 places in 168 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/521 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
[2025-05-29 20:24:09] [INFO ] Deduced a trap composed of 25 places in 258 ms of which 3 ms to minimize.
[2025-05-29 20:24:10] [INFO ] Deduced a trap composed of 31 places in 267 ms of which 4 ms to minimize.
[2025-05-29 20:24:16] [INFO ] Deduced a trap composed of 2 places in 337 ms of which 4 ms to minimize.
[2025-05-29 20:24:16] [INFO ] Deduced a trap composed of 2 places in 351 ms of which 4 ms to minimize.
[2025-05-29 20:24:16] [INFO ] Deduced a trap composed of 3 places in 357 ms of which 4 ms to minimize.
[2025-05-29 20:24:17] [INFO ] Deduced a trap composed of 26 places in 292 ms of which 4 ms to minimize.
[2025-05-29 20:24:17] [INFO ] Deduced a trap composed of 22 places in 352 ms of which 4 ms to minimize.
[2025-05-29 20:24:17] [INFO ] Deduced a trap composed of 22 places in 338 ms of which 4 ms to minimize.
[2025-05-29 20:24:18] [INFO ] Deduced a trap composed of 3 places in 309 ms of which 4 ms to minimize.
[2025-05-29 20:24:18] [INFO ] Deduced a trap composed of 2 places in 342 ms of which 4 ms to minimize.
[2025-05-29 20:24:18] [INFO ] Deduced a trap composed of 22 places in 332 ms of which 4 ms to minimize.
[2025-05-29 20:24:19] [INFO ] Deduced a trap composed of 2 places in 337 ms of which 4 ms to minimize.
[2025-05-29 20:24:19] [INFO ] Deduced a trap composed of 2 places in 384 ms of which 3 ms to minimize.
[2025-05-29 20:24:19] [INFO ] Deduced a trap composed of 2 places in 339 ms of which 4 ms to minimize.
[2025-05-29 20:24:20] [INFO ] Deduced a trap composed of 2 places in 336 ms of which 4 ms to minimize.
SMT process timed out in 60840ms, After SMT, problems are : Problem set: 0 solved, 1645 unsolved
Search for dead transitions found 0 dead transitions in 60856ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68870 ms. Remains : 522/522 places, 1665/1665 transitions.
[2025-05-29 20:24:20] [INFO ] Flatten gal took : 56 ms
[2025-05-29 20:24:20] [INFO ] Flatten gal took : 36 ms
[2025-05-29 20:24:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8578678508488556444.gal : 8 ms
[2025-05-29 20:24:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16486562233439840800.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/ReachabilityCardinality8578678508488556444.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16486562233439840800.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 ...329
Loading property file /tmp/ReachabilityCardinality16486562233439840800.prop.
RANDOM walk for 40000 steps (423 resets) in 1331 ms. (30 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (18 resets) in 83 ms. (476 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (19 resets) in 109 ms. (363 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 147
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :147 after 150
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :150 after 151
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :151 after 155
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :155 after 156
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :156 after 157
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :157 after 163
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :163 after 174
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :174 after 199
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :199 after 235
Interrupted probabilistic random walk after 298438 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :0 out of 2
Probabilistic random walk after 298438 steps, saw 42015 distinct states, run finished after 3001 ms. (steps per millisecond=99 ) properties seen :0
[2025-05-29 20:24:23] [INFO ] Invariant cache hit.
[2025-05-29 20:24:23] [INFO ] State equation strengthened by 1605 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 479/480 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-29 20:24:23] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 0 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/480 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/480 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 38/518 variables, 19/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :235 after 319
At refinement iteration 5 (INCLUDED_ONLY) 0/518 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/520 variables, 2/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-05-29 20:24:24] [INFO ] Deduced a trap composed of 37 places in 496 ms of which 4 ms to minimize.
[2025-05-29 20:24:24] [INFO ] Deduced a trap composed of 30 places in 412 ms of which 6 ms to minimize.
[2025-05-29 20:24:25] [INFO ] Deduced a trap composed of 27 places in 406 ms of which 4 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
[2025-05-29 20:24:25] [INFO ] Deduced a trap composed of 27 places in 400 ms of which 4 ms to minimize.
SDD size :319 after 452
[2025-05-29 20:24:26] [INFO ] Deduced a trap composed of 39 places in 383 ms of which 4 ms to minimize.
[2025-05-29 20:24:26] [INFO ] Deduced a trap composed of 31 places in 380 ms of which 5 ms to minimize.
[2025-05-29 20:24:27] [INFO ] Deduced a trap composed of 26 places in 382 ms of which 5 ms to minimize.
[2025-05-29 20:24:27] [INFO ] Deduced a trap composed of 32 places in 350 ms of which 4 ms to minimize.
[2025-05-29 20:24:27] [INFO ] Deduced a trap composed of 31 places in 346 ms of which 4 ms to minimize.
[2025-05-29 20:24:28] [INFO ] Deduced a trap composed of 26 places in 327 ms of which 4 ms to minimize.
[2025-05-29 20:24:28] [INFO ] Deduced a trap composed of 26 places in 333 ms of which 4 ms to minimize.
[2025-05-29 20:24:28] [INFO ] Deduced a trap composed of 26 places in 301 ms of which 4 ms to minimize.
[2025-05-29 20:24:29] [INFO ] Deduced a trap composed of 25 places in 283 ms of which 3 ms to minimize.
SMT process timed out in 5229ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 522 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 522/522 places, 1665/1665 transitions.
Applied a total of 0 rules in 29 ms. Remains 522 /522 variables (removed 0) and now considering 1665/1665 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 522/522 places, 1665/1665 transitions.
RANDOM walk for 40000 steps (419 resets) in 323 ms. (123 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (16 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :452 after 7470
Interrupted probabilistic random walk after 369332 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :0 out of 1
Probabilistic random walk after 369332 steps, saw 49608 distinct states, run finished after 3001 ms. (steps per millisecond=123 ) properties seen :0
[2025-05-29 20:24:32] [INFO ] Invariant cache hit.
[2025-05-29 20:24:32] [INFO ] State equation strengthened by 1605 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 479/480 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:24:32] [INFO ] Deduced a trap composed of 2 places in 129 ms of which 1 ms to minimize.
[2025-05-29 20:24:32] [INFO ] Deduced a trap composed of 2 places in 64 ms of which 1 ms to minimize.
[2025-05-29 20:24:32] [INFO ] Deduced a trap composed of 2 places in 59 ms of which 1 ms to minimize.
[2025-05-29 20:24:32] [INFO ] Deduced a trap composed of 2 places in 56 ms of which 1 ms to minimize.
[2025-05-29 20:24:32] [INFO ] Deduced a trap composed of 2 places in 63 ms of which 1 ms to minimize.
[2025-05-29 20:24:32] [INFO ] Deduced a trap composed of 2 places in 76 ms of which 2 ms to minimize.
[2025-05-29 20:24:32] [INFO ] Deduced a trap composed of 2 places in 56 ms of which 1 ms to minimize.
[2025-05-29 20:24:32] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2025-05-29 20:24:33] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 0 ms to minimize.
[2025-05-29 20:24:33] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2025-05-29 20:24:33] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
[2025-05-29 20:24:33] [INFO ] Deduced a trap composed of 2 places in 73 ms of which 1 ms to minimize.
[2025-05-29 20:24:33] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 2 ms to minimize.
[2025-05-29 20:24:33] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2025-05-29 20:24:33] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2025-05-29 20:24:33] [INFO ] Deduced a trap composed of 2 places in 59 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/480 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/480 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 38/518 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/518 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/520 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1665/2185 variables, 520/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2185 variables, 1605/2163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2185 variables, 0/2163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/2187 variables, 2/2165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2187 variables, 0/2165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/2187 variables, 0/2165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2187/2187 variables, and 2165 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2235 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 522/522 constraints, ReadFeed: 1605/1605 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 479/480 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/480 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:24:34] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2025-05-29 20:24:34] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 0 ms to minimize.
[2025-05-29 20:24:34] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/480 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 38/518 variables, 19/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/518 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/520 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:24:35] [INFO ] Deduced a trap composed of 31 places in 453 ms of which 5 ms to minimize.
[2025-05-29 20:24:35] [INFO ] Deduced a trap composed of 24 places in 447 ms of which 5 ms to minimize.
[2025-05-29 20:24:36] [INFO ] Deduced a trap composed of 37 places in 427 ms of which 5 ms to minimize.
[2025-05-29 20:24:36] [INFO ] Deduced a trap composed of 25 places in 442 ms of which 5 ms to minimize.
[2025-05-29 20:24:37] [INFO ] Deduced a trap composed of 25 places in 456 ms of which 8 ms to minimize.
[2025-05-29 20:24:37] [INFO ] Deduced a trap composed of 31 places in 509 ms of which 5 ms to minimize.
[2025-05-29 20:24:38] [INFO ] Deduced a trap composed of 25 places in 524 ms of which 5 ms to minimize.
[2025-05-29 20:24:38] [INFO ] Deduced a trap composed of 36 places in 568 ms of which 5 ms to minimize.
[2025-05-29 20:24:39] [INFO ] Deduced a trap composed of 26 places in 540 ms of which 5 ms to minimize.
[2025-05-29 20:24:39] [INFO ] Deduced a trap composed of 27 places in 546 ms of which 5 ms to minimize.
[2025-05-29 20:24:40] [INFO ] Deduced a trap composed of 25 places in 558 ms of which 6 ms to minimize.
[2025-05-29 20:24:40] [INFO ] Deduced a trap composed of 25 places in 548 ms of which 5 ms to minimize.
[2025-05-29 20:24:41] [INFO ] Deduced a trap composed of 29 places in 511 ms of which 5 ms to minimize.
[2025-05-29 20:24:41] [INFO ] Deduced a trap composed of 31 places in 499 ms of which 6 ms to minimize.
[2025-05-29 20:24:42] [INFO ] Deduced a trap composed of 25 places in 521 ms of which 6 ms to minimize.
[2025-05-29 20:24:42] [INFO ] Deduced a trap composed of 34 places in 507 ms of which 5 ms to minimize.
[2025-05-29 20:24:43] [INFO ] Deduced a trap composed of 28 places in 520 ms of which 6 ms to minimize.
[2025-05-29 20:24:44] [INFO ] Deduced a trap composed of 25 places in 513 ms of which 5 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :7470 after 9184
[2025-05-29 20:24:44] [INFO ] Deduced a trap composed of 24 places in 528 ms of which 5 ms to minimize.
[2025-05-29 20:24:45] [INFO ] Deduced a trap composed of 28 places in 521 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:24:45] [INFO ] Deduced a trap composed of 26 places in 504 ms of which 5 ms to minimize.
[2025-05-29 20:24:45] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/520 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/520 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1665/2185 variables, 520/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2185 variables, 1605/2188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2185 variables, 1/2189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2185 variables, 0/2189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/2187 variables, 2/2191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2187 variables, 0/2191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2187 variables, 0/2191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2187/2187 variables, and 2191 constraints, problems are : Problem set: 0 solved, 1 unsolved in 13054 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 522/522 constraints, ReadFeed: 1605/1605 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 41/41 constraints]
After SMT, in 15313ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 80 ms.
Support contains 1 out of 522 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 522/522 places, 1665/1665 transitions.
Applied a total of 0 rules in 46 ms. Remains 522 /522 variables (removed 0) and now considering 1665/1665 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 522/522 places, 1665/1665 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 522/522 places, 1665/1665 transitions.
Applied a total of 0 rules in 46 ms. Remains 522 /522 variables (removed 0) and now considering 1665/1665 (removed 0) transitions.
[2025-05-29 20:24:47] [INFO ] Invariant cache hit.
[2025-05-29 20:24:48] [INFO ] Implicit Places using invariants in 948 ms returned []
[2025-05-29 20:24:48] [INFO ] Invariant cache hit.
[2025-05-29 20:24:49] [INFO ] State equation strengthened by 1605 read => feed constraints.
[2025-05-29 20:24:56] [INFO ] Implicit Places using invariants and state equation in 8362 ms returned []
Implicit Place search using SMT with State Equation took 9315 ms to find 0 implicit places.
[2025-05-29 20:24:57] [INFO ] Redundant transitions in 36 ms returned []
Running 1645 sub problems to find dead transitions.
[2025-05-29 20:24:57] [INFO ] Invariant cache hit.
[2025-05-29 20:24:57] [INFO ] State equation strengthened by 1605 read => feed constraints.
Detected timeout of ITS tools.
[2025-05-29 20:25:10] [INFO ] Flatten gal took : 34 ms
[2025-05-29 20:25:10] [INFO ] Applying decomposition
[2025-05-29 20:25:10] [INFO ] Flatten gal took : 34 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/graph18116949907552505192.txt' '-o' '/tmp/graph18116949907552505192.bin' '-w' '/tmp/graph18116949907552505192.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18116949907552505192.bin' '-l' '-1' '-v' '-w' '/tmp/graph18116949907552505192.weights' '-q' '0' '-e' '0.001'
[2025-05-29 20:25:10] [INFO ] Decomposing Gal with order
[2025-05-29 20:25:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 20:25:10] [INFO ] Removed a total of 1282 redundant transitions.
[2025-05-29 20:25:10] [INFO ] Flatten gal took : 132 ms
[2025-05-29 20:25:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 1320 labels/synchronizations in 40 ms.
[2025-05-29 20:25:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7425134312822419166.gal : 16 ms
[2025-05-29 20:25:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17492115987795605950.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/ReachabilityCardinality7425134312822419166.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17492115987795605950.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 ...308
Loading property file /tmp/ReachabilityCardinality17492115987795605950.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 483
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :483 after 483
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :483 after 483
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :483 after 497
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :497 after 498
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :498 after 502
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :502 after 505
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :505 after 518
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :518 after 30861
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :30861 after 1.18933e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.18933e+06 after 2.18841e+06
At refinement iteration 0 (INCLUDED_ONLY) 0/521 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/521 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
[2025-05-29 20:25:16] [INFO ] Deduced a trap composed of 25 places in 230 ms of which 4 ms to minimize.
[2025-05-29 20:25:17] [INFO ] Deduced a trap composed of 2 places in 401 ms of which 4 ms to minimize.
[2025-05-29 20:25:17] [INFO ] Deduced a trap composed of 33 places in 160 ms of which 2 ms to minimize.
[2025-05-29 20:25:17] [INFO ] Deduced a trap composed of 30 places in 156 ms of which 3 ms to minimize.
[2025-05-29 20:25:17] [INFO ] Deduced a trap composed of 25 places in 161 ms of which 3 ms to minimize.
[2025-05-29 20:25:17] [INFO ] Deduced a trap composed of 33 places in 176 ms of which 2 ms to minimize.
[2025-05-29 20:25:18] [INFO ] Deduced a trap composed of 34 places in 185 ms of which 3 ms to minimize.
[2025-05-29 20:25:18] [INFO ] Deduced a trap composed of 33 places in 161 ms of which 2 ms to minimize.
[2025-05-29 20:25:18] [INFO ] Deduced a trap composed of 33 places in 168 ms of which 2 ms to minimize.
[2025-05-29 20:25:18] [INFO ] Deduced a trap composed of 33 places in 153 ms of which 2 ms to minimize.
[2025-05-29 20:25:18] [INFO ] Deduced a trap composed of 32 places in 160 ms of which 2 ms to minimize.
[2025-05-29 20:25:18] [INFO ] Deduced a trap composed of 32 places in 130 ms of which 2 ms to minimize.
[2025-05-29 20:25:19] [INFO ] Deduced a trap composed of 33 places in 169 ms of which 2 ms to minimize.
[2025-05-29 20:25:19] [INFO ] Deduced a trap composed of 33 places in 169 ms of which 2 ms to minimize.
[2025-05-29 20:25:19] [INFO ] Deduced a trap composed of 27 places in 165 ms of which 2 ms to minimize.
[2025-05-29 20:25:19] [INFO ] Deduced a trap composed of 33 places in 122 ms of which 1 ms to minimize.
[2025-05-29 20:25:19] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 2 ms to minimize.
[2025-05-29 20:25:19] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 2 ms to minimize.
[2025-05-29 20:25:20] [INFO ] Deduced a trap composed of 27 places in 145 ms of which 2 ms to minimize.
[2025-05-29 20:25:20] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/521 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
[2025-05-29 20:25:21] [INFO ] Deduced a trap composed of 31 places in 220 ms of which 2 ms to minimize.
[2025-05-29 20:25:21] [INFO ] Deduced a trap composed of 26 places in 198 ms of which 2 ms to minimize.
[2025-05-29 20:25:21] [INFO ] Deduced a trap composed of 32 places in 225 ms of which 3 ms to minimize.
[2025-05-29 20:25:21] [INFO ] Deduced a trap composed of 27 places in 187 ms of which 3 ms to minimize.
[2025-05-29 20:25:21] [INFO ] Deduced a trap composed of 28 places in 218 ms of which 3 ms to minimize.
[2025-05-29 20:25:22] [INFO ] Deduced a trap composed of 26 places in 182 ms of which 2 ms to minimize.
[2025-05-29 20:25:22] [INFO ] Deduced a trap composed of 30 places in 212 ms of which 3 ms to minimize.
[2025-05-29 20:25:22] [INFO ] Deduced a trap composed of 25 places in 230 ms of which 3 ms to minimize.
[2025-05-29 20:25:22] [INFO ] Deduced a trap composed of 25 places in 216 ms of which 3 ms to minimize.
[2025-05-29 20:25:23] [INFO ] Deduced a trap composed of 26 places in 187 ms of which 3 ms to minimize.
[2025-05-29 20:25:23] [INFO ] Deduced a trap composed of 26 places in 200 ms of which 3 ms to minimize.
[2025-05-29 20:25:23] [INFO ] Deduced a trap composed of 25 places in 194 ms of which 3 ms to minimize.
[2025-05-29 20:25:23] [INFO ] Deduced a trap composed of 25 places in 176 ms of which 3 ms to minimize.
[2025-05-29 20:25:23] [INFO ] Deduced a trap composed of 26 places in 161 ms of which 3 ms to minimize.
[2025-05-29 20:25:24] [INFO ] Deduced a trap composed of 26 places in 163 ms of which 3 ms to minimize.
[2025-05-29 20:25:24] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 3 ms to minimize.
[2025-05-29 20:25:24] [INFO ] Deduced a trap composed of 26 places in 180 ms of which 2 ms to minimize.
[2025-05-29 20:25:24] [INFO ] Deduced a trap composed of 25 places in 162 ms of which 3 ms to minimize.
[2025-05-29 20:25:24] [INFO ] Deduced a trap composed of 25 places in 147 ms of which 2 ms to minimize.
[2025-05-29 20:25:24] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 2 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2.18841e+06 after 4.73951e+07
At refinement iteration 3 (INCLUDED_ONLY) 0/521 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 521/2187 variables, and 62 constraints, problems are : Problem set: 0 solved, 1645 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/522 constraints, ReadFeed: 0/1605 constraints, PredecessorRefiner: 1645/1645 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1645 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/521 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/521 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/521 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
[2025-05-29 20:25:30] [INFO ] Deduced a trap composed of 28 places in 140 ms of which 2 ms to minimize.
[2025-05-29 20:25:30] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 2 ms to minimize.
[2025-05-29 20:25:30] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 2 ms to minimize.
[2025-05-29 20:25:30] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 1 ms to minimize.
[2025-05-29 20:25:30] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 2 ms to minimize.
[2025-05-29 20:25:30] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 2 ms to minimize.
[2025-05-29 20:25:31] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 1 ms to minimize.
[2025-05-29 20:25:31] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 1 ms to minimize.
[2025-05-29 20:25:31] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2025-05-29 20:25:31] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 2 ms to minimize.
[2025-05-29 20:25:31] [INFO ] Deduced a trap composed of 25 places in 370 ms of which 5 ms to minimize.
[2025-05-29 20:25:32] [INFO ] Deduced a trap composed of 31 places in 377 ms of which 4 ms to minimize.
[2025-05-29 20:25:32] [INFO ] Deduced a trap composed of 25 places in 369 ms of which 4 ms to minimize.
[2025-05-29 20:25:33] [INFO ] Deduced a trap composed of 32 places in 372 ms of which 4 ms to minimize.
[2025-05-29 20:25:33] [INFO ] Deduced a trap composed of 32 places in 383 ms of which 4 ms to minimize.
[2025-05-29 20:25:33] [INFO ] Deduced a trap composed of 26 places in 387 ms of which 4 ms to minimize.
[2025-05-29 20:25:34] [INFO ] Deduced a trap composed of 34 places in 375 ms of which 4 ms to minimize.
[2025-05-29 20:25:34] [INFO ] Deduced a trap composed of 28 places in 376 ms of which 4 ms to minimize.
[2025-05-29 20:25:35] [INFO ] Deduced a trap composed of 25 places in 389 ms of which 7 ms to minimize.
[2025-05-29 20:25:35] [INFO ] Deduced a trap composed of 28 places in 378 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/521 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
[2025-05-29 20:25:36] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 2 ms to minimize.
[2025-05-29 20:25:36] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 3 ms to minimize.
[2025-05-29 20:25:36] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 2 ms to minimize.
[2025-05-29 20:25:36] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2025-05-29 20:25:37] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 2 ms to minimize.
[2025-05-29 20:25:37] [INFO ] Deduced a trap composed of 27 places in 379 ms of which 4 ms to minimize.
[2025-05-29 20:25:37] [INFO ] Deduced a trap composed of 33 places in 409 ms of which 4 ms to minimize.
[2025-05-29 20:25:38] [INFO ] Deduced a trap composed of 31 places in 386 ms of which 4 ms to minimize.
[2025-05-29 20:25:38] [INFO ] Deduced a trap composed of 27 places in 340 ms of which 4 ms to minimize.
[2025-05-29 20:25:39] [INFO ] Deduced a trap composed of 26 places in 319 ms of which 4 ms to minimize.
[2025-05-29 20:25:39] [INFO ] Deduced a trap composed of 29 places in 271 ms of which 3 ms to minimize.
[2025-05-29 20:25:39] [INFO ] Deduced a trap composed of 27 places in 245 ms of which 4 ms to minimize.
[2025-05-29 20:25:39] [INFO ] Deduced a trap composed of 26 places in 246 ms of which 4 ms to minimize.
[2025-05-29 20:25:40] [INFO ] Deduced a trap composed of 26 places in 268 ms of which 3 ms to minimize.
[2025-05-29 20:25:40] [INFO ] Deduced a trap composed of 27 places in 244 ms of which 4 ms to minimize.
[2025-05-29 20:25:40] [INFO ] Deduced a trap composed of 26 places in 238 ms of which 3 ms to minimize.
[2025-05-29 20:25:40] [INFO ] Deduced a trap composed of 29 places in 215 ms of which 3 ms to minimize.
[2025-05-29 20:25:41] [INFO ] Deduced a trap composed of 28 places in 157 ms of which 3 ms to minimize.
[2025-05-29 20:25:41] [INFO ] Deduced a trap composed of 31 places in 175 ms of which 3 ms to minimize.
[2025-05-29 20:25:41] [INFO ] Deduced a trap composed of 32 places in 150 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/521 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
[2025-05-29 20:25:42] [INFO ] Deduced a trap composed of 29 places in 214 ms of which 3 ms to minimize.
[2025-05-29 20:25:42] [INFO ] Deduced a trap composed of 29 places in 210 ms of which 3 ms to minimize.
[2025-05-29 20:25:43] [INFO ] Deduced a trap composed of 27 places in 179 ms of which 2 ms to minimize.
[2025-05-29 20:25:43] [INFO ] Deduced a trap composed of 25 places in 150 ms of which 3 ms to minimize.
[2025-05-29 20:25:43] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 2 ms to minimize.
[2025-05-29 20:25:43] [INFO ] Deduced a trap composed of 26 places in 133 ms of which 2 ms to minimize.
[2025-05-29 20:25:43] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 2 ms to minimize.
[2025-05-29 20:25:43] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 2 ms to minimize.
[2025-05-29 20:25:43] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 1 ms to minimize.
[2025-05-29 20:25:44] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 2 ms to minimize.
[2025-05-29 20:25:44] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 2 ms to minimize.
[2025-05-29 20:25:44] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2025-05-29 20:25:44] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 2 ms to minimize.
[2025-05-29 20:25:44] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2025-05-29 20:25:44] [INFO ] Deduced a trap composed of 25 places in 237 ms of which 3 ms to minimize.
[2025-05-29 20:25:44] [INFO ] Deduced a trap composed of 32 places in 223 ms of which 3 ms to minimize.
[2025-05-29 20:25:45] [INFO ] Deduced a trap composed of 35 places in 221 ms of which 3 ms to minimize.
[2025-05-29 20:25:45] [INFO ] Deduced a trap composed of 25 places in 200 ms of which 3 ms to minimize.
[2025-05-29 20:25:45] [INFO ] Deduced a trap composed of 33 places in 180 ms of which 3 ms to minimize.
[2025-05-29 20:25:45] [INFO ] Deduced a trap composed of 30 places in 181 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/521 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1645 unsolved
[2025-05-29 20:25:47] [INFO ] Deduced a trap composed of 25 places in 258 ms of which 4 ms to minimize.
[2025-05-29 20:25:47] [INFO ] Deduced a trap composed of 31 places in 243 ms of which 3 ms to minimize.
[2025-05-29 20:25:53] [INFO ] Deduced a trap composed of 2 places in 297 ms of which 3 ms to minimize.
[2025-05-29 20:25:53] [INFO ] Deduced a trap composed of 2 places in 308 ms of which 4 ms to minimize.
[2025-05-29 20:25:54] [INFO ] Deduced a trap composed of 3 places in 303 ms of which 4 ms to minimize.
[2025-05-29 20:25:54] [INFO ] Deduced a trap composed of 26 places in 308 ms of which 4 ms to minimize.
[2025-05-29 20:25:54] [INFO ] Deduced a trap composed of 22 places in 320 ms of which 4 ms to minimize.
[2025-05-29 20:25:55] [INFO ] Deduced a trap composed of 22 places in 292 ms of which 4 ms to minimize.
[2025-05-29 20:25:55] [INFO ] Deduced a trap composed of 3 places in 271 ms of which 3 ms to minimize.
[2025-05-29 20:25:55] [INFO ] Deduced a trap composed of 2 places in 289 ms of which 3 ms to minimize.
[2025-05-29 20:25:56] [INFO ] Deduced a trap composed of 22 places in 284 ms of which 3 ms to minimize.
[2025-05-29 20:25:56] [INFO ] Deduced a trap composed of 2 places in 299 ms of which 3 ms to minimize.
[2025-05-29 20:25:56] [INFO ] Deduced a trap composed of 2 places in 287 ms of which 4 ms to minimize.
[2025-05-29 20:25:57] [INFO ] Deduced a trap composed of 2 places in 306 ms of which 4 ms to minimize.
[2025-05-29 20:25:57] [INFO ] Deduced a trap composed of 2 places in 319 ms of which 4 ms to minimize.
[2025-05-29 20:25:57] [INFO ] Deduced a trap composed of 29 places in 373 ms of which 5 ms to minimize.
SMT process timed out in 60789ms, After SMT, problems are : Problem set: 0 solved, 1645 unsolved
Search for dead transitions found 0 dead transitions in 60805ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70217 ms. Remains : 522/522 places, 1665/1665 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1542 edges and 522 vertex of which 438 / 522 are part of one of the 2 SCC in 0 ms
Free SCC test removed 436 places
Drop transitions (Empty/Sink Transition effects.) removed 1164 transitions
Ensure Unique test removed 412 transitions
Reduce isomorphic transitions removed 1576 transitions.
Graph (complete) has 211 edges and 86 vertex of which 25 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.0 ms
Discarding 61 places :
Also discarding 19 output transitions
Drop transitions (Output transitions of discarded places.) removed 19 transitions
Drop transitions (Empty/Sink Transition effects.) removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 25 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 24 transition count 28
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 63 place count 6 transition count 10
Iterating global reduction 2 with 18 rules applied. Total rules applied 81 place count 6 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 83 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 86 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 4 transition count 5
Applied a total of 87 rules in 10 ms. Remains 4 /522 variables (removed 518) and now considering 5/1665 (removed 1660) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 4 cols
[2025-05-29 20:25:57] [INFO ] Computed 0 invariants in 0 ms
[2025-05-29 20:25:57] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-29 20:25:57] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-29 20:25:57] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-29 20:25:57] [INFO ] After 28ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-05-29 20:25:57] [INFO ] Flatten gal took : 1 ms
[2025-05-29 20:25:57] [INFO ] Flatten gal took : 0 ms
[2025-05-29 20:25:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8749398220890514982.gal : 1 ms
[2025-05-29 20:25:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7087957354700958533.prop : 0 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/ReachabilityCardinality8749398220890514982.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7087957354700958533.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/ReachabilityCardinality7087957354700958533.prop.
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 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,6,0.003104,3520,2,7,6,33,6,0,21,18,0
Total reachable state count : 6

Verifying 1 reachability properties.
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,0.003464,3896,2,5,6,33,7,0,24,18,0
Over-approximation ignoring read arcs solved 0 properties in 81 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[20]
Ending property specific reduction for CANInsertWithFailure-PT-020-UpperBounds-14 in 181949 ms.
Starting property specific reduction for CANInsertWithFailure-PT-020-UpperBounds-15
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[20]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[20]
// Phase 1: matrix 1674 rows 531 cols
[2025-05-29 20:25:57] [INFO ] Computed 22 invariants in 13 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[20]
RANDOM walk for 10000 steps (103 resets) in 51 ms. (192 steps per ms)
BEST_FIRST walk for 10001 steps (4 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[20]
[2025-05-29 20:25:58] [INFO ] Invariant cache hit.
[2025-05-29 20:25:58] [INFO ] [Real]Absence check using 20 positive place invariants in 12 ms returned sat
[2025-05-29 20:25:58] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2025-05-29 20:25:58] [INFO ] [Real]Absence check using state equation in 466 ms returned sat
[2025-05-29 20:25:58] [INFO ] State equation strengthened by 1582 read => feed constraints.
[2025-05-29 20:25:58] [INFO ] [Real]Added 1582 Read/Feed constraints in 212 ms returned sat
[2025-05-29 20:25:58] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:25:59] [INFO ] [Nat]Absence check using 20 positive place invariants in 15 ms returned sat
[2025-05-29 20:25:59] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 7 ms returned sat
[2025-05-29 20:25:59] [INFO ] [Nat]Absence check using state equation in 537 ms returned sat
[2025-05-29 20:25:59] [INFO ] [Nat]Added 1582 Read/Feed constraints in 263 ms returned sat
[2025-05-29 20:26:00] [INFO ] Computed and/alt/rep : 1160/3017/1160 causal constraints (skipped 494 transitions) in 154 ms.
[2025-05-29 20:26:00] [INFO ] Added : 6 causal constraints over 2 iterations in 557 ms. Result :sat
Minimization took 578 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[20]
Support contains 1 out of 531 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 531/531 places, 1674/1674 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 524 transition count 1667
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 524 transition count 1666
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 16 place count 523 transition count 1666
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 24 place count 523 transition count 1666
Applied a total of 24 rules in 162 ms. Remains 523 /531 variables (removed 8) and now considering 1666/1674 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 523/531 places, 1666/1674 transitions.
// Phase 1: matrix 1666 rows 523 cols
[2025-05-29 20:26:01] [INFO ] Computed 22 invariants in 23 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[20]
RANDOM walk for 1000000 steps (10514 resets) in 5268 ms. (189 steps per ms)
BEST_FIRST walk for 1000001 steps (475 resets) in 951 ms. (1050 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[20]
[2025-05-29 20:26:07] [INFO ] Invariant cache hit.
[2025-05-29 20:26:07] [INFO ] [Real]Absence check using 20 positive place invariants in 19 ms returned sat
[2025-05-29 20:26:07] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 9 ms returned sat
[2025-05-29 20:26:08] [INFO ] [Real]Absence check using state equation in 595 ms returned sat
[2025-05-29 20:26:08] [INFO ] State equation strengthened by 1604 read => feed constraints.
[2025-05-29 20:26:08] [INFO ] [Real]Added 1604 Read/Feed constraints in 253 ms returned sat
[2025-05-29 20:26:08] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:26:08] [INFO ] [Nat]Absence check using 20 positive place invariants in 19 ms returned sat
[2025-05-29 20:26:08] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 8 ms returned sat
[2025-05-29 20:26:09] [INFO ] [Nat]Absence check using state equation in 640 ms returned sat
[2025-05-29 20:26:09] [INFO ] [Nat]Added 1604 Read/Feed constraints in 191 ms returned sat
[2025-05-29 20:26:09] [INFO ] Computed and/alt/rep : 1152/3047/1152 causal constraints (skipped 494 transitions) in 118 ms.
[2025-05-29 20:26:10] [INFO ] Added : 9 causal constraints over 2 iterations in 439 ms. Result :sat
Minimization took 4392 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[20]
Support contains 1 out of 523 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1666/1666 transitions.
Applied a total of 0 rules in 30 ms. Remains 523 /523 variables (removed 0) and now considering 1666/1666 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 523/523 places, 1666/1666 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1666/1666 transitions.
Applied a total of 0 rules in 28 ms. Remains 523 /523 variables (removed 0) and now considering 1666/1666 (removed 0) transitions.
[2025-05-29 20:26:14] [INFO ] Invariant cache hit.
[2025-05-29 20:26:15] [INFO ] Implicit Places using invariants in 875 ms returned []
[2025-05-29 20:26:15] [INFO ] Invariant cache hit.
[2025-05-29 20:26:16] [INFO ] State equation strengthened by 1604 read => feed constraints.
[2025-05-29 20:26:21] [INFO ] Implicit Places using invariants and state equation in 6435 ms returned []
Implicit Place search using SMT with State Equation took 7312 ms to find 0 implicit places.
[2025-05-29 20:26:21] [INFO ] Redundant transitions in 36 ms returned []
Running 1646 sub problems to find dead transitions.
[2025-05-29 20:26:21] [INFO ] Invariant cache hit.
[2025-05-29 20:26:22] [INFO ] State equation strengthened by 1604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/522 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/522 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
[2025-05-29 20:26:50] [INFO ] Deduced a trap composed of 29 places in 225 ms of which 4 ms to minimize.
[2025-05-29 20:26:50] [INFO ] Deduced a trap composed of 32 places in 269 ms of which 3 ms to minimize.
[2025-05-29 20:26:50] [INFO ] Deduced a trap composed of 27 places in 231 ms of which 3 ms to minimize.
[2025-05-29 20:26:51] [INFO ] Deduced a trap composed of 26 places in 211 ms of which 3 ms to minimize.
[2025-05-29 20:26:51] [INFO ] Deduced a trap composed of 28 places in 187 ms of which 2 ms to minimize.
[2025-05-29 20:26:51] [INFO ] Deduced a trap composed of 27 places in 217 ms of which 4 ms to minimize.
[2025-05-29 20:26:51] [INFO ] Deduced a trap composed of 31 places in 268 ms of which 4 ms to minimize.
[2025-05-29 20:26:52] [INFO ] Deduced a trap composed of 30 places in 266 ms of which 3 ms to minimize.
[2025-05-29 20:26:52] [INFO ] Deduced a trap composed of 28 places in 291 ms of which 4 ms to minimize.
[2025-05-29 20:26:52] [INFO ] Deduced a trap composed of 32 places in 281 ms of which 4 ms to minimize.
[2025-05-29 20:26:52] [INFO ] Deduced a trap composed of 27 places in 227 ms of which 3 ms to minimize.
SMT process timed out in 30978ms, After SMT, problems are : Problem set: 0 solved, 1646 unsolved
Search for dead transitions found 0 dead transitions in 30998ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38382 ms. Remains : 523/523 places, 1666/1666 transitions.
[2025-05-29 20:26:53] [INFO ] Flatten gal took : 198 ms
[2025-05-29 20:26:53] [INFO ] Flatten gal took : 89 ms
[2025-05-29 20:26:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17172513423902561854.gal : 16 ms
[2025-05-29 20:26:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2176409557573995076.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/ReachabilityCardinality17172513423902561854.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2176409557573995076.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 ...329
RANDOM walk for 40000 steps (418 resets) in 1337 ms. (29 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (16 resets) in 121 ms. (327 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (18 resets) in 126 ms. (314 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality2176409557573995076.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 147
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :147 after 150
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :150 after 151
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :151 after 155
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :155 after 156
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :156 after 157
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :157 after 163
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :163 after 174
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :174 after 199
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :199 after 235
Interrupted probabilistic random walk after 260056 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :0 out of 2
Probabilistic random walk after 260056 steps, saw 37728 distinct states, run finished after 3001 ms. (steps per millisecond=86 ) properties seen :0
[2025-05-29 20:26:56] [INFO ] Invariant cache hit.
[2025-05-29 20:26:56] [INFO ] State equation strengthened by 1604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 480/481 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-29 20:26:56] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 38/519 variables, 19/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/519 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/521 variables, 2/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :235 after 319
[2025-05-29 20:26:57] [INFO ] Deduced a trap composed of 25 places in 449 ms of which 5 ms to minimize.
[2025-05-29 20:26:57] [INFO ] Deduced a trap composed of 32 places in 426 ms of which 5 ms to minimize.
[2025-05-29 20:26:58] [INFO ] Deduced a trap composed of 31 places in 424 ms of which 5 ms to minimize.
[2025-05-29 20:26:58] [INFO ] Deduced a trap composed of 33 places in 432 ms of which 4 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :319 after 452
[2025-05-29 20:26:58] [INFO ] Deduced a trap composed of 32 places in 399 ms of which 5 ms to minimize.
[2025-05-29 20:26:59] [INFO ] Deduced a trap composed of 29 places in 394 ms of which 4 ms to minimize.
[2025-05-29 20:26:59] [INFO ] Deduced a trap composed of 25 places in 365 ms of which 5 ms to minimize.
[2025-05-29 20:27:00] [INFO ] Deduced a trap composed of 27 places in 349 ms of which 4 ms to minimize.
[2025-05-29 20:27:00] [INFO ] Deduced a trap composed of 30 places in 323 ms of which 4 ms to minimize.
[2025-05-29 20:27:00] [INFO ] Deduced a trap composed of 29 places in 325 ms of which 4 ms to minimize.
[2025-05-29 20:27:01] [INFO ] Deduced a trap composed of 28 places in 314 ms of which 4 ms to minimize.
[2025-05-29 20:27:01] [INFO ] Deduced a trap composed of 29 places in 280 ms of which 4 ms to minimize.
[2025-05-29 20:27:01] [INFO ] Deduced a trap composed of 30 places in 250 ms of which 3 ms to minimize.
SMT process timed out in 5138ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 523 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1666/1666 transitions.
Applied a total of 0 rules in 29 ms. Remains 523 /523 variables (removed 0) and now considering 1666/1666 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 523/523 places, 1666/1666 transitions.
RANDOM walk for 40000 steps (420 resets) in 288 ms. (138 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (17 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :452 after 7461
Interrupted probabilistic random walk after 382840 steps, run timeout after 3001 ms. (steps per millisecond=127 ) properties seen :0 out of 1
Probabilistic random walk after 382840 steps, saw 50976 distinct states, run finished after 3003 ms. (steps per millisecond=127 ) properties seen :0
[2025-05-29 20:27:04] [INFO ] Invariant cache hit.
[2025-05-29 20:27:04] [INFO ] State equation strengthened by 1604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 480/481 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:27:05] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2025-05-29 20:27:05] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2025-05-29 20:27:05] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2025-05-29 20:27:05] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2025-05-29 20:27:05] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2025-05-29 20:27:05] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2025-05-29 20:27:05] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2025-05-29 20:27:05] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2025-05-29 20:27:05] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2025-05-29 20:27:05] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2025-05-29 20:27:05] [INFO ] Deduced a trap composed of 2 places in 64 ms of which 1 ms to minimize.
[2025-05-29 20:27:05] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2025-05-29 20:27:05] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2025-05-29 20:27:05] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
[2025-05-29 20:27:05] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
[2025-05-29 20:27:05] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 38/519 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/519 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/521 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/521 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1666/2187 variables, 521/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2187 variables, 1604/2163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2187 variables, 0/2163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/2189 variables, 2/2165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2189 variables, 0/2165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/2189 variables, 0/2165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2189/2189 variables, and 2165 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1740 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 523/523 constraints, ReadFeed: 1604/1604 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 480/481 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:27:06] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 0 ms to minimize.
[2025-05-29 20:27:06] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2025-05-29 20:27:06] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/481 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 38/519 variables, 19/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/519 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/521 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:27:07] [INFO ] Deduced a trap composed of 25 places in 526 ms of which 5 ms to minimize.
[2025-05-29 20:27:07] [INFO ] Deduced a trap composed of 26 places in 431 ms of which 5 ms to minimize.
[2025-05-29 20:27:08] [INFO ] Deduced a trap composed of 25 places in 425 ms of which 5 ms to minimize.
[2025-05-29 20:27:08] [INFO ] Deduced a trap composed of 25 places in 423 ms of which 5 ms to minimize.
[2025-05-29 20:27:09] [INFO ] Deduced a trap composed of 26 places in 404 ms of which 5 ms to minimize.
[2025-05-29 20:27:09] [INFO ] Deduced a trap composed of 25 places in 426 ms of which 5 ms to minimize.
[2025-05-29 20:27:10] [INFO ] Deduced a trap composed of 24 places in 425 ms of which 5 ms to minimize.
[2025-05-29 20:27:10] [INFO ] Deduced a trap composed of 26 places in 414 ms of which 5 ms to minimize.
[2025-05-29 20:27:10] [INFO ] Deduced a trap composed of 28 places in 440 ms of which 5 ms to minimize.
[2025-05-29 20:27:11] [INFO ] Deduced a trap composed of 32 places in 539 ms of which 5 ms to minimize.
[2025-05-29 20:27:11] [INFO ] Deduced a trap composed of 29 places in 412 ms of which 5 ms to minimize.
[2025-05-29 20:27:12] [INFO ] Deduced a trap composed of 31 places in 413 ms of which 5 ms to minimize.
[2025-05-29 20:27:12] [INFO ] Deduced a trap composed of 29 places in 401 ms of which 5 ms to minimize.
[2025-05-29 20:27:13] [INFO ] Deduced a trap composed of 26 places in 407 ms of which 4 ms to minimize.
[2025-05-29 20:27:13] [INFO ] Deduced a trap composed of 25 places in 415 ms of which 5 ms to minimize.
[2025-05-29 20:27:13] [INFO ] Deduced a trap composed of 26 places in 401 ms of which 5 ms to minimize.
[2025-05-29 20:27:14] [INFO ] Deduced a trap composed of 25 places in 397 ms of which 5 ms to minimize.
[2025-05-29 20:27:14] [INFO ] Deduced a trap composed of 25 places in 401 ms of which 5 ms to minimize.
[2025-05-29 20:27:15] [INFO ] Deduced a trap composed of 25 places in 409 ms of which 5 ms to minimize.
[2025-05-29 20:27:15] [INFO ] Deduced a trap composed of 26 places in 405 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/521 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/521 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1666/2187 variables, 521/582 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2187 variables, 1604/2186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2187 variables, 1/2187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2187 variables, 0/2187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/2189 variables, 2/2189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2189 variables, 0/2189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/2189 variables, 0/2189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2189/2189 variables, and 2189 constraints, problems are : Problem set: 0 solved, 1 unsolved in 10250 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 523/523 constraints, ReadFeed: 1604/1604 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 39/39 constraints]
After SMT, in 12018ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 1 out of 523 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1666/1666 transitions.
Applied a total of 0 rules in 28 ms. Remains 523 /523 variables (removed 0) and now considering 1666/1666 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 523/523 places, 1666/1666 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1666/1666 transitions.
Applied a total of 0 rules in 27 ms. Remains 523 /523 variables (removed 0) and now considering 1666/1666 (removed 0) transitions.
[2025-05-29 20:27:16] [INFO ] Invariant cache hit.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :7461 after 9166
[2025-05-29 20:27:17] [INFO ] Implicit Places using invariants in 689 ms returned []
[2025-05-29 20:27:17] [INFO ] Invariant cache hit.
[2025-05-29 20:27:18] [INFO ] State equation strengthened by 1604 read => feed constraints.
[2025-05-29 20:27:24] [INFO ] Implicit Places using invariants and state equation in 6689 ms returned []
Implicit Place search using SMT with State Equation took 7388 ms to find 0 implicit places.
[2025-05-29 20:27:24] [INFO ] Redundant transitions in 36 ms returned []
Running 1646 sub problems to find dead transitions.
[2025-05-29 20:27:24] [INFO ] Invariant cache hit.
[2025-05-29 20:27:24] [INFO ] State equation strengthened by 1604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/522 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/522 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
Detected timeout of ITS tools.
[2025-05-29 20:27:43] [INFO ] Flatten gal took : 35 ms
[2025-05-29 20:27:43] [INFO ] Applying decomposition
[2025-05-29 20:27:43] [INFO ] Flatten gal took : 46 ms
[2025-05-29 20:27:43] [INFO ] Deduced a trap composed of 29 places in 199 ms of which 3 ms to minimize.
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/graph4861398203279786188.txt' '-o' '/tmp/graph4861398203279786188.bin' '-w' '/tmp/graph4861398203279786188.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4861398203279786188.bin' '-l' '-1' '-v' '-w' '/tmp/graph4861398203279786188.weights' '-q' '0' '-e' '0.001'
[2025-05-29 20:27:43] [INFO ] Decomposing Gal with order
[2025-05-29 20:27:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 20:27:43] [INFO ] Removed a total of 1283 redundant transitions.
[2025-05-29 20:27:43] [INFO ] Flatten gal took : 79 ms
[2025-05-29 20:27:43] [INFO ] Deduced a trap composed of 32 places in 185 ms of which 3 ms to minimize.
[2025-05-29 20:27:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 1394 labels/synchronizations in 28 ms.
[2025-05-29 20:27:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3780935105663831996.gal : 14 ms
[2025-05-29 20:27:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12523401183256893076.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/ReachabilityCardinality3780935105663831996.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12523401183256893076.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 ...308
[2025-05-29 20:27:43] [INFO ] Deduced a trap composed of 27 places in 174 ms of which 5 ms to minimize.
Loading property file /tmp/ReachabilityCardinality12523401183256893076.prop.
[2025-05-29 20:27:44] [INFO ] Deduced a trap composed of 26 places in 289 ms of which 4 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 734
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :734 after 734
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :734 after 734
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :734 after 734
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :734 after 734
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :734 after 734
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :734 after 734
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :734 after 769
[2025-05-29 20:27:44] [INFO ] Deduced a trap composed of 28 places in 199 ms of which 2 ms to minimize.
[2025-05-29 20:27:44] [INFO ] Deduced a trap composed of 27 places in 147 ms of which 3 ms to minimize.
[2025-05-29 20:27:44] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 2 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :769 after 2761
[2025-05-29 20:27:44] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 3 ms to minimize.
[2025-05-29 20:27:45] [INFO ] Deduced a trap composed of 28 places in 156 ms of which 3 ms to minimize.
[2025-05-29 20:27:45] [INFO ] Deduced a trap composed of 32 places in 155 ms of which 3 ms to minimize.
[2025-05-29 20:27:45] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 2 ms to minimize.
[2025-05-29 20:27:45] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 2 ms to minimize.
[2025-05-29 20:27:45] [INFO ] Deduced a trap composed of 25 places in 121 ms of which 2 ms to minimize.
[2025-05-29 20:27:45] [INFO ] Deduced a trap composed of 28 places in 134 ms of which 3 ms to minimize.
[2025-05-29 20:27:46] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 2 ms to minimize.
[2025-05-29 20:27:46] [INFO ] Deduced a trap composed of 28 places in 140 ms of which 3 ms to minimize.
[2025-05-29 20:27:46] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 2 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2761 after 136578
[2025-05-29 20:27:46] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 2 ms to minimize.
[2025-05-29 20:27:46] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 2 ms to minimize.
[2025-05-29 20:27:46] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/522 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
[2025-05-29 20:27:47] [INFO ] Deduced a trap composed of 25 places in 322 ms of which 5 ms to minimize.
[2025-05-29 20:27:48] [INFO ] Deduced a trap composed of 33 places in 316 ms of which 4 ms to minimize.
[2025-05-29 20:27:48] [INFO ] Deduced a trap composed of 27 places in 282 ms of which 4 ms to minimize.
[2025-05-29 20:27:48] [INFO ] Deduced a trap composed of 25 places in 238 ms of which 3 ms to minimize.
[2025-05-29 20:27:48] [INFO ] Deduced a trap composed of 25 places in 287 ms of which 5 ms to minimize.
[2025-05-29 20:27:49] [INFO ] Deduced a trap composed of 26 places in 264 ms of which 4 ms to minimize.
[2025-05-29 20:27:49] [INFO ] Deduced a trap composed of 27 places in 260 ms of which 4 ms to minimize.
[2025-05-29 20:27:49] [INFO ] Deduced a trap composed of 27 places in 286 ms of which 4 ms to minimize.
[2025-05-29 20:27:50] [INFO ] Deduced a trap composed of 25 places in 259 ms of which 4 ms to minimize.
[2025-05-29 20:27:50] [INFO ] Deduced a trap composed of 26 places in 201 ms of which 3 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :136578 after 6.01051e+06
[2025-05-29 20:27:50] [INFO ] Deduced a trap composed of 25 places in 198 ms of which 4 ms to minimize.
[2025-05-29 20:27:50] [INFO ] Deduced a trap composed of 26 places in 242 ms of which 3 ms to minimize.
[2025-05-29 20:27:51] [INFO ] Deduced a trap composed of 26 places in 221 ms of which 8 ms to minimize.
[2025-05-29 20:27:51] [INFO ] Deduced a trap composed of 25 places in 241 ms of which 4 ms to minimize.
[2025-05-29 20:27:51] [INFO ] Deduced a trap composed of 27 places in 220 ms of which 4 ms to minimize.
[2025-05-29 20:27:51] [INFO ] Deduced a trap composed of 3 places in 420 ms of which 6 ms to minimize.
[2025-05-29 20:27:52] [INFO ] Deduced a trap composed of 22 places in 528 ms of which 7 ms to minimize.
[2025-05-29 20:27:53] [INFO ] Deduced a trap composed of 3 places in 515 ms of which 6 ms to minimize.
[2025-05-29 20:27:53] [INFO ] Deduced a trap composed of 25 places in 450 ms of which 6 ms to minimize.
[2025-05-29 20:27:53] [INFO ] Deduced a trap composed of 25 places in 384 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/522 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 522/2189 variables, and 62 constraints, problems are : Problem set: 0 solved, 1646 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/523 constraints, ReadFeed: 0/1604 constraints, PredecessorRefiner: 1646/1646 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1646 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/522 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/522 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/522 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
[2025-05-29 20:27:58] [INFO ] Deduced a trap composed of 25 places in 188 ms of which 4 ms to minimize.
[2025-05-29 20:27:58] [INFO ] Deduced a trap composed of 26 places in 138 ms of which 4 ms to minimize.
[2025-05-29 20:27:58] [INFO ] Deduced a trap composed of 26 places in 134 ms of which 3 ms to minimize.
[2025-05-29 20:27:58] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 2 ms to minimize.
[2025-05-29 20:27:58] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 2 ms to minimize.
[2025-05-29 20:27:58] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 3 ms to minimize.
[2025-05-29 20:27:59] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 6 ms to minimize.
[2025-05-29 20:27:59] [INFO ] Deduced a trap composed of 27 places in 505 ms of which 7 ms to minimize.
[2025-05-29 20:28:00] [INFO ] Deduced a trap composed of 26 places in 503 ms of which 6 ms to minimize.
[2025-05-29 20:28:00] [INFO ] Deduced a trap composed of 29 places in 473 ms of which 6 ms to minimize.
[2025-05-29 20:28:01] [INFO ] Deduced a trap composed of 31 places in 468 ms of which 6 ms to minimize.
[2025-05-29 20:28:01] [INFO ] Deduced a trap composed of 27 places in 450 ms of which 5 ms to minimize.
[2025-05-29 20:28:01] [INFO ] Deduced a trap composed of 30 places in 345 ms of which 5 ms to minimize.
[2025-05-29 20:28:02] [INFO ] Deduced a trap composed of 25 places in 287 ms of which 3 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :6.01051e+06 after 8.9081e+06
[2025-05-29 20:28:02] [INFO ] Deduced a trap composed of 32 places in 283 ms of which 5 ms to minimize.
[2025-05-29 20:28:02] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 2 ms to minimize.
[2025-05-29 20:28:03] [INFO ] Deduced a trap composed of 25 places in 375 ms of which 5 ms to minimize.
[2025-05-29 20:28:03] [INFO ] Deduced a trap composed of 34 places in 369 ms of which 5 ms to minimize.
[2025-05-29 20:28:03] [INFO ] Deduced a trap composed of 32 places in 296 ms of which 5 ms to minimize.
[2025-05-29 20:28:04] [INFO ] Deduced a trap composed of 31 places in 361 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/522 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
[2025-05-29 20:28:05] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 2 ms to minimize.
[2025-05-29 20:28:05] [INFO ] Deduced a trap composed of 31 places in 424 ms of which 6 ms to minimize.
[2025-05-29 20:28:06] [INFO ] Deduced a trap composed of 29 places in 391 ms of which 6 ms to minimize.
[2025-05-29 20:28:06] [INFO ] Deduced a trap composed of 27 places in 368 ms of which 5 ms to minimize.
[2025-05-29 20:28:06] [INFO ] Deduced a trap composed of 28 places in 363 ms of which 5 ms to minimize.
[2025-05-29 20:28:07] [INFO ] Deduced a trap composed of 28 places in 360 ms of which 5 ms to minimize.
[2025-05-29 20:28:07] [INFO ] Deduced a trap composed of 27 places in 308 ms of which 4 ms to minimize.
[2025-05-29 20:28:07] [INFO ] Deduced a trap composed of 26 places in 286 ms of which 4 ms to minimize.
[2025-05-29 20:28:08] [INFO ] Deduced a trap composed of 27 places in 263 ms of which 4 ms to minimize.
[2025-05-29 20:28:08] [INFO ] Deduced a trap composed of 25 places in 230 ms of which 3 ms to minimize.
[2025-05-29 20:28:08] [INFO ] Deduced a trap composed of 25 places in 215 ms of which 3 ms to minimize.
[2025-05-29 20:28:08] [INFO ] Deduced a trap composed of 32 places in 149 ms of which 3 ms to minimize.
[2025-05-29 20:28:08] [INFO ] Deduced a trap composed of 31 places in 184 ms of which 3 ms to minimize.
[2025-05-29 20:28:09] [INFO ] Deduced a trap composed of 31 places in 147 ms of which 2 ms to minimize.
[2025-05-29 20:28:09] [INFO ] Deduced a trap composed of 31 places in 187 ms of which 3 ms to minimize.
[2025-05-29 20:28:09] [INFO ] Deduced a trap composed of 31 places in 173 ms of which 3 ms to minimize.
[2025-05-29 20:28:09] [INFO ] Deduced a trap composed of 25 places in 171 ms of which 3 ms to minimize.
[2025-05-29 20:28:09] [INFO ] Deduced a trap composed of 27 places in 159 ms of which 3 ms to minimize.
[2025-05-29 20:28:09] [INFO ] Deduced a trap composed of 38 places in 114 ms of which 3 ms to minimize.
[2025-05-29 20:28:10] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/522 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
[2025-05-29 20:28:11] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 1 ms to minimize.
[2025-05-29 20:28:11] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2025-05-29 20:28:11] [INFO ] Deduced a trap composed of 22 places in 424 ms of which 5 ms to minimize.
[2025-05-29 20:28:12] [INFO ] Deduced a trap composed of 22 places in 382 ms of which 4 ms to minimize.
[2025-05-29 20:28:12] [INFO ] Deduced a trap composed of 22 places in 342 ms of which 4 ms to minimize.
[2025-05-29 20:28:12] [INFO ] Deduced a trap composed of 22 places in 336 ms of which 4 ms to minimize.
[2025-05-29 20:28:13] [INFO ] Deduced a trap composed of 22 places in 334 ms of which 4 ms to minimize.
[2025-05-29 20:28:13] [INFO ] Deduced a trap composed of 2 places in 341 ms of which 4 ms to minimize.
[2025-05-29 20:28:13] [INFO ] Deduced a trap composed of 2 places in 337 ms of which 4 ms to minimize.
[2025-05-29 20:28:14] [INFO ] Deduced a trap composed of 2 places in 351 ms of which 4 ms to minimize.
[2025-05-29 20:28:14] [INFO ] Deduced a trap composed of 29 places in 379 ms of which 4 ms to minimize.
[2025-05-29 20:28:14] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2025-05-29 20:28:15] [INFO ] Deduced a trap composed of 28 places in 312 ms of which 4 ms to minimize.
[2025-05-29 20:28:15] [INFO ] Deduced a trap composed of 25 places in 278 ms of which 3 ms to minimize.
[2025-05-29 20:28:15] [INFO ] Deduced a trap composed of 30 places in 251 ms of which 3 ms to minimize.
[2025-05-29 20:28:15] [INFO ] Deduced a trap composed of 25 places in 240 ms of which 3 ms to minimize.
[2025-05-29 20:28:16] [INFO ] Deduced a trap composed of 34 places in 222 ms of which 3 ms to minimize.
[2025-05-29 20:28:16] [INFO ] Deduced a trap composed of 25 places in 200 ms of which 3 ms to minimize.
[2025-05-29 20:28:16] [INFO ] Deduced a trap composed of 25 places in 184 ms of which 3 ms to minimize.
[2025-05-29 20:28:16] [INFO ] Deduced a trap composed of 25 places in 184 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/522 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
[2025-05-29 20:28:18] [INFO ] Deduced a trap composed of 26 places in 186 ms of which 3 ms to minimize.
[2025-05-29 20:28:18] [INFO ] Deduced a trap composed of 25 places in 151 ms of which 3 ms to minimize.
[2025-05-29 20:28:18] [INFO ] Deduced a trap composed of 28 places in 158 ms of which 3 ms to minimize.
[2025-05-29 20:28:18] [INFO ] Deduced a trap composed of 24 places in 167 ms of which 3 ms to minimize.
[2025-05-29 20:28:18] [INFO ] Deduced a trap composed of 28 places in 149 ms of which 3 ms to minimize.
[2025-05-29 20:28:18] [INFO ] Deduced a trap composed of 25 places in 165 ms of which 2 ms to minimize.
[2025-05-29 20:28:19] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 2 ms to minimize.
[2025-05-29 20:28:19] [INFO ] Deduced a trap composed of 26 places in 185 ms of which 3 ms to minimize.
[2025-05-29 20:28:19] [INFO ] Deduced a trap composed of 25 places in 149 ms of which 2 ms to minimize.
[2025-05-29 20:28:19] [INFO ] Deduced a trap composed of 33 places in 166 ms of which 3 ms to minimize.
[2025-05-29 20:28:19] [INFO ] Deduced a trap composed of 30 places in 171 ms of which 3 ms to minimize.
[2025-05-29 20:28:19] [INFO ] Deduced a trap composed of 25 places in 170 ms of which 2 ms to minimize.
[2025-05-29 20:28:20] [INFO ] Deduced a trap composed of 26 places in 187 ms of which 3 ms to minimize.
[2025-05-29 20:28:20] [INFO ] Deduced a trap composed of 30 places in 206 ms of which 2 ms to minimize.
[2025-05-29 20:28:20] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2025-05-29 20:28:20] [INFO ] Deduced a trap composed of 31 places in 164 ms of which 3 ms to minimize.
[2025-05-29 20:28:20] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 2 ms to minimize.
[2025-05-29 20:28:20] [INFO ] Deduced a trap composed of 25 places in 154 ms of which 3 ms to minimize.
[2025-05-29 20:28:21] [INFO ] Deduced a trap composed of 28 places in 175 ms of which 3 ms to minimize.
[2025-05-29 20:28:21] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
[2025-05-29 20:28:22] [INFO ] Deduced a trap composed of 27 places in 172 ms of which 2 ms to minimize.
[2025-05-29 20:28:22] [INFO ] Deduced a trap composed of 30 places in 143 ms of which 2 ms to minimize.
[2025-05-29 20:28:22] [INFO ] Deduced a trap composed of 25 places in 144 ms of which 2 ms to minimize.
[2025-05-29 20:28:22] [INFO ] Deduced a trap composed of 26 places in 168 ms of which 3 ms to minimize.
[2025-05-29 20:28:22] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 2 ms to minimize.
[2025-05-29 20:28:23] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 5 ms to minimize.
[2025-05-29 20:28:23] [INFO ] Deduced a trap composed of 25 places in 126 ms of which 2 ms to minimize.
[2025-05-29 20:28:23] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 2 ms to minimize.
[2025-05-29 20:28:23] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 2 ms to minimize.
[2025-05-29 20:28:23] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 2 ms to minimize.
[2025-05-29 20:28:23] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 2 ms to minimize.
[2025-05-29 20:28:23] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 2 ms to minimize.
[2025-05-29 20:28:23] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 2 ms to minimize.
[2025-05-29 20:28:23] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 2 ms to minimize.
[2025-05-29 20:28:24] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 2 ms to minimize.
[2025-05-29 20:28:24] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 2 ms to minimize.
[2025-05-29 20:28:24] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2025-05-29 20:28:24] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 522/2189 variables, and 160 constraints, problems are : Problem set: 0 solved, 1646 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/523 constraints, ReadFeed: 0/1604 constraints, PredecessorRefiner: 0/1646 constraints, Known Traps: 138/138 constraints]
After SMT, in 60849ms problems are : Problem set: 0 solved, 1646 unsolved
Search for dead transitions found 0 dead transitions in 60866ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68329 ms. Remains : 523/523 places, 1666/1666 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1543 edges and 523 vertex of which 439 / 523 are part of one of the 2 SCC in 0 ms
Free SCC test removed 437 places
Drop transitions (Empty/Sink Transition effects.) removed 1165 transitions
Ensure Unique test removed 412 transitions
Reduce isomorphic transitions removed 1577 transitions.
Graph (complete) has 211 edges and 86 vertex of which 25 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.1 ms
Discarding 61 places :
Also discarding 19 output transitions
Drop transitions (Output transitions of discarded places.) removed 19 transitions
Drop transitions (Empty/Sink Transition effects.) removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 25 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 24 transition count 28
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 63 place count 6 transition count 10
Iterating global reduction 2 with 18 rules applied. Total rules applied 81 place count 6 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 83 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 86 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 4 transition count 5
Applied a total of 87 rules in 8 ms. Remains 4 /523 variables (removed 519) and now considering 5/1666 (removed 1661) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 4 cols
[2025-05-29 20:28:25] [INFO ] Computed 0 invariants in 1 ms
[2025-05-29 20:28:25] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-29 20:28:25] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-29 20:28:25] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-29 20:28:25] [INFO ] After 26ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-05-29 20:28:25] [INFO ] Flatten gal took : 1 ms
[2025-05-29 20:28:25] [INFO ] Flatten gal took : 0 ms
[2025-05-29 20:28:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4504441385060644045.gal : 1 ms
[2025-05-29 20:28:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13109701012362749438.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/ReachabilityCardinality4504441385060644045.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13109701012362749438.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 ...329
Loading property file /tmp/ReachabilityCardinality13109701012362749438.prop.
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 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,6,0.006646,3516,2,7,6,33,6,0,21,18,0
Total reachable state count : 6

Verifying 1 reachability properties.
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,0.007053,3892,2,5,6,33,7,0,24,18,0
Over-approximation ignoring read arcs solved 0 properties in 78 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[20]
Ending property specific reduction for CANInsertWithFailure-PT-020-UpperBounds-15 in 147392 ms.
[2025-05-29 20:28:25] [INFO ] Flatten gal took : 28 ms
[2025-05-29 20:28:25] [INFO ] Applying decomposition
[2025-05-29 20:28:25] [INFO ] Flatten gal took : 29 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/graph18222229201172165984.txt' '-o' '/tmp/graph18222229201172165984.bin' '-w' '/tmp/graph18222229201172165984.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18222229201172165984.bin' '-l' '-1' '-v' '-w' '/tmp/graph18222229201172165984.weights' '-q' '0' '-e' '0.001'
[2025-05-29 20:28:25] [INFO ] Decomposing Gal with order
[2025-05-29 20:28:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 20:28:25] [INFO ] Removed a total of 1268 redundant transitions.
[2025-05-29 20:28:25] [INFO ] Flatten gal took : 77 ms
[2025-05-29 20:28:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 1221 labels/synchronizations in 26 ms.
[2025-05-29 20:28:25] [INFO ] Time to serialize gal into /tmp/UpperBounds11296419606716150967.gal : 14 ms
[2025-05-29 20:28:25] [INFO ] Time to serialize properties into /tmp/UpperBounds17513097285532708085.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/UpperBounds11296419606716150967.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds17513097285532708085.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 ...285
Loading property file /tmp/UpperBounds17513097285532708085.prop.
ITS-tools command line returned an error code 137
[2025-05-29 20:42:01] [INFO ] Flatten gal took : 29 ms
[2025-05-29 20:42:01] [INFO ] Time to serialize gal into /tmp/UpperBounds18158698071442673982.gal : 7 ms
[2025-05-29 20:42:01] [INFO ] Time to serialize properties into /tmp/UpperBounds4185703410404637484.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/UpperBounds18158698071442673982.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds4185703410404637484.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 ...305
Loading property file /tmp/UpperBounds4185703410404637484.prop.

BK_TIME_CONFINEMENT_REACHED

--------------------
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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -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 UpperBounds -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="CANInsertWithFailure-PT-020"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is CANInsertWithFailure-PT-020, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r041-smll-174853822500034"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-020.tgz
mv CANInsertWithFailure-PT-020 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;