MCC'2025- Execution of r111-smll-174867015800020

About the Execution of 2024-gold for FunctionPointer-PT-c064

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
15689.950	3600000.00	5119115.00	11959.90	0 0 0 ? 0 0 1 0 64 ? 0 ? ? ? ? ?	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.r111-smll-174867015800020.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 FunctionPointer-PT-c064, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-smll-174867015800020
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.7M
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K 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 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 4.2M 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 FunctionPointer-PT-c064-UpperBounds-00
FORMULA_NAME FunctionPointer-PT-c064-UpperBounds-01
FORMULA_NAME FunctionPointer-PT-c064-UpperBounds-02
FORMULA_NAME FunctionPointer-PT-c064-UpperBounds-03
FORMULA_NAME FunctionPointer-PT-c064-UpperBounds-04
FORMULA_NAME FunctionPointer-PT-c064-UpperBounds-05
FORMULA_NAME FunctionPointer-PT-c064-UpperBounds-06
FORMULA_NAME FunctionPointer-PT-c064-UpperBounds-07
FORMULA_NAME FunctionPointer-PT-c064-UpperBounds-08
FORMULA_NAME FunctionPointer-PT-c064-UpperBounds-09
FORMULA_NAME FunctionPointer-PT-c064-UpperBounds-10
FORMULA_NAME FunctionPointer-PT-c064-UpperBounds-11
FORMULA_NAME FunctionPointer-PT-c064-UpperBounds-12
FORMULA_NAME FunctionPointer-PT-c064-UpperBounds-13
FORMULA_NAME FunctionPointer-PT-c064-UpperBounds-14
FORMULA_NAME FunctionPointer-PT-c064-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748780557821

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c064
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-01 12:22:40] [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-06-01 12:22:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 12:22:41] [INFO ] Load time of PNML (sax parser for PT used): 937 ms
[2025-06-01 12:22:41] [INFO ] Transformed 2826 places.
[2025-06-01 12:22:41] [INFO ] Transformed 8960 transitions.
[2025-06-01 12:22:41] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 1249 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
Deduced a syphon composed of 1198 places in 58 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c064-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+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] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-01 12:22:42] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2025-06-01 12:22:42] [INFO ] Computed 4 invariants in 123 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 64, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 10000 steps (2 resets) in 216 ms. (46 steps per ms)
BEST_FIRST walk for 90009 steps (30 resets) in 433 ms. (207 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 0, 1, 0, 0, 1, 0, 0, 0] Max Struct:[+inf, 1, 64, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-01 12:22:43] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
[2025-06-01 12:22:43] [INFO ] Invariant cache hit.
[2025-06-01 12:22:43] [INFO ] [Real]Absence check using 3 positive place invariants in 37 ms returned sat
[2025-06-01 12:22:43] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 12:22:45] [INFO ] [Real]Absence check using state equation in 1500 ms returned sat
[2025-06-01 12:22:45] [INFO ] State equation strengthened by 479 read => feed constraints.
[2025-06-01 12:22:45] [INFO ] [Real]Added 479 Read/Feed constraints in 332 ms returned sat
[2025-06-01 12:22:46] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:22:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 21 ms returned sat
[2025-06-01 12:22:46] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:22:47] [INFO ] [Nat]Absence check using state equation in 1381 ms returned sat
[2025-06-01 12:22:48] [INFO ] [Nat]Added 479 Read/Feed constraints in 252 ms returned sat
[2025-06-01 12:22:49] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 1213 ms.
[2025-06-01 12:22:50] [INFO ] Added : 2 causal constraints over 1 iterations in 2261 ms. Result :sat
Minimization took 486 ms.
[2025-06-01 12:22:51] [INFO ] [Real]Absence check using 3 positive place invariants in 31 ms returned sat
[2025-06-01 12:22:51] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 12:22:52] [INFO ] [Real]Absence check using state equation in 1363 ms returned sat
[2025-06-01 12:22:53] [INFO ] [Real]Added 479 Read/Feed constraints in 220 ms returned sat
[2025-06-01 12:22:53] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:22:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 43 ms returned sat
[2025-06-01 12:22:53] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 5 ms returned sat
[2025-06-01 12:22:55] [INFO ] [Nat]Absence check using state equation in 1395 ms returned sat
[2025-06-01 12:22:55] [INFO ] [Nat]Added 479 Read/Feed constraints in 187 ms returned sat
[2025-06-01 12:22:56] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 869 ms.
[2025-06-01 12:22:57] [INFO ] Added : 2 causal constraints over 1 iterations in 1457 ms. Result :sat
Minimization took 605 ms.
[2025-06-01 12:22:57] [INFO ] [Real]Absence check using 3 positive place invariants in 31 ms returned sat
[2025-06-01 12:22:57] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 5 ms returned sat
[2025-06-01 12:22:59] [INFO ] [Real]Absence check using state equation in 1577 ms returned sat
[2025-06-01 12:23:00] [INFO ] [Real]Added 479 Read/Feed constraints in 290 ms returned sat
[2025-06-01 12:23:00] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:23:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 33 ms returned sat
[2025-06-01 12:23:00] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:23:02] [INFO ] [Nat]Absence check using state equation in 1668 ms returned sat
[2025-06-01 12:23:02] [INFO ] [Nat]Added 479 Read/Feed constraints in 663 ms returned sat
[2025-06-01 12:23:03] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 649 ms.
[2025-06-01 12:23:04] [INFO ] Added : 3 causal constraints over 1 iterations in 1411 ms. Result :sat
Minimization took 653 ms.
[2025-06-01 12:23:05] [INFO ] [Real]Absence check using 3 positive place invariants in 31 ms returned sat
[2025-06-01 12:23:05] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:23:07] [INFO ] [Real]Absence check using state equation in 1647 ms returned sat
[2025-06-01 12:23:07] [INFO ] [Real]Added 479 Read/Feed constraints in 301 ms returned sat
[2025-06-01 12:23:07] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:23:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 32 ms returned sat
[2025-06-01 12:23:08] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 12:23:09] [INFO ] [Nat]Absence check using state equation in 1555 ms returned sat
[2025-06-01 12:23:10] [INFO ] [Nat]Added 479 Read/Feed constraints in 229 ms returned sat
[2025-06-01 12:23:11] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 792 ms.
[2025-06-01 12:23:15] [INFO ] Deduced a trap composed of 142 places in 3196 ms of which 204 ms to minimize.
[2025-06-01 12:23:15] [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.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1128)
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-06-01 12:23:15] [INFO ] [Real]Absence check using 3 positive place invariants in 27 ms returned sat
[2025-06-01 12:23:15] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:23:17] [INFO ] [Real]Absence check using state equation in 1587 ms returned sat
[2025-06-01 12:23:17] [INFO ] [Real]Added 479 Read/Feed constraints in 483 ms returned sat
[2025-06-01 12:23:17] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:23:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 32 ms returned sat
[2025-06-01 12:23:18] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:23:19] [INFO ] [Nat]Absence check using state equation in 1495 ms returned sat
[2025-06-01 12:23:20] [INFO ] [Nat]Added 479 Read/Feed constraints in 142 ms returned sat
[2025-06-01 12:23:20] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 536 ms.
[2025-06-01 12:23:24] [INFO ] Deduced a trap composed of 142 places in 2872 ms of which 26 ms to minimize.
[2025-06-01 12:23:24] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
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.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1128)
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-06-01 12:23:24] [INFO ] [Real]Absence check using 3 positive place invariants in 32 ms returned sat
[2025-06-01 12:23:24] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:23:25] [INFO ] [Real]Absence check using state equation in 1507 ms returned sat
[2025-06-01 12:23:26] [INFO ] [Real]Added 479 Read/Feed constraints in 164 ms returned sat
[2025-06-01 12:23:26] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:23:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 21 ms returned sat
[2025-06-01 12:23:26] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:23:28] [INFO ] [Nat]Absence check using state equation in 1346 ms returned sat
[2025-06-01 12:23:28] [INFO ] [Nat]Added 479 Read/Feed constraints in 274 ms returned sat
[2025-06-01 12:23:30] [INFO ] Deduced a trap composed of 134 places in 2542 ms of which 21 ms to minimize.
[2025-06-01 12:23:33] [INFO ] Deduced a trap composed of 133 places in 2601 ms of which 20 ms to minimize.
[2025-06-01 12:23:33] [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 5
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.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
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-06-01 12:23:34] [INFO ] [Real]Absence check using 3 positive place invariants in 32 ms returned sat
[2025-06-01 12:23:34] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:23:35] [INFO ] [Real]Absence check using state equation in 1387 ms returned sat
[2025-06-01 12:23:35] [INFO ] [Real]Added 479 Read/Feed constraints in 241 ms returned sat
[2025-06-01 12:23:36] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:23:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 19 ms returned sat
[2025-06-01 12:23:36] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 12:23:37] [INFO ] [Nat]Absence check using state equation in 1342 ms returned sat
[2025-06-01 12:23:37] [INFO ] [Nat]Added 479 Read/Feed constraints in 126 ms returned sat
[2025-06-01 12:23:38] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 628 ms.
[2025-06-01 12:23:39] [INFO ] Added : 1 causal constraints over 1 iterations in 1226 ms. Result :sat
Minimization took 614 ms.
[2025-06-01 12:23:40] [INFO ] [Real]Absence check using 3 positive place invariants in 19 ms returned sat
[2025-06-01 12:23:40] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:23:41] [INFO ] [Real]Absence check using state equation in 1439 ms returned sat
[2025-06-01 12:23:42] [INFO ] [Real]Added 479 Read/Feed constraints in 551 ms returned sat
[2025-06-01 12:23:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:23:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 32 ms returned sat
[2025-06-01 12:23:42] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:23:44] [INFO ] [Nat]Absence check using state equation in 1694 ms returned sat
[2025-06-01 12:23:44] [INFO ] [Nat]Added 479 Read/Feed constraints in 186 ms returned sat
[2025-06-01 12:23:45] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 528 ms.
[2025-06-01 12:23:45] [INFO ] Added : 2 causal constraints over 1 iterations in 1007 ms. Result :sat
Minimization took 638 ms.
[2025-06-01 12:23:46] [INFO ] [Real]Absence check using 3 positive place invariants in 28 ms returned sat
[2025-06-01 12:23:46] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 12:23:48] [INFO ] [Real]Absence check using state equation in 1523 ms returned sat
[2025-06-01 12:23:48] [INFO ] [Real]Added 479 Read/Feed constraints in 255 ms returned sat
[2025-06-01 12:23:48] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:23:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 33 ms returned sat
[2025-06-01 12:23:49] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:23:50] [INFO ] [Nat]Absence check using state equation in 1535 ms returned sat
[2025-06-01 12:23:51] [INFO ] [Nat]Added 479 Read/Feed constraints in 163 ms returned sat
[2025-06-01 12:23:51] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 531 ms.
[2025-06-01 12:23:52] [INFO ] Added : 1 causal constraints over 1 iterations in 966 ms. Result :sat
Minimization took 616 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 0, 1, 0, 0, 1, 0, 0, 0] Max Struct:[+inf, 1, 64, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 0, 1, 0, 0, 1, 0, 0, 0] Max Struct:[+inf, 1, 64, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 9 out of 1628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Graph (complete) has 7332 edges and 1628 vertex of which 1422 are kept as prefixes of interest. Removing 206 places using SCC suffix rule.32 ms
Discarding 206 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 378 transitions
Reduce isomorphic transitions removed 378 transitions.
Iterating post reduction 0 with 378 rules applied. Total rules applied 379 place count 1422 transition count 5584
Discarding 298 places :
Symmetric choice reduction at 1 with 298 rule applications. Total rules 677 place count 1124 transition count 3296
Iterating global reduction 1 with 298 rules applied. Total rules applied 975 place count 1124 transition count 3296
Ensure Unique test removed 348 transitions
Reduce isomorphic transitions removed 348 transitions.
Iterating post reduction 1 with 348 rules applied. Total rules applied 1323 place count 1124 transition count 2948
Discarding 154 places :
Symmetric choice reduction at 2 with 154 rule applications. Total rules 1477 place count 970 transition count 2640
Iterating global reduction 2 with 154 rules applied. Total rules applied 1631 place count 970 transition count 2640
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 2 with 60 rules applied. Total rules applied 1691 place count 970 transition count 2580
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1705 place count 956 transition count 2552
Iterating global reduction 3 with 14 rules applied. Total rules applied 1719 place count 956 transition count 2552
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1733 place count 942 transition count 2524
Iterating global reduction 3 with 14 rules applied. Total rules applied 1747 place count 942 transition count 2524
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1761 place count 928 transition count 2496
Iterating global reduction 3 with 14 rules applied. Total rules applied 1775 place count 928 transition count 2496
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1789 place count 914 transition count 2468
Iterating global reduction 3 with 14 rules applied. Total rules applied 1803 place count 914 transition count 2468
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1817 place count 900 transition count 2440
Iterating global reduction 3 with 14 rules applied. Total rules applied 1831 place count 900 transition count 2440
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1844 place count 887 transition count 2414
Iterating global reduction 3 with 13 rules applied. Total rules applied 1857 place count 887 transition count 2414
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1869 place count 875 transition count 2390
Iterating global reduction 3 with 12 rules applied. Total rules applied 1881 place count 875 transition count 2390
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 1933 place count 823 transition count 2194
Iterating global reduction 3 with 52 rules applied. Total rules applied 1985 place count 823 transition count 2194
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 2043 place count 765 transition count 1962
Iterating global reduction 3 with 58 rules applied. Total rules applied 2101 place count 765 transition count 1962
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 2158 place count 708 transition count 1824
Iterating global reduction 3 with 57 rules applied. Total rules applied 2215 place count 708 transition count 1824
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 2272 place count 651 transition count 1710
Iterating global reduction 3 with 57 rules applied. Total rules applied 2329 place count 651 transition count 1710
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 2386 place count 594 transition count 1596
Iterating global reduction 3 with 57 rules applied. Total rules applied 2443 place count 594 transition count 1596
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 2500 place count 537 transition count 1482
Iterating global reduction 3 with 57 rules applied. Total rules applied 2557 place count 537 transition count 1482
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 2612 place count 482 transition count 1372
Iterating global reduction 3 with 55 rules applied. Total rules applied 2667 place count 482 transition count 1372
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 2679 place count 470 transition count 1348
Iterating global reduction 3 with 12 rules applied. Total rules applied 2691 place count 470 transition count 1348
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 2703 place count 470 transition count 1336
Applied a total of 2703 rules in 1976 ms. Remains 470 /1628 variables (removed 1158) and now considering 1336/5962 (removed 4626) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1997 ms. Remains : 470/1628 places, 1336/5962 transitions.
[2025-06-01 12:23:54] [INFO ] Flow matrix only has 774 transitions (discarded 562 similar events)
Found an invariant !
This invariant on transitions {251=1, 388=1, 592=1, 758=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {225=1, 362=1, 694=1, 764=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 432 ms. (steps per millisecond=23 ) properties (out of 9) seen :[2, 1, 1, 2, 1, 0, 1, 2, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[4, 1, 1, 2, 1, 1, 1, 2, 2] Max Struct:[+inf, 1, 64, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-01 12:23:55] [INFO ] Flow matrix only has 774 transitions (discarded 562 similar events)
// Phase 1: matrix 774 rows 470 cols
[2025-06-01 12:23:55] [INFO ] Computed 2 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[4, 1, 1, 2, 1, 1, 1, 2, 2] Max Struct:[+inf, 1, 64, +inf, +inf, +inf, +inf, +inf, +inf]
FORMULA FunctionPointer-PT-c064-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 3692 ms. (270 steps per ms)
BEST_FIRST walk for 8000008 steps (17 resets) in 15972 ms. (500 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[89, 3, 6, 79, 28, 55, 63, 134] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-01 12:24:15] [INFO ] Flow matrix only has 774 transitions (discarded 562 similar events)
[2025-06-01 12:24:15] [INFO ] Invariant cache hit.
[2025-06-01 12:24:15] [INFO ] [Real]Absence check using 1 positive place invariants in 11 ms returned sat
[2025-06-01 12:24:15] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:24:16] [INFO ] [Real]Absence check using state equation in 414 ms returned sat
[2025-06-01 12:24:16] [INFO ] State equation strengthened by 97 read => feed constraints.
[2025-06-01 12:24:16] [INFO ] [Real]Added 97 Read/Feed constraints in 95 ms returned sat
[2025-06-01 12:24:16] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:24:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 10 ms returned sat
[2025-06-01 12:24:16] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:24:16] [INFO ] [Nat]Absence check using state equation in 393 ms returned sat
[2025-06-01 12:24:17] [INFO ] [Nat]Added 97 Read/Feed constraints in 85 ms returned sat
[2025-06-01 12:24:17] [INFO ] Computed and/alt/rep : 112/245/100 causal constraints (skipped 672 transitions) in 141 ms.
[2025-06-01 12:24:17] [INFO ] Added : 24 causal constraints over 8 iterations in 763 ms. Result :sat
Minimization took 936 ms.
[2025-06-01 12:24:18] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-01 12:24:18] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2025-06-01 12:24:19] [INFO ] [Real]Absence check using state equation in 276 ms returned sat
[2025-06-01 12:24:19] [INFO ] [Real]Added 97 Read/Feed constraints in 100 ms returned sat
[2025-06-01 12:24:19] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:24:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 10 ms returned sat
[2025-06-01 12:24:19] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 12:24:19] [INFO ] [Nat]Absence check using state equation in 437 ms returned sat
[2025-06-01 12:24:20] [INFO ] [Nat]Added 97 Read/Feed constraints in 98 ms returned sat
[2025-06-01 12:24:20] [INFO ] Computed and/alt/rep : 112/245/100 causal constraints (skipped 672 transitions) in 187 ms.
[2025-06-01 12:24:20] [INFO ] Added : 1 causal constraints over 1 iterations in 364 ms. Result :sat
Minimization took 848 ms.
[2025-06-01 12:24:21] [INFO ] [Real]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-01 12:24:21] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 12:24:21] [INFO ] [Real]Absence check using state equation in 364 ms returned sat
[2025-06-01 12:24:21] [INFO ] [Real]Added 97 Read/Feed constraints in 81 ms returned sat
[2025-06-01 12:24:22] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:24:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 11 ms returned sat
[2025-06-01 12:24:22] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:24:22] [INFO ] [Nat]Absence check using state equation in 430 ms returned sat
[2025-06-01 12:24:22] [INFO ] [Nat]Added 97 Read/Feed constraints in 77 ms returned sat
[2025-06-01 12:24:22] [INFO ] Computed and/alt/rep : 112/245/100 causal constraints (skipped 672 transitions) in 182 ms.
[2025-06-01 12:24:23] [INFO ] Added : 14 causal constraints over 4 iterations in 572 ms. Result :sat
Minimization took 855 ms.
[2025-06-01 12:24:24] [INFO ] [Real]Absence check using 1 positive place invariants in 10 ms returned sat
[2025-06-01 12:24:24] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:24:24] [INFO ] [Real]Absence check using state equation in 420 ms returned sat
[2025-06-01 12:24:24] [INFO ] [Real]Added 97 Read/Feed constraints in 102 ms returned sat
[2025-06-01 12:24:24] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:24:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 10 ms returned sat
[2025-06-01 12:24:25] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 12:24:25] [INFO ] [Nat]Absence check using state equation in 359 ms returned sat
[2025-06-01 12:24:25] [INFO ] [Nat]Added 97 Read/Feed constraints in 61 ms returned sat
[2025-06-01 12:24:25] [INFO ] Computed and/alt/rep : 112/245/100 causal constraints (skipped 672 transitions) in 145 ms.
[2025-06-01 12:24:26] [INFO ] Added : 14 causal constraints over 4 iterations in 446 ms. Result :sat
Minimization took 606 ms.
[2025-06-01 12:24:26] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2025-06-01 12:24:26] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:24:27] [INFO ] [Real]Absence check using state equation in 389 ms returned sat
[2025-06-01 12:24:27] [INFO ] [Real]Added 97 Read/Feed constraints in 99 ms returned sat
[2025-06-01 12:24:27] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:24:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 10 ms returned sat
[2025-06-01 12:24:27] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 12:24:27] [INFO ] [Nat]Absence check using state equation in 367 ms returned sat
[2025-06-01 12:24:27] [INFO ] [Nat]Added 97 Read/Feed constraints in 112 ms returned sat
[2025-06-01 12:24:28] [INFO ] Computed and/alt/rep : 112/245/100 causal constraints (skipped 672 transitions) in 108 ms.
[2025-06-01 12:24:28] [INFO ] Added : 2 causal constraints over 1 iterations in 252 ms. Result :sat
Minimization took 796 ms.
[2025-06-01 12:24:29] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-01 12:24:29] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 12:24:29] [INFO ] [Real]Absence check using state equation in 317 ms returned sat
[2025-06-01 12:24:29] [INFO ] [Real]Added 97 Read/Feed constraints in 117 ms returned sat
[2025-06-01 12:24:29] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:24:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-01 12:24:29] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:24:30] [INFO ] [Nat]Absence check using state equation in 322 ms returned sat
[2025-06-01 12:24:30] [INFO ] [Nat]Added 97 Read/Feed constraints in 75 ms returned sat
[2025-06-01 12:24:30] [INFO ] Computed and/alt/rep : 112/245/100 causal constraints (skipped 672 transitions) in 142 ms.
[2025-06-01 12:24:30] [INFO ] Added : 1 causal constraints over 1 iterations in 273 ms. Result :sat
Minimization took 576 ms.
[2025-06-01 12:24:31] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-01 12:24:31] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:24:31] [INFO ] [Real]Absence check using state equation in 412 ms returned sat
[2025-06-01 12:24:31] [INFO ] [Real]Added 97 Read/Feed constraints in 85 ms returned sat
[2025-06-01 12:24:31] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:24:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 10 ms returned sat
[2025-06-01 12:24:31] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2025-06-01 12:24:32] [INFO ] [Nat]Absence check using state equation in 418 ms returned sat
[2025-06-01 12:24:32] [INFO ] [Nat]Added 97 Read/Feed constraints in 75 ms returned sat
[2025-06-01 12:24:32] [INFO ] Computed and/alt/rep : 112/245/100 causal constraints (skipped 672 transitions) in 148 ms.
[2025-06-01 12:24:32] [INFO ] Added : 11 causal constraints over 4 iterations in 499 ms. Result :sat
Minimization took 707 ms.
[2025-06-01 12:24:33] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-01 12:24:33] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:24:34] [INFO ] [Real]Absence check using state equation in 325 ms returned sat
[2025-06-01 12:24:34] [INFO ] [Real]Added 97 Read/Feed constraints in 91 ms returned sat
[2025-06-01 12:24:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:24:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-01 12:24:34] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:24:34] [INFO ] [Nat]Absence check using state equation in 311 ms returned sat
[2025-06-01 12:24:34] [INFO ] [Nat]Added 97 Read/Feed constraints in 53 ms returned sat
[2025-06-01 12:24:35] [INFO ] Computed and/alt/rep : 112/245/100 causal constraints (skipped 672 transitions) in 148 ms.
[2025-06-01 12:24:35] [INFO ] Added : 1 causal constraints over 1 iterations in 280 ms. Result :sat
Minimization took 595 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[89, 3, 6, 79, 28, 55, 63, 134] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[89, 63, 6, 79, 63, 55, 63, 134] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 8 out of 470 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 470/470 places, 1336/1336 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 469 transition count 1334
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 469 transition count 1334
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 468 transition count 1332
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 468 transition count 1332
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 467 transition count 1330
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 467 transition count 1330
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 466 transition count 1328
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 466 transition count 1328
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 465 transition count 1326
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 465 transition count 1326
Applied a total of 10 rules in 137 ms. Remains 465 /470 variables (removed 5) and now considering 1326/1336 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 465/470 places, 1326/1336 transitions.
[2025-06-01 12:24:36] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
Found an invariant !
This invariant on transitions {214=1, 348=1, 551=1, 749=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {253=1, 387=1, 590=1, 751=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 8) seen :[2, 2, 2, 3, 3, 3, 2, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[89, 63, 6, 79, 63, 55, 63, 134] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-01 12:24:37] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
// Phase 1: matrix 765 rows 465 cols
[2025-06-01 12:24:37] [INFO ] Computed 2 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[89, 63, 6, 79, 63, 55, 63, 134] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000005 steps (2 resets) in 2895 ms. (345 steps per ms)
BEST_FIRST walk for 8000008 steps (19 resets) in 15141 ms. (528 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[96, 63, 53, 83, 63, 82, 77, 135] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-01 12:24:55] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-01 12:24:55] [INFO ] Invariant cache hit.
[2025-06-01 12:24:55] [INFO ] [Real]Absence check using 1 positive place invariants in 10 ms returned sat
[2025-06-01 12:24:55] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 12:24:55] [INFO ] [Real]Absence check using state equation in 373 ms returned sat
[2025-06-01 12:24:55] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-01 12:24:55] [INFO ] [Real]Added 94 Read/Feed constraints in 75 ms returned sat
[2025-06-01 12:24:56] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:24:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 8 ms returned sat
[2025-06-01 12:24:56] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 12:24:56] [INFO ] [Nat]Absence check using state equation in 416 ms returned sat
[2025-06-01 12:24:56] [INFO ] [Nat]Added 94 Read/Feed constraints in 62 ms returned sat
[2025-06-01 12:24:56] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 143 ms.
[2025-06-01 12:24:57] [INFO ] Added : 7 causal constraints over 3 iterations in 441 ms. Result :sat
Minimization took 792 ms.
[2025-06-01 12:24:58] [INFO ] [Real]Absence check using 1 positive place invariants in 10 ms returned sat
[2025-06-01 12:24:58] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:24:58] [INFO ] [Real]Absence check using state equation in 395 ms returned sat
[2025-06-01 12:24:58] [INFO ] [Real]Added 94 Read/Feed constraints in 133 ms returned sat
[2025-06-01 12:24:58] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:24:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 10 ms returned sat
[2025-06-01 12:24:58] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 12:24:59] [INFO ] [Nat]Absence check using state equation in 453 ms returned sat
[2025-06-01 12:24:59] [INFO ] [Nat]Added 94 Read/Feed constraints in 102 ms returned sat
[2025-06-01 12:24:59] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 154 ms.
[2025-06-01 12:24:59] [INFO ] Added : 1 causal constraints over 1 iterations in 306 ms. Result :sat
Minimization took 733 ms.
[2025-06-01 12:25:00] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-06-01 12:25:00] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:25:01] [INFO ] [Real]Absence check using state equation in 376 ms returned sat
[2025-06-01 12:25:01] [INFO ] [Real]Added 94 Read/Feed constraints in 87 ms returned sat
[2025-06-01 12:25:01] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:25:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 10 ms returned sat
[2025-06-01 12:25:01] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2025-06-01 12:25:01] [INFO ] [Nat]Absence check using state equation in 414 ms returned sat
[2025-06-01 12:25:01] [INFO ] [Nat]Added 94 Read/Feed constraints in 66 ms returned sat
[2025-06-01 12:25:02] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 145 ms.
[2025-06-01 12:25:02] [INFO ] Added : 14 causal constraints over 4 iterations in 522 ms. Result :sat
Minimization took 841 ms.
[2025-06-01 12:25:03] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-06-01 12:25:03] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:25:03] [INFO ] [Real]Absence check using state equation in 384 ms returned sat
[2025-06-01 12:25:03] [INFO ] [Real]Added 94 Read/Feed constraints in 71 ms returned sat
[2025-06-01 12:25:03] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:25:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-06-01 12:25:04] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 12:25:04] [INFO ] [Nat]Absence check using state equation in 399 ms returned sat
[2025-06-01 12:25:04] [INFO ] [Nat]Added 94 Read/Feed constraints in 68 ms returned sat
[2025-06-01 12:25:04] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 137 ms.
[2025-06-01 12:25:05] [INFO ] Added : 8 causal constraints over 2 iterations in 416 ms. Result :sat
Minimization took 803 ms.
[2025-06-01 12:25:05] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-01 12:25:05] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 12:25:06] [INFO ] [Real]Absence check using state equation in 327 ms returned sat
[2025-06-01 12:25:06] [INFO ] [Real]Added 94 Read/Feed constraints in 88 ms returned sat
[2025-06-01 12:25:06] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:25:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-01 12:25:06] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 12:25:06] [INFO ] [Nat]Absence check using state equation in 413 ms returned sat
[2025-06-01 12:25:07] [INFO ] [Nat]Added 94 Read/Feed constraints in 132 ms returned sat
[2025-06-01 12:25:07] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 149 ms.
[2025-06-01 12:25:07] [INFO ] Added : 2 causal constraints over 1 iterations in 321 ms. Result :sat
Minimization took 850 ms.
[2025-06-01 12:25:08] [INFO ] [Real]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-01 12:25:08] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:25:08] [INFO ] [Real]Absence check using state equation in 285 ms returned sat
[2025-06-01 12:25:08] [INFO ] [Real]Added 94 Read/Feed constraints in 75 ms returned sat
[2025-06-01 12:25:08] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:25:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-06-01 12:25:09] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:25:09] [INFO ] [Nat]Absence check using state equation in 380 ms returned sat
[2025-06-01 12:25:09] [INFO ] [Nat]Added 94 Read/Feed constraints in 64 ms returned sat
[2025-06-01 12:25:09] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 141 ms.
[2025-06-01 12:25:09] [INFO ] Added : 1 causal constraints over 1 iterations in 271 ms. Result :sat
Minimization took 578 ms.
[2025-06-01 12:25:10] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-06-01 12:25:10] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:25:10] [INFO ] [Real]Absence check using state equation in 355 ms returned sat
[2025-06-01 12:25:11] [INFO ] [Real]Added 94 Read/Feed constraints in 59 ms returned sat
[2025-06-01 12:25:11] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:25:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-01 12:25:11] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:25:11] [INFO ] [Nat]Absence check using state equation in 414 ms returned sat
[2025-06-01 12:25:11] [INFO ] [Nat]Added 94 Read/Feed constraints in 86 ms returned sat
[2025-06-01 12:25:11] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 128 ms.
[2025-06-01 12:25:12] [INFO ] Added : 7 causal constraints over 3 iterations in 316 ms. Result :sat
Minimization took 595 ms.
[2025-06-01 12:25:12] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2025-06-01 12:25:12] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:25:13] [INFO ] [Real]Absence check using state equation in 352 ms returned sat
[2025-06-01 12:25:13] [INFO ] [Real]Added 94 Read/Feed constraints in 85 ms returned sat
[2025-06-01 12:25:13] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:25:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-01 12:25:13] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:25:13] [INFO ] [Nat]Absence check using state equation in 273 ms returned sat
[2025-06-01 12:25:13] [INFO ] [Nat]Added 94 Read/Feed constraints in 34 ms returned sat
[2025-06-01 12:25:13] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 116 ms.
[2025-06-01 12:25:13] [INFO ] Added : 1 causal constraints over 1 iterations in 257 ms. Result :sat
Minimization took 846 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[96, 63, 53, 83, 63, 82, 77, 135] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[96, 63, 53, 83, 63, 82, 77, 135] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 8 out of 465 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 1326/1326 transitions.
Applied a total of 0 rules in 67 ms. Remains 465 /465 variables (removed 0) and now considering 1326/1326 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 465/465 places, 1326/1326 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 1326/1326 transitions.
Applied a total of 0 rules in 65 ms. Remains 465 /465 variables (removed 0) and now considering 1326/1326 (removed 0) transitions.
[2025-06-01 12:25:15] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-01 12:25:15] [INFO ] Invariant cache hit.
[2025-06-01 12:25:16] [INFO ] Implicit Places using invariants in 545 ms returned []
[2025-06-01 12:25:16] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-01 12:25:16] [INFO ] Invariant cache hit.
[2025-06-01 12:25:16] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-01 12:25:20] [INFO ] Implicit Places using invariants and state equation in 4571 ms returned []
Implicit Place search using SMT with State Equation took 5121 ms to find 0 implicit places.
[2025-06-01 12:25:21] [INFO ] Redundant transitions in 146 ms returned []
Running 1324 sub problems to find dead transitions.
[2025-06-01 12:25:21] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-01 12:25:21] [INFO ] Invariant cache hit.
[2025-06-01 12:25:21] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 13.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 0.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 0.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.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 1.0)
(s199 1.0)
(s200 1.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 1.0)
(s222 1.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 1.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 1.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 0.0)
(s243 1.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 1.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 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 465/1230 variables, and 2 constraints, problems are : Problem set: 0 solved, 1324 unsolved in 30095 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/465 constraints, ReadFeed: 0/94 constraints, PredecessorRefiner: 1324/1324 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1324 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/465 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 3 (OVERLAPS) 765/1230 variables, 465/467 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1230 variables, 94/561 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1230/1230 variables, and 1885 constraints, problems are : Problem set: 0 solved, 1324 unsolved in 31366 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 465/465 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 1324/1324 constraints, Known Traps: 0/0 constraints]
After SMT, in 68888ms problems are : Problem set: 0 solved, 1324 unsolved
Search for dead transitions found 0 dead transitions in 68947ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74321 ms. Remains : 465/465 places, 1326/1326 transitions.
[2025-06-01 12:26:30] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
Found an invariant !
This invariant on transitions {214=1, 348=1, 551=1, 749=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 6 ms.
This minimized invariant on transitions {253=1, 387=1, 590=1, 751=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 8) seen :[1, 3, 1, 0, 1, 1, 2, 3]
Current structural bounds on expressions (after cover walk) : Max Seen:[96, 63, 53, 83, 63, 82, 77, 135] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-01 12:26:30] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-01 12:26:30] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[96, 63, 53, 83, 63, 82, 77, 135] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 3479 ms. (287 steps per ms)
BEST_FIRST walk for 8000008 steps (19 resets) in 15089 ms. (530 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[96, 63, 102, 199, 63, 95, 77, 135] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-01 12:26:49] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-01 12:26:49] [INFO ] Invariant cache hit.
[2025-06-01 12:26:49] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-01 12:26:49] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:26:49] [INFO ] [Real]Absence check using state equation in 244 ms returned sat
[2025-06-01 12:26:49] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-01 12:26:49] [INFO ] [Real]Added 94 Read/Feed constraints in 51 ms returned sat
[2025-06-01 12:26:49] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:26:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-01 12:26:49] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:26:50] [INFO ] [Nat]Absence check using state equation in 291 ms returned sat
[2025-06-01 12:26:50] [INFO ] [Nat]Added 94 Read/Feed constraints in 40 ms returned sat
[2025-06-01 12:26:50] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 101 ms.
[2025-06-01 12:26:50] [INFO ] Added : 7 causal constraints over 3 iterations in 307 ms. Result :sat
Minimization took 692 ms.
[2025-06-01 12:26:51] [INFO ] [Real]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-01 12:26:51] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 12:26:51] [INFO ] [Real]Absence check using state equation in 331 ms returned sat
[2025-06-01 12:26:51] [INFO ] [Real]Added 94 Read/Feed constraints in 126 ms returned sat
[2025-06-01 12:26:51] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:26:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-06-01 12:26:52] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:26:52] [INFO ] [Nat]Absence check using state equation in 421 ms returned sat
[2025-06-01 12:26:52] [INFO ] [Nat]Added 94 Read/Feed constraints in 93 ms returned sat
[2025-06-01 12:26:52] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 147 ms.
[2025-06-01 12:26:52] [INFO ] Added : 1 causal constraints over 1 iterations in 317 ms. Result :sat
Minimization took 822 ms.
[2025-06-01 12:26:53] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-01 12:26:53] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:26:54] [INFO ] [Real]Absence check using state equation in 254 ms returned sat
[2025-06-01 12:26:54] [INFO ] [Real]Added 94 Read/Feed constraints in 60 ms returned sat
[2025-06-01 12:26:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:26:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-06-01 12:26:54] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 12:26:54] [INFO ] [Nat]Absence check using state equation in 401 ms returned sat
[2025-06-01 12:26:54] [INFO ] [Nat]Added 94 Read/Feed constraints in 76 ms returned sat
[2025-06-01 12:26:55] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 141 ms.
[2025-06-01 12:26:55] [INFO ] Added : 14 causal constraints over 4 iterations in 509 ms. Result :sat
Minimization took 842 ms.
[2025-06-01 12:26:56] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-06-01 12:26:56] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 7 ms returned sat
[2025-06-01 12:26:56] [INFO ] [Real]Absence check using state equation in 349 ms returned sat
[2025-06-01 12:26:56] [INFO ] [Real]Added 94 Read/Feed constraints in 65 ms returned sat
[2025-06-01 12:26:56] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:26:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-01 12:26:57] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 12:26:57] [INFO ] [Nat]Absence check using state equation in 320 ms returned sat
[2025-06-01 12:26:57] [INFO ] [Nat]Added 94 Read/Feed constraints in 51 ms returned sat
[2025-06-01 12:26:57] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 145 ms.
[2025-06-01 12:26:57] [INFO ] Added : 8 causal constraints over 2 iterations in 354 ms. Result :sat
Minimization took 619 ms.
[2025-06-01 12:26:58] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-01 12:26:58] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:26:58] [INFO ] [Real]Absence check using state equation in 339 ms returned sat
[2025-06-01 12:26:59] [INFO ] [Real]Added 94 Read/Feed constraints in 72 ms returned sat
[2025-06-01 12:26:59] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:26:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-06-01 12:26:59] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 12:26:59] [INFO ] [Nat]Absence check using state equation in 396 ms returned sat
[2025-06-01 12:26:59] [INFO ] [Nat]Added 94 Read/Feed constraints in 125 ms returned sat
[2025-06-01 12:26:59] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 132 ms.
[2025-06-01 12:27:00] [INFO ] Added : 2 causal constraints over 1 iterations in 294 ms. Result :sat
Minimization took 820 ms.
[2025-06-01 12:27:01] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-01 12:27:01] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:27:01] [INFO ] [Real]Absence check using state equation in 258 ms returned sat
[2025-06-01 12:27:01] [INFO ] [Real]Added 94 Read/Feed constraints in 68 ms returned sat
[2025-06-01 12:27:01] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:27:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 10 ms returned sat
[2025-06-01 12:27:01] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 12:27:01] [INFO ] [Nat]Absence check using state equation in 353 ms returned sat
[2025-06-01 12:27:02] [INFO ] [Nat]Added 94 Read/Feed constraints in 51 ms returned sat
[2025-06-01 12:27:02] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 170 ms.
[2025-06-01 12:27:02] [INFO ] Added : 1 causal constraints over 1 iterations in 339 ms. Result :sat
Minimization took 867 ms.
[2025-06-01 12:27:03] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-01 12:27:03] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:27:03] [INFO ] [Real]Absence check using state equation in 261 ms returned sat
[2025-06-01 12:27:03] [INFO ] [Real]Added 94 Read/Feed constraints in 46 ms returned sat
[2025-06-01 12:27:03] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:27:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 8 ms returned sat
[2025-06-01 12:27:03] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:27:04] [INFO ] [Nat]Absence check using state equation in 378 ms returned sat
[2025-06-01 12:27:04] [INFO ] [Nat]Added 94 Read/Feed constraints in 69 ms returned sat
[2025-06-01 12:27:04] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 127 ms.
[2025-06-01 12:27:04] [INFO ] Added : 7 causal constraints over 3 iterations in 413 ms. Result :sat
Minimization took 825 ms.
[2025-06-01 12:27:05] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-06-01 12:27:05] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:27:06] [INFO ] [Real]Absence check using state equation in 378 ms returned sat
[2025-06-01 12:27:06] [INFO ] [Real]Added 94 Read/Feed constraints in 55 ms returned sat
[2025-06-01 12:27:06] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:27:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-01 12:27:06] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 12:27:06] [INFO ] [Nat]Absence check using state equation in 246 ms returned sat
[2025-06-01 12:27:06] [INFO ] [Nat]Added 94 Read/Feed constraints in 40 ms returned sat
[2025-06-01 12:27:06] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 110 ms.
[2025-06-01 12:27:07] [INFO ] Added : 1 causal constraints over 1 iterations in 232 ms. Result :sat
Minimization took 697 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[96, 63, 102, 199, 63, 95, 77, 135] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[96, 63, 102, 199, 63, 95, 77, 135] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 8 out of 465 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 1326/1326 transitions.
Applied a total of 0 rules in 69 ms. Remains 465 /465 variables (removed 0) and now considering 1326/1326 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 465/465 places, 1326/1326 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 1326/1326 transitions.
Applied a total of 0 rules in 72 ms. Remains 465 /465 variables (removed 0) and now considering 1326/1326 (removed 0) transitions.
[2025-06-01 12:27:08] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-01 12:27:08] [INFO ] Invariant cache hit.
[2025-06-01 12:27:09] [INFO ] Implicit Places using invariants in 646 ms returned []
[2025-06-01 12:27:09] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-01 12:27:09] [INFO ] Invariant cache hit.
[2025-06-01 12:27:09] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-01 12:27:14] [INFO ] Implicit Places using invariants and state equation in 4997 ms returned []
Implicit Place search using SMT with State Equation took 5648 ms to find 0 implicit places.
[2025-06-01 12:27:14] [INFO ] Redundant transitions in 131 ms returned []
Running 1324 sub problems to find dead transitions.
[2025-06-01 12:27:14] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-01 12:27:14] [INFO ] Invariant cache hit.
[2025-06-01 12:27:14] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 465/1230 variables, and 2 constraints, problems are : Problem set: 0 solved, 1324 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/465 constraints, ReadFeed: 0/94 constraints, PredecessorRefiner: 1324/1324 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1324 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/465 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 3 (OVERLAPS) 765/1230 variables, 465/467 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1230 variables, 94/561 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1230/1230 variables, and 1885 constraints, problems are : Problem set: 0 solved, 1324 unsolved in 31275 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 465/465 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 1324/1324 constraints, Known Traps: 0/0 constraints]
After SMT, in 67569ms problems are : Problem set: 0 solved, 1324 unsolved
Search for dead transitions found 0 dead transitions in 67597ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73474 ms. Remains : 465/465 places, 1326/1326 transitions.
[2025-06-01 12:28:22] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
Found an invariant !
This invariant on transitions {214=1, 348=1, 551=1, 749=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {253=1, 387=1, 590=1, 751=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 8) seen :[2, 2, 2, 1, 0, 2, 2, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[96, 63, 102, 199, 63, 95, 77, 135] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-01 12:28:22] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-01 12:28:22] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[96, 63, 102, 199, 63, 95, 77, 135] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000002 steps (2 resets) in 3927 ms. (254 steps per ms)
BEST_FIRST walk for 8000007 steps (21 resets) in 15364 ms. (520 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[103, 63, 102, 199, 63, 113, 110, 135] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-01 12:28:42] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-01 12:28:42] [INFO ] Invariant cache hit.
[2025-06-01 12:28:42] [INFO ] [Real]Absence check using 1 positive place invariants in 11 ms returned sat
[2025-06-01 12:28:42] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 8 ms returned sat
[2025-06-01 12:28:42] [INFO ] [Real]Absence check using state equation in 394 ms returned sat
[2025-06-01 12:28:42] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-01 12:28:42] [INFO ] [Real]Added 94 Read/Feed constraints in 79 ms returned sat
[2025-06-01 12:28:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:28:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 10 ms returned sat
[2025-06-01 12:28:42] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:28:43] [INFO ] [Nat]Absence check using state equation in 406 ms returned sat
[2025-06-01 12:28:43] [INFO ] [Nat]Added 94 Read/Feed constraints in 63 ms returned sat
[2025-06-01 12:28:43] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 147 ms.
[2025-06-01 12:28:43] [INFO ] Added : 7 causal constraints over 3 iterations in 450 ms. Result :sat
Minimization took 880 ms.
[2025-06-01 12:28:44] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2025-06-01 12:28:44] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 12:28:45] [INFO ] [Real]Absence check using state equation in 272 ms returned sat
[2025-06-01 12:28:45] [INFO ] [Real]Added 94 Read/Feed constraints in 78 ms returned sat
[2025-06-01 12:28:45] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:28:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-01 12:28:45] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:28:45] [INFO ] [Nat]Absence check using state equation in 317 ms returned sat
[2025-06-01 12:28:45] [INFO ] [Nat]Added 94 Read/Feed constraints in 67 ms returned sat
[2025-06-01 12:28:45] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 143 ms.
[2025-06-01 12:28:46] [INFO ] Added : 1 causal constraints over 1 iterations in 278 ms. Result :sat
Minimization took 598 ms.
[2025-06-01 12:28:46] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-01 12:28:46] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:28:47] [INFO ] [Real]Absence check using state equation in 325 ms returned sat
[2025-06-01 12:28:47] [INFO ] [Real]Added 94 Read/Feed constraints in 70 ms returned sat
[2025-06-01 12:28:47] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:28:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-06-01 12:28:47] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 12:28:47] [INFO ] [Nat]Absence check using state equation in 375 ms returned sat
[2025-06-01 12:28:47] [INFO ] [Nat]Added 94 Read/Feed constraints in 76 ms returned sat
[2025-06-01 12:28:48] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 151 ms.
[2025-06-01 12:28:48] [INFO ] Added : 14 causal constraints over 4 iterations in 525 ms. Result :sat
Minimization took 814 ms.
[2025-06-01 12:28:49] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-01 12:28:49] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 12:28:49] [INFO ] [Real]Absence check using state equation in 334 ms returned sat
[2025-06-01 12:28:49] [INFO ] [Real]Added 94 Read/Feed constraints in 55 ms returned sat
[2025-06-01 12:28:49] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:28:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-01 12:28:50] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:28:50] [INFO ] [Nat]Absence check using state equation in 388 ms returned sat
[2025-06-01 12:28:50] [INFO ] [Nat]Added 94 Read/Feed constraints in 81 ms returned sat
[2025-06-01 12:28:50] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 151 ms.
[2025-06-01 12:28:50] [INFO ] Added : 8 causal constraints over 2 iterations in 427 ms. Result :sat
Minimization took 807 ms.
[2025-06-01 12:28:51] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-01 12:28:51] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:28:52] [INFO ] [Real]Absence check using state equation in 341 ms returned sat
[2025-06-01 12:28:52] [INFO ] [Real]Added 94 Read/Feed constraints in 77 ms returned sat
[2025-06-01 12:28:52] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:28:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 10 ms returned sat
[2025-06-01 12:28:52] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 12:28:52] [INFO ] [Nat]Absence check using state equation in 414 ms returned sat
[2025-06-01 12:28:53] [INFO ] [Nat]Added 94 Read/Feed constraints in 124 ms returned sat
[2025-06-01 12:28:53] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 146 ms.
[2025-06-01 12:28:53] [INFO ] Added : 2 causal constraints over 1 iterations in 320 ms. Result :sat
Minimization took 848 ms.
[2025-06-01 12:28:54] [INFO ] [Real]Absence check using 1 positive place invariants in 11 ms returned sat
[2025-06-01 12:28:54] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:28:54] [INFO ] [Real]Absence check using state equation in 420 ms returned sat
[2025-06-01 12:28:55] [INFO ] [Real]Added 94 Read/Feed constraints in 93 ms returned sat
[2025-06-01 12:28:55] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:28:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 10 ms returned sat
[2025-06-01 12:28:55] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 12:28:55] [INFO ] [Nat]Absence check using state equation in 426 ms returned sat
[2025-06-01 12:28:55] [INFO ] [Nat]Added 94 Read/Feed constraints in 54 ms returned sat
[2025-06-01 12:28:55] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 151 ms.
[2025-06-01 12:28:56] [INFO ] Added : 1 causal constraints over 1 iterations in 318 ms. Result :sat
Minimization took 799 ms.
[2025-06-01 12:28:57] [INFO ] [Real]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-01 12:28:57] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:28:57] [INFO ] [Real]Absence check using state equation in 284 ms returned sat
[2025-06-01 12:28:57] [INFO ] [Real]Added 94 Read/Feed constraints in 82 ms returned sat
[2025-06-01 12:28:57] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:28:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-06-01 12:28:57] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 6 ms returned sat
[2025-06-01 12:28:58] [INFO ] [Nat]Absence check using state equation in 426 ms returned sat
[2025-06-01 12:28:58] [INFO ] [Nat]Added 94 Read/Feed constraints in 81 ms returned sat
[2025-06-01 12:28:58] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 152 ms.
[2025-06-01 12:28:58] [INFO ] Added : 7 causal constraints over 3 iterations in 464 ms. Result :sat
Minimization took 779 ms.
[2025-06-01 12:28:59] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-01 12:28:59] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:28:59] [INFO ] [Real]Absence check using state equation in 264 ms returned sat
[2025-06-01 12:28:59] [INFO ] [Real]Added 94 Read/Feed constraints in 60 ms returned sat
[2025-06-01 12:28:59] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:29:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-01 12:29:00] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:29:00] [INFO ] [Nat]Absence check using state equation in 333 ms returned sat
[2025-06-01 12:29:00] [INFO ] [Nat]Added 94 Read/Feed constraints in 53 ms returned sat
[2025-06-01 12:29:00] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 140 ms.
[2025-06-01 12:29:00] [INFO ] Added : 1 causal constraints over 1 iterations in 279 ms. Result :sat
Minimization took 737 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[103, 63, 102, 199, 63, 113, 110, 135] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[103, 63, 102, 199, 63, 113, 110, 135] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 8 out of 465 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 1326/1326 transitions.
Applied a total of 0 rules in 61 ms. Remains 465 /465 variables (removed 0) and now considering 1326/1326 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 465/465 places, 1326/1326 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 1326/1326 transitions.
Applied a total of 0 rules in 62 ms. Remains 465 /465 variables (removed 0) and now considering 1326/1326 (removed 0) transitions.
[2025-06-01 12:29:02] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-01 12:29:02] [INFO ] Invariant cache hit.
[2025-06-01 12:29:03] [INFO ] Implicit Places using invariants in 843 ms returned []
[2025-06-01 12:29:03] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-01 12:29:03] [INFO ] Invariant cache hit.
[2025-06-01 12:29:04] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-01 12:29:08] [INFO ] Implicit Places using invariants and state equation in 4986 ms returned []
Implicit Place search using SMT with State Equation took 5833 ms to find 0 implicit places.
[2025-06-01 12:29:08] [INFO ] Redundant transitions in 59 ms returned []
Running 1324 sub problems to find dead transitions.
[2025-06-01 12:29:08] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-01 12:29:08] [INFO ] Invariant cache hit.
[2025-06-01 12:29:08] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 465/1230 variables, and 2 constraints, problems are : Problem set: 0 solved, 1324 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/465 constraints, ReadFeed: 0/94 constraints, PredecessorRefiner: 1324/1324 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1324 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/465 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 3 (OVERLAPS) 765/1230 variables, 465/467 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1230 variables, 94/561 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1230/1230 variables, and 1885 constraints, problems are : Problem set: 0 solved, 1324 unsolved in 31199 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 465/465 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 1324/1324 constraints, Known Traps: 0/0 constraints]
After SMT, in 67328ms problems are : Problem set: 0 solved, 1324 unsolved
Search for dead transitions found 0 dead transitions in 67355ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73323 ms. Remains : 465/465 places, 1326/1326 transitions.
[2025-06-01 12:30:15] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
Found an invariant !
This invariant on transitions {214=1, 348=1, 551=1, 749=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {253=1, 387=1, 590=1, 751=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 8) seen :[2, 2, 2, 1, 2, 2, 2, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[103, 63, 102, 199, 63, 113, 110, 135] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-01 12:30:16] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-01 12:30:16] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[103, 63, 102, 199, 63, 113, 110, 135] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000001 steps (2 resets) in 3014 ms. (331 steps per ms)
BEST_FIRST walk for 8000008 steps (18 resets) in 15209 ms. (525 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[103, 63, 102, 199, 66, 113, 110, 135] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-01 12:30:34] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-01 12:30:34] [INFO ] Invariant cache hit.
[2025-06-01 12:30:34] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-06-01 12:30:34] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:30:35] [INFO ] [Real]Absence check using state equation in 360 ms returned sat
[2025-06-01 12:30:35] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-01 12:30:35] [INFO ] [Real]Added 94 Read/Feed constraints in 80 ms returned sat
[2025-06-01 12:30:35] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:30:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 10 ms returned sat
[2025-06-01 12:30:35] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 12:30:35] [INFO ] [Nat]Absence check using state equation in 421 ms returned sat
[2025-06-01 12:30:36] [INFO ] [Nat]Added 94 Read/Feed constraints in 61 ms returned sat
[2025-06-01 12:30:36] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 151 ms.
[2025-06-01 12:30:36] [INFO ] Added : 7 causal constraints over 3 iterations in 459 ms. Result :sat
Minimization took 831 ms.
[2025-06-01 12:30:37] [INFO ] [Real]Absence check using 1 positive place invariants in 10 ms returned sat
[2025-06-01 12:30:37] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:30:38] [INFO ] [Real]Absence check using state equation in 445 ms returned sat
[2025-06-01 12:30:38] [INFO ] [Real]Added 94 Read/Feed constraints in 128 ms returned sat
[2025-06-01 12:30:38] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:30:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-06-01 12:30:38] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 12:30:38] [INFO ] [Nat]Absence check using state equation in 415 ms returned sat
[2025-06-01 12:30:38] [INFO ] [Nat]Added 94 Read/Feed constraints in 92 ms returned sat
[2025-06-01 12:30:39] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 143 ms.
[2025-06-01 12:30:39] [INFO ] Added : 1 causal constraints over 1 iterations in 306 ms. Result :sat
Minimization took 730 ms.
[2025-06-01 12:30:40] [INFO ] [Real]Absence check using 1 positive place invariants in 10 ms returned sat
[2025-06-01 12:30:40] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 12:30:40] [INFO ] [Real]Absence check using state equation in 406 ms returned sat
[2025-06-01 12:30:40] [INFO ] [Real]Added 94 Read/Feed constraints in 83 ms returned sat
[2025-06-01 12:30:40] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:30:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 10 ms returned sat
[2025-06-01 12:30:40] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 12:30:41] [INFO ] [Nat]Absence check using state equation in 418 ms returned sat
[2025-06-01 12:30:41] [INFO ] [Nat]Added 94 Read/Feed constraints in 69 ms returned sat
[2025-06-01 12:30:41] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 150 ms.
[2025-06-01 12:30:41] [INFO ] Added : 14 causal constraints over 4 iterations in 526 ms. Result :sat
Minimization took 861 ms.
[2025-06-01 12:30:42] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-06-01 12:30:42] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:30:43] [INFO ] [Real]Absence check using state equation in 409 ms returned sat
[2025-06-01 12:30:43] [INFO ] [Real]Added 94 Read/Feed constraints in 74 ms returned sat
[2025-06-01 12:30:43] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:30:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-06-01 12:30:43] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:30:44] [INFO ] [Nat]Absence check using state equation in 433 ms returned sat
[2025-06-01 12:30:44] [INFO ] [Nat]Added 94 Read/Feed constraints in 76 ms returned sat
[2025-06-01 12:30:44] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 149 ms.
[2025-06-01 12:30:44] [INFO ] Added : 8 causal constraints over 2 iterations in 407 ms. Result :sat
Minimization took 762 ms.
[2025-06-01 12:30:45] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-06-01 12:30:45] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:30:45] [INFO ] [Real]Absence check using state equation in 382 ms returned sat
[2025-06-01 12:30:46] [INFO ] [Real]Added 94 Read/Feed constraints in 119 ms returned sat
[2025-06-01 12:30:46] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:30:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-06-01 12:30:46] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:30:46] [INFO ] [Nat]Absence check using state equation in 427 ms returned sat
[2025-06-01 12:30:46] [INFO ] [Nat]Added 94 Read/Feed constraints in 137 ms returned sat
[2025-06-01 12:30:47] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 150 ms.
[2025-06-01 12:30:47] [INFO ] Added : 2 causal constraints over 1 iterations in 316 ms. Result :sat
Minimization took 771 ms.
[2025-06-01 12:30:48] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-01 12:30:48] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:30:48] [INFO ] [Real]Absence check using state equation in 353 ms returned sat
[2025-06-01 12:30:48] [INFO ] [Real]Added 94 Read/Feed constraints in 67 ms returned sat
[2025-06-01 12:30:48] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:30:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-01 12:30:48] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:30:49] [INFO ] [Nat]Absence check using state equation in 421 ms returned sat
[2025-06-01 12:30:49] [INFO ] [Nat]Added 94 Read/Feed constraints in 59 ms returned sat
[2025-06-01 12:30:49] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 148 ms.
[2025-06-01 12:30:49] [INFO ] Added : 1 causal constraints over 1 iterations in 319 ms. Result :sat
Minimization took 766 ms.
[2025-06-01 12:30:50] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-06-01 12:30:50] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:30:50] [INFO ] [Real]Absence check using state equation in 378 ms returned sat
[2025-06-01 12:30:51] [INFO ] [Real]Added 94 Read/Feed constraints in 83 ms returned sat
[2025-06-01 12:30:51] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:30:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 10 ms returned sat
[2025-06-01 12:30:51] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:30:51] [INFO ] [Nat]Absence check using state equation in 428 ms returned sat
[2025-06-01 12:30:51] [INFO ] [Nat]Added 94 Read/Feed constraints in 86 ms returned sat
[2025-06-01 12:30:51] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 153 ms.
[2025-06-01 12:30:52] [INFO ] Added : 7 causal constraints over 3 iterations in 462 ms. Result :sat
Minimization took 731 ms.
[2025-06-01 12:30:53] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-01 12:30:53] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 4 ms returned sat
[2025-06-01 12:30:53] [INFO ] [Real]Absence check using state equation in 329 ms returned sat
[2025-06-01 12:30:53] [INFO ] [Real]Added 94 Read/Feed constraints in 62 ms returned sat
[2025-06-01 12:30:53] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:30:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 10 ms returned sat
[2025-06-01 12:30:53] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:30:54] [INFO ] [Nat]Absence check using state equation in 417 ms returned sat
[2025-06-01 12:30:54] [INFO ] [Nat]Added 94 Read/Feed constraints in 68 ms returned sat
[2025-06-01 12:30:54] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 150 ms.
[2025-06-01 12:30:54] [INFO ] Added : 1 causal constraints over 1 iterations in 313 ms. Result :sat
Minimization took 794 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[103, 63, 102, 199, 66, 113, 110, 135] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[103, 63, 102, 199, 66, 113, 110, 135] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 8 out of 465 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 1326/1326 transitions.
Applied a total of 0 rules in 104 ms. Remains 465 /465 variables (removed 0) and now considering 1326/1326 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 465/465 places, 1326/1326 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 1326/1326 transitions.
Applied a total of 0 rules in 100 ms. Remains 465 /465 variables (removed 0) and now considering 1326/1326 (removed 0) transitions.
[2025-06-01 12:30:56] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-01 12:30:56] [INFO ] Invariant cache hit.
[2025-06-01 12:30:57] [INFO ] Implicit Places using invariants in 927 ms returned []
[2025-06-01 12:30:57] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-01 12:30:57] [INFO ] Invariant cache hit.
[2025-06-01 12:30:57] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-01 12:31:01] [INFO ] Implicit Places using invariants and state equation in 4045 ms returned []
Implicit Place search using SMT with State Equation took 4989 ms to find 0 implicit places.
[2025-06-01 12:31:01] [INFO ] Redundant transitions in 25 ms returned []
Running 1324 sub problems to find dead transitions.
[2025-06-01 12:31:01] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-01 12:31:01] [INFO ] Invariant cache hit.
[2025-06-01 12:31:01] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 465/1230 variables, and 2 constraints, problems are : Problem set: 0 solved, 1324 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/465 constraints, ReadFeed: 0/94 constraints, PredecessorRefiner: 1324/1324 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1324 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/465 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 3 (OVERLAPS) 765/1230 variables, 465/467 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1230 variables, 94/561 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1230/1230 variables, and 1885 constraints, problems are : Problem set: 0 solved, 1324 unsolved in 31320 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 465/465 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 1324/1324 constraints, Known Traps: 0/0 constraints]
After SMT, in 67130ms problems are : Problem set: 0 solved, 1324 unsolved
Search for dead transitions found 0 dead transitions in 67146ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72275 ms. Remains : 465/465 places, 1326/1326 transitions.
[2025-06-01 12:32:08] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
Found an invariant !
This invariant on transitions {214=1, 348=1, 551=1, 749=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {253=1, 387=1, 590=1, 751=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 8) seen :[3, 2, 2, 2, 0, 4, 2, 1]
Current structural bounds on expressions (after cover walk) : Max Seen:[103, 63, 102, 199, 66, 113, 110, 135] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-01 12:32:09] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-01 12:32:09] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[103, 63, 102, 199, 66, 113, 110, 135] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000001 steps (2 resets) in 4389 ms. (227 steps per ms)
BEST_FIRST walk for 8000008 steps (18 resets) in 15303 ms. (522 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[103, 63, 102, 199, 66, 113, 110, 135] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-01 12:32:28] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-01 12:32:28] [INFO ] Invariant cache hit.
[2025-06-01 12:32:28] [INFO ] [Real]Absence check using 1 positive place invariants in 10 ms returned sat
[2025-06-01 12:32:28] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:32:29] [INFO ] [Real]Absence check using state equation in 413 ms returned sat
[2025-06-01 12:32:29] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-01 12:32:29] [INFO ] [Real]Added 94 Read/Feed constraints in 74 ms returned sat
[2025-06-01 12:32:29] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:32:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-06-01 12:32:29] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:32:30] [INFO ] [Nat]Absence check using state equation in 426 ms returned sat
[2025-06-01 12:32:30] [INFO ] [Nat]Added 94 Read/Feed constraints in 64 ms returned sat
[2025-06-01 12:32:30] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 151 ms.
[2025-06-01 12:32:30] [INFO ] Added : 7 causal constraints over 3 iterations in 460 ms. Result :sat
Minimization took 821 ms.
[2025-06-01 12:32:31] [INFO ] [Real]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-01 12:32:31] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:32:32] [INFO ] [Real]Absence check using state equation in 421 ms returned sat
[2025-06-01 12:32:32] [INFO ] [Real]Added 94 Read/Feed constraints in 127 ms returned sat
[2025-06-01 12:32:32] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:32:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-06-01 12:32:32] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 12:32:32] [INFO ] [Nat]Absence check using state equation in 435 ms returned sat
[2025-06-01 12:32:32] [INFO ] [Nat]Added 94 Read/Feed constraints in 72 ms returned sat
[2025-06-01 12:32:33] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 142 ms.
[2025-06-01 12:32:33] [INFO ] Added : 1 causal constraints over 1 iterations in 275 ms. Result :sat
Minimization took 768 ms.
[2025-06-01 12:32:34] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-01 12:32:34] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:32:34] [INFO ] [Real]Absence check using state equation in 376 ms returned sat
[2025-06-01 12:32:34] [INFO ] [Real]Added 94 Read/Feed constraints in 74 ms returned sat
[2025-06-01 12:32:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:32:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-06-01 12:32:34] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 12:32:35] [INFO ] [Nat]Absence check using state equation in 415 ms returned sat
[2025-06-01 12:32:35] [INFO ] [Nat]Added 94 Read/Feed constraints in 66 ms returned sat
[2025-06-01 12:32:35] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 151 ms.
[2025-06-01 12:32:35] [INFO ] Added : 14 causal constraints over 4 iterations in 526 ms. Result :sat
Minimization took 868 ms.
[2025-06-01 12:32:36] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-06-01 12:32:36] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:32:37] [INFO ] [Real]Absence check using state equation in 409 ms returned sat
[2025-06-01 12:32:37] [INFO ] [Real]Added 94 Read/Feed constraints in 70 ms returned sat
[2025-06-01 12:32:37] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:32:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 10 ms returned sat
[2025-06-01 12:32:37] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 12:32:38] [INFO ] [Nat]Absence check using state equation in 427 ms returned sat
[2025-06-01 12:32:38] [INFO ] [Nat]Added 94 Read/Feed constraints in 83 ms returned sat
[2025-06-01 12:32:38] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 153 ms.
[2025-06-01 12:32:38] [INFO ] Added : 8 causal constraints over 2 iterations in 431 ms. Result :sat
Minimization took 813 ms.
[2025-06-01 12:32:39] [INFO ] [Real]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-01 12:32:39] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:32:39] [INFO ] [Real]Absence check using state equation in 357 ms returned sat
[2025-06-01 12:32:40] [INFO ] [Real]Added 94 Read/Feed constraints in 109 ms returned sat
[2025-06-01 12:32:40] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:32:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-06-01 12:32:40] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:32:40] [INFO ] [Nat]Absence check using state equation in 405 ms returned sat
[2025-06-01 12:32:40] [INFO ] [Nat]Added 94 Read/Feed constraints in 130 ms returned sat
[2025-06-01 12:32:40] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 135 ms.
[2025-06-01 12:32:41] [INFO ] Added : 2 causal constraints over 1 iterations in 292 ms. Result :sat
Minimization took 754 ms.
[2025-06-01 12:32:42] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-06-01 12:32:42] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:32:42] [INFO ] [Real]Absence check using state equation in 395 ms returned sat
[2025-06-01 12:32:42] [INFO ] [Real]Added 94 Read/Feed constraints in 95 ms returned sat
[2025-06-01 12:32:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:32:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 10 ms returned sat
[2025-06-01 12:32:42] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:32:43] [INFO ] [Nat]Absence check using state equation in 426 ms returned sat
[2025-06-01 12:32:43] [INFO ] [Nat]Added 94 Read/Feed constraints in 65 ms returned sat
[2025-06-01 12:32:43] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 151 ms.
[2025-06-01 12:32:43] [INFO ] Added : 1 causal constraints over 1 iterations in 315 ms. Result :sat
Minimization took 790 ms.
[2025-06-01 12:32:44] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-01 12:32:44] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:32:44] [INFO ] [Real]Absence check using state equation in 371 ms returned sat
[2025-06-01 12:32:45] [INFO ] [Real]Added 94 Read/Feed constraints in 79 ms returned sat
[2025-06-01 12:32:45] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:32:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 10 ms returned sat
[2025-06-01 12:32:45] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:32:45] [INFO ] [Nat]Absence check using state equation in 509 ms returned sat
[2025-06-01 12:32:45] [INFO ] [Nat]Added 94 Read/Feed constraints in 65 ms returned sat
[2025-06-01 12:32:45] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 137 ms.
[2025-06-01 12:32:46] [INFO ] Added : 7 causal constraints over 3 iterations in 374 ms. Result :sat
Minimization took 812 ms.
[2025-06-01 12:32:47] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-01 12:32:47] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:32:47] [INFO ] [Real]Absence check using state equation in 414 ms returned sat
[2025-06-01 12:32:47] [INFO ] [Real]Added 94 Read/Feed constraints in 93 ms returned sat
[2025-06-01 12:32:47] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:32:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 10 ms returned sat
[2025-06-01 12:32:47] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 12:32:48] [INFO ] [Nat]Absence check using state equation in 415 ms returned sat
[2025-06-01 12:32:48] [INFO ] [Nat]Added 94 Read/Feed constraints in 54 ms returned sat
[2025-06-01 12:32:48] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 147 ms.
[2025-06-01 12:32:48] [INFO ] Added : 1 causal constraints over 1 iterations in 316 ms. Result :sat
Minimization took 728 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[103, 63, 102, 199, 66, 113, 110, 135] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[103, 63, 102, 199, 66, 113, 110, 135] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 8 out of 465 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 1326/1326 transitions.
Applied a total of 0 rules in 80 ms. Remains 465 /465 variables (removed 0) and now considering 1326/1326 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 465/465 places, 1326/1326 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 1326/1326 transitions.
Applied a total of 0 rules in 57 ms. Remains 465 /465 variables (removed 0) and now considering 1326/1326 (removed 0) transitions.
[2025-06-01 12:32:50] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-01 12:32:50] [INFO ] Invariant cache hit.
[2025-06-01 12:32:51] [INFO ] Implicit Places using invariants in 1031 ms returned []
[2025-06-01 12:32:51] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-01 12:32:51] [INFO ] Invariant cache hit.
[2025-06-01 12:32:51] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-01 12:32:56] [INFO ] Implicit Places using invariants and state equation in 5171 ms returned []
Implicit Place search using SMT with State Equation took 6204 ms to find 0 implicit places.
[2025-06-01 12:32:56] [INFO ] Redundant transitions in 39 ms returned []
Running 1324 sub problems to find dead transitions.
[2025-06-01 12:32:56] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-01 12:32:56] [INFO ] Invariant cache hit.
[2025-06-01 12:32:56] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 465/1230 variables, and 2 constraints, problems are : Problem set: 0 solved, 1324 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/465 constraints, ReadFeed: 0/94 constraints, PredecessorRefiner: 1324/1324 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1324 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/465 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 3 (OVERLAPS) 765/1230 variables, 465/467 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1230 variables, 94/561 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1230/1230 variables, and 1885 constraints, problems are : Problem set: 0 solved, 1324 unsolved in 30348 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 465/465 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 1324/1324 constraints, Known Traps: 0/0 constraints]
After SMT, in 67286ms problems are : Problem set: 0 solved, 1324 unsolved
Search for dead transitions found 0 dead transitions in 67311ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73621 ms. Remains : 465/465 places, 1326/1326 transitions.
[2025-06-01 12:34:03] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
Found an invariant !
This invariant on transitions {214=1, 348=1, 551=1, 749=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {253=1, 387=1, 590=1, 751=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 8) seen :[1, 4, 2, 2, 0, 2, 2, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[103, 63, 102, 199, 66, 113, 110, 135] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 40001 steps (8 resets) in 1664 ms. (24 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 244 ms. (163 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 279 ms. (142 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 173 ms. (229 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (9 resets) in 183 ms. (217 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 9/9 properties
[2025-06-01 12:34:05] [INFO ] Flatten gal took : 551 ms
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 9/9 properties
[2025-06-01 12:34:05] [INFO ] Flatten gal took : 166 ms
[2025-06-01 12:34:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10152113825043729543.gal : 53 ms
[2025-06-01 12:34:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16706855298250194447.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/ReachabilityCardinality10152113825043729543.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16706855298250194447.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/ReachabilityCardinality16706855298250194447.prop.
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :31 after 1993
Interrupted probabilistic random walk after 63519 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :0 out of 9
Probabilistic random walk after 63519 steps, saw 38973 distinct states, run finished after 3011 ms. (steps per millisecond=21 ) properties seen :0
[2025-06-01 12:34:08] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-01 12:34:08] [INFO ] Invariant cache hit.
[2025-06-01 12:34:08] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :1993 after 1.24037e+06
At refinement iteration 1 (OVERLAPS) 383/391 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/391 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 657/1048 variables, 391/392 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1048 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 86/1134 variables, 17/409 constraints. Problems are: Problem set: 0 solved, 9 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1134 variables, 85/494 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1134 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 81/1215 variables, 45/539 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1215 variables, 1/540 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1215 variables, 9/549 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1215 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 15/1230 variables, 12/561 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1230 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 0/1230 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1230/1230 variables, and 561 constraints, problems are : Problem set: 0 solved, 9 unsolved in 2153 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 465/465 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 383/391 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/391 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 657/1048 variables, 391/392 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1048 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 86/1134 variables, 17/409 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1134 variables, 85/494 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1134 variables, 9/503 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1134 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 81/1215 variables, 45/548 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1215 variables, 1/549 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1215 variables, 9/558 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1215 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 15/1230 variables, 12/570 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1230 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 0/1230 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1230/1230 variables, and 570 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1757 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 465/465 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 3996ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 3 different solutions.
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :1.24037e+06 after 3.71064e+10
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :3.71064e+10 after 5.66643e+17
Detected timeout of ITS tools.
[2025-06-01 12:34:56] [INFO ] Flatten gal took : 294 ms
[2025-06-01 12:34:56] [INFO ] Applying decomposition
[2025-06-01 12:34:56] [INFO ] Flatten gal took : 182 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/graph18043937586126128517.txt' '-o' '/tmp/graph18043937586126128517.bin' '-w' '/tmp/graph18043937586126128517.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18043937586126128517.bin' '-l' '-1' '-v' '-w' '/tmp/graph18043937586126128517.weights' '-q' '0' '-e' '0.001'
[2025-06-01 12:34:57] [INFO ] Decomposing Gal with order
[2025-06-01 12:34:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 12:34:58] [INFO ] Removed a total of 2282 redundant transitions.
[2025-06-01 12:34:58] [INFO ] Flatten gal took : 533 ms
[2025-06-01 12:34:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 1043 labels/synchronizations in 281 ms.
[2025-06-01 12:34:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7453147781599187298.gal : 49 ms
[2025-06-01 12:34:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6660276132119024242.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/ReachabilityCardinality7453147781599187298.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6660276132119024242.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/ReachabilityCardinality6660276132119024242.prop.
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 4
Parikh walk visited 0 properties in 54392 ms.
Support contains 8 out of 465 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 1326/1326 transitions.
Applied a total of 0 rules in 61 ms. Remains 465 /465 variables (removed 0) and now considering 1326/1326 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 465/465 places, 1326/1326 transitions.
RANDOM walk for 40005 steps (8 resets) in 300 ms. (132 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (9 resets) in 90 ms. (439 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 100 ms. (396 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 83 ms. (476 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 106462 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :0 out of 9
Probabilistic random walk after 106462 steps, saw 65304 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
[2025-06-01 12:35:10] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-01 12:35:10] [INFO ] Invariant cache hit.
[2025-06-01 12:35:10] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 383/391 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/391 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 657/1048 variables, 391/392 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1048 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 86/1134 variables, 17/409 constraints. Problems are: Problem set: 0 solved, 9 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1134 variables, 85/494 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1134 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 81/1215 variables, 45/539 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1215 variables, 1/540 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1215 variables, 9/549 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1215 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 15/1230 variables, 12/561 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1230 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 0/1230 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1230/1230 variables, and 561 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1569 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 465/465 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 383/391 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/391 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 657/1048 variables, 391/392 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1048 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 86/1134 variables, 17/409 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1134 variables, 85/494 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1134 variables, 9/503 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1134 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 81/1215 variables, 45/548 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1215 variables, 1/549 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1215 variables, 9/558 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1215 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 15/1230 variables, 12/570 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1230 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 0/1230 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1230/1230 variables, and 570 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1679 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 465/465 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 3276ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 3 different solutions.
Detected timeout of ITS tools.
Parikh walk visited 0 properties in 48249 ms.
Support contains 8 out of 465 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 1326/1326 transitions.
Applied a total of 0 rules in 57 ms. Remains 465 /465 variables (removed 0) and now considering 1326/1326 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 465/465 places, 1326/1326 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 1326/1326 transitions.
Applied a total of 0 rules in 57 ms. Remains 465 /465 variables (removed 0) and now considering 1326/1326 (removed 0) transitions.
[2025-06-01 12:36:02] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-01 12:36:02] [INFO ] Invariant cache hit.
[2025-06-01 12:36:03] [INFO ] Implicit Places using invariants in 888 ms returned []
[2025-06-01 12:36:03] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-01 12:36:03] [INFO ] Invariant cache hit.
[2025-06-01 12:36:03] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-01 12:36:08] [INFO ] Implicit Places using invariants and state equation in 4985 ms returned []
Implicit Place search using SMT with State Equation took 5891 ms to find 0 implicit places.
[2025-06-01 12:36:08] [INFO ] Redundant transitions in 31 ms returned []
Running 1324 sub problems to find dead transitions.
[2025-06-01 12:36:08] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-01 12:36:08] [INFO ] Invariant cache hit.
[2025-06-01 12:36:08] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
(s292 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 13.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 1.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 1.0)
(s102 0.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 0.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.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 1.0)
(s199 1.0)
(s200 1.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 1.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 1.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 1.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.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 465/1230 variables, and 2 constraints, problems are : Problem set: 0 solved, 1324 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/465 constraints, ReadFeed: 0/94 constraints, PredecessorRefiner: 1324/1324 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1324 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/465 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 3 (OVERLAPS) 765/1230 variables, 465/467 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1230 variables, 94/561 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1230/1230 variables, and 1885 constraints, problems are : Problem set: 0 solved, 1324 unsolved in 31121 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 465/465 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 1324/1324 constraints, Known Traps: 0/0 constraints]
After SMT, in 67475ms problems are : Problem set: 0 solved, 1324 unsolved
Search for dead transitions found 0 dead transitions in 67500ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73498 ms. Remains : 465/465 places, 1326/1326 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[103, 63, 102, 199, 66, 113, 110, 135] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
Starting property specific reduction for FunctionPointer-PT-c064-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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2025-06-01 12:37:15] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-01 12:37:15] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 32 ms. (303 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2025-06-01 12:37:15] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-01 12:37:15] [INFO ] Invariant cache hit.
[2025-06-01 12:37:16] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-06-01 12:37:16] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:37:16] [INFO ] [Real]Absence check using state equation in 381 ms returned sat
[2025-06-01 12:37:16] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-01 12:37:16] [INFO ] [Real]Added 94 Read/Feed constraints in 67 ms returned sat
[2025-06-01 12:37:16] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:37:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-06-01 12:37:16] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:37:17] [INFO ] [Nat]Absence check using state equation in 409 ms returned sat
[2025-06-01 12:37:17] [INFO ] [Nat]Added 94 Read/Feed constraints in 62 ms returned sat
[2025-06-01 12:37:17] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 141 ms.
[2025-06-01 12:37:17] [INFO ] Added : 6 causal constraints over 3 iterations in 517 ms. Result :sat
Minimization took 587 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 465 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 1326/1326 transitions.
Graph (complete) has 2259 edges and 465 vertex of which 462 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 462 transition count 1320
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 12 place count 457 transition count 1310
Iterating global reduction 1 with 5 rules applied. Total rules applied 17 place count 457 transition count 1310
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 23 place count 457 transition count 1304
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 29 place count 451 transition count 1288
Iterating global reduction 2 with 6 rules applied. Total rules applied 35 place count 451 transition count 1288
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 39 place count 451 transition count 1284
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 42 place count 448 transition count 1278
Iterating global reduction 3 with 3 rules applied. Total rules applied 45 place count 448 transition count 1278
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 48 place count 445 transition count 1272
Iterating global reduction 3 with 3 rules applied. Total rules applied 51 place count 445 transition count 1272
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 55 place count 441 transition count 1260
Iterating global reduction 3 with 4 rules applied. Total rules applied 59 place count 441 transition count 1260
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 63 place count 437 transition count 1252
Iterating global reduction 3 with 4 rules applied. Total rules applied 67 place count 437 transition count 1252
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 71 place count 433 transition count 1244
Iterating global reduction 3 with 4 rules applied. Total rules applied 75 place count 433 transition count 1244
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 79 place count 429 transition count 1236
Iterating global reduction 3 with 4 rules applied. Total rules applied 83 place count 429 transition count 1236
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 85 place count 427 transition count 1232
Iterating global reduction 3 with 2 rules applied. Total rules applied 87 place count 427 transition count 1232
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 89 place count 425 transition count 1228
Iterating global reduction 3 with 2 rules applied. Total rules applied 91 place count 425 transition count 1228
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 93 place count 423 transition count 1224
Iterating global reduction 3 with 2 rules applied. Total rules applied 95 place count 423 transition count 1224
Applied a total of 95 rules in 196 ms. Remains 423 /465 variables (removed 42) and now considering 1224/1326 (removed 102) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 197 ms. Remains : 423/465 places, 1224/1326 transitions.
[2025-06-01 12:37:18] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
Found an invariant !
This invariant on transitions {203=1, 297=1, 495=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 346=1, 544=1, 687=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2025-06-01 12:37:19] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
// Phase 1: matrix 691 rows 423 cols
[2025-06-01 12:37:19] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 3399 ms. (294 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1780 ms. (561 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[195] Max Struct:[+inf]
[2025-06-01 12:37:24] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2025-06-01 12:37:24] [INFO ] Invariant cache hit.
[2025-06-01 12:37:24] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-01 12:37:24] [INFO ] [Real]Absence check using state equation in 360 ms returned sat
[2025-06-01 12:37:24] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-01 12:37:24] [INFO ] [Real]Added 75 Read/Feed constraints in 77 ms returned sat
[2025-06-01 12:37:24] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:37:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-01 12:37:25] [INFO ] [Nat]Absence check using state equation in 389 ms returned sat
[2025-06-01 12:37:25] [INFO ] [Nat]Added 75 Read/Feed constraints in 89 ms returned sat
[2025-06-01 12:37:26] [INFO ] Deduced a trap composed of 113 places in 619 ms of which 8 ms to minimize.
[2025-06-01 12:37:26] [INFO ] Deduced a trap composed of 90 places in 625 ms of which 7 ms to minimize.
[2025-06-01 12:37:27] [INFO ] Deduced a trap composed of 78 places in 593 ms of which 8 ms to minimize.
[2025-06-01 12:37:28] [INFO ] Deduced a trap composed of 76 places in 641 ms of which 7 ms to minimize.
[2025-06-01 12:37:28] [INFO ] Deduced a trap composed of 73 places in 664 ms of which 7 ms to minimize.
[2025-06-01 12:37:29] [INFO ] Deduced a trap composed of 71 places in 623 ms of which 7 ms to minimize.
[2025-06-01 12:37:30] [INFO ] Deduced a trap composed of 70 places in 687 ms of which 7 ms to minimize.
[2025-06-01 12:37:30] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4764 ms
[2025-06-01 12:37:30] [INFO ] Computed and/alt/rep : 339/1255/332 causal constraints (skipped 357 transitions) in 144 ms.
[2025-06-01 12:37:31] [INFO ] Added : 29 causal constraints over 7 iterations in 672 ms. Result :sat
Minimization took 537 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[195] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[195] Max Struct:[+inf]
Support contains 1 out of 423 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 72 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 423/423 places, 1224/1224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 84 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
[2025-06-01 12:37:34] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2025-06-01 12:37:34] [INFO ] Invariant cache hit.
[2025-06-01 12:37:35] [INFO ] Implicit Places using invariants in 726 ms returned []
[2025-06-01 12:37:35] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2025-06-01 12:37:35] [INFO ] Invariant cache hit.
[2025-06-01 12:37:36] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-01 12:37:38] [INFO ] Implicit Places using invariants and state equation in 3035 ms returned []
Implicit Place search using SMT with State Equation took 3777 ms to find 0 implicit places.
[2025-06-01 12:37:38] [INFO ] Redundant transitions in 36 ms returned []
Running 1222 sub problems to find dead transitions.
[2025-06-01 12:37:38] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2025-06-01 12:37:38] [INFO ] Invariant cache hit.
[2025-06-01 12:37:38] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 423/1114 variables, and 3 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/423 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2025-06-01 12:38:32] [INFO ] Deduced a trap composed of 135 places in 349 ms of which 5 ms to minimize.
[2025-06-01 12:38:32] [INFO ] Deduced a trap composed of 131 places in 328 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 423/1114 variables, and 5 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/423 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 0/1222 constraints, Known Traps: 2/2 constraints]
After SMT, in 66993ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 67019ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70930 ms. Remains : 423/423 places, 1224/1224 transitions.
[2025-06-01 12:38:45] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
Found an invariant !
This invariant on transitions {203=1, 297=1, 495=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 346=1, 544=1, 687=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[195] Max Struct:[+inf]
[2025-06-01 12:38:46] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2025-06-01 12:38:46] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[195] Max Struct:[+inf]
RANDOM walk for 1000001 steps (2 resets) in 3596 ms. (278 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1976 ms. (505 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[195] Max Struct:[+inf]
[2025-06-01 12:38:52] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2025-06-01 12:38:52] [INFO ] Invariant cache hit.
[2025-06-01 12:38:52] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-01 12:38:52] [INFO ] [Real]Absence check using state equation in 310 ms returned sat
[2025-06-01 12:38:52] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-01 12:38:52] [INFO ] [Real]Added 75 Read/Feed constraints in 49 ms returned sat
[2025-06-01 12:38:52] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:38:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-01 12:38:53] [INFO ] [Nat]Absence check using state equation in 394 ms returned sat
[2025-06-01 12:38:53] [INFO ] [Nat]Added 75 Read/Feed constraints in 73 ms returned sat
[2025-06-01 12:38:53] [INFO ] Deduced a trap composed of 113 places in 608 ms of which 7 ms to minimize.
[2025-06-01 12:38:54] [INFO ] Deduced a trap composed of 90 places in 603 ms of which 6 ms to minimize.
[2025-06-01 12:38:54] [INFO ] Deduced a trap composed of 78 places in 515 ms of which 6 ms to minimize.
[2025-06-01 12:38:55] [INFO ] Deduced a trap composed of 76 places in 501 ms of which 6 ms to minimize.
[2025-06-01 12:38:56] [INFO ] Deduced a trap composed of 73 places in 495 ms of which 7 ms to minimize.
[2025-06-01 12:38:56] [INFO ] Deduced a trap composed of 71 places in 580 ms of which 7 ms to minimize.
[2025-06-01 12:38:57] [INFO ] Deduced a trap composed of 70 places in 611 ms of which 5 ms to minimize.
[2025-06-01 12:38:57] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4213 ms
[2025-06-01 12:38:57] [INFO ] Computed and/alt/rep : 339/1255/332 causal constraints (skipped 357 transitions) in 128 ms.
[2025-06-01 12:38:57] [INFO ] Added : 29 causal constraints over 7 iterations in 542 ms. Result :sat
Minimization took 493 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[195] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[195] Max Struct:[+inf]
Support contains 1 out of 423 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 53 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 423/423 places, 1224/1224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 54 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
[2025-06-01 12:39:01] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2025-06-01 12:39:01] [INFO ] Invariant cache hit.
[2025-06-01 12:39:02] [INFO ] Implicit Places using invariants in 904 ms returned []
[2025-06-01 12:39:02] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2025-06-01 12:39:02] [INFO ] Invariant cache hit.
[2025-06-01 12:39:03] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-01 12:39:05] [INFO ] Implicit Places using invariants and state equation in 2781 ms returned []
Implicit Place search using SMT with State Equation took 3692 ms to find 0 implicit places.
[2025-06-01 12:39:05] [INFO ] Redundant transitions in 35 ms returned []
Running 1222 sub problems to find dead transitions.
[2025-06-01 12:39:05] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2025-06-01 12:39:05] [INFO ] Invariant cache hit.
[2025-06-01 12:39:05] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2025-06-01 12:39:36] [INFO ] Deduced a trap composed of 131 places in 202 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 423/1114 variables, and 4 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/423 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 691/1114 variables, 423/427 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1114 variables, 75/502 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1114/1114 variables, and 1724 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30310 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 423/423 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 66543ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 66568ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70361 ms. Remains : 423/423 places, 1224/1224 transitions.
[2025-06-01 12:40:11] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
Found an invariant !
This invariant on transitions {203=1, 297=1, 495=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 346=1, 544=1, 687=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[195] Max Struct:[+inf]
[2025-06-01 12:40:12] [INFO ] Flatten gal took : 51 ms
RANDOM walk for 40003 steps (8 resets) in 209 ms. (190 steps per ms) remains 1/1 properties
[2025-06-01 12:40:12] [INFO ] Flatten gal took : 51 ms
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
[2025-06-01 12:40:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5044538661227200031.gal : 17 ms
[2025-06-01 12:40:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5930977212117613947.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/ReachabilityCardinality5044538661227200031.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5930977212117613947.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/ReachabilityCardinality5930977212117613947.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :31 after 1973
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1973 after 1.19798e+06
Interrupted probabilistic random walk after 375670 steps, run timeout after 3001 ms. (steps per millisecond=125 ) properties seen :0 out of 1
Probabilistic random walk after 375670 steps, saw 230365 distinct states, run finished after 3001 ms. (steps per millisecond=125 ) properties seen :0
[2025-06-01 12:40:15] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2025-06-01 12:40:15] [INFO ] Invariant cache hit.
[2025-06-01 12:40:15] [INFO ] State equation strengthened by 75 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/23 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 351/374 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 10/384 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 601/985 variables, 337/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/985 variables, 74/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/985 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 62/1047 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1047 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 66/1113 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1113 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1/1114 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1114 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1114 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1114/1114 variables, and 501 constraints, problems are : Problem set: 0 solved, 1 unsolved in 538 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 423/423 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/23 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 351/374 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 10/384 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/384 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 601/985 variables, 337/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/985 variables, 74/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/985 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/1047 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1047 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 66/1113 variables, 66/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1113 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1/1114 variables, 1/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1114 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1114 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1114/1114 variables, and 502 constraints, problems are : Problem set: 0 solved, 1 unsolved in 516 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 423/423 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1076ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1820 ms.
Support contains 1 out of 423 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 55 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 423/423 places, 1224/1224 transitions.
RANDOM walk for 40009 steps (8 resets) in 161 ms. (246 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1.19798e+06 after 3.35877e+10
Interrupted probabilistic random walk after 383705 steps, run timeout after 3001 ms. (steps per millisecond=127 ) properties seen :0 out of 1
Probabilistic random walk after 383705 steps, saw 235289 distinct states, run finished after 3001 ms. (steps per millisecond=127 ) properties seen :0
[2025-06-01 12:40:21] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2025-06-01 12:40:21] [INFO ] Invariant cache hit.
[2025-06-01 12:40:21] [INFO ] State equation strengthened by 75 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/23 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 351/374 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 10/384 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 601/985 variables, 337/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/985 variables, 74/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/985 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 62/1047 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1047 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 66/1113 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1113 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1/1114 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1114 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1114 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1114/1114 variables, and 501 constraints, problems are : Problem set: 0 solved, 1 unsolved in 446 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 423/423 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/23 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 351/374 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 10/384 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/384 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 601/985 variables, 337/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/985 variables, 74/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/985 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/1047 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1047 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 66/1113 variables, 66/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1113 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1/1114 variables, 1/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1114 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1114 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1114/1114 variables, and 502 constraints, problems are : Problem set: 0 solved, 1 unsolved in 481 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 423/423 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 939ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2084 ms.
Support contains 1 out of 423 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 60 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 423/423 places, 1224/1224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 54 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
[2025-06-01 12:40:24] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2025-06-01 12:40:24] [INFO ] Invariant cache hit.
[2025-06-01 12:40:25] [INFO ] Implicit Places using invariants in 590 ms returned []
[2025-06-01 12:40:25] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2025-06-01 12:40:25] [INFO ] Invariant cache hit.
[2025-06-01 12:40:25] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-01 12:40:27] [INFO ] Implicit Places using invariants and state equation in 2272 ms returned []
Implicit Place search using SMT with State Equation took 2875 ms to find 0 implicit places.
[2025-06-01 12:40:27] [INFO ] Redundant transitions in 22 ms returned []
Running 1222 sub problems to find dead transitions.
[2025-06-01 12:40:27] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2025-06-01 12:40:27] [INFO ] Invariant cache hit.
[2025-06-01 12:40:27] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3.35877e+10 after 4.41559e+17
[2025-06-01 12:40:57] [INFO ] Deduced a trap composed of 131 places in 141 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Detected timeout of ITS tools.
[2025-06-01 12:41:02] [INFO ] Flatten gal took : 52 ms
[2025-06-01 12:41:02] [INFO ] Applying decomposition
[2025-06-01 12:41:02] [INFO ] Flatten gal took : 49 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/graph10228064339988777172.txt' '-o' '/tmp/graph10228064339988777172.bin' '-w' '/tmp/graph10228064339988777172.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10228064339988777172.bin' '-l' '-1' '-v' '-w' '/tmp/graph10228064339988777172.weights' '-q' '0' '-e' '0.001'
[2025-06-01 12:41:02] [INFO ] Decomposing Gal with order
[2025-06-01 12:41:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 12:41:03] [INFO ] Removed a total of 2102 redundant transitions.
[2025-06-01 12:41:03] [INFO ] Flatten gal took : 82 ms
[2025-06-01 12:41:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 882 labels/synchronizations in 55 ms.
[2025-06-01 12:41:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16126607911226246015.gal : 9 ms
[2025-06-01 12:41:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11302078013286667567.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/ReachabilityCardinality16126607911226246015.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11302078013286667567.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/ReachabilityCardinality11302078013286667567.prop.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 423/1114 variables, and 4 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/423 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 691/1114 variables, 423/427 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1114 variables, 75/502 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1114/1114 variables, and 1724 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30372 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 423/423 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 67019ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 67034ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69994 ms. Remains : 423/423 places, 1224/1224 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 533 transitions
Reduce isomorphic transitions removed 533 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 543 rules applied. Total rules applied 543 place count 423 transition count 681
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 553 place count 413 transition count 681
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 553 place count 413 transition count 608
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 699 place count 340 transition count 608
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 955 place count 212 transition count 480
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1019 place count 148 transition count 352
Iterating global reduction 2 with 64 rules applied. Total rules applied 1083 place count 148 transition count 352
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1084 place count 148 transition count 351
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1147 place count 85 transition count 225
Iterating global reduction 3 with 63 rules applied. Total rules applied 1210 place count 85 transition count 225
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1273 place count 22 transition count 99
Iterating global reduction 3 with 63 rules applied. Total rules applied 1336 place count 22 transition count 99
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1399 place count 22 transition count 36
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1399 place count 22 transition count 35
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1401 place count 21 transition count 35
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 4 with 2 rules applied. Total rules applied 1403 place count 20 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1405 place count 19 transition count 34
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 1408 place count 19 transition count 31
Applied a total of 1408 rules in 123 ms. Remains 19 /423 variables (removed 404) and now considering 31/1224 (removed 1193) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 31 rows 19 cols
[2025-06-01 12:41:34] [INFO ] Computed 3 invariants in 1 ms
[2025-06-01 12:41:34] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2025-06-01 12:41:34] [INFO ] After 14ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-06-01 12:41:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-01 12:41:34] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 12:41:34] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 12:41:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 12:41:34] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 12:41:34] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 12:41:34] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 12:41:34] [INFO ] After 69ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-01 12:41:34] [INFO ] Flatten gal took : 1 ms
[2025-06-01 12:41:34] [INFO ] Flatten gal took : 1 ms
[2025-06-01 12:41:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9009440230743362702.gal : 1 ms
[2025-06-01 12:41:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3259758172148972778.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/ReachabilityCardinality9009440230743362702.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3259758172148972778.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/ReachabilityCardinality3259758172148972778.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
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 315
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :315 after 12482
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :12482 after 326755
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :326755 after 2.38474e+07
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2.38474e+07 after 7.07972e+07
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :7.07972e+07 after 1.64605e+08
Detected timeout of ITS tools.
[2025-06-01 12:41:49] [INFO ] Flatten gal took : 1 ms
[2025-06-01 12:41:49] [INFO ] Applying decomposition
[2025-06-01 12:41:49] [INFO ] Flatten gal took : 1 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/graph4676271122465042464.txt' '-o' '/tmp/graph4676271122465042464.bin' '-w' '/tmp/graph4676271122465042464.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4676271122465042464.bin' '-l' '-1' '-v' '-w' '/tmp/graph4676271122465042464.weights' '-q' '0' '-e' '0.001'
[2025-06-01 12:41:49] [INFO ] Decomposing Gal with order
[2025-06-01 12:41:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 12:41:50] [INFO ] Removed a total of 30 redundant transitions.
[2025-06-01 12:41:50] [INFO ] Flatten gal took : 3 ms
[2025-06-01 12:41:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2025-06-01 12:41:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18139143580309719918.gal : 1 ms
[2025-06-01 12:41:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12718801660230985196.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/ReachabilityCardinality18139143580309719918.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12718801660230985196.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/ReachabilityCardinality12718801660230985196.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
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 315
Detected timeout of ITS tools.
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30409 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[195] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c064-UpperBounds-03 in 289213 ms.
Starting property specific reduction for FunctionPointer-PT-c064-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:[64]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[64]
[2025-06-01 12:42:05] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
// Phase 1: matrix 765 rows 465 cols
[2025-06-01 12:42:05] [INFO ] Computed 2 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[64]
RANDOM walk for 10001 steps (2 resets) in 59 ms. (166 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 19 ms. (500 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[64]
[2025-06-01 12:42:05] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-01 12:42:05] [INFO ] Invariant cache hit.
[2025-06-01 12:42:05] [INFO ] [Real]Absence check using 1 positive place invariants in 10 ms returned sat
[2025-06-01 12:42:05] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:42:05] [INFO ] [Real]Absence check using state equation in 419 ms returned sat
[2025-06-01 12:42:05] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-01 12:42:05] [INFO ] [Real]Added 94 Read/Feed constraints in 61 ms returned sat
[2025-06-01 12:42:05] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:42:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 8 ms returned sat
[2025-06-01 12:42:06] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 12:42:06] [INFO ] [Nat]Absence check using state equation in 412 ms returned sat
[2025-06-01 12:42:06] [INFO ] [Nat]Added 94 Read/Feed constraints in 100 ms returned sat
[2025-06-01 12:42:06] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 150 ms.
[2025-06-01 12:42:06] [INFO ] Added : 1 causal constraints over 1 iterations in 318 ms. Result :sat
Minimization took 660 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[64]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[64]
Support contains 1 out of 465 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 1326/1326 transitions.
Graph (complete) has 2259 edges and 465 vertex of which 462 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 462 transition count 1320
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 13 place count 456 transition count 1308
Iterating global reduction 1 with 6 rules applied. Total rules applied 19 place count 456 transition count 1308
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 27 place count 456 transition count 1300
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 34 place count 449 transition count 1282
Iterating global reduction 2 with 7 rules applied. Total rules applied 41 place count 449 transition count 1282
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 45 place count 449 transition count 1278
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 49 place count 445 transition count 1270
Iterating global reduction 3 with 4 rules applied. Total rules applied 53 place count 445 transition count 1270
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 58 place count 440 transition count 1256
Iterating global reduction 3 with 5 rules applied. Total rules applied 63 place count 440 transition count 1256
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 68 place count 435 transition count 1244
Iterating global reduction 3 with 5 rules applied. Total rules applied 73 place count 435 transition count 1244
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 78 place count 430 transition count 1234
Iterating global reduction 3 with 5 rules applied. Total rules applied 83 place count 430 transition count 1234
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 88 place count 425 transition count 1224
Iterating global reduction 3 with 5 rules applied. Total rules applied 93 place count 425 transition count 1224
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 98 place count 420 transition count 1214
Iterating global reduction 3 with 5 rules applied. Total rules applied 103 place count 420 transition count 1214
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 106 place count 417 transition count 1208
Iterating global reduction 3 with 3 rules applied. Total rules applied 109 place count 417 transition count 1208
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 112 place count 414 transition count 1202
Iterating global reduction 3 with 3 rules applied. Total rules applied 115 place count 414 transition count 1202
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 116 place count 413 transition count 1200
Iterating global reduction 3 with 1 rules applied. Total rules applied 117 place count 413 transition count 1200
Applied a total of 117 rules in 538 ms. Remains 413 /465 variables (removed 52) and now considering 1200/1326 (removed 126) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 538 ms. Remains : 413/465 places, 1200/1326 transitions.
[2025-06-01 12:42:08] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
// Phase 1: matrix 675 rows 413 cols
[2025-06-01 12:42:08] [INFO ] Computed 3 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[64]
RANDOM walk for 1000000 steps (2 resets) in 2859 ms. (349 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1527 ms. (654 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[18] Max Struct:[64]
[2025-06-01 12:42:12] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2025-06-01 12:42:12] [INFO ] Invariant cache hit.
[2025-06-01 12:42:12] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2025-06-01 12:42:13] [INFO ] [Real]Absence check using state equation in 387 ms returned sat
[2025-06-01 12:42:13] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-01 12:42:13] [INFO ] [Real]Added 72 Read/Feed constraints in 97 ms returned sat
[2025-06-01 12:42:13] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:42:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-01 12:42:13] [INFO ] [Nat]Absence check using state equation in 402 ms returned sat
[2025-06-01 12:42:13] [INFO ] [Nat]Added 72 Read/Feed constraints in 103 ms returned sat
[2025-06-01 12:42:14] [INFO ] Computed and/alt/rep : 332/994/330 causal constraints (skipped 343 transitions) in 139 ms.
[2025-06-01 12:42:14] [INFO ] Added : 2 causal constraints over 1 iterations in 287 ms. Result :sat
Minimization took 518 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[18] Max Struct:[64]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[64] Max Struct:[64]
Support contains 1 out of 413 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 1200/1200 transitions.
Applied a total of 0 rules in 95 ms. Remains 413 /413 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 413/413 places, 1200/1200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 1200/1200 transitions.
Applied a total of 0 rules in 99 ms. Remains 413 /413 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
[2025-06-01 12:42:15] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2025-06-01 12:42:15] [INFO ] Invariant cache hit.
[2025-06-01 12:42:16] [INFO ] Implicit Places using invariants in 823 ms returned []
[2025-06-01 12:42:16] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2025-06-01 12:42:16] [INFO ] Invariant cache hit.
[2025-06-01 12:42:16] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-01 12:42:19] [INFO ] Implicit Places using invariants and state equation in 3057 ms returned []
Implicit Place search using SMT with State Equation took 3885 ms to find 0 implicit places.
[2025-06-01 12:42:19] [INFO ] Redundant transitions in 34 ms returned []
Running 1198 sub problems to find dead transitions.
[2025-06-01 12:42:19] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2025-06-01 12:42:19] [INFO ] Invariant cache hit.
[2025-06-01 12:42:19] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2025-06-01 12:42:51] [INFO ] Deduced a trap composed of 131 places in 350 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 413/1088 variables, and 4 constraints, problems are : Problem set: 0 solved, 1198 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/413 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 1198/1198 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/413 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 3 (OVERLAPS) 675/1088 variables, 413/417 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1088 variables, 72/489 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1088/1088 variables, and 1687 constraints, problems are : Problem set: 0 solved, 1198 unsolved in 30973 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 413/413 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1198/1198 constraints, Known Traps: 1/1 constraints]
After SMT, in 67392ms problems are : Problem set: 0 solved, 1198 unsolved
Search for dead transitions found 0 dead transitions in 67414ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71445 ms. Remains : 413/413 places, 1200/1200 transitions.
[2025-06-01 12:43:26] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2025-06-01 12:43:26] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[64] Max Struct:[64]
FORMULA FunctionPointer-PT-c064-UpperBounds-08 64 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 2964 ms. (337 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-06-01 12:43:29] [INFO ] Flatten gal took : 41 ms
[2025-06-01 12:43:29] [INFO ] Flatten gal took : 36 ms
[2025-06-01 12:43:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1949739529597273668.gal : 8 ms
[2025-06-01 12:43:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15491266565190287207.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/ReachabilityCardinality1949739529597273668.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15491266565190287207.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
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
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for FunctionPointer-PT-c064-UpperBounds-08 in 84554 ms.
Starting property specific reduction for FunctionPointer-PT-c064-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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2025-06-01 12:43:29] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
// Phase 1: matrix 765 rows 465 cols
[2025-06-01 12:43:29] [INFO ] Computed 2 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 34 ms. (285 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2025-06-01 12:43:29] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-01 12:43:29] [INFO ] Invariant cache hit.
[2025-06-01 12:43:29] [INFO ] [Real]Absence check using 1 positive place invariants in 10 ms returned sat
[2025-06-01 12:43:29] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 7 ms returned sat
[2025-06-01 12:43:30] [INFO ] [Real]Absence check using state equation in 415 ms returned sat
[2025-06-01 12:43:30] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-01 12:43:30] [INFO ] [Real]Added 94 Read/Feed constraints in 43 ms returned sat
[2025-06-01 12:43:30] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:43:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 10 ms returned sat
[2025-06-01 12:43:30] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 12:43:30] [INFO ] [Nat]Absence check using state equation in 378 ms returned sat
[2025-06-01 12:43:30] [INFO ] [Nat]Added 94 Read/Feed constraints in 69 ms returned sat
[2025-06-01 12:43:31] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 146 ms.
[2025-06-01 12:43:31] [INFO ] Added : 6 causal constraints over 4 iterations in 511 ms. Result :sat
Minimization took 687 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 465 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 1326/1326 transitions.
Graph (complete) has 2259 edges and 465 vertex of which 462 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 462 transition count 1320
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 12 place count 457 transition count 1310
Iterating global reduction 1 with 5 rules applied. Total rules applied 17 place count 457 transition count 1310
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 25 place count 457 transition count 1302
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 31 place count 451 transition count 1288
Iterating global reduction 2 with 6 rules applied. Total rules applied 37 place count 451 transition count 1288
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 41 place count 451 transition count 1284
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 44 place count 448 transition count 1278
Iterating global reduction 3 with 3 rules applied. Total rules applied 47 place count 448 transition count 1278
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 51 place count 444 transition count 1266
Iterating global reduction 3 with 4 rules applied. Total rules applied 55 place count 444 transition count 1266
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 59 place count 440 transition count 1256
Iterating global reduction 3 with 4 rules applied. Total rules applied 63 place count 440 transition count 1256
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 67 place count 436 transition count 1248
Iterating global reduction 3 with 4 rules applied. Total rules applied 71 place count 436 transition count 1248
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 75 place count 432 transition count 1240
Iterating global reduction 3 with 4 rules applied. Total rules applied 79 place count 432 transition count 1240
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 83 place count 428 transition count 1232
Iterating global reduction 3 with 4 rules applied. Total rules applied 87 place count 428 transition count 1232
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 90 place count 425 transition count 1226
Iterating global reduction 3 with 3 rules applied. Total rules applied 93 place count 425 transition count 1226
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 96 place count 422 transition count 1220
Iterating global reduction 3 with 3 rules applied. Total rules applied 99 place count 422 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 100 place count 421 transition count 1218
Iterating global reduction 3 with 1 rules applied. Total rules applied 101 place count 421 transition count 1218
Applied a total of 101 rules in 378 ms. Remains 421 /465 variables (removed 44) and now considering 1218/1326 (removed 108) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 379 ms. Remains : 421/465 places, 1218/1326 transitions.
[2025-06-01 12:43:32] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
Found an invariant !
This invariant on transitions {216=1, 307=1, 633=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 343=1, 541=1, 684=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2025-06-01 12:43:33] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
// Phase 1: matrix 688 rows 421 cols
[2025-06-01 12:43:33] [INFO ] Computed 3 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 3392 ms. (294 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1907 ms. (524 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[465] Max Struct:[+inf]
[2025-06-01 12:43:38] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-01 12:43:38] [INFO ] Invariant cache hit.
[2025-06-01 12:43:38] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-01 12:43:39] [INFO ] [Real]Absence check using state equation in 387 ms returned sat
[2025-06-01 12:43:39] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-01 12:43:39] [INFO ] [Real]Added 75 Read/Feed constraints in 90 ms returned sat
[2025-06-01 12:43:39] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:43:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2025-06-01 12:43:39] [INFO ] [Nat]Absence check using state equation in 377 ms returned sat
[2025-06-01 12:43:39] [INFO ] [Nat]Added 75 Read/Feed constraints in 74 ms returned sat
[2025-06-01 12:43:40] [INFO ] Deduced a trap composed of 113 places in 591 ms of which 8 ms to minimize.
[2025-06-01 12:43:41] [INFO ] Deduced a trap composed of 109 places in 567 ms of which 7 ms to minimize.
[2025-06-01 12:43:41] [INFO ] Deduced a trap composed of 87 places in 571 ms of which 7 ms to minimize.
[2025-06-01 12:43:42] [INFO ] Deduced a trap composed of 74 places in 582 ms of which 7 ms to minimize.
[2025-06-01 12:43:43] [INFO ] Deduced a trap composed of 71 places in 587 ms of which 14 ms to minimize.
[2025-06-01 12:43:43] [INFO ] Deduced a trap composed of 71 places in 584 ms of which 7 ms to minimize.
[2025-06-01 12:43:43] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3774 ms
[2025-06-01 12:43:43] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 354 transitions) in 154 ms.
[2025-06-01 12:43:44] [INFO ] Added : 10 causal constraints over 3 iterations in 472 ms. Result :sat
Minimization took 560 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[465] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[465] Max Struct:[+inf]
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 83 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 103 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2025-06-01 12:43:44] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-01 12:43:44] [INFO ] Invariant cache hit.
[2025-06-01 12:43:45] [INFO ] Implicit Places using invariants in 863 ms returned []
[2025-06-01 12:43:45] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-01 12:43:45] [INFO ] Invariant cache hit.
[2025-06-01 12:43:46] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-01 12:43:48] [INFO ] Implicit Places using invariants and state equation in 2632 ms returned []
Implicit Place search using SMT with State Equation took 3496 ms to find 0 implicit places.
[2025-06-01 12:43:48] [INFO ] Redundant transitions in 27 ms returned []
Running 1216 sub problems to find dead transitions.
[2025-06-01 12:43:48] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-01 12:43:48] [INFO ] Invariant cache hit.
[2025-06-01 12:43:48] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
[2025-06-01 12:44:20] [INFO ] Deduced a trap composed of 131 places in 199 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 421/1109 variables, and 4 constraints, problems are : Problem set: 0 solved, 1216 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/421 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 1216/1216 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 3 (OVERLAPS) 688/1109 variables, 421/425 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1109 variables, 75/500 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1109/1109 variables, and 1716 constraints, problems are : Problem set: 0 solved, 1216 unsolved in 30482 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1216/1216 constraints, Known Traps: 1/1 constraints]
After SMT, in 66770ms problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 66787ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70422 ms. Remains : 421/421 places, 1218/1218 transitions.
[2025-06-01 12:44:55] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
Found an invariant !
This invariant on transitions {216=1, 307=1, 633=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 343=1, 541=1, 684=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[465] Max Struct:[+inf]
[2025-06-01 12:44:56] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-01 12:44:56] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[465] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 3357 ms. (297 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1484 ms. (673 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[465] Max Struct:[+inf]
[2025-06-01 12:45:00] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-01 12:45:00] [INFO ] Invariant cache hit.
[2025-06-01 12:45:00] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-01 12:45:01] [INFO ] [Real]Absence check using state equation in 248 ms returned sat
[2025-06-01 12:45:01] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-01 12:45:01] [INFO ] [Real]Added 75 Read/Feed constraints in 53 ms returned sat
[2025-06-01 12:45:01] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:45:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-01 12:45:01] [INFO ] [Nat]Absence check using state equation in 305 ms returned sat
[2025-06-01 12:45:01] [INFO ] [Nat]Added 75 Read/Feed constraints in 64 ms returned sat
[2025-06-01 12:45:02] [INFO ] Deduced a trap composed of 113 places in 567 ms of which 5 ms to minimize.
[2025-06-01 12:45:02] [INFO ] Deduced a trap composed of 109 places in 402 ms of which 5 ms to minimize.
[2025-06-01 12:45:03] [INFO ] Deduced a trap composed of 87 places in 398 ms of which 5 ms to minimize.
[2025-06-01 12:45:03] [INFO ] Deduced a trap composed of 74 places in 387 ms of which 5 ms to minimize.
[2025-06-01 12:45:04] [INFO ] Deduced a trap composed of 71 places in 392 ms of which 4 ms to minimize.
[2025-06-01 12:45:04] [INFO ] Deduced a trap composed of 71 places in 455 ms of which 7 ms to minimize.
[2025-06-01 12:45:04] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2795 ms
[2025-06-01 12:45:04] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 354 transitions) in 104 ms.
[2025-06-01 12:45:04] [INFO ] Added : 10 causal constraints over 3 iterations in 386 ms. Result :sat
Minimization took 402 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[465] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[465] Max Struct:[+inf]
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 51 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 51 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2025-06-01 12:45:05] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-01 12:45:05] [INFO ] Invariant cache hit.
[2025-06-01 12:45:06] [INFO ] Implicit Places using invariants in 711 ms returned []
[2025-06-01 12:45:06] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-01 12:45:06] [INFO ] Invariant cache hit.
[2025-06-01 12:45:06] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-01 12:45:08] [INFO ] Implicit Places using invariants and state equation in 1910 ms returned []
Implicit Place search using SMT with State Equation took 2623 ms to find 0 implicit places.
[2025-06-01 12:45:08] [INFO ] Redundant transitions in 22 ms returned []
Running 1216 sub problems to find dead transitions.
[2025-06-01 12:45:08] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-01 12:45:08] [INFO ] Invariant cache hit.
[2025-06-01 12:45:08] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
[2025-06-01 12:45:39] [INFO ] Deduced a trap composed of 131 places in 167 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 421/1109 variables, and 4 constraints, problems are : Problem set: 0 solved, 1216 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/421 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 1216/1216 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 3 (OVERLAPS) 688/1109 variables, 421/425 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1109 variables, 75/500 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1109 variables, 1216/1716 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1109/1109 variables, and 1716 constraints, problems are : Problem set: 0 solved, 1216 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1216/1216 constraints, Known Traps: 1/1 constraints]
After SMT, in 66259ms problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 66272ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68977 ms. Remains : 421/421 places, 1218/1218 transitions.
[2025-06-01 12:46:14] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
Found an invariant !
This invariant on transitions {216=1, 307=1, 633=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 343=1, 541=1, 684=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[465] Max Struct:[+inf]
RANDOM walk for 40001 steps (8 resets) in 318 ms. (125 steps per ms) remains 1/1 properties
[2025-06-01 12:46:15] [INFO ] Flatten gal took : 104 ms
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 1/1 properties
[2025-06-01 12:46:15] [INFO ] Flatten gal took : 56 ms
[2025-06-01 12:46:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12814253770815425973.gal : 10 ms
[2025-06-01 12:46:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10815522495291866442.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/ReachabilityCardinality12814253770815425973.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10815522495291866442.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/ReachabilityCardinality10815522495291866442.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :31 after 1995
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1995 after 1.24464e+06
Interrupted probabilistic random walk after 378866 steps, run timeout after 3001 ms. (steps per millisecond=126 ) properties seen :0 out of 1
Probabilistic random walk after 378866 steps, saw 232324 distinct states, run finished after 3001 ms. (steps per millisecond=126 ) properties seen :0
[2025-06-01 12:46:18] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-01 12:46:18] [INFO ] Invariant cache hit.
[2025-06-01 12:46:18] [INFO ] State equation strengthened by 75 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 352/371 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/378 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 604/982 variables, 337/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/982 variables, 74/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/982 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 62/1044 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1044 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 65/1109 variables, 66/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1109 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1109 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1109/1109 variables, and 499 constraints, problems are : Problem set: 0 solved, 1 unsolved in 429 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 352/371 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/378 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 604/982 variables, 337/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/982 variables, 74/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/982 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 62/1044 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1044 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 65/1109 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1109 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1109 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1109/1109 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 442 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 879ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3925 ms.
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 52 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 421/421 places, 1218/1218 transitions.
RANDOM walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1.24464e+06 after 3.74714e+10
Interrupted probabilistic random walk after 380365 steps, run timeout after 3001 ms. (steps per millisecond=126 ) properties seen :0 out of 1
Probabilistic random walk after 380365 steps, saw 233243 distinct states, run finished after 3001 ms. (steps per millisecond=126 ) properties seen :0
[2025-06-01 12:46:26] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-01 12:46:26] [INFO ] Invariant cache hit.
[2025-06-01 12:46:26] [INFO ] State equation strengthened by 75 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 352/371 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/378 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 604/982 variables, 337/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/982 variables, 74/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/982 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 62/1044 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1044 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 65/1109 variables, 66/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1109 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1109 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1109/1109 variables, and 499 constraints, problems are : Problem set: 0 solved, 1 unsolved in 429 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 352/371 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/378 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 604/982 variables, 337/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/982 variables, 74/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/982 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 62/1044 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1044 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 65/1109 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1109 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1109 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1109/1109 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 444 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 893ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3816 ms.
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 95 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 67 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2025-06-01 12:46:31] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-01 12:46:31] [INFO ] Invariant cache hit.
[2025-06-01 12:46:31] [INFO ] Implicit Places using invariants in 478 ms returned []
[2025-06-01 12:46:31] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-01 12:46:31] [INFO ] Invariant cache hit.
[2025-06-01 12:46:31] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-01 12:46:33] [INFO ] Implicit Places using invariants and state equation in 1857 ms returned []
Implicit Place search using SMT with State Equation took 2341 ms to find 0 implicit places.
[2025-06-01 12:46:33] [INFO ] Redundant transitions in 22 ms returned []
Running 1216 sub problems to find dead transitions.
[2025-06-01 12:46:33] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-01 12:46:33] [INFO ] Invariant cache hit.
[2025-06-01 12:46:33] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3.74714e+10 after 5.80652e+17
Detected timeout of ITS tools.
[2025-06-01 12:47:05] [INFO ] Flatten gal took : 33 ms
[2025-06-01 12:47:05] [INFO ] Applying decomposition
[2025-06-01 12:47:05] [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/graph12342157826120864708.txt' '-o' '/tmp/graph12342157826120864708.bin' '-w' '/tmp/graph12342157826120864708.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12342157826120864708.bin' '-l' '-1' '-v' '-w' '/tmp/graph12342157826120864708.weights' '-q' '0' '-e' '0.001'
[2025-06-01 12:47:05] [INFO ] Decomposing Gal with order
[2025-06-01 12:47:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 12:47:05] [INFO ] Removed a total of 2084 redundant transitions.
[2025-06-01 12:47:05] [INFO ] Flatten gal took : 94 ms
[2025-06-01 12:47:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 847 labels/synchronizations in 117 ms.
[2025-06-01 12:47:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17093990976764552336.gal : 14 ms
[2025-06-01 12:47:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18216083229423289879.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/ReachabilityCardinality17093990976764552336.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18216083229423289879.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/ReachabilityCardinality18216083229423289879.prop.
[2025-06-01 12:47:08] [INFO ] Deduced a trap composed of 131 places in 308 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 421/1109 variables, and 4 constraints, problems are : Problem set: 0 solved, 1216 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/421 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 1216/1216 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 3 (OVERLAPS) 688/1109 variables, 421/425 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1109 variables, 75/500 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1109/1109 variables, and 1716 constraints, problems are : Problem set: 0 solved, 1216 unsolved in 30680 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1216/1216 constraints, Known Traps: 1/1 constraints]
After SMT, in 67451ms problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 67464ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69904 ms. Remains : 421/421 places, 1218/1218 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 530 transitions
Reduce isomorphic transitions removed 530 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 540 rules applied. Total rules applied 540 place count 421 transition count 678
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 550 place count 411 transition count 678
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 550 place count 411 transition count 605
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 696 place count 338 transition count 605
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 950 place count 211 transition count 478
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1014 place count 147 transition count 350
Iterating global reduction 2 with 64 rules applied. Total rules applied 1078 place count 147 transition count 350
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1079 place count 147 transition count 349
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1142 place count 84 transition count 223
Iterating global reduction 3 with 63 rules applied. Total rules applied 1205 place count 84 transition count 223
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1268 place count 21 transition count 97
Iterating global reduction 3 with 63 rules applied. Total rules applied 1331 place count 21 transition count 97
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1394 place count 21 transition count 34
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1394 place count 21 transition count 33
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1396 place count 20 transition count 33
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 4 with 2 rules applied. Total rules applied 1398 place count 19 transition count 32
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1399 place count 19 transition count 31
Applied a total of 1399 rules in 59 ms. Remains 19 /421 variables (removed 402) and now considering 31/1218 (removed 1187) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 31 rows 19 cols
[2025-06-01 12:47:40] [INFO ] Computed 3 invariants in 1 ms
[2025-06-01 12:47:41] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 12:47:41] [INFO ] After 13ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-06-01 12:47:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-01 12:47:41] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 12:47:41] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 12:47:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 12:47:41] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 12:47:41] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 12:47:41] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 12:47:41] [INFO ] After 58ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-01 12:47:41] [INFO ] Flatten gal took : 2 ms
[2025-06-01 12:47:41] [INFO ] Flatten gal took : 1 ms
[2025-06-01 12:47:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3292501406957231743.gal : 2 ms
[2025-06-01 12:47:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15265797430298867610.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/ReachabilityCardinality3292501406957231743.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15265797430298867610.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/ReachabilityCardinality15265797430298867610.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
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 315
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :315 after 35107
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :35107 after 6.2298e+06
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :6.2298e+06 after 1.79901e+07
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.79901e+07 after 4.1465e+07
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :4.1465e+07 after 8.8369e+07
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :8.8369e+07 after 1.82131e+08
Detected timeout of ITS tools.
Detected timeout of ITS tools.
[2025-06-01 12:47:56] [INFO ] Flatten gal took : 1 ms
[2025-06-01 12:47:56] [INFO ] Applying decomposition
[2025-06-01 12:47:56] [INFO ] Flatten gal took : 1 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/graph2456672542231556927.txt' '-o' '/tmp/graph2456672542231556927.bin' '-w' '/tmp/graph2456672542231556927.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2456672542231556927.bin' '-l' '-1' '-v' '-w' '/tmp/graph2456672542231556927.weights' '-q' '0' '-e' '0.001'
[2025-06-01 12:47:56] [INFO ] Decomposing Gal with order
[2025-06-01 12:47:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 12:47:56] [INFO ] Removed a total of 30 redundant transitions.
[2025-06-01 12:47:56] [INFO ] Flatten gal took : 2 ms
[2025-06-01 12:47:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2025-06-01 12:47:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16482042143376392639.gal : 1 ms
[2025-06-01 12:47:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17458356892565965568.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/ReachabilityCardinality16482042143376392639.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17458356892565965568.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/ReachabilityCardinality17458356892565965568.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
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 315
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30271 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[465] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c064-UpperBounds-09 in 281547 ms.
Starting property specific reduction for FunctionPointer-PT-c064-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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2025-06-01 12:48:11] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
// Phase 1: matrix 765 rows 465 cols
[2025-06-01 12:48:11] [INFO ] Computed 2 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 53 ms. (185 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 13 ms. (714 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2025-06-01 12:48:11] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-01 12:48:11] [INFO ] Invariant cache hit.
[2025-06-01 12:48:11] [INFO ] [Real]Absence check using 1 positive place invariants in 10 ms returned sat
[2025-06-01 12:48:11] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:48:11] [INFO ] [Real]Absence check using state equation in 425 ms returned sat
[2025-06-01 12:48:11] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-01 12:48:11] [INFO ] [Real]Added 94 Read/Feed constraints in 58 ms returned sat
[2025-06-01 12:48:11] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:48:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-06-01 12:48:12] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 12:48:12] [INFO ] [Nat]Absence check using state equation in 422 ms returned sat
[2025-06-01 12:48:12] [INFO ] [Nat]Added 94 Read/Feed constraints in 53 ms returned sat
[2025-06-01 12:48:12] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 148 ms.
[2025-06-01 12:48:13] [INFO ] Added : 5 causal constraints over 2 iterations in 437 ms. Result :sat
Minimization took 674 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 465 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 1326/1326 transitions.
Graph (complete) has 2259 edges and 465 vertex of which 462 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 462 transition count 1320
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 12 place count 457 transition count 1310
Iterating global reduction 1 with 5 rules applied. Total rules applied 17 place count 457 transition count 1310
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 25 place count 457 transition count 1302
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 31 place count 451 transition count 1288
Iterating global reduction 2 with 6 rules applied. Total rules applied 37 place count 451 transition count 1288
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 41 place count 451 transition count 1284
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 44 place count 448 transition count 1278
Iterating global reduction 3 with 3 rules applied. Total rules applied 47 place count 448 transition count 1278
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 51 place count 444 transition count 1266
Iterating global reduction 3 with 4 rules applied. Total rules applied 55 place count 444 transition count 1266
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 59 place count 440 transition count 1256
Iterating global reduction 3 with 4 rules applied. Total rules applied 63 place count 440 transition count 1256
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 67 place count 436 transition count 1248
Iterating global reduction 3 with 4 rules applied. Total rules applied 71 place count 436 transition count 1248
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 75 place count 432 transition count 1240
Iterating global reduction 3 with 4 rules applied. Total rules applied 79 place count 432 transition count 1240
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 83 place count 428 transition count 1232
Iterating global reduction 3 with 4 rules applied. Total rules applied 87 place count 428 transition count 1232
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 90 place count 425 transition count 1226
Iterating global reduction 3 with 3 rules applied. Total rules applied 93 place count 425 transition count 1226
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 96 place count 422 transition count 1220
Iterating global reduction 3 with 3 rules applied. Total rules applied 99 place count 422 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 100 place count 421 transition count 1218
Iterating global reduction 3 with 1 rules applied. Total rules applied 101 place count 421 transition count 1218
Applied a total of 101 rules in 176 ms. Remains 421 /465 variables (removed 44) and now considering 1218/1326 (removed 108) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177 ms. Remains : 421/465 places, 1218/1326 transitions.
[2025-06-01 12:48:13] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
Found an invariant !
This invariant on transitions {216=1, 307=1, 633=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 343=1, 541=1, 684=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2025-06-01 12:48:14] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
// Phase 1: matrix 688 rows 421 cols
[2025-06-01 12:48:14] [INFO ] Computed 3 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000001 steps (2 resets) in 3351 ms. (298 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1628 ms. (613 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[463] Max Struct:[+inf]
[2025-06-01 12:48:19] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-01 12:48:19] [INFO ] Invariant cache hit.
[2025-06-01 12:48:19] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-01 12:48:19] [INFO ] [Real]Absence check using state equation in 291 ms returned sat
[2025-06-01 12:48:19] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-01 12:48:19] [INFO ] [Real]Added 75 Read/Feed constraints in 86 ms returned sat
[2025-06-01 12:48:20] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:48:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2025-06-01 12:48:20] [INFO ] [Nat]Absence check using state equation in 379 ms returned sat
[2025-06-01 12:48:20] [INFO ] [Nat]Added 75 Read/Feed constraints in 64 ms returned sat
[2025-06-01 12:48:21] [INFO ] Deduced a trap composed of 113 places in 631 ms of which 7 ms to minimize.
[2025-06-01 12:48:21] [INFO ] Deduced a trap composed of 109 places in 644 ms of which 7 ms to minimize.
[2025-06-01 12:48:22] [INFO ] Deduced a trap composed of 87 places in 644 ms of which 7 ms to minimize.
[2025-06-01 12:48:23] [INFO ] Deduced a trap composed of 78 places in 524 ms of which 7 ms to minimize.
[2025-06-01 12:48:23] [INFO ] Deduced a trap composed of 76 places in 515 ms of which 7 ms to minimize.
[2025-06-01 12:48:24] [INFO ] Deduced a trap composed of 73 places in 488 ms of which 7 ms to minimize.
[2025-06-01 12:48:24] [INFO ] Deduced a trap composed of 71 places in 503 ms of which 7 ms to minimize.
[2025-06-01 12:48:25] [INFO ] Deduced a trap composed of 70 places in 529 ms of which 7 ms to minimize.
[2025-06-01 12:48:26] [INFO ] Deduced a trap composed of 71 places in 614 ms of which 7 ms to minimize.
[2025-06-01 12:48:26] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 5459 ms
[2025-06-01 12:48:26] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 354 transitions) in 138 ms.
[2025-06-01 12:48:26] [INFO ] Added : 10 causal constraints over 3 iterations in 467 ms. Result :sat
Minimization took 555 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[463] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[463] Max Struct:[+inf]
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 82 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 82 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2025-06-01 12:48:27] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-01 12:48:27] [INFO ] Invariant cache hit.
[2025-06-01 12:48:28] [INFO ] Implicit Places using invariants in 970 ms returned []
[2025-06-01 12:48:28] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-01 12:48:28] [INFO ] Invariant cache hit.
[2025-06-01 12:48:28] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-01 12:48:31] [INFO ] Implicit Places using invariants and state equation in 2920 ms returned []
Implicit Place search using SMT with State Equation took 3905 ms to find 0 implicit places.
[2025-06-01 12:48:31] [INFO ] Redundant transitions in 35 ms returned []
Running 1216 sub problems to find dead transitions.
[2025-06-01 12:48:31] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-01 12:48:31] [INFO ] Invariant cache hit.
[2025-06-01 12:48:31] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
[2025-06-01 12:49:05] [INFO ] Deduced a trap composed of 131 places in 263 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 421/1109 variables, and 4 constraints, problems are : Problem set: 0 solved, 1216 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/421 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 1216/1216 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 3 (OVERLAPS) 688/1109 variables, 421/425 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1109 variables, 75/500 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1109/1109 variables, and 1716 constraints, problems are : Problem set: 0 solved, 1216 unsolved in 30972 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1216/1216 constraints, Known Traps: 1/1 constraints]
After SMT, in 66630ms problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 66651ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70695 ms. Remains : 421/421 places, 1218/1218 transitions.
[2025-06-01 12:49:37] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
Found an invariant !
This invariant on transitions {216=1, 307=1, 633=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 343=1, 541=1, 684=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[463] Max Struct:[+inf]
[2025-06-01 12:49:38] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-01 12:49:38] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[463] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 3632 ms. (275 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1478 ms. (676 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[463] Max Struct:[+inf]
[2025-06-01 12:49:43] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-01 12:49:43] [INFO ] Invariant cache hit.
[2025-06-01 12:49:43] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2025-06-01 12:49:44] [INFO ] [Real]Absence check using state equation in 386 ms returned sat
[2025-06-01 12:49:44] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-01 12:49:44] [INFO ] [Real]Added 75 Read/Feed constraints in 94 ms returned sat
[2025-06-01 12:49:44] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:49:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-01 12:49:44] [INFO ] [Nat]Absence check using state equation in 381 ms returned sat
[2025-06-01 12:49:44] [INFO ] [Nat]Added 75 Read/Feed constraints in 63 ms returned sat
[2025-06-01 12:49:45] [INFO ] Deduced a trap composed of 113 places in 598 ms of which 7 ms to minimize.
[2025-06-01 12:49:46] [INFO ] Deduced a trap composed of 109 places in 604 ms of which 7 ms to minimize.
[2025-06-01 12:49:46] [INFO ] Deduced a trap composed of 87 places in 590 ms of which 7 ms to minimize.
[2025-06-01 12:49:47] [INFO ] Deduced a trap composed of 78 places in 496 ms of which 6 ms to minimize.
[2025-06-01 12:49:47] [INFO ] Deduced a trap composed of 76 places in 532 ms of which 5 ms to minimize.
[2025-06-01 12:49:48] [INFO ] Deduced a trap composed of 73 places in 575 ms of which 7 ms to minimize.
[2025-06-01 12:49:49] [INFO ] Deduced a trap composed of 71 places in 594 ms of which 7 ms to minimize.
[2025-06-01 12:49:49] [INFO ] Deduced a trap composed of 70 places in 585 ms of which 4 ms to minimize.
[2025-06-01 12:49:50] [INFO ] Deduced a trap composed of 71 places in 429 ms of which 6 ms to minimize.
[2025-06-01 12:49:50] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 5377 ms
[2025-06-01 12:49:50] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 354 transitions) in 98 ms.
[2025-06-01 12:49:50] [INFO ] Added : 10 causal constraints over 3 iterations in 358 ms. Result :sat
Minimization took 550 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[463] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[463] Max Struct:[+inf]
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 87 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 52 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2025-06-01 12:49:51] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-01 12:49:51] [INFO ] Invariant cache hit.
[2025-06-01 12:49:52] [INFO ] Implicit Places using invariants in 773 ms returned []
[2025-06-01 12:49:52] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-01 12:49:52] [INFO ] Invariant cache hit.
[2025-06-01 12:49:52] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-01 12:49:55] [INFO ] Implicit Places using invariants and state equation in 2926 ms returned []
Implicit Place search using SMT with State Equation took 3699 ms to find 0 implicit places.
[2025-06-01 12:49:55] [INFO ] Redundant transitions in 33 ms returned []
Running 1216 sub problems to find dead transitions.
[2025-06-01 12:49:55] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-01 12:49:55] [INFO ] Invariant cache hit.
[2025-06-01 12:49:55] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 421/1109 variables, and 3 constraints, problems are : Problem set: 0 solved, 1216 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/421 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 1216/1216 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
[2025-06-01 12:50:48] [INFO ] Deduced a trap composed of 131 places in 243 ms of which 9 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 421/1109 variables, and 4 constraints, problems are : Problem set: 0 solved, 1216 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/421 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 0/1216 constraints, Known Traps: 1/1 constraints]
After SMT, in 66588ms problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 66612ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70408 ms. Remains : 421/421 places, 1218/1218 transitions.
[2025-06-01 12:51:01] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
Found an invariant !
This invariant on transitions {216=1, 307=1, 633=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 343=1, 541=1, 684=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[463] Max Struct:[+inf]
[2025-06-01 12:51:02] [INFO ] Flatten gal took : 107 ms
[2025-06-01 12:51:02] [INFO ] Flatten gal took : 39 ms
[2025-06-01 12:51:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9151760270724722869.gal : 7 ms
[2025-06-01 12:51:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8418806585660182373.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/ReachabilityCardinality9151760270724722869.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8418806585660182373.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 40001 steps (8 resets) in 374 ms. (106 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality8418806585660182373.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :31 after 1995
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1995 after 1.24464e+06
Interrupted probabilistic random walk after 349705 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :0 out of 1
Probabilistic random walk after 349705 steps, saw 214444 distinct states, run finished after 3001 ms. (steps per millisecond=116 ) properties seen :0
[2025-06-01 12:51:05] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-01 12:51:05] [INFO ] Invariant cache hit.
[2025-06-01 12:51:05] [INFO ] State equation strengthened by 75 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 352/371 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/378 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 604/982 variables, 337/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/982 variables, 74/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/982 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 62/1044 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1044 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 65/1109 variables, 66/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1109 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1109 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1109/1109 variables, and 499 constraints, problems are : Problem set: 0 solved, 1 unsolved in 733 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 352/371 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/378 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 604/982 variables, 337/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/982 variables, 74/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/982 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 62/1044 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1044 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 65/1109 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1109 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1109 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1109/1109 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 410 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1168ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3619 ms.
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 47 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 421/421 places, 1218/1218 transitions.
RANDOM walk for 40008 steps (8 resets) in 187 ms. (212 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1.24464e+06 after 3.74714e+10
Interrupted probabilistic random walk after 361140 steps, run timeout after 3001 ms. (steps per millisecond=120 ) properties seen :0 out of 1
Probabilistic random walk after 361140 steps, saw 221456 distinct states, run finished after 3001 ms. (steps per millisecond=120 ) properties seen :0
[2025-06-01 12:51:13] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-01 12:51:13] [INFO ] Invariant cache hit.
[2025-06-01 12:51:13] [INFO ] State equation strengthened by 75 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 352/371 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/378 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 604/982 variables, 337/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/982 variables, 74/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/982 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 62/1044 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1044 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 65/1109 variables, 66/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1109 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1109 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1109/1109 variables, and 499 constraints, problems are : Problem set: 0 solved, 1 unsolved in 529 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 352/371 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/378 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 604/982 variables, 337/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/982 variables, 74/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/982 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 62/1044 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1044 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 65/1109 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1109 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1109 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1109/1109 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 515 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1065ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4262 ms.
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 49 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 48 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2025-06-01 12:51:18] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-01 12:51:18] [INFO ] Invariant cache hit.
[2025-06-01 12:51:19] [INFO ] Implicit Places using invariants in 581 ms returned []
[2025-06-01 12:51:19] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-01 12:51:19] [INFO ] Invariant cache hit.
[2025-06-01 12:51:19] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-01 12:51:22] [INFO ] Implicit Places using invariants and state equation in 2931 ms returned []
Implicit Place search using SMT with State Equation took 3536 ms to find 0 implicit places.
[2025-06-01 12:51:22] [INFO ] Redundant transitions in 35 ms returned []
Running 1216 sub problems to find dead transitions.
[2025-06-01 12:51:22] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-01 12:51:22] [INFO ] Invariant cache hit.
[2025-06-01 12:51:22] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3.74714e+10 after 5.80652e+17
Detected timeout of ITS tools.
[2025-06-01 12:51:52] [INFO ] Flatten gal took : 48 ms
[2025-06-01 12:51:52] [INFO ] Applying decomposition
[2025-06-01 12:51:52] [INFO ] Flatten gal took : 92 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/graph7365779430569375780.txt' '-o' '/tmp/graph7365779430569375780.bin' '-w' '/tmp/graph7365779430569375780.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7365779430569375780.bin' '-l' '-1' '-v' '-w' '/tmp/graph7365779430569375780.weights' '-q' '0' '-e' '0.001'
[2025-06-01 12:51:52] [INFO ] Decomposing Gal with order
[2025-06-01 12:51:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 12:51:52] [INFO ] Removed a total of 2085 redundant transitions.
[2025-06-01 12:51:52] [INFO ] Flatten gal took : 127 ms
[2025-06-01 12:51:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 883 labels/synchronizations in 71 ms.
[2025-06-01 12:51:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15943069332093799066.gal : 9 ms
[2025-06-01 12:51:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3011402942153010666.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/ReachabilityCardinality15943069332093799066.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3011402942153010666.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/ReachabilityCardinality3011402942153010666.prop.
[2025-06-01 12:51:53] [INFO ] Deduced a trap composed of 131 places in 164 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 421/1109 variables, and 4 constraints, problems are : Problem set: 0 solved, 1216 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/421 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 1216/1216 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 3 (OVERLAPS) 688/1109 variables, 421/425 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1109 variables, 75/500 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1109/1109 variables, and 1716 constraints, problems are : Problem set: 0 solved, 1216 unsolved in 30497 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1216/1216 constraints, Known Traps: 1/1 constraints]
After SMT, in 68189ms problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 68211ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71847 ms. Remains : 421/421 places, 1218/1218 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 530 transitions
Reduce isomorphic transitions removed 530 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 540 rules applied. Total rules applied 540 place count 421 transition count 678
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 550 place count 411 transition count 678
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 550 place count 411 transition count 605
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 696 place count 338 transition count 605
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 950 place count 211 transition count 478
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1014 place count 147 transition count 350
Iterating global reduction 2 with 64 rules applied. Total rules applied 1078 place count 147 transition count 350
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1079 place count 147 transition count 349
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1142 place count 84 transition count 223
Iterating global reduction 3 with 63 rules applied. Total rules applied 1205 place count 84 transition count 223
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1268 place count 21 transition count 97
Iterating global reduction 3 with 63 rules applied. Total rules applied 1331 place count 21 transition count 97
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1394 place count 21 transition count 34
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1394 place count 21 transition count 33
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1396 place count 20 transition count 33
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 4 with 2 rules applied. Total rules applied 1398 place count 19 transition count 32
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1399 place count 19 transition count 31
Applied a total of 1399 rules in 44 ms. Remains 19 /421 variables (removed 402) and now considering 31/1218 (removed 1187) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 31 rows 19 cols
[2025-06-01 12:52:30] [INFO ] Computed 3 invariants in 1 ms
[2025-06-01 12:52:30] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 12:52:30] [INFO ] After 21ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-06-01 12:52:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-01 12:52:30] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 12:52:30] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 12:52:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 12:52:30] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 12:52:30] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 12:52:30] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 12:52:30] [INFO ] After 53ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-01 12:52:30] [INFO ] Flatten gal took : 1 ms
[2025-06-01 12:52:30] [INFO ] Flatten gal took : 1 ms
[2025-06-01 12:52:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5359328396386495294.gal : 1 ms
[2025-06-01 12:52:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17223020767625234292.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/ReachabilityCardinality5359328396386495294.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17223020767625234292.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/ReachabilityCardinality17223020767625234292.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
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 315
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :315 after 35107
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :35107 after 6.2298e+06
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :6.2298e+06 after 1.79901e+07
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.79901e+07 after 4.1465e+07
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :4.1465e+07 after 8.8369e+07
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :8.8369e+07 after 1.82131e+08
Detected timeout of ITS tools.
Detected timeout of ITS tools.
[2025-06-01 12:52:45] [INFO ] Flatten gal took : 1 ms
[2025-06-01 12:52:45] [INFO ] Applying decomposition
[2025-06-01 12:52:45] [INFO ] Flatten gal took : 1 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/graph16803598731660414040.txt' '-o' '/tmp/graph16803598731660414040.bin' '-w' '/tmp/graph16803598731660414040.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16803598731660414040.bin' '-l' '-1' '-v' '-w' '/tmp/graph16803598731660414040.weights' '-q' '0' '-e' '0.001'
[2025-06-01 12:52:45] [INFO ] Decomposing Gal with order
[2025-06-01 12:52:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 12:52:45] [INFO ] Removed a total of 30 redundant transitions.
[2025-06-01 12:52:45] [INFO ] Flatten gal took : 3 ms
[2025-06-01 12:52:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 0 ms.
[2025-06-01 12:52:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2356626555066809614.gal : 1 ms
[2025-06-01 12:52:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16134428361404180579.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/ReachabilityCardinality2356626555066809614.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16134428361404180579.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/ReachabilityCardinality16134428361404180579.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
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 315
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30245 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[463] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c064-UpperBounds-11 in 289660 ms.
Starting property specific reduction for FunctionPointer-PT-c064-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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2025-06-01 12:53:00] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
// Phase 1: matrix 765 rows 465 cols
[2025-06-01 12:53:00] [INFO ] Computed 2 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 32 ms. (303 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2025-06-01 12:53:00] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-01 12:53:00] [INFO ] Invariant cache hit.
[2025-06-01 12:53:00] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-01 12:53:00] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 12:53:01] [INFO ] [Real]Absence check using state equation in 289 ms returned sat
[2025-06-01 12:53:01] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-01 12:53:01] [INFO ] [Real]Added 94 Read/Feed constraints in 43 ms returned sat
[2025-06-01 12:53:01] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:53:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-06-01 12:53:01] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:53:02] [INFO ] [Nat]Absence check using state equation in 397 ms returned sat
[2025-06-01 12:53:02] [INFO ] [Nat]Added 94 Read/Feed constraints in 102 ms returned sat
[2025-06-01 12:53:02] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 151 ms.
[2025-06-01 12:53:02] [INFO ] Added : 2 causal constraints over 1 iterations in 325 ms. Result :sat
Minimization took 684 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 465 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 1326/1326 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 459 transition count 1314
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 459 transition count 1314
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 20 place count 459 transition count 1306
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 27 place count 452 transition count 1288
Iterating global reduction 1 with 7 rules applied. Total rules applied 34 place count 452 transition count 1288
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 38 place count 452 transition count 1284
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 42 place count 448 transition count 1276
Iterating global reduction 2 with 4 rules applied. Total rules applied 46 place count 448 transition count 1276
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 51 place count 443 transition count 1262
Iterating global reduction 2 with 5 rules applied. Total rules applied 56 place count 443 transition count 1262
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 61 place count 438 transition count 1250
Iterating global reduction 2 with 5 rules applied. Total rules applied 66 place count 438 transition count 1250
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 71 place count 433 transition count 1240
Iterating global reduction 2 with 5 rules applied. Total rules applied 76 place count 433 transition count 1240
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 81 place count 428 transition count 1230
Iterating global reduction 2 with 5 rules applied. Total rules applied 86 place count 428 transition count 1230
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 91 place count 423 transition count 1220
Iterating global reduction 2 with 5 rules applied. Total rules applied 96 place count 423 transition count 1220
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 99 place count 420 transition count 1214
Iterating global reduction 2 with 3 rules applied. Total rules applied 102 place count 420 transition count 1214
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 105 place count 417 transition count 1208
Iterating global reduction 2 with 3 rules applied. Total rules applied 108 place count 417 transition count 1208
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 109 place count 416 transition count 1206
Iterating global reduction 2 with 1 rules applied. Total rules applied 110 place count 416 transition count 1206
Applied a total of 110 rules in 279 ms. Remains 416 /465 variables (removed 49) and now considering 1206/1326 (removed 120) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 280 ms. Remains : 416/465 places, 1206/1326 transitions.
[2025-06-01 12:53:03] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
Found an invariant !
This invariant on transitions {220=1, 304=1, 502=1, 676=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {208=1, 292=1, 490=1, 676=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2025-06-01 12:53:04] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
// Phase 1: matrix 681 rows 416 cols
[2025-06-01 12:53:04] [INFO ] Computed 2 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 3219 ms. (310 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1597 ms. (625 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2025-06-01 12:53:08] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2025-06-01 12:53:08] [INFO ] Invariant cache hit.
[2025-06-01 12:53:09] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-01 12:53:09] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:53:09] [INFO ] [Real]Absence check using state equation in 278 ms returned sat
[2025-06-01 12:53:09] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-01 12:53:09] [INFO ] [Real]Added 75 Read/Feed constraints in 57 ms returned sat
[2025-06-01 12:53:09] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:53:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-06-01 12:53:09] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:53:09] [INFO ] [Nat]Absence check using state equation in 370 ms returned sat
[2025-06-01 12:53:10] [INFO ] [Nat]Added 75 Read/Feed constraints in 162 ms returned sat
[2025-06-01 12:53:10] [INFO ] Computed and/alt/rep : 334/1253/332 causal constraints (skipped 347 transitions) in 150 ms.
[2025-06-01 12:53:10] [INFO ] Added : 5 causal constraints over 2 iterations in 378 ms. Result :sat
Minimization took 741 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[64] Max Struct:[+inf]
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1206/1206 transitions.
Applied a total of 0 rules in 47 ms. Remains 416 /416 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 416/416 places, 1206/1206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1206/1206 transitions.
Applied a total of 0 rules in 56 ms. Remains 416 /416 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2025-06-01 12:53:11] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2025-06-01 12:53:11] [INFO ] Invariant cache hit.
[2025-06-01 12:53:12] [INFO ] Implicit Places using invariants in 531 ms returned []
[2025-06-01 12:53:12] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2025-06-01 12:53:12] [INFO ] Invariant cache hit.
[2025-06-01 12:53:12] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-01 12:53:14] [INFO ] Implicit Places using invariants and state equation in 2233 ms returned []
Implicit Place search using SMT with State Equation took 2775 ms to find 0 implicit places.
[2025-06-01 12:53:14] [INFO ] Redundant transitions in 34 ms returned []
Running 1204 sub problems to find dead transitions.
[2025-06-01 12:53:14] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2025-06-01 12:53:14] [INFO ] Invariant cache hit.
[2025-06-01 12:53:14] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 416/1097 variables, and 2 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/416 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 1204/1204 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 3 (OVERLAPS) 681/1097 variables, 416/418 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1097 variables, 75/493 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1097/1097 variables, and 1697 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 31281 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 416/416 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1204/1204 constraints, Known Traps: 0/0 constraints]
After SMT, in 67444ms problems are : Problem set: 0 solved, 1204 unsolved
Search for dead transitions found 0 dead transitions in 67466ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70341 ms. Remains : 416/416 places, 1206/1206 transitions.
[2025-06-01 12:54:22] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
Found an invariant !
This invariant on transitions {220=1, 304=1, 502=1, 676=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {208=1, 292=1, 490=1, 676=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 1) seen :[5]
Current structural bounds on expressions (after cover walk) : Max Seen:[64] Max Struct:[+inf]
[2025-06-01 12:54:22] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2025-06-01 12:54:22] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[64] Max Struct:[+inf]
RANDOM walk for 1000022 steps (2 resets) in 2505 ms. (399 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1859 ms. (537 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[64] Max Struct:[+inf]
[2025-06-01 12:54:27] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2025-06-01 12:54:27] [INFO ] Invariant cache hit.
[2025-06-01 12:54:27] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2025-06-01 12:54:27] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:54:27] [INFO ] [Real]Absence check using state equation in 326 ms returned sat
[2025-06-01 12:54:27] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-01 12:54:27] [INFO ] [Real]Added 75 Read/Feed constraints in 112 ms returned sat
[2025-06-01 12:54:27] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:54:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-06-01 12:54:27] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:54:28] [INFO ] [Nat]Absence check using state equation in 370 ms returned sat
[2025-06-01 12:54:28] [INFO ] [Nat]Added 75 Read/Feed constraints in 147 ms returned sat
[2025-06-01 12:54:28] [INFO ] Deduced a trap composed of 135 places in 538 ms of which 7 ms to minimize.
[2025-06-01 12:54:29] [INFO ] Deduced a trap composed of 131 places in 435 ms of which 6 ms to minimize.
[2025-06-01 12:54:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1113 ms
[2025-06-01 12:54:29] [INFO ] Computed and/alt/rep : 334/1253/332 causal constraints (skipped 347 transitions) in 130 ms.
[2025-06-01 12:54:29] [INFO ] Added : 4 causal constraints over 1 iterations in 289 ms. Result :sat
Minimization took 807 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[64] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[64] Max Struct:[+inf]
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1206/1206 transitions.
Applied a total of 0 rules in 80 ms. Remains 416 /416 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 416/416 places, 1206/1206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1206/1206 transitions.
Applied a total of 0 rules in 80 ms. Remains 416 /416 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2025-06-01 12:54:30] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2025-06-01 12:54:30] [INFO ] Invariant cache hit.
[2025-06-01 12:54:31] [INFO ] Implicit Places using invariants in 846 ms returned []
[2025-06-01 12:54:31] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2025-06-01 12:54:31] [INFO ] Invariant cache hit.
[2025-06-01 12:54:32] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-01 12:54:34] [INFO ] Implicit Places using invariants and state equation in 2812 ms returned []
Implicit Place search using SMT with State Equation took 3663 ms to find 0 implicit places.
[2025-06-01 12:54:34] [INFO ] Redundant transitions in 32 ms returned []
Running 1204 sub problems to find dead transitions.
[2025-06-01 12:54:34] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2025-06-01 12:54:34] [INFO ] Invariant cache hit.
[2025-06-01 12:54:34] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 416/1097 variables, and 2 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/416 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 1204/1204 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 3 (OVERLAPS) 681/1097 variables, 416/418 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1097 variables, 75/493 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1097/1097 variables, and 1697 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 30084 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 416/416 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1204/1204 constraints, Known Traps: 0/0 constraints]
After SMT, in 65942ms problems are : Problem set: 0 solved, 1204 unsolved
Search for dead transitions found 0 dead transitions in 65962ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69747 ms. Remains : 416/416 places, 1206/1206 transitions.
[2025-06-01 12:55:40] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
Found an invariant !
This invariant on transitions {220=1, 304=1, 502=1, 676=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {208=1, 292=1, 490=1, 676=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[64] Max Struct:[+inf]
RANDOM walk for 40004 steps (8 resets) in 235 ms. (169 steps per ms) remains 1/1 properties
[2025-06-01 12:55:41] [INFO ] Flatten gal took : 76 ms
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 1/1 properties
[2025-06-01 12:55:41] [INFO ] Flatten gal took : 60 ms
[2025-06-01 12:55:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11377888746447374496.gal : 8 ms
[2025-06-01 12:55:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14944711010346218402.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/ReachabilityCardinality11377888746447374496.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14944711010346218402.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/ReachabilityCardinality14944711010346218402.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :31 after 1995
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1995 after 1.24464e+06
Interrupted probabilistic random walk after 329115 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :0 out of 1
Probabilistic random walk after 329115 steps, saw 201820 distinct states, run finished after 3001 ms. (steps per millisecond=109 ) properties seen :0
[2025-06-01 12:55:44] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2025-06-01 12:55:44] [INFO ] Invariant cache hit.
[2025-06-01 12:55:44] [INFO ] State equation strengthened by 75 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) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 208/212 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 740/952 variables, 337/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/952 variables, 75/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/952 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 62/1014 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1014 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1015 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1015 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1015 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 68/1083 variables, 66/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1083 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/1091 variables, 4/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1091 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/1097 variables, 4/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1097 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1097 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1097/1097 variables, and 493 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 416/416 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 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) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 208/212 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 740/952 variables, 337/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/952 variables, 75/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/952 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/952 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 62/1014 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1014 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/1015 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1015 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 12:55:46] [INFO ] Deduced a trap composed of 135 places in 398 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1015 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1015 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 68/1083 variables, 66/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1083 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 8/1091 variables, 4/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1091 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/1097 variables, 4/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1097 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1097 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1097/1097 variables, and 495 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1184 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 416/416 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2227ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1206/1206 transitions.
Applied a total of 0 rules in 81 ms. Remains 416 /416 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 416/416 places, 1206/1206 transitions.
RANDOM walk for 40000 steps (8 resets) in 242 ms. (164 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 367050 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :0 out of 1
Probabilistic random walk after 367050 steps, saw 225081 distinct states, run finished after 3005 ms. (steps per millisecond=122 ) properties seen :0
[2025-06-01 12:55:49] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2025-06-01 12:55:49] [INFO ] Invariant cache hit.
[2025-06-01 12:55:49] [INFO ] State equation strengthened by 75 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) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 208/212 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 740/952 variables, 337/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/952 variables, 75/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/952 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 62/1014 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1014 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1015 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1015 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1015 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1.24464e+06 after 3.74714e+10
At refinement iteration 13 (OVERLAPS) 68/1083 variables, 66/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1083 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/1091 variables, 4/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1091 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/1097 variables, 4/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1097 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1097 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1097/1097 variables, and 493 constraints, problems are : Problem set: 0 solved, 1 unsolved in 452 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 416/416 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 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) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 208/212 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 740/952 variables, 337/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/952 variables, 75/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/952 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/952 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 62/1014 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1014 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/1015 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1015 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 12:55:50] [INFO ] Deduced a trap composed of 135 places in 283 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1015 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1015 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 68/1083 variables, 66/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1083 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 8/1091 variables, 4/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1091 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/1097 variables, 4/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1097 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1097 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1097/1097 variables, and 495 constraints, problems are : Problem set: 0 solved, 1 unsolved in 812 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 416/416 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1300ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1206/1206 transitions.
Applied a total of 0 rules in 65 ms. Remains 416 /416 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 416/416 places, 1206/1206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1206/1206 transitions.
Applied a total of 0 rules in 54 ms. Remains 416 /416 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2025-06-01 12:55:50] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2025-06-01 12:55:50] [INFO ] Invariant cache hit.
[2025-06-01 12:55:51] [INFO ] Implicit Places using invariants in 596 ms returned []
[2025-06-01 12:55:51] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2025-06-01 12:55:51] [INFO ] Invariant cache hit.
[2025-06-01 12:55:51] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-01 12:55:53] [INFO ] Implicit Places using invariants and state equation in 2326 ms returned []
Implicit Place search using SMT with State Equation took 2934 ms to find 0 implicit places.
[2025-06-01 12:55:53] [INFO ] Redundant transitions in 22 ms returned []
Running 1204 sub problems to find dead transitions.
[2025-06-01 12:55:53] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2025-06-01 12:55:53] [INFO ] Invariant cache hit.
[2025-06-01 12:55:53] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3.74714e+10 after 5.80652e+17
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 3 (OVERLAPS) 681/1097 variables, 416/418 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
SMT process timed out in 36262ms, After SMT, problems are : Problem set: 0 solved, 1204 unsolved
Search for dead transitions found 0 dead transitions in 36275ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39308 ms. Remains : 416/416 places, 1206/1206 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 525 transitions
Reduce isomorphic transitions removed 525 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 536 rules applied. Total rules applied 536 place count 416 transition count 670
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 548 place count 405 transition count 669
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 549 place count 404 transition count 669
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 68 Pre rules applied. Total rules applied 549 place count 404 transition count 601
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 3 with 136 rules applied. Total rules applied 685 place count 336 transition count 601
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 939 place count 209 transition count 474
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 1003 place count 145 transition count 346
Iterating global reduction 3 with 64 rules applied. Total rules applied 1067 place count 145 transition count 346
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1068 place count 145 transition count 345
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1068 place count 145 transition count 344
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1070 place count 144 transition count 344
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1133 place count 81 transition count 218
Iterating global reduction 4 with 63 rules applied. Total rules applied 1196 place count 81 transition count 218
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1259 place count 18 transition count 92
Iterating global reduction 4 with 63 rules applied. Total rules applied 1322 place count 18 transition count 92
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1385 place count 18 transition count 29
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1385 place count 18 transition count 28
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1387 place count 17 transition count 28
Applied a total of 1387 rules in 39 ms. Remains 17 /416 variables (removed 399) and now considering 28/1206 (removed 1178) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 28 rows 17 cols
[2025-06-01 12:56:30] [INFO ] Computed 2 invariants in 0 ms
[2025-06-01 12:56:30] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-01 12:56:30] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:56:30] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 12:56:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-01 12:56:30] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 12:56:30] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 12:56:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-01 12:56:30] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 12:56:30] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 12:56:30] [INFO ] After 45ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-01 12:56:30] [INFO ] Flatten gal took : 2 ms
[2025-06-01 12:56:30] [INFO ] Flatten gal took : 1 ms
[2025-06-01 12:56:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10355366232744615840.gal : 0 ms
[2025-06-01 12:56:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15648327285253369002.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/ReachabilityCardinality10355366232744615840.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15648327285253369002.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/ReachabilityCardinality15648327285253369002.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
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 315
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :315 after 12482
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :12482 after 287427
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :287427 after 4.65965e+07
Detected timeout of ITS tools.
[2025-06-01 12:56:31] [INFO ] Flatten gal took : 35 ms
[2025-06-01 12:56:31] [INFO ] Applying decomposition
[2025-06-01 12:56:31] [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/graph847233527022595412.txt' '-o' '/tmp/graph847233527022595412.bin' '-w' '/tmp/graph847233527022595412.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph847233527022595412.bin' '-l' '-1' '-v' '-w' '/tmp/graph847233527022595412.weights' '-q' '0' '-e' '0.001'
[2025-06-01 12:56:31] [INFO ] Decomposing Gal with order
[2025-06-01 12:56:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 12:56:31] [INFO ] Removed a total of 2059 redundant transitions.
[2025-06-01 12:56:31] [INFO ] Flatten gal took : 68 ms
[2025-06-01 12:56:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 945 labels/synchronizations in 28 ms.
[2025-06-01 12:56:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7080011829159010036.gal : 8 ms
[2025-06-01 12:56:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17308938286410558721.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/ReachabilityCardinality7080011829159010036.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17308938286410558721.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/ReachabilityCardinality17308938286410558721.prop.
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :4.65965e+07 after 1.40496e+08
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.40496e+08 after 3.28112e+08
Detected timeout of ITS tools.
[2025-06-01 12:56:45] [INFO ] Flatten gal took : 2 ms
[2025-06-01 12:56:45] [INFO ] Applying decomposition
[2025-06-01 12:56:45] [INFO ] Flatten gal took : 1 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/graph16656673371700970068.txt' '-o' '/tmp/graph16656673371700970068.bin' '-w' '/tmp/graph16656673371700970068.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16656673371700970068.bin' '-l' '-1' '-v' '-w' '/tmp/graph16656673371700970068.weights' '-q' '0' '-e' '0.001'
[2025-06-01 12:56:45] [INFO ] Decomposing Gal with order
[2025-06-01 12:56:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 12:56:45] [INFO ] Removed a total of 21 redundant transitions.
[2025-06-01 12:56:45] [INFO ] Flatten gal took : 3 ms
[2025-06-01 12:56:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-01 12:56:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4228075313745708690.gal : 0 ms
[2025-06-01 12:56:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6725406962192342644.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/ReachabilityCardinality4228075313745708690.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6725406962192342644.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/ReachabilityCardinality6725406962192342644.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
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 315
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :315 after 16388
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :16388 after 470406
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30202 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:[64] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c064-UpperBounds-12 in 239549 ms.
Starting property specific reduction for FunctionPointer-PT-c064-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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2025-06-01 12:57:00] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
// Phase 1: matrix 765 rows 465 cols
[2025-06-01 12:57:00] [INFO ] Computed 2 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 49 ms. (200 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2025-06-01 12:57:00] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-01 12:57:00] [INFO ] Invariant cache hit.
[2025-06-01 12:57:00] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-06-01 12:57:00] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 12:57:00] [INFO ] [Real]Absence check using state equation in 310 ms returned sat
[2025-06-01 12:57:00] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-01 12:57:00] [INFO ] [Real]Added 94 Read/Feed constraints in 35 ms returned sat
[2025-06-01 12:57:01] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:57:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-06-01 12:57:01] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 5 ms returned sat
[2025-06-01 12:57:01] [INFO ] [Nat]Absence check using state equation in 357 ms returned sat
[2025-06-01 12:57:01] [INFO ] [Nat]Added 94 Read/Feed constraints in 54 ms returned sat
[2025-06-01 12:57:01] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 104 ms.
[2025-06-01 12:57:01] [INFO ] Added : 1 causal constraints over 1 iterations in 241 ms. Result :sat
Minimization took 638 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 465 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 1326/1326 transitions.
Graph (complete) has 2259 edges and 465 vertex of which 462 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 462 transition count 1320
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 12 place count 457 transition count 1310
Iterating global reduction 1 with 5 rules applied. Total rules applied 17 place count 457 transition count 1310
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 23 place count 457 transition count 1304
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 29 place count 451 transition count 1288
Iterating global reduction 2 with 6 rules applied. Total rules applied 35 place count 451 transition count 1288
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 39 place count 451 transition count 1284
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 43 place count 447 transition count 1276
Iterating global reduction 3 with 4 rules applied. Total rules applied 47 place count 447 transition count 1276
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 52 place count 442 transition count 1262
Iterating global reduction 3 with 5 rules applied. Total rules applied 57 place count 442 transition count 1262
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 62 place count 437 transition count 1250
Iterating global reduction 3 with 5 rules applied. Total rules applied 67 place count 437 transition count 1250
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 72 place count 432 transition count 1240
Iterating global reduction 3 with 5 rules applied. Total rules applied 77 place count 432 transition count 1240
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 82 place count 427 transition count 1230
Iterating global reduction 3 with 5 rules applied. Total rules applied 87 place count 427 transition count 1230
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 92 place count 422 transition count 1220
Iterating global reduction 3 with 5 rules applied. Total rules applied 97 place count 422 transition count 1220
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 100 place count 419 transition count 1214
Iterating global reduction 3 with 3 rules applied. Total rules applied 103 place count 419 transition count 1214
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 106 place count 416 transition count 1208
Iterating global reduction 3 with 3 rules applied. Total rules applied 109 place count 416 transition count 1208
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 110 place count 415 transition count 1206
Iterating global reduction 3 with 1 rules applied. Total rules applied 111 place count 415 transition count 1206
Applied a total of 111 rules in 290 ms. Remains 415 /465 variables (removed 50) and now considering 1206/1326 (removed 120) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 290 ms. Remains : 415/465 places, 1206/1326 transitions.
[2025-06-01 12:57:02] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
Found an invariant !
This invariant on transitions {228=1, 256=1, 259=1, 315=1, 512=1, 675=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 339=1, 664=1, 678=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 1) seen :[4]
Current structural bounds on expressions (after cover walk) : Max Seen:[4] Max Struct:[+inf]
[2025-06-01 12:57:03] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
// Phase 1: matrix 680 rows 415 cols
[2025-06-01 12:57:03] [INFO ] Computed 3 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[+inf]
RANDOM walk for 1000001 steps (2 resets) in 3063 ms. (326 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1479 ms. (675 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[596] Max Struct:[+inf]
[2025-06-01 12:57:07] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 12:57:07] [INFO ] Invariant cache hit.
[2025-06-01 12:57:08] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-01 12:57:08] [INFO ] [Real]Absence check using state equation in 364 ms returned sat
[2025-06-01 12:57:08] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-01 12:57:08] [INFO ] [Real]Added 74 Read/Feed constraints in 62 ms returned sat
[2025-06-01 12:57:08] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:57:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2025-06-01 12:57:09] [INFO ] [Nat]Absence check using state equation in 358 ms returned sat
[2025-06-01 12:57:09] [INFO ] [Nat]Added 74 Read/Feed constraints in 57 ms returned sat
[2025-06-01 12:57:09] [INFO ] Deduced a trap composed of 72 places in 568 ms of which 6 ms to minimize.
[2025-06-01 12:57:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 647 ms
[2025-06-01 12:57:09] [INFO ] Computed and/alt/rep : 333/1252/331 causal constraints (skipped 347 transitions) in 145 ms.
[2025-06-01 12:57:10] [INFO ] Deduced a trap composed of 209 places in 528 ms of which 7 ms to minimize.
[2025-06-01 12:57:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 640 ms
[2025-06-01 12:57:10] [INFO ] Added : 7 causal constraints over 4 iterations in 1189 ms. Result :sat
Minimization took 507 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[596] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[596] Max Struct:[+inf]
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 60 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 415/415 places, 1206/1206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 57 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2025-06-01 12:57:15] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 12:57:15] [INFO ] Invariant cache hit.
[2025-06-01 12:57:16] [INFO ] Implicit Places using invariants in 773 ms returned []
[2025-06-01 12:57:16] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 12:57:16] [INFO ] Invariant cache hit.
[2025-06-01 12:57:16] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-01 12:57:18] [INFO ] Implicit Places using invariants and state equation in 2663 ms returned []
Implicit Place search using SMT with State Equation took 3448 ms to find 0 implicit places.
[2025-06-01 12:57:18] [INFO ] Redundant transitions in 34 ms returned []
Running 1204 sub problems to find dead transitions.
[2025-06-01 12:57:18] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 12:57:18] [INFO ] Invariant cache hit.
[2025-06-01 12:57:18] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/415 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 415/1095 variables, and 3 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/415 constraints, ReadFeed: 0/74 constraints, PredecessorRefiner: 1204/1204 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/415 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
[2025-06-01 12:58:07] [INFO ] Deduced a trap composed of 131 places in 220 ms of which 4 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/415 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 415/1095 variables, and 4 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/415 constraints, ReadFeed: 0/74 constraints, PredecessorRefiner: 0/1204 constraints, Known Traps: 1/1 constraints]
After SMT, in 66926ms problems are : Problem set: 0 solved, 1204 unsolved
Search for dead transitions found 0 dead transitions in 66948ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70498 ms. Remains : 415/415 places, 1206/1206 transitions.
[2025-06-01 12:58:25] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
Found an invariant !
This invariant on transitions {228=1, 256=1, 259=1, 315=1, 512=1, 675=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 339=1, 664=1, 678=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[596] Max Struct:[+inf]
[2025-06-01 12:58:26] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 12:58:26] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[596] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 3167 ms. (315 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1413 ms. (707 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[674] Max Struct:[+inf]
[2025-06-01 12:58:31] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 12:58:31] [INFO ] Invariant cache hit.
[2025-06-01 12:58:31] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-01 12:58:31] [INFO ] [Real]Absence check using state equation in 240 ms returned sat
[2025-06-01 12:58:31] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-01 12:58:31] [INFO ] [Real]Added 74 Read/Feed constraints in 33 ms returned sat
[2025-06-01 12:58:31] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:58:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-01 12:58:32] [INFO ] [Nat]Absence check using state equation in 256 ms returned sat
[2025-06-01 12:58:32] [INFO ] [Nat]Added 74 Read/Feed constraints in 37 ms returned sat
[2025-06-01 12:58:32] [INFO ] Deduced a trap composed of 72 places in 482 ms of which 6 ms to minimize.
[2025-06-01 12:58:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 562 ms
[2025-06-01 12:58:32] [INFO ] Computed and/alt/rep : 333/1252/331 causal constraints (skipped 347 transitions) in 127 ms.
[2025-06-01 12:58:33] [INFO ] Deduced a trap composed of 209 places in 558 ms of which 7 ms to minimize.
[2025-06-01 12:58:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 658 ms
[2025-06-01 12:58:33] [INFO ] Added : 7 causal constraints over 4 iterations in 1187 ms. Result :sat
Minimization took 520 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[674] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[674] Max Struct:[+inf]
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 48 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 415/415 places, 1206/1206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 48 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2025-06-01 12:58:39] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 12:58:39] [INFO ] Invariant cache hit.
[2025-06-01 12:58:40] [INFO ] Implicit Places using invariants in 892 ms returned []
[2025-06-01 12:58:40] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 12:58:40] [INFO ] Invariant cache hit.
[2025-06-01 12:58:40] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-01 12:58:42] [INFO ] Implicit Places using invariants and state equation in 2845 ms returned []
Implicit Place search using SMT with State Equation took 3745 ms to find 0 implicit places.
[2025-06-01 12:58:42] [INFO ] Redundant transitions in 35 ms returned []
Running 1204 sub problems to find dead transitions.
[2025-06-01 12:58:42] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 12:58:42] [INFO ] Invariant cache hit.
[2025-06-01 12:58:42] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/415 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 415/1095 variables, and 3 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/415 constraints, ReadFeed: 0/74 constraints, PredecessorRefiner: 1204/1204 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/415 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
[2025-06-01 12:59:33] [INFO ] Deduced a trap composed of 131 places in 227 ms of which 4 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/415 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 415/1095 variables, and 4 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/415 constraints, ReadFeed: 0/74 constraints, PredecessorRefiner: 0/1204 constraints, Known Traps: 1/1 constraints]
After SMT, in 65805ms problems are : Problem set: 0 solved, 1204 unsolved
Search for dead transitions found 0 dead transitions in 65827ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69667 ms. Remains : 415/415 places, 1206/1206 transitions.
[2025-06-01 12:59:48] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
Found an invariant !
This invariant on transitions {228=1, 256=1, 259=1, 315=1, 512=1, 675=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 339=1, 664=1, 678=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[674] Max Struct:[+inf]
[2025-06-01 12:59:49] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 12:59:49] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[674] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 3360 ms. (297 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1516 ms. (659 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[741] Max Struct:[+inf]
[2025-06-01 12:59:54] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 12:59:54] [INFO ] Invariant cache hit.
[2025-06-01 12:59:54] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-01 12:59:54] [INFO ] [Real]Absence check using state equation in 249 ms returned sat
[2025-06-01 12:59:54] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-01 12:59:54] [INFO ] [Real]Added 74 Read/Feed constraints in 37 ms returned sat
[2025-06-01 12:59:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 12:59:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-01 12:59:55] [INFO ] [Nat]Absence check using state equation in 259 ms returned sat
[2025-06-01 12:59:55] [INFO ] [Nat]Added 74 Read/Feed constraints in 38 ms returned sat
[2025-06-01 12:59:55] [INFO ] Deduced a trap composed of 72 places in 403 ms of which 5 ms to minimize.
[2025-06-01 12:59:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 465 ms
[2025-06-01 12:59:55] [INFO ] Computed and/alt/rep : 333/1252/331 causal constraints (skipped 347 transitions) in 92 ms.
[2025-06-01 12:59:56] [INFO ] Deduced a trap composed of 209 places in 370 ms of which 4 ms to minimize.
[2025-06-01 12:59:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 444 ms
[2025-06-01 12:59:56] [INFO ] Added : 7 causal constraints over 4 iterations in 896 ms. Result :sat
Minimization took 360 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[741] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[741] Max Struct:[+inf]
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 82 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 415/415 places, 1206/1206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 79 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2025-06-01 13:00:01] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 13:00:01] [INFO ] Invariant cache hit.
[2025-06-01 13:00:02] [INFO ] Implicit Places using invariants in 714 ms returned []
[2025-06-01 13:00:02] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 13:00:02] [INFO ] Invariant cache hit.
[2025-06-01 13:00:03] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-01 13:00:05] [INFO ] Implicit Places using invariants and state equation in 2496 ms returned []
Implicit Place search using SMT with State Equation took 3212 ms to find 0 implicit places.
[2025-06-01 13:00:05] [INFO ] Redundant transitions in 34 ms returned []
Running 1204 sub problems to find dead transitions.
[2025-06-01 13:00:05] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 13:00:05] [INFO ] Invariant cache hit.
[2025-06-01 13:00:05] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/415 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
[2025-06-01 13:00:36] [INFO ] Deduced a trap composed of 131 places in 250 ms of which 4 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/415 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 415/1095 variables, and 4 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/415 constraints, ReadFeed: 0/74 constraints, PredecessorRefiner: 1204/1204 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/415 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/415 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/415 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 3 (OVERLAPS) 680/1095 variables, 415/419 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1095 variables, 74/493 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1095 variables, 1204/1697 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1095/1095 variables, and 1697 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 415/415 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1204/1204 constraints, Known Traps: 1/1 constraints]
After SMT, in 65856ms problems are : Problem set: 0 solved, 1204 unsolved
Search for dead transitions found 0 dead transitions in 65879ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69214 ms. Remains : 415/415 places, 1206/1206 transitions.
[2025-06-01 13:01:10] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
Found an invariant !
This invariant on transitions {228=1, 256=1, 259=1, 315=1, 512=1, 675=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 339=1, 664=1, 678=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 1) seen :[4]
Current structural bounds on expressions (after cover walk) : Max Seen:[741] Max Struct:[+inf]
[2025-06-01 13:01:11] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 13:01:11] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[741] Max Struct:[+inf]
RANDOM walk for 1000004 steps (2 resets) in 3043 ms. (328 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1432 ms. (697 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[741] Max Struct:[+inf]
[2025-06-01 13:01:16] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 13:01:16] [INFO ] Invariant cache hit.
[2025-06-01 13:01:16] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-01 13:01:16] [INFO ] [Real]Absence check using state equation in 226 ms returned sat
[2025-06-01 13:01:16] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-01 13:01:16] [INFO ] [Real]Added 74 Read/Feed constraints in 36 ms returned sat
[2025-06-01 13:01:16] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:01:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2025-06-01 13:01:17] [INFO ] [Nat]Absence check using state equation in 362 ms returned sat
[2025-06-01 13:01:17] [INFO ] [Nat]Added 74 Read/Feed constraints in 66 ms returned sat
[2025-06-01 13:01:17] [INFO ] Deduced a trap composed of 72 places in 572 ms of which 7 ms to minimize.
[2025-06-01 13:01:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 657 ms
[2025-06-01 13:01:18] [INFO ] Computed and/alt/rep : 333/1252/331 causal constraints (skipped 347 transitions) in 155 ms.
[2025-06-01 13:01:18] [INFO ] Deduced a trap composed of 209 places in 530 ms of which 6 ms to minimize.
[2025-06-01 13:01:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 631 ms
[2025-06-01 13:01:19] [INFO ] Added : 7 causal constraints over 4 iterations in 1188 ms. Result :sat
Minimization took 424 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[741] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[741] Max Struct:[+inf]
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 55 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 415/415 places, 1206/1206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 46 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2025-06-01 13:01:24] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 13:01:24] [INFO ] Invariant cache hit.
[2025-06-01 13:01:25] [INFO ] Implicit Places using invariants in 622 ms returned []
[2025-06-01 13:01:25] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 13:01:25] [INFO ] Invariant cache hit.
[2025-06-01 13:01:26] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-01 13:01:27] [INFO ] Implicit Places using invariants and state equation in 2115 ms returned []
Implicit Place search using SMT with State Equation took 2749 ms to find 0 implicit places.
[2025-06-01 13:01:27] [INFO ] Redundant transitions in 21 ms returned []
Running 1204 sub problems to find dead transitions.
[2025-06-01 13:01:27] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 13:01:27] [INFO ] Invariant cache hit.
[2025-06-01 13:01:27] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/415 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
[2025-06-01 13:02:03] [INFO ] Deduced a trap composed of 131 places in 258 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 415/1095 variables, and 4 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/415 constraints, ReadFeed: 0/74 constraints, PredecessorRefiner: 1204/1204 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/415 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/415 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/415 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 3 (OVERLAPS) 680/1095 variables, 415/419 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1095 variables, 74/493 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1095/1095 variables, and 1697 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 31162 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 415/415 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1204/1204 constraints, Known Traps: 1/1 constraints]
After SMT, in 68039ms problems are : Problem set: 0 solved, 1204 unsolved
Search for dead transitions found 0 dead transitions in 68051ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70877 ms. Remains : 415/415 places, 1206/1206 transitions.
[2025-06-01 13:02:35] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
Found an invariant !
This invariant on transitions {228=1, 256=1, 259=1, 315=1, 512=1, 675=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 339=1, 664=1, 678=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[741] Max Struct:[+inf]
[2025-06-01 13:02:36] [INFO ] Flatten gal took : 47 ms
[2025-06-01 13:02:36] [INFO ] Flatten gal took : 46 ms
RANDOM walk for 40002 steps (8 resets) in 270 ms. (147 steps per ms) remains 1/1 properties
[2025-06-01 13:02:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2185967260256793002.gal : 8 ms
[2025-06-01 13:02:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1524387001187876888.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/ReachabilityCardinality2185967260256793002.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1524387001187876888.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 1/1 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality1524387001187876888.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :31 after 1995
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1995 after 1.24464e+06
Interrupted probabilistic random walk after 342287 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :0 out of 1
Probabilistic random walk after 342287 steps, saw 209896 distinct states, run finished after 3001 ms. (steps per millisecond=114 ) properties seen :0
[2025-06-01 13:02:39] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 13:02:39] [INFO ] Invariant cache hit.
[2025-06-01 13:02:39] [INFO ] State equation strengthened by 74 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/11 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 344/355 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/358 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/358 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/358 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 594/952 variables, 330/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/952 variables, 73/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/952 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 62/1014 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1014 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 67/1081 variables, 65/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1081 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 8/1089 variables, 4/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1089 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/1095 variables, 4/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1095 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1095 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1095/1095 variables, and 492 constraints, problems are : Problem set: 0 solved, 1 unsolved in 647 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 415/415 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/11 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 344/355 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/358 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/358 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/358 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 594/952 variables, 330/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/952 variables, 73/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/952 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 62/1014 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1014 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 67/1081 variables, 65/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1081 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 8/1089 variables, 4/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1089 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 6/1095 variables, 4/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1095 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1095 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1095/1095 variables, and 493 constraints, problems are : Problem set: 0 solved, 1 unsolved in 725 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 415/415 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1383ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2704 ms.
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 48 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 415/415 places, 1206/1206 transitions.
RANDOM walk for 40000 steps (8 resets) in 220 ms. (180 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1.24464e+06 after 3.74714e+10
Interrupted probabilistic random walk after 379287 steps, run timeout after 3001 ms. (steps per millisecond=126 ) properties seen :0 out of 1
Probabilistic random walk after 379287 steps, saw 232582 distinct states, run finished after 3001 ms. (steps per millisecond=126 ) properties seen :0
[2025-06-01 13:02:47] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 13:02:47] [INFO ] Invariant cache hit.
[2025-06-01 13:02:47] [INFO ] State equation strengthened by 74 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/11 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 344/355 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/358 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/358 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/358 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 594/952 variables, 330/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/952 variables, 73/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/952 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 62/1014 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1014 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 67/1081 variables, 65/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1081 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 8/1089 variables, 4/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1089 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/1095 variables, 4/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1095 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1095 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1095/1095 variables, and 492 constraints, problems are : Problem set: 0 solved, 1 unsolved in 731 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 415/415 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/11 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 344/355 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/358 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/358 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/358 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 594/952 variables, 330/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/952 variables, 73/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/952 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 62/1014 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1014 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 67/1081 variables, 65/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1081 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 8/1089 variables, 4/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1089 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 6/1095 variables, 4/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1095 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1095 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1095/1095 variables, and 493 constraints, problems are : Problem set: 0 solved, 1 unsolved in 652 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 415/415 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1400ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2576 ms.
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 50 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 415/415 places, 1206/1206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 47 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2025-06-01 13:02:51] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 13:02:51] [INFO ] Invariant cache hit.
[2025-06-01 13:02:51] [INFO ] Implicit Places using invariants in 566 ms returned []
[2025-06-01 13:02:51] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 13:02:51] [INFO ] Invariant cache hit.
[2025-06-01 13:02:52] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-01 13:02:53] [INFO ] Implicit Places using invariants and state equation in 2254 ms returned []
Implicit Place search using SMT with State Equation took 2822 ms to find 0 implicit places.
[2025-06-01 13:02:54] [INFO ] Redundant transitions in 21 ms returned []
Running 1204 sub problems to find dead transitions.
[2025-06-01 13:02:54] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 13:02:54] [INFO ] Invariant cache hit.
[2025-06-01 13:02:54] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/415 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3.74714e+10 after 5.80652e+17
Detected timeout of ITS tools.
[2025-06-01 13:03:26] [INFO ] Flatten gal took : 27 ms
[2025-06-01 13:03:26] [INFO ] Applying decomposition
[2025-06-01 13:03:26] [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/graph3275492541497936271.txt' '-o' '/tmp/graph3275492541497936271.bin' '-w' '/tmp/graph3275492541497936271.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3275492541497936271.bin' '-l' '-1' '-v' '-w' '/tmp/graph3275492541497936271.weights' '-q' '0' '-e' '0.001'
[2025-06-01 13:03:27] [INFO ] Decomposing Gal with order
[2025-06-01 13:03:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 13:03:27] [INFO ] Removed a total of 2063 redundant transitions.
[2025-06-01 13:03:27] [INFO ] Flatten gal took : 58 ms
[2025-06-01 13:03:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 842 labels/synchronizations in 28 ms.
[2025-06-01 13:03:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7287627296720343025.gal : 10 ms
[2025-06-01 13:03:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4533612857965039218.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/ReachabilityCardinality7287627296720343025.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4533612857965039218.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/ReachabilityCardinality4533612857965039218.prop.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 415/1095 variables, and 3 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/415 constraints, ReadFeed: 0/74 constraints, PredecessorRefiner: 1204/1204 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/415 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
[2025-06-01 13:03:45] [INFO ] Deduced a trap composed of 131 places in 174 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/415 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 415/1095 variables, and 4 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/415 constraints, ReadFeed: 0/74 constraints, PredecessorRefiner: 0/1204 constraints, Known Traps: 1/1 constraints]
After SMT, in 66581ms problems are : Problem set: 0 solved, 1204 unsolved
Search for dead transitions found 0 dead transitions in 66594ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69492 ms. Remains : 415/415 places, 1206/1206 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 526 transitions
Reduce isomorphic transitions removed 526 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 536 rules applied. Total rules applied 536 place count 415 transition count 670
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 546 place count 405 transition count 670
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 546 place count 405 transition count 603
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 680 place count 338 transition count 603
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 2 with 258 rules applied. Total rules applied 938 place count 209 transition count 474
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1002 place count 145 transition count 346
Iterating global reduction 2 with 64 rules applied. Total rules applied 1066 place count 145 transition count 346
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1067 place count 145 transition count 345
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1067 place count 145 transition count 344
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1069 place count 144 transition count 344
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1132 place count 81 transition count 218
Iterating global reduction 3 with 63 rules applied. Total rules applied 1195 place count 81 transition count 218
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1258 place count 18 transition count 92
Iterating global reduction 3 with 63 rules applied. Total rules applied 1321 place count 18 transition count 92
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1384 place count 18 transition count 29
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1384 place count 18 transition count 28
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1386 place count 17 transition count 28
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 1389 place count 17 transition count 25
Applied a total of 1389 rules in 41 ms. Remains 17 /415 variables (removed 398) and now considering 25/1206 (removed 1181) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 25 rows 17 cols
[2025-06-01 13:04:00] [INFO ] Computed 3 invariants in 1 ms
[2025-06-01 13:04:00] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 13:04:00] [INFO ] After 18ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-06-01 13:04:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-01 13:04:00] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 13:04:00] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 13:04:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 13:04:00] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 13:04:00] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 13:04:00] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 13:04:00] [INFO ] After 64ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-01 13:04:00] [INFO ] Flatten gal took : 2 ms
[2025-06-01 13:04:00] [INFO ] Flatten gal took : 1 ms
[2025-06-01 13:04:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11013479678112735648.gal : 1 ms
[2025-06-01 13:04:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8960536608040256406.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/ReachabilityCardinality11013479678112735648.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8960536608040256406.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/ReachabilityCardinality8960536608040256406.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
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 315
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :315 after 12482
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :12482 after 287427
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :287427 after 4.65965e+07
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :4.65965e+07 after 1.40496e+08
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.40496e+08 after 3.28112e+08
Detected timeout of ITS tools.
[2025-06-01 13:04:15] [INFO ] Flatten gal took : 5 ms
[2025-06-01 13:04:15] [INFO ] Applying decomposition
[2025-06-01 13:04:15] [INFO ] Flatten gal took : 1 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/graph5349345964067230104.txt' '-o' '/tmp/graph5349345964067230104.bin' '-w' '/tmp/graph5349345964067230104.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5349345964067230104.bin' '-l' '-1' '-v' '-w' '/tmp/graph5349345964067230104.weights' '-q' '0' '-e' '0.001'
[2025-06-01 13:04:15] [INFO ] Decomposing Gal with order
[2025-06-01 13:04:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 13:04:15] [INFO ] Removed a total of 14 redundant transitions.
[2025-06-01 13:04:15] [INFO ] Flatten gal took : 1 ms
[2025-06-01 13:04:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-01 13:04:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5722354583089721605.gal : 1 ms
[2025-06-01 13:04:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17789350609776994634.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/ReachabilityCardinality5722354583089721605.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17789350609776994634.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/ReachabilityCardinality17789350609776994634.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
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 315
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :315 after 16388
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :16388 after 616169
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :616169 after 8.57224e+09
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :8.57224e+09 after 2.24466e+11
Detected timeout of ITS tools.
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2.24466e+11 after 2.78919e+12
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30237 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[741] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c064-UpperBounds-13 in 450432 ms.
Starting property specific reduction for FunctionPointer-PT-c064-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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2025-06-01 13:04:30] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
// Phase 1: matrix 765 rows 465 cols
[2025-06-01 13:04:30] [INFO ] Computed 2 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 36 ms. (270 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[+inf]
[2025-06-01 13:04:30] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-01 13:04:30] [INFO ] Invariant cache hit.
[2025-06-01 13:04:30] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-01 13:04:30] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 13:04:31] [INFO ] [Real]Absence check using state equation in 323 ms returned sat
[2025-06-01 13:04:31] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-01 13:04:31] [INFO ] [Real]Added 94 Read/Feed constraints in 61 ms returned sat
[2025-06-01 13:04:31] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:04:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 10 ms returned sat
[2025-06-01 13:04:31] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 13:04:31] [INFO ] [Nat]Absence check using state equation in 345 ms returned sat
[2025-06-01 13:04:32] [INFO ] [Nat]Added 94 Read/Feed constraints in 65 ms returned sat
[2025-06-01 13:04:32] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 100 ms.
[2025-06-01 13:04:32] [INFO ] Added : 7 causal constraints over 3 iterations in 328 ms. Result :sat
Minimization took 618 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[+inf]
Support contains 1 out of 465 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 1326/1326 transitions.
Graph (complete) has 2259 edges and 465 vertex of which 462 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 462 transition count 1320
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 12 place count 457 transition count 1310
Iterating global reduction 1 with 5 rules applied. Total rules applied 17 place count 457 transition count 1310
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 23 place count 457 transition count 1304
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 28 place count 452 transition count 1290
Iterating global reduction 2 with 5 rules applied. Total rules applied 33 place count 452 transition count 1290
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 36 place count 449 transition count 1284
Iterating global reduction 2 with 3 rules applied. Total rules applied 39 place count 449 transition count 1284
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 43 place count 445 transition count 1272
Iterating global reduction 2 with 4 rules applied. Total rules applied 47 place count 445 transition count 1272
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 51 place count 441 transition count 1264
Iterating global reduction 2 with 4 rules applied. Total rules applied 55 place count 441 transition count 1264
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 59 place count 437 transition count 1256
Iterating global reduction 2 with 4 rules applied. Total rules applied 63 place count 437 transition count 1256
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 67 place count 433 transition count 1248
Iterating global reduction 2 with 4 rules applied. Total rules applied 71 place count 433 transition count 1248
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 75 place count 429 transition count 1240
Iterating global reduction 2 with 4 rules applied. Total rules applied 79 place count 429 transition count 1240
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 81 place count 427 transition count 1236
Iterating global reduction 2 with 2 rules applied. Total rules applied 83 place count 427 transition count 1236
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 85 place count 425 transition count 1232
Iterating global reduction 2 with 2 rules applied. Total rules applied 87 place count 425 transition count 1232
Applied a total of 87 rules in 167 ms. Remains 425 /465 variables (removed 40) and now considering 1232/1326 (removed 94) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 425/465 places, 1232/1326 transitions.
[2025-06-01 13:04:33] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
Found an invariant !
This invariant on transitions {203=1, 301=1, 499=1, 690=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 350=1, 676=1, 694=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 1) seen :[4]
Current structural bounds on expressions (after cover walk) : Max Seen:[4] Max Struct:[+inf]
[2025-06-01 13:04:33] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
// Phase 1: matrix 695 rows 425 cols
[2025-06-01 13:04:33] [INFO ] Computed 3 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 3472 ms. (287 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1620 ms. (616 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[121] Max Struct:[+inf]
[2025-06-01 13:04:38] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2025-06-01 13:04:38] [INFO ] Invariant cache hit.
[2025-06-01 13:04:38] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-01 13:04:39] [INFO ] [Real]Absence check using state equation in 257 ms returned sat
[2025-06-01 13:04:39] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-01 13:04:39] [INFO ] [Real]Added 75 Read/Feed constraints in 52 ms returned sat
[2025-06-01 13:04:39] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:04:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-01 13:04:39] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2025-06-01 13:04:39] [INFO ] [Nat]Added 75 Read/Feed constraints in 90 ms returned sat
[2025-06-01 13:04:40] [INFO ] Deduced a trap composed of 113 places in 488 ms of which 5 ms to minimize.
[2025-06-01 13:04:40] [INFO ] Deduced a trap composed of 97 places in 530 ms of which 7 ms to minimize.
[2025-06-01 13:04:41] [INFO ] Deduced a trap composed of 81 places in 455 ms of which 5 ms to minimize.
[2025-06-01 13:04:41] [INFO ] Deduced a trap composed of 74 places in 459 ms of which 8 ms to minimize.
[2025-06-01 13:04:42] [INFO ] Deduced a trap composed of 73 places in 446 ms of which 4 ms to minimize.
[2025-06-01 13:04:42] [INFO ] Deduced a trap composed of 71 places in 462 ms of which 4 ms to minimize.
[2025-06-01 13:04:43] [INFO ] Deduced a trap composed of 70 places in 480 ms of which 5 ms to minimize.
[2025-06-01 13:04:43] [INFO ] Deduced a trap composed of 77 places in 559 ms of which 7 ms to minimize.
[2025-06-01 13:04:43] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 4256 ms
[2025-06-01 13:04:44] [INFO ] Computed and/alt/rep : 339/1255/332 causal constraints (skipped 361 transitions) in 221 ms.
[2025-06-01 13:04:44] [INFO ] Added : 29 causal constraints over 7 iterations in 759 ms. Result :sat
Minimization took 548 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[121] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[121] Max Struct:[+inf]
Support contains 1 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1232/1232 transitions.
Applied a total of 0 rules in 67 ms. Remains 425 /425 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 425/425 places, 1232/1232 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1232/1232 transitions.
Applied a total of 0 rules in 62 ms. Remains 425 /425 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
[2025-06-01 13:04:47] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2025-06-01 13:04:47] [INFO ] Invariant cache hit.
[2025-06-01 13:04:48] [INFO ] Implicit Places using invariants in 955 ms returned []
[2025-06-01 13:04:48] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2025-06-01 13:04:48] [INFO ] Invariant cache hit.
[2025-06-01 13:04:48] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-01 13:04:50] [INFO ] Implicit Places using invariants and state equation in 2203 ms returned []
Implicit Place search using SMT with State Equation took 3187 ms to find 0 implicit places.
[2025-06-01 13:04:50] [INFO ] Redundant transitions in 22 ms returned []
Running 1230 sub problems to find dead transitions.
[2025-06-01 13:04:50] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2025-06-01 13:04:50] [INFO ] Invariant cache hit.
[2025-06-01 13:04:50] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/425 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 425/1120 variables, and 3 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/425 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/425 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
[2025-06-01 13:05:36] [INFO ] Deduced a trap composed of 131 places in 142 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/425 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 425/1120 variables, and 4 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/425 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 0/1230 constraints, Known Traps: 1/1 constraints]
After SMT, in 66782ms problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 66795ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70075 ms. Remains : 425/425 places, 1232/1232 transitions.
[2025-06-01 13:05:57] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
Found an invariant !
This invariant on transitions {203=1, 301=1, 499=1, 690=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 350=1, 676=1, 694=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[121] Max Struct:[+inf]
[2025-06-01 13:05:58] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2025-06-01 13:05:58] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[121] Max Struct:[+inf]
RANDOM walk for 1000001 steps (2 resets) in 3412 ms. (292 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1499 ms. (666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[121] Max Struct:[+inf]
[2025-06-01 13:06:03] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2025-06-01 13:06:03] [INFO ] Invariant cache hit.
[2025-06-01 13:06:03] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2025-06-01 13:06:03] [INFO ] [Real]Absence check using state equation in 343 ms returned sat
[2025-06-01 13:06:03] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-01 13:06:03] [INFO ] [Real]Added 75 Read/Feed constraints in 66 ms returned sat
[2025-06-01 13:06:03] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:06:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-01 13:06:04] [INFO ] [Nat]Absence check using state equation in 311 ms returned sat
[2025-06-01 13:06:04] [INFO ] [Nat]Added 75 Read/Feed constraints in 92 ms returned sat
[2025-06-01 13:06:04] [INFO ] Deduced a trap composed of 113 places in 602 ms of which 7 ms to minimize.
[2025-06-01 13:06:05] [INFO ] Deduced a trap composed of 97 places in 582 ms of which 6 ms to minimize.
[2025-06-01 13:06:06] [INFO ] Deduced a trap composed of 81 places in 581 ms of which 7 ms to minimize.
[2025-06-01 13:06:06] [INFO ] Deduced a trap composed of 74 places in 565 ms of which 7 ms to minimize.
[2025-06-01 13:06:07] [INFO ] Deduced a trap composed of 73 places in 602 ms of which 7 ms to minimize.
[2025-06-01 13:06:08] [INFO ] Deduced a trap composed of 71 places in 606 ms of which 7 ms to minimize.
[2025-06-01 13:06:08] [INFO ] Deduced a trap composed of 70 places in 586 ms of which 7 ms to minimize.
[2025-06-01 13:06:09] [INFO ] Deduced a trap composed of 77 places in 630 ms of which 6 ms to minimize.
[2025-06-01 13:06:09] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 5122 ms
[2025-06-01 13:06:09] [INFO ] Computed and/alt/rep : 339/1255/332 causal constraints (skipped 361 transitions) in 138 ms.
[2025-06-01 13:06:10] [INFO ] Added : 29 causal constraints over 7 iterations in 646 ms. Result :sat
Minimization took 578 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[121] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[121] Max Struct:[+inf]
Support contains 1 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1232/1232 transitions.
Applied a total of 0 rules in 61 ms. Remains 425 /425 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 425/425 places, 1232/1232 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1232/1232 transitions.
Applied a total of 0 rules in 64 ms. Remains 425 /425 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
[2025-06-01 13:06:12] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2025-06-01 13:06:12] [INFO ] Invariant cache hit.
[2025-06-01 13:06:13] [INFO ] Implicit Places using invariants in 876 ms returned []
[2025-06-01 13:06:13] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2025-06-01 13:06:13] [INFO ] Invariant cache hit.
[2025-06-01 13:06:14] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-01 13:06:16] [INFO ] Implicit Places using invariants and state equation in 2690 ms returned []
Implicit Place search using SMT with State Equation took 3573 ms to find 0 implicit places.
[2025-06-01 13:06:16] [INFO ] Redundant transitions in 22 ms returned []
Running 1230 sub problems to find dead transitions.
[2025-06-01 13:06:16] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2025-06-01 13:06:16] [INFO ] Invariant cache hit.
[2025-06-01 13:06:16] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/425 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 425/1120 variables, and 3 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/425 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/425 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
[2025-06-01 13:07:07] [INFO ] Deduced a trap composed of 131 places in 240 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/425 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 425/1120 variables, and 4 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/425 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 0/1230 constraints, Known Traps: 1/1 constraints]
After SMT, in 66493ms problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 66516ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70184 ms. Remains : 425/425 places, 1232/1232 transitions.
[2025-06-01 13:07:22] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
Found an invariant !
This invariant on transitions {203=1, 301=1, 499=1, 690=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 350=1, 676=1, 694=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[121] Max Struct:[+inf]
[2025-06-01 13:07:23] [INFO ] Flatten gal took : 29 ms
[2025-06-01 13:07:23] [INFO ] Flatten gal took : 30 ms
[2025-06-01 13:07:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4153203036496384155.gal : 5 ms
RANDOM walk for 40001 steps (8 resets) in 177 ms. (224 steps per ms) remains 1/1 properties
[2025-06-01 13:07:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14947668070599462621.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/ReachabilityCardinality4153203036496384155.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14947668070599462621.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 (8 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality14947668070599462621.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :31 after 1975
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1975 after 1.20219e+06
Interrupted probabilistic random walk after 401853 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :0 out of 1
Probabilistic random walk after 401853 steps, saw 246418 distinct states, run finished after 3001 ms. (steps per millisecond=133 ) properties seen :0
[2025-06-01 13:07:26] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2025-06-01 13:07:26] [INFO ] Invariant cache hit.
[2025-06-01 13:07:26] [INFO ] State equation strengthened by 75 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) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/12 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/20 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 349/369 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 10/379 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/379 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/379 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 604/983 variables, 338/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/983 variables, 74/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/983 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 62/1045 variables, 1/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1045 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (OVERLAPS) 70/1115 variables, 68/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1115 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 4/1119 variables, 2/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1119 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1/1120 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1120 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1120 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1120/1120 variables, and 503 constraints, problems are : Problem set: 0 solved, 1 unsolved in 480 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 425/425 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 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) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/12 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/20 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 349/369 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/369 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 10/379 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/379 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/379 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 604/983 variables, 338/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/983 variables, 74/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/983 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 62/1045 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1045 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 70/1115 variables, 68/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1115 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 4/1119 variables, 2/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1119 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1/1120 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1120 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1120 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1120/1120 variables, and 504 constraints, problems are : Problem set: 0 solved, 1 unsolved in 483 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 425/425 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 976ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1330 ms.
Support contains 1 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1232/1232 transitions.
Applied a total of 0 rules in 51 ms. Remains 425 /425 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 425/425 places, 1232/1232 transitions.
RANDOM walk for 40000 steps (8 resets) in 182 ms. (218 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 367380 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :0 out of 1
Probabilistic random walk after 367380 steps, saw 225281 distinct states, run finished after 3001 ms. (steps per millisecond=122 ) properties seen :0
[2025-06-01 13:07:31] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2025-06-01 13:07:31] [INFO ] Invariant cache hit.
[2025-06-01 13:07:31] [INFO ] State equation strengthened by 75 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) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/12 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/20 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 349/369 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 10/379 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/379 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/379 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 604/983 variables, 338/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/983 variables, 74/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/983 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 62/1045 variables, 1/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1045 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 32
All remaining problems are real, not stopping.
At refinement iteration 18 (OVERLAPS) 70/1115 variables, 68/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1115 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD size :1.20219e+06 after 3.3929e+10
At refinement iteration 20 (OVERLAPS) 4/1119 variables, 2/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1119 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1/1120 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1120 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1120 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1120/1120 variables, and 503 constraints, problems are : Problem set: 0 solved, 1 unsolved in 536 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 425/425 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 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) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/12 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/20 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 349/369 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/369 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 10/379 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/379 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/379 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 604/983 variables, 338/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/983 variables, 74/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/983 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 62/1045 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1045 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 70/1115 variables, 68/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1115 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 4/1119 variables, 2/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1119 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1/1120 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1120 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1120 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1120/1120 variables, and 504 constraints, problems are : Problem set: 0 solved, 1 unsolved in 590 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 425/425 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1139ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1644 ms.
Support contains 1 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1232/1232 transitions.
Applied a total of 0 rules in 62 ms. Remains 425 /425 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 425/425 places, 1232/1232 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1232/1232 transitions.
Applied a total of 0 rules in 82 ms. Remains 425 /425 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
[2025-06-01 13:07:34] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2025-06-01 13:07:34] [INFO ] Invariant cache hit.
[2025-06-01 13:07:35] [INFO ] Implicit Places using invariants in 749 ms returned []
[2025-06-01 13:07:35] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2025-06-01 13:07:35] [INFO ] Invariant cache hit.
[2025-06-01 13:07:35] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-01 13:07:37] [INFO ] Implicit Places using invariants and state equation in 2041 ms returned []
Implicit Place search using SMT with State Equation took 2793 ms to find 0 implicit places.
[2025-06-01 13:07:37] [INFO ] Redundant transitions in 23 ms returned []
Running 1230 sub problems to find dead transitions.
[2025-06-01 13:07:37] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2025-06-01 13:07:37] [INFO ] Invariant cache hit.
[2025-06-01 13:07:37] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/425 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3.3929e+10 after 4.52909e+17
[2025-06-01 13:08:11] [INFO ] Deduced a trap composed of 131 places in 313 ms of which 5 ms to minimize.
Detected timeout of ITS tools.
[2025-06-01 13:08:13] [INFO ] Flatten gal took : 48 ms
[2025-06-01 13:08:13] [INFO ] Applying decomposition
[2025-06-01 13:08:13] [INFO ] Flatten gal took : 48 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/graph12019099282718974578.txt' '-o' '/tmp/graph12019099282718974578.bin' '-w' '/tmp/graph12019099282718974578.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12019099282718974578.bin' '-l' '-1' '-v' '-w' '/tmp/graph12019099282718974578.weights' '-q' '0' '-e' '0.001'
[2025-06-01 13:08:13] [INFO ] Decomposing Gal with order
[2025-06-01 13:08:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 13:08:13] [INFO ] Removed a total of 2119 redundant transitions.
[2025-06-01 13:08:13] [INFO ] Flatten gal took : 90 ms
[2025-06-01 13:08:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 906 labels/synchronizations in 46 ms.
[2025-06-01 13:08:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8980876550959934448.gal : 10 ms
[2025-06-01 13:08:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5460533917701066810.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/ReachabilityCardinality8980876550959934448.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5460533917701066810.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/ReachabilityCardinality5460533917701066810.prop.
At refinement iteration 1 (INCLUDED_ONLY) 0/425 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 425/1120 variables, and 4 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/425 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/425 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/425 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/425 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 695/1120 variables, 425/429 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1120 variables, 75/504 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1120/1120 variables, and 1734 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30572 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 425/425 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 1/1 constraints]
After SMT, in 67565ms problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 67579ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70486 ms. Remains : 425/425 places, 1232/1232 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 537 transitions
Reduce isomorphic transitions removed 537 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 546 rules applied. Total rules applied 546 place count 425 transition count 686
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 555 place count 416 transition count 686
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 555 place count 416 transition count 613
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 701 place count 343 transition count 613
Performed 130 Post agglomeration using F-continuation condition.Transition count delta: 130
Deduced a syphon composed of 130 places in 0 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 2 with 260 rules applied. Total rules applied 961 place count 213 transition count 483
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1025 place count 149 transition count 355
Iterating global reduction 2 with 64 rules applied. Total rules applied 1089 place count 149 transition count 355
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1091 place count 149 transition count 353
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1154 place count 86 transition count 227
Iterating global reduction 3 with 63 rules applied. Total rules applied 1217 place count 86 transition count 227
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1280 place count 23 transition count 101
Iterating global reduction 3 with 63 rules applied. Total rules applied 1343 place count 23 transition count 101
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1406 place count 23 transition count 38
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1406 place count 23 transition count 37
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1408 place count 22 transition count 37
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 4 with 2 rules applied. Total rules applied 1410 place count 21 transition count 36
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 4 with 2 rules applied. Total rules applied 1412 place count 20 transition count 37
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 1415 place count 20 transition count 34
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1416 place count 19 transition count 33
Iterating global reduction 4 with 1 rules applied. Total rules applied 1417 place count 19 transition count 33
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1419 place count 19 transition count 31
Applied a total of 1419 rules in 25 ms. Remains 19 /425 variables (removed 406) and now considering 31/1232 (removed 1201) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 31 rows 19 cols
[2025-06-01 13:08:45] [INFO ] Computed 3 invariants in 0 ms
[2025-06-01 13:08:45] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 13:08:45] [INFO ] After 13ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-06-01 13:08:45] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-01 13:08:45] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 13:08:45] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 13:08:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 13:08:45] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 13:08:45] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 13:08:45] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 13:08:45] [INFO ] After 44ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-01 13:08:45] [INFO ] Flatten gal took : 1 ms
[2025-06-01 13:08:45] [INFO ] Flatten gal took : 0 ms
[2025-06-01 13:08:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12242907319700864415.gal : 1 ms
[2025-06-01 13:08:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8691722314543131295.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/ReachabilityCardinality12242907319700864415.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8691722314543131295.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/ReachabilityCardinality8691722314543131295.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
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 315
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :315 after 12482
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :12482 after 326755
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :326755 after 2.38474e+07
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2.38474e+07 after 7.07972e+07
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :7.07972e+07 after 1.64605e+08
Detected timeout of ITS tools.
[2025-06-01 13:09:00] [INFO ] Flatten gal took : 1 ms
[2025-06-01 13:09:00] [INFO ] Applying decomposition
[2025-06-01 13:09:00] [INFO ] Flatten gal took : 1 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/graph4227175453923023984.txt' '-o' '/tmp/graph4227175453923023984.bin' '-w' '/tmp/graph4227175453923023984.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4227175453923023984.bin' '-l' '-1' '-v' '-w' '/tmp/graph4227175453923023984.weights' '-q' '0' '-e' '0.001'
[2025-06-01 13:09:00] [INFO ] Decomposing Gal with order
[2025-06-01 13:09:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 13:09:00] [INFO ] Removed a total of 30 redundant transitions.
[2025-06-01 13:09:00] [INFO ] Flatten gal took : 3 ms
[2025-06-01 13:09:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2025-06-01 13:09:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4875447524670483258.gal : 1 ms
[2025-06-01 13:09:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17995255659515184445.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/ReachabilityCardinality4875447524670483258.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17995255659515184445.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/ReachabilityCardinality17995255659515184445.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
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 315
Detected timeout of ITS tools.
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30179 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[121] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c064-UpperBounds-14 in 284560 ms.
Starting property specific reduction for FunctionPointer-PT-c064-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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2025-06-01 13:09:15] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
// Phase 1: matrix 765 rows 465 cols
[2025-06-01 13:09:15] [INFO ] Computed 2 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 51 ms. (192 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 14 ms. (666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[+inf]
[2025-06-01 13:09:15] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-01 13:09:15] [INFO ] Invariant cache hit.
[2025-06-01 13:09:15] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-01 13:09:15] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 13:09:15] [INFO ] [Real]Absence check using state equation in 333 ms returned sat
[2025-06-01 13:09:15] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-01 13:09:16] [INFO ] [Real]Added 94 Read/Feed constraints in 52 ms returned sat
[2025-06-01 13:09:16] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:09:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-01 13:09:16] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 13:09:16] [INFO ] [Nat]Absence check using state equation in 421 ms returned sat
[2025-06-01 13:09:16] [INFO ] [Nat]Added 94 Read/Feed constraints in 71 ms returned sat
[2025-06-01 13:09:16] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 147 ms.
[2025-06-01 13:09:17] [INFO ] Added : 1 causal constraints over 1 iterations in 317 ms. Result :sat
Minimization took 707 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[+inf]
Support contains 1 out of 465 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 1326/1326 transitions.
Graph (complete) has 2259 edges and 465 vertex of which 462 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 462 transition count 1320
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 12 place count 457 transition count 1310
Iterating global reduction 1 with 5 rules applied. Total rules applied 17 place count 457 transition count 1310
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 23 place count 457 transition count 1304
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 29 place count 451 transition count 1288
Iterating global reduction 2 with 6 rules applied. Total rules applied 35 place count 451 transition count 1288
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 39 place count 451 transition count 1284
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 43 place count 447 transition count 1276
Iterating global reduction 3 with 4 rules applied. Total rules applied 47 place count 447 transition count 1276
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 52 place count 442 transition count 1262
Iterating global reduction 3 with 5 rules applied. Total rules applied 57 place count 442 transition count 1262
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 62 place count 437 transition count 1250
Iterating global reduction 3 with 5 rules applied. Total rules applied 67 place count 437 transition count 1250
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 72 place count 432 transition count 1240
Iterating global reduction 3 with 5 rules applied. Total rules applied 77 place count 432 transition count 1240
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 82 place count 427 transition count 1230
Iterating global reduction 3 with 5 rules applied. Total rules applied 87 place count 427 transition count 1230
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 92 place count 422 transition count 1220
Iterating global reduction 3 with 5 rules applied. Total rules applied 97 place count 422 transition count 1220
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 100 place count 419 transition count 1214
Iterating global reduction 3 with 3 rules applied. Total rules applied 103 place count 419 transition count 1214
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 106 place count 416 transition count 1208
Iterating global reduction 3 with 3 rules applied. Total rules applied 109 place count 416 transition count 1208
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 110 place count 415 transition count 1206
Iterating global reduction 3 with 1 rules applied. Total rules applied 111 place count 415 transition count 1206
Applied a total of 111 rules in 279 ms. Remains 415 /465 variables (removed 50) and now considering 1206/1326 (removed 120) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 280 ms. Remains : 415/465 places, 1206/1326 transitions.
[2025-06-01 13:09:18] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
Found an invariant !
This invariant on transitions {228=1, 256=1, 259=1, 315=1, 512=1, 675=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {202=1, 289=1, 614=1, 678=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[4] Max Struct:[+inf]
[2025-06-01 13:09:18] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
// Phase 1: matrix 680 rows 415 cols
[2025-06-01 13:09:18] [INFO ] Computed 3 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[+inf]
RANDOM walk for 1000004 steps (2 resets) in 3380 ms. (295 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1556 ms. (642 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[660] Max Struct:[+inf]
[2025-06-01 13:09:23] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 13:09:23] [INFO ] Invariant cache hit.
[2025-06-01 13:09:24] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-01 13:09:24] [INFO ] [Real]Absence check using state equation in 344 ms returned sat
[2025-06-01 13:09:24] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-01 13:09:24] [INFO ] [Real]Added 74 Read/Feed constraints in 67 ms returned sat
[2025-06-01 13:09:24] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:09:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-01 13:09:25] [INFO ] [Nat]Absence check using state equation in 376 ms returned sat
[2025-06-01 13:09:25] [INFO ] [Nat]Added 74 Read/Feed constraints in 68 ms returned sat
[2025-06-01 13:09:25] [INFO ] Deduced a trap composed of 70 places in 616 ms of which 7 ms to minimize.
[2025-06-01 13:09:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 695 ms
[2025-06-01 13:09:25] [INFO ] Computed and/alt/rep : 333/1252/331 causal constraints (skipped 347 transitions) in 135 ms.
[2025-06-01 13:09:26] [INFO ] Deduced a trap composed of 245 places in 605 ms of which 7 ms to minimize.
[2025-06-01 13:09:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 711 ms
[2025-06-01 13:09:27] [INFO ] Added : 5 causal constraints over 2 iterations in 1181 ms. Result :sat
Minimization took 440 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[660] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[660] Max Struct:[+inf]
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 94 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 415/415 places, 1206/1206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 83 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2025-06-01 13:09:29] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 13:09:29] [INFO ] Invariant cache hit.
[2025-06-01 13:09:30] [INFO ] Implicit Places using invariants in 774 ms returned []
[2025-06-01 13:09:30] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 13:09:30] [INFO ] Invariant cache hit.
[2025-06-01 13:09:31] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-01 13:09:33] [INFO ] Implicit Places using invariants and state equation in 2789 ms returned []
Implicit Place search using SMT with State Equation took 3576 ms to find 0 implicit places.
[2025-06-01 13:09:33] [INFO ] Redundant transitions in 35 ms returned []
Running 1204 sub problems to find dead transitions.
[2025-06-01 13:09:33] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 13:09:33] [INFO ] Invariant cache hit.
[2025-06-01 13:09:33] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/415 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
[2025-06-01 13:10:06] [INFO ] Deduced a trap composed of 131 places in 242 ms of which 4 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 415/1095 variables, and 4 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/415 constraints, ReadFeed: 0/74 constraints, PredecessorRefiner: 1204/1204 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/415 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/415 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/415 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 3 (OVERLAPS) 680/1095 variables, 415/419 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1095 variables, 74/493 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1095 variables, 1204/1697 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1095/1095 variables, and 1697 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 415/415 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1204/1204 constraints, Known Traps: 1/1 constraints]
After SMT, in 66369ms problems are : Problem set: 0 solved, 1204 unsolved
Search for dead transitions found 0 dead transitions in 66390ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70104 ms. Remains : 415/415 places, 1206/1206 transitions.
[2025-06-01 13:10:39] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
Found an invariant !
This invariant on transitions {228=1, 256=1, 259=1, 315=1, 512=1, 675=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {202=1, 289=1, 614=1, 678=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[660] Max Struct:[+inf]
[2025-06-01 13:10:40] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 13:10:40] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[660] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 3045 ms. (328 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1476 ms. (677 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[666] Max Struct:[+inf]
[2025-06-01 13:10:45] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 13:10:45] [INFO ] Invariant cache hit.
[2025-06-01 13:10:45] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-01 13:10:45] [INFO ] [Real]Absence check using state equation in 321 ms returned sat
[2025-06-01 13:10:45] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-01 13:10:45] [INFO ] [Real]Added 74 Read/Feed constraints in 61 ms returned sat
[2025-06-01 13:10:45] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:10:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-01 13:10:46] [INFO ] [Nat]Absence check using state equation in 265 ms returned sat
[2025-06-01 13:10:46] [INFO ] [Nat]Added 74 Read/Feed constraints in 45 ms returned sat
[2025-06-01 13:10:46] [INFO ] Deduced a trap composed of 70 places in 500 ms of which 6 ms to minimize.
[2025-06-01 13:10:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 549 ms
[2025-06-01 13:10:46] [INFO ] Computed and/alt/rep : 333/1252/331 causal constraints (skipped 347 transitions) in 82 ms.
[2025-06-01 13:10:47] [INFO ] Deduced a trap composed of 245 places in 506 ms of which 6 ms to minimize.
[2025-06-01 13:10:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 580 ms
[2025-06-01 13:10:47] [INFO ] Added : 5 causal constraints over 2 iterations in 900 ms. Result :sat
Minimization took 388 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[666] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[666] Max Struct:[+inf]
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 47 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 415/415 places, 1206/1206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 48 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2025-06-01 13:10:50] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 13:10:50] [INFO ] Invariant cache hit.
[2025-06-01 13:10:51] [INFO ] Implicit Places using invariants in 655 ms returned []
[2025-06-01 13:10:51] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 13:10:51] [INFO ] Invariant cache hit.
[2025-06-01 13:10:51] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-01 13:10:53] [INFO ] Implicit Places using invariants and state equation in 2269 ms returned []
Implicit Place search using SMT with State Equation took 2929 ms to find 0 implicit places.
[2025-06-01 13:10:53] [INFO ] Redundant transitions in 22 ms returned []
Running 1204 sub problems to find dead transitions.
[2025-06-01 13:10:53] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 13:10:53] [INFO ] Invariant cache hit.
[2025-06-01 13:10:53] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/415 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
[2025-06-01 13:11:20] [INFO ] Deduced a trap composed of 131 places in 154 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/415 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 0.0)
(s20 1.0)
(s21 1.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 0.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 1.0)
(s61 0.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 0.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 0.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 0.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.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 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 415/1095 variables, and 4 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/415 constraints, ReadFeed: 0/74 constraints, PredecessorRefiner: 1204/1204 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/415 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/415 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/415 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 3 (OVERLAPS) 680/1095 variables, 415/419 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1095 variables, 74/493 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1095 variables, 1204/1697 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1095/1095 variables, and 1697 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 415/415 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1204/1204 constraints, Known Traps: 1/1 constraints]
After SMT, in 65699ms problems are : Problem set: 0 solved, 1204 unsolved
Search for dead transitions found 0 dead transitions in 65712ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68720 ms. Remains : 415/415 places, 1206/1206 transitions.
[2025-06-01 13:11:59] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
Found an invariant !
This invariant on transitions {228=1, 256=1, 259=1, 315=1, 512=1, 675=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {202=1, 289=1, 614=1, 678=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[666] Max Struct:[+inf]
[2025-06-01 13:12:00] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 13:12:00] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[666] Max Struct:[+inf]
RANDOM walk for 1000009 steps (2 resets) in 3431 ms. (291 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1487 ms. (672 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[666] Max Struct:[+inf]
[2025-06-01 13:12:04] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 13:12:04] [INFO ] Invariant cache hit.
[2025-06-01 13:12:05] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-01 13:12:05] [INFO ] [Real]Absence check using state equation in 259 ms returned sat
[2025-06-01 13:12:05] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-01 13:12:05] [INFO ] [Real]Added 74 Read/Feed constraints in 70 ms returned sat
[2025-06-01 13:12:05] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:12:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-01 13:12:05] [INFO ] [Nat]Absence check using state equation in 285 ms returned sat
[2025-06-01 13:12:05] [INFO ] [Nat]Added 74 Read/Feed constraints in 44 ms returned sat
[2025-06-01 13:12:06] [INFO ] Deduced a trap composed of 70 places in 491 ms of which 6 ms to minimize.
[2025-06-01 13:12:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 574 ms
[2025-06-01 13:12:06] [INFO ] Computed and/alt/rep : 333/1252/331 causal constraints (skipped 347 transitions) in 132 ms.
[2025-06-01 13:12:07] [INFO ] Deduced a trap composed of 245 places in 513 ms of which 8 ms to minimize.
[2025-06-01 13:12:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 623 ms
[2025-06-01 13:12:07] [INFO ] Added : 5 causal constraints over 2 iterations in 1122 ms. Result :sat
Minimization took 520 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[666] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[666] Max Struct:[+inf]
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 46 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 415/415 places, 1206/1206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 46 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2025-06-01 13:12:10] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 13:12:10] [INFO ] Invariant cache hit.
[2025-06-01 13:12:11] [INFO ] Implicit Places using invariants in 653 ms returned []
[2025-06-01 13:12:11] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 13:12:11] [INFO ] Invariant cache hit.
[2025-06-01 13:12:12] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-01 13:12:13] [INFO ] Implicit Places using invariants and state equation in 1972 ms returned []
Implicit Place search using SMT with State Equation took 2647 ms to find 0 implicit places.
[2025-06-01 13:12:13] [INFO ] Redundant transitions in 34 ms returned []
Running 1204 sub problems to find dead transitions.
[2025-06-01 13:12:13] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 13:12:13] [INFO ] Invariant cache hit.
[2025-06-01 13:12:13] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/415 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
[2025-06-01 13:12:50] [INFO ] Deduced a trap composed of 131 places in 235 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 415/1095 variables, and 4 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/415 constraints, ReadFeed: 0/74 constraints, PredecessorRefiner: 1204/1204 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/415 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/415 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/415 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 3 (OVERLAPS) 680/1095 variables, 415/419 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1095 variables, 74/493 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1095/1095 variables, and 1697 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 30897 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 415/415 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1204/1204 constraints, Known Traps: 1/1 constraints]
After SMT, in 68335ms problems are : Problem set: 0 solved, 1204 unsolved
Search for dead transitions found 0 dead transitions in 68361ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71099 ms. Remains : 415/415 places, 1206/1206 transitions.
[2025-06-01 13:13:22] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
Found an invariant !
This invariant on transitions {228=1, 256=1, 259=1, 315=1, 512=1, 675=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {202=1, 289=1, 614=1, 678=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[666] Max Struct:[+inf]
[2025-06-01 13:13:22] [INFO ] Flatten gal took : 29 ms
RANDOM walk for 40002 steps (8 resets) in 165 ms. (240 steps per ms) remains 1/1 properties
[2025-06-01 13:13:22] [INFO ] Flatten gal took : 29 ms
[2025-06-01 13:13:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7501787070397490919.gal : 5 ms
[2025-06-01 13:13:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2166908857292344631.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/ReachabilityCardinality7501787070397490919.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2166908857292344631.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
BEST_FIRST walk for 40003 steps (8 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality2166908857292344631.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :31 after 1995
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1995 after 1.24464e+06
Interrupted probabilistic random walk after 376684 steps, run timeout after 3001 ms. (steps per millisecond=125 ) properties seen :0 out of 1
Probabilistic random walk after 376684 steps, saw 230986 distinct states, run finished after 3001 ms. (steps per millisecond=125 ) properties seen :0
[2025-06-01 13:13:25] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 13:13:25] [INFO ] Invariant cache hit.
[2025-06-01 13:13:25] [INFO ] State equation strengthened by 74 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/11 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 344/355 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/358 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/358 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/358 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 594/952 variables, 330/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/952 variables, 73/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/952 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 62/1014 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1014 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 67/1081 variables, 65/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1081 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 8/1089 variables, 4/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1089 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/1095 variables, 4/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1095 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1095 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1095/1095 variables, and 492 constraints, problems are : Problem set: 0 solved, 1 unsolved in 624 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 415/415 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/11 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 344/355 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/358 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/358 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/358 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 594/952 variables, 330/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/952 variables, 73/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/952 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 62/1014 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1014 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 67/1081 variables, 65/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1081 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 8/1089 variables, 4/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1089 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 6/1095 variables, 4/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1095 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1095 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1095/1095 variables, and 493 constraints, problems are : Problem set: 0 solved, 1 unsolved in 632 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 415/415 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1267ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1969 ms.
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 50 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 415/415 places, 1206/1206 transitions.
RANDOM walk for 40006 steps (8 resets) in 154 ms. (258 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1.24464e+06 after 3.74714e+10
Interrupted probabilistic random walk after 409945 steps, run timeout after 3001 ms. (steps per millisecond=136 ) properties seen :0 out of 1
Probabilistic random walk after 409945 steps, saw 251380 distinct states, run finished after 3001 ms. (steps per millisecond=136 ) properties seen :0
[2025-06-01 13:13:32] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 13:13:32] [INFO ] Invariant cache hit.
[2025-06-01 13:13:32] [INFO ] State equation strengthened by 74 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/11 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 344/355 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/358 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/358 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/358 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 594/952 variables, 330/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/952 variables, 73/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/952 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 62/1014 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1014 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 67/1081 variables, 65/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1081 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 8/1089 variables, 4/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1089 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/1095 variables, 4/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1095 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1095 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1095/1095 variables, and 492 constraints, problems are : Problem set: 0 solved, 1 unsolved in 621 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 415/415 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/11 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 344/355 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/358 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/358 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/358 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 594/952 variables, 330/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/952 variables, 73/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/952 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 62/1014 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1014 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 67/1081 variables, 65/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1081 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 8/1089 variables, 4/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1089 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 6/1095 variables, 4/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1095 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1095 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1095/1095 variables, and 493 constraints, problems are : Problem set: 0 solved, 1 unsolved in 628 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 415/415 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1262ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1981 ms.
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 88 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 415/415 places, 1206/1206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 52 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2025-06-01 13:13:35] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 13:13:35] [INFO ] Invariant cache hit.
[2025-06-01 13:13:36] [INFO ] Implicit Places using invariants in 789 ms returned []
[2025-06-01 13:13:36] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 13:13:36] [INFO ] Invariant cache hit.
[2025-06-01 13:13:36] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-01 13:13:38] [INFO ] Implicit Places using invariants and state equation in 2102 ms returned []
Implicit Place search using SMT with State Equation took 2897 ms to find 0 implicit places.
[2025-06-01 13:13:38] [INFO ] Redundant transitions in 21 ms returned []
Running 1204 sub problems to find dead transitions.
[2025-06-01 13:13:38] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 13:13:38] [INFO ] Invariant cache hit.
[2025-06-01 13:13:38] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/415 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3.74714e+10 after 5.80652e+17
[2025-06-01 13:14:12] [INFO ] Deduced a trap composed of 131 places in 253 ms of which 5 ms to minimize.
Detected timeout of ITS tools.
[2025-06-01 13:14:13] [INFO ] Flatten gal took : 32 ms
[2025-06-01 13:14:13] [INFO ] Applying decomposition
[2025-06-01 13:14:13] [INFO ] Flatten gal took : 31 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/graph16891090277089658691.txt' '-o' '/tmp/graph16891090277089658691.bin' '-w' '/tmp/graph16891090277089658691.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16891090277089658691.bin' '-l' '-1' '-v' '-w' '/tmp/graph16891090277089658691.weights' '-q' '0' '-e' '0.001'
[2025-06-01 13:14:13] [INFO ] Decomposing Gal with order
[2025-06-01 13:14:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 13:14:13] [INFO ] Removed a total of 2060 redundant transitions.
[2025-06-01 13:14:13] [INFO ] Flatten gal took : 93 ms
[2025-06-01 13:14:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 832 labels/synchronizations in 51 ms.
[2025-06-01 13:14:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11774833985671788767.gal : 10 ms
[2025-06-01 13:14:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16609007648287974242.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/ReachabilityCardinality11774833985671788767.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16609007648287974242.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/ReachabilityCardinality16609007648287974242.prop.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 415/1095 variables, and 4 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/415 constraints, ReadFeed: 0/74 constraints, PredecessorRefiner: 1204/1204 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/415 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/415 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/415 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 3 (OVERLAPS) 680/1095 variables, 415/419 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1095 variables, 74/493 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1095/1095 variables, and 1697 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 30179 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 415/415 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1204/1204 constraints, Known Traps: 1/1 constraints]
After SMT, in 66264ms problems are : Problem set: 0 solved, 1204 unsolved
Search for dead transitions found 0 dead transitions in 66278ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69259 ms. Remains : 415/415 places, 1206/1206 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 526 transitions
Reduce isomorphic transitions removed 526 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 536 rules applied. Total rules applied 536 place count 415 transition count 670
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 546 place count 405 transition count 670
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 546 place count 405 transition count 603
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 680 place count 338 transition count 603
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 2 with 258 rules applied. Total rules applied 938 place count 209 transition count 474
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1002 place count 145 transition count 346
Iterating global reduction 2 with 64 rules applied. Total rules applied 1066 place count 145 transition count 346
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1067 place count 145 transition count 345
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1067 place count 145 transition count 344
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1069 place count 144 transition count 344
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1132 place count 81 transition count 218
Iterating global reduction 3 with 63 rules applied. Total rules applied 1195 place count 81 transition count 218
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1258 place count 18 transition count 92
Iterating global reduction 3 with 63 rules applied. Total rules applied 1321 place count 18 transition count 92
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1384 place count 18 transition count 29
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1384 place count 18 transition count 28
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1386 place count 17 transition count 28
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 1389 place count 17 transition count 25
Applied a total of 1389 rules in 30 ms. Remains 17 /415 variables (removed 398) and now considering 25/1206 (removed 1181) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 25 rows 17 cols
[2025-06-01 13:14:44] [INFO ] Computed 3 invariants in 0 ms
[2025-06-01 13:14:44] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 13:14:44] [INFO ] After 11ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-06-01 13:14:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-01 13:14:44] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 13:14:44] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 13:14:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 13:14:44] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 13:14:45] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 13:14:45] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 13:14:45] [INFO ] After 44ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-01 13:14:45] [INFO ] Flatten gal took : 1 ms
[2025-06-01 13:14:45] [INFO ] Flatten gal took : 1 ms
[2025-06-01 13:14:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14770915523467404223.gal : 1 ms
[2025-06-01 13:14:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5785415034123881996.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/ReachabilityCardinality14770915523467404223.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5785415034123881996.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/ReachabilityCardinality5785415034123881996.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
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 315
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :315 after 12482
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :12482 after 287427
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :287427 after 4.65965e+07
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :4.65965e+07 after 1.40496e+08
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.40496e+08 after 3.28112e+08
Detected timeout of ITS tools.
[2025-06-01 13:15:00] [INFO ] Flatten gal took : 1 ms
[2025-06-01 13:15:00] [INFO ] Applying decomposition
[2025-06-01 13:15:00] [INFO ] Flatten gal took : 1 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/graph1786711287785108605.txt' '-o' '/tmp/graph1786711287785108605.bin' '-w' '/tmp/graph1786711287785108605.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1786711287785108605.bin' '-l' '-1' '-v' '-w' '/tmp/graph1786711287785108605.weights' '-q' '0' '-e' '0.001'
[2025-06-01 13:15:00] [INFO ] Decomposing Gal with order
[2025-06-01 13:15:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 13:15:00] [INFO ] Removed a total of 17 redundant transitions.
[2025-06-01 13:15:00] [INFO ] Flatten gal took : 2 ms
[2025-06-01 13:15:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-01 13:15:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1326634712208721340.gal : 1 ms
[2025-06-01 13:15:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6832142711763993817.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/ReachabilityCardinality1326634712208721340.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6832142711763993817.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/ReachabilityCardinality6832142711763993817.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
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 315
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :315 after 20930
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :20930 after 191618
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :191618 after 1.00583e+09
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.00583e+09 after 1.02867e+11
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.02867e+11 after 1.36325e+12
Detected timeout of ITS tools.
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30194 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[666] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c064-UpperBounds-15 in 359688 ms.
[2025-06-01 13:15:15] [INFO ] Flatten gal took : 30 ms
[2025-06-01 13:15:15] [INFO ] Applying decomposition
[2025-06-01 13:15:15] [INFO ] Flatten gal took : 32 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/graph7097385380880550690.txt' '-o' '/tmp/graph7097385380880550690.bin' '-w' '/tmp/graph7097385380880550690.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7097385380880550690.bin' '-l' '-1' '-v' '-w' '/tmp/graph7097385380880550690.weights' '-q' '0' '-e' '0.001'
[2025-06-01 13:15:15] [INFO ] Decomposing Gal with order
[2025-06-01 13:15:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 13:15:15] [INFO ] Removed a total of 2291 redundant transitions.
[2025-06-01 13:15:15] [INFO ] Flatten gal took : 86 ms
[2025-06-01 13:15:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 971 labels/synchronizations in 55 ms.
[2025-06-01 13:15:15] [INFO ] Time to serialize gal into /tmp/UpperBounds7170847509513097151.gal : 14 ms
[2025-06-01 13:15:15] [INFO ] Time to serialize properties into /tmp/UpperBounds16236842921375404793.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/UpperBounds7170847509513097151.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds16236842921375404793.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 ...284
Loading property file /tmp/UpperBounds16236842921375404793.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="FunctionPointer-PT-c064"
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 FunctionPointer-PT-c064, 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 r111-smll-174867015800020"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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