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-174867015800018.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-c016, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-smll-174867015800018
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K 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-c016-UpperBounds-00
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-01
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-02
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-03
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-04
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-05
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-06
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-07
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-08
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-09
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-10
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-11
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-12
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-13
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-14
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748776937785

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-c016
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-01 11:22:20] [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 11:22:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 11:22:21] [INFO ] Load time of PNML (sax parser for PT used): 987 ms
[2025-06-01 11:22:21] [INFO ] Transformed 2826 places.
[2025-06-01 11:22:21] [INFO ] Transformed 8960 transitions.
[2025-06-01 11:22:21] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 1297 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 ms.
Deduced a syphon composed of 1198 places in 58 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c016-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-01 11:22:21] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2025-06-01 11:22:21] [INFO ] Computed 4 invariants in 120 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[16, +inf, +inf, +inf, 16, 1, +inf, +inf, 16, +inf]
RANDOM walk for 10000 steps (2 resets) in 379 ms. (26 steps per ms)
FORMULA FunctionPointer-PT-c016-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90009 steps (23 resets) in 324 ms. (276 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 0, 0, 0, 3, 1, 1, 6] Max Struct:[16, +inf, +inf, +inf, 16, +inf, +inf, 16, +inf]
[2025-06-01 11:22:22] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
[2025-06-01 11:22:22] [INFO ] Invariant cache hit.
[2025-06-01 11:22:23] [INFO ] [Real]Absence check using 3 positive place invariants in 34 ms returned sat
[2025-06-01 11:22:23] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 11:22:25] [INFO ] [Real]Absence check using state equation in 1700 ms returned sat
[2025-06-01 11:22:25] [INFO ] State equation strengthened by 479 read => feed constraints.
[2025-06-01 11:22:25] [INFO ] [Real]Added 479 Read/Feed constraints in 198 ms returned sat
[2025-06-01 11:22:25] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:22:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 34 ms returned sat
[2025-06-01 11:22:26] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 11:22:27] [INFO ] [Nat]Absence check using state equation in 1415 ms returned sat
[2025-06-01 11:22:28] [INFO ] [Nat]Added 479 Read/Feed constraints in 158 ms returned sat
[2025-06-01 11:22:29] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 1171 ms.
[2025-06-01 11:22:29] [INFO ] Added : 0 causal constraints over 0 iterations in 1553 ms. Result :sat
Minimization took 607 ms.
[2025-06-01 11:22:30] [INFO ] [Real]Absence check using 3 positive place invariants in 19 ms returned sat
[2025-06-01 11:22:30] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 11:22:32] [INFO ] [Real]Absence check using state equation in 1347 ms returned sat
[2025-06-01 11:22:32] [INFO ] [Real]Added 479 Read/Feed constraints in 196 ms returned sat
[2025-06-01 11:22:32] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:22:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 20 ms returned sat
[2025-06-01 11:22:32] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 11:22:34] [INFO ] [Nat]Absence check using state equation in 1469 ms returned sat
[2025-06-01 11:22:34] [INFO ] [Nat]Added 479 Read/Feed constraints in 147 ms returned sat
[2025-06-01 11:22:35] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 603 ms.
[2025-06-01 11:22:35] [INFO ] Added : 1 causal constraints over 1 iterations in 1078 ms. Result :sat
Minimization took 616 ms.
[2025-06-01 11:22:36] [INFO ] [Real]Absence check using 3 positive place invariants in 30 ms returned sat
[2025-06-01 11:22:36] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 11:22:37] [INFO ] [Real]Absence check using state equation in 1385 ms returned sat
[2025-06-01 11:22:38] [INFO ] [Real]Added 479 Read/Feed constraints in 265 ms returned sat
[2025-06-01 11:22:38] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:22:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 19 ms returned sat
[2025-06-01 11:22:38] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 11:22:39] [INFO ] [Nat]Absence check using state equation in 1160 ms returned sat
[2025-06-01 11:22:40] [INFO ] [Nat]Added 479 Read/Feed constraints in 234 ms returned sat
[2025-06-01 11:22:40] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 690 ms.
[2025-06-01 11:22:45] [INFO ] Deduced a trap composed of 142 places in 3612 ms of which 306 ms to minimize.
[2025-06-01 11:22:45] [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 2
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 11:22:45] [INFO ] [Real]Absence check using 3 positive place invariants in 30 ms returned sat
[2025-06-01 11:22:45] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 8 ms returned sat
[2025-06-01 11:22:47] [INFO ] [Real]Absence check using state equation in 1677 ms returned sat
[2025-06-01 11:22:47] [INFO ] [Real]Added 479 Read/Feed constraints in 344 ms returned sat
[2025-06-01 11:22:48] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:22:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 28 ms returned sat
[2025-06-01 11:22:48] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 11:22:49] [INFO ] [Nat]Absence check using state equation in 1531 ms returned sat
[2025-06-01 11:22:50] [INFO ] [Nat]Added 479 Read/Feed constraints in 277 ms returned sat
[2025-06-01 11:22:51] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 1296 ms.
[2025-06-01 11:22:55] [INFO ] Deduced a trap composed of 142 places in 2992 ms of which 26 ms to minimize.
[2025-06-01 11:22:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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 11:22:55] [INFO ] [Real]Absence check using 3 positive place invariants in 30 ms returned sat
[2025-06-01 11:22:55] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 11:22:57] [INFO ] [Real]Absence check using state equation in 1541 ms returned sat
[2025-06-01 11:22:58] [INFO ] [Real]Added 479 Read/Feed constraints in 377 ms returned sat
[2025-06-01 11:22:58] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:22:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 33 ms returned sat
[2025-06-01 11:22:58] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 4 ms returned sat
[2025-06-01 11:23:00] [INFO ] [Nat]Absence check using state equation in 1336 ms returned sat
[2025-06-01 11:23:00] [INFO ] [Nat]Added 479 Read/Feed constraints in 283 ms returned sat
[2025-06-01 11:23:01] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 612 ms.
[2025-06-01 11:23:01] [INFO ] Added : 2 causal constraints over 1 iterations in 1234 ms. Result :sat
Minimization took 586 ms.
[2025-06-01 11:23:02] [INFO ] [Real]Absence check using 3 positive place invariants in 18 ms returned sat
[2025-06-01 11:23:02] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 11:23:03] [INFO ] [Real]Absence check using state equation in 1293 ms returned sat
[2025-06-01 11:23:04] [INFO ] [Real]Added 479 Read/Feed constraints in 179 ms returned sat
[2025-06-01 11:23:04] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:23:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 31 ms returned sat
[2025-06-01 11:23:04] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 3 ms returned sat
[2025-06-01 11:23:06] [INFO ] [Nat]Absence check using state equation in 1338 ms returned sat
[2025-06-01 11:23:06] [INFO ] [Nat]Added 479 Read/Feed constraints in 241 ms returned sat
[2025-06-01 11:23:08] [INFO ] Deduced a trap composed of 147 places in 2032 ms of which 16 ms to minimize.
[2025-06-01 11:23:10] [INFO ] Deduced a trap composed of 141 places in 2211 ms of which 16 ms to minimize.
[2025-06-01 11:23:10] [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 11:23:11] [INFO ] [Real]Absence check using 3 positive place invariants in 19 ms returned sat
[2025-06-01 11:23:11] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 11:23:12] [INFO ] [Real]Absence check using state equation in 1363 ms returned sat
[2025-06-01 11:23:12] [INFO ] [Real]Added 479 Read/Feed constraints in 263 ms returned sat
[2025-06-01 11:23:12] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:23:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 32 ms returned sat
[2025-06-01 11:23:13] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 11:23:14] [INFO ] [Nat]Absence check using state equation in 1497 ms returned sat
[2025-06-01 11:23:15] [INFO ] [Nat]Added 479 Read/Feed constraints in 231 ms returned sat
[2025-06-01 11:23:15] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 743 ms.
[2025-06-01 11:23:16] [INFO ] Added : 1 causal constraints over 1 iterations in 1403 ms. Result :sat
Minimization took 609 ms.
[2025-06-01 11:23:17] [INFO ] [Real]Absence check using 3 positive place invariants in 28 ms returned sat
[2025-06-01 11:23:17] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 11:23:19] [INFO ] [Real]Absence check using state equation in 1497 ms returned sat
[2025-06-01 11:23:19] [INFO ] [Real]Added 479 Read/Feed constraints in 283 ms returned sat
[2025-06-01 11:23:19] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:23:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 32 ms returned sat
[2025-06-01 11:23:20] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 11:23:21] [INFO ] [Nat]Absence check using state equation in 1511 ms returned sat
[2025-06-01 11:23:22] [INFO ] [Nat]Added 479 Read/Feed constraints in 367 ms returned sat
[2025-06-01 11:23:22] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 708 ms.
[2025-06-01 11:23:23] [INFO ] Added : 2 causal constraints over 1 iterations in 1200 ms. Result :sat
Minimization took 609 ms.
[2025-06-01 11:23:24] [INFO ] [Real]Absence check using 3 positive place invariants in 19 ms returned sat
[2025-06-01 11:23:24] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 11:23:26] [INFO ] [Real]Absence check using state equation in 1654 ms returned sat
[2025-06-01 11:23:26] [INFO ] [Real]Added 479 Read/Feed constraints in 328 ms returned sat
[2025-06-01 11:23:26] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:23:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 32 ms returned sat
[2025-06-01 11:23:27] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 11:23:28] [INFO ] [Nat]Absence check using state equation in 1359 ms returned sat
[2025-06-01 11:23:28] [INFO ] [Nat]Added 479 Read/Feed constraints in 199 ms returned sat
[2025-06-01 11:23:29] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 586 ms.
[2025-06-01 11:23:30] [INFO ] Added : 2 causal constraints over 1 iterations in 1156 ms. Result :sat
Minimization took 608 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 0, 0, 0, 3, 1, 1, 6] Max Struct:[16, +inf, +inf, +inf, 16, +inf, +inf, 16, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 0, 0, 0, 3, 1, 1, 6] Max Struct:[16, +inf, +inf, +inf, 16, +inf, +inf, 16, +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.31 ms
Discarding 206 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 379 transitions
Reduce isomorphic transitions removed 379 transitions.
Iterating post reduction 0 with 379 rules applied. Total rules applied 380 place count 1422 transition count 5583
Discarding 299 places :
Symmetric choice reduction at 1 with 299 rule applications. Total rules 679 place count 1123 transition count 3305
Iterating global reduction 1 with 299 rules applied. Total rules applied 978 place count 1123 transition count 3305
Ensure Unique test removed 360 transitions
Reduce isomorphic transitions removed 360 transitions.
Iterating post reduction 1 with 360 rules applied. Total rules applied 1338 place count 1123 transition count 2945
Discarding 156 places :
Symmetric choice reduction at 2 with 156 rule applications. Total rules 1494 place count 967 transition count 2633
Iterating global reduction 2 with 156 rules applied. Total rules applied 1650 place count 967 transition count 2633
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 2 with 68 rules applied. Total rules applied 1718 place count 967 transition count 2565
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1732 place count 953 transition count 2537
Iterating global reduction 3 with 14 rules applied. Total rules applied 1746 place count 953 transition count 2537
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1760 place count 939 transition count 2509
Iterating global reduction 3 with 14 rules applied. Total rules applied 1774 place count 939 transition count 2509
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1788 place count 925 transition count 2481
Iterating global reduction 3 with 14 rules applied. Total rules applied 1802 place count 925 transition count 2481
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1816 place count 911 transition count 2453
Iterating global reduction 3 with 14 rules applied. Total rules applied 1830 place count 911 transition count 2453
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1844 place count 897 transition count 2425
Iterating global reduction 3 with 14 rules applied. Total rules applied 1858 place count 897 transition count 2425
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1871 place count 884 transition count 2399
Iterating global reduction 3 with 13 rules applied. Total rules applied 1884 place count 884 transition count 2399
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1897 place count 871 transition count 2373
Iterating global reduction 3 with 13 rules applied. Total rules applied 1910 place count 871 transition count 2373
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 1963 place count 818 transition count 2175
Iterating global reduction 3 with 53 rules applied. Total rules applied 2016 place count 818 transition count 2175
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 2076 place count 758 transition count 1935
Iterating global reduction 3 with 60 rules applied. Total rules applied 2136 place count 758 transition count 1935
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 2196 place count 698 transition count 1787
Iterating global reduction 3 with 60 rules applied. Total rules applied 2256 place count 698 transition count 1787
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 2316 place count 638 transition count 1667
Iterating global reduction 3 with 60 rules applied. Total rules applied 2376 place count 638 transition count 1667
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 2436 place count 578 transition count 1547
Iterating global reduction 3 with 60 rules applied. Total rules applied 2496 place count 578 transition count 1547
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 2556 place count 518 transition count 1427
Iterating global reduction 3 with 60 rules applied. Total rules applied 2616 place count 518 transition count 1427
Discarding 59 places :
Symmetric choice reduction at 3 with 59 rule applications. Total rules 2675 place count 459 transition count 1309
Iterating global reduction 3 with 59 rules applied. Total rules applied 2734 place count 459 transition count 1309
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 2748 place count 445 transition count 1281
Iterating global reduction 3 with 14 rules applied. Total rules applied 2762 place count 445 transition count 1281
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 2770 place count 445 transition count 1273
Applied a total of 2770 rules in 2068 ms. Remains 445 /1628 variables (removed 1183) and now considering 1273/5962 (removed 4689) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2090 ms. Remains : 445/1628 places, 1273/5962 transitions.
[2025-06-01 11:23:32] [INFO ] Flow matrix only has 728 transitions (discarded 545 similar events)
Found an invariant !
This invariant on transitions {194=1, 306=1, 507=1, 720=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 364=1, 565=1, 715=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 9) seen :[0, 0, 2147483647, 0, 0, 0, 3, 2, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 0, +inf, 0, 0, 3, 3, 2, 6] Max Struct:[16, +inf, +inf, +inf, 16, +inf, +inf, 16, +inf]
[2025-06-01 11:23:33] [INFO ] Flow matrix only has 728 transitions (discarded 545 similar events)
// Phase 1: matrix 728 rows 445 cols
[2025-06-01 11:23:33] [INFO ] Computed 3 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, +inf, 0, 0, 3, 3, 2, 6] Max Struct:[16, +inf, +inf, +inf, 16, +inf, +inf, 16, +inf]
RANDOM walk for 1000000 steps (2 resets) in 3262 ms. (306 steps per ms)
FORMULA FunctionPointer-PT-c016-UpperBounds-03 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 8000008 steps (16 resets) in 8399 ms. (952 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 206, 5, 2, 5, 1757, 2, 242] Max Struct:[16, +inf, +inf, 16, +inf, +inf, 16, +inf]
[2025-06-01 11:23:45] [INFO ] Flow matrix only has 728 transitions (discarded 545 similar events)
[2025-06-01 11:23:45] [INFO ] Invariant cache hit.
[2025-06-01 11:23:45] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-01 11:23:45] [INFO ] [Real]Absence check using state equation in 236 ms returned sat
[2025-06-01 11:23:45] [INFO ] State equation strengthened by 86 read => feed constraints.
[2025-06-01 11:23:45] [INFO ] [Real]Added 86 Read/Feed constraints in 73 ms returned sat
[2025-06-01 11:23:45] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:23:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-01 11:23:45] [INFO ] [Nat]Absence check using state equation in 316 ms returned sat
[2025-06-01 11:23:45] [INFO ] [Nat]Added 86 Read/Feed constraints in 31 ms returned sat
[2025-06-01 11:23:46] [INFO ] Computed and/alt/rep : 349/2323/342 causal constraints (skipped 384 transitions) in 134 ms.
[2025-06-01 11:23:46] [INFO ] Added : 0 causal constraints over 0 iterations in 221 ms. Result :sat
Minimization took 519 ms.
[2025-06-01 11:23:46] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-01 11:23:47] [INFO ] [Real]Absence check using state equation in 236 ms returned sat
[2025-06-01 11:23:47] [INFO ] [Real]Added 86 Read/Feed constraints in 48 ms returned sat
[2025-06-01 11:23:47] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:23:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-01 11:23:47] [INFO ] [Nat]Absence check using state equation in 400 ms returned sat
[2025-06-01 11:23:47] [INFO ] [Nat]Added 86 Read/Feed constraints in 67 ms returned sat
[2025-06-01 11:23:48] [INFO ] Deduced a trap composed of 89 places in 640 ms of which 7 ms to minimize.
[2025-06-01 11:23:49] [INFO ] Deduced a trap composed of 82 places in 608 ms of which 8 ms to minimize.
[2025-06-01 11:23:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1387 ms
[2025-06-01 11:23:49] [INFO ] Computed and/alt/rep : 349/2323/342 causal constraints (skipped 384 transitions) in 147 ms.
[2025-06-01 11:23:50] [INFO ] Deduced a trap composed of 132 places in 603 ms of which 9 ms to minimize.
[2025-06-01 11:23:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 724 ms
[2025-06-01 11:23:50] [INFO ] Added : 6 causal constraints over 3 iterations in 1344 ms. Result :sat
Minimization took 573 ms.
[2025-06-01 11:23:51] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-01 11:23:51] [INFO ] [Real]Absence check using state equation in 408 ms returned sat
[2025-06-01 11:23:51] [INFO ] [Real]Added 86 Read/Feed constraints in 77 ms returned sat
[2025-06-01 11:23:51] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:23:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-01 11:23:52] [INFO ] [Nat]Absence check using state equation in 391 ms returned sat
[2025-06-01 11:23:52] [INFO ] [Nat]Added 86 Read/Feed constraints in 136 ms returned sat
[2025-06-01 11:23:52] [INFO ] Computed and/alt/rep : 349/2323/342 causal constraints (skipped 384 transitions) in 154 ms.
[2025-06-01 11:23:53] [INFO ] Added : 17 causal constraints over 5 iterations in 658 ms. Result :sat
Minimization took 594 ms.
[2025-06-01 11:23:54] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-01 11:23:54] [INFO ] [Real]Absence check using state equation in 390 ms returned sat
[2025-06-01 11:23:54] [INFO ] [Real]Added 86 Read/Feed constraints in 68 ms returned sat
[2025-06-01 11:23:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:23:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-01 11:23:55] [INFO ] [Nat]Absence check using state equation in 408 ms returned sat
[2025-06-01 11:23:55] [INFO ] [Nat]Added 86 Read/Feed constraints in 79 ms returned sat
[2025-06-01 11:23:55] [INFO ] Deduced a trap composed of 82 places in 606 ms of which 7 ms to minimize.
[2025-06-01 11:23:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 689 ms
[2025-06-01 11:23:56] [INFO ] Computed and/alt/rep : 349/2323/342 causal constraints (skipped 384 transitions) in 132 ms.
[2025-06-01 11:23:56] [INFO ] Added : 2 causal constraints over 1 iterations in 286 ms. Result :sat
Minimization took 594 ms.
[2025-06-01 11:23:56] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-01 11:23:57] [INFO ] [Real]Absence check using state equation in 298 ms returned sat
[2025-06-01 11:23:57] [INFO ] [Real]Added 86 Read/Feed constraints in 65 ms returned sat
[2025-06-01 11:23:57] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:23:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-01 11:23:57] [INFO ] [Nat]Absence check using state equation in 390 ms returned sat
[2025-06-01 11:23:57] [INFO ] [Nat]Added 86 Read/Feed constraints in 133 ms returned sat
[2025-06-01 11:23:58] [INFO ] Deduced a trap composed of 80 places in 628 ms of which 7 ms to minimize.
[2025-06-01 11:23:59] [INFO ] Deduced a trap composed of 76 places in 591 ms of which 8 ms to minimize.
[2025-06-01 11:23:59] [INFO ] Deduced a trap composed of 74 places in 646 ms of which 8 ms to minimize.
[2025-06-01 11:24:00] [INFO ] Deduced a trap composed of 73 places in 617 ms of which 7 ms to minimize.
[2025-06-01 11:24:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2684 ms
[2025-06-01 11:24:00] [INFO ] Computed and/alt/rep : 349/2323/342 causal constraints (skipped 384 transitions) in 141 ms.
[2025-06-01 11:24:00] [INFO ] Added : 3 causal constraints over 1 iterations in 302 ms. Result :sat
Minimization took 647 ms.
[2025-06-01 11:24:01] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-01 11:24:02] [INFO ] [Real]Absence check using state equation in 366 ms returned sat
[2025-06-01 11:24:02] [INFO ] [Real]Added 86 Read/Feed constraints in 77 ms returned sat
[2025-06-01 11:24:02] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:24:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-01 11:24:02] [INFO ] [Nat]Absence check using state equation in 399 ms returned sat
[2025-06-01 11:24:02] [INFO ] [Nat]Added 86 Read/Feed constraints in 71 ms returned sat
[2025-06-01 11:24:03] [INFO ] Computed and/alt/rep : 349/2323/342 causal constraints (skipped 384 transitions) in 158 ms.
[2025-06-01 11:24:04] [INFO ] Deduced a trap composed of 225 places in 631 ms of which 7 ms to minimize.
[2025-06-01 11:24:04] [INFO ] Deduced a trap composed of 170 places in 590 ms of which 7 ms to minimize.
[2025-06-01 11:24:05] [INFO ] Deduced a trap composed of 149 places in 593 ms of which 8 ms to minimize.
[2025-06-01 11:24:06] [INFO ] Deduced a trap composed of 145 places in 514 ms of which 7 ms to minimize.
[2025-06-01 11:24:06] [INFO ] Deduced a trap composed of 134 places in 562 ms of which 7 ms to minimize.
[2025-06-01 11:24:07] [INFO ] Deduced a trap composed of 132 places in 577 ms of which 6 ms to minimize.
[2025-06-01 11:24:07] [INFO ] Deduced a trap composed of 128 places in 541 ms of which 6 ms to minimize.
[2025-06-01 11:24:08] [INFO ] Deduced a trap composed of 125 places in 551 ms of which 7 ms to minimize.
[2025-06-01 11:24:08] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 5093 ms
[2025-06-01 11:24:08] [INFO ] Added : 7 causal constraints over 4 iterations in 5675 ms. Result :sat
Minimization took 553 ms.
[2025-06-01 11:24:09] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2025-06-01 11:24:09] [INFO ] [Real]Absence check using state equation in 290 ms returned sat
[2025-06-01 11:24:09] [INFO ] [Real]Added 86 Read/Feed constraints in 51 ms returned sat
[2025-06-01 11:24:09] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:24:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-01 11:24:10] [INFO ] [Nat]Absence check using state equation in 390 ms returned sat
[2025-06-01 11:24:10] [INFO ] [Nat]Added 86 Read/Feed constraints in 71 ms returned sat
[2025-06-01 11:24:10] [INFO ] Computed and/alt/rep : 349/2323/342 causal constraints (skipped 384 transitions) in 87 ms.
[2025-06-01 11:24:10] [INFO ] Added : 2 causal constraints over 1 iterations in 189 ms. Result :sat
Minimization took 470 ms.
[2025-06-01 11:24:11] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2025-06-01 11:24:11] [INFO ] [Real]Absence check using state equation in 371 ms returned sat
[2025-06-01 11:24:11] [INFO ] [Real]Added 86 Read/Feed constraints in 70 ms returned sat
[2025-06-01 11:24:11] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:24:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-01 11:24:12] [INFO ] [Nat]Absence check using state equation in 386 ms returned sat
[2025-06-01 11:24:12] [INFO ] [Nat]Added 86 Read/Feed constraints in 64 ms returned sat
[2025-06-01 11:24:12] [INFO ] Computed and/alt/rep : 349/2323/342 causal constraints (skipped 384 transitions) in 135 ms.
[2025-06-01 11:24:12] [INFO ] Added : 9 causal constraints over 3 iterations in 433 ms. Result :sat
Minimization took 566 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 206, 5, 2, 5, 1757, 2, 242] Max Struct:[16, +inf, +inf, 16, +inf, +inf, 16, +inf]
FORMULA FunctionPointer-PT-c016-UpperBounds-13 16 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FunctionPointer-PT-c016-UpperBounds-08 16 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[16, 206, 5, 7, 1757, 242] Max Struct:[16, +inf, +inf, +inf, +inf, +inf]
Support contains 6 out of 445 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 445/445 places, 1273/1273 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 444 transition count 1271
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 444 transition count 1271
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 444 transition count 1269
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 443 transition count 1267
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 443 transition count 1267
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 442 transition count 1265
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 442 transition count 1265
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 441 transition count 1261
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 441 transition count 1261
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 440 transition count 1259
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 440 transition count 1259
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 439 transition count 1257
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 439 transition count 1257
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 438 transition count 1255
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 438 transition count 1255
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 437 transition count 1253
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 437 transition count 1253
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 436 transition count 1251
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 436 transition count 1251
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 435 transition count 1249
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 435 transition count 1249
Applied a total of 22 rules in 186 ms. Remains 435 /445 variables (removed 10) and now considering 1249/1273 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 187 ms. Remains : 435/445 places, 1249/1273 transitions.
[2025-06-01 11:24:20] [INFO ] Flow matrix only has 712 transitions (discarded 537 similar events)
Found an invariant !
This invariant on transitions {228=1, 330=1, 658=1, 707=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 354=1, 682=1, 711=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 6) seen :[1, 3, 3, 0, 5, 1]
FORMULA FunctionPointer-PT-c016-UpperBounds-00 16 TECHNIQUES TOPOLOGICAL COVER_WALK
Current structural bounds on expressions (after cover walk) : Max Seen:[206, 5, 7, 1757, 242] Max Struct:[+inf, +inf, +inf, +inf, +inf]
[2025-06-01 11:24:21] [INFO ] Flow matrix only has 712 transitions (discarded 537 similar events)
// Phase 1: matrix 712 rows 435 cols
[2025-06-01 11:24:21] [INFO ] Computed 3 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[206, 5, 7, 1757, 242] Max Struct:[+inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 2989 ms. (334 steps per ms)
BEST_FIRST walk for 5000005 steps (10 resets) in 4773 ms. (1047 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[701, 11, 11, 1757, 552] Max Struct:[+inf, +inf, +inf, +inf, +inf]
[2025-06-01 11:24:29] [INFO ] Flow matrix only has 712 transitions (discarded 537 similar events)
[2025-06-01 11:24:29] [INFO ] Invariant cache hit.
[2025-06-01 11:24:29] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-01 11:24:29] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
[2025-06-01 11:24:29] [INFO ] State equation strengthened by 83 read => feed constraints.
[2025-06-01 11:24:29] [INFO ] [Real]Added 83 Read/Feed constraints in 91 ms returned sat
[2025-06-01 11:24:29] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:24:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-01 11:24:30] [INFO ] [Nat]Absence check using state equation in 374 ms returned sat
[2025-06-01 11:24:30] [INFO ] [Nat]Added 83 Read/Feed constraints in 117 ms returned sat
[2025-06-01 11:24:31] [INFO ] Deduced a trap composed of 131 places in 549 ms of which 6 ms to minimize.
[2025-06-01 11:24:31] [INFO ] Deduced a trap composed of 125 places in 472 ms of which 5 ms to minimize.
[2025-06-01 11:24:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1135 ms
[2025-06-01 11:24:31] [INFO ] Computed and/alt/rep : 338/2038/338 causal constraints (skipped 372 transitions) in 136 ms.
[2025-06-01 11:24:32] [INFO ] Deduced a trap composed of 230 places in 604 ms of which 7 ms to minimize.
[2025-06-01 11:24:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 720 ms
[2025-06-01 11:24:32] [INFO ] Added : 6 causal constraints over 3 iterations in 1187 ms. Result :sat
Minimization took 527 ms.
[2025-06-01 11:24:33] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-01 11:24:33] [INFO ] [Real]Absence check using state equation in 255 ms returned sat
[2025-06-01 11:24:33] [INFO ] [Real]Added 83 Read/Feed constraints in 43 ms returned sat
[2025-06-01 11:24:33] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:24:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-01 11:24:34] [INFO ] [Nat]Absence check using state equation in 387 ms returned sat
[2025-06-01 11:24:34] [INFO ] [Nat]Added 83 Read/Feed constraints in 71 ms returned sat
[2025-06-01 11:24:34] [INFO ] Deduced a trap composed of 72 places in 508 ms of which 5 ms to minimize.
[2025-06-01 11:24:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 580 ms
[2025-06-01 11:24:34] [INFO ] Computed and/alt/rep : 338/2038/338 causal constraints (skipped 372 transitions) in 113 ms.
[2025-06-01 11:24:35] [INFO ] Added : 26 causal constraints over 8 iterations in 721 ms. Result :sat
Minimization took 569 ms.
[2025-06-01 11:24:36] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-01 11:24:36] [INFO ] [Real]Absence check using state equation in 351 ms returned sat
[2025-06-01 11:24:36] [INFO ] [Real]Added 83 Read/Feed constraints in 57 ms returned sat
[2025-06-01 11:24:36] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:24:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2025-06-01 11:24:37] [INFO ] [Nat]Absence check using state equation in 345 ms returned sat
[2025-06-01 11:24:37] [INFO ] [Nat]Added 83 Read/Feed constraints in 104 ms returned sat
[2025-06-01 11:24:37] [INFO ] Deduced a trap composed of 72 places in 551 ms of which 7 ms to minimize.
[2025-06-01 11:24:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 630 ms
[2025-06-01 11:24:38] [INFO ] Computed and/alt/rep : 338/2038/338 causal constraints (skipped 372 transitions) in 136 ms.
[2025-06-01 11:24:38] [INFO ] Added : 3 causal constraints over 1 iterations in 264 ms. Result :sat
Minimization took 601 ms.
[2025-06-01 11:24:39] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-01 11:24:39] [INFO ] [Real]Absence check using state equation in 383 ms returned sat
[2025-06-01 11:24:39] [INFO ] [Real]Added 83 Read/Feed constraints in 56 ms returned sat
[2025-06-01 11:24:39] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:24:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-01 11:24:40] [INFO ] [Nat]Absence check using state equation in 368 ms returned sat
[2025-06-01 11:24:40] [INFO ] [Nat]Added 83 Read/Feed constraints in 53 ms returned sat
[2025-06-01 11:24:40] [INFO ] Deduced a trap composed of 72 places in 581 ms of which 7 ms to minimize.
[2025-06-01 11:24:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 663 ms
[2025-06-01 11:24:40] [INFO ] Computed and/alt/rep : 338/2038/338 causal constraints (skipped 372 transitions) in 134 ms.
[2025-06-01 11:24:41] [INFO ] Added : 7 causal constraints over 4 iterations in 522 ms. Result :sat
Minimization took 507 ms.
[2025-06-01 11:24:42] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-01 11:24:42] [INFO ] [Real]Absence check using state equation in 366 ms returned sat
[2025-06-01 11:24:42] [INFO ] [Real]Added 83 Read/Feed constraints in 75 ms returned sat
[2025-06-01 11:24:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:24:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-01 11:24:42] [INFO ] [Nat]Absence check using state equation in 319 ms returned sat
[2025-06-01 11:24:43] [INFO ] [Nat]Added 83 Read/Feed constraints in 46 ms returned sat
[2025-06-01 11:24:43] [INFO ] Deduced a trap composed of 131 places in 565 ms of which 7 ms to minimize.
[2025-06-01 11:24:44] [INFO ] Deduced a trap composed of 123 places in 610 ms of which 7 ms to minimize.
[2025-06-01 11:24:44] [INFO ] Deduced a trap composed of 125 places in 601 ms of which 7 ms to minimize.
[2025-06-01 11:24:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1927 ms
[2025-06-01 11:24:45] [INFO ] Computed and/alt/rep : 338/2038/338 causal constraints (skipped 372 transitions) in 136 ms.
[2025-06-01 11:24:45] [INFO ] Added : 14 causal constraints over 4 iterations in 521 ms. Result :sat
Minimization took 576 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[701, 11, 11, 1757, 552] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[701, 11, 11, 1757, 552] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Support contains 5 out of 435 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 435/435 places, 1249/1249 transitions.
Applied a total of 0 rules in 61 ms. Remains 435 /435 variables (removed 0) and now considering 1249/1249 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 435/435 places, 1249/1249 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 435/435 places, 1249/1249 transitions.
Applied a total of 0 rules in 61 ms. Remains 435 /435 variables (removed 0) and now considering 1249/1249 (removed 0) transitions.
[2025-06-01 11:25:00] [INFO ] Flow matrix only has 712 transitions (discarded 537 similar events)
[2025-06-01 11:25:00] [INFO ] Invariant cache hit.
[2025-06-01 11:25:01] [INFO ] Implicit Places using invariants in 792 ms returned []
[2025-06-01 11:25:01] [INFO ] Flow matrix only has 712 transitions (discarded 537 similar events)
[2025-06-01 11:25:01] [INFO ] Invariant cache hit.
[2025-06-01 11:25:01] [INFO ] State equation strengthened by 83 read => feed constraints.
[2025-06-01 11:25:04] [INFO ] Implicit Places using invariants and state equation in 3394 ms returned []
Implicit Place search using SMT with State Equation took 4199 ms to find 0 implicit places.
[2025-06-01 11:25:04] [INFO ] Redundant transitions in 135 ms returned []
Running 1247 sub problems to find dead transitions.
[2025-06-01 11:25:04] [INFO ] Flow matrix only has 712 transitions (discarded 537 similar events)
[2025-06-01 11:25:04] [INFO ] Invariant cache hit.
[2025-06-01 11:25:04] [INFO ] State equation strengthened by 83 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1247 unsolved
[2025-06-01 11:25:33] [INFO ] Deduced a trap composed of 135 places in 399 ms of which 6 ms to minimize.
[2025-06-01 11:25:34] [INFO ] Deduced a trap composed of 131 places in 403 ms of which 6 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 435/1147 variables, and 5 constraints, problems are : Problem set: 0 solved, 1247 unsolved in 30083 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/435 constraints, ReadFeed: 0/83 constraints, PredecessorRefiner: 1247/1247 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1247 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1247 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/435 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/435 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1247 unsolved
At refinement iteration 3 (OVERLAPS) 712/1147 variables, 435/440 constraints. Problems are: Problem set: 0 solved, 1247 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1147 variables, 83/523 constraints. Problems are: Problem set: 0 solved, 1247 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1147/1147 variables, and 1770 constraints, problems are : Problem set: 0 solved, 1247 unsolved in 31323 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 435/435 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 1247/1247 constraints, Known Traps: 2/2 constraints]
After SMT, in 67393ms problems are : Problem set: 0 solved, 1247 unsolved
Search for dead transitions found 0 dead transitions in 67444ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71888 ms. Remains : 435/435 places, 1249/1249 transitions.
[2025-06-01 11:26:12] [INFO ] Flow matrix only has 712 transitions (discarded 537 similar events)
Found an invariant !
This invariant on transitions {228=1, 330=1, 658=1, 707=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 354=1, 682=1, 711=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 5) seen :[3, 3, 0, 3, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[701, 11, 11, 1757, 552] Max Struct:[+inf, +inf, +inf, +inf, +inf]
[2025-06-01 11:26:12] [INFO ] Flow matrix only has 712 transitions (discarded 537 similar events)
[2025-06-01 11:26:12] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[701, 11, 11, 1757, 552] Max Struct:[+inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000001 steps (2 resets) in 3107 ms. (321 steps per ms)
BEST_FIRST walk for 5000005 steps (10 resets) in 5006 ms. (998 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[701, 210, 11, 1757, 552] Max Struct:[+inf, +inf, +inf, +inf, +inf]
[2025-06-01 11:26:20] [INFO ] Flow matrix only has 712 transitions (discarded 537 similar events)
[2025-06-01 11:26:20] [INFO ] Invariant cache hit.
[2025-06-01 11:26:21] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-01 11:26:21] [INFO ] [Real]Absence check using state equation in 347 ms returned sat
[2025-06-01 11:26:21] [INFO ] State equation strengthened by 83 read => feed constraints.
[2025-06-01 11:26:21] [INFO ] [Real]Added 83 Read/Feed constraints in 163 ms returned sat
[2025-06-01 11:26:21] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:26:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-01 11:26:22] [INFO ] [Nat]Absence check using state equation in 385 ms returned sat
[2025-06-01 11:26:22] [INFO ] [Nat]Added 83 Read/Feed constraints in 131 ms returned sat
[2025-06-01 11:26:22] [INFO ] Deduced a trap composed of 131 places in 591 ms of which 7 ms to minimize.
[2025-06-01 11:26:23] [INFO ] Deduced a trap composed of 125 places in 567 ms of which 7 ms to minimize.
[2025-06-01 11:26:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1276 ms
[2025-06-01 11:26:23] [INFO ] Computed and/alt/rep : 338/2038/338 causal constraints (skipped 372 transitions) in 136 ms.
[2025-06-01 11:26:24] [INFO ] Deduced a trap composed of 230 places in 547 ms of which 7 ms to minimize.
[2025-06-01 11:26:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 658 ms
[2025-06-01 11:26:24] [INFO ] Added : 6 causal constraints over 3 iterations in 1146 ms. Result :sat
Minimization took 517 ms.
[2025-06-01 11:26:25] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-01 11:26:25] [INFO ] [Real]Absence check using state equation in 363 ms returned sat
[2025-06-01 11:26:25] [INFO ] [Real]Added 83 Read/Feed constraints in 65 ms returned sat
[2025-06-01 11:26:25] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:26:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2025-06-01 11:26:26] [INFO ] [Nat]Absence check using state equation in 337 ms returned sat
[2025-06-01 11:26:26] [INFO ] [Nat]Added 83 Read/Feed constraints in 72 ms returned sat
[2025-06-01 11:26:27] [INFO ] Deduced a trap composed of 131 places in 575 ms of which 15 ms to minimize.
[2025-06-01 11:26:27] [INFO ] Deduced a trap composed of 123 places in 520 ms of which 6 ms to minimize.
[2025-06-01 11:26:28] [INFO ] Deduced a trap composed of 121 places in 520 ms of which 6 ms to minimize.
[2025-06-01 11:26:28] [INFO ] Deduced a trap composed of 94 places in 583 ms of which 4 ms to minimize.
[2025-06-01 11:26:29] [INFO ] Deduced a trap composed of 82 places in 600 ms of which 6 ms to minimize.
[2025-06-01 11:26:30] [INFO ] Deduced a trap composed of 80 places in 593 ms of which 7 ms to minimize.
[2025-06-01 11:26:30] [INFO ] Deduced a trap composed of 75 places in 573 ms of which 7 ms to minimize.
[2025-06-01 11:26:30] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4288 ms
[2025-06-01 11:26:30] [INFO ] Computed and/alt/rep : 338/2038/338 causal constraints (skipped 372 transitions) in 132 ms.
[2025-06-01 11:26:31] [INFO ] Added : 25 causal constraints over 9 iterations in 949 ms. Result :sat
Minimization took 603 ms.
[2025-06-01 11:26:32] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-01 11:26:32] [INFO ] [Real]Absence check using state equation in 337 ms returned sat
[2025-06-01 11:26:32] [INFO ] [Real]Added 83 Read/Feed constraints in 33 ms returned sat
[2025-06-01 11:26:32] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:26:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-01 11:26:33] [INFO ] [Nat]Absence check using state equation in 340 ms returned sat
[2025-06-01 11:26:33] [INFO ] [Nat]Added 83 Read/Feed constraints in 104 ms returned sat
[2025-06-01 11:26:33] [INFO ] Deduced a trap composed of 72 places in 409 ms of which 8 ms to minimize.
[2025-06-01 11:26:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 487 ms
[2025-06-01 11:26:34] [INFO ] Computed and/alt/rep : 338/2038/338 causal constraints (skipped 372 transitions) in 136 ms.
[2025-06-01 11:26:34] [INFO ] Added : 3 causal constraints over 1 iterations in 299 ms. Result :sat
Minimization took 635 ms.
[2025-06-01 11:26:34] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-01 11:26:35] [INFO ] [Real]Absence check using state equation in 256 ms returned sat
[2025-06-01 11:26:35] [INFO ] [Real]Added 83 Read/Feed constraints in 35 ms returned sat
[2025-06-01 11:26:35] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:26:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-01 11:26:35] [INFO ] [Nat]Absence check using state equation in 259 ms returned sat
[2025-06-01 11:26:35] [INFO ] [Nat]Added 83 Read/Feed constraints in 34 ms returned sat
[2025-06-01 11:26:36] [INFO ] Deduced a trap composed of 72 places in 443 ms of which 6 ms to minimize.
[2025-06-01 11:26:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 512 ms
[2025-06-01 11:26:36] [INFO ] Computed and/alt/rep : 338/2038/338 causal constraints (skipped 372 transitions) in 126 ms.
[2025-06-01 11:26:36] [INFO ] Added : 7 causal constraints over 4 iterations in 480 ms. Result :sat
Minimization took 534 ms.
[2025-06-01 11:26:37] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-01 11:26:37] [INFO ] [Real]Absence check using state equation in 381 ms returned sat
[2025-06-01 11:26:37] [INFO ] [Real]Added 83 Read/Feed constraints in 90 ms returned sat
[2025-06-01 11:26:37] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:26:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-01 11:26:38] [INFO ] [Nat]Absence check using state equation in 405 ms returned sat
[2025-06-01 11:26:38] [INFO ] [Nat]Added 83 Read/Feed constraints in 75 ms returned sat
[2025-06-01 11:26:39] [INFO ] Deduced a trap composed of 131 places in 622 ms of which 7 ms to minimize.
[2025-06-01 11:26:39] [INFO ] Deduced a trap composed of 123 places in 600 ms of which 5 ms to minimize.
[2025-06-01 11:26:40] [INFO ] Deduced a trap composed of 125 places in 485 ms of which 6 ms to minimize.
[2025-06-01 11:26:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1862 ms
[2025-06-01 11:26:40] [INFO ] Computed and/alt/rep : 338/2038/338 causal constraints (skipped 372 transitions) in 111 ms.
[2025-06-01 11:26:40] [INFO ] Added : 14 causal constraints over 4 iterations in 479 ms. Result :sat
Minimization took 536 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[701, 210, 11, 1757, 552] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[701, 210, 11, 1757, 552] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Support contains 5 out of 435 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 435/435 places, 1249/1249 transitions.
Applied a total of 0 rules in 90 ms. Remains 435 /435 variables (removed 0) and now considering 1249/1249 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 435/435 places, 1249/1249 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 435/435 places, 1249/1249 transitions.
Applied a total of 0 rules in 90 ms. Remains 435 /435 variables (removed 0) and now considering 1249/1249 (removed 0) transitions.
[2025-06-01 11:26:57] [INFO ] Flow matrix only has 712 transitions (discarded 537 similar events)
[2025-06-01 11:26:57] [INFO ] Invariant cache hit.
[2025-06-01 11:26:58] [INFO ] Implicit Places using invariants in 814 ms returned []
[2025-06-01 11:26:58] [INFO ] Flow matrix only has 712 transitions (discarded 537 similar events)
[2025-06-01 11:26:58] [INFO ] Invariant cache hit.
[2025-06-01 11:26:58] [INFO ] State equation strengthened by 83 read => feed constraints.
[2025-06-01 11:27:01] [INFO ] Implicit Places using invariants and state equation in 3044 ms returned []
Implicit Place search using SMT with State Equation took 3863 ms to find 0 implicit places.
[2025-06-01 11:27:01] [INFO ] Redundant transitions in 117 ms returned []
Running 1247 sub problems to find dead transitions.
[2025-06-01 11:27:01] [INFO ] Flow matrix only has 712 transitions (discarded 537 similar events)
[2025-06-01 11:27:01] [INFO ] Invariant cache hit.
[2025-06-01 11:27:01] [INFO ] State equation strengthened by 83 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1247 unsolved
[2025-06-01 11:27:29] [INFO ] Deduced a trap composed of 135 places in 356 ms of which 5 ms to minimize.
[2025-06-01 11:27:30] [INFO ] Deduced a trap composed of 131 places in 229 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 435/1147 variables, and 5 constraints, problems are : Problem set: 0 solved, 1247 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/435 constraints, ReadFeed: 0/83 constraints, PredecessorRefiner: 1247/1247 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1247 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1247 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/435 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/435 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1247 unsolved
At refinement iteration 3 (OVERLAPS) 712/1147 variables, 435/440 constraints. Problems are: Problem set: 0 solved, 1247 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1147 variables, 83/523 constraints. Problems are: Problem set: 0 solved, 1247 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1147/1147 variables, and 1770 constraints, problems are : Problem set: 0 solved, 1247 unsolved in 31170 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 435/435 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 1247/1247 constraints, Known Traps: 2/2 constraints]
After SMT, in 67388ms problems are : Problem set: 0 solved, 1247 unsolved
Search for dead transitions found 0 dead transitions in 67411ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71494 ms. Remains : 435/435 places, 1249/1249 transitions.
[2025-06-01 11:28:08] [INFO ] Flow matrix only has 712 transitions (discarded 537 similar events)
Found an invariant !
This invariant on transitions {228=1, 330=1, 658=1, 707=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 354=1, 682=1, 711=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :[0, 0, 0, 5, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[701, 210, 11, 1757, 552] Max Struct:[+inf, +inf, +inf, +inf, +inf]
[2025-06-01 11:28:09] [INFO ] Flow matrix only has 712 transitions (discarded 537 similar events)
[2025-06-01 11:28:09] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[701, 210, 11, 1757, 552] Max Struct:[+inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000001 steps (2 resets) in 3534 ms. (282 steps per ms)
BEST_FIRST walk for 5000005 steps (10 resets) in 4881 ms. (1024 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[701, 210, 11, 1757, 552] Max Struct:[+inf, +inf, +inf, +inf, +inf]
[2025-06-01 11:28:17] [INFO ] Flow matrix only has 712 transitions (discarded 537 similar events)
[2025-06-01 11:28:17] [INFO ] Invariant cache hit.
[2025-06-01 11:28:17] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-01 11:28:17] [INFO ] [Real]Absence check using state equation in 269 ms returned sat
[2025-06-01 11:28:17] [INFO ] State equation strengthened by 83 read => feed constraints.
[2025-06-01 11:28:18] [INFO ] [Real]Added 83 Read/Feed constraints in 155 ms returned sat
[2025-06-01 11:28:18] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:28:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-01 11:28:18] [INFO ] [Nat]Absence check using state equation in 397 ms returned sat
[2025-06-01 11:28:18] [INFO ] [Nat]Added 83 Read/Feed constraints in 121 ms returned sat
[2025-06-01 11:28:19] [INFO ] Deduced a trap composed of 131 places in 600 ms of which 5 ms to minimize.
[2025-06-01 11:28:19] [INFO ] Deduced a trap composed of 125 places in 501 ms of which 6 ms to minimize.
[2025-06-01 11:28:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1226 ms
[2025-06-01 11:28:20] [INFO ] Computed and/alt/rep : 338/2038/338 causal constraints (skipped 372 transitions) in 137 ms.
[2025-06-01 11:28:21] [INFO ] Deduced a trap composed of 230 places in 614 ms of which 7 ms to minimize.
[2025-06-01 11:28:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 729 ms
[2025-06-01 11:28:21] [INFO ] Added : 6 causal constraints over 3 iterations in 1221 ms. Result :sat
Minimization took 523 ms.
[2025-06-01 11:28:21] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2025-06-01 11:28:22] [INFO ] [Real]Absence check using state equation in 380 ms returned sat
[2025-06-01 11:28:22] [INFO ] [Real]Added 83 Read/Feed constraints in 75 ms returned sat
[2025-06-01 11:28:22] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:28:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2025-06-01 11:28:22] [INFO ] [Nat]Absence check using state equation in 381 ms returned sat
[2025-06-01 11:28:22] [INFO ] [Nat]Added 83 Read/Feed constraints in 76 ms returned sat
[2025-06-01 11:28:23] [INFO ] Deduced a trap composed of 131 places in 654 ms of which 7 ms to minimize.
[2025-06-01 11:28:24] [INFO ] Deduced a trap composed of 123 places in 605 ms of which 6 ms to minimize.
[2025-06-01 11:28:24] [INFO ] Deduced a trap composed of 121 places in 507 ms of which 7 ms to minimize.
[2025-06-01 11:28:25] [INFO ] Deduced a trap composed of 94 places in 613 ms of which 7 ms to minimize.
[2025-06-01 11:28:26] [INFO ] Deduced a trap composed of 82 places in 579 ms of which 7 ms to minimize.
[2025-06-01 11:28:26] [INFO ] Deduced a trap composed of 80 places in 663 ms of which 8 ms to minimize.
[2025-06-01 11:28:27] [INFO ] Deduced a trap composed of 75 places in 630 ms of which 8 ms to minimize.
[2025-06-01 11:28:27] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4568 ms
[2025-06-01 11:28:27] [INFO ] Computed and/alt/rep : 338/2038/338 causal constraints (skipped 372 transitions) in 139 ms.
[2025-06-01 11:28:28] [INFO ] Added : 25 causal constraints over 9 iterations in 971 ms. Result :sat
Minimization took 597 ms.
[2025-06-01 11:28:29] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-01 11:28:29] [INFO ] [Real]Absence check using state equation in 344 ms returned sat
[2025-06-01 11:28:29] [INFO ] [Real]Added 83 Read/Feed constraints in 49 ms returned sat
[2025-06-01 11:28:29] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:28:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2025-06-01 11:28:30] [INFO ] [Nat]Absence check using state equation in 329 ms returned sat
[2025-06-01 11:28:30] [INFO ] [Nat]Added 83 Read/Feed constraints in 95 ms returned sat
[2025-06-01 11:28:30] [INFO ] Deduced a trap composed of 72 places in 507 ms of which 6 ms to minimize.
[2025-06-01 11:28:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 582 ms
[2025-06-01 11:28:31] [INFO ] Computed and/alt/rep : 338/2038/338 causal constraints (skipped 372 transitions) in 140 ms.
[2025-06-01 11:28:31] [INFO ] Added : 3 causal constraints over 1 iterations in 298 ms. Result :sat
Minimization took 616 ms.
[2025-06-01 11:28:31] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-01 11:28:32] [INFO ] [Real]Absence check using state equation in 247 ms returned sat
[2025-06-01 11:28:32] [INFO ] [Real]Added 83 Read/Feed constraints in 34 ms returned sat
[2025-06-01 11:28:32] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:28:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-01 11:28:32] [INFO ] [Nat]Absence check using state equation in 395 ms returned sat
[2025-06-01 11:28:32] [INFO ] [Nat]Added 83 Read/Feed constraints in 60 ms returned sat
[2025-06-01 11:28:33] [INFO ] Deduced a trap composed of 72 places in 603 ms of which 7 ms to minimize.
[2025-06-01 11:28:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 688 ms
[2025-06-01 11:28:33] [INFO ] Computed and/alt/rep : 338/2038/338 causal constraints (skipped 372 transitions) in 137 ms.
[2025-06-01 11:28:34] [INFO ] Added : 7 causal constraints over 4 iterations in 519 ms. Result :sat
Minimization took 496 ms.
[2025-06-01 11:28:34] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-01 11:28:35] [INFO ] [Real]Absence check using state equation in 375 ms returned sat
[2025-06-01 11:28:35] [INFO ] [Real]Added 83 Read/Feed constraints in 90 ms returned sat
[2025-06-01 11:28:35] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:28:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2025-06-01 11:28:35] [INFO ] [Nat]Absence check using state equation in 389 ms returned sat
[2025-06-01 11:28:35] [INFO ] [Nat]Added 83 Read/Feed constraints in 66 ms returned sat
[2025-06-01 11:28:36] [INFO ] Deduced a trap composed of 131 places in 617 ms of which 7 ms to minimize.
[2025-06-01 11:28:37] [INFO ] Deduced a trap composed of 123 places in 505 ms of which 7 ms to minimize.
[2025-06-01 11:28:37] [INFO ] Deduced a trap composed of 125 places in 503 ms of which 5 ms to minimize.
[2025-06-01 11:28:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1757 ms
[2025-06-01 11:28:37] [INFO ] Computed and/alt/rep : 338/2038/338 causal constraints (skipped 372 transitions) in 130 ms.
[2025-06-01 11:28:38] [INFO ] Added : 14 causal constraints over 4 iterations in 415 ms. Result :sat
Minimization took 397 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[701, 210, 11, 1757, 552] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[701, 210, 14, 1757, 552] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Support contains 5 out of 435 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 435/435 places, 1249/1249 transitions.
Applied a total of 0 rules in 54 ms. Remains 435 /435 variables (removed 0) and now considering 1249/1249 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 435/435 places, 1249/1249 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 435/435 places, 1249/1249 transitions.
Applied a total of 0 rules in 54 ms. Remains 435 /435 variables (removed 0) and now considering 1249/1249 (removed 0) transitions.
[2025-06-01 11:28:54] [INFO ] Flow matrix only has 712 transitions (discarded 537 similar events)
[2025-06-01 11:28:54] [INFO ] Invariant cache hit.
[2025-06-01 11:28:55] [INFO ] Implicit Places using invariants in 654 ms returned []
[2025-06-01 11:28:55] [INFO ] Flow matrix only has 712 transitions (discarded 537 similar events)
[2025-06-01 11:28:55] [INFO ] Invariant cache hit.
[2025-06-01 11:28:55] [INFO ] State equation strengthened by 83 read => feed constraints.
[2025-06-01 11:28:58] [INFO ] Implicit Places using invariants and state equation in 3259 ms returned []
Implicit Place search using SMT with State Equation took 3920 ms to find 0 implicit places.
[2025-06-01 11:28:58] [INFO ] Redundant transitions in 51 ms returned []
Running 1247 sub problems to find dead transitions.
[2025-06-01 11:28:58] [INFO ] Flow matrix only has 712 transitions (discarded 537 similar events)
[2025-06-01 11:28:58] [INFO ] Invariant cache hit.
[2025-06-01 11:28:58] [INFO ] State equation strengthened by 83 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1247 unsolved
[2025-06-01 11:29:25] [INFO ] Deduced a trap composed of 135 places in 434 ms of which 6 ms to minimize.
[2025-06-01 11:29:27] [INFO ] Deduced a trap composed of 131 places in 397 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.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 1.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 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.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 0.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 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 1.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.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 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
timeout
( org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 435/1147 variables, and 5 constraints, problems are : Problem set: 0 solved, 1247 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/435 constraints, ReadFeed: 0/83 constraints, PredecessorRefiner: 1247/1247 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1247 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1247 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/435 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/435 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1247 unsolved
At refinement iteration 3 (OVERLAPS) 712/1147 variables, 435/440 constraints. Problems are: Problem set: 0 solved, 1247 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1147 variables, 83/523 constraints. Problems are: Problem set: 0 solved, 1247 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1147/1147 variables, and 1770 constraints, problems are : Problem set: 0 solved, 1247 unsolved in 31092 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 435/435 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 1247/1247 constraints, Known Traps: 2/2 constraints]
After SMT, in 66742ms problems are : Problem set: 0 solved, 1247 unsolved
Search for dead transitions found 0 dead transitions in 66765ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70802 ms. Remains : 435/435 places, 1249/1249 transitions.
[2025-06-01 11:30:05] [INFO ] Flow matrix only has 712 transitions (discarded 537 similar events)
Found an invariant !
This invariant on transitions {228=1, 330=1, 658=1, 707=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 354=1, 682=1, 711=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 5) seen :[4, 2, 1, 5, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[701, 210, 14, 1757, 552] Max Struct:[+inf, +inf, +inf, +inf, +inf]
[2025-06-01 11:30:06] [INFO ] Flow matrix only has 712 transitions (discarded 537 similar events)
[2025-06-01 11:30:06] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[701, 210, 14, 1757, 552] Max Struct:[+inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 3317 ms. (301 steps per ms)
BEST_FIRST walk for 5000004 steps (10 resets) in 4814 ms. (1038 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[701, 210, 14, 1757, 552] Max Struct:[+inf, +inf, +inf, +inf, +inf]
[2025-06-01 11:30:14] [INFO ] Flow matrix only has 712 transitions (discarded 537 similar events)
[2025-06-01 11:30:14] [INFO ] Invariant cache hit.
[2025-06-01 11:30:14] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-01 11:30:14] [INFO ] [Real]Absence check using state equation in 381 ms returned sat
[2025-06-01 11:30:14] [INFO ] State equation strengthened by 83 read => feed constraints.
[2025-06-01 11:30:14] [INFO ] [Real]Added 83 Read/Feed constraints in 147 ms returned sat
[2025-06-01 11:30:14] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:30:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-01 11:30:15] [INFO ] [Nat]Absence check using state equation in 388 ms returned sat
[2025-06-01 11:30:15] [INFO ] [Nat]Added 83 Read/Feed constraints in 138 ms returned sat
[2025-06-01 11:30:16] [INFO ] Deduced a trap composed of 131 places in 640 ms of which 7 ms to minimize.
[2025-06-01 11:30:16] [INFO ] Deduced a trap composed of 125 places in 625 ms of which 6 ms to minimize.
[2025-06-01 11:30:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1384 ms
[2025-06-01 11:30:17] [INFO ] Computed and/alt/rep : 338/2038/338 causal constraints (skipped 372 transitions) in 134 ms.
[2025-06-01 11:30:17] [INFO ] Deduced a trap composed of 230 places in 584 ms of which 8 ms to minimize.
[2025-06-01 11:30:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 697 ms
[2025-06-01 11:30:18] [INFO ] Added : 6 causal constraints over 3 iterations in 1186 ms. Result :sat
Minimization took 537 ms.
[2025-06-01 11:30:18] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-01 11:30:19] [INFO ] [Real]Absence check using state equation in 320 ms returned sat
[2025-06-01 11:30:19] [INFO ] [Real]Added 83 Read/Feed constraints in 52 ms returned sat
[2025-06-01 11:30:19] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:30:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-01 11:30:19] [INFO ] [Nat]Absence check using state equation in 318 ms returned sat
[2025-06-01 11:30:19] [INFO ] [Nat]Added 83 Read/Feed constraints in 46 ms returned sat
[2025-06-01 11:30:20] [INFO ] Deduced a trap composed of 131 places in 558 ms of which 6 ms to minimize.
[2025-06-01 11:30:20] [INFO ] Deduced a trap composed of 123 places in 594 ms of which 7 ms to minimize.
[2025-06-01 11:30:21] [INFO ] Deduced a trap composed of 121 places in 589 ms of which 7 ms to minimize.
[2025-06-01 11:30:22] [INFO ] Deduced a trap composed of 94 places in 589 ms of which 7 ms to minimize.
[2025-06-01 11:30:22] [INFO ] Deduced a trap composed of 82 places in 566 ms of which 6 ms to minimize.
[2025-06-01 11:30:23] [INFO ] Deduced a trap composed of 80 places in 557 ms of which 7 ms to minimize.
[2025-06-01 11:30:23] [INFO ] Deduced a trap composed of 75 places in 525 ms of which 7 ms to minimize.
[2025-06-01 11:30:24] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4270 ms
[2025-06-01 11:30:24] [INFO ] Computed and/alt/rep : 338/2038/338 causal constraints (skipped 372 transitions) in 100 ms.
[2025-06-01 11:30:24] [INFO ] Added : 25 causal constraints over 9 iterations in 839 ms. Result :sat
Minimization took 573 ms.
[2025-06-01 11:30:25] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2025-06-01 11:30:25] [INFO ] [Real]Absence check using state equation in 359 ms returned sat
[2025-06-01 11:30:26] [INFO ] [Real]Added 83 Read/Feed constraints in 55 ms returned sat
[2025-06-01 11:30:26] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:30:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-01 11:30:26] [INFO ] [Nat]Absence check using state equation in 320 ms returned sat
[2025-06-01 11:30:26] [INFO ] [Nat]Added 83 Read/Feed constraints in 85 ms returned sat
[2025-06-01 11:30:27] [INFO ] Deduced a trap composed of 72 places in 540 ms of which 5 ms to minimize.
[2025-06-01 11:30:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 604 ms
[2025-06-01 11:30:27] [INFO ] Computed and/alt/rep : 338/2038/338 causal constraints (skipped 372 transitions) in 131 ms.
[2025-06-01 11:30:27] [INFO ] Added : 3 causal constraints over 1 iterations in 292 ms. Result :sat
Minimization took 533 ms.
[2025-06-01 11:30:28] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-01 11:30:28] [INFO ] [Real]Absence check using state equation in 351 ms returned sat
[2025-06-01 11:30:28] [INFO ] [Real]Added 83 Read/Feed constraints in 50 ms returned sat
[2025-06-01 11:30:28] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:30:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-01 11:30:28] [INFO ] [Nat]Absence check using state equation in 243 ms returned sat
[2025-06-01 11:30:28] [INFO ] [Nat]Added 83 Read/Feed constraints in 33 ms returned sat
[2025-06-01 11:30:29] [INFO ] Deduced a trap composed of 72 places in 522 ms of which 7 ms to minimize.
[2025-06-01 11:30:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 572 ms
[2025-06-01 11:30:29] [INFO ] Computed and/alt/rep : 338/2038/338 causal constraints (skipped 372 transitions) in 86 ms.
[2025-06-01 11:30:29] [INFO ] Added : 7 causal constraints over 4 iterations in 431 ms. Result :sat
Minimization took 539 ms.
[2025-06-01 11:30:30] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-01 11:30:31] [INFO ] [Real]Absence check using state equation in 338 ms returned sat
[2025-06-01 11:30:31] [INFO ] [Real]Added 83 Read/Feed constraints in 83 ms returned sat
[2025-06-01 11:30:31] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:30:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-01 11:30:31] [INFO ] [Nat]Absence check using state equation in 258 ms returned sat
[2025-06-01 11:30:31] [INFO ] [Nat]Added 83 Read/Feed constraints in 42 ms returned sat
[2025-06-01 11:30:32] [INFO ] Deduced a trap composed of 131 places in 550 ms of which 7 ms to minimize.
[2025-06-01 11:30:32] [INFO ] Deduced a trap composed of 123 places in 471 ms of which 4 ms to minimize.
[2025-06-01 11:30:33] [INFO ] Deduced a trap composed of 125 places in 499 ms of which 5 ms to minimize.
[2025-06-01 11:30:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1648 ms
[2025-06-01 11:30:33] [INFO ] Computed and/alt/rep : 338/2038/338 causal constraints (skipped 372 transitions) in 136 ms.
[2025-06-01 11:30:33] [INFO ] Added : 14 causal constraints over 4 iterations in 515 ms. Result :sat
Minimization took 568 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[701, 210, 14, 1757, 552] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[701, 210, 14, 1757, 552] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Support contains 5 out of 435 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 435/435 places, 1249/1249 transitions.
Applied a total of 0 rules in 91 ms. Remains 435 /435 variables (removed 0) and now considering 1249/1249 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 435/435 places, 1249/1249 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 435/435 places, 1249/1249 transitions.
Applied a total of 0 rules in 55 ms. Remains 435 /435 variables (removed 0) and now considering 1249/1249 (removed 0) transitions.
[2025-06-01 11:30:50] [INFO ] Flow matrix only has 712 transitions (discarded 537 similar events)
[2025-06-01 11:30:50] [INFO ] Invariant cache hit.
[2025-06-01 11:30:51] [INFO ] Implicit Places using invariants in 843 ms returned []
[2025-06-01 11:30:51] [INFO ] Flow matrix only has 712 transitions (discarded 537 similar events)
[2025-06-01 11:30:51] [INFO ] Invariant cache hit.
[2025-06-01 11:30:51] [INFO ] State equation strengthened by 83 read => feed constraints.
[2025-06-01 11:30:53] [INFO ] Implicit Places using invariants and state equation in 2644 ms returned []
Implicit Place search using SMT with State Equation took 3488 ms to find 0 implicit places.
[2025-06-01 11:30:54] [INFO ] Redundant transitions in 34 ms returned []
Running 1247 sub problems to find dead transitions.
[2025-06-01 11:30:54] [INFO ] Flow matrix only has 712 transitions (discarded 537 similar events)
[2025-06-01 11:30:54] [INFO ] Invariant cache hit.
[2025-06-01 11:30:54] [INFO ] State equation strengthened by 83 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1247 unsolved
[2025-06-01 11:31:22] [INFO ] Deduced a trap composed of 135 places in 381 ms of which 5 ms to minimize.
[2025-06-01 11:31:24] [INFO ] Deduced a trap composed of 131 places in 390 ms of which 6 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 435/1147 variables, and 5 constraints, problems are : Problem set: 0 solved, 1247 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/435 constraints, ReadFeed: 0/83 constraints, PredecessorRefiner: 1247/1247 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1247 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1247 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/435 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/435 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1247 unsolved
At refinement iteration 3 (OVERLAPS) 712/1147 variables, 435/440 constraints. Problems are: Problem set: 0 solved, 1247 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1147 variables, 83/523 constraints. Problems are: Problem set: 0 solved, 1247 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1147/1147 variables, and 1770 constraints, problems are : Problem set: 0 solved, 1247 unsolved in 31054 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 435/435 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 1247/1247 constraints, Known Traps: 2/2 constraints]
After SMT, in 67084ms problems are : Problem set: 0 solved, 1247 unsolved
Search for dead transitions found 0 dead transitions in 67105ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70696 ms. Remains : 435/435 places, 1249/1249 transitions.
[2025-06-01 11:32:01] [INFO ] Flow matrix only has 712 transitions (discarded 537 similar events)
Found an invariant !
This invariant on transitions {228=1, 330=1, 658=1, 707=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 354=1, 682=1, 711=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :[0, 0, 1, 0, 1]
Current structural bounds on expressions (after cover walk) : Max Seen:[701, 210, 14, 1757, 552] Max Struct:[+inf, +inf, +inf, +inf, +inf]
RANDOM walk for 40006 steps (8 resets) in 1648 ms. (24 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 223 ms. (178 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 283 ms. (140 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 219 ms. (181 steps per ms) remains 5/5 properties
[2025-06-01 11:32:03] [INFO ] Flatten gal took : 513 ms
[2025-06-01 11:32:03] [INFO ] Flatten gal took : 219 ms
[2025-06-01 11:32:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15335655397830008434.gal : 85 ms
[2025-06-01 11:32:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality359847972281176984.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/ReachabilityCardinality15335655397830008434.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality359847972281176984.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/ReachabilityCardinality359847972281176984.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :31 after 1981
Interrupted probabilistic random walk after 127451 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :0 out of 5
Probabilistic random walk after 127451 steps, saw 78172 distinct states, run finished after 3010 ms. (steps per millisecond=42 ) properties seen :0
[2025-06-01 11:32:05] [INFO ] Flow matrix only has 712 transitions (discarded 537 similar events)
[2025-06-01 11:32:05] [INFO ] Invariant cache hit.
[2025-06-01 11:32:05] [INFO ] State equation strengthened by 83 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 13/18 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 373/391 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/391 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 10/401 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/401 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 618/1019 variables, 348/371 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1019 variables, 82/453 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1019 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 62/1081 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1081 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 66/1147 variables, 67/521 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1147 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :1981 after 1.21487e+06
At refinement iteration 16 (OVERLAPS) 0/1147 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1147/1147 variables, and 521 constraints, problems are : Problem set: 0 solved, 5 unsolved in 928 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 435/435 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 13/18 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 373/391 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/391 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 10/401 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/401 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 618/1019 variables, 348/374 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1019 variables, 82/456 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1019 variables, 2/458 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1019 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 62/1081 variables, 1/459 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1081 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 66/1147 variables, 67/526 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1147 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 0/1147 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1147/1147 variables, and 526 constraints, problems are : Problem set: 0 solved, 5 unsolved in 972 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 435/435 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 1925ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :1.21487e+06 after 3.49326e+10
Parikh walk visited 0 properties in 30008 ms.
Support contains 5 out of 435 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 435/435 places, 1249/1249 transitions.
Applied a total of 0 rules in 58 ms. Remains 435 /435 variables (removed 0) and now considering 1249/1249 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 435/435 places, 1249/1249 transitions.
RANDOM walk for 40001 steps (8 resets) in 450 ms. (88 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 112 ms. (354 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 125 ms. (317 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 4/4 properties
[2025-06-01 11:32:37] [INFO ] Flow matrix only has 712 transitions (discarded 537 similar events)
[2025-06-01 11:32:37] [INFO ] Invariant cache hit.
[2025-06-01 11:32:37] [INFO ] State equation strengthened by 83 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 9/13 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 372/385 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/385 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 10/395 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 621/1016 variables, 349/368 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1016 variables, 82/450 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1016 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 62/1078 variables, 1/451 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1078 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 69/1147 variables, 69/520 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1147 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1147 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/1147 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1147/1147 variables, and 521 constraints, problems are : Problem set: 0 solved, 4 unsolved in 838 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 435/435 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 9/13 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 372/385 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/385 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/385 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 10/395 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 621/1016 variables, 349/371 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1016 variables, 82/453 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1016 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1016 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 62/1078 variables, 1/455 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1078 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 69/1147 variables, 69/524 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1147 variables, 1/525 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1147 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/1147 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1147/1147 variables, and 525 constraints, problems are : Problem set: 0 solved, 4 unsolved in 907 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 435/435 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 1780ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :3.49326e+10 after 4.28501e+17
Detected timeout of ITS tools.
[2025-06-01 11:32:53] [INFO ] Flatten gal took : 86 ms
[2025-06-01 11:32:53] [INFO ] Applying decomposition
[2025-06-01 11:32:53] [INFO ] Flatten gal took : 79 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/graph633132575548002722.txt' '-o' '/tmp/graph633132575548002722.bin' '-w' '/tmp/graph633132575548002722.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph633132575548002722.bin' '-l' '-1' '-v' '-w' '/tmp/graph633132575548002722.weights' '-q' '0' '-e' '0.001'
[2025-06-01 11:32:54] [INFO ] Decomposing Gal with order
[2025-06-01 11:32:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 11:32:54] [INFO ] Removed a total of 2133 redundant transitions.
[2025-06-01 11:32:54] [INFO ] Flatten gal took : 256 ms
[2025-06-01 11:32:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 870 labels/synchronizations in 104 ms.
[2025-06-01 11:32:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15959764198415256500.gal : 21 ms
[2025-06-01 11:32:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7525999978415691766.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/ReachabilityCardinality15959764198415256500.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7525999978415691766.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/ReachabilityCardinality7525999978415691766.prop.
Parikh walk visited 0 properties in 30000 ms.
Support contains 4 out of 435 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 435/435 places, 1249/1249 transitions.
Graph (complete) has 2149 edges and 435 vertex of which 432 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 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 432 transition count 1244
Applied a total of 6 rules in 77 ms. Remains 432 /435 variables (removed 3) and now considering 1244/1249 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 432/435 places, 1244/1249 transitions.
RANDOM walk for 40001 steps (8 resets) in 297 ms. (134 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 125456 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :0 out of 4
Probabilistic random walk after 125456 steps, saw 76948 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :0
[2025-06-01 11:33:13] [INFO ] Flow matrix only has 707 transitions (discarded 537 similar events)
// Phase 1: matrix 707 rows 432 cols
[2025-06-01 11:33:13] [INFO ] Computed 3 invariants in 12 ms
[2025-06-01 11:33:13] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 9/13 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 370/383 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 10/393 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 618/1011 variables, 348/367 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1011 variables, 80/447 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1011 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 62/1073 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1073 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 66/1139 variables, 67/515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1139 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/1139 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1139/1139 variables, and 515 constraints, problems are : Problem set: 0 solved, 4 unsolved in 924 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 432/432 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 9/13 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 370/383 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 10/393 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 618/1011 variables, 348/370 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1011 variables, 80/450 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1011 variables, 1/451 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1011 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 62/1073 variables, 1/452 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1073 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 66/1139 variables, 67/519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1139 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/1139 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1139/1139 variables, and 519 constraints, problems are : Problem set: 0 solved, 4 unsolved in 808 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 432/432 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 1760ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Detected timeout of ITS tools.
Parikh walk visited 0 properties in 30001 ms.
Support contains 4 out of 432 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 432/432 places, 1244/1244 transitions.
Applied a total of 0 rules in 59 ms. Remains 432 /432 variables (removed 0) and now considering 1244/1244 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 432/432 places, 1244/1244 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 432/432 places, 1244/1244 transitions.
Applied a total of 0 rules in 52 ms. Remains 432 /432 variables (removed 0) and now considering 1244/1244 (removed 0) transitions.
[2025-06-01 11:33:44] [INFO ] Flow matrix only has 707 transitions (discarded 537 similar events)
[2025-06-01 11:33:44] [INFO ] Invariant cache hit.
[2025-06-01 11:33:45] [INFO ] Implicit Places using invariants in 714 ms returned []
[2025-06-01 11:33:45] [INFO ] Flow matrix only has 707 transitions (discarded 537 similar events)
[2025-06-01 11:33:45] [INFO ] Invariant cache hit.
[2025-06-01 11:33:46] [INFO ] State equation strengthened by 80 read => feed constraints.
[2025-06-01 11:33:49] [INFO ] Implicit Places using invariants and state equation in 3461 ms returned []
Implicit Place search using SMT with State Equation took 4178 ms to find 0 implicit places.
[2025-06-01 11:33:49] [INFO ] Redundant transitions in 37 ms returned []
Running 1242 sub problems to find dead transitions.
[2025-06-01 11:33:49] [INFO ] Flow matrix only has 707 transitions (discarded 537 similar events)
[2025-06-01 11:33:49] [INFO ] Invariant cache hit.
[2025-06-01 11:33:49] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1242 unsolved
[2025-06-01 11:34:19] [INFO ] Deduced a trap composed of 135 places in 422 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 432/1139 variables, and 4 constraints, problems are : Problem set: 0 solved, 1242 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/432 constraints, ReadFeed: 0/80 constraints, PredecessorRefiner: 1242/1242 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1242 unsolved
[2025-06-01 11:34:33] [INFO ] Deduced a trap composed of 131 places in 441 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/432 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 432/1139 variables, and 5 constraints, problems are : Problem set: 0 solved, 1242 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/432 constraints, ReadFeed: 0/80 constraints, PredecessorRefiner: 0/1242 constraints, Known Traps: 2/2 constraints]
After SMT, in 66630ms problems are : Problem set: 0 solved, 1242 unsolved
Search for dead transitions found 0 dead transitions in 66658ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70936 ms. Remains : 432/432 places, 1244/1244 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[701, 210, 14, 1757, 552] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Starting property specific reduction for FunctionPointer-PT-c016-UpperBounds-01
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2025-06-01 11:34:55] [INFO ] Flow matrix only has 712 transitions (discarded 537 similar events)
// Phase 1: matrix 712 rows 435 cols
[2025-06-01 11:34:55] [INFO ] Computed 3 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 41 ms. (238 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2025-06-01 11:34:55] [INFO ] Flow matrix only has 712 transitions (discarded 537 similar events)
[2025-06-01 11:34:55] [INFO ] Invariant cache hit.
[2025-06-01 11:34:56] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-01 11:34:56] [INFO ] [Real]Absence check using state equation in 354 ms returned sat
[2025-06-01 11:34:56] [INFO ] State equation strengthened by 83 read => feed constraints.
[2025-06-01 11:34:56] [INFO ] [Real]Added 83 Read/Feed constraints in 57 ms returned sat
[2025-06-01 11:34:56] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:34:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2025-06-01 11:34:56] [INFO ] [Nat]Absence check using state equation in 341 ms returned sat
[2025-06-01 11:34:57] [INFO ] [Nat]Added 83 Read/Feed constraints in 62 ms returned sat
[2025-06-01 11:34:57] [INFO ] Computed and/alt/rep : 338/2038/338 causal constraints (skipped 372 transitions) in 94 ms.
[2025-06-01 11:34:57] [INFO ] Added : 7 causal constraints over 4 iterations in 474 ms. Result :sat
Minimization took 499 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:[1] Max Struct:[+inf]
Support contains 1 out of 435 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 435/435 places, 1249/1249 transitions.
Graph (complete) has 2149 edges and 435 vertex of which 432 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 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 432 transition count 1244
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 9 place count 429 transition count 1238
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 429 transition count 1238
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 427 transition count 1232
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 427 transition count 1232
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 425 transition count 1226
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 425 transition count 1226
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 423 transition count 1222
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 423 transition count 1222
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 421 transition count 1218
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 421 transition count 1218
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 419 transition count 1214
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 419 transition count 1214
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 417 transition count 1210
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 417 transition count 1210
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 415 transition count 1206
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 415 transition count 1206
Applied a total of 40 rules in 143 ms. Remains 415 /435 variables (removed 20) and now considering 1206/1249 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 415/435 places, 1206/1249 transitions.
[2025-06-01 11:34:58] [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 94 ms. (steps per millisecond=106 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2025-06-01 11:34:59] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
// Phase 1: matrix 680 rows 415 cols
[2025-06-01 11:34:59] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[+inf]
RANDOM walk for 1000002 steps (2 resets) in 3201 ms. (312 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 961 ms. (1039 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2025-06-01 11:35:03] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 11:35:03] [INFO ] Invariant cache hit.
[2025-06-01 11:35:03] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-01 11:35:03] [INFO ] [Real]Absence check using state equation in 313 ms returned sat
[2025-06-01 11:35:03] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-01 11:35:03] [INFO ] [Real]Added 74 Read/Feed constraints in 46 ms returned sat
[2025-06-01 11:35:03] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:35:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2025-06-01 11:35:04] [INFO ] [Nat]Absence check using state equation in 361 ms returned sat
[2025-06-01 11:35:04] [INFO ] [Nat]Added 74 Read/Feed constraints in 50 ms returned sat
[2025-06-01 11:35:04] [INFO ] Deduced a trap composed of 70 places in 554 ms of which 6 ms to minimize.
[2025-06-01 11:35:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 670 ms
[2025-06-01 11:35:05] [INFO ] Computed and/alt/rep : 333/1252/331 causal constraints (skipped 347 transitions) in 117 ms.
[2025-06-01 11:35:05] [INFO ] Deduced a trap composed of 72 places in 543 ms of which 5 ms to minimize.
[2025-06-01 11:35:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 636 ms
[2025-06-01 11:35:06] [INFO ] Added : 4 causal constraints over 2 iterations in 1005 ms. Result :sat
Minimization took 414 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] 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 84 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 85 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 11:35:06] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 11:35:06] [INFO ] Invariant cache hit.
[2025-06-01 11:35:07] [INFO ] Implicit Places using invariants in 790 ms returned []
[2025-06-01 11:35:07] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 11:35:07] [INFO ] Invariant cache hit.
[2025-06-01 11:35:07] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-01 11:35:10] [INFO ] Implicit Places using invariants and state equation in 2574 ms returned []
Implicit Place search using SMT with State Equation took 3379 ms to find 0 implicit places.
[2025-06-01 11:35:10] [INFO ] Redundant transitions in 35 ms returned []
Running 1204 sub problems to find dead transitions.
[2025-06-01 11:35:10] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 11:35:10] [INFO ] Invariant cache hit.
[2025-06-01 11:35:10] [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 11:35:35] [INFO ] Deduced a trap composed of 135 places in 400 ms of which 6 ms to minimize.
[2025-06-01 11:35:36] [INFO ] Deduced a trap composed of 131 places in 401 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 415/1095 variables, and 5 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: 2/2 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, 2/5 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/415 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 3 (OVERLAPS) 680/1095 variables, 415/420 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1095 variables, 74/494 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 1698 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 30854 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: 2/2 constraints]
After SMT, in 66013ms problems are : Problem set: 0 solved, 1204 unsolved
Search for dead transitions found 0 dead transitions in 66036ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69556 ms. Remains : 415/415 places, 1206/1206 transitions.
[2025-06-01 11:36:16] [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 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2025-06-01 11:36:16] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 11:36:16] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 3225 ms. (309 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 895 ms. (1116 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[677] Max Struct:[+inf]
[2025-06-01 11:36:20] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 11:36:20] [INFO ] Invariant cache hit.
[2025-06-01 11:36:20] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-01 11:36:21] [INFO ] [Real]Absence check using state equation in 246 ms returned sat
[2025-06-01 11:36:21] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-01 11:36:21] [INFO ] [Real]Added 74 Read/Feed constraints in 44 ms returned sat
[2025-06-01 11:36:21] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:36:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-01 11:36:21] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
[2025-06-01 11:36:21] [INFO ] [Nat]Added 74 Read/Feed constraints in 28 ms returned sat
[2025-06-01 11:36:21] [INFO ] Deduced a trap composed of 70 places in 349 ms of which 4 ms to minimize.
[2025-06-01 11:36:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 398 ms
[2025-06-01 11:36:22] [INFO ] Computed and/alt/rep : 333/1252/331 causal constraints (skipped 347 transitions) in 85 ms.
[2025-06-01 11:36:22] [INFO ] Deduced a trap composed of 73 places in 505 ms of which 7 ms to minimize.
[2025-06-01 11:36:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 588 ms
[2025-06-01 11:36:22] [INFO ] Added : 5 causal constraints over 2 iterations in 890 ms. Result :sat
Minimization took 480 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[677] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[677] 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 64 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 64 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 49 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2025-06-01 11:36:25] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 11:36:25] [INFO ] Invariant cache hit.
[2025-06-01 11:36:25] [INFO ] Implicit Places using invariants in 636 ms returned []
[2025-06-01 11:36:25] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 11:36:25] [INFO ] Invariant cache hit.
[2025-06-01 11:36:26] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-01 11:36:28] [INFO ] Implicit Places using invariants and state equation in 2275 ms returned []
Implicit Place search using SMT with State Equation took 2913 ms to find 0 implicit places.
[2025-06-01 11:36:28] [INFO ] Redundant transitions in 22 ms returned []
Running 1204 sub problems to find dead transitions.
[2025-06-01 11:36:28] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 11:36:28] [INFO ] Invariant cache hit.
[2025-06-01 11:36:28] [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 11:36:47] [INFO ] Deduced a trap composed of 135 places in 253 ms of which 4 ms to minimize.
[2025-06-01 11:36:48] [INFO ] Deduced a trap composed of 131 places in 241 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/415 variables, 2/5 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 5 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 30024 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: 2/2 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, 2/5 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/415 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 3 (OVERLAPS) 680/1095 variables, 415/420 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1095 variables, 74/494 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 1698 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 30930 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: 2/2 constraints]
After SMT, in 66186ms problems are : Problem set: 0 solved, 1204 unsolved
Search for dead transitions found 0 dead transitions in 66201ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69194 ms. Remains : 415/415 places, 1206/1206 transitions.
[2025-06-01 11:37:34] [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 62 ms. (steps per millisecond=161 ) properties (out of 1) seen :[5]
Current structural bounds on expressions (after cover walk) : Max Seen:[677] Max Struct:[+inf]
[2025-06-01 11:37:35] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 11:37:35] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[677] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 3409 ms. (293 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 977 ms. (1022 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[788] Max Struct:[+inf]
[2025-06-01 11:37:39] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 11:37:39] [INFO ] Invariant cache hit.
[2025-06-01 11:37:39] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2025-06-01 11:37:39] [INFO ] [Real]Absence check using state equation in 302 ms returned sat
[2025-06-01 11:37:39] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-01 11:37:39] [INFO ] [Real]Added 74 Read/Feed constraints in 56 ms returned sat
[2025-06-01 11:37:39] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:37:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2025-06-01 11:37:40] [INFO ] [Nat]Absence check using state equation in 302 ms returned sat
[2025-06-01 11:37:40] [INFO ] [Nat]Added 74 Read/Feed constraints in 34 ms returned sat
[2025-06-01 11:37:40] [INFO ] Deduced a trap composed of 70 places in 446 ms of which 6 ms to minimize.
[2025-06-01 11:37:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 506 ms
[2025-06-01 11:37:41] [INFO ] Computed and/alt/rep : 333/1252/331 causal constraints (skipped 347 transitions) in 93 ms.
[2025-06-01 11:37:41] [INFO ] Deduced a trap composed of 73 places in 397 ms of which 4 ms to minimize.
[2025-06-01 11:37:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 460 ms
[2025-06-01 11:37:41] [INFO ] Added : 5 causal constraints over 2 iterations in 761 ms. Result :sat
Minimization took 339 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[788] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[788] 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 70 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 70 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 72 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2025-06-01 11:37:44] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 11:37:44] [INFO ] Invariant cache hit.
[2025-06-01 11:37:45] [INFO ] Implicit Places using invariants in 639 ms returned []
[2025-06-01 11:37:45] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 11:37:45] [INFO ] Invariant cache hit.
[2025-06-01 11:37:45] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-01 11:37:47] [INFO ] Implicit Places using invariants and state equation in 2324 ms returned []
Implicit Place search using SMT with State Equation took 2967 ms to find 0 implicit places.
[2025-06-01 11:37:47] [INFO ] Redundant transitions in 22 ms returned []
Running 1204 sub problems to find dead transitions.
[2025-06-01 11:37:47] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 11:37:47] [INFO ] Invariant cache hit.
[2025-06-01 11:37:47] [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 11:38:11] [INFO ] Deduced a trap composed of 135 places in 282 ms of which 4 ms to minimize.
[2025-06-01 11:38:12] [INFO ] Deduced a trap composed of 131 places in 306 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 415/1095 variables, and 5 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 30046 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: 2/2 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, 2/5 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/415 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 3 (OVERLAPS) 680/1095 variables, 415/420 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1095 variables, 74/494 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 1698 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 31019 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: 2/2 constraints]
After SMT, in 66460ms problems are : Problem set: 0 solved, 1204 unsolved
Search for dead transitions found 0 dead transitions in 66473ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69544 ms. Remains : 415/415 places, 1206/1206 transitions.
[2025-06-01 11:38:53] [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 75 ms. (steps per millisecond=133 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[788] Max Struct:[+inf]
[2025-06-01 11:38:54] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 11:38:54] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[788] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 3187 ms. (313 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1272 ms. (785 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[788] Max Struct:[+inf]
[2025-06-01 11:38:58] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 11:38:58] [INFO ] Invariant cache hit.
[2025-06-01 11:38:59] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2025-06-01 11:38:59] [INFO ] [Real]Absence check using state equation in 324 ms returned sat
[2025-06-01 11:38:59] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-01 11:38:59] [INFO ] [Real]Added 74 Read/Feed constraints in 66 ms returned sat
[2025-06-01 11:38:59] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:38:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-01 11:38:59] [INFO ] [Nat]Absence check using state equation in 317 ms returned sat
[2025-06-01 11:38:59] [INFO ] [Nat]Added 74 Read/Feed constraints in 42 ms returned sat
[2025-06-01 11:39:00] [INFO ] Deduced a trap composed of 70 places in 593 ms of which 7 ms to minimize.
[2025-06-01 11:39:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 671 ms
[2025-06-01 11:39:00] [INFO ] Computed and/alt/rep : 333/1252/331 causal constraints (skipped 347 transitions) in 130 ms.
[2025-06-01 11:39:01] [INFO ] Deduced a trap composed of 73 places in 600 ms of which 6 ms to minimize.
[2025-06-01 11:39:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 699 ms
[2025-06-01 11:39:01] [INFO ] Added : 5 causal constraints over 2 iterations in 1158 ms. Result :sat
Minimization took 517 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[788] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[788] 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 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.
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.
[2025-06-01 11:39:04] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 11:39:04] [INFO ] Invariant cache hit.
[2025-06-01 11:39:05] [INFO ] Implicit Places using invariants in 986 ms returned []
[2025-06-01 11:39:05] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 11:39:05] [INFO ] Invariant cache hit.
[2025-06-01 11:39:06] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-01 11:39:08] [INFO ] Implicit Places using invariants and state equation in 2949 ms returned []
Implicit Place search using SMT with State Equation took 3949 ms to find 0 implicit places.
[2025-06-01 11:39:08] [INFO ] Redundant transitions in 35 ms returned []
Running 1204 sub problems to find dead transitions.
[2025-06-01 11:39:08] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 11:39:08] [INFO ] Invariant cache hit.
[2025-06-01 11:39:08] [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 11:39:35] [INFO ] Deduced a trap composed of 135 places in 399 ms of which 6 ms to minimize.
[2025-06-01 11:39:35] [INFO ] Deduced a trap composed of 131 places in 260 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 415/1095 variables, and 5 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: 2/2 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, 2/5 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/415 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 3 (OVERLAPS) 680/1095 variables, 415/420 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1095 variables, 74/494 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 1698 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 31110 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: 2/2 constraints]
After SMT, in 66672ms problems are : Problem set: 0 solved, 1204 unsolved
Search for dead transitions found 0 dead transitions in 66694ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70776 ms. Remains : 415/415 places, 1206/1206 transitions.
[2025-06-01 11:40:15] [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 105 ms. (steps per millisecond=95 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[788] Max Struct:[+inf]
RANDOM walk for 40003 steps (8 resets) in 397 ms. (100 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 1/1 properties
[2025-06-01 11:40:16] [INFO ] Flatten gal took : 189 ms
[2025-06-01 11:40:16] [INFO ] Flatten gal took : 88 ms
[2025-06-01 11:40:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7320954077855088123.gal : 20 ms
[2025-06-01 11:40:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality97946174243840279.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/ReachabilityCardinality7320954077855088123.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality97946174243840279.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 ...326
Loading property file /tmp/ReachabilityCardinality97946174243840279.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.24463e+06
Interrupted probabilistic random walk after 345460 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :0 out of 1
Probabilistic random walk after 345460 steps, saw 211841 distinct states, run finished after 3003 ms. (steps per millisecond=115 ) properties seen :0
[2025-06-01 11:40:19] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 11:40:19] [INFO ] Invariant cache hit.
[2025-06-01 11:40:19] [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 672 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 693 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 1382ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2946 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 40010 steps (8 resets) in 152 ms. (261 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.24463e+06 after 3.74365e+10
Interrupted probabilistic random walk after 401876 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :0 out of 1
Probabilistic random walk after 401876 steps, saw 246431 distinct states, run finished after 3001 ms. (steps per millisecond=133 ) properties seen :0
[2025-06-01 11:40:26] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 11:40:26] [INFO ] Invariant cache hit.
[2025-06-01 11:40:26] [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 542 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 707 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 1263ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2817 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 52 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 51 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2025-06-01 11:40:31] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 11:40:31] [INFO ] Invariant cache hit.
[2025-06-01 11:40:32] [INFO ] Implicit Places using invariants in 850 ms returned []
[2025-06-01 11:40:32] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 11:40:32] [INFO ] Invariant cache hit.
[2025-06-01 11:40:32] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-01 11:40:34] [INFO ] Implicit Places using invariants and state equation in 2418 ms returned []
Implicit Place search using SMT with State Equation took 3274 ms to find 0 implicit places.
[2025-06-01 11:40:34] [INFO ] Redundant transitions in 20 ms returned []
Running 1204 sub problems to find dead transitions.
[2025-06-01 11:40:34] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-01 11:40:34] [INFO ] Invariant cache hit.
[2025-06-01 11:40:34] [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 11:40:53] [INFO ] Deduced a trap composed of 135 places in 359 ms of which 6 ms to minimize.
[2025-06-01 11:40:54] [INFO ] Deduced a trap composed of 131 places in 230 ms of which 3 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3.74365e+10 after 5.12697e+17
At refinement iteration 1 (INCLUDED_ONLY) 0/415 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
Detected timeout of ITS tools.
[2025-06-01 11:41:06] [INFO ] Flatten gal took : 43 ms
[2025-06-01 11:41:06] [INFO ] Applying decomposition
[2025-06-01 11:41:06] [INFO ] Flatten gal took : 41 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/graph11977962589142566463.txt' '-o' '/tmp/graph11977962589142566463.bin' '-w' '/tmp/graph11977962589142566463.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11977962589142566463.bin' '-l' '-1' '-v' '-w' '/tmp/graph11977962589142566463.weights' '-q' '0' '-e' '0.001'
[2025-06-01 11:41:06] [INFO ] Decomposing Gal with order
[2025-06-01 11:41:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 11:41:07] [INFO ] Removed a total of 2062 redundant transitions.
[2025-06-01 11:41:07] [INFO ] Flatten gal took : 88 ms
[2025-06-01 11:41:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 850 labels/synchronizations in 47 ms.
[2025-06-01 11:41:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1698369535166116621.gal : 10 ms
[2025-06-01 11:41:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13607262470901860030.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/ReachabilityCardinality1698369535166116621.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13607262470901860030.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/ReachabilityCardinality13607262470901860030.prop.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 415/1095 variables, and 5 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: 2/2 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, 2/5 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/415 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 3 (OVERLAPS) 680/1095 variables, 415/420 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1095 variables, 74/494 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 1698 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 30956 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: 2/2 constraints]
After SMT, in 66236ms problems are : Problem set: 0 solved, 1204 unsolved
Search for dead transitions found 0 dead transitions in 66249ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69604 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 1 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 164 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 11:41:40] [INFO ] Computed 3 invariants in 1 ms
[2025-06-01 11:41:40] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 11:41:40] [INFO ] After 12ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-06-01 11:41:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-01 11:41:40] [INFO ] After 7ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 11:41:40] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 11:41:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 11:41:40] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 11:41:40] [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 11:41:40] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 11:41:40] [INFO ] After 50ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-01 11:41:41] [INFO ] Flatten gal took : 1 ms
[2025-06-01 11:41:41] [INFO ] Flatten gal took : 1 ms
[2025-06-01 11:41:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8082891076574964058.gal : 1 ms
[2025-06-01 11:41:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11727928140075283614.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/ReachabilityCardinality8082891076574964058.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11727928140075283614.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/ReachabilityCardinality11727928140075283614.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 48
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :48 after 578
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :578 after 3858
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :3858 after 198387
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :198387 after 619443
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :619443 after 1.45829e+06
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.45829e+06 after 3.13272e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3.13272e+06 after 6.47832e+06
Detected timeout of ITS tools.
[2025-06-01 11:41:56] [INFO ] Flatten gal took : 2 ms
[2025-06-01 11:41:56] [INFO ] Applying decomposition
[2025-06-01 11:41: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/graph4074963409718683996.txt' '-o' '/tmp/graph4074963409718683996.bin' '-w' '/tmp/graph4074963409718683996.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4074963409718683996.bin' '-l' '-1' '-v' '-w' '/tmp/graph4074963409718683996.weights' '-q' '0' '-e' '0.001'
[2025-06-01 11:41:56] [INFO ] Decomposing Gal with order
[2025-06-01 11:41:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 11:41:56] [INFO ] Removed a total of 14 redundant transitions.
[2025-06-01 11:41:56] [INFO ] Flatten gal took : 3 ms
[2025-06-01 11:41:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-01 11:41:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5904830464303920928.gal : 2 ms
[2025-06-01 11:41:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13715256208043688583.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/ReachabilityCardinality5904830464303920928.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13715256208043688583.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/ReachabilityCardinality13715256208043688583.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 48
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :48 after 578
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :578 after 11689
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :11689 after 2.91138e+06
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2.91138e+06 after 6.59719e+07
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :6.59719e+07 after 7.95384e+08
Detected timeout of ITS tools.
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :7.95384e+08 after 7.66211e+09
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :7.66211e+09 after 6.6985e+10
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30389 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[788] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c016-UpperBounds-01 in 435283 ms.
Starting property specific reduction for FunctionPointer-PT-c016-UpperBounds-07
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2025-06-01 11:42:11] [INFO ] Flow matrix only has 712 transitions (discarded 537 similar events)
// Phase 1: matrix 712 rows 435 cols
[2025-06-01 11:42:11] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 39 ms. (250 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2025-06-01 11:42:11] [INFO ] Flow matrix only has 712 transitions (discarded 537 similar events)
[2025-06-01 11:42:11] [INFO ] Invariant cache hit.
[2025-06-01 11:42:11] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-01 11:42:11] [INFO ] [Real]Absence check using state equation in 258 ms returned sat
[2025-06-01 11:42:11] [INFO ] State equation strengthened by 83 read => feed constraints.
[2025-06-01 11:42:11] [INFO ] [Real]Added 83 Read/Feed constraints in 32 ms returned sat
[2025-06-01 11:42:11] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:42:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-01 11:42:11] [INFO ] [Nat]Absence check using state equation in 304 ms returned sat
[2025-06-01 11:42:12] [INFO ] [Nat]Added 83 Read/Feed constraints in 29 ms returned sat
[2025-06-01 11:42:12] [INFO ] Computed and/alt/rep : 338/2038/338 causal constraints (skipped 372 transitions) in 96 ms.
[2025-06-01 11:42:12] [INFO ] Added : 20 causal constraints over 5 iterations in 525 ms. Result :sat
Minimization took 509 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 435 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 435/435 places, 1249/1249 transitions.
Graph (complete) has 2149 edges and 435 vertex of which 432 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 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 432 transition count 1244
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 9 place count 429 transition count 1238
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 429 transition count 1238
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 14 place count 429 transition count 1236
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 428 transition count 1232
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 428 transition count 1232
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 427 transition count 1230
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 427 transition count 1230
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 426 transition count 1228
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 426 transition count 1228
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 425 transition count 1226
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 425 transition count 1226
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 424 transition count 1224
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 424 transition count 1224
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 423 transition count 1222
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 423 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 422 transition count 1220
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 422 transition count 1220
Applied a total of 28 rules in 395 ms. Remains 422 /435 variables (removed 13) and now considering 1220/1249 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 396 ms. Remains : 422/435 places, 1220/1249 transitions.
[2025-06-01 11:42:13] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
Found an invariant !
This invariant on transitions {228=1, 320=1, 518=1, 684=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 344=1, 670=1, 688=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
[2025-06-01 11:42:13] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
// Phase 1: matrix 689 rows 422 cols
[2025-06-01 11:42:13] [INFO ] Computed 3 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 3042 ms. (328 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1103 ms. (905 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2025-06-01 11:42:18] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2025-06-01 11:42:18] [INFO ] Invariant cache hit.
[2025-06-01 11:42:18] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-01 11:42:18] [INFO ] [Real]Absence check using state equation in 310 ms returned sat
[2025-06-01 11:42:18] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-01 11:42:18] [INFO ] [Real]Added 75 Read/Feed constraints in 46 ms returned sat
[2025-06-01 11:42:18] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:42:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2025-06-01 11:42:19] [INFO ] [Nat]Absence check using state equation in 354 ms returned sat
[2025-06-01 11:42:19] [INFO ] [Nat]Added 75 Read/Feed constraints in 59 ms returned sat
[2025-06-01 11:42:19] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 355 transitions) in 132 ms.
[2025-06-01 11:42:19] [INFO ] Added : 12 causal constraints over 5 iterations in 562 ms. Result :sat
Minimization took 513 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 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 54 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 422/422 places, 1220/1220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 51 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2025-06-01 11:42:20] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2025-06-01 11:42:20] [INFO ] Invariant cache hit.
[2025-06-01 11:42:21] [INFO ] Implicit Places using invariants in 656 ms returned []
[2025-06-01 11:42:21] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2025-06-01 11:42:21] [INFO ] Invariant cache hit.
[2025-06-01 11:42:21] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-01 11:42:22] [INFO ] Implicit Places using invariants and state equation in 1838 ms returned []
Implicit Place search using SMT with State Equation took 2495 ms to find 0 implicit places.
[2025-06-01 11:42:22] [INFO ] Redundant transitions in 21 ms returned []
Running 1218 sub problems to find dead transitions.
[2025-06-01 11:42:22] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2025-06-01 11:42:22] [INFO ] Invariant cache hit.
[2025-06-01 11:42:22] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
[2025-06-01 11:42:43] [INFO ] Deduced a trap composed of 131 places in 209 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 422/1111 variables, and 4 constraints, problems are : Problem set: 0 solved, 1218 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/422 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 1218/1218 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 3 (OVERLAPS) 689/1111 variables, 422/426 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1111 variables, 75/501 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1111/1111 variables, and 1719 constraints, problems are : Problem set: 0 solved, 1218 unsolved in 31360 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1218/1218 constraints, Known Traps: 1/1 constraints]
After SMT, in 66874ms problems are : Problem set: 0 solved, 1218 unsolved
Search for dead transitions found 0 dead transitions in 66887ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69464 ms. Remains : 422/422 places, 1220/1220 transitions.
[2025-06-01 11:43:29] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
Found an invariant !
This invariant on transitions {228=1, 320=1, 518=1, 684=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 344=1, 670=1, 688=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2025-06-01 11:43:30] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2025-06-01 11:43:30] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 3163 ms. (316 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 983 ms. (1016 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[216] Max Struct:[+inf]
[2025-06-01 11:43:34] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2025-06-01 11:43:34] [INFO ] Invariant cache hit.
[2025-06-01 11:43:34] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2025-06-01 11:43:34] [INFO ] [Real]Absence check using state equation in 337 ms returned sat
[2025-06-01 11:43:34] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-01 11:43:34] [INFO ] [Real]Added 75 Read/Feed constraints in 76 ms returned sat
[2025-06-01 11:43:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:43:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-01 11:43:35] [INFO ] [Nat]Absence check using state equation in 396 ms returned sat
[2025-06-01 11:43:35] [INFO ] [Nat]Added 75 Read/Feed constraints in 83 ms returned sat
[2025-06-01 11:43:36] [INFO ] Deduced a trap composed of 113 places in 610 ms of which 7 ms to minimize.
[2025-06-01 11:43:36] [INFO ] Deduced a trap composed of 109 places in 602 ms of which 7 ms to minimize.
[2025-06-01 11:43:37] [INFO ] Deduced a trap composed of 87 places in 585 ms of which 7 ms to minimize.
[2025-06-01 11:43:37] [INFO ] Deduced a trap composed of 85 places in 451 ms of which 4 ms to minimize.
[2025-06-01 11:43:38] [INFO ] Deduced a trap composed of 76 places in 403 ms of which 4 ms to minimize.
[2025-06-01 11:43:38] [INFO ] Deduced a trap composed of 70 places in 333 ms of which 4 ms to minimize.
[2025-06-01 11:43:38] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3234 ms
[2025-06-01 11:43:38] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 355 transitions) in 82 ms.
[2025-06-01 11:43:39] [INFO ] Added : 12 causal constraints over 4 iterations in 342 ms. Result :sat
Minimization took 365 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[216] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[216] Max Struct:[+inf]
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 52 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 422/422 places, 1220/1220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 52 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2025-06-01 11:43:39] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2025-06-01 11:43:39] [INFO ] Invariant cache hit.
[2025-06-01 11:43:40] [INFO ] Implicit Places using invariants in 819 ms returned []
[2025-06-01 11:43:40] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2025-06-01 11:43:40] [INFO ] Invariant cache hit.
[2025-06-01 11:43:40] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-01 11:43:43] [INFO ] Implicit Places using invariants and state equation in 2816 ms returned []
Implicit Place search using SMT with State Equation took 3646 ms to find 0 implicit places.
[2025-06-01 11:43:43] [INFO ] Redundant transitions in 35 ms returned []
Running 1218 sub problems to find dead transitions.
[2025-06-01 11:43:43] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2025-06-01 11:43:43] [INFO ] Invariant cache hit.
[2025-06-01 11:43:43] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
[2025-06-01 11:44:08] [INFO ] Deduced a trap composed of 131 places in 399 ms of which 6 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 422/1111 variables, and 4 constraints, problems are : Problem set: 0 solved, 1218 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/422 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 1218/1218 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 3 (OVERLAPS) 689/1111 variables, 422/426 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1111 variables, 75/501 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1111/1111 variables, and 1719 constraints, problems are : Problem set: 0 solved, 1218 unsolved in 31062 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1218/1218 constraints, Known Traps: 1/1 constraints]
After SMT, in 66723ms problems are : Problem set: 0 solved, 1218 unsolved
Search for dead transitions found 0 dead transitions in 66744ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70495 ms. Remains : 422/422 places, 1220/1220 transitions.
[2025-06-01 11:44:50] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
Found an invariant !
This invariant on transitions {228=1, 320=1, 518=1, 684=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 344=1, 670=1, 688=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[216] Max Struct:[+inf]
[2025-06-01 11:44:50] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2025-06-01 11:44:50] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[216] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 3040 ms. (328 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 899 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[216] Max Struct:[+inf]
[2025-06-01 11:44:54] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2025-06-01 11:44:54] [INFO ] Invariant cache hit.
[2025-06-01 11:44:54] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2025-06-01 11:44:55] [INFO ] [Real]Absence check using state equation in 359 ms returned sat
[2025-06-01 11:44:55] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-01 11:44:55] [INFO ] [Real]Added 75 Read/Feed constraints in 69 ms returned sat
[2025-06-01 11:44:55] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:44:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-01 11:44:55] [INFO ] [Nat]Absence check using state equation in 375 ms returned sat
[2025-06-01 11:44:55] [INFO ] [Nat]Added 75 Read/Feed constraints in 82 ms returned sat
[2025-06-01 11:44:56] [INFO ] Deduced a trap composed of 113 places in 550 ms of which 7 ms to minimize.
[2025-06-01 11:44:57] [INFO ] Deduced a trap composed of 109 places in 581 ms of which 7 ms to minimize.
[2025-06-01 11:44:57] [INFO ] Deduced a trap composed of 87 places in 580 ms of which 7 ms to minimize.
[2025-06-01 11:44:58] [INFO ] Deduced a trap composed of 85 places in 576 ms of which 7 ms to minimize.
[2025-06-01 11:44:58] [INFO ] Deduced a trap composed of 76 places in 563 ms of which 7 ms to minimize.
[2025-06-01 11:44:59] [INFO ] Deduced a trap composed of 70 places in 620 ms of which 7 ms to minimize.
[2025-06-01 11:44:59] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3780 ms
[2025-06-01 11:44:59] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 355 transitions) in 132 ms.
[2025-06-01 11:45:00] [INFO ] Added : 12 causal constraints over 4 iterations in 564 ms. Result :sat
Minimization took 545 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[216] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[216] Max Struct:[+inf]
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 90 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 422/422 places, 1220/1220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 84 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2025-06-01 11:45:00] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2025-06-01 11:45:00] [INFO ] Invariant cache hit.
[2025-06-01 11:45:01] [INFO ] Implicit Places using invariants in 905 ms returned []
[2025-06-01 11:45:01] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2025-06-01 11:45:01] [INFO ] Invariant cache hit.
[2025-06-01 11:45:02] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-01 11:45:04] [INFO ] Implicit Places using invariants and state equation in 2731 ms returned []
Implicit Place search using SMT with State Equation took 3647 ms to find 0 implicit places.
[2025-06-01 11:45:04] [INFO ] Redundant transitions in 35 ms returned []
Running 1218 sub problems to find dead transitions.
[2025-06-01 11:45:04] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2025-06-01 11:45:04] [INFO ] Invariant cache hit.
[2025-06-01 11:45:04] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
[2025-06-01 11:45:29] [INFO ] Deduced a trap composed of 131 places in 375 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 422/1111 variables, and 4 constraints, problems are : Problem set: 0 solved, 1218 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/422 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 1218/1218 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 3 (OVERLAPS) 689/1111 variables, 422/426 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1111 variables, 75/501 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1111/1111 variables, and 1719 constraints, problems are : Problem set: 0 solved, 1218 unsolved in 31052 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1218/1218 constraints, Known Traps: 1/1 constraints]
After SMT, in 66076ms problems are : Problem set: 0 solved, 1218 unsolved
Search for dead transitions found 0 dead transitions in 66098ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69878 ms. Remains : 422/422 places, 1220/1220 transitions.
[2025-06-01 11:46:10] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
Found an invariant !
This invariant on transitions {228=1, 320=1, 518=1, 684=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 344=1, 670=1, 688=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[216] Max Struct:[+inf]
[2025-06-01 11:46:11] [INFO ] Flatten gal took : 44 ms
RANDOM walk for 40000 steps (8 resets) in 199 ms. (200 steps per ms) remains 1/1 properties
[2025-06-01 11:46:11] [INFO ] Flatten gal took : 39 ms
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
[2025-06-01 11:46:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2402797936729462719.gal : 14 ms
[2025-06-01 11:46:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15145100758132614756.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/ReachabilityCardinality2402797936729462719.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15145100758132614756.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/ReachabilityCardinality15145100758132614756.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.24463e+06
Interrupted probabilistic random walk after 365911 steps, run timeout after 3001 ms. (steps per millisecond=121 ) properties seen :0 out of 1
Probabilistic random walk after 365911 steps, saw 224379 distinct states, run finished after 3004 ms. (steps per millisecond=121 ) properties seen :0
[2025-06-01 11:46:14] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2025-06-01 11:46:14] [INFO ] Invariant cache hit.
[2025-06-01 11:46:14] [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) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/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) 10/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 352/377 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 7/384 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 600/984 variables, 335/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/984 variables, 73/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/984 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 62/1046 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1046 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 65/1111 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1111 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1111 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1111/1111 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 853 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 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) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/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) 10/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 352/377 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/377 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 7/384 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/384 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 600/984 variables, 335/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/984 variables, 73/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/984 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/1046 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1046 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 65/1111 variables, 66/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1111/1111 variables, and 501 constraints, problems are : Problem set: 0 solved, 1 unsolved in 796 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1693ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1913 ms.
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 50 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 422/422 places, 1220/1220 transitions.
RANDOM walk for 40007 steps (8 resets) in 230 ms. (173 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1.24463e+06 after 3.74365e+10
Interrupted probabilistic random walk after 371018 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :0 out of 1
Probabilistic random walk after 371018 steps, saw 227511 distinct states, run finished after 3001 ms. (steps per millisecond=123 ) properties seen :0
[2025-06-01 11:46:21] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2025-06-01 11:46:21] [INFO ] Invariant cache hit.
[2025-06-01 11:46: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) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/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) 10/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 352/377 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 7/384 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 600/984 variables, 335/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/984 variables, 73/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/984 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 62/1046 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1046 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 65/1111 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1111 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1111 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1111/1111 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 564 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 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) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/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) 10/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 352/377 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/377 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 7/384 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/384 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 600/984 variables, 335/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/984 variables, 73/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/984 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/1046 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1046 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 65/1111 variables, 66/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1111/1111 variables, and 501 constraints, problems are : Problem set: 0 solved, 1 unsolved in 507 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1093ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1917 ms.
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 52 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 422/422 places, 1220/1220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 52 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2025-06-01 11:46:24] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2025-06-01 11:46:24] [INFO ] Invariant cache hit.
[2025-06-01 11:46:24] [INFO ] Implicit Places using invariants in 489 ms returned []
[2025-06-01 11:46:24] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2025-06-01 11:46:24] [INFO ] Invariant cache hit.
[2025-06-01 11:46:24] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-01 11:46:26] [INFO ] Implicit Places using invariants and state equation in 1979 ms returned []
Implicit Place search using SMT with State Equation took 2472 ms to find 0 implicit places.
[2025-06-01 11:46:26] [INFO ] Redundant transitions in 21 ms returned []
Running 1218 sub problems to find dead transitions.
[2025-06-01 11:46:26] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2025-06-01 11:46:26] [INFO ] Invariant cache hit.
[2025-06-01 11:46:26] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
[2025-06-01 11:46:46] [INFO ] Deduced a trap composed of 131 places in 212 ms of which 4 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3.74365e+10 after 5.12697e+17
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
Detected timeout of ITS tools.
[2025-06-01 11:47:01] [INFO ] Flatten gal took : 36 ms
[2025-06-01 11:47:01] [INFO ] Applying decomposition
[2025-06-01 11:47:01] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1814247781750071908.txt' '-o' '/tmp/graph1814247781750071908.bin' '-w' '/tmp/graph1814247781750071908.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1814247781750071908.bin' '-l' '-1' '-v' '-w' '/tmp/graph1814247781750071908.weights' '-q' '0' '-e' '0.001'
[2025-06-01 11:47:01] [INFO ] Decomposing Gal with order
[2025-06-01 11:47:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 11:47:01] [INFO ] Removed a total of 2085 redundant transitions.
[2025-06-01 11:47:01] [INFO ] Flatten gal took : 73 ms
[2025-06-01 11:47:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 862 labels/synchronizations in 51 ms.
[2025-06-01 11:47:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8391776646119953888.gal : 9 ms
[2025-06-01 11:47:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1823092562313887459.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/ReachabilityCardinality8391776646119953888.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1823092562313887459.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/ReachabilityCardinality1823092562313887459.prop.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 422/1111 variables, and 4 constraints, problems are : Problem set: 0 solved, 1218 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/422 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 1218/1218 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 3 (OVERLAPS) 689/1111 variables, 422/426 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1111 variables, 75/501 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1111/1111 variables, and 1719 constraints, problems are : Problem set: 0 solved, 1218 unsolved in 31000 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1218/1218 constraints, Known Traps: 1/1 constraints]
After SMT, in 66209ms problems are : Problem set: 0 solved, 1218 unsolved
Search for dead transitions found 0 dead transitions in 66223ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68778 ms. Remains : 422/422 places, 1220/1220 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 531 transitions
Reduce isomorphic transitions removed 531 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 541 rules applied. Total rules applied 541 place count 422 transition count 679
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 551 place count 412 transition count 679
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 551 place count 412 transition count 606
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 697 place count 339 transition count 606
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 951 place count 212 transition count 479
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1015 place count 148 transition count 351
Iterating global reduction 2 with 64 rules applied. Total rules applied 1079 place count 148 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1080 place count 148 transition count 350
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1143 place count 85 transition count 224
Iterating global reduction 3 with 63 rules applied. Total rules applied 1206 place count 85 transition count 224
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1269 place count 22 transition count 98
Iterating global reduction 3 with 63 rules applied. Total rules applied 1332 place count 22 transition count 98
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1395 place count 22 transition count 35
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1395 place count 22 transition count 34
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 1397 place count 21 transition count 34
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 1399 place count 20 transition count 33
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 1401 place count 19 transition count 33
Applied a total of 1401 rules in 36 ms. Remains 19 /422 variables (removed 403) and now considering 33/1220 (removed 1187) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 33 rows 19 cols
[2025-06-01 11:47:32] [INFO ] Computed 3 invariants in 1 ms
[2025-06-01 11:47:32] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 11:47:32] [INFO ] After 20ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-06-01 11:47:32] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-01 11:47:32] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 11:47:32] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 11:47:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 11:47:33] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 11:47:33] [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 11:47:33] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 11:47:33] [INFO ] After 63ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-01 11:47:33] [INFO ] Flatten gal took : 2 ms
[2025-06-01 11:47:33] [INFO ] Flatten gal took : 1 ms
[2025-06-01 11:47:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality236026002280352119.gal : 1 ms
[2025-06-01 11:47:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5749337078151507358.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/ReachabilityCardinality236026002280352119.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5749337078151507358.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality5749337078151507358.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 48
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :48 after 1139
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1139 after 31467
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :31467 after 84507
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :84507 after 189771
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :189771 after 399483
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :399483 after 818091
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :818091 after 1.65449e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.65449e+06 after 3.32648e+06
Detected timeout of ITS tools.
[2025-06-01 11:47:48] [INFO ] Flatten gal took : 2 ms
[2025-06-01 11:47:48] [INFO ] Applying decomposition
[2025-06-01 11:47:48] [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/graph17265601754429160404.txt' '-o' '/tmp/graph17265601754429160404.bin' '-w' '/tmp/graph17265601754429160404.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17265601754429160404.bin' '-l' '-1' '-v' '-w' '/tmp/graph17265601754429160404.weights' '-q' '0' '-e' '0.001'
[2025-06-01 11:47:48] [INFO ] Decomposing Gal with order
[2025-06-01 11:47:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 11:47:48] [INFO ] Removed a total of 36 redundant transitions.
[2025-06-01 11:47:48] [INFO ] Flatten gal took : 3 ms
[2025-06-01 11:47:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2025-06-01 11:47:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17223935688176161449.gal : 1 ms
[2025-06-01 11:47:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7051521923643001945.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/ReachabilityCardinality17223935688176161449.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7051521923643001945.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/ReachabilityCardinality7051521923643001945.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 48
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :48 after 1868
Detected timeout of ITS tools.
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30240 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[216] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c016-UpperBounds-07 in 352014 ms.
Starting property specific reduction for FunctionPointer-PT-c016-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 11:48:03] [INFO ] Flow matrix only has 712 transitions (discarded 537 similar events)
// Phase 1: matrix 712 rows 435 cols
[2025-06-01 11:48:03] [INFO ] Computed 3 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 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2025-06-01 11:48:03] [INFO ] Flow matrix only has 712 transitions (discarded 537 similar events)
[2025-06-01 11:48:03] [INFO ] Invariant cache hit.
[2025-06-01 11:48:03] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2025-06-01 11:48:03] [INFO ] [Real]Absence check using state equation in 362 ms returned sat
[2025-06-01 11:48:03] [INFO ] State equation strengthened by 83 read => feed constraints.
[2025-06-01 11:48:03] [INFO ] [Real]Added 83 Read/Feed constraints in 46 ms returned sat
[2025-06-01 11:48:03] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:48:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-01 11:48:04] [INFO ] [Nat]Absence check using state equation in 363 ms returned sat
[2025-06-01 11:48:04] [INFO ] [Nat]Added 83 Read/Feed constraints in 107 ms returned sat
[2025-06-01 11:48:04] [INFO ] Computed and/alt/rep : 338/2038/338 causal constraints (skipped 372 transitions) in 141 ms.
[2025-06-01 11:48:04] [INFO ] Added : 5 causal constraints over 2 iterations in 356 ms. Result :sat
Minimization took 501 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:[2] Max Struct:[+inf]
Support contains 1 out of 435 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 435/435 places, 1249/1249 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 431 transition count 1241
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 431 transition count 1241
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 431 transition count 1239
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 429 transition count 1233
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 429 transition count 1233
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 427 transition count 1227
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 427 transition count 1227
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 425 transition count 1223
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 425 transition count 1223
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 423 transition count 1219
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 423 transition count 1219
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 28 place count 421 transition count 1215
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 421 transition count 1215
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 419 transition count 1211
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 419 transition count 1211
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 417 transition count 1207
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 417 transition count 1207
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 416 transition count 1205
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 416 transition count 1205
Applied a total of 40 rules in 234 ms. Remains 416 /435 variables (removed 19) and now considering 1205/1249 (removed 44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 235 ms. Remains : 416/435 places, 1205/1249 transitions.
[2025-06-01 11:48:05] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
Found an invariant !
This invariant on transitions {219=1, 303=1, 501=1, 675=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {256=1, 340=1, 666=1, 678=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2025-06-01 11:48:06] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
// Phase 1: matrix 680 rows 416 cols
[2025-06-01 11:48:06] [INFO ] Computed 3 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000002 steps (2 resets) in 3520 ms. (284 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 910 ms. (1097 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[+inf]
[2025-06-01 11:48:10] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2025-06-01 11:48:10] [INFO ] Invariant cache hit.
[2025-06-01 11:48:10] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2025-06-01 11:48:11] [INFO ] [Real]Absence check using state equation in 347 ms returned sat
[2025-06-01 11:48:11] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-01 11:48:11] [INFO ] [Real]Added 75 Read/Feed constraints in 69 ms returned sat
[2025-06-01 11:48:11] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:48:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-01 11:48:11] [INFO ] [Nat]Absence check using state equation in 382 ms returned sat
[2025-06-01 11:48:11] [INFO ] [Nat]Added 75 Read/Feed constraints in 73 ms returned sat
[2025-06-01 11:48:12] [INFO ] Deduced a trap composed of 71 places in 555 ms of which 7 ms to minimize.
[2025-06-01 11:48:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 624 ms
[2025-06-01 11:48:12] [INFO ] Computed and/alt/rep : 333/1252/331 causal constraints (skipped 347 transitions) in 133 ms.
[2025-06-01 11:48:12] [INFO ] Added : 5 causal constraints over 2 iterations in 390 ms. Result :sat
Minimization took 574 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[16] Max Struct:[+inf]
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 80 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 416/416 places, 1205/1205 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 88 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
[2025-06-01 11:48:13] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2025-06-01 11:48:13] [INFO ] Invariant cache hit.
[2025-06-01 11:48:14] [INFO ] Implicit Places using invariants in 802 ms returned []
[2025-06-01 11:48:14] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2025-06-01 11:48:14] [INFO ] Invariant cache hit.
[2025-06-01 11:48:15] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-01 11:48:17] [INFO ] Implicit Places using invariants and state equation in 2864 ms returned []
Implicit Place search using SMT with State Equation took 3673 ms to find 0 implicit places.
[2025-06-01 11:48:17] [INFO ] Redundant transitions in 34 ms returned []
Running 1203 sub problems to find dead transitions.
[2025-06-01 11:48:17] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2025-06-01 11:48:17] [INFO ] Invariant cache hit.
[2025-06-01 11:48:17] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
[2025-06-01 11:48:42] [INFO ] Deduced a trap composed of 135 places in 394 ms of which 5 ms to minimize.
[2025-06-01 11:48:43] [INFO ] Deduced a trap composed of 131 places in 373 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 416/1096 variables, and 5 constraints, problems are : Problem set: 0 solved, 1203 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/416 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 1203/1203 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
At refinement iteration 3 (OVERLAPS) 680/1096 variables, 416/421 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1096 variables, 75/496 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1096/1096 variables, and 1699 constraints, problems are : Problem set: 0 solved, 1203 unsolved in 30871 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 416/416 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1203/1203 constraints, Known Traps: 2/2 constraints]
After SMT, in 66050ms problems are : Problem set: 0 solved, 1203 unsolved
Search for dead transitions found 0 dead transitions in 66071ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69877 ms. Remains : 416/416 places, 1205/1205 transitions.
[2025-06-01 11:49:23] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
Found an invariant !
This invariant on transitions {219=1, 303=1, 501=1, 675=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {256=1, 340=1, 666=1, 678=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[16] Max Struct:[+inf]
[2025-06-01 11:49:23] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2025-06-01 11:49:23] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[16] Max Struct:[+inf]
RANDOM walk for 1000001 steps (2 resets) in 3105 ms. (321 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1212 ms. (824 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[16] Max Struct:[+inf]
[2025-06-01 11:49:28] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2025-06-01 11:49:28] [INFO ] Invariant cache hit.
[2025-06-01 11:49:28] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2025-06-01 11:49:28] [INFO ] [Real]Absence check using state equation in 328 ms returned sat
[2025-06-01 11:49:28] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-01 11:49:28] [INFO ] [Real]Added 75 Read/Feed constraints in 67 ms returned sat
[2025-06-01 11:49:28] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:49:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2025-06-01 11:49:29] [INFO ] [Nat]Absence check using state equation in 332 ms returned sat
[2025-06-01 11:49:29] [INFO ] [Nat]Added 75 Read/Feed constraints in 109 ms returned sat
[2025-06-01 11:49:30] [INFO ] Deduced a trap composed of 75 places in 531 ms of which 6 ms to minimize.
[2025-06-01 11:49:30] [INFO ] Deduced a trap composed of 70 places in 524 ms of which 7 ms to minimize.
[2025-06-01 11:49:31] [INFO ] Deduced a trap composed of 135 places in 510 ms of which 7 ms to minimize.
[2025-06-01 11:49:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1725 ms
[2025-06-01 11:49:31] [INFO ] Computed and/alt/rep : 333/1252/331 causal constraints (skipped 347 transitions) in 131 ms.
[2025-06-01 11:49:31] [INFO ] Added : 6 causal constraints over 2 iterations in 341 ms. Result :sat
Minimization took 524 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[16] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[16] Max Struct:[+inf]
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 82 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 416/416 places, 1205/1205 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 81 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
[2025-06-01 11:49:32] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2025-06-01 11:49:32] [INFO ] Invariant cache hit.
[2025-06-01 11:49:33] [INFO ] Implicit Places using invariants in 946 ms returned []
[2025-06-01 11:49:33] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2025-06-01 11:49:33] [INFO ] Invariant cache hit.
[2025-06-01 11:49:33] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-01 11:49:35] [INFO ] Implicit Places using invariants and state equation in 2438 ms returned []
Implicit Place search using SMT with State Equation took 3385 ms to find 0 implicit places.
[2025-06-01 11:49:35] [INFO ] Redundant transitions in 21 ms returned []
Running 1203 sub problems to find dead transitions.
[2025-06-01 11:49:35] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2025-06-01 11:49:35] [INFO ] Invariant cache hit.
[2025-06-01 11:49:35] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
[2025-06-01 11:50:02] [INFO ] Deduced a trap composed of 135 places in 421 ms of which 12 ms to minimize.
[2025-06-01 11:50:02] [INFO ] Deduced a trap composed of 131 places in 358 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 416/1096 variables, and 5 constraints, problems are : Problem set: 0 solved, 1203 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/416 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 1203/1203 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
At refinement iteration 3 (OVERLAPS) 680/1096 variables, 416/421 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1096 variables, 75/496 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1096/1096 variables, and 1699 constraints, problems are : Problem set: 0 solved, 1203 unsolved in 31000 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 416/416 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1203/1203 constraints, Known Traps: 2/2 constraints]
After SMT, in 65841ms problems are : Problem set: 0 solved, 1203 unsolved
Search for dead transitions found 0 dead transitions in 65853ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69347 ms. Remains : 416/416 places, 1205/1205 transitions.
[2025-06-01 11:50:41] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
Found an invariant !
This invariant on transitions {219=1, 303=1, 501=1, 675=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {256=1, 340=1, 666=1, 678=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[16] Max Struct:[+inf]
[2025-06-01 11:50:42] [INFO ] Flatten gal took : 38 ms
[2025-06-01 11:50:42] [INFO ] Flatten gal took : 30 ms
RANDOM walk for 40004 steps (8 resets) in 246 ms. (161 steps per ms) remains 1/1 properties
[2025-06-01 11:50:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3953164152633752178.gal : 5 ms
[2025-06-01 11:50:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8708794455865564632.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/ReachabilityCardinality3953164152633752178.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8708794455865564632.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 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality8708794455865564632.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.24463e+06
Interrupted probabilistic random walk after 362073 steps, run timeout after 3001 ms. (steps per millisecond=120 ) properties seen :0 out of 1
Probabilistic random walk after 362073 steps, saw 222026 distinct states, run finished after 3001 ms. (steps per millisecond=120 ) properties seen :0
[2025-06-01 11:50:45] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2025-06-01 11:50:45] [INFO ] Invariant cache hit.
[2025-06-01 11:50:45] [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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 343/348 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 6/354 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 598/952 variables, 333/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/952 variables, 74/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/952 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1014 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1014 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 68/1082 variables, 66/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1082 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/1090 variables, 4/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1090 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 6/1096 variables, 4/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1096 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1096 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1096/1096 variables, and 494 constraints, problems are : Problem set: 0 solved, 1 unsolved in 435 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 343/348 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/354 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 598/952 variables, 333/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/952 variables, 74/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/952 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/952 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 62/1014 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 11:50:46] [INFO ] Deduced a trap composed of 135 places in 323 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1014 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1014 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 68/1082 variables, 66/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1082 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 8/1090 variables, 4/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1090 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 6/1096 variables, 4/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1096 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1096 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1096/1096 variables, and 496 constraints, problems are : Problem set: 0 solved, 1 unsolved in 911 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 416/416 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1355ms 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, 1205/1205 transitions.
Applied a total of 0 rules in 50 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 416/416 places, 1205/1205 transitions.
RANDOM walk for 40005 steps (8 resets) in 188 ms. (211 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 341422 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :0 out of 1
Probabilistic random walk after 341422 steps, saw 209366 distinct states, run finished after 3001 ms. (steps per millisecond=113 ) properties seen :0
[2025-06-01 11:50:49] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2025-06-01 11:50:49] [INFO ] Invariant cache hit.
[2025-06-01 11:50: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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 343/348 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 6/354 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 598/952 variables, 333/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/952 variables, 74/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/952 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1014 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1014 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 68/1082 variables, 66/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1082 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/1090 variables, 4/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1090 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 6/1096 variables, 4/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1096 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1096 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1096/1096 variables, and 494 constraints, problems are : Problem set: 0 solved, 1 unsolved in 465 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 343/348 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/354 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 598/952 variables, 333/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/952 variables, 74/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/952 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/952 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 62/1014 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 11:50:50] [INFO ] Deduced a trap composed of 135 places in 364 ms of which 6 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1014 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1014 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 32
At refinement iteration 16 (OVERLAPS) 68/1082 variables, 66/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD size :1.24463e+06 after 3.74365e+10
At refinement iteration 17 (INCLUDED_ONLY) 0/1082 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 8/1090 variables, 4/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1090 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 6/1096 variables, 4/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1096 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1096 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1096/1096 variables, and 496 constraints, problems are : Problem set: 0 solved, 1 unsolved in 961 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 416/416 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1437ms 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, 1205/1205 transitions.
Applied a total of 0 rules in 80 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 416/416 places, 1205/1205 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 81 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
[2025-06-01 11:50:51] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2025-06-01 11:50:51] [INFO ] Invariant cache hit.
[2025-06-01 11:50:51] [INFO ] Implicit Places using invariants in 644 ms returned []
[2025-06-01 11:50:51] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2025-06-01 11:50:51] [INFO ] Invariant cache hit.
[2025-06-01 11:50:52] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-01 11:50:54] [INFO ] Implicit Places using invariants and state equation in 2791 ms returned []
Implicit Place search using SMT with State Equation took 3441 ms to find 0 implicit places.
[2025-06-01 11:50:54] [INFO ] Redundant transitions in 30 ms returned []
Running 1203 sub problems to find dead transitions.
[2025-06-01 11:50:54] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2025-06-01 11:50:54] [INFO ] Invariant cache hit.
[2025-06-01 11:50:54] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
[2025-06-01 11:51:17] [INFO ] Deduced a trap composed of 135 places in 234 ms of which 4 ms to minimize.
[2025-06-01 11:51:18] [INFO ] Deduced a trap composed of 131 places in 204 ms of which 4 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3.74365e+10 after 5.12697e+17
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 416/1096 variables, and 5 constraints, problems are : Problem set: 0 solved, 1203 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/416 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 1203/1203 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1203 unsolved
Detected timeout of ITS tools.
[2025-06-01 11:51:32] [INFO ] Flatten gal took : 30 ms
[2025-06-01 11:51:32] [INFO ] Applying decomposition
[2025-06-01 11:51:32] [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/graph12170088419827803148.txt' '-o' '/tmp/graph12170088419827803148.bin' '-w' '/tmp/graph12170088419827803148.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12170088419827803148.bin' '-l' '-1' '-v' '-w' '/tmp/graph12170088419827803148.weights' '-q' '0' '-e' '0.001'
[2025-06-01 11:51:32] [INFO ] Decomposing Gal with order
[2025-06-01 11:51:32] [INFO ] Rewriting arrays to variables to allow decomposition.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
[2025-06-01 11:51:32] [INFO ] Removed a total of 2059 redundant transitions.
[2025-06-01 11:51:32] [INFO ] Flatten gal took : 61 ms
[2025-06-01 11:51:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 849 labels/synchronizations in 23 ms.
[2025-06-01 11:51:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9092926397941461736.gal : 8 ms
[2025-06-01 11:51:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5473908159148079329.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/ReachabilityCardinality9092926397941461736.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5473908159148079329.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/ReachabilityCardinality5473908159148079329.prop.
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
At refinement iteration 3 (OVERLAPS) 680/1096 variables, 416/421 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1096 variables, 75/496 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1096 variables, 1203/1699 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1096/1096 variables, and 1699 constraints, problems are : Problem set: 0 solved, 1203 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 416/416 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1203/1203 constraints, Known Traps: 2/2 constraints]
After SMT, in 66232ms problems are : Problem set: 0 solved, 1203 unsolved
Search for dead transitions found 0 dead transitions in 66251ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69814 ms. Remains : 416/416 places, 1205/1205 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 669
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 668
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 668
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 600
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 600
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 473
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 1003 place count 145 transition count 345
Iterating global reduction 3 with 64 rules applied. Total rules applied 1067 place count 145 transition count 345
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 344
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 343
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 343
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1133 place count 81 transition count 217
Iterating global reduction 4 with 63 rules applied. Total rules applied 1196 place count 81 transition count 217
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1259 place count 18 transition count 91
Iterating global reduction 4 with 63 rules applied. Total rules applied 1322 place count 18 transition count 91
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 28
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 27
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 27
Applied a total of 1387 rules in 55 ms. Remains 17 /416 variables (removed 399) and now considering 27/1205 (removed 1178) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 27 rows 17 cols
[2025-06-01 11:52:00] [INFO ] Computed 3 invariants in 1 ms
[2025-06-01 11:52:00] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 11:52:00] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 11:52:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 11:52:01] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 11:52:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-01 11:52:01] [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 11:52:01] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 11:52:01] [INFO ] After 61ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-01 11:52:01] [INFO ] Flatten gal took : 1 ms
[2025-06-01 11:52:01] [INFO ] Flatten gal took : 0 ms
[2025-06-01 11:52:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9337282959127380578.gal : 1 ms
[2025-06-01 11:52:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12077520320151103197.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/ReachabilityCardinality9337282959127380578.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12077520320151103197.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/ReachabilityCardinality12077520320151103197.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 48
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :48 after 578
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :578 after 3858
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :3858 after 198387
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :198387 after 619443
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :619443 after 1.45829e+06
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.45829e+06 after 3.13272e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3.13272e+06 after 6.47832e+06
Detected timeout of ITS tools.
[2025-06-01 11:52:16] [INFO ] Flatten gal took : 1 ms
[2025-06-01 11:52:16] [INFO ] Applying decomposition
[2025-06-01 11:52:16] [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/graph5788172099569253591.txt' '-o' '/tmp/graph5788172099569253591.bin' '-w' '/tmp/graph5788172099569253591.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5788172099569253591.bin' '-l' '-1' '-v' '-w' '/tmp/graph5788172099569253591.weights' '-q' '0' '-e' '0.001'
[2025-06-01 11:52:16] [INFO ] Decomposing Gal with order
[2025-06-01 11:52:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 11:52:16] [INFO ] Removed a total of 20 redundant transitions.
[2025-06-01 11:52:16] [INFO ] Flatten gal took : 3 ms
[2025-06-01 11:52:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-01 11:52:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9755077125551882341.gal : 1 ms
[2025-06-01 11:52:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12988147811904501930.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/ReachabilityCardinality9755077125551882341.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12988147811904501930.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/ReachabilityCardinality12988147811904501930.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 48
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :48 after 578
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :578 after 9075
Detected timeout of ITS tools.
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30258 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[16] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c016-UpperBounds-11 in 268032 ms.
Starting property specific reduction for FunctionPointer-PT-c016-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 11:52:31] [INFO ] Flow matrix only has 712 transitions (discarded 537 similar events)
// Phase 1: matrix 712 rows 435 cols
[2025-06-01 11:52:31] [INFO ] Computed 3 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 30 ms. (322 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 11:52:31] [INFO ] Flow matrix only has 712 transitions (discarded 537 similar events)
[2025-06-01 11:52:31] [INFO ] Invariant cache hit.
[2025-06-01 11:52:31] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-01 11:52:31] [INFO ] [Real]Absence check using state equation in 342 ms returned sat
[2025-06-01 11:52:31] [INFO ] State equation strengthened by 83 read => feed constraints.
[2025-06-01 11:52:31] [INFO ] [Real]Added 83 Read/Feed constraints in 57 ms returned sat
[2025-06-01 11:52:31] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:52:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2025-06-01 11:52:32] [INFO ] [Nat]Absence check using state equation in 383 ms returned sat
[2025-06-01 11:52:32] [INFO ] [Nat]Added 83 Read/Feed constraints in 70 ms returned sat
[2025-06-01 11:52:32] [INFO ] Deduced a trap composed of 72 places in 552 ms of which 5 ms to minimize.
[2025-06-01 11:52:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 640 ms
[2025-06-01 11:52:33] [INFO ] Computed and/alt/rep : 338/2038/338 causal constraints (skipped 372 transitions) in 133 ms.
[2025-06-01 11:52:33] [INFO ] Added : 7 causal constraints over 4 iterations in 508 ms. Result :sat
Minimization took 501 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 435 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 435/435 places, 1249/1249 transitions.
Graph (complete) has 2149 edges and 435 vertex of which 432 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 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 432 transition count 1244
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 9 place count 429 transition count 1238
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 429 transition count 1238
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 14 place count 429 transition count 1236
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 427 transition count 1230
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 427 transition count 1230
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 20 place count 425 transition count 1224
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 425 transition count 1224
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 24 place count 423 transition count 1220
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 423 transition count 1220
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 28 place count 421 transition count 1216
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 421 transition count 1216
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 32 place count 419 transition count 1212
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 419 transition count 1212
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 36 place count 417 transition count 1208
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 417 transition count 1208
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 40 place count 415 transition count 1204
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 415 transition count 1204
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 414 transition count 1202
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 414 transition count 1202
Applied a total of 44 rules in 157 ms. Remains 414 /435 variables (removed 21) and now considering 1202/1249 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159 ms. Remains : 414/435 places, 1202/1249 transitions.
[2025-06-01 11:52:34] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
Found an invariant !
This invariant on transitions {222=1, 307=1, 504=1, 674=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 337=1, 534=1, 674=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
[2025-06-01 11:52:34] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
// Phase 1: matrix 678 rows 414 cols
[2025-06-01 11:52:34] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 1000005 steps (2 resets) in 3430 ms. (291 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 892 ms. (1119 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2025-06-01 11:52:38] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2025-06-01 11:52:38] [INFO ] Invariant cache hit.
[2025-06-01 11:52:39] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-01 11:52:39] [INFO ] [Real]Absence check using state equation in 342 ms returned sat
[2025-06-01 11:52:39] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-01 11:52:39] [INFO ] [Real]Added 74 Read/Feed constraints in 91 ms returned sat
[2025-06-01 11:52:39] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:52:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-01 11:52:40] [INFO ] [Nat]Absence check using state equation in 381 ms returned sat
[2025-06-01 11:52:40] [INFO ] [Nat]Added 74 Read/Feed constraints in 88 ms returned sat
[2025-06-01 11:52:40] [INFO ] Computed and/alt/rep : 333/1251/331 causal constraints (skipped 345 transitions) in 131 ms.
[2025-06-01 11:52:40] [INFO ] Added : 4 causal constraints over 3 iterations in 417 ms. Result :sat
Minimization took 519 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:[1] Max Struct:[+inf]
Support contains 1 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1202/1202 transitions.
Applied a total of 0 rules in 80 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 414/414 places, 1202/1202 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1202/1202 transitions.
Applied a total of 0 rules in 80 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
[2025-06-01 11:52:41] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2025-06-01 11:52:41] [INFO ] Invariant cache hit.
[2025-06-01 11:52:42] [INFO ] Implicit Places using invariants in 901 ms returned []
[2025-06-01 11:52:42] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2025-06-01 11:52:42] [INFO ] Invariant cache hit.
[2025-06-01 11:52:42] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-01 11:52:45] [INFO ] Implicit Places using invariants and state equation in 2951 ms returned []
Implicit Place search using SMT with State Equation took 3853 ms to find 0 implicit places.
[2025-06-01 11:52:45] [INFO ] Redundant transitions in 33 ms returned []
Running 1200 sub problems to find dead transitions.
[2025-06-01 11:52:45] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2025-06-01 11:52:45] [INFO ] Invariant cache hit.
[2025-06-01 11:52:45] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2025-06-01 11:53:10] [INFO ] Deduced a trap composed of 135 places in 216 ms of which 3 ms to minimize.
[2025-06-01 11:53:10] [INFO ] Deduced a trap composed of 131 places in 329 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 414/1092 variables, and 5 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/414 constraints, ReadFeed: 0/74 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 3 (OVERLAPS) 678/1092 variables, 414/419 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1092 variables, 74/493 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1092/1092 variables, and 1693 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30797 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 414/414 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 2/2 constraints]
After SMT, in 66315ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 66335ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70313 ms. Remains : 414/414 places, 1202/1202 transitions.
[2025-06-01 11:53:51] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
Found an invariant !
This invariant on transitions {222=1, 307=1, 504=1, 674=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 337=1, 534=1, 674=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 :[7]
Current structural bounds on expressions (after cover walk) : Max Seen:[7] Max Struct:[+inf]
[2025-06-01 11:53:52] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2025-06-01 11:53:52] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[7] Max Struct:[+inf]
RANDOM walk for 1000005 steps (2 resets) in 3151 ms. (317 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 928 ms. (1076 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1865] Max Struct:[+inf]
[2025-06-01 11:53:56] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2025-06-01 11:53:56] [INFO ] Invariant cache hit.
[2025-06-01 11:53:56] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-01 11:53:56] [INFO ] [Real]Absence check using state equation in 282 ms returned sat
[2025-06-01 11:53:56] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-01 11:53:56] [INFO ] [Real]Added 74 Read/Feed constraints in 52 ms returned sat
[2025-06-01 11:53:56] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:53:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-01 11:53:57] [INFO ] [Nat]Absence check using state equation in 290 ms returned sat
[2025-06-01 11:53:57] [INFO ] [Nat]Added 74 Read/Feed constraints in 66 ms returned sat
[2025-06-01 11:53:57] [INFO ] Deduced a trap composed of 74 places in 612 ms of which 7 ms to minimize.
[2025-06-01 11:53:58] [INFO ] Deduced a trap composed of 72 places in 544 ms of which 4 ms to minimize.
[2025-06-01 11:53:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1278 ms
[2025-06-01 11:53:58] [INFO ] Computed and/alt/rep : 333/1251/331 causal constraints (skipped 345 transitions) in 84 ms.
[2025-06-01 11:53:58] [INFO ] Added : 6 causal constraints over 3 iterations in 294 ms. Result :sat
Minimization took 361 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1865] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1865] Max Struct:[+inf]
Support contains 1 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1202/1202 transitions.
Applied a total of 0 rules in 49 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 414/414 places, 1202/1202 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1202/1202 transitions.
Applied a total of 0 rules in 50 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
[2025-06-01 11:54:05] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2025-06-01 11:54:05] [INFO ] Invariant cache hit.
[2025-06-01 11:54:06] [INFO ] Implicit Places using invariants in 680 ms returned []
[2025-06-01 11:54:06] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2025-06-01 11:54:06] [INFO ] Invariant cache hit.
[2025-06-01 11:54:06] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-01 11:54:08] [INFO ] Implicit Places using invariants and state equation in 2293 ms returned []
Implicit Place search using SMT with State Equation took 2975 ms to find 0 implicit places.
[2025-06-01 11:54:08] [INFO ] Redundant transitions in 34 ms returned []
Running 1200 sub problems to find dead transitions.
[2025-06-01 11:54:08] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2025-06-01 11:54:08] [INFO ] Invariant cache hit.
[2025-06-01 11:54:08] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2025-06-01 11:54:33] [INFO ] Deduced a trap composed of 135 places in 367 ms of which 5 ms to minimize.
[2025-06-01 11:54:34] [INFO ] Deduced a trap composed of 131 places in 385 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 414/1092 variables, and 5 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/414 constraints, ReadFeed: 0/74 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 3 (OVERLAPS) 678/1092 variables, 414/419 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1092 variables, 74/493 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1092/1092 variables, and 1693 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30608 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 414/414 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 2/2 constraints]
After SMT, in 67009ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 67030ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70102 ms. Remains : 414/414 places, 1202/1202 transitions.
[2025-06-01 11:55:15] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
Found an invariant !
This invariant on transitions {222=1, 307=1, 504=1, 674=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 337=1, 534=1, 674=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[1865] Max Struct:[+inf]
[2025-06-01 11:55:15] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2025-06-01 11:55:15] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1865] Max Struct:[+inf]
RANDOM walk for 1000001 steps (2 resets) in 3223 ms. (310 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 896 ms. (1114 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1865] Max Struct:[+inf]
[2025-06-01 11:55:19] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2025-06-01 11:55:19] [INFO ] Invariant cache hit.
[2025-06-01 11:55:20] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-01 11:55:20] [INFO ] [Real]Absence check using state equation in 269 ms returned sat
[2025-06-01 11:55:20] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-01 11:55:20] [INFO ] [Real]Added 74 Read/Feed constraints in 53 ms returned sat
[2025-06-01 11:55:20] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:55:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-01 11:55:20] [INFO ] [Nat]Absence check using state equation in 236 ms returned sat
[2025-06-01 11:55:20] [INFO ] [Nat]Added 74 Read/Feed constraints in 67 ms returned sat
[2025-06-01 11:55:21] [INFO ] Deduced a trap composed of 74 places in 463 ms of which 5 ms to minimize.
[2025-06-01 11:55:21] [INFO ] Deduced a trap composed of 72 places in 447 ms of which 5 ms to minimize.
[2025-06-01 11:55:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1054 ms
[2025-06-01 11:55:22] [INFO ] Computed and/alt/rep : 333/1251/331 causal constraints (skipped 345 transitions) in 128 ms.
[2025-06-01 11:55:22] [INFO ] Added : 6 causal constraints over 3 iterations in 418 ms. Result :sat
Minimization took 510 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1865] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1865] Max Struct:[+inf]
Support contains 1 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1202/1202 transitions.
Applied a total of 0 rules in 49 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 414/414 places, 1202/1202 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1202/1202 transitions.
Applied a total of 0 rules in 50 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
[2025-06-01 11:55:29] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2025-06-01 11:55:29] [INFO ] Invariant cache hit.
[2025-06-01 11:55:30] [INFO ] Implicit Places using invariants in 926 ms returned []
[2025-06-01 11:55:30] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2025-06-01 11:55:30] [INFO ] Invariant cache hit.
[2025-06-01 11:55:30] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-01 11:55:33] [INFO ] Implicit Places using invariants and state equation in 2915 ms returned []
Implicit Place search using SMT with State Equation took 3852 ms to find 0 implicit places.
[2025-06-01 11:55:33] [INFO ] Redundant transitions in 35 ms returned []
Running 1200 sub problems to find dead transitions.
[2025-06-01 11:55:33] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2025-06-01 11:55:33] [INFO ] Invariant cache hit.
[2025-06-01 11:55:33] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2025-06-01 11:55:58] [INFO ] Deduced a trap composed of 135 places in 410 ms of which 6 ms to minimize.
[2025-06-01 11:55:59] [INFO ] Deduced a trap composed of 131 places in 260 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 414/1092 variables, and 5 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/414 constraints, ReadFeed: 0/74 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 3 (OVERLAPS) 678/1092 variables, 414/419 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1092 variables, 74/493 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1092/1092 variables, and 1693 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30836 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 414/414 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 2/2 constraints]
After SMT, in 66527ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 66548ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70495 ms. Remains : 414/414 places, 1202/1202 transitions.
[2025-06-01 11:56:39] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
Found an invariant !
This invariant on transitions {222=1, 307=1, 504=1, 674=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 337=1, 534=1, 674=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :[4]
Current structural bounds on expressions (after cover walk) : Max Seen:[1865] Max Struct:[+inf]
[2025-06-01 11:56:40] [INFO ] Flatten gal took : 31 ms
[2025-06-01 11:56:40] [INFO ] Flatten gal took : 28 ms
[2025-06-01 11:56:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5879730394768195762.gal : 5 ms
[2025-06-01 11:56:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18088026870485179489.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/ReachabilityCardinality5879730394768195762.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18088026870485179489.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
RANDOM walk for 40002 steps (8 resets) in 299 ms. (133 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality18088026870485179489.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.24463e+06
Interrupted probabilistic random walk after 412797 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :0 out of 1
Probabilistic random walk after 412797 steps, saw 253129 distinct states, run finished after 3001 ms. (steps per millisecond=137 ) properties seen :0
[2025-06-01 11:56:43] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2025-06-01 11:56:43] [INFO ] Invariant cache hit.
[2025-06-01 11:56:43] [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) 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) 343/347 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/353 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 596/949 variables, 333/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/949 variables, 74/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/949 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 62/1011 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1011 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 67/1078 variables, 65/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1078 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/1086 variables, 4/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1086 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/1092 variables, 4/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1092 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1092 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1092/1092 variables, and 491 constraints, problems are : Problem set: 0 solved, 1 unsolved in 465 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 414/414 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) 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) 343/347 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/353 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 596/949 variables, 333/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/949 variables, 74/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/949 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/949 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1011 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1011 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 67/1078 variables, 65/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1078 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/1086 variables, 4/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1086 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 6/1092 variables, 4/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1092 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1092 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1092/1092 variables, and 492 constraints, problems are : Problem set: 0 solved, 1 unsolved in 473 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 414/414 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 949ms problems are : Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1.24463e+06 after 3.74365e+10
Parikh walk visited 0 properties in 5018 ms.
Support contains 1 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1202/1202 transitions.
Applied a total of 0 rules in 54 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 414/414 places, 1202/1202 transitions.
RANDOM walk for 40000 steps (8 resets) in 189 ms. (210 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 407736 steps, run timeout after 3001 ms. (steps per millisecond=135 ) properties seen :0 out of 1
Probabilistic random walk after 407736 steps, saw 250024 distinct states, run finished after 3001 ms. (steps per millisecond=135 ) properties seen :0
[2025-06-01 11:56:52] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2025-06-01 11:56:52] [INFO ] Invariant cache hit.
[2025-06-01 11:56:52] [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) 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) 343/347 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/353 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 596/949 variables, 333/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/949 variables, 74/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/949 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 62/1011 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1011 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 67/1078 variables, 65/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1078 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/1086 variables, 4/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1086 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/1092 variables, 4/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1092 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1092 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1092/1092 variables, and 491 constraints, problems are : Problem set: 0 solved, 1 unsolved in 541 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 414/414 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) 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) 343/347 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/353 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 596/949 variables, 333/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/949 variables, 74/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/949 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/949 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1011 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1011 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 67/1078 variables, 65/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1078 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/1086 variables, 4/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1086 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 6/1092 variables, 4/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1092 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1092 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1092/1092 variables, and 492 constraints, problems are : Problem set: 0 solved, 1 unsolved in 697 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 414/414 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1251ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5070 ms.
Support contains 1 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1202/1202 transitions.
Applied a total of 0 rules in 47 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 414/414 places, 1202/1202 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1202/1202 transitions.
Applied a total of 0 rules in 48 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
[2025-06-01 11:56:58] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2025-06-01 11:56:58] [INFO ] Invariant cache hit.
[2025-06-01 11:56:59] [INFO ] Implicit Places using invariants in 636 ms returned []
[2025-06-01 11:56:59] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2025-06-01 11:56:59] [INFO ] Invariant cache hit.
[2025-06-01 11:56:59] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-01 11:57:01] [INFO ] Implicit Places using invariants and state equation in 2533 ms returned []
Implicit Place search using SMT with State Equation took 3189 ms to find 0 implicit places.
[2025-06-01 11:57:02] [INFO ] Redundant transitions in 22 ms returned []
Running 1200 sub problems to find dead transitions.
[2025-06-01 11:57:02] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2025-06-01 11:57:02] [INFO ] Invariant cache hit.
[2025-06-01 11:57:02] [INFO ] State equation strengthened by 74 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3.74365e+10 after 5.12697e+17
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2025-06-01 11:57:26] [INFO ] Deduced a trap composed of 135 places in 340 ms of which 7 ms to minimize.
[2025-06-01 11:57:27] [INFO ] Deduced a trap composed of 131 places in 358 ms of which 5 ms to minimize.
Detected timeout of ITS tools.
[2025-06-01 11:57:30] [INFO ] Flatten gal took : 49 ms
[2025-06-01 11:57:30] [INFO ] Applying decomposition
[2025-06-01 11:57:30] [INFO ] Flatten gal took : 51 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/graph14487574756280690525.txt' '-o' '/tmp/graph14487574756280690525.bin' '-w' '/tmp/graph14487574756280690525.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14487574756280690525.bin' '-l' '-1' '-v' '-w' '/tmp/graph14487574756280690525.weights' '-q' '0' '-e' '0.001'
[2025-06-01 11:57:30] [INFO ] Decomposing Gal with order
[2025-06-01 11:57:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 11:57:30] [INFO ] Removed a total of 2056 redundant transitions.
[2025-06-01 11:57:30] [INFO ] Flatten gal took : 59 ms
[2025-06-01 11:57:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 860 labels/synchronizations in 23 ms.
[2025-06-01 11:57:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4725819982784152189.gal : 10 ms
[2025-06-01 11:57:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17181044392956964852.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/ReachabilityCardinality4725819982784152189.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17181044392956964852.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/ReachabilityCardinality17181044392956964852.prop.
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 414/1092 variables, and 5 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/414 constraints, ReadFeed: 0/74 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 3 (OVERLAPS) 678/1092 variables, 414/419 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1092 variables, 74/493 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1092 variables, 1200/1693 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1092/1092 variables, and 1693 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 414/414 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 2/2 constraints]
After SMT, in 66359ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 66372ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69640 ms. Remains : 414/414 places, 1202/1202 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 524 transitions
Reduce isomorphic transitions removed 524 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 534 rules applied. Total rules applied 534 place count 414 transition count 668
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 544 place count 404 transition count 668
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 68 Pre rules applied. Total rules applied 544 place count 404 transition count 600
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 136 rules applied. Total rules applied 680 place count 336 transition count 600
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 936 place count 208 transition count 472
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1000 place count 144 transition count 344
Iterating global reduction 2 with 64 rules applied. Total rules applied 1064 place count 144 transition count 344
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1065 place count 144 transition count 343
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1065 place count 144 transition count 342
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 1067 place count 143 transition count 342
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1130 place count 80 transition count 216
Iterating global reduction 3 with 63 rules applied. Total rules applied 1193 place count 80 transition count 216
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1256 place count 17 transition count 90
Iterating global reduction 3 with 63 rules applied. Total rules applied 1319 place count 17 transition count 90
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1382 place count 17 transition count 27
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1382 place count 17 transition count 26
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 1384 place count 16 transition count 26
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 1386 place count 16 transition count 24
Applied a total of 1386 rules in 75 ms. Remains 16 /414 variables (removed 398) and now considering 24/1202 (removed 1178) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 24 rows 16 cols
[2025-06-01 11:58:08] [INFO ] Computed 3 invariants in 0 ms
[2025-06-01 11:58:08] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 11:58:08] [INFO ] After 13ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-06-01 11:58:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-01 11:58:08] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 11:58:08] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 11:58:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 11:58:08] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 11:58:08] [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 11:58:08] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 11:58:08] [INFO ] After 48ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-01 11:58:08] [INFO ] Flatten gal took : 1 ms
[2025-06-01 11:58:08] [INFO ] Flatten gal took : 1 ms
[2025-06-01 11:58:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12246704018551115111.gal : 1 ms
[2025-06-01 11:58:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3220725326159659367.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/ReachabilityCardinality12246704018551115111.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3220725326159659367.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/ReachabilityCardinality3220725326159659367.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 48
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :48 after 578
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :578 after 3858
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :3858 after 198387
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :198387 after 619443
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :619443 after 1.45829e+06
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.45829e+06 after 3.13272e+06
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 1025 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,6.47832e+06,8.43847,120212,2,117,15,19087,6,0,88,11050,0
Total reachable state count : 6478323

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

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,3264,8.43907,120212,2,96,15,19087,7,0,91,11050,0
Over-approximation ignoring read arcs solved 0 properties in 8633 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:[1865] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c016-UpperBounds-12 in 345931 ms.
Starting property specific reduction for FunctionPointer-PT-c016-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 11:58:17] [INFO ] Flow matrix only has 712 transitions (discarded 537 similar events)
// Phase 1: matrix 712 rows 435 cols
[2025-06-01 11:58:17] [INFO ] Computed 3 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 50 ms. (196 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 11:58:17] [INFO ] Flow matrix only has 712 transitions (discarded 537 similar events)
[2025-06-01 11:58:17] [INFO ] Invariant cache hit.
[2025-06-01 11:58:17] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-01 11:58:17] [INFO ] [Real]Absence check using state equation in 386 ms returned sat
[2025-06-01 11:58:17] [INFO ] State equation strengthened by 83 read => feed constraints.
[2025-06-01 11:58:17] [INFO ] [Real]Added 83 Read/Feed constraints in 53 ms returned sat
[2025-06-01 11:58:17] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:58:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-01 11:58:18] [INFO ] [Nat]Absence check using state equation in 389 ms returned sat
[2025-06-01 11:58:18] [INFO ] [Nat]Added 83 Read/Feed constraints in 71 ms returned sat
[2025-06-01 11:58:18] [INFO ] Computed and/alt/rep : 338/2038/338 causal constraints (skipped 372 transitions) in 140 ms.
[2025-06-01 11:58:19] [INFO ] Added : 19 causal constraints over 5 iterations in 591 ms. Result :sat
Minimization took 502 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 435 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 435/435 places, 1249/1249 transitions.
Graph (complete) has 2149 edges and 435 vertex of which 432 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 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 432 transition count 1244
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 9 place count 429 transition count 1238
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 429 transition count 1238
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 14 place count 429 transition count 1236
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 428 transition count 1234
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 428 transition count 1234
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 427 transition count 1230
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 427 transition count 1230
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 426 transition count 1228
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 426 transition count 1228
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 425 transition count 1226
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 425 transition count 1226
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 424 transition count 1224
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 424 transition count 1224
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 423 transition count 1222
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 423 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 422 transition count 1220
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 422 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 421 transition count 1218
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 421 transition count 1218
Applied a total of 30 rules in 242 ms. Remains 421 /435 variables (removed 14) and now considering 1218/1249 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 242 ms. Remains : 421/435 places, 1218/1249 transitions.
[2025-06-01 11:58:19] [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 99 ms. (steps per millisecond=101 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2025-06-01 11:58:20] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
// Phase 1: matrix 688 rows 421 cols
[2025-06-01 11:58:20] [INFO ] Computed 3 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 3390 ms. (294 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 945 ms. (1057 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[516] Max Struct:[+inf]
[2025-06-01 11:58:24] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-01 11:58:24] [INFO ] Invariant cache hit.
[2025-06-01 11:58:24] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2025-06-01 11:58:25] [INFO ] [Real]Absence check using state equation in 303 ms returned sat
[2025-06-01 11:58:25] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-01 11:58:25] [INFO ] [Real]Added 75 Read/Feed constraints in 154 ms returned sat
[2025-06-01 11:58:25] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:58:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-01 11:58:25] [INFO ] [Nat]Absence check using state equation in 374 ms returned sat
[2025-06-01 11:58:26] [INFO ] [Nat]Added 75 Read/Feed constraints in 116 ms returned sat
[2025-06-01 11:58:26] [INFO ] Deduced a trap composed of 113 places in 594 ms of which 7 ms to minimize.
[2025-06-01 11:58:27] [INFO ] Deduced a trap composed of 109 places in 582 ms of which 7 ms to minimize.
[2025-06-01 11:58:27] [INFO ] Deduced a trap composed of 87 places in 581 ms of which 7 ms to minimize.
[2025-06-01 11:58:28] [INFO ] Deduced a trap composed of 85 places in 562 ms of which 7 ms to minimize.
[2025-06-01 11:58:29] [INFO ] Deduced a trap composed of 76 places in 584 ms of which 7 ms to minimize.
[2025-06-01 11:58:29] [INFO ] Deduced a trap composed of 70 places in 583 ms of which 6 ms to minimize.
[2025-06-01 11:58:30] [INFO ] Deduced a trap composed of 71 places in 534 ms of which 7 ms to minimize.
[2025-06-01 11:58:30] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4344 ms
[2025-06-01 11:58:30] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 354 transitions) in 132 ms.
[2025-06-01 11:58:30] [INFO ] Added : 11 causal constraints over 3 iterations in 464 ms. Result :sat
Minimization took 561 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[516] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[516] 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 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 95 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 84 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2025-06-01 11:58:31] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-01 11:58:31] [INFO ] Invariant cache hit.
[2025-06-01 11:58:32] [INFO ] Implicit Places using invariants in 831 ms returned []
[2025-06-01 11:58:32] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-01 11:58:32] [INFO ] Invariant cache hit.
[2025-06-01 11:58:33] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-01 11:58:35] [INFO ] Implicit Places using invariants and state equation in 2646 ms returned []
Implicit Place search using SMT with State Equation took 3480 ms to find 0 implicit places.
[2025-06-01 11:58:35] [INFO ] Redundant transitions in 22 ms returned []
Running 1216 sub problems to find dead transitions.
[2025-06-01 11:58:35] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-01 11:58:35] [INFO ] Invariant cache hit.
[2025-06-01 11:58:35] [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 11:59:02] [INFO ] Deduced a trap composed of 135 places in 225 ms of which 3 ms to minimize.
[2025-06-01 11:59:02] [INFO ] Deduced a trap composed of 131 places in 234 ms of which 5 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 5 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: 2/2 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, 2/5 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 3 (OVERLAPS) 688/1109 variables, 421/426 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1109 variables, 75/501 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 1717 constraints, problems are : Problem set: 0 solved, 1216 unsolved in 30858 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: 2/2 constraints]
After SMT, in 66890ms problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 66903ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70503 ms. Remains : 421/421 places, 1218/1218 transitions.
[2025-06-01 11:59:42] [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 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[516] Max Struct:[+inf]
[2025-06-01 11:59:42] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-01 11:59:42] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[516] Max Struct:[+inf]
RANDOM walk for 1000006 steps (2 resets) in 2987 ms. (334 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 946 ms. (1055 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[516] Max Struct:[+inf]
[2025-06-01 11:59:46] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-01 11:59:46] [INFO ] Invariant cache hit.
[2025-06-01 11:59:46] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-01 11:59:46] [INFO ] [Real]Absence check using state equation in 263 ms returned sat
[2025-06-01 11:59:46] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-01 11:59:46] [INFO ] [Real]Added 75 Read/Feed constraints in 99 ms returned sat
[2025-06-01 11:59:46] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:59:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-01 11:59:47] [INFO ] [Nat]Absence check using state equation in 317 ms returned sat
[2025-06-01 11:59:47] [INFO ] [Nat]Added 75 Read/Feed constraints in 78 ms returned sat
[2025-06-01 11:59:47] [INFO ] Deduced a trap composed of 113 places in 482 ms of which 5 ms to minimize.
[2025-06-01 11:59:48] [INFO ] Deduced a trap composed of 109 places in 514 ms of which 5 ms to minimize.
[2025-06-01 11:59:48] [INFO ] Deduced a trap composed of 87 places in 436 ms of which 5 ms to minimize.
[2025-06-01 11:59:49] [INFO ] Deduced a trap composed of 85 places in 408 ms of which 4 ms to minimize.
[2025-06-01 11:59:49] [INFO ] Deduced a trap composed of 76 places in 391 ms of which 5 ms to minimize.
[2025-06-01 11:59:50] [INFO ] Deduced a trap composed of 70 places in 393 ms of which 4 ms to minimize.
[2025-06-01 11:59:50] [INFO ] Deduced a trap composed of 71 places in 398 ms of which 4 ms to minimize.
[2025-06-01 11:59:50] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3309 ms
[2025-06-01 11:59:50] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 354 transitions) in 91 ms.
[2025-06-01 11:59:51] [INFO ] Added : 11 causal constraints over 3 iterations in 376 ms. Result :sat
Minimization took 537 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[516] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[516] 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 54 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2025-06-01 11:59:51] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-01 11:59:51] [INFO ] Invariant cache hit.
[2025-06-01 11:59:52] [INFO ] Implicit Places using invariants in 564 ms returned []
[2025-06-01 11:59:52] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-01 11:59:52] [INFO ] Invariant cache hit.
[2025-06-01 11:59:52] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-01 11:59:54] [INFO ] Implicit Places using invariants and state equation in 2559 ms returned []
Implicit Place search using SMT with State Equation took 3126 ms to find 0 implicit places.
[2025-06-01 11:59:54] [INFO ] Redundant transitions in 22 ms returned []
Running 1216 sub problems to find dead transitions.
[2025-06-01 11:59:54] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-01 11:59:54] [INFO ] Invariant cache hit.
[2025-06-01 11:59:54] [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:00:19] [INFO ] Deduced a trap composed of 135 places in 286 ms of which 4 ms to minimize.
[2025-06-01 12:00:20] [INFO ] Deduced a trap composed of 131 places in 261 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 421/1109 variables, and 5 constraints, problems are : Problem set: 0 solved, 1216 unsolved in 30023 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: 2/2 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, 2/5 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 3 (OVERLAPS) 688/1109 variables, 421/426 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1109 variables, 75/501 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 1717 constraints, problems are : Problem set: 0 solved, 1216 unsolved in 31014 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: 2/2 constraints]
After SMT, in 66926ms problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 66939ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70153 ms. Remains : 421/421 places, 1218/1218 transitions.
[2025-06-01 12:01: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 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 96 ms. (steps per millisecond=104 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[516] Max Struct:[+inf]
[2025-06-01 12:01:02] [INFO ] Flatten gal took : 31 ms
[2025-06-01 12:01:02] [INFO ] Flatten gal took : 31 ms
[2025-06-01 12:01:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7578215801846359059.gal : 5 ms
[2025-06-01 12:01:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15349265180404109644.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/ReachabilityCardinality7578215801846359059.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15349265180404109644.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
RANDOM walk for 40008 steps (8 resets) in 254 ms. (156 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality15349265180404109644.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.24463e+06
Interrupted probabilistic random walk after 353003 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :0 out of 1
Probabilistic random walk after 353003 steps, saw 216466 distinct states, run finished after 3001 ms. (steps per millisecond=117 ) properties seen :0
[2025-06-01 12:01:05] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-01 12:01:05] [INFO ] Invariant cache hit.
[2025-06-01 12:01: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 435 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 960ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4410 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 50 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.
RANDOM walk for 40003 steps (8 resets) in 156 ms. (254 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.24463e+06 after 3.74365e+10
Interrupted probabilistic random walk after 389239 steps, run timeout after 3001 ms. (steps per millisecond=129 ) properties seen :0 out of 1
Probabilistic random walk after 389239 steps, saw 238683 distinct states, run finished after 3001 ms. (steps per millisecond=129 ) properties seen :0
[2025-06-01 12:01:13] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-01 12:01:13] [INFO ] Invariant cache hit.
[2025-06-01 12:01: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 509 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 622 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 1150ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4892 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 53 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 53 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 50 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2025-06-01 12:01:20] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-01 12:01:20] [INFO ] Invariant cache hit.
[2025-06-01 12:01:20] [INFO ] Implicit Places using invariants in 595 ms returned []
[2025-06-01 12:01:20] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-01 12:01:20] [INFO ] Invariant cache hit.
[2025-06-01 12:01:21] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-01 12:01:23] [INFO ] Implicit Places using invariants and state equation in 2357 ms returned []
Implicit Place search using SMT with State Equation took 2953 ms to find 0 implicit places.
[2025-06-01 12:01:23] [INFO ] Redundant transitions in 24 ms returned []
Running 1216 sub problems to find dead transitions.
[2025-06-01 12:01:23] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-01 12:01:23] [INFO ] Invariant cache hit.
[2025-06-01 12:01:23] [INFO ] State equation strengthened by 75 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3.74365e+10 after 5.12697e+17
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
[2025-06-01 12:01:49] [INFO ] Deduced a trap composed of 135 places in 361 ms of which 5 ms to minimize.
[2025-06-01 12:01:50] [INFO ] Deduced a trap composed of 131 places in 381 ms of which 5 ms to minimize.
Detected timeout of ITS tools.
[2025-06-01 12:01:52] [INFO ] Flatten gal took : 49 ms
[2025-06-01 12:01:52] [INFO ] Applying decomposition
[2025-06-01 12:01:52] [INFO ] Flatten gal took : 50 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/graph13415871723409723608.txt' '-o' '/tmp/graph13415871723409723608.bin' '-w' '/tmp/graph13415871723409723608.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13415871723409723608.bin' '-l' '-1' '-v' '-w' '/tmp/graph13415871723409723608.weights' '-q' '0' '-e' '0.001'
[2025-06-01 12:01:52] [INFO ] Decomposing Gal with order
[2025-06-01 12:01:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 12:01:52] [INFO ] Removed a total of 2082 redundant transitions.
[2025-06-01 12:01:52] [INFO ] Flatten gal took : 96 ms
[2025-06-01 12:01:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 828 labels/synchronizations in 39 ms.
[2025-06-01 12:01:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8592338335798173331.gal : 11 ms
[2025-06-01 12:01:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8110311783952879635.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/ReachabilityCardinality8592338335798173331.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8110311783952879635.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/ReachabilityCardinality8110311783952879635.prop.
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 5 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: 2/2 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, 2/5 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 3 (OVERLAPS) 688/1109 variables, 421/426 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1109 variables, 75/501 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 1717 constraints, problems are : Problem set: 0 solved, 1216 unsolved in 31083 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: 2/2 constraints]
After SMT, in 67500ms problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 67514ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70550 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 0 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 47 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:02:30] [INFO ] Computed 3 invariants in 1 ms
[2025-06-01 12:02:30] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 12:02:30] [INFO ] After 18ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-06-01 12:02:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-01 12:02:30] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 12:02:30] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 12:02:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 12:02:30] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 12:02:30] [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:02:30] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 12:02:30] [INFO ] After 63ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-01 12:02:30] [INFO ] Flatten gal took : 1 ms
[2025-06-01 12:02:30] [INFO ] Flatten gal took : 2 ms
[2025-06-01 12:02:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9322318750494611415.gal : 1 ms
[2025-06-01 12:02:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17960183216501609325.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/ReachabilityCardinality9322318750494611415.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17960183216501609325.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/ReachabilityCardinality17960183216501609325.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 48
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :48 after 1139
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1139 after 31467
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :31467 after 84507
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :84507 after 189771
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :189771 after 399483
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :399483 after 818091
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :818091 after 1.65449e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.65449e+06 after 3.32648e+06
Detected timeout of ITS tools.
Detected timeout of ITS tools.
[2025-06-01 12:02:45] [INFO ] Flatten gal took : 2 ms
[2025-06-01 12:02:45] [INFO ] Applying decomposition
[2025-06-01 12:02: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/graph17284885954005077487.txt' '-o' '/tmp/graph17284885954005077487.bin' '-w' '/tmp/graph17284885954005077487.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17284885954005077487.bin' '-l' '-1' '-v' '-w' '/tmp/graph17284885954005077487.weights' '-q' '0' '-e' '0.001'
[2025-06-01 12:02:45] [INFO ] Decomposing Gal with order
[2025-06-01 12:02:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 12:02:45] [INFO ] Removed a total of 30 redundant transitions.
[2025-06-01 12:02:45] [INFO ] Flatten gal took : 3 ms
[2025-06-01 12:02:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2025-06-01 12:02:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality817505156194742215.gal : 1 ms
[2025-06-01 12:02:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3701259311204663509.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/ReachabilityCardinality817505156194742215.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3701259311204663509.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 ...306
Loading property file /tmp/ReachabilityCardinality3701259311204663509.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 48
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30251 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[516] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c016-UpperBounds-14 in 283795 ms.
[2025-06-01 12:03:00] [INFO ] Flatten gal took : 28 ms
[2025-06-01 12:03:00] [INFO ] Applying decomposition
[2025-06-01 12:03:00] [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/graph10312887742018379322.txt' '-o' '/tmp/graph10312887742018379322.bin' '-w' '/tmp/graph10312887742018379322.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10312887742018379322.bin' '-l' '-1' '-v' '-w' '/tmp/graph10312887742018379322.weights' '-q' '0' '-e' '0.001'
[2025-06-01 12:03:01] [INFO ] Decomposing Gal with order
[2025-06-01 12:03:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 12:03:01] [INFO ] Removed a total of 2138 redundant transitions.
[2025-06-01 12:03:01] [INFO ] Flatten gal took : 57 ms
[2025-06-01 12:03:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 901 labels/synchronizations in 26 ms.
[2025-06-01 12:03:01] [INFO ] Time to serialize gal into /tmp/UpperBounds11003991145717432499.gal : 9 ms
[2025-06-01 12:03:01] [INFO ] Time to serialize properties into /tmp/UpperBounds4602159893266931693.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/UpperBounds11003991145717432499.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds4602159893266931693.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/UpperBounds4602159893266931693.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-c016"
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-c016, 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-174867015800018"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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