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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K 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-q3m004-UpperBounds-00
FORMULA_NAME BugTracking-PT-q3m004-UpperBounds-01
FORMULA_NAME BugTracking-PT-q3m004-UpperBounds-02
FORMULA_NAME BugTracking-PT-q3m004-UpperBounds-03
FORMULA_NAME BugTracking-PT-q3m004-UpperBounds-04
FORMULA_NAME BugTracking-PT-q3m004-UpperBounds-05
FORMULA_NAME BugTracking-PT-q3m004-UpperBounds-06
FORMULA_NAME BugTracking-PT-q3m004-UpperBounds-07
FORMULA_NAME BugTracking-PT-q3m004-UpperBounds-08
FORMULA_NAME BugTracking-PT-q3m004-UpperBounds-09
FORMULA_NAME BugTracking-PT-q3m004-UpperBounds-10
FORMULA_NAME BugTracking-PT-q3m004-UpperBounds-11
FORMULA_NAME BugTracking-PT-q3m004-UpperBounds-12
FORMULA_NAME BugTracking-PT-q3m004-UpperBounds-13
FORMULA_NAME BugTracking-PT-q3m004-UpperBounds-14
FORMULA_NAME BugTracking-PT-q3m004-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748549915316

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-q3m004
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-29 20:18:38] [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:18:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 20:18:39] [INFO ] Load time of PNML (sax parser for PT used): 1479 ms
[2025-05-29 20:18:39] [INFO ] Transformed 754 places.
[2025-05-29 20:18:39] [INFO ] Transformed 27370 transitions.
[2025-05-29 20:18:39] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1871 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 ms.
Deduced a syphon composed of 514 places in 134 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m004-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2025-05-29 20:18:40] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
// Phase 1: matrix 2642 rows 240 cols
[2025-05-29 20:18:40] [INFO ] Computed 10 invariants in 89 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf, 1]
RANDOM walk for 10001 steps (119 resets) in 153 ms. (64 steps per ms)
BEST_FIRST walk for 60004 steps (182 resets) in 438 ms. (136 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf, 1]
[2025-05-29 20:18:41] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
[2025-05-29 20:18:41] [INFO ] Invariant cache hit.
[2025-05-29 20:18:41] [INFO ] [Real]Absence check using 10 positive place invariants in 13 ms returned sat
[2025-05-29 20:18:42] [INFO ] [Real]Absence check using state equation in 1157 ms returned sat
[2025-05-29 20:18:42] [INFO ] State equation strengthened by 255 read => feed constraints.
[2025-05-29 20:18:43] [INFO ] [Real]Added 255 Read/Feed constraints in 109 ms returned sat
[2025-05-29 20:18:43] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:18:43] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2025-05-29 20:18:44] [INFO ] [Nat]Absence check using state equation in 950 ms returned sat
[2025-05-29 20:18:44] [INFO ] [Nat]Added 255 Read/Feed constraints in 121 ms returned sat
[2025-05-29 20:18:45] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 541 ms.
[2025-05-29 20:18:45] [INFO ] Added : 1 causal constraints over 1 iterations in 969 ms. Result :sat
Minimization took 812 ms.
[2025-05-29 20:18:46] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-05-29 20:18:47] [INFO ] [Real]Absence check using state equation in 918 ms returned sat
[2025-05-29 20:18:47] [INFO ] [Real]Added 255 Read/Feed constraints in 83 ms returned sat
[2025-05-29 20:18:47] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:18:47] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-29 20:18:48] [INFO ] [Nat]Absence check using state equation in 776 ms returned sat
[2025-05-29 20:18:48] [INFO ] [Nat]Added 255 Read/Feed constraints in 257 ms returned sat
[2025-05-29 20:18:49] [INFO ] Deduced a trap composed of 59 places in 1047 ms of which 45 ms to minimize.
[2025-05-29 20:18:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1491 ms
[2025-05-29 20:18:50] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 445 ms.
[2025-05-29 20:18:51] [INFO ] Added : 4 causal constraints over 1 iterations in 901 ms. Result :sat
Minimization took 828 ms.
[2025-05-29 20:18:51] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-05-29 20:18:52] [INFO ] [Real]Absence check using state equation in 854 ms returned sat
[2025-05-29 20:18:52] [INFO ] [Real]Added 255 Read/Feed constraints in 71 ms returned sat
[2025-05-29 20:18:53] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:18:53] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-05-29 20:18:54] [INFO ] [Nat]Absence check using state equation in 849 ms returned sat
[2025-05-29 20:18:54] [INFO ] [Nat]Added 255 Read/Feed constraints in 154 ms returned sat
[2025-05-29 20:18:54] [INFO ] Deduced a trap composed of 40 places in 644 ms of which 4 ms to minimize.
[2025-05-29 20:18:55] [INFO ] Deduced a trap composed of 27 places in 638 ms of which 4 ms to minimize.
[2025-05-29 20:18:56] [INFO ] Deduced a trap composed of 23 places in 643 ms of which 3 ms to minimize.
[2025-05-29 20:18:57] [INFO ] Deduced a trap composed of 50 places in 690 ms of which 5 ms to minimize.
[2025-05-29 20:18:57] [INFO ] Deduced a trap composed of 74 places in 624 ms of which 3 ms to minimize.
[2025-05-29 20:18:58] [INFO ] Deduced a trap composed of 60 places in 582 ms of which 3 ms to minimize.
[2025-05-29 20:18: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 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.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:18:58] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-05-29 20:18:59] [INFO ] [Real]Absence check using state equation in 1003 ms returned sat
[2025-05-29 20:18:59] [INFO ] [Real]Added 255 Read/Feed constraints in 116 ms returned sat
[2025-05-29 20:19:00] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:19:00] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-29 20:19:00] [INFO ] [Nat]Absence check using state equation in 732 ms returned sat
[2025-05-29 20:19:00] [INFO ] [Nat]Added 255 Read/Feed constraints in 124 ms returned sat
[2025-05-29 20:19:01] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 223 ms.
[2025-05-29 20:19:01] [INFO ] Added : 7 causal constraints over 2 iterations in 620 ms. Result :sat
Minimization took 870 ms.
[2025-05-29 20:19:02] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-29 20:19:03] [INFO ] [Real]Absence check using state equation in 863 ms returned sat
[2025-05-29 20:19:03] [INFO ] [Real]Added 255 Read/Feed constraints in 76 ms returned sat
[2025-05-29 20:19:03] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:19:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-29 20:19:04] [INFO ] [Nat]Absence check using state equation in 890 ms returned sat
[2025-05-29 20:19:04] [INFO ] [Nat]Added 255 Read/Feed constraints in 253 ms returned sat
[2025-05-29 20:19:05] [INFO ] Deduced a trap composed of 19 places in 631 ms of which 3 ms to minimize.
[2025-05-29 20:19:06] [INFO ] Deduced a trap composed of 20 places in 523 ms of which 2 ms to minimize.
[2025-05-29 20:19:06] [INFO ] Deduced a trap composed of 72 places in 506 ms of which 3 ms to minimize.
[2025-05-29 20:19:07] [INFO ] Deduced a trap composed of 73 places in 550 ms of which 3 ms to minimize.
[2025-05-29 20:19:08] [INFO ] Deduced a trap composed of 35 places in 471 ms of which 3 ms to minimize.
[2025-05-29 20:19:08] [INFO ] Deduced a trap composed of 38 places in 561 ms of which 3 ms to minimize.
[2025-05-29 20:19:08] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.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:19:08] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-05-29 20:19:09] [INFO ] [Real]Absence check using state equation in 810 ms returned sat
[2025-05-29 20:19:09] [INFO ] [Real]Added 255 Read/Feed constraints in 55 ms returned sat
[2025-05-29 20:19:09] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:19:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-05-29 20:19:10] [INFO ] [Nat]Absence check using state equation in 781 ms returned sat
[2025-05-29 20:19:10] [INFO ] [Nat]Added 255 Read/Feed constraints in 116 ms returned sat
[2025-05-29 20:19:11] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 307 ms.
[2025-05-29 20:19:11] [INFO ] Added : 8 causal constraints over 2 iterations in 942 ms. Result :sat
Minimization took 806 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf, 1]
Support contains 6 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 2769/2769 transitions.
Graph (complete) has 3422 edges and 240 vertex of which 238 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.12 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 237 transition count 2750
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 237 transition count 2750
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 235 transition count 2753
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 235 transition count 2747
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 229 transition count 2747
Applied a total of 19 rules in 389 ms. Remains 229 /240 variables (removed 11) and now considering 2747/2769 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 410 ms. Remains : 229/240 places, 2747/2769 transitions.
[2025-05-29 20:19:13] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
Found an invariant !
This invariant on transitions {4=1, 1722=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {0=1, 1722=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 255 ms. (steps per millisecond=39 ) properties (out of 6) seen :[0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf, 1]
[2025-05-29 20:19:14] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2025-05-29 20:19:14] [INFO ] Computed 8 invariants in 23 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf, 1]
RANDOM walk for 1000000 steps (3 resets) in 9835 ms. (101 steps per ms)
BEST_FIRST walk for 6000006 steps (17 resets) in 19393 ms. (309 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf, 1]
[2025-05-29 20:19:43] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2025-05-29 20:19:43] [INFO ] Invariant cache hit.
[2025-05-29 20:19:43] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-29 20:19:44] [INFO ] [Real]Absence check using state equation in 597 ms returned sat
[2025-05-29 20:19:44] [INFO ] State equation strengthened by 241 read => feed constraints.
[2025-05-29 20:19:44] [INFO ] [Real]Added 241 Read/Feed constraints in 46 ms returned sat
[2025-05-29 20:19:44] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:19:44] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-29 20:19:45] [INFO ] [Nat]Absence check using state equation in 747 ms returned sat
[2025-05-29 20:19:45] [INFO ] [Nat]Added 241 Read/Feed constraints in 92 ms returned sat
[2025-05-29 20:19:46] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 321 ms.
[2025-05-29 20:19:46] [INFO ] Added : 0 causal constraints over 0 iterations in 598 ms. Result :sat
Minimization took 2401 ms.
[2025-05-29 20:19:48] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-29 20:19:49] [INFO ] [Real]Absence check using state equation in 802 ms returned sat
[2025-05-29 20:19:49] [INFO ] [Real]Added 241 Read/Feed constraints in 55 ms returned sat
[2025-05-29 20:19:49] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:19:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-29 20:19:50] [INFO ] [Nat]Absence check using state equation in 608 ms returned sat
[2025-05-29 20:19:50] [INFO ] [Nat]Added 241 Read/Feed constraints in 124 ms returned sat
[2025-05-29 20:19:51] [INFO ] Deduced a trap composed of 67 places in 810 ms of which 5 ms to minimize.
[2025-05-29 20:19:52] [INFO ] Deduced a trap composed of 19 places in 841 ms of which 5 ms to minimize.
[2025-05-29 20:19:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1922 ms
[2025-05-29 20:19:52] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 347 ms.
[2025-05-29 20:19:53] [INFO ] Added : 2 causal constraints over 1 iterations in 776 ms. Result :sat
Minimization took 2356 ms.
[2025-05-29 20:19:55] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-29 20:19:56] [INFO ] [Real]Absence check using state equation in 818 ms returned sat
[2025-05-29 20:19:56] [INFO ] [Real]Added 241 Read/Feed constraints in 67 ms returned sat
[2025-05-29 20:19:56] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:19:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-29 20:19:57] [INFO ] [Nat]Absence check using state equation in 734 ms returned sat
[2025-05-29 20:19:57] [INFO ] [Nat]Added 241 Read/Feed constraints in 167 ms returned sat
[2025-05-29 20:19:58] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 317 ms.
[2025-05-29 20:19:58] [INFO ] Added : 3 causal constraints over 1 iterations in 674 ms. Result :sat
Minimization took 2190 ms.
[2025-05-29 20:20:01] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-05-29 20:20:01] [INFO ] [Real]Absence check using state equation in 592 ms returned sat
[2025-05-29 20:20:01] [INFO ] [Real]Added 241 Read/Feed constraints in 53 ms returned sat
[2025-05-29 20:20:01] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:20:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-29 20:20:02] [INFO ] [Nat]Absence check using state equation in 781 ms returned sat
[2025-05-29 20:20:02] [INFO ] [Nat]Added 241 Read/Feed constraints in 211 ms returned sat
[2025-05-29 20:20:03] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 327 ms.
[2025-05-29 20:20:03] [INFO ] Added : 3 causal constraints over 1 iterations in 718 ms. Result :sat
Minimization took 2404 ms.
[2025-05-29 20:20:06] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-29 20:20:06] [INFO ] [Real]Absence check using state equation in 683 ms returned sat
[2025-05-29 20:20:07] [INFO ] [Real]Added 241 Read/Feed constraints in 74 ms returned sat
[2025-05-29 20:20:07] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:20:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-29 20:20:07] [INFO ] [Nat]Absence check using state equation in 588 ms returned sat
[2025-05-29 20:20:07] [INFO ] [Nat]Added 241 Read/Feed constraints in 133 ms returned sat
[2025-05-29 20:20:08] [INFO ] Deduced a trap composed of 48 places in 641 ms of which 2 ms to minimize.
[2025-05-29 20:20:09] [INFO ] Deduced a trap composed of 37 places in 411 ms of which 2 ms to minimize.
[2025-05-29 20:20:09] [INFO ] Deduced a trap composed of 10 places in 374 ms of which 2 ms to minimize.
[2025-05-29 20:20:09] [INFO ] Deduced a trap composed of 50 places in 409 ms of which 2 ms to minimize.
[2025-05-29 20:20:10] [INFO ] Deduced a trap composed of 48 places in 415 ms of which 2 ms to minimize.
[2025-05-29 20:20:10] [INFO ] Deduced a trap composed of 18 places in 404 ms of which 3 ms to minimize.
[2025-05-29 20:20:11] [INFO ] Deduced a trap composed of 49 places in 382 ms of which 2 ms to minimize.
[2025-05-29 20:20:11] [INFO ] Deduced a trap composed of 36 places in 458 ms of which 3 ms to minimize.
[2025-05-29 20:20:12] [INFO ] Deduced a trap composed of 49 places in 587 ms of which 3 ms to minimize.
[2025-05-29 20:20:13] [INFO ] Deduced a trap composed of 48 places in 639 ms of which 3 ms to minimize.
[2025-05-29 20:20:14] [INFO ] Deduced a trap composed of 35 places in 678 ms of which 3 ms to minimize.
[2025-05-29 20:20:15] [INFO ] Deduced a trap composed of 27 places in 704 ms of which 4 ms to minimize.
[2025-05-29 20:20:16] [INFO ] Deduced a trap composed of 18 places in 504 ms of which 3 ms to minimize.
[2025-05-29 20:20:17] [INFO ] Deduced a trap composed of 48 places in 623 ms of which 3 ms to minimize.
[2025-05-29 20:20:18] [INFO ] Deduced a trap composed of 83 places in 815 ms of which 4 ms to minimize.
[2025-05-29 20:20:18] [INFO ] Deduced a trap composed of 51 places in 532 ms of which 2 ms to minimize.
[2025-05-29 20:20:19] [INFO ] Deduced a trap composed of 60 places in 872 ms of which 4 ms to minimize.
[2025-05-29 20:20:20] [INFO ] Deduced a trap composed of 88 places in 893 ms of which 4 ms to minimize.
[2025-05-29 20:20:21] [INFO ] Deduced a trap composed of 50 places in 508 ms of which 3 ms to minimize.
[2025-05-29 20:20:22] [INFO ] Deduced a trap composed of 68 places in 493 ms of which 2 ms to minimize.
[2025-05-29 20:20:22] [INFO ] Deduced a trap composed of 117 places in 533 ms of which 3 ms to minimize.
[2025-05-29 20:20:22] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 14884 ms
[2025-05-29 20:20:22] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 215 ms.
[2025-05-29 20:20:23] [INFO ] Deduced a trap composed of 69 places in 501 ms of which 2 ms to minimize.
[2025-05-29 20:20:24] [INFO ] Deduced a trap composed of 39 places in 463 ms of which 3 ms to minimize.
[2025-05-29 20:20:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1227 ms
[2025-05-29 20:20:24] [INFO ] Added : 4 causal constraints over 2 iterations in 1885 ms. Result :sat
Minimization took 2440 ms.
[2025-05-29 20:20:27] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-29 20:20:27] [INFO ] [Real]Absence check using state equation in 683 ms returned sat
[2025-05-29 20:20:28] [INFO ] [Real]Added 241 Read/Feed constraints in 77 ms returned sat
[2025-05-29 20:20:28] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:20:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-29 20:20:28] [INFO ] [Nat]Absence check using state equation in 671 ms returned sat
[2025-05-29 20:20:29] [INFO ] [Nat]Added 241 Read/Feed constraints in 152 ms returned sat
[2025-05-29 20:20:29] [INFO ] Deduced a trap composed of 51 places in 532 ms of which 2 ms to minimize.
[2025-05-29 20:20:30] [INFO ] Deduced a trap composed of 76 places in 542 ms of which 3 ms to minimize.
[2025-05-29 20:20:30] [INFO ] Deduced a trap composed of 49 places in 516 ms of which 2 ms to minimize.
[2025-05-29 20:20:31] [INFO ] Deduced a trap composed of 14 places in 418 ms of which 2 ms to minimize.
[2025-05-29 20:20:32] [INFO ] Deduced a trap composed of 47 places in 551 ms of which 2 ms to minimize.
[2025-05-29 20:20:32] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3033 ms
[2025-05-29 20:20:32] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 335 ms.
[2025-05-29 20:20:33] [INFO ] Added : 7 causal constraints over 3 iterations in 942 ms. Result :sat
Minimization took 2394 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf, 1]
Support contains 6 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 52 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 48 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2025-05-29 20:20:36] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2025-05-29 20:20:36] [INFO ] Invariant cache hit.
[2025-05-29 20:20:36] [INFO ] Implicit Places using invariants in 665 ms returned []
[2025-05-29 20:20:36] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2025-05-29 20:20:36] [INFO ] Invariant cache hit.
[2025-05-29 20:20:37] [INFO ] State equation strengthened by 241 read => feed constraints.
[2025-05-29 20:20:39] [INFO ] Implicit Places using invariants and state equation in 2679 ms returned []
Implicit Place search using SMT with State Equation took 3350 ms to find 0 implicit places.
[2025-05-29 20:20:39] [INFO ] Redundant transitions in 379 ms returned []
Running 2746 sub problems to find dead transitions.
[2025-05-29 20:20:40] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2025-05-29 20:20:40] [INFO ] Invariant cache hit.
[2025-05-29 20:20:40] [INFO ] State equation strengthened by 241 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2746 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 229/2847 variables, and 8 constraints, problems are : Problem set: 0 solved, 2746 unsolved in 30133 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/229 constraints, ReadFeed: 0/241 constraints, PredecessorRefiner: 2746/2746 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2746 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2746 unsolved
[2025-05-29 20:21:58] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 2 ms to minimize.
[2025-05-29 20:22:02] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 2 ms to minimize.
Problem TDEAD1433 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1435 is UNSAT
Problem TDEAD1436 is UNSAT
Problem TDEAD1437 is UNSAT
Problem TDEAD1438 is UNSAT
Problem TDEAD1439 is UNSAT
[2025-05-29 20:22:02] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 2 ms to minimize.
Problem TDEAD1440 is UNSAT
Problem TDEAD1441 is UNSAT
Problem TDEAD1442 is UNSAT
Problem TDEAD1443 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1446 is UNSAT
Problem TDEAD1447 is UNSAT
Problem TDEAD1448 is UNSAT
Problem TDEAD1449 is UNSAT
Problem TDEAD1450 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1458 is UNSAT
Problem TDEAD1459 is UNSAT
Problem TDEAD1460 is UNSAT
Problem TDEAD1461 is UNSAT
Problem TDEAD1462 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1468 is UNSAT
Problem TDEAD1469 is UNSAT
Problem TDEAD1470 is UNSAT
Problem TDEAD1471 is UNSAT
Problem TDEAD1472 is UNSAT
Problem TDEAD1473 is UNSAT
[2025-05-29 20:22:03] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 1 ms to minimize.
Problem TDEAD1474 is UNSAT
Problem TDEAD1475 is UNSAT
[2025-05-29 20:22:03] [INFO ] Deduced a trap composed of 8 places in 157 ms of which 1 ms to minimize.
Problem TDEAD1476 is UNSAT
Problem TDEAD1477 is UNSAT
[2025-05-29 20:22:03] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
Problem TDEAD1480 is UNSAT
Problem TDEAD1481 is UNSAT
Problem TDEAD1482 is UNSAT
Problem TDEAD1483 is UNSAT
Problem TDEAD1485 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1490 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1497 is UNSAT
Problem TDEAD1498 is UNSAT
Problem TDEAD1501 is UNSAT
Problem TDEAD1502 is UNSAT
Problem TDEAD1503 is UNSAT
Problem TDEAD1504 is UNSAT
Problem TDEAD1506 is UNSAT
Problem TDEAD1507 is UNSAT
Problem TDEAD1510 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1513 is UNSAT
Problem TDEAD1516 is UNSAT
Problem TDEAD1517 is UNSAT
Problem TDEAD1518 is UNSAT
Problem TDEAD1519 is UNSAT
Problem TDEAD1562 is UNSAT
Problem TDEAD1563 is UNSAT
Problem TDEAD1564 is UNSAT
Problem TDEAD1565 is UNSAT
Problem TDEAD1566 is UNSAT
Problem TDEAD1567 is UNSAT
Problem TDEAD1568 is UNSAT
Problem TDEAD1569 is UNSAT
Problem TDEAD1570 is UNSAT
Problem TDEAD1571 is UNSAT
Problem TDEAD1572 is UNSAT
Problem TDEAD1573 is UNSAT
Problem TDEAD1574 is UNSAT
Problem TDEAD1575 is UNSAT
Problem TDEAD1576 is UNSAT
Problem TDEAD1577 is UNSAT
Problem TDEAD1578 is UNSAT
Problem TDEAD1579 is UNSAT
Problem TDEAD1580 is UNSAT
Problem TDEAD1581 is UNSAT
Problem TDEAD1582 is UNSAT
Problem TDEAD1583 is UNSAT
Problem TDEAD1584 is UNSAT
Problem TDEAD1585 is UNSAT
Problem TDEAD1586 is UNSAT
Problem TDEAD1587 is UNSAT
Problem TDEAD1588 is UNSAT
Problem TDEAD1589 is UNSAT
Problem TDEAD1590 is UNSAT
Problem TDEAD1591 is UNSAT
Problem TDEAD1592 is UNSAT
Problem TDEAD1593 is UNSAT
Problem TDEAD1594 is UNSAT
Problem TDEAD1595 is UNSAT
Problem TDEAD1596 is UNSAT
Problem TDEAD1597 is UNSAT
Problem TDEAD1598 is UNSAT
Problem TDEAD1599 is UNSAT
Problem TDEAD1600 is UNSAT
Problem TDEAD1601 is UNSAT
Problem TDEAD1602 is UNSAT
Problem TDEAD1603 is UNSAT
Problem TDEAD1604 is UNSAT
Problem TDEAD1605 is UNSAT
Problem TDEAD1606 is UNSAT
Problem TDEAD1607 is UNSAT
Problem TDEAD1608 is UNSAT
Problem TDEAD1609 is UNSAT
Problem TDEAD1610 is UNSAT
Problem TDEAD1611 is UNSAT
Problem TDEAD1612 is UNSAT
Problem TDEAD1613 is UNSAT
Problem TDEAD1614 is UNSAT
Problem TDEAD1615 is UNSAT
Problem TDEAD1616 is UNSAT
Problem TDEAD1617 is UNSAT
Problem TDEAD1618 is UNSAT
Problem TDEAD1619 is UNSAT
Problem TDEAD1620 is UNSAT
Problem TDEAD1621 is UNSAT
Problem TDEAD1622 is UNSAT
Problem TDEAD1623 is UNSAT
Problem TDEAD1624 is UNSAT
Problem TDEAD1625 is UNSAT
Problem TDEAD1626 is UNSAT
Problem TDEAD1627 is UNSAT
Problem TDEAD1628 is UNSAT
Problem TDEAD1629 is UNSAT
Problem TDEAD1630 is UNSAT
Problem TDEAD1631 is UNSAT
Problem TDEAD1632 is UNSAT
Problem TDEAD1633 is UNSAT
Problem TDEAD1634 is UNSAT
Problem TDEAD1635 is UNSAT
Problem TDEAD1636 is UNSAT
Problem TDEAD1637 is UNSAT
Problem TDEAD1638 is UNSAT
Problem TDEAD1639 is UNSAT
Problem TDEAD1640 is UNSAT
Problem TDEAD1641 is UNSAT
Problem TDEAD1642 is UNSAT
Problem TDEAD1643 is UNSAT
Problem TDEAD1644 is UNSAT
Problem TDEAD1645 is UNSAT
Problem TDEAD1716 is UNSAT
Problem TDEAD1717 is UNSAT
Problem TDEAD1718 is UNSAT
Problem TDEAD1719 is UNSAT
Problem TDEAD1720 is UNSAT
Problem TDEAD1721 is UNSAT
Problem TDEAD1722 is UNSAT
Problem TDEAD1723 is UNSAT
Problem TDEAD1724 is UNSAT
Problem TDEAD1725 is UNSAT
Problem TDEAD1726 is UNSAT
Problem TDEAD1727 is UNSAT
Problem TDEAD1728 is UNSAT
Problem TDEAD1729 is UNSAT
Problem TDEAD1730 is UNSAT
Problem TDEAD1731 is UNSAT
Problem TDEAD1732 is UNSAT
Problem TDEAD1733 is UNSAT
Problem TDEAD1734 is UNSAT
Problem TDEAD1735 is UNSAT
Problem TDEAD1736 is UNSAT
Problem TDEAD1737 is UNSAT
Problem TDEAD1738 is UNSAT
Problem TDEAD1739 is UNSAT
Problem TDEAD1740 is UNSAT
Problem TDEAD1741 is UNSAT
Problem TDEAD1742 is UNSAT
Problem TDEAD1743 is UNSAT
Problem TDEAD1747 is UNSAT
Problem TDEAD1748 is UNSAT
Problem TDEAD1752 is UNSAT
Problem TDEAD1753 is UNSAT
Problem TDEAD1754 is UNSAT
Problem TDEAD1755 is UNSAT
Problem TDEAD1756 is UNSAT
Problem TDEAD1757 is UNSAT
Problem TDEAD1763 is UNSAT
Problem TDEAD1764 is UNSAT
Problem TDEAD1766 is UNSAT
Problem TDEAD1767 is UNSAT
Problem TDEAD1771 is UNSAT
Problem TDEAD1772 is UNSAT
Problem TDEAD1773 is UNSAT
Problem TDEAD1774 is UNSAT
Problem TDEAD1775 is UNSAT
Problem TDEAD1776 is UNSAT
Problem TDEAD1782 is UNSAT
Problem TDEAD1783 is UNSAT
Problem TDEAD1785 is UNSAT
Problem TDEAD1786 is UNSAT
Problem TDEAD1790 is UNSAT
Problem TDEAD1791 is UNSAT
Problem TDEAD1792 is UNSAT
Problem TDEAD1793 is UNSAT
Problem TDEAD1794 is UNSAT
Problem TDEAD1795 is UNSAT
Problem TDEAD1801 is UNSAT
Problem TDEAD1802 is UNSAT
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 229/2847 variables, and 14 constraints, problems are : Problem set: 206 solved, 2540 unsolved in 30083 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/229 constraints, ReadFeed: 0/241 constraints, PredecessorRefiner: 0/2746 constraints, Known Traps: 6/6 constraints]
After SMT, in 94917ms problems are : Problem set: 206 solved, 2540 unsolved
Search for dead transitions found 206 dead transitions in 94992ms
Found 206 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 206 transitions
Dead transitions reduction (with SMT) removed 206 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 229/229 places, 2541/2747 transitions.
Reduce places removed 25 places and 534 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 204 transition count 2007
Reduce places removed 19 places and 264 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 44 place count 185 transition count 1743
Reduce places removed 9 places and 198 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 53 place count 176 transition count 1545
Reduce places removed 8 places and 121 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 61 place count 168 transition count 1424
Reduce places removed 3 places and 66 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 64 place count 165 transition count 1358
Reduce places removed 3 places and 53 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 67 place count 162 transition count 1305
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 69 place count 160 transition count 1280
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 17 places and 276 transitions.
Iterating global reduction 6 with 19 rules applied. Total rules applied 88 place count 143 transition count 1004
Deduced a syphon composed of 3 places in 2 ms
Applied a total of 88 rules in 99 ms. Remains 143 /229 variables (removed 86) and now considering 1004/2541 (removed 1537) transitions.
[2025-05-29 20:22:15] [INFO ] Flow matrix only has 946 transitions (discarded 58 similar events)
// Phase 1: matrix 946 rows 143 cols
[2025-05-29 20:22:15] [INFO ] Computed 11 invariants in 7 ms
[2025-05-29 20:22:15] [INFO ] Implicit Places using invariants in 405 ms returned []
[2025-05-29 20:22:15] [INFO ] Flow matrix only has 946 transitions (discarded 58 similar events)
[2025-05-29 20:22:15] [INFO ] Invariant cache hit.
[2025-05-29 20:22:15] [INFO ] State equation strengthened by 119 read => feed constraints.
[2025-05-29 20:22:16] [INFO ] Implicit Places using invariants and state equation in 1073 ms returned []
Implicit Place search using SMT with State Equation took 1492 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 143/229 places, 1004/2747 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 100409 ms. Remains : 143/229 places, 1004/2747 transitions.
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
FORMULA BugTracking-PT-q3m004-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-29 20:22:16] [INFO ] Flow matrix only has 946 transitions (discarded 58 similar events)
Found an invariant !
This invariant on transitions {0=1, 594=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {4=1, 594=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 371 ms. (steps per millisecond=26 ) properties (out of 3) seen :[0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf, 1]
[2025-05-29 20:22:17] [INFO ] Flow matrix only has 946 transitions (discarded 58 similar events)
// Phase 1: matrix 946 rows 140 cols
[2025-05-29 20:22:17] [INFO ] Computed 8 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf, 1]
RANDOM walk for 1000000 steps (2 resets) in 3958 ms. (252 steps per ms)
BEST_FIRST walk for 3000003 steps (9 resets) in 4953 ms. (605 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf, 1]
[2025-05-29 20:22:26] [INFO ] Flow matrix only has 946 transitions (discarded 58 similar events)
[2025-05-29 20:22:26] [INFO ] Invariant cache hit.
[2025-05-29 20:22:26] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-29 20:22:26] [INFO ] [Real]Absence check using state equation in 245 ms returned sat
[2025-05-29 20:22:26] [INFO ] State equation strengthened by 119 read => feed constraints.
[2025-05-29 20:22:26] [INFO ] [Real]Added 119 Read/Feed constraints in 20 ms returned sat
[2025-05-29 20:22:26] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:22:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-05-29 20:22:26] [INFO ] [Nat]Absence check using state equation in 204 ms returned sat
[2025-05-29 20:22:27] [INFO ] [Nat]Added 119 Read/Feed constraints in 21 ms returned sat
[2025-05-29 20:22:27] [INFO ] Computed and/alt/rep : 232/915/231 causal constraints (skipped 714 transitions) in 117 ms.
[2025-05-29 20:22:27] [INFO ] Added : 0 causal constraints over 0 iterations in 223 ms. Result :sat
Minimization took 568 ms.
[2025-05-29 20:22:27] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-29 20:22:28] [INFO ] [Real]Absence check using state equation in 317 ms returned sat
[2025-05-29 20:22:28] [INFO ] [Real]Added 119 Read/Feed constraints in 39 ms returned sat
[2025-05-29 20:22:28] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:22:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-29 20:22:28] [INFO ] [Nat]Absence check using state equation in 304 ms returned sat
[2025-05-29 20:22:28] [INFO ] [Nat]Added 119 Read/Feed constraints in 52 ms returned sat
[2025-05-29 20:22:29] [INFO ] Deduced a trap composed of 24 places in 246 ms of which 2 ms to minimize.
[2025-05-29 20:22:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 329 ms
[2025-05-29 20:22:29] [INFO ] Computed and/alt/rep : 232/915/231 causal constraints (skipped 714 transitions) in 114 ms.
[2025-05-29 20:22:29] [INFO ] Deduced a trap composed of 57 places in 373 ms of which 4 ms to minimize.
[2025-05-29 20:22:30] [INFO ] Deduced a trap composed of 10 places in 390 ms of which 3 ms to minimize.
[2025-05-29 20:22:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 934 ms
[2025-05-29 20:22:30] [INFO ] Added : 10 causal constraints over 3 iterations in 1381 ms. Result :sat
Minimization took 625 ms.
[2025-05-29 20:22:31] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-29 20:22:31] [INFO ] [Real]Absence check using state equation in 225 ms returned sat
[2025-05-29 20:22:31] [INFO ] [Real]Added 119 Read/Feed constraints in 20 ms returned sat
[2025-05-29 20:22:31] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:22:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-05-29 20:22:31] [INFO ] [Nat]Absence check using state equation in 331 ms returned sat
[2025-05-29 20:22:31] [INFO ] [Nat]Added 119 Read/Feed constraints in 47 ms returned sat
[2025-05-29 20:22:32] [INFO ] Deduced a trap composed of 31 places in 226 ms of which 2 ms to minimize.
[2025-05-29 20:22:32] [INFO ] Deduced a trap composed of 9 places in 276 ms of which 3 ms to minimize.
[2025-05-29 20:22:32] [INFO ] Deduced a trap composed of 19 places in 266 ms of which 2 ms to minimize.
[2025-05-29 20:22:33] [INFO ] Deduced a trap composed of 32 places in 275 ms of which 2 ms to minimize.
[2025-05-29 20:22:33] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1253 ms
[2025-05-29 20:22:33] [INFO ] Computed and/alt/rep : 232/915/231 causal constraints (skipped 714 transitions) in 122 ms.
[2025-05-29 20:22:33] [INFO ] Added : 2 causal constraints over 1 iterations in 283 ms. Result :sat
Minimization took 601 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf, 1]
Support contains 3 out of 140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 1004/1004 transitions.
Applied a total of 0 rules in 15 ms. Remains 140 /140 variables (removed 0) and now considering 1004/1004 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 140/140 places, 1004/1004 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 1004/1004 transitions.
Applied a total of 0 rules in 14 ms. Remains 140 /140 variables (removed 0) and now considering 1004/1004 (removed 0) transitions.
[2025-05-29 20:22:34] [INFO ] Flow matrix only has 946 transitions (discarded 58 similar events)
[2025-05-29 20:22:34] [INFO ] Invariant cache hit.
[2025-05-29 20:22:34] [INFO ] Implicit Places using invariants in 250 ms returned []
[2025-05-29 20:22:34] [INFO ] Flow matrix only has 946 transitions (discarded 58 similar events)
[2025-05-29 20:22:34] [INFO ] Invariant cache hit.
[2025-05-29 20:22:34] [INFO ] State equation strengthened by 119 read => feed constraints.
[2025-05-29 20:22:35] [INFO ] Implicit Places using invariants and state equation in 1128 ms returned []
Implicit Place search using SMT with State Equation took 1387 ms to find 0 implicit places.
[2025-05-29 20:22:35] [INFO ] Redundant transitions in 66 ms returned []
Running 1003 sub problems to find dead transitions.
[2025-05-29 20:22:35] [INFO ] Flow matrix only has 946 transitions (discarded 58 similar events)
[2025-05-29 20:22:35] [INFO ] Invariant cache hit.
[2025-05-29 20:22:35] [INFO ] State equation strengthened by 119 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1003 unsolved
[2025-05-29 20:22:46] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 7 ms to minimize.
[2025-05-29 20:22:48] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 2 ms to minimize.
[2025-05-29 20:22:48] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
[2025-05-29 20:22:49] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
Problem TDEAD627 is UNSAT
[2025-05-29 20:22:49] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
[2025-05-29 20:22:51] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 1 ms to minimize.
Problem TDEAD971 is UNSAT
Problem TDEAD972 is UNSAT
[2025-05-29 20:22:52] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 1 ms to minimize.
Problem TDEAD980 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD115 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 7/15 constraints. Problems are: Problem set: 164 solved, 839 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/15 constraints. Problems are: Problem set: 164 solved, 839 unsolved
Problem TDEAD626 is UNSAT
At refinement iteration 3 (OVERLAPS) 946/1086 variables, 140/155 constraints. Problems are: Problem set: 165 solved, 838 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1086 variables, 119/274 constraints. Problems are: Problem set: 165 solved, 838 unsolved
(s56 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 2.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 (/ 35.0 44.0))
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1086/1086 variables, and 274 constraints, problems are : Problem set: 165 solved, 838 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 140/140 constraints, ReadFeed: 119/119 constraints, PredecessorRefiner: 1003/1003 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 165 solved, 838 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 7/7 constraints. Problems are: Problem set: 165 solved, 838 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 7/14 constraints. Problems are: Problem set: 165 solved, 838 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/14 constraints. Problems are: Problem set: 165 solved, 838 unsolved
At refinement iteration 3 (OVERLAPS) 1/140 variables, 1/15 constraints. Problems are: Problem set: 165 solved, 838 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/15 constraints. Problems are: Problem set: 165 solved, 838 unsolved
At refinement iteration 5 (OVERLAPS) 946/1086 variables, 140/155 constraints. Problems are: Problem set: 165 solved, 838 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1086 variables, 119/274 constraints. Problems are: Problem set: 165 solved, 838 unsolved
Problem TDEAD106 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/1086 variables, 838/1112 constraints. Problems are: Problem set: 235 solved, 768 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1086/1086 variables, and 1112 constraints, problems are : Problem set: 235 solved, 768 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 140/140 constraints, ReadFeed: 119/119 constraints, PredecessorRefiner: 838/1003 constraints, Known Traps: 7/7 constraints]
After SMT, in 65296ms problems are : Problem set: 235 solved, 768 unsolved
Search for dead transitions found 235 dead transitions in 65319ms
Found 235 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 235 transitions
Dead transitions reduction (with SMT) removed 235 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 140/140 places, 769/1004 transitions.
Graph (complete) has 1089 edges and 140 vertex of which 139 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 17 places and 257 transitions.
Graph (complete) has 793 edges and 122 vertex of which 3 are kept as prefixes of interest. Removing 119 places using SCC suffix rule.1 ms
Discarding 119 places :
Also discarding 512 output transitions
Drop transitions (Output transitions of discarded places.) removed 512 transitions
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 3 transition count 0
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 19 rules in 5 ms. Remains 3 /140 variables (removed 137) and now considering 0/769 (removed 769) transitions.
[2025-05-29 20:23:40] [INFO ] Computed 0 invariants in 0 ms
[2025-05-29 20:23:40] [INFO ] Implicit Places using invariants in 19 ms returned []
[2025-05-29 20:23:40] [INFO ] Invariant cache hit.
[2025-05-29 20:23:40] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 3/140 places, 0/1004 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 66845 ms. Remains : 3/140 places, 0/1004 transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
FORMULA BugTracking-PT-q3m004-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
All properties solved without resorting to model-checking.
Total runtime 302983 ms.

BK_STOP 1748550221115

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-q3m004"
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-q3m004, 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-174853774300062"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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