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.r027-smll-174853774300068.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 BugTracking-PT-q3m256, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r027-smll-174853774300068
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 11K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K 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 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 16M 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 BugTracking-PT-q3m256-UpperBounds-00
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-01
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-02
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-03
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-04
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-05
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-06
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-07
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-08
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-09
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-10
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-11
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-12
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-13
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-14
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748551198739

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q3m256
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-29 20:40:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-29 20:40:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 20:40:03] [INFO ] Load time of PNML (sax parser for PT used): 1647 ms
[2025-05-29 20:40:03] [INFO ] Transformed 754 places.
[2025-05-29 20:40:03] [INFO ] Transformed 27370 transitions.
[2025-05-29 20:40:03] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 2025 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 ms.
Deduced a syphon composed of 514 places in 177 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m256-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+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] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-05-29 20:40:03] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
// Phase 1: matrix 2642 rows 240 cols
[2025-05-29 20:40:03] [INFO ] Computed 10 invariants in 64 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, +inf, 1, +inf, 1, +inf, 256, 1]
RANDOM walk for 10000 steps (5 resets) in 93 ms. (106 steps per ms)
FORMULA BugTracking-PT-q3m256-UpperBounds-12 256 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BugTracking-PT-q3m256-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60005 steps (12 resets) in 213 ms. (280 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 3, 0] Max Struct:[1, +inf, 1, +inf, +inf, 1]
[2025-05-29 20:40:04] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
[2025-05-29 20:40:04] [INFO ] Invariant cache hit.
[2025-05-29 20:40:04] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-29 20:40:05] [INFO ] [Real]Absence check using state equation in 1200 ms returned sat
[2025-05-29 20:40:06] [INFO ] State equation strengthened by 255 read => feed constraints.
[2025-05-29 20:40:06] [INFO ] [Real]Added 255 Read/Feed constraints in 93 ms returned sat
[2025-05-29 20:40:06] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:40:06] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-05-29 20:40:07] [INFO ] [Nat]Absence check using state equation in 1057 ms returned sat
[2025-05-29 20:40:07] [INFO ] [Nat]Added 255 Read/Feed constraints in 190 ms returned sat
[2025-05-29 20:40:08] [INFO ] Deduced a trap composed of 21 places in 668 ms of which 39 ms to minimize.
[2025-05-29 20:40:09] [INFO ] Deduced a trap composed of 40 places in 692 ms of which 4 ms to minimize.
[2025-05-29 20:40:10] [INFO ] Deduced a trap composed of 39 places in 892 ms of which 3 ms to minimize.
[2025-05-29 20:40:10] [INFO ] Deduced a trap composed of 66 places in 647 ms of which 4 ms to minimize.
[2025-05-29 20:40:11] [INFO ] Deduced a trap composed of 26 places in 543 ms of which 3 ms to minimize.
[2025-05-29 20:40:11] [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 0
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-05-29 20:40:11] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-05-29 20:40:12] [INFO ] [Real]Absence check using state equation in 600 ms returned sat
[2025-05-29 20:40:12] [INFO ] [Real]Added 255 Read/Feed constraints in 54 ms returned sat
[2025-05-29 20:40:12] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:40:12] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-05-29 20:40:13] [INFO ] [Nat]Absence check using state equation in 769 ms returned sat
[2025-05-29 20:40:13] [INFO ] [Nat]Added 255 Read/Feed constraints in 175 ms returned sat
[2025-05-29 20:40:13] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 369 ms.
[2025-05-29 20:40:14] [INFO ] Added : 3 causal constraints over 1 iterations in 851 ms. Result :sat
Minimization took 896 ms.
[2025-05-29 20:40:15] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-05-29 20:40:16] [INFO ] [Real]Absence check using state equation in 846 ms returned sat
[2025-05-29 20:40:16] [INFO ] [Real]Added 255 Read/Feed constraints in 89 ms returned sat
[2025-05-29 20:40:16] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:40:16] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-05-29 20:40:17] [INFO ] [Nat]Absence check using state equation in 924 ms returned sat
[2025-05-29 20:40:17] [INFO ] [Nat]Added 255 Read/Feed constraints in 163 ms returned sat
[2025-05-29 20:40:18] [INFO ] Deduced a trap composed of 21 places in 353 ms of which 2 ms to minimize.
[2025-05-29 20:40:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 593 ms
[2025-05-29 20:40:18] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 361 ms.
[2025-05-29 20:40:20] [INFO ] Deduced a trap composed of 9 places in 400 ms of which 2 ms to minimize.
[2025-05-29 20:40:20] [INFO ] Deduced a trap composed of 52 places in 492 ms of which 3 ms to minimize.
[2025-05-29 20:40:21] [INFO ] Deduced a trap composed of 7 places in 231 ms of which 2 ms to minimize.
Maximisation of solution failed !
Minimization took 2 ms.
[2025-05-29 20:40:21] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2025-05-29 20:40:22] [INFO ] [Real]Absence check using state equation in 802 ms returned sat
[2025-05-29 20:40:22] [INFO ] [Real]Added 255 Read/Feed constraints in 85 ms returned sat
[2025-05-29 20:40:22] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:40:22] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-05-29 20:40:23] [INFO ] [Nat]Absence check using state equation in 803 ms returned sat
[2025-05-29 20:40:23] [INFO ] [Nat]Added 255 Read/Feed constraints in 182 ms returned sat
[2025-05-29 20:40:24] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 335 ms.
[2025-05-29 20:40:24] [INFO ] Added : 6 causal constraints over 2 iterations in 993 ms. Result :sat
Minimization took 925 ms.
[2025-05-29 20:40:25] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-29 20:40:26] [INFO ] [Real]Absence check using state equation in 1002 ms returned sat
[2025-05-29 20:40:27] [INFO ] [Real]Added 255 Read/Feed constraints in 159 ms returned sat
[2025-05-29 20:40:27] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:40:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-29 20:40:28] [INFO ] [Nat]Absence check using state equation in 923 ms returned sat
[2025-05-29 20:40:28] [INFO ] [Nat]Added 255 Read/Feed constraints in 288 ms returned sat
[2025-05-29 20:40:29] [INFO ] Deduced a trap composed of 13 places in 592 ms of which 14 ms to minimize.
[2025-05-29 20:40:29] [INFO ] Deduced a trap composed of 17 places in 484 ms of which 4 ms to minimize.
[2025-05-29 20:40:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1361 ms
[2025-05-29 20:40:30] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 345 ms.
[2025-05-29 20:40:30] [INFO ] Added : 5 causal constraints over 1 iterations in 786 ms. Result :sat
Minimization took 943 ms.
[2025-05-29 20:40:31] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-29 20:40:32] [INFO ] [Real]Absence check using state equation in 818 ms returned sat
[2025-05-29 20:40:32] [INFO ] [Real]Added 255 Read/Feed constraints in 64 ms returned sat
[2025-05-29 20:40:32] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:40:32] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-05-29 20:40:33] [INFO ] [Nat]Absence check using state equation in 792 ms returned sat
[2025-05-29 20:40:33] [INFO ] [Nat]Added 255 Read/Feed constraints in 181 ms returned sat
[2025-05-29 20:40:34] [INFO ] Deduced a trap composed of 27 places in 391 ms of which 3 ms to minimize.
[2025-05-29 20:40:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 554 ms
[2025-05-29 20:40:34] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 281 ms.
[2025-05-29 20:40:36] [INFO ] Deduced a trap composed of 18 places in 779 ms of which 3 ms to minimize.
[2025-05-29 20:40:37] [INFO ] Deduced a trap composed of 11 places in 636 ms of which 3 ms to minimize.
[2025-05-29 20:40:37] [INFO ] Deduced a trap composed of 9 places in 578 ms of which 3 ms to minimize.
[2025-05-29 20:40:37] [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.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)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 3, 0] Max Struct:[1, +inf, 1, +inf, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 3, 0] Max Struct:[1, +inf, 1, +inf, +inf, 1]
Support contains 6 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 2769/2769 transitions.
Graph (complete) has 3422 edges and 240 vertex of which 238 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.22 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 237 transition count 2750
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 237 transition count 2750
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 235 transition count 2753
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 235 transition count 2747
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 229 transition count 2747
Applied a total of 19 rules in 544 ms. Remains 229 /240 variables (removed 11) and now considering 2747/2769 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 570 ms. Remains : 229/240 places, 2747/2769 transitions.
[2025-05-29 20:40:38] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
Found an invariant !
This invariant on transitions {4=1, 1722=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1, 1722=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 463 ms. (steps per millisecond=21 ) properties (out of 6) seen :[0, 0, 0, 0, 3, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 3, 0] Max Struct:[1, +inf, 1, +inf, +inf, 1]
[2025-05-29 20:40:40] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2025-05-29 20:40:40] [INFO ] Computed 8 invariants in 29 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 3, 0] Max Struct:[1, +inf, 1, +inf, +inf, 1]
RANDOM walk for 1000128 steps (2 resets) in 989 ms. (1010 steps per ms)
BEST_FIRST walk for 6000005 steps (12 resets) in 18074 ms. (331 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 3, 0] Max Struct:[1, +inf, 1, +inf, +inf, 1]
[2025-05-29 20:40:59] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2025-05-29 20:40:59] [INFO ] Invariant cache hit.
[2025-05-29 20:40:59] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-29 20:40:59] [INFO ] [Real]Absence check using state equation in 581 ms returned sat
[2025-05-29 20:40:59] [INFO ] State equation strengthened by 241 read => feed constraints.
[2025-05-29 20:41:00] [INFO ] [Real]Added 241 Read/Feed constraints in 107 ms returned sat
[2025-05-29 20:41:00] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:41:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-29 20:41:00] [INFO ] [Nat]Absence check using state equation in 745 ms returned sat
[2025-05-29 20:41:01] [INFO ] [Nat]Added 241 Read/Feed constraints in 205 ms returned sat
[2025-05-29 20:41:01] [INFO ] Deduced a trap composed of 19 places in 652 ms of which 3 ms to minimize.
[2025-05-29 20:41:02] [INFO ] Deduced a trap composed of 24 places in 298 ms of which 2 ms to minimize.
[2025-05-29 20:41:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1173 ms
[2025-05-29 20:41:02] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 332 ms.
[2025-05-29 20:41:03] [INFO ] Deduced a trap composed of 51 places in 644 ms of which 3 ms to minimize.
[2025-05-29 20:41:04] [INFO ] Deduced a trap composed of 21 places in 654 ms of which 3 ms to minimize.
[2025-05-29 20:41:05] [INFO ] Deduced a trap composed of 32 places in 645 ms of which 4 ms to minimize.
[2025-05-29 20:41:06] [INFO ] Deduced a trap composed of 28 places in 611 ms of which 3 ms to minimize.
[2025-05-29 20:41:06] [INFO ] Deduced a trap composed of 49 places in 382 ms of which 2 ms to minimize.
[2025-05-29 20:41:07] [INFO ] Deduced a trap composed of 51 places in 511 ms of which 3 ms to minimize.
[2025-05-29 20:41:07] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 4451 ms
[2025-05-29 20:41:07] [INFO ] Added : 7 causal constraints over 3 iterations in 5532 ms. Result :sat
Minimization took 2505 ms.
[2025-05-29 20:41:10] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-29 20:41:11] [INFO ] [Real]Absence check using state equation in 559 ms returned sat
[2025-05-29 20:41:11] [INFO ] [Real]Added 241 Read/Feed constraints in 49 ms returned sat
[2025-05-29 20:41:11] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:41:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-29 20:41:11] [INFO ] [Nat]Absence check using state equation in 571 ms returned sat
[2025-05-29 20:41:12] [INFO ] [Nat]Added 241 Read/Feed constraints in 161 ms returned sat
[2025-05-29 20:41:12] [INFO ] Deduced a trap composed of 66 places in 780 ms of which 3 ms to minimize.
[2025-05-29 20:41:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 919 ms
[2025-05-29 20:41:13] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 318 ms.
[2025-05-29 20:41:13] [INFO ] Added : 3 causal constraints over 1 iterations in 697 ms. Result :sat
Minimization took 2576 ms.
[2025-05-29 20:41:16] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-29 20:41:17] [INFO ] [Real]Absence check using state equation in 827 ms returned sat
[2025-05-29 20:41:17] [INFO ] [Real]Added 241 Read/Feed constraints in 74 ms returned sat
[2025-05-29 20:41:17] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:41:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-29 20:41:18] [INFO ] [Nat]Absence check using state equation in 821 ms returned sat
[2025-05-29 20:41:18] [INFO ] [Nat]Added 241 Read/Feed constraints in 154 ms returned sat
[2025-05-29 20:41:18] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 316 ms.
[2025-05-29 20:41:19] [INFO ] Added : 3 causal constraints over 1 iterations in 785 ms. Result :sat
Minimization took 2425 ms.
[2025-05-29 20:41:21] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-29 20:41:22] [INFO ] [Real]Absence check using state equation in 756 ms returned sat
[2025-05-29 20:41:22] [INFO ] [Real]Added 241 Read/Feed constraints in 58 ms returned sat
[2025-05-29 20:41:22] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:41:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-29 20:41:23] [INFO ] [Nat]Absence check using state equation in 829 ms returned sat
[2025-05-29 20:41:23] [INFO ] [Nat]Added 241 Read/Feed constraints in 110 ms returned sat
[2025-05-29 20:41:24] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 355 ms.
[2025-05-29 20:41:24] [INFO ] Added : 1 causal constraints over 1 iterations in 744 ms. Result :sat
Minimization took 2351 ms.
[2025-05-29 20:41:27] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-05-29 20:41:27] [INFO ] [Real]Absence check using state equation in 623 ms returned sat
[2025-05-29 20:41:28] [INFO ] [Real]Added 241 Read/Feed constraints in 100 ms returned sat
[2025-05-29 20:41:28] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:41:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-29 20:41:29] [INFO ] [Nat]Absence check using state equation in 953 ms returned sat
[2025-05-29 20:41:29] [INFO ] [Nat]Added 241 Read/Feed constraints in 351 ms returned sat
[2025-05-29 20:41:30] [INFO ] Deduced a trap composed of 73 places in 702 ms of which 4 ms to minimize.
[2025-05-29 20:41:31] [INFO ] Deduced a trap composed of 14 places in 713 ms of which 3 ms to minimize.
[2025-05-29 20:41:31] [INFO ] Deduced a trap composed of 48 places in 573 ms of which 3 ms to minimize.
[2025-05-29 20:41:32] [INFO ] Deduced a trap composed of 10 places in 618 ms of which 3 ms to minimize.
[2025-05-29 20:41:33] [INFO ] Deduced a trap composed of 36 places in 615 ms of which 3 ms to minimize.
[2025-05-29 20:41:33] [INFO ] Deduced a trap composed of 16 places in 608 ms of which 3 ms to minimize.
[2025-05-29 20:41:34] [INFO ] Deduced a trap composed of 13 places in 729 ms of which 3 ms to minimize.
[2025-05-29 20:41:35] [INFO ] Deduced a trap composed of 49 places in 673 ms of which 3 ms to minimize.
[2025-05-29 20:41:36] [INFO ] Deduced a trap composed of 50 places in 684 ms of which 3 ms to minimize.
[2025-05-29 20:41:36] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 6897 ms
[2025-05-29 20:41:36] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 364 ms.
[2025-05-29 20:41:37] [INFO ] Deduced a trap composed of 38 places in 657 ms of which 4 ms to minimize.
[2025-05-29 20:41:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 909 ms
[2025-05-29 20:41:38] [INFO ] Added : 7 causal constraints over 2 iterations in 1946 ms. Result :sat
Minimization took 2892 ms.
[2025-05-29 20:41:41] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-29 20:41:42] [INFO ] [Real]Absence check using state equation in 894 ms returned sat
[2025-05-29 20:41:42] [INFO ] [Real]Added 241 Read/Feed constraints in 87 ms returned sat
[2025-05-29 20:41:42] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:41:42] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-29 20:41:43] [INFO ] [Nat]Absence check using state equation in 783 ms returned sat
[2025-05-29 20:41:43] [INFO ] [Nat]Added 241 Read/Feed constraints in 187 ms returned sat
[2025-05-29 20:41:44] [INFO ] Deduced a trap composed of 19 places in 805 ms of which 4 ms to minimize.
[2025-05-29 20:41:45] [INFO ] Deduced a trap composed of 60 places in 708 ms of which 3 ms to minimize.
[2025-05-29 20:41:46] [INFO ] Deduced a trap composed of 24 places in 643 ms of which 3 ms to minimize.
[2025-05-29 20:41:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2532 ms
[2025-05-29 20:41:46] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 362 ms.
[2025-05-29 20:41:47] [INFO ] Added : 6 causal constraints over 2 iterations in 974 ms. Result :sat
Minimization took 2877 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 3, 0] Max Struct:[1, +inf, 1, +inf, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 3, 0] Max Struct:[1, +inf, 1, +inf, +inf, 1]
Support contains 6 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 62 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 61 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2025-05-29 20:41:51] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2025-05-29 20:41:51] [INFO ] Invariant cache hit.
[2025-05-29 20:41:52] [INFO ] Implicit Places using invariants in 681 ms returned []
[2025-05-29 20:41:52] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2025-05-29 20:41:52] [INFO ] Invariant cache hit.
[2025-05-29 20:41:52] [INFO ] State equation strengthened by 241 read => feed constraints.
[2025-05-29 20:41:55] [INFO ] Implicit Places using invariants and state equation in 3301 ms returned []
Implicit Place search using SMT with State Equation took 3984 ms to find 0 implicit places.
[2025-05-29 20:41:55] [INFO ] Redundant transitions in 383 ms returned []
Running 2746 sub problems to find dead transitions.
[2025-05-29 20:41:55] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2025-05-29 20:41:55] [INFO ] Invariant cache hit.
[2025-05-29 20:41:55] [INFO ] State equation strengthened by 241 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2746 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 229/2847 variables, and 8 constraints, problems are : Problem set: 0 solved, 2746 unsolved in 30115 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/229 constraints, ReadFeed: 0/241 constraints, PredecessorRefiner: 2746/2746 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2746 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2746 unsolved
[2025-05-29 20:43:13] [INFO ] Deduced a trap composed of 6 places in 149 ms of which 1 ms to minimize.
[2025-05-29 20:43:18] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 2 ms to minimize.
Problem TDEAD1433 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1435 is UNSAT
Problem TDEAD1436 is UNSAT
Problem TDEAD1437 is UNSAT
Problem TDEAD1438 is UNSAT
Problem TDEAD1439 is UNSAT
[2025-05-29 20:43:18] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 2 ms to minimize.
Problem TDEAD1440 is UNSAT
Problem TDEAD1441 is UNSAT
Problem TDEAD1442 is UNSAT
Problem TDEAD1443 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1446 is UNSAT
Problem TDEAD1447 is UNSAT
Problem TDEAD1448 is UNSAT
Problem TDEAD1449 is UNSAT
Problem TDEAD1450 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1458 is UNSAT
Problem TDEAD1459 is UNSAT
Problem TDEAD1460 is UNSAT
Problem TDEAD1461 is UNSAT
Problem TDEAD1462 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1468 is UNSAT
Problem TDEAD1469 is UNSAT
Problem TDEAD1470 is UNSAT
Problem TDEAD1471 is UNSAT
Problem TDEAD1472 is UNSAT
Problem TDEAD1473 is UNSAT
[2025-05-29 20:43:18] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 2 ms to minimize.
Problem TDEAD1474 is UNSAT
Problem TDEAD1475 is UNSAT
[2025-05-29 20:43:19] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 1 ms to minimize.
Problem TDEAD1476 is UNSAT
Problem TDEAD1477 is UNSAT
[2025-05-29 20:43:19] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
Problem TDEAD1480 is UNSAT
Problem TDEAD1481 is UNSAT
Problem TDEAD1482 is UNSAT
Problem TDEAD1483 is UNSAT
Problem TDEAD1485 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1490 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1497 is UNSAT
Problem TDEAD1498 is UNSAT
Problem TDEAD1501 is UNSAT
Problem TDEAD1502 is UNSAT
Problem TDEAD1503 is UNSAT
Problem TDEAD1504 is UNSAT
Problem TDEAD1506 is UNSAT
Problem TDEAD1507 is UNSAT
Problem TDEAD1510 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1513 is UNSAT
Problem TDEAD1516 is UNSAT
Problem TDEAD1517 is UNSAT
Problem TDEAD1518 is UNSAT
Problem TDEAD1519 is UNSAT
Problem TDEAD1562 is UNSAT
Problem TDEAD1563 is UNSAT
Problem TDEAD1564 is UNSAT
Problem TDEAD1565 is UNSAT
Problem TDEAD1566 is UNSAT
Problem TDEAD1567 is UNSAT
Problem TDEAD1568 is UNSAT
Problem TDEAD1569 is UNSAT
Problem TDEAD1570 is UNSAT
Problem TDEAD1571 is UNSAT
Problem TDEAD1572 is UNSAT
Problem TDEAD1573 is UNSAT
Problem TDEAD1574 is UNSAT
Problem TDEAD1575 is UNSAT
Problem TDEAD1576 is UNSAT
Problem TDEAD1577 is UNSAT
Problem TDEAD1578 is UNSAT
Problem TDEAD1579 is UNSAT
Problem TDEAD1580 is UNSAT
Problem TDEAD1581 is UNSAT
Problem TDEAD1582 is UNSAT
Problem TDEAD1583 is UNSAT
Problem TDEAD1584 is UNSAT
Problem TDEAD1585 is UNSAT
Problem TDEAD1586 is UNSAT
Problem TDEAD1587 is UNSAT
Problem TDEAD1588 is UNSAT
Problem TDEAD1589 is UNSAT
Problem TDEAD1590 is UNSAT
Problem TDEAD1591 is UNSAT
Problem TDEAD1592 is UNSAT
Problem TDEAD1593 is UNSAT
Problem TDEAD1594 is UNSAT
Problem TDEAD1595 is UNSAT
Problem TDEAD1596 is UNSAT
Problem TDEAD1597 is UNSAT
Problem TDEAD1598 is UNSAT
Problem TDEAD1599 is UNSAT
Problem TDEAD1600 is UNSAT
Problem TDEAD1601 is UNSAT
Problem TDEAD1602 is UNSAT
Problem TDEAD1603 is UNSAT
Problem TDEAD1604 is UNSAT
Problem TDEAD1605 is UNSAT
Problem TDEAD1606 is UNSAT
Problem TDEAD1607 is UNSAT
Problem TDEAD1608 is UNSAT
Problem TDEAD1609 is UNSAT
Problem TDEAD1610 is UNSAT
Problem TDEAD1611 is UNSAT
Problem TDEAD1612 is UNSAT
Problem TDEAD1613 is UNSAT
Problem TDEAD1614 is UNSAT
Problem TDEAD1615 is UNSAT
Problem TDEAD1616 is UNSAT
Problem TDEAD1617 is UNSAT
Problem TDEAD1618 is UNSAT
Problem TDEAD1619 is UNSAT
Problem TDEAD1620 is UNSAT
Problem TDEAD1621 is UNSAT
Problem TDEAD1622 is UNSAT
Problem TDEAD1623 is UNSAT
Problem TDEAD1624 is UNSAT
Problem TDEAD1625 is UNSAT
Problem TDEAD1626 is UNSAT
Problem TDEAD1627 is UNSAT
Problem TDEAD1628 is UNSAT
Problem TDEAD1629 is UNSAT
Problem TDEAD1630 is UNSAT
Problem TDEAD1631 is UNSAT
Problem TDEAD1632 is UNSAT
Problem TDEAD1633 is UNSAT
Problem TDEAD1634 is UNSAT
Problem TDEAD1635 is UNSAT
Problem TDEAD1636 is UNSAT
Problem TDEAD1637 is UNSAT
Problem TDEAD1638 is UNSAT
Problem TDEAD1639 is UNSAT
Problem TDEAD1640 is UNSAT
Problem TDEAD1641 is UNSAT
Problem TDEAD1642 is UNSAT
Problem TDEAD1643 is UNSAT
Problem TDEAD1644 is UNSAT
Problem TDEAD1645 is UNSAT
Problem TDEAD1716 is UNSAT
Problem TDEAD1717 is UNSAT
Problem TDEAD1718 is UNSAT
Problem TDEAD1719 is UNSAT
Problem TDEAD1720 is UNSAT
Problem TDEAD1721 is UNSAT
Problem TDEAD1722 is UNSAT
Problem TDEAD1723 is UNSAT
Problem TDEAD1724 is UNSAT
Problem TDEAD1725 is UNSAT
Problem TDEAD1726 is UNSAT
Problem TDEAD1727 is UNSAT
Problem TDEAD1728 is UNSAT
Problem TDEAD1729 is UNSAT
Problem TDEAD1730 is UNSAT
Problem TDEAD1731 is UNSAT
Problem TDEAD1732 is UNSAT
Problem TDEAD1733 is UNSAT
Problem TDEAD1734 is UNSAT
Problem TDEAD1735 is UNSAT
Problem TDEAD1736 is UNSAT
Problem TDEAD1737 is UNSAT
Problem TDEAD1738 is UNSAT
Problem TDEAD1739 is UNSAT
Problem TDEAD1740 is UNSAT
Problem TDEAD1741 is UNSAT
Problem TDEAD1742 is UNSAT
Problem TDEAD1743 is UNSAT
Problem TDEAD1747 is UNSAT
Problem TDEAD1748 is UNSAT
Problem TDEAD1752 is UNSAT
Problem TDEAD1753 is UNSAT
Problem TDEAD1754 is UNSAT
Problem TDEAD1755 is UNSAT
Problem TDEAD1756 is UNSAT
Problem TDEAD1757 is UNSAT
Problem TDEAD1763 is UNSAT
Problem TDEAD1764 is UNSAT
Problem TDEAD1766 is UNSAT
Problem TDEAD1767 is UNSAT
Problem TDEAD1771 is UNSAT
Problem TDEAD1772 is UNSAT
Problem TDEAD1773 is UNSAT
Problem TDEAD1774 is UNSAT
Problem TDEAD1775 is UNSAT
Problem TDEAD1776 is UNSAT
Problem TDEAD1782 is UNSAT
Problem TDEAD1783 is UNSAT
Problem TDEAD1785 is UNSAT
Problem TDEAD1786 is UNSAT
Problem TDEAD1790 is UNSAT
Problem TDEAD1791 is UNSAT
Problem TDEAD1792 is UNSAT
Problem TDEAD1793 is UNSAT
Problem TDEAD1794 is UNSAT
Problem TDEAD1795 is UNSAT
Problem TDEAD1801 is UNSAT
Problem TDEAD1802 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 229/2847 variables, and 14 constraints, problems are : Problem set: 206 solved, 2540 unsolved in 30067 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/229 constraints, ReadFeed: 0/241 constraints, PredecessorRefiner: 0/2746 constraints, Known Traps: 6/6 constraints]
After SMT, in 94347ms problems are : Problem set: 206 solved, 2540 unsolved
Search for dead transitions found 206 dead transitions in 94454ms
Found 206 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 206 transitions
Dead transitions reduction (with SMT) removed 206 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 229/229 places, 2541/2747 transitions.
Reduce places removed 25 places and 534 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 204 transition count 2007
Reduce places removed 19 places and 264 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 44 place count 185 transition count 1743
Reduce places removed 9 places and 198 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 53 place count 176 transition count 1545
Reduce places removed 9 places and 121 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 62 place count 167 transition count 1424
Reduce places removed 3 places and 66 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 65 place count 164 transition count 1358
Reduce places removed 3 places and 53 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 68 place count 161 transition count 1305
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 70 place count 159 transition count 1280
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 17 places and 276 transitions.
Iterating global reduction 6 with 19 rules applied. Total rules applied 89 place count 142 transition count 1004
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 89 rules in 77 ms. Remains 142 /229 variables (removed 87) and now considering 1004/2541 (removed 1537) transitions.
[2025-05-29 20:43:30] [INFO ] Flow matrix only has 946 transitions (discarded 58 similar events)
// Phase 1: matrix 946 rows 142 cols
[2025-05-29 20:43:30] [INFO ] Computed 10 invariants in 10 ms
[2025-05-29 20:43:30] [INFO ] Implicit Places using invariants in 390 ms returned []
[2025-05-29 20:43:30] [INFO ] Flow matrix only has 946 transitions (discarded 58 similar events)
[2025-05-29 20:43:30] [INFO ] Invariant cache hit.
[2025-05-29 20:43:31] [INFO ] State equation strengthened by 119 read => feed constraints.
[2025-05-29 20:43:31] [INFO ] Implicit Places using invariants and state equation in 958 ms returned []
Implicit Place search using SMT with State Equation took 1353 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 142/229 places, 1004/2747 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 100373 ms. Remains : 142/229 places, 1004/2747 transitions.
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
FORMULA BugTracking-PT-q3m256-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-29 20:43:31] [INFO ] Flow matrix only has 946 transitions (discarded 58 similar events)
Found an invariant !
This invariant on transitions {0=1, 594=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {4=1, 594=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 4) seen :[0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 3, 0] Max Struct:[1, +inf, 1, +inf, +inf, 1]
[2025-05-29 20:43:32] [INFO ] Flow matrix only has 946 transitions (discarded 58 similar events)
// Phase 1: matrix 946 rows 140 cols
[2025-05-29 20:43:32] [INFO ] Computed 8 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 3, 0] Max Struct:[1, +inf, 1, 1, +inf, 1]
RANDOM walk for 1000181 steps (2 resets) in 875 ms. (1141 steps per ms)
BEST_FIRST walk for 4000003 steps (8 resets) in 5809 ms. (688 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 3, 0, 3, 0] Max Struct:[1, +inf, 1, 1, +inf, 1]
Inconsistency detected : max struct is less than max seen for bound index 2
[2025-05-29 20:43:38] [INFO ] Flow matrix only has 946 transitions (discarded 58 similar events)
[2025-05-29 20:43:38] [INFO ] Invariant cache hit.
[2025-05-29 20:43:39] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-05-29 20:43:39] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2025-05-29 20:43:39] [INFO ] State equation strengthened by 119 read => feed constraints.
[2025-05-29 20:43:39] [INFO ] [Real]Added 119 Read/Feed constraints in 20 ms returned sat
[2025-05-29 20:43:39] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:43:39] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-29 20:43:39] [INFO ] [Nat]Absence check using state equation in 292 ms returned sat
[2025-05-29 20:43:39] [INFO ] [Nat]Added 119 Read/Feed constraints in 91 ms returned sat
[2025-05-29 20:43:39] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 2 ms to minimize.
[2025-05-29 20:43:40] [INFO ] Deduced a trap composed of 38 places in 134 ms of which 1 ms to minimize.
[2025-05-29 20:43:40] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 1 ms to minimize.
[2025-05-29 20:43:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 569 ms
[2025-05-29 20:43:40] [INFO ] Computed and/alt/rep : 232/915/231 causal constraints (skipped 714 transitions) in 88 ms.
[2025-05-29 20:43:40] [INFO ] Added : 6 causal constraints over 2 iterations in 308 ms. Result :sat
Minimization took 595 ms.
[2025-05-29 20:43:41] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-05-29 20:43:41] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2025-05-29 20:43:41] [INFO ] [Real]Added 119 Read/Feed constraints in 27 ms returned sat
[2025-05-29 20:43:41] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:43:41] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-05-29 20:43:41] [INFO ] [Nat]Absence check using state equation in 317 ms returned sat
[2025-05-29 20:43:42] [INFO ] [Nat]Added 119 Read/Feed constraints in 50 ms returned sat
[2025-05-29 20:43:42] [INFO ] Computed and/alt/rep : 232/915/231 causal constraints (skipped 714 transitions) in 120 ms.
[2025-05-29 20:43:42] [INFO ] Added : 1 causal constraints over 1 iterations in 257 ms. Result :sat
Minimization took 516 ms.
[2025-05-29 20:43:42] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-29 20:43:43] [INFO ] [Real]Absence check using state equation in 292 ms returned sat
[2025-05-29 20:43:43] [INFO ] [Real]Added 119 Read/Feed constraints in 34 ms returned sat
[2025-05-29 20:43:43] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:43:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-05-29 20:43:43] [INFO ] [Nat]Absence check using state equation in 217 ms returned sat
[2025-05-29 20:43:43] [INFO ] [Nat]Added 119 Read/Feed constraints in 28 ms returned sat
[2025-05-29 20:43:43] [INFO ] Computed and/alt/rep : 232/915/231 causal constraints (skipped 714 transitions) in 76 ms.
[2025-05-29 20:43:43] [INFO ] Added : 2 causal constraints over 1 iterations in 176 ms. Result :sat
Minimization took 405 ms.
[2025-05-29 20:43:44] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-05-29 20:43:44] [INFO ] [Real]Absence check using state equation in 282 ms returned sat
[2025-05-29 20:43:44] [INFO ] [Real]Added 119 Read/Feed constraints in 27 ms returned sat
[2025-05-29 20:43:44] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:43:44] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-05-29 20:43:44] [INFO ] [Nat]Absence check using state equation in 269 ms returned sat
[2025-05-29 20:43:44] [INFO ] [Nat]Added 119 Read/Feed constraints in 40 ms returned sat
[2025-05-29 20:43:45] [INFO ] Deduced a trap composed of 44 places in 183 ms of which 1 ms to minimize.
[2025-05-29 20:43:45] [INFO ] Deduced a trap composed of 14 places in 242 ms of which 2 ms to minimize.
[2025-05-29 20:43:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 519 ms
[2025-05-29 20:43:45] [INFO ] Computed and/alt/rep : 232/915/231 causal constraints (skipped 714 transitions) in 104 ms.
[2025-05-29 20:43:46] [INFO ] Deduced a trap composed of 10 places in 199 ms of which 1 ms to minimize.
[2025-05-29 20:43:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 289 ms
[2025-05-29 20:43:46] [INFO ] Added : 9 causal constraints over 3 iterations in 658 ms. Result :sat
Minimization took 438 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 3, 0, 3, 0] Max Struct:[1, +inf, 1, 1, +inf, 1]
Inconsistency detected : max struct is less than max seen for bound index 2
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 3, 0, 3, 0] Max Struct:[1, +inf, 1, 1, +inf, 1]
Inconsistency detected : max struct is less than max seen for bound index 2
Support contains 4 out of 140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 1004/1004 transitions.
Applied a total of 0 rules in 24 ms. Remains 140 /140 variables (removed 0) and now considering 1004/1004 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 140/140 places, 1004/1004 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 1004/1004 transitions.
Applied a total of 0 rules in 23 ms. Remains 140 /140 variables (removed 0) and now considering 1004/1004 (removed 0) transitions.
[2025-05-29 20:43:47] [INFO ] Flow matrix only has 946 transitions (discarded 58 similar events)
[2025-05-29 20:43:47] [INFO ] Invariant cache hit.
[2025-05-29 20:43:47] [INFO ] Implicit Places using invariants in 266 ms returned []
[2025-05-29 20:43:47] [INFO ] Flow matrix only has 946 transitions (discarded 58 similar events)
[2025-05-29 20:43:47] [INFO ] Invariant cache hit.
[2025-05-29 20:43:47] [INFO ] State equation strengthened by 119 read => feed constraints.
[2025-05-29 20:43:48] [INFO ] Implicit Places using invariants and state equation in 905 ms returned []
Implicit Place search using SMT with State Equation took 1177 ms to find 0 implicit places.
[2025-05-29 20:43:48] [INFO ] Redundant transitions in 74 ms returned []
Running 1003 sub problems to find dead transitions.
[2025-05-29 20:43:48] [INFO ] Flow matrix only has 946 transitions (discarded 58 similar events)
[2025-05-29 20:43:48] [INFO ] Invariant cache hit.
[2025-05-29 20:43:48] [INFO ] State equation strengthened by 119 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1003 unsolved
[2025-05-29 20:43:57] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 1 ms to minimize.
[2025-05-29 20:44:00] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 2 ms to minimize.
[2025-05-29 20:44:00] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
[2025-05-29 20:44:01] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
Problem TDEAD627 is UNSAT
[2025-05-29 20:44:01] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
[2025-05-29 20:44:02] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
Problem TDEAD971 is UNSAT
Problem TDEAD972 is UNSAT
[2025-05-29 20:44:02] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 0 ms to minimize.
Problem TDEAD980 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD115 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 7/15 constraints. Problems are: Problem set: 164 solved, 839 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/15 constraints. Problems are: Problem set: 164 solved, 839 unsolved
Problem TDEAD626 is UNSAT
At refinement iteration 3 (OVERLAPS) 946/1086 variables, 140/155 constraints. Problems are: Problem set: 165 solved, 838 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1086 variables, 119/274 constraints. Problems are: Problem set: 165 solved, 838 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1086/1086 variables, and 274 constraints, problems are : Problem set: 165 solved, 838 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 140/140 constraints, ReadFeed: 119/119 constraints, PredecessorRefiner: 1003/1003 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 165 solved, 838 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 7/7 constraints. Problems are: Problem set: 165 solved, 838 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 7/14 constraints. Problems are: Problem set: 165 solved, 838 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/14 constraints. Problems are: Problem set: 165 solved, 838 unsolved
At refinement iteration 3 (OVERLAPS) 1/140 variables, 1/15 constraints. Problems are: Problem set: 165 solved, 838 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/15 constraints. Problems are: Problem set: 165 solved, 838 unsolved
At refinement iteration 5 (OVERLAPS) 946/1086 variables, 140/155 constraints. Problems are: Problem set: 165 solved, 838 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1086 variables, 119/274 constraints. Problems are: Problem set: 165 solved, 838 unsolved
Problem TDEAD106 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD944 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD960 is UNSAT
Problem TDEAD964 is UNSAT
Problem TDEAD984 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/1086 variables, 838/1112 constraints. Problems are: Problem set: 241 solved, 762 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1086/1086 variables, and 1112 constraints, problems are : Problem set: 241 solved, 762 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 140/140 constraints, ReadFeed: 119/119 constraints, PredecessorRefiner: 838/1003 constraints, Known Traps: 7/7 constraints]
After SMT, in 64224ms problems are : Problem set: 241 solved, 762 unsolved
Search for dead transitions found 241 dead transitions in 64244ms
Found 241 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 241 transitions
Dead transitions reduction (with SMT) removed 241 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 140/140 places, 763/1004 transitions.
Graph (complete) has 1076 edges and 140 vertex of which 139 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 22 places and 278 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 117 transition count 485
Reduce places removed 15 places and 90 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 38 place count 102 transition count 395
Reduce places removed 3 places and 29 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 41 place count 99 transition count 366
Reduce places removed 2 places and 16 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 43 place count 97 transition count 350
Reduce places removed 1 places and 14 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 44 place count 96 transition count 336
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 49 place count 91 transition count 298
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 5 with 5 rules applied. Total rules applied 54 place count 91 transition count 298
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 54 rules in 24 ms. Remains 91 /140 variables (removed 49) and now considering 298/763 (removed 465) transitions.
[2025-05-29 20:44:52] [INFO ] Flow matrix only has 283 transitions (discarded 15 similar events)
// Phase 1: matrix 283 rows 91 cols
[2025-05-29 20:44:52] [INFO ] Computed 12 invariants in 2 ms
[2025-05-29 20:44:52] [INFO ] Implicit Places using invariants in 130 ms returned []
[2025-05-29 20:44:52] [INFO ] Flow matrix only has 283 transitions (discarded 15 similar events)
[2025-05-29 20:44:52] [INFO ] Invariant cache hit.
[2025-05-29 20:44:52] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-05-29 20:44:53] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 91/140 places, 298/1004 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 66004 ms. Remains : 91/140 places, 298/1004 transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
FORMULA BugTracking-PT-q3m256-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-29 20:44:53] [INFO ] Flow matrix only has 283 transitions (discarded 15 similar events)
Found an invariant !
This invariant on transitions {5=1, 210=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {2=1, 210=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 3, 0, 3, 0] Max Struct:[1, +inf, 1, 1, +inf, 1]
Inconsistency detected : max struct is less than max seen for bound index 2
[2025-05-29 20:44:53] [INFO ] Flow matrix only has 283 transitions (discarded 15 similar events)
// Phase 1: matrix 283 rows 88 cols
[2025-05-29 20:44:53] [INFO ] Computed 9 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 3, 0, 3, 0] Max Struct:[1, +inf, 1, 1, +inf, 1]
Inconsistency detected : max struct is less than max seen for bound index 2
RANDOM walk for 1000129 steps (2 resets) in 454 ms. (2198 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 736 ms. (1356 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 3, 0, 3, 0] Max Struct:[1, +inf, 1, 1, +inf, 1]
Inconsistency detected : max struct is less than max seen for bound index 2
[2025-05-29 20:44:54] [INFO ] Flow matrix only has 283 transitions (discarded 15 similar events)
[2025-05-29 20:44:54] [INFO ] Invariant cache hit.
[2025-05-29 20:44:54] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-29 20:44:54] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-29 20:44:54] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2025-05-29 20:44:54] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-05-29 20:44:54] [INFO ] [Real]Added 55 Read/Feed constraints in 14 ms returned sat
[2025-05-29 20:44:54] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:44:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-05-29 20:44:54] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-29 20:44:54] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2025-05-29 20:44:54] [INFO ] [Nat]Added 55 Read/Feed constraints in 12 ms returned sat
[2025-05-29 20:44:54] [INFO ] Computed and/alt/rep : 173/829/173 causal constraints (skipped 109 transitions) in 22 ms.
[2025-05-29 20:44:55] [INFO ] Added : 50 causal constraints over 10 iterations in 246 ms. Result :sat
Minimization took 132 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 3, 0, 3, 0] Max Struct:[1, +inf, 1, 1, +inf, 1]
Inconsistency detected : max struct is less than max seen for bound index 2
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 0, 3, 0, 3, 0] Max Struct:[1, +inf, 1, 1, +inf, 1]
Inconsistency detected : max struct is less than max seen for bound index 0
Inconsistency detected : max struct is less than max seen for bound index 2
Support contains 1 out of 88 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place ch2_PENDING_q8) removed 13 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 285/285 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 87 transition count 277
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 87 transition count 277
Applied a total of 2 rules in 7 ms. Remains 87 /88 variables (removed 1) and now considering 277/285 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 87/88 places, 277/285 transitions.
[2025-05-29 20:44:55] [INFO ] Flow matrix only has 263 transitions (discarded 14 similar events)
Found an invariant !
This invariant on transitions {1=1, 190=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {3=1, 190=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[2, 0, 3, 0, 3, 0] Max Struct:[1, +inf, 1, 1, +inf, 1]
Inconsistency detected : max struct is less than max seen for bound index 0
Inconsistency detected : max struct is less than max seen for bound index 2
[2025-05-29 20:44:55] [INFO ] Flow matrix only has 263 transitions (discarded 14 similar events)
// Phase 1: matrix 263 rows 87 cols
[2025-05-29 20:44:55] [INFO ] Computed 9 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2, 0, 3, 0, 3, 0] Max Struct:[1, +inf, 1, 1, +inf, 1]
Inconsistency detected : max struct is less than max seen for bound index 0
Inconsistency detected : max struct is less than max seen for bound index 2
RANDOM walk for 1000132 steps (2 resets) in 492 ms. (2028 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 760 ms. (1314 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 0, 3, 0, 3, 0] Max Struct:[1, +inf, 1, 1, +inf, 1]
Inconsistency detected : max struct is less than max seen for bound index 0
Inconsistency detected : max struct is less than max seen for bound index 2
[2025-05-29 20:44:56] [INFO ] Flow matrix only has 263 transitions (discarded 14 similar events)
[2025-05-29 20:44:56] [INFO ] Invariant cache hit.
[2025-05-29 20:44:56] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-29 20:44:56] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-29 20:44:56] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2025-05-29 20:44:56] [INFO ] State equation strengthened by 54 read => feed constraints.
[2025-05-29 20:44:56] [INFO ] [Real]Added 54 Read/Feed constraints in 17 ms returned sat
[2025-05-29 20:44:56] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:44:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-05-29 20:44:56] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-29 20:44:57] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2025-05-29 20:44:57] [INFO ] [Nat]Added 54 Read/Feed constraints in 15 ms returned sat
[2025-05-29 20:44:57] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2025-05-29 20:44:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2025-05-29 20:44:57] [INFO ] Computed and/alt/rep : 169/831/169 causal constraints (skipped 93 transitions) in 25 ms.
[2025-05-29 20:44:57] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2025-05-29 20:44:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2025-05-29 20:44:57] [INFO ] Added : 33 causal constraints over 7 iterations in 296 ms. Result :sat
Minimization took 94 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 0, 3, 0, 3, 0] Max Struct:[1, +inf, 1, 1, +inf, 1]
Inconsistency detected : max struct is less than max seen for bound index 0
Inconsistency detected : max struct is less than max seen for bound index 2
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 0, 3, 0, 3, 0] Max Struct:[1, +inf, 1, 1, +inf, 1]
Inconsistency detected : max struct is less than max seen for bound index 0
Inconsistency detected : max struct is less than max seen for bound index 2
Support contains 1 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 277/277 transitions.
Applied a total of 0 rules in 6 ms. Remains 87 /87 variables (removed 0) and now considering 277/277 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 87/87 places, 277/277 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 277/277 transitions.
Applied a total of 0 rules in 5 ms. Remains 87 /87 variables (removed 0) and now considering 277/277 (removed 0) transitions.
[2025-05-29 20:44:57] [INFO ] Flow matrix only has 263 transitions (discarded 14 similar events)
[2025-05-29 20:44:57] [INFO ] Invariant cache hit.
[2025-05-29 20:44:57] [INFO ] Implicit Places using invariants in 111 ms returned []
[2025-05-29 20:44:57] [INFO ] Flow matrix only has 263 transitions (discarded 14 similar events)
[2025-05-29 20:44:57] [INFO ] Invariant cache hit.
[2025-05-29 20:44:57] [INFO ] State equation strengthened by 54 read => feed constraints.
[2025-05-29 20:44:58] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 498 ms to find 0 implicit places.
[2025-05-29 20:44:58] [INFO ] Redundant transitions in 3 ms returned []
Running 276 sub problems to find dead transitions.
[2025-05-29 20:44:58] [INFO ] Flow matrix only has 263 transitions (discarded 14 similar events)
[2025-05-29 20:44:58] [INFO ] Invariant cache hit.
[2025-05-29 20:44:58] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
At refinement iteration 3 (OVERLAPS) 263/349 variables, 86/95 constraints. Problems are: Problem set: 2 solved, 274 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 54/149 constraints. Problems are: Problem set: 2 solved, 274 unsolved
[2025-05-29 20:45:04] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 1/150 constraints. Problems are: Problem set: 2 solved, 274 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 0/150 constraints. Problems are: Problem set: 2 solved, 274 unsolved
At refinement iteration 7 (OVERLAPS) 1/350 variables, 1/151 constraints. Problems are: Problem set: 2 solved, 274 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/350 variables, 0/151 constraints. Problems are: Problem set: 2 solved, 274 unsolved
At refinement iteration 9 (OVERLAPS) 0/350 variables, 0/151 constraints. Problems are: Problem set: 2 solved, 274 unsolved
No progress, stopping.
After SMT solving in domain Real declared 350/350 variables, and 151 constraints, problems are : Problem set: 2 solved, 274 unsolved in 19609 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 274 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 8/8 constraints. Problems are: Problem set: 2 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 1/9 constraints. Problems are: Problem set: 2 solved, 274 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/10 constraints. Problems are: Problem set: 2 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 274 unsolved
At refinement iteration 4 (OVERLAPS) 263/349 variables, 86/96 constraints. Problems are: Problem set: 2 solved, 274 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 54/150 constraints. Problems are: Problem set: 2 solved, 274 unsolved
Problem TDEAD146 is UNSAT
Problem TDEAD151 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 220/370 constraints. Problems are: Problem set: 4 solved, 272 unsolved
[2025-05-29 20:45:25] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 1/371 constraints. Problems are: Problem set: 4 solved, 272 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 0/371 constraints. Problems are: Problem set: 4 solved, 272 unsolved
At refinement iteration 9 (OVERLAPS) 1/350 variables, 1/372 constraints. Problems are: Problem set: 4 solved, 272 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/350 variables, 54/426 constraints. Problems are: Problem set: 4 solved, 272 unsolved
[2025-05-29 20:45:37] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/350 variables, 1/427 constraints. Problems are: Problem set: 39 solved, 237 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/350 variables, 0/427 constraints. Problems are: Problem set: 39 solved, 237 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 350/350 variables, and 427 constraints, problems are : Problem set: 39 solved, 237 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 274/276 constraints, Known Traps: 3/3 constraints]
After SMT, in 50078ms problems are : Problem set: 39 solved, 237 unsolved
Search for dead transitions found 39 dead transitions in 50084ms
Found 39 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 39 transitions
Dead transitions reduction (with SMT) removed 39 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 87/87 places, 238/277 transitions.
Graph (complete) has 431 edges and 87 vertex of which 84 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 82 transition count 224
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 82 transition count 224
Applied a total of 5 rules in 11 ms. Remains 82 /87 variables (removed 5) and now considering 224/238 (removed 14) transitions.
[2025-05-29 20:45:48] [INFO ] Flow matrix only has 208 transitions (discarded 16 similar events)
// Phase 1: matrix 208 rows 82 cols
[2025-05-29 20:45:48] [INFO ] Computed 8 invariants in 2 ms
[2025-05-29 20:45:48] [INFO ] Implicit Places using invariants in 253 ms returned []
[2025-05-29 20:45:48] [INFO ] Flow matrix only has 208 transitions (discarded 16 similar events)
[2025-05-29 20:45:48] [INFO ] Invariant cache hit.
[2025-05-29 20:45:48] [INFO ] State equation strengthened by 46 read => feed constraints.
[2025-05-29 20:45:48] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 665 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 82/87 places, 224/277 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 51280 ms. Remains : 82/87 places, 224/277 transitions.
[2025-05-29 20:45:48] [INFO ] Flow matrix only has 208 transitions (discarded 16 similar events)
Found an invariant !
This invariant on transitions {4=1, 137=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {2=1, 137=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 :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[4, 0, 3, 0, 3, 0] Max Struct:[1, +inf, 1, 1, +inf, 1]
Inconsistency detected : max struct is less than max seen for bound index 0
Inconsistency detected : max struct is less than max seen for bound index 2
[2025-05-29 20:45:49] [INFO ] Flow matrix only has 208 transitions (discarded 16 similar events)
[2025-05-29 20:45:49] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4, 0, 3, 0, 3, 0] Max Struct:[1, +inf, 1, 1, +inf, 1]
Inconsistency detected : max struct is less than max seen for bound index 0
Inconsistency detected : max struct is less than max seen for bound index 2
RANDOM walk for 1000070 steps (2 resets) in 689 ms. (1449 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 742 ms. (1345 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[127, 0, 3, 0, 3, 0] Max Struct:[1, +inf, 1, 1, +inf, 1]
Inconsistency detected : max struct is less than max seen for bound index 0
Inconsistency detected : max struct is less than max seen for bound index 2
[2025-05-29 20:45:50] [INFO ] Flow matrix only has 208 transitions (discarded 16 similar events)
[2025-05-29 20:45:50] [INFO ] Invariant cache hit.
[2025-05-29 20:45:50] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-05-29 20:45:50] [INFO ] [Real]Absence check using 7 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-29 20:45:50] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2025-05-29 20:45:50] [INFO ] State equation strengthened by 46 read => feed constraints.
[2025-05-29 20:45:50] [INFO ] [Real]Added 46 Read/Feed constraints in 15 ms returned sat
[2025-05-29 20:45:50] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:45:50] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-29 20:45:50] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-29 20:45:50] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2025-05-29 20:45:50] [INFO ] [Nat]Added 46 Read/Feed constraints in 11 ms returned sat
[2025-05-29 20:45:50] [INFO ] Computed and/alt/rep : 171/890/171 causal constraints (skipped 36 transitions) in 22 ms.
[2025-05-29 20:45:51] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2025-05-29 20:45:51] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 2 ms to minimize.
[2025-05-29 20:45:51] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 1 ms to minimize.
[2025-05-29 20:45:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 339 ms
[2025-05-29 20:45:51] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 2 ms to minimize.
[2025-05-29 20:45:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2025-05-29 20:45:51] [INFO ] Added : 86 causal constraints over 21 iterations in 1052 ms. Result :sat
Minimization took 129 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[127, 0, 3, 0, 3, 0] Max Struct:[1, +inf, 1, 1, +inf, 1]
Inconsistency detected : max struct is less than max seen for bound index 0
Inconsistency detected : max struct is less than max seen for bound index 2
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[127, 0, 3, 0, 3, 0] Max Struct:[1, +inf, 1, 1, +inf, 1]
Inconsistency detected : max struct is less than max seen for bound index 0
Inconsistency detected : max struct is less than max seen for bound index 2
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 224/224 transitions.
Applied a total of 0 rules in 5 ms. Remains 82 /82 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 82/82 places, 224/224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 224/224 transitions.
Applied a total of 0 rules in 5 ms. Remains 82 /82 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2025-05-29 20:45:52] [INFO ] Flow matrix only has 208 transitions (discarded 16 similar events)
[2025-05-29 20:45:52] [INFO ] Invariant cache hit.
[2025-05-29 20:45:52] [INFO ] Implicit Places using invariants in 188 ms returned []
[2025-05-29 20:45:52] [INFO ] Flow matrix only has 208 transitions (discarded 16 similar events)
[2025-05-29 20:45:52] [INFO ] Invariant cache hit.
[2025-05-29 20:45:52] [INFO ] State equation strengthened by 46 read => feed constraints.
[2025-05-29 20:45:52] [INFO ] Implicit Places using invariants and state equation in 401 ms returned []
Implicit Place search using SMT with State Equation took 621 ms to find 0 implicit places.
[2025-05-29 20:45:52] [INFO ] Redundant transitions in 1 ms returned []
Running 223 sub problems to find dead transitions.
[2025-05-29 20:45:52] [INFO ] Flow matrix only has 208 transitions (discarded 16 similar events)
[2025-05-29 20:45:52] [INFO ] Invariant cache hit.
[2025-05-29 20:45:52] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
At refinement iteration 3 (OVERLAPS) 208/289 variables, 81/89 constraints. Problems are: Problem set: 10 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 46/135 constraints. Problems are: Problem set: 10 solved, 213 unsolved
[2025-05-29 20:45:57] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 1/136 constraints. Problems are: Problem set: 10 solved, 213 unsolved
[2025-05-29 20:45:59] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 1/137 constraints. Problems are: Problem set: 10 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 0/137 constraints. Problems are: Problem set: 10 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 1/290 variables, 1/138 constraints. Problems are: Problem set: 10 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 0/138 constraints. Problems are: Problem set: 10 solved, 213 unsolved
At refinement iteration 10 (OVERLAPS) 0/290 variables, 0/138 constraints. Problems are: Problem set: 10 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 290/290 variables, and 138 constraints, problems are : Problem set: 10 solved, 213 unsolved in 16124 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 10 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 7/7 constraints. Problems are: Problem set: 10 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 1/8 constraints. Problems are: Problem set: 10 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 2/10 constraints. Problems are: Problem set: 10 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/10 constraints. Problems are: Problem set: 10 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 208/289 variables, 81/91 constraints. Problems are: Problem set: 10 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 46/137 constraints. Problems are: Problem set: 10 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 159/296 constraints. Problems are: Problem set: 10 solved, 213 unsolved
[2025-05-29 20:46:12] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 1/297 constraints. Problems are: Problem set: 10 solved, 213 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/297 constraints. Problems are: Problem set: 10 solved, 213 unsolved
At refinement iteration 9 (OVERLAPS) 1/290 variables, 1/298 constraints. Problems are: Problem set: 10 solved, 213 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 54/352 constraints. Problems are: Problem set: 10 solved, 213 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 0/352 constraints. Problems are: Problem set: 10 solved, 213 unsolved
At refinement iteration 12 (OVERLAPS) 0/290 variables, 0/352 constraints. Problems are: Problem set: 10 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Int declared 290/290 variables, and 352 constraints, problems are : Problem set: 10 solved, 213 unsolved in 17402 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 213/223 constraints, Known Traps: 3/3 constraints]
After SMT, in 33826ms problems are : Problem set: 10 solved, 213 unsolved
Search for dead transitions found 10 dead transitions in 33832ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 82/82 places, 214/224 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2025-05-29 20:46:26] [INFO ] Redundant transitions in 0 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 34490 ms. Remains : 82/82 places, 214/224 transitions.
[2025-05-29 20:46:26] [INFO ] Flow matrix only has 198 transitions (discarded 16 similar events)
Found an invariant !
This invariant on transitions {0=1, 127=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1, 127=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[127, 0, 3, 0, 3, 0] Max Struct:[1, +inf, 1, 1, +inf, 1]
Inconsistency detected : max struct is less than max seen for bound index 0
Inconsistency detected : max struct is less than max seen for bound index 2
[2025-05-29 20:46:26] [INFO ] Flow matrix only has 198 transitions (discarded 16 similar events)
// Phase 1: matrix 198 rows 82 cols
[2025-05-29 20:46:26] [INFO ] Computed 9 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[127, 0, 3, 0, 3, 0] Max Struct:[1, +inf, 1, 1, +inf, 1]
Inconsistency detected : max struct is less than max seen for bound index 0
Inconsistency detected : max struct is less than max seen for bound index 2
RANDOM walk for 1000125 steps (2 resets) in 585 ms. (1706 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 808 ms. (1236 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[127, 0, 3, 0, 3, 0] Max Struct:[1, +inf, 1, 1, +inf, 1]
Inconsistency detected : max struct is less than max seen for bound index 0
Inconsistency detected : max struct is less than max seen for bound index 2
[2025-05-29 20:46:28] [INFO ] Flow matrix only has 198 transitions (discarded 16 similar events)
[2025-05-29 20:46:28] [INFO ] Invariant cache hit.
[2025-05-29 20:46:28] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-05-29 20:46:28] [INFO ] [Real]Absence check using 7 positive and 2 generalized place invariants in 1 ms returned sat
[2025-05-29 20:46:28] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2025-05-29 20:46:28] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-05-29 20:46:28] [INFO ] [Real]Added 44 Read/Feed constraints in 11 ms returned sat
[2025-05-29 20:46:28] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:46:28] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-05-29 20:46:28] [INFO ] [Nat]Absence check using 7 positive and 2 generalized place invariants in 16 ms returned sat
[2025-05-29 20:46:28] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2025-05-29 20:46:28] [INFO ] [Nat]Added 44 Read/Feed constraints in 9 ms returned sat
[2025-05-29 20:46:28] [INFO ] Computed and/alt/rep : 161/810/161 causal constraints (skipped 36 transitions) in 14 ms.
[2025-05-29 20:46:28] [INFO ] Added : 67 causal constraints over 16 iterations in 376 ms. Result :sat
Minimization took 105 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[127, 0, 3, 0, 3, 0] Max Struct:[1, +inf, 1, 1, +inf, 1]
Inconsistency detected : max struct is less than max seen for bound index 0
Inconsistency detected : max struct is less than max seen for bound index 2
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[127, 0, 3, 0, 3, 0] Max Struct:[1, +inf, 1, 1, +inf, 1]
Inconsistency detected : max struct is less than max seen for bound index 0
Inconsistency detected : max struct is less than max seen for bound index 2
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 214/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 82 /82 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 82/82 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 214/214 transitions.
Applied a total of 0 rules in 5 ms. Remains 82 /82 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2025-05-29 20:46:29] [INFO ] Flow matrix only has 198 transitions (discarded 16 similar events)
[2025-05-29 20:46:29] [INFO ] Invariant cache hit.
[2025-05-29 20:46:29] [INFO ] Implicit Places using invariants in 217 ms returned []
[2025-05-29 20:46:29] [INFO ] Flow matrix only has 198 transitions (discarded 16 similar events)
[2025-05-29 20:46:29] [INFO ] Invariant cache hit.
[2025-05-29 20:46:29] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-05-29 20:46:29] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 616 ms to find 0 implicit places.
[2025-05-29 20:46:29] [INFO ] Redundant transitions in 0 ms returned []
Running 213 sub problems to find dead transitions.
[2025-05-29 20:46:29] [INFO ] Flow matrix only has 198 transitions (discarded 16 similar events)
[2025-05-29 20:46:29] [INFO ] Invariant cache hit.
[2025-05-29 20:46:29] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 198/279 variables, 81/90 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 44/134 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 213 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/280 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 0/280 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 135 constraints, problems are : Problem set: 0 solved, 213 unsolved in 9421 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 198/279 variables, 81/90 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 44/134 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 159/293 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (OVERLAPS) 1/280 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 54/348 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 10 (OVERLAPS) 0/280 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 348 constraints, problems are : Problem set: 0 solved, 213 unsolved in 13944 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints]
After SMT, in 23619ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 23624ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24263 ms. Remains : 82/82 places, 214/214 transitions.
[2025-05-29 20:46:53] [INFO ] Flow matrix only has 198 transitions (discarded 16 similar events)
Found an invariant !
This invariant on transitions {0=1, 127=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1, 127=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[127, 0, 3, 0, 3, 0] Max Struct:[1, +inf, 1, 1, +inf, 1]
Inconsistency detected : max struct is less than max seen for bound index 0
Inconsistency detected : max struct is less than max seen for bound index 2
RANDOM walk for 40517 steps (8 resets) in 221 ms. (182 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 559 ms. (71 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 313 ms. (127 steps per ms) remains 1/1 properties
[2025-05-29 20:46:54] [INFO ] Flow matrix only has 198 transitions (discarded 16 similar events)
[2025-05-29 20:46:54] [INFO ] Invariant cache hit.
[2025-05-29 20:46:54] [INFO ] State equation strengthened by 44 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) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 54/56 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/57 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 55/112 variables, 18/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/112 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/112 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/112 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 82/194 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/194 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/194 variables, 16/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/194 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/196 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/196 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/196 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 31/227 variables, 13/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/227 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/227 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 42/269 variables, 15/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/269 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:46:54] [INFO ] Flatten gal took : 106 ms
At refinement iteration 25 (INCLUDED_ONLY) 0/269 variables, 8/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/269 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 3/272 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/272 variables, 3/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/272 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 3/275 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/275 variables, 3/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/275 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 2/277 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/277 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 3/280 variables, 4/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/280 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:46:54] [INFO ] Flatten gal took : 55 ms
At refinement iteration 37 (INCLUDED_ONLY) 0/280 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 0/280 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 135 constraints, problems are : Problem set: 0 solved, 1 unsolved in 499 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 44/44 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) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:46:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality165270312666673212.gal : 23 ms
[2025-05-29 20:46:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3861339508904765428.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/ReachabilityCardinality165270312666673212.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3861339508904765428.prop' '--nowitness' '--gen-order' 'FOLLOW'
At refinement iteration 3 (OVERLAPS) 54/56 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved

At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/57 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
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
At refinement iteration 9 (OVERLAPS) 55/112 variables, 18/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/112 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/112 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/112 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/112 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Loading property file /tmp/ReachabilityCardinality3861339508904765428.prop.
At refinement iteration 14 (OVERLAPS) 82/194 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
At refinement iteration 15 (INCLUDED_ONLY) 0/194 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 8
At refinement iteration 16 (INCLUDED_ONLY) 0/194 variables, 16/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
At refinement iteration 17 (INCLUDED_ONLY) 0/194 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/196 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/196 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 134
At refinement iteration 20 (INCLUDED_ONLY) 0/196 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 31/227 variables, 13/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/227 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/227 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 42/269 variables, 15/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/269 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/269 variables, 8/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/269 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 3/272 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :134 after 257
At refinement iteration 29 (INCLUDED_ONLY) 0/272 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/272 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 3/275 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/275 variables, 3/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/275 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 2/277 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/277 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 3/280 variables, 4/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/280 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/280 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 0/280 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :257 after 62964
After SMT solving in domain Int declared 280/280 variables, and 136 constraints, problems are : Problem set: 0 solved, 1 unsolved in 400 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 912ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 241 ms.
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 214/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 82 /82 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 82/82 places, 214/214 transitions.
RANDOM walk for 40519 steps (8 resets) in 27 ms. (1447 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :62964 after 194805
Interrupted probabilistic random walk after 960020 steps, run timeout after 3001 ms. (steps per millisecond=319 ) properties seen :0 out of 1
Probabilistic random walk after 960020 steps, saw 614170 distinct states, run finished after 3005 ms. (steps per millisecond=319 ) properties seen :0
[2025-05-29 20:46:58] [INFO ] Flow matrix only has 198 transitions (discarded 16 similar events)
[2025-05-29 20:46:58] [INFO ] Invariant cache hit.
[2025-05-29 20:46:58] [INFO ] State equation strengthened by 44 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) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 54/56 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/57 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 55/112 variables, 18/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/112 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/112 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/112 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 82/194 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/194 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/194 variables, 16/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/194 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/196 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/196 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/196 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 31/227 variables, 13/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/227 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/227 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 42/269 variables, 15/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/269 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/269 variables, 8/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/269 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 3/272 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/272 variables, 3/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/272 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 3/275 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/275 variables, 3/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/275 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 2/277 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/277 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 3/280 variables, 4/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/280 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/280 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 0/280 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 135 constraints, problems are : Problem set: 0 solved, 1 unsolved in 253 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 44/44 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) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 54/56 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/57 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 55/112 variables, 18/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/112 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/112 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/112 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/112 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 82/194 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/194 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/194 variables, 16/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/194 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/196 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/196 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/196 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 31/227 variables, 13/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/227 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/227 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 42/269 variables, 15/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/269 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/269 variables, 8/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/269 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 3/272 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/272 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/272 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 3/275 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/275 variables, 3/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/275 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 2/277 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/277 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 3/280 variables, 4/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/280 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/280 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 0/280 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 136 constraints, problems are : Problem set: 0 solved, 1 unsolved in 192 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 451ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 72 ms.
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 214/214 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 82/82 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2025-05-29 20:46:58] [INFO ] Flow matrix only has 198 transitions (discarded 16 similar events)
[2025-05-29 20:46:58] [INFO ] Invariant cache hit.
[2025-05-29 20:46:59] [INFO ] Implicit Places using invariants in 108 ms returned []
[2025-05-29 20:46:59] [INFO ] Flow matrix only has 198 transitions (discarded 16 similar events)
[2025-05-29 20:46:59] [INFO ] Invariant cache hit.
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :194805 after 458230
[2025-05-29 20:46:59] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-05-29 20:46:59] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
[2025-05-29 20:46:59] [INFO ] Redundant transitions in 1 ms returned []
Running 213 sub problems to find dead transitions.
[2025-05-29 20:46:59] [INFO ] Flow matrix only has 198 transitions (discarded 16 similar events)
[2025-05-29 20:46:59] [INFO ] Invariant cache hit.
[2025-05-29 20:46:59] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 198/279 variables, 81/90 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 44/134 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 213 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/280 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 0/280 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 135 constraints, problems are : Problem set: 0 solved, 213 unsolved in 6320 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 198/279 variables, 81/90 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 44/134 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 159/293 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (OVERLAPS) 1/280 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 54/348 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 213 unsolved
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :458230 after 984823
At refinement iteration 10 (OVERLAPS) 0/280 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 348 constraints, problems are : Problem set: 0 solved, 213 unsolved in 10634 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints]
After SMT, in 17172ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 17176ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17543 ms. Remains : 82/82 places, 214/214 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 324 edges and 82 vertex of which 80 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 80 transition count 197
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 18 place count 80 transition count 196
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 79 transition count 196
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 32 place count 67 transition count 152
Iterating global reduction 1 with 12 rules applied. Total rules applied 44 place count 67 transition count 152
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 67 transition count 151
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 47 place count 65 transition count 148
Ensure Unique test removed 1 places
Iterating global reduction 2 with 3 rules applied. Total rules applied 50 place count 64 transition count 148
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 52 place count 62 transition count 146
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 62 transition count 146
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 57 place count 62 transition count 143
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 59 place count 60 transition count 143
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 59 place count 60 transition count 142
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 62 place count 58 transition count 142
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 13 rules applied. Total rules applied 75 place count 51 transition count 136
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 81 place count 48 transition count 143
Applied a total of 81 rules in 57 ms. Remains 48 /82 variables (removed 34) and now considering 143/214 (removed 71) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 143 rows 48 cols
[2025-05-29 20:47:16] [INFO ] Computed 6 invariants in 1 ms
[2025-05-29 20:47:16] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-05-29 20:47:16] [INFO ] After 47ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-29 20:47:16] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
TRAPS : Iteration 1
[2025-05-29 20:47:16] [INFO ] After 114ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-29 20:47:16] [INFO ] After 157ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-29 20:47:16] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-05-29 20:47:16] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-29 20:47:16] [INFO ] After 54ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-29 20:47:16] [INFO ] After 89ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-05-29 20:47:16] [INFO ] Flatten gal took : 19 ms
[2025-05-29 20:47:16] [INFO ] Flatten gal took : 17 ms
[2025-05-29 20:47:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4634839486434338064.gal : 6 ms
[2025-05-29 20:47:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16987298403099487294.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/ReachabilityCardinality4634839486434338064.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16987298403099487294.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/ReachabilityCardinality16987298403099487294.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 134
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :134 after 257
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :257 after 64506
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :64506 after 196347
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :196347 after 459772
Detected timeout of ITS tools.
[2025-05-29 20:47:31] [INFO ] Flatten gal took : 18 ms
[2025-05-29 20:47:31] [INFO ] Applying decomposition
[2025-05-29 20:47:31] [INFO ] Flatten gal took : 15 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/graph4126675142100638628.txt' '-o' '/tmp/graph4126675142100638628.bin' '-w' '/tmp/graph4126675142100638628.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4126675142100638628.bin' '-l' '-1' '-v' '-w' '/tmp/graph4126675142100638628.weights' '-q' '0' '-e' '0.001'
[2025-05-29 20:47:32] [INFO ] Decomposing Gal with order
[2025-05-29 20:47:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 20:47:32] [INFO ] Removed a total of 143 redundant transitions.
[2025-05-29 20:47:32] [INFO ] Flatten gal took : 115 ms
[2025-05-29 20:47:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 22 ms.
[2025-05-29 20:47:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1420341988105312206.gal : 20 ms
[2025-05-29 20:47:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16933849833687486354.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/ReachabilityCardinality1420341988105312206.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16933849833687486354.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/ReachabilityCardinality16933849833687486354.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 134
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :134 after 3585
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :3585 after 2.15715e+07
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2.15715e+07 after 1.36208e+10
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.36208e+10 after 5.91733e+12
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :5.91733e+12 after 3.11023e+15
Detected timeout of ITS tools.
[2025-05-29 20:47:44] [INFO ] Flatten gal took : 24 ms
[2025-05-29 20:47:44] [INFO ] Applying decomposition
[2025-05-29 20:47:44] [INFO ] Flatten gal took : 23 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/graph814905834121856267.txt' '-o' '/tmp/graph814905834121856267.bin' '-w' '/tmp/graph814905834121856267.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph814905834121856267.bin' '-l' '-1' '-v' '-w' '/tmp/graph814905834121856267.weights' '-q' '0' '-e' '0.001'
[2025-05-29 20:47:44] [INFO ] Decomposing Gal with order
[2025-05-29 20:47:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 20:47:44] [INFO ] Removed a total of 5 redundant transitions.
[2025-05-29 20:47:44] [INFO ] Flatten gal took : 30 ms
[2025-05-29 20:47:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 1 ms.
[2025-05-29 20:47:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8801906842101272252.gal : 3 ms
[2025-05-29 20:47:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15672237404839106959.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/ReachabilityCardinality8801906842101272252.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15672237404839106959.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/ReachabilityCardinality15672237404839106959.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 134
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :134 after 257
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :257 after 6411
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :6411 after 6411
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :6411 after 25106
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 31062 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA BugTracking-PT-q3m256-UpperBounds-10 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[0, 3, 0, 3, 0] Max Struct:[+inf, 1, 1, +inf, 1]
Inconsistency detected : max struct is less than max seen for bound index 1
All properties solved without resorting to model-checking.
Total runtime 466154 ms.

BK_STOP 1748551667647

--------------------
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="BugTracking-PT-q3m256"
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 BugTracking-PT-q3m256, 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 r027-smll-174853774300068"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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