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

--------------------
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 98K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K 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.3K 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-q3m064-UpperBounds-00
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-01
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-02
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-03
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-04
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-05
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-06
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-07
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-08
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-09
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-10
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-11
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-12
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-13
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-14
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748550819164

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-q3m064
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-29 20:33:41] [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:33:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 20:33:43] [INFO ] Load time of PNML (sax parser for PT used): 1778 ms
[2025-05-29 20:33:43] [INFO ] Transformed 754 places.
[2025-05-29 20:33:43] [INFO ] Transformed 27370 transitions.
[2025-05-29 20:33:44] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 2216 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 19 ms.
Deduced a syphon composed of 514 places in 185 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m064-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-UpperBounds-14 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:33:44] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
// Phase 1: matrix 2642 rows 240 cols
[2025-05-29 20:33:44] [INFO ] Computed 10 invariants in 80 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, +inf, 1, +inf, +inf, +inf, +inf]
RANDOM walk for 10000 steps (5 resets) in 166 ms. (59 steps per ms)
FORMULA BugTracking-PT-q3m064-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70006 steps (14 resets) in 503 ms. (138 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 1, 405, 0, 0, 0] Max Struct:[1, 1, +inf, +inf, +inf, +inf, +inf]
[2025-05-29 20:33:45] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
[2025-05-29 20:33:45] [INFO ] Invariant cache hit.
[2025-05-29 20:33:45] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-05-29 20:33:46] [INFO ] [Real]Absence check using state equation in 1121 ms returned sat
[2025-05-29 20:33:47] [INFO ] State equation strengthened by 255 read => feed constraints.
[2025-05-29 20:33:47] [INFO ] [Real]Added 255 Read/Feed constraints in 113 ms returned sat
[2025-05-29 20:33:47] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:33:47] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2025-05-29 20:33:48] [INFO ] [Nat]Absence check using state equation in 1063 ms returned sat
[2025-05-29 20:33:48] [INFO ] [Nat]Added 255 Read/Feed constraints in 214 ms returned sat
[2025-05-29 20:33:49] [INFO ] Deduced a trap composed of 34 places in 469 ms of which 27 ms to minimize.
[2025-05-29 20:33:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 734 ms
[2025-05-29 20:33:50] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 611 ms.
[2025-05-29 20:33:51] [INFO ] Deduced a trap composed of 15 places in 428 ms of which 4 ms to minimize.
[2025-05-29 20:33:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 789 ms
[2025-05-29 20:33:52] [INFO ] Added : 12 causal constraints over 4 iterations in 2842 ms. Result :sat
Minimization took 1 ms.
[2025-05-29 20:33:52] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-05-29 20:33:53] [INFO ] [Real]Absence check using state equation in 922 ms returned sat
[2025-05-29 20:33:53] [INFO ] [Real]Added 255 Read/Feed constraints in 71 ms returned sat
[2025-05-29 20:33:53] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:33:53] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-05-29 20:33:54] [INFO ] [Nat]Absence check using state equation in 759 ms returned sat
[2025-05-29 20:33:54] [INFO ] [Nat]Added 255 Read/Feed constraints in 140 ms returned sat
[2025-05-29 20:33:55] [INFO ] Deduced a trap composed of 41 places in 933 ms of which 5 ms to minimize.
[2025-05-29 20:33:56] [INFO ] Deduced a trap composed of 44 places in 987 ms of which 4 ms to minimize.
[2025-05-29 20:33:57] [INFO ] Deduced a trap composed of 31 places in 533 ms of which 3 ms to minimize.
[2025-05-29 20:33:58] [INFO ] Deduced a trap composed of 30 places in 563 ms of which 3 ms to minimize.
[2025-05-29 20:33:58] [INFO ] Deduced a trap composed of 68 places in 511 ms of which 3 ms to minimize.
[2025-05-29 20:33:58] [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 1
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:33:58] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-05-29 20:33:59] [INFO ] [Real]Absence check using state equation in 902 ms returned sat
[2025-05-29 20:34:00] [INFO ] [Real]Added 255 Read/Feed constraints in 88 ms returned sat
[2025-05-29 20:34:00] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:34:00] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-05-29 20:34:01] [INFO ] [Nat]Absence check using state equation in 844 ms returned sat
[2025-05-29 20:34:01] [INFO ] [Nat]Added 255 Read/Feed constraints in 91 ms returned sat
[2025-05-29 20:34:01] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 358 ms.
[2025-05-29 20:34:02] [INFO ] Added : 2 causal constraints over 1 iterations in 806 ms. Result :sat
Minimization took 911 ms.
[2025-05-29 20:34:03] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-05-29 20:34:03] [INFO ] [Real]Absence check using state equation in 809 ms returned sat
[2025-05-29 20:34:03] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:34:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-29 20:34:04] [INFO ] [Nat]Absence check using state equation in 875 ms returned sat
[2025-05-29 20:34:05] [INFO ] [Nat]Added 255 Read/Feed constraints in 189 ms returned sat
[2025-05-29 20:34:05] [INFO ] Deduced a trap composed of 17 places in 450 ms of which 3 ms to minimize.
[2025-05-29 20:34:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 669 ms
[2025-05-29 20:34:06] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 360 ms.
[2025-05-29 20:34:06] [INFO ] Added : 5 causal constraints over 1 iterations in 844 ms. Result :sat
Minimization took 922 ms.
[2025-05-29 20:34:07] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-05-29 20:34:08] [INFO ] [Real]Absence check using state equation in 879 ms returned sat
[2025-05-29 20:34:08] [INFO ] [Real]Added 255 Read/Feed constraints in 75 ms returned sat
[2025-05-29 20:34:08] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:34:08] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-29 20:34:09] [INFO ] [Nat]Absence check using state equation in 773 ms returned sat
[2025-05-29 20:34:09] [INFO ] [Nat]Added 255 Read/Feed constraints in 136 ms returned sat
[2025-05-29 20:34:10] [INFO ] Deduced a trap composed of 20 places in 556 ms of which 3 ms to minimize.
[2025-05-29 20:34:10] [INFO ] Deduced a trap composed of 40 places in 449 ms of which 2 ms to minimize.
[2025-05-29 20:34:11] [INFO ] Deduced a trap composed of 27 places in 436 ms of which 3 ms to minimize.
[2025-05-29 20:34:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1771 ms
[2025-05-29 20:34:11] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 228 ms.
[2025-05-29 20:34:12] [INFO ] Added : 5 causal constraints over 1 iterations in 603 ms. Result :sat
Minimization took 911 ms.
[2025-05-29 20:34:13] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2025-05-29 20:34:13] [INFO ] [Real]Absence check using state equation in 779 ms returned sat
[2025-05-29 20:34:14] [INFO ] [Real]Added 255 Read/Feed constraints in 106 ms returned sat
[2025-05-29 20:34:14] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:34:14] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-29 20:34:15] [INFO ] [Nat]Absence check using state equation in 834 ms returned sat
[2025-05-29 20:34:15] [INFO ] [Nat]Added 255 Read/Feed constraints in 254 ms returned sat
[2025-05-29 20:34:16] [INFO ] Deduced a trap composed of 59 places in 1087 ms of which 4 ms to minimize.
[2025-05-29 20:34:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1514 ms
[2025-05-29 20:34:17] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 373 ms.
[2025-05-29 20:34:17] [INFO ] Added : 4 causal constraints over 1 iterations in 818 ms. Result :sat
Minimization took 871 ms.
[2025-05-29 20:34:18] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-05-29 20:34:19] [INFO ] [Real]Absence check using state equation in 896 ms returned sat
[2025-05-29 20:34:19] [INFO ] [Real]Added 255 Read/Feed constraints in 88 ms returned sat
[2025-05-29 20:34:19] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:34:19] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-05-29 20:34:20] [INFO ] [Nat]Absence check using state equation in 760 ms returned sat
[2025-05-29 20:34:20] [INFO ] [Nat]Added 255 Read/Feed constraints in 148 ms returned sat
[2025-05-29 20:34:21] [INFO ] Deduced a trap composed of 61 places in 982 ms of which 8 ms to minimize.
[2025-05-29 20:34:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1152 ms
[2025-05-29 20:34:22] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 368 ms.
[2025-05-29 20:34:22] [INFO ] Added : 4 causal constraints over 1 iterations in 822 ms. Result :sat
Minimization took 847 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 1, 405, 0, 0, 0] Max Struct:[1, 1, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 1, 405, 0, 0, 0] Max Struct:[1, 1, +inf, +inf, +inf, +inf, +inf]
Support contains 7 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.13 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 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 236 transition count 2753
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 11 place count 236 transition count 2747
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 17 place count 230 transition count 2747
Applied a total of 17 rules in 424 ms. Remains 230 /240 variables (removed 10) and now considering 2747/2769 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 445 ms. Remains : 230/240 places, 2747/2769 transitions.
[2025-05-29 20:34:24] [INFO ] Flow matrix only has 2619 transitions (discarded 128 similar events)
Found an invariant !
This invariant on transitions {3=1, 1723=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {1=1, 1723=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 443 ms. (steps per millisecond=22 ) properties (out of 7) seen :[0, 0, 0, 2147483647, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 1, +inf, 0, 0, 0] Max Struct:[1, 1, +inf, +inf, +inf, +inf, +inf]
[2025-05-29 20:34:25] [INFO ] Flow matrix only has 2619 transitions (discarded 128 similar events)
// Phase 1: matrix 2619 rows 230 cols
[2025-05-29 20:34:25] [INFO ] Computed 8 invariants in 30 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 1, +inf, 0, 0, 0] Max Struct:[1, 1, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 1890 ms. (528 steps per ms)
FORMULA BugTracking-PT-q3m064-UpperBounds-08 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BugTracking-PT-q3m064-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 5000003 steps (10 resets) in 14196 ms. (352 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 1, 0, 0, 0] Max Struct:[1, +inf, +inf, +inf, +inf]
[2025-05-29 20:34:42] [INFO ] Flow matrix only has 2619 transitions (discarded 128 similar events)
[2025-05-29 20:34:42] [INFO ] Invariant cache hit.
[2025-05-29 20:34:42] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-29 20:34:42] [INFO ] [Real]Absence check using state equation in 787 ms returned sat
[2025-05-29 20:34:42] [INFO ] State equation strengthened by 240 read => feed constraints.
[2025-05-29 20:34:42] [INFO ] [Real]Added 240 Read/Feed constraints in 48 ms returned sat
[2025-05-29 20:34:43] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:34:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-29 20:34:43] [INFO ] [Nat]Absence check using state equation in 610 ms returned sat
[2025-05-29 20:34:43] [INFO ] [Nat]Added 240 Read/Feed constraints in 113 ms returned sat
[2025-05-29 20:34:44] [INFO ] Deduced a trap composed of 22 places in 566 ms of which 4 ms to minimize.
[2025-05-29 20:34:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 732 ms
[2025-05-29 20:34:44] [INFO ] Computed and/alt/rep : 344/1318/344 causal constraints (skipped 2274 transitions) in 353 ms.
[2025-05-29 20:34:46] [INFO ] Deduced a trap composed of 27 places in 689 ms of which 3 ms to minimize.
[2025-05-29 20:34:47] [INFO ] Deduced a trap composed of 5 places in 354 ms of which 2 ms to minimize.
[2025-05-29 20:34:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1494 ms
[2025-05-29 20:34:47] [INFO ] Added : 15 causal constraints over 4 iterations in 3072 ms. Result :sat
Minimization took 2586 ms.
[2025-05-29 20:34:50] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-29 20:34:51] [INFO ] [Real]Absence check using state equation in 791 ms returned sat
[2025-05-29 20:34:51] [INFO ] [Real]Added 240 Read/Feed constraints in 78 ms returned sat
[2025-05-29 20:34:51] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:34:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-29 20:34:52] [INFO ] [Nat]Absence check using state equation in 866 ms returned sat
[2025-05-29 20:34:52] [INFO ] [Nat]Added 240 Read/Feed constraints in 76 ms returned sat
[2025-05-29 20:34:52] [INFO ] Computed and/alt/rep : 344/1318/344 causal constraints (skipped 2274 transitions) in 318 ms.
[2025-05-29 20:34:53] [INFO ] Added : 2 causal constraints over 1 iterations in 751 ms. Result :sat
Minimization took 2531 ms.
[2025-05-29 20:34:56] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-29 20:34:56] [INFO ] [Real]Absence check using state equation in 944 ms returned sat
[2025-05-29 20:34:57] [INFO ] [Real]Added 240 Read/Feed constraints in 75 ms returned sat
[2025-05-29 20:34:57] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:34:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-29 20:34:58] [INFO ] [Nat]Absence check using state equation in 804 ms returned sat
[2025-05-29 20:34:58] [INFO ] [Nat]Added 240 Read/Feed constraints in 209 ms returned sat
[2025-05-29 20:34:58] [INFO ] Deduced a trap composed of 19 places in 540 ms of which 3 ms to minimize.
[2025-05-29 20:34:59] [INFO ] Deduced a trap composed of 24 places in 449 ms of which 2 ms to minimize.
[2025-05-29 20:35:00] [INFO ] Deduced a trap composed of 49 places in 484 ms of which 2 ms to minimize.
[2025-05-29 20:35:00] [INFO ] Deduced a trap composed of 50 places in 360 ms of which 2 ms to minimize.
[2025-05-29 20:35:00] [INFO ] Deduced a trap composed of 20 places in 344 ms of which 2 ms to minimize.
[2025-05-29 20:35:01] [INFO ] Deduced a trap composed of 27 places in 505 ms of which 3 ms to minimize.
[2025-05-29 20:35:02] [INFO ] Deduced a trap composed of 29 places in 557 ms of which 2 ms to minimize.
[2025-05-29 20:35:02] [INFO ] Deduced a trap composed of 12 places in 461 ms of which 3 ms to minimize.
[2025-05-29 20:35:03] [INFO ] Deduced a trap composed of 46 places in 484 ms of which 3 ms to minimize.
[2025-05-29 20:35:03] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 5136 ms
[2025-05-29 20:35:03] [INFO ] Computed and/alt/rep : 344/1318/344 causal constraints (skipped 2274 transitions) in 349 ms.
[2025-05-29 20:35:04] [INFO ] Deduced a trap composed of 11 places in 556 ms of which 3 ms to minimize.
[2025-05-29 20:35:05] [INFO ] Deduced a trap composed of 47 places in 336 ms of which 2 ms to minimize.
[2025-05-29 20:35:06] [INFO ] Deduced a trap composed of 56 places in 399 ms of which 3 ms to minimize.
[2025-05-29 20:35:06] [INFO ] Deduced a trap composed of 52 places in 289 ms of which 1 ms to minimize.
[2025-05-29 20:35:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2358 ms
[2025-05-29 20:35:06] [INFO ] Added : 10 causal constraints over 2 iterations in 3388 ms. Result :sat
Minimization took 2659 ms.
[2025-05-29 20:35:09] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-29 20:35:10] [INFO ] [Real]Absence check using state equation in 732 ms returned sat
[2025-05-29 20:35:10] [INFO ] [Real]Added 240 Read/Feed constraints in 49 ms returned sat
[2025-05-29 20:35:10] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:35:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-05-29 20:35:11] [INFO ] [Nat]Absence check using state equation in 574 ms returned sat
[2025-05-29 20:35:11] [INFO ] [Nat]Added 240 Read/Feed constraints in 116 ms returned sat
[2025-05-29 20:35:12] [INFO ] Deduced a trap composed of 67 places in 663 ms of which 4 ms to minimize.
[2025-05-29 20:35:12] [INFO ] Deduced a trap composed of 19 places in 644 ms of which 4 ms to minimize.
[2025-05-29 20:35:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1490 ms
[2025-05-29 20:35:13] [INFO ] Computed and/alt/rep : 344/1318/344 causal constraints (skipped 2274 transitions) in 221 ms.
[2025-05-29 20:35:13] [INFO ] Added : 2 causal constraints over 1 iterations in 479 ms. Result :sat
Minimization took 2616 ms.
[2025-05-29 20:35:16] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-29 20:35:16] [INFO ] [Real]Absence check using state equation in 765 ms returned sat
[2025-05-29 20:35:16] [INFO ] [Real]Added 240 Read/Feed constraints in 72 ms returned sat
[2025-05-29 20:35:17] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:35:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-29 20:35:18] [INFO ] [Nat]Absence check using state equation in 848 ms returned sat
[2025-05-29 20:35:18] [INFO ] [Nat]Added 240 Read/Feed constraints in 142 ms returned sat
[2025-05-29 20:35:19] [INFO ] Deduced a trap composed of 47 places in 886 ms of which 4 ms to minimize.
[2025-05-29 20:35:19] [INFO ] Deduced a trap composed of 67 places in 771 ms of which 4 ms to minimize.
[2025-05-29 20:35:20] [INFO ] Deduced a trap composed of 19 places in 718 ms of which 4 ms to minimize.
[2025-05-29 20:35:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2687 ms
[2025-05-29 20:35:21] [INFO ] Computed and/alt/rep : 344/1318/344 causal constraints (skipped 2274 transitions) in 253 ms.
[2025-05-29 20:35:22] [INFO ] Deduced a trap composed of 61 places in 715 ms of which 4 ms to minimize.
[2025-05-29 20:35:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1021 ms
[2025-05-29 20:35:22] [INFO ] Added : 5 causal constraints over 2 iterations in 1925 ms. Result :sat
Minimization took 2676 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 1, 0, 0, 0] Max Struct:[1, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 1, 0, 0, 0] Max Struct:[1, +inf, +inf, +inf, +inf]
Support contains 5 out of 230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 2747/2747 transitions.
Applied a total of 0 rules in 52 ms. Remains 230 /230 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 230/230 places, 2747/2747 transitions.
[2025-05-29 20:35:26] [INFO ] Flow matrix only has 2619 transitions (discarded 128 similar events)
Found an invariant !
This invariant on transitions {3=1, 1723=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {1=1, 1723=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 5) seen :[0, 1, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 1, 0, 0, 0] Max Struct:[1, +inf, +inf, +inf, +inf]
[2025-05-29 20:35:28] [INFO ] Flow matrix only has 2619 transitions (discarded 128 similar events)
[2025-05-29 20:35:28] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 1, 0, 0, 0] Max Struct:[1, +inf, +inf, +inf, +inf]
RANDOM walk for 1000007 steps (2 resets) in 1439 ms. (694 steps per ms)
BEST_FIRST walk for 5000004 steps (10 resets) in 14290 ms. (349 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 1, 0, 0, 0] Max Struct:[1, +inf, +inf, +inf, +inf]
[2025-05-29 20:35:43] [INFO ] Flow matrix only has 2619 transitions (discarded 128 similar events)
[2025-05-29 20:35:43] [INFO ] Invariant cache hit.
[2025-05-29 20:35:43] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-29 20:35:44] [INFO ] [Real]Absence check using state equation in 913 ms returned sat
[2025-05-29 20:35:44] [INFO ] State equation strengthened by 240 read => feed constraints.
[2025-05-29 20:35:44] [INFO ] [Real]Added 240 Read/Feed constraints in 64 ms returned sat
[2025-05-29 20:35:45] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:35:45] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-29 20:35:46] [INFO ] [Nat]Absence check using state equation in 906 ms returned sat
[2025-05-29 20:35:46] [INFO ] [Nat]Added 240 Read/Feed constraints in 146 ms returned sat
[2025-05-29 20:35:46] [INFO ] Deduced a trap composed of 22 places in 666 ms of which 3 ms to minimize.
[2025-05-29 20:35:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 852 ms
[2025-05-29 20:35:47] [INFO ] Computed and/alt/rep : 344/1318/344 causal constraints (skipped 2274 transitions) in 361 ms.
[2025-05-29 20:35:49] [INFO ] Deduced a trap composed of 27 places in 652 ms of which 3 ms to minimize.
[2025-05-29 20:35:49] [INFO ] Deduced a trap composed of 5 places in 353 ms of which 2 ms to minimize.
[2025-05-29 20:35:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1442 ms
[2025-05-29 20:35:50] [INFO ] Added : 15 causal constraints over 4 iterations in 3016 ms. Result :sat
Minimization took 2661 ms.
[2025-05-29 20:35:52] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-29 20:35:53] [INFO ] [Real]Absence check using state equation in 626 ms returned sat
[2025-05-29 20:35:53] [INFO ] [Real]Added 240 Read/Feed constraints in 51 ms returned sat
[2025-05-29 20:35:53] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:35:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-29 20:35:54] [INFO ] [Nat]Absence check using state equation in 885 ms returned sat
[2025-05-29 20:35:54] [INFO ] [Nat]Added 240 Read/Feed constraints in 95 ms returned sat
[2025-05-29 20:35:55] [INFO ] Computed and/alt/rep : 344/1318/344 causal constraints (skipped 2274 transitions) in 327 ms.
[2025-05-29 20:35:55] [INFO ] Added : 2 causal constraints over 1 iterations in 688 ms. Result :sat
Minimization took 2683 ms.
[2025-05-29 20:35:58] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-29 20:35:59] [INFO ] [Real]Absence check using state equation in 853 ms returned sat
[2025-05-29 20:35:59] [INFO ] [Real]Added 240 Read/Feed constraints in 66 ms returned sat
[2025-05-29 20:35:59] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:35:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-29 20:36:00] [INFO ] [Nat]Absence check using state equation in 920 ms returned sat
[2025-05-29 20:36:00] [INFO ] [Nat]Added 240 Read/Feed constraints in 302 ms returned sat
[2025-05-29 20:36:01] [INFO ] Deduced a trap composed of 19 places in 548 ms of which 2 ms to minimize.
[2025-05-29 20:36:01] [INFO ] Deduced a trap composed of 24 places in 490 ms of which 3 ms to minimize.
[2025-05-29 20:36:02] [INFO ] Deduced a trap composed of 49 places in 507 ms of which 2 ms to minimize.
[2025-05-29 20:36:03] [INFO ] Deduced a trap composed of 50 places in 567 ms of which 3 ms to minimize.
[2025-05-29 20:36:03] [INFO ] Deduced a trap composed of 20 places in 416 ms of which 2 ms to minimize.
[2025-05-29 20:36:04] [INFO ] Deduced a trap composed of 27 places in 475 ms of which 3 ms to minimize.
[2025-05-29 20:36:04] [INFO ] Deduced a trap composed of 29 places in 577 ms of which 2 ms to minimize.
[2025-05-29 20:36:05] [INFO ] Deduced a trap composed of 12 places in 476 ms of which 2 ms to minimize.
[2025-05-29 20:36:06] [INFO ] Deduced a trap composed of 46 places in 481 ms of which 2 ms to minimize.
[2025-05-29 20:36:06] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 5481 ms
[2025-05-29 20:36:06] [INFO ] Computed and/alt/rep : 344/1318/344 causal constraints (skipped 2274 transitions) in 359 ms.
[2025-05-29 20:36:07] [INFO ] Deduced a trap composed of 11 places in 577 ms of which 2 ms to minimize.
[2025-05-29 20:36:08] [INFO ] Deduced a trap composed of 47 places in 508 ms of which 2 ms to minimize.
[2025-05-29 20:36:09] [INFO ] Deduced a trap composed of 56 places in 488 ms of which 3 ms to minimize.
[2025-05-29 20:36:09] [INFO ] Deduced a trap composed of 52 places in 501 ms of which 2 ms to minimize.
[2025-05-29 20:36:09] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2897 ms
[2025-05-29 20:36:10] [INFO ] Added : 10 causal constraints over 2 iterations in 3959 ms. Result :sat
Minimization took 2569 ms.
[2025-05-29 20:36:12] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-29 20:36:13] [INFO ] [Real]Absence check using state equation in 653 ms returned sat
[2025-05-29 20:36:13] [INFO ] [Real]Added 240 Read/Feed constraints in 70 ms returned sat
[2025-05-29 20:36:13] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:36:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-29 20:36:14] [INFO ] [Nat]Absence check using state equation in 760 ms returned sat
[2025-05-29 20:36:14] [INFO ] [Nat]Added 240 Read/Feed constraints in 158 ms returned sat
[2025-05-29 20:36:15] [INFO ] Deduced a trap composed of 67 places in 774 ms of which 4 ms to minimize.
[2025-05-29 20:36:16] [INFO ] Deduced a trap composed of 19 places in 730 ms of which 3 ms to minimize.
[2025-05-29 20:36:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1751 ms
[2025-05-29 20:36:16] [INFO ] Computed and/alt/rep : 344/1318/344 causal constraints (skipped 2274 transitions) in 193 ms.
[2025-05-29 20:36:17] [INFO ] Added : 2 causal constraints over 1 iterations in 468 ms. Result :sat
Minimization took 2551 ms.
[2025-05-29 20:36:19] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-29 20:36:20] [INFO ] [Real]Absence check using state equation in 847 ms returned sat
[2025-05-29 20:36:20] [INFO ] [Real]Added 240 Read/Feed constraints in 69 ms returned sat
[2025-05-29 20:36:20] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:36:20] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-29 20:36:21] [INFO ] [Nat]Absence check using state equation in 671 ms returned sat
[2025-05-29 20:36:21] [INFO ] [Nat]Added 240 Read/Feed constraints in 159 ms returned sat
[2025-05-29 20:36:22] [INFO ] Deduced a trap composed of 47 places in 723 ms of which 4 ms to minimize.
[2025-05-29 20:36:23] [INFO ] Deduced a trap composed of 67 places in 598 ms of which 2 ms to minimize.
[2025-05-29 20:36:23] [INFO ] Deduced a trap composed of 19 places in 642 ms of which 3 ms to minimize.
[2025-05-29 20:36:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2224 ms
[2025-05-29 20:36:24] [INFO ] Computed and/alt/rep : 344/1318/344 causal constraints (skipped 2274 transitions) in 270 ms.
[2025-05-29 20:36:25] [INFO ] Deduced a trap composed of 61 places in 822 ms of which 6 ms to minimize.
[2025-05-29 20:36:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1054 ms
[2025-05-29 20:36:25] [INFO ] Added : 5 causal constraints over 2 iterations in 1842 ms. Result :sat
Minimization took 2795 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 1, 0, 0, 0] Max Struct:[1, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 1, 0, 0, 0] Max Struct:[1, +inf, +inf, +inf, +inf]
Support contains 5 out of 230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 2747/2747 transitions.
Applied a total of 0 rules in 57 ms. Remains 230 /230 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 230/230 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 2747/2747 transitions.
Applied a total of 0 rules in 52 ms. Remains 230 /230 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2025-05-29 20:36:29] [INFO ] Flow matrix only has 2619 transitions (discarded 128 similar events)
[2025-05-29 20:36:29] [INFO ] Invariant cache hit.
[2025-05-29 20:36:30] [INFO ] Implicit Places using invariants in 503 ms returned []
[2025-05-29 20:36:30] [INFO ] Flow matrix only has 2619 transitions (discarded 128 similar events)
[2025-05-29 20:36:30] [INFO ] Invariant cache hit.
[2025-05-29 20:36:30] [INFO ] State equation strengthened by 240 read => feed constraints.
[2025-05-29 20:36:33] [INFO ] Implicit Places using invariants and state equation in 2837 ms returned []
Implicit Place search using SMT with State Equation took 3342 ms to find 0 implicit places.
[2025-05-29 20:36:33] [INFO ] Redundant transitions in 559 ms returned []
Running 2746 sub problems to find dead transitions.
[2025-05-29 20:36:33] [INFO ] Flow matrix only has 2619 transitions (discarded 128 similar events)
[2025-05-29 20:36:33] [INFO ] Invariant cache hit.
[2025-05-29 20:36:33] [INFO ] State equation strengthened by 240 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2746 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 230/2849 variables, and 8 constraints, problems are : Problem set: 0 solved, 2746 unsolved in 30163 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/230 constraints, ReadFeed: 0/240 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/230 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2746 unsolved
[2025-05-29 20:37:51] [INFO ] Deduced a trap composed of 6 places in 147 ms of which 2 ms to minimize.
[2025-05-29 20:37:51] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 1 ms to minimize.
Problem TDEAD1021 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1049 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1073 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1081 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1092 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1095 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1097 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1102 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1109 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1114 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1116 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1121 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1123 is UNSAT
Problem TDEAD1124 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1129 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1132 is UNSAT
Problem TDEAD1133 is UNSAT
Problem TDEAD1134 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1141 is UNSAT
Problem TDEAD1142 is UNSAT
Problem TDEAD1143 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1147 is UNSAT
Problem TDEAD1148 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1150 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1237 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1250 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1263 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1270 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1281 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1283 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1286 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1288 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1292 is UNSAT
Problem TDEAD1293 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1297 is UNSAT
Problem TDEAD1298 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1301 is UNSAT
Problem TDEAD1302 is UNSAT
Problem TDEAD1303 is UNSAT
Problem TDEAD1304 is UNSAT
Problem TDEAD1305 is UNSAT
Problem TDEAD1306 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1312 is UNSAT
Problem TDEAD1313 is UNSAT
Problem TDEAD1314 is UNSAT
Problem TDEAD1315 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1317 is UNSAT
Problem TDEAD1318 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1320 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1324 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1326 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1329 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1334 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1339 is UNSAT
Problem TDEAD1340 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1343 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1348 is UNSAT
Problem TDEAD1349 is UNSAT
Problem TDEAD1350 is UNSAT
Problem TDEAD1351 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1354 is UNSAT
Problem TDEAD1355 is UNSAT
Problem TDEAD1356 is UNSAT
Problem TDEAD1357 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1359 is UNSAT
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:37:54] [INFO ] Deduced a trap composed of 23 places in 190 ms of which 2 ms to minimize.
Problem TDEAD1440 is UNSAT
Problem TDEAD1441 is UNSAT
[2025-05-29 20:37:54] [INFO ] Deduced a trap composed of 8 places in 184 ms of which 1 ms to minimize.
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:37:54] [INFO ] Deduced a trap composed of 8 places in 243 ms of which 2 ms to minimize.
[2025-05-29 20:37:54] [INFO ] Deduced a trap composed of 12 places in 256 ms of which 2 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
[2025-05-29 20:37:56] [INFO ] Deduced a trap composed of 11 places in 216 ms of which 2 ms to minimize.
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
[2025-05-29 20:37:57] [INFO ] Deduced a trap composed of 9 places in 239 ms of which 2 ms to minimize.
Problem TDEAD1751 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 TDEAD1758 is UNSAT
Problem TDEAD1759 is UNSAT
Problem TDEAD1760 is UNSAT
Problem TDEAD1761 is UNSAT
Problem TDEAD1762 is UNSAT
Problem TDEAD1763 is UNSAT
Problem TDEAD1764 is UNSAT
Problem TDEAD1767 is UNSAT
Problem TDEAD1768 is UNSAT
Problem TDEAD1770 is UNSAT
Problem TDEAD1771 is UNSAT
[2025-05-29 20:37:57] [INFO ] Deduced a trap composed of 11 places in 244 ms of which 1 ms to minimize.
Problem TDEAD1772 is UNSAT
Problem TDEAD1773 is UNSAT
Problem TDEAD1774 is UNSAT
Problem TDEAD1775 is UNSAT
Problem TDEAD1776 is UNSAT
Problem TDEAD1777 is UNSAT
Problem TDEAD1778 is UNSAT
Problem TDEAD1779 is UNSAT
Problem TDEAD1780 is UNSAT
[2025-05-29 20:37:57] [INFO ] Deduced a trap composed of 11 places in 231 ms of which 1 ms to minimize.
Problem TDEAD1784 is UNSAT
Problem TDEAD1785 is UNSAT
Problem TDEAD1786 is UNSAT
Problem TDEAD1787 is UNSAT
Problem TDEAD1789 is UNSAT
Problem TDEAD1790 is UNSAT
Problem TDEAD1794 is UNSAT
Problem TDEAD1795 is UNSAT
Problem TDEAD1796 is UNSAT
Problem TDEAD1797 is UNSAT
Problem TDEAD1798 is UNSAT
Problem TDEAD1799 is UNSAT
[2025-05-29 20:37:58] [INFO ] Deduced a trap composed of 11 places in 233 ms of which 2 ms to minimize.
Problem TDEAD1800 is UNSAT
Problem TDEAD1801 is UNSAT
Problem TDEAD1802 is UNSAT
Problem TDEAD1805 is UNSAT
Problem TDEAD1806 is UNSAT
Problem TDEAD1808 is UNSAT
Problem TDEAD1809 is UNSAT
Problem TDEAD1810 is UNSAT
Problem TDEAD1811 is UNSAT
Problem TDEAD1812 is UNSAT
Problem TDEAD1813 is UNSAT
Problem TDEAD1814 is UNSAT
Problem TDEAD1815 is UNSAT
Problem TDEAD1816 is UNSAT
Problem TDEAD1817 is UNSAT
Problem TDEAD1818 is UNSAT
Problem TDEAD1819 is UNSAT
Problem TDEAD1820 is UNSAT
Problem TDEAD1821 is UNSAT
Problem TDEAD1822 is UNSAT
Problem TDEAD1823 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 230/2849 variables, and 19 constraints, problems are : Problem set: 484 solved, 2262 unsolved in 30079 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/230 constraints, ReadFeed: 0/240 constraints, PredecessorRefiner: 0/2746 constraints, Known Traps: 11/11 constraints]
After SMT, in 94076ms problems are : Problem set: 484 solved, 2262 unsolved
Search for dead transitions found 484 dead transitions in 94175ms
Found 484 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 484 transitions
Dead transitions reduction (with SMT) removed 484 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 230/230 places, 2263/2747 transitions.
Graph (complete) has 2816 edges and 230 vertex of which 222 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.4 ms
Discarding 8 places :
Also discarding 0 output transitions
Reduce places removed 28 places and 592 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 194 transition count 1671
Reduce places removed 14 places and 264 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 43 place count 180 transition count 1407
Reduce places removed 8 places and 100 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 51 place count 172 transition count 1307
Reduce places removed 5 places and 71 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 56 place count 167 transition count 1236
Reduce places removed 3 places and 23 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 59 place count 164 transition count 1213
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 70 place count 153 transition count 1170
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 9 places and 144 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 90 place count 144 transition count 1026
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 97 place count 137 transition count 963
Deduced a syphon composed of 1 places in 2 ms
Iterating global reduction 5 with 7 rules applied. Total rules applied 104 place count 137 transition count 963
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 104 rules in 108 ms. Remains 137 /230 variables (removed 93) and now considering 963/2263 (removed 1300) transitions.
[2025-05-29 20:38:07] [INFO ] Flow matrix only has 889 transitions (discarded 74 similar events)
// Phase 1: matrix 889 rows 137 cols
[2025-05-29 20:38:07] [INFO ] Computed 8 invariants in 7 ms
[2025-05-29 20:38:08] [INFO ] Implicit Places using invariants in 382 ms returned []
[2025-05-29 20:38:08] [INFO ] Flow matrix only has 889 transitions (discarded 74 similar events)
[2025-05-29 20:38:08] [INFO ] Invariant cache hit.
[2025-05-29 20:38:08] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-05-29 20:38:09] [INFO ] Implicit Places using invariants and state equation in 1114 ms returned []
Implicit Place search using SMT with State Equation took 1503 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 137/230 places, 963/2747 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 99803 ms. Remains : 137/230 places, 963/2747 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
FORMULA BugTracking-PT-q3m064-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-29 20:38:09] [INFO ] Flow matrix only has 889 transitions (discarded 74 similar events)
Found an invariant !
This invariant on transitions {1=1, 477=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {0=1, 477=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 4) seen :[0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 1, 0, 0, 0] Max Struct:[1, +inf, +inf, +inf, +inf]
[2025-05-29 20:38:10] [INFO ] Flow matrix only has 889 transitions (discarded 74 similar events)
// Phase 1: matrix 889 rows 136 cols
[2025-05-29 20:38:10] [INFO ] Computed 7 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 1, 0, 0, 0] Max Struct:[1, +inf, +inf, +inf, +inf]
RANDOM walk for 1000048 steps (2 resets) in 1229 ms. (813 steps per ms)
FORMULA BugTracking-PT-q3m064-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 3000003 steps (6 resets) in 4956 ms. (605 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
[2025-05-29 20:38:16] [INFO ] Flow matrix only has 889 transitions (discarded 74 similar events)
[2025-05-29 20:38:16] [INFO ] Invariant cache hit.
[2025-05-29 20:38:16] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-05-29 20:38:16] [INFO ] [Real]Absence check using state equation in 278 ms returned sat
[2025-05-29 20:38:16] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-05-29 20:38:16] [INFO ] [Real]Added 111 Read/Feed constraints in 34 ms returned sat
[2025-05-29 20:38:16] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:38:16] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-29 20:38:16] [INFO ] [Nat]Absence check using state equation in 250 ms returned sat
[2025-05-29 20:38:17] [INFO ] [Nat]Added 111 Read/Feed constraints in 50 ms returned sat
[2025-05-29 20:38:17] [INFO ] Deduced a trap composed of 38 places in 290 ms of which 2 ms to minimize.
[2025-05-29 20:38:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 342 ms
[2025-05-29 20:38:17] [INFO ] Computed and/alt/rep : 198/678/197 causal constraints (skipped 691 transitions) in 71 ms.
[2025-05-29 20:38:17] [INFO ] Added : 4 causal constraints over 2 iterations in 201 ms. Result :sat
Minimization took 342 ms.
[2025-05-29 20:38:17] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-29 20:38:18] [INFO ] [Real]Absence check using state equation in 319 ms returned sat
[2025-05-29 20:38:18] [INFO ] [Real]Added 111 Read/Feed constraints in 28 ms returned sat
[2025-05-29 20:38:18] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:38:18] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-05-29 20:38:18] [INFO ] [Nat]Absence check using state equation in 275 ms returned sat
[2025-05-29 20:38:18] [INFO ] [Nat]Added 111 Read/Feed constraints in 39 ms returned sat
[2025-05-29 20:38:19] [INFO ] Deduced a trap composed of 45 places in 282 ms of which 3 ms to minimize.
[2025-05-29 20:38:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 368 ms
[2025-05-29 20:38:19] [INFO ] Computed and/alt/rep : 198/678/197 causal constraints (skipped 691 transitions) in 111 ms.
[2025-05-29 20:38:19] [INFO ] Deduced a trap composed of 10 places in 249 ms of which 2 ms to minimize.
[2025-05-29 20:38:20] [INFO ] Deduced a trap composed of 28 places in 292 ms of which 2 ms to minimize.
[2025-05-29 20:38:20] [INFO ] Deduced a trap composed of 14 places in 365 ms of which 3 ms to minimize.
[2025-05-29 20:38:20] [INFO ] Deduced a trap composed of 7 places in 207 ms of which 2 ms to minimize.
[2025-05-29 20:38:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1368 ms
[2025-05-29 20:38:20] [INFO ] Added : 8 causal constraints over 3 iterations in 1775 ms. Result :sat
Minimization took 384 ms.
[2025-05-29 20:38:21] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-05-29 20:38:21] [INFO ] [Real]Absence check using state equation in 278 ms returned sat
[2025-05-29 20:38:21] [INFO ] [Real]Added 111 Read/Feed constraints in 40 ms returned sat
[2025-05-29 20:38:21] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:38:21] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-29 20:38:22] [INFO ] [Nat]Absence check using state equation in 325 ms returned sat
[2025-05-29 20:38:22] [INFO ] [Nat]Added 111 Read/Feed constraints in 70 ms returned sat
[2025-05-29 20:38:22] [INFO ] Deduced a trap composed of 45 places in 251 ms of which 2 ms to minimize.
[2025-05-29 20:38:22] [INFO ] Deduced a trap composed of 14 places in 244 ms of which 2 ms to minimize.
[2025-05-29 20:38:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 636 ms
[2025-05-29 20:38:22] [INFO ] Computed and/alt/rep : 198/678/197 causal constraints (skipped 691 transitions) in 115 ms.
[2025-05-29 20:38:23] [INFO ] Deduced a trap composed of 45 places in 306 ms of which 2 ms to minimize.
[2025-05-29 20:38:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 419 ms
[2025-05-29 20:38:23] [INFO ] Added : 5 causal constraints over 1 iterations in 738 ms. Result :sat
Minimization took 531 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 963/963 transitions.
Applied a total of 0 rules in 15 ms. Remains 136 /136 variables (removed 0) and now considering 963/963 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 136/136 places, 963/963 transitions.
[2025-05-29 20:38:24] [INFO ] Flow matrix only has 889 transitions (discarded 74 similar events)
Found an invariant !
This invariant on transitions {1=1, 477=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {0=1, 477=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 3) seen :[0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
[2025-05-29 20:38:25] [INFO ] Flow matrix only has 889 transitions (discarded 74 similar events)
[2025-05-29 20:38:25] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
RANDOM walk for 1000031 steps (2 resets) in 1085 ms. (920 steps per ms)
BEST_FIRST walk for 3000002 steps (6 resets) in 4962 ms. (604 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
[2025-05-29 20:38:31] [INFO ] Flow matrix only has 889 transitions (discarded 74 similar events)
[2025-05-29 20:38:31] [INFO ] Invariant cache hit.
[2025-05-29 20:38:31] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-29 20:38:31] [INFO ] [Real]Absence check using state equation in 262 ms returned sat
[2025-05-29 20:38:31] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-05-29 20:38:31] [INFO ] [Real]Added 111 Read/Feed constraints in 29 ms returned sat
[2025-05-29 20:38:31] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:38:31] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-29 20:38:31] [INFO ] [Nat]Absence check using state equation in 276 ms returned sat
[2025-05-29 20:38:31] [INFO ] [Nat]Added 111 Read/Feed constraints in 72 ms returned sat
[2025-05-29 20:38:32] [INFO ] Deduced a trap composed of 38 places in 306 ms of which 3 ms to minimize.
[2025-05-29 20:38:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 374 ms
[2025-05-29 20:38:32] [INFO ] Computed and/alt/rep : 198/678/197 causal constraints (skipped 691 transitions) in 117 ms.
[2025-05-29 20:38:32] [INFO ] Added : 4 causal constraints over 2 iterations in 299 ms. Result :sat
Minimization took 360 ms.
[2025-05-29 20:38:33] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-29 20:38:33] [INFO ] [Real]Absence check using state equation in 263 ms returned sat
[2025-05-29 20:38:33] [INFO ] [Real]Added 111 Read/Feed constraints in 26 ms returned sat
[2025-05-29 20:38:33] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:38:33] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-29 20:38:33] [INFO ] [Nat]Absence check using state equation in 218 ms returned sat
[2025-05-29 20:38:33] [INFO ] [Nat]Added 111 Read/Feed constraints in 37 ms returned sat
[2025-05-29 20:38:33] [INFO ] Deduced a trap composed of 45 places in 211 ms of which 3 ms to minimize.
[2025-05-29 20:38:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 279 ms
[2025-05-29 20:38:34] [INFO ] Computed and/alt/rep : 198/678/197 causal constraints (skipped 691 transitions) in 110 ms.
[2025-05-29 20:38:34] [INFO ] Deduced a trap composed of 10 places in 370 ms of which 3 ms to minimize.
[2025-05-29 20:38:35] [INFO ] Deduced a trap composed of 28 places in 355 ms of which 3 ms to minimize.
[2025-05-29 20:38:35] [INFO ] Deduced a trap composed of 14 places in 377 ms of which 2 ms to minimize.
[2025-05-29 20:38:35] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 5 ms to minimize.
[2025-05-29 20:38:35] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1484 ms
[2025-05-29 20:38:35] [INFO ] Added : 8 causal constraints over 3 iterations in 1845 ms. Result :sat
Minimization took 388 ms.
[2025-05-29 20:38:36] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-29 20:38:36] [INFO ] [Real]Absence check using state equation in 285 ms returned sat
[2025-05-29 20:38:36] [INFO ] [Real]Added 111 Read/Feed constraints in 40 ms returned sat
[2025-05-29 20:38:36] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:38:36] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-29 20:38:36] [INFO ] [Nat]Absence check using state equation in 210 ms returned sat
[2025-05-29 20:38:37] [INFO ] [Nat]Added 111 Read/Feed constraints in 44 ms returned sat
[2025-05-29 20:38:37] [INFO ] Deduced a trap composed of 45 places in 214 ms of which 2 ms to minimize.
[2025-05-29 20:38:37] [INFO ] Deduced a trap composed of 14 places in 244 ms of which 2 ms to minimize.
[2025-05-29 20:38:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 548 ms
[2025-05-29 20:38:37] [INFO ] Computed and/alt/rep : 198/678/197 causal constraints (skipped 691 transitions) in 109 ms.
[2025-05-29 20:38:38] [INFO ] Deduced a trap composed of 45 places in 241 ms of which 1 ms to minimize.
[2025-05-29 20:38:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 327 ms
[2025-05-29 20:38:38] [INFO ] Added : 5 causal constraints over 1 iterations in 603 ms. Result :sat
Minimization took 352 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 963/963 transitions.
Applied a total of 0 rules in 24 ms. Remains 136 /136 variables (removed 0) and now considering 963/963 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 136/136 places, 963/963 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 963/963 transitions.
Applied a total of 0 rules in 25 ms. Remains 136 /136 variables (removed 0) and now considering 963/963 (removed 0) transitions.
[2025-05-29 20:38:39] [INFO ] Flow matrix only has 889 transitions (discarded 74 similar events)
[2025-05-29 20:38:39] [INFO ] Invariant cache hit.
[2025-05-29 20:38:39] [INFO ] Implicit Places using invariants in 338 ms returned []
[2025-05-29 20:38:39] [INFO ] Flow matrix only has 889 transitions (discarded 74 similar events)
[2025-05-29 20:38:39] [INFO ] Invariant cache hit.
[2025-05-29 20:38:39] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-05-29 20:38:40] [INFO ] Implicit Places using invariants and state equation in 1033 ms returned []
Implicit Place search using SMT with State Equation took 1382 ms to find 0 implicit places.
[2025-05-29 20:38:40] [INFO ] Redundant transitions in 67 ms returned []
Running 962 sub problems to find dead transitions.
[2025-05-29 20:38:40] [INFO ] Flow matrix only has 889 transitions (discarded 74 similar events)
[2025-05-29 20:38:40] [INFO ] Invariant cache hit.
[2025-05-29 20:38:40] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2025-05-29 20:38:52] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2025-05-29 20:38:53] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 1 ms to minimize.
[2025-05-29 20:38:55] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
Problem TDEAD943 is UNSAT
Problem TDEAD944 is UNSAT
[2025-05-29 20:38:55] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
Problem TDEAD947 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD960 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 4/11 constraints. Problems are: Problem set: 19 solved, 943 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/11 constraints. Problems are: Problem set: 19 solved, 943 unsolved
Problem TDEAD528 is UNSAT
At refinement iteration 3 (OVERLAPS) 889/1025 variables, 136/147 constraints. Problems are: Problem set: 20 solved, 942 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1025 variables, 111/258 constraints. Problems are: Problem set: 20 solved, 942 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1025/1025 variables, and 258 constraints, problems are : Problem set: 20 solved, 942 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 136/136 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 962/962 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 20 solved, 942 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 7/7 constraints. Problems are: Problem set: 20 solved, 942 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 4/11 constraints. Problems are: Problem set: 20 solved, 942 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/11 constraints. Problems are: Problem set: 20 solved, 942 unsolved
At refinement iteration 3 (OVERLAPS) 889/1025 variables, 136/147 constraints. Problems are: Problem set: 20 solved, 942 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1025 variables, 111/258 constraints. Problems are: Problem set: 20 solved, 942 unsolved
Problem TDEAD127 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 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 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 TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/1025 variables, 942/1200 constraints. Problems are: Problem set: 100 solved, 862 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1025/1025 variables, and 1200 constraints, problems are : Problem set: 100 solved, 862 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 136/136 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 942/962 constraints, Known Traps: 4/4 constraints]
After SMT, in 64928ms problems are : Problem set: 100 solved, 862 unsolved
Search for dead transitions found 100 dead transitions in 64953ms
Found 100 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 100 transitions
Dead transitions reduction (with SMT) removed 100 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 136/136 places, 863/963 transitions.
Reduce places removed 15 places and 290 transitions.
Graph (complete) has 854 edges and 121 vertex of which 3 are kept as prefixes of interest. Removing 118 places using SCC suffix rule.0 ms
Discarding 118 places :
Also discarding 573 output transitions
Drop transitions (Output transitions of discarded places.) removed 573 transitions
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 3 transition count 0
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 16 rules in 7 ms. Remains 3 /136 variables (removed 133) and now considering 0/863 (removed 863) transitions.
[2025-05-29 20:39:45] [INFO ] Computed 0 invariants in 0 ms
[2025-05-29 20:39:45] [INFO ] Implicit Places using invariants in 21 ms returned []
[2025-05-29 20:39:45] [INFO ] Invariant cache hit.
[2025-05-29 20:39:45] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 3/136 places, 0/963 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 66499 ms. Remains : 3/136 places, 0/963 transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
FORMULA BugTracking-PT-q3m064-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
All properties solved without resorting to model-checking.
Total runtime 363960 ms.

BK_STOP 1748551185812

--------------------
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-q3m064"
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-q3m064, 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-174853774300066"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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