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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 169K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K 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.2K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 16M May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME BugTracking-PT-q8m064-UpperBounds-00
FORMULA_NAME BugTracking-PT-q8m064-UpperBounds-01
FORMULA_NAME BugTracking-PT-q8m064-UpperBounds-02
FORMULA_NAME BugTracking-PT-q8m064-UpperBounds-03
FORMULA_NAME BugTracking-PT-q8m064-UpperBounds-04
FORMULA_NAME BugTracking-PT-q8m064-UpperBounds-05
FORMULA_NAME BugTracking-PT-q8m064-UpperBounds-06
FORMULA_NAME BugTracking-PT-q8m064-UpperBounds-07
FORMULA_NAME BugTracking-PT-q8m064-UpperBounds-08
FORMULA_NAME BugTracking-PT-q8m064-UpperBounds-09
FORMULA_NAME BugTracking-PT-q8m064-UpperBounds-10
FORMULA_NAME BugTracking-PT-q8m064-UpperBounds-11
FORMULA_NAME BugTracking-PT-q8m064-UpperBounds-12
FORMULA_NAME BugTracking-PT-q8m064-UpperBounds-13
FORMULA_NAME BugTracking-PT-q8m064-UpperBounds-14
FORMULA_NAME BugTracking-PT-q8m064-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748552753042

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-q8m064
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-29 21:05:55] [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 21:05:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 21:05:57] [INFO ] Load time of PNML (sax parser for PT used): 1534 ms
[2025-05-29 21:05:57] [INFO ] Transformed 754 places.
[2025-05-29 21:05:57] [INFO ] Transformed 27370 transitions.
[2025-05-29 21:05:57] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 2021 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 28 ms.
Deduced a syphon composed of 474 places in 252 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m064-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-05-29 21:05:58] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2025-05-29 21:05:58] [INFO ] Computed 10 invariants in 121 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, +inf, 1, 1, 1, +inf, 1]
RANDOM walk for 10000 steps (7 resets) in 112 ms. (88 steps per ms)
FORMULA BugTracking-PT-q8m064-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60005 steps (12 resets) in 235 ms. (254 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, +inf, 1, 1, 1, +inf]
[2025-05-29 21:05:58] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
[2025-05-29 21:05:58] [INFO ] Invariant cache hit.
[2025-05-29 21:05:59] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2025-05-29 21:06:00] [INFO ] [Real]Absence check using state equation in 1215 ms returned sat
[2025-05-29 21:06:00] [INFO ] State equation strengthened by 303 read => feed constraints.
[2025-05-29 21:06:00] [INFO ] [Real]Added 303 Read/Feed constraints in 164 ms returned sat
[2025-05-29 21:06:00] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:06:00] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-29 21:06:01] [INFO ] [Nat]Absence check using state equation in 930 ms returned sat
[2025-05-29 21:06:02] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-29 21:06:02] [INFO ] [Nat]Added 303 Read/Feed constraints in 593 ms returned sat
[2025-05-29 21:06:03] [INFO ] Deduced a trap composed of 32 places in 760 ms of which 30 ms to minimize.
[2025-05-29 21:06:04] [INFO ] Deduced a trap composed of 12 places in 1066 ms of which 6 ms to minimize.
[2025-05-29 21:06:05] [INFO ] Deduced a trap composed of 27 places in 1004 ms of which 3 ms to minimize.
[2025-05-29 21:06:06] [INFO ] Deduced a trap composed of 67 places in 843 ms of which 5 ms to minimize.
[2025-05-29 21:06:06] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-29 21:06:06] [INFO ] [Real]Absence check using 10 positive place invariants in 72 ms returned sat
[2025-05-29 21:06:08] [INFO ] [Real]Absence check using state equation in 1101 ms returned sat
[2025-05-29 21:06:08] [INFO ] [Real]Added 303 Read/Feed constraints in 146 ms returned sat
[2025-05-29 21:06:08] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:06:08] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-05-29 21:06:09] [INFO ] [Nat]Absence check using state equation in 1049 ms returned sat
[2025-05-29 21:06:09] [INFO ] [Nat]Added 303 Read/Feed constraints in 339 ms returned sat
[2025-05-29 21:06:10] [INFO ] Deduced a trap composed of 56 places in 568 ms of which 4 ms to minimize.
[2025-05-29 21:06:11] [INFO ] Deduced a trap composed of 67 places in 688 ms of which 4 ms to minimize.
[2025-05-29 21:06:12] [INFO ] Deduced a trap composed of 56 places in 561 ms of which 3 ms to minimize.
[2025-05-29 21:06:12] [INFO ] Deduced a trap composed of 60 places in 558 ms of which 3 ms to minimize.
[2025-05-29 21:06:13] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3036 ms
[2025-05-29 21:06:13] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 665 ms.
[2025-05-29 21:06:13] [INFO ] Added : 0 causal constraints over 0 iterations in 675 ms. Result :unknown
[2025-05-29 21:06:13] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-05-29 21:06:14] [INFO ] [Real]Absence check using state equation in 963 ms returned sat
[2025-05-29 21:06:14] [INFO ] [Real]Added 303 Read/Feed constraints in 112 ms returned sat
[2025-05-29 21:06:14] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:06:15] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-05-29 21:06:16] [INFO ] [Nat]Absence check using state equation in 955 ms returned sat
[2025-05-29 21:06:16] [INFO ] [Nat]Added 303 Read/Feed constraints in 416 ms returned sat
[2025-05-29 21:06:17] [INFO ] Deduced a trap composed of 19 places in 797 ms of which 3 ms to minimize.
[2025-05-29 21:06:18] [INFO ] Deduced a trap composed of 11 places in 604 ms of which 4 ms to minimize.
[2025-05-29 21:06:18] [INFO ] Deduced a trap composed of 33 places in 470 ms of which 4 ms to minimize.
[2025-05-29 21:06:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2474 ms
[2025-05-29 21:06:19] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 831 ms.
[2025-05-29 21:06:20] [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.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-29 21:06:20] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-05-29 21:06:21] [INFO ] [Real]Absence check using state equation in 981 ms returned sat
[2025-05-29 21:06:21] [INFO ] [Real]Added 303 Read/Feed constraints in 155 ms returned sat
[2025-05-29 21:06:21] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:06:21] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-29 21:06:22] [INFO ] [Nat]Absence check using state equation in 986 ms returned sat
[2025-05-29 21:06:22] [INFO ] [Nat]Added 303 Read/Feed constraints in 208 ms returned sat
[2025-05-29 21:06:23] [INFO ] Deduced a trap composed of 34 places in 1116 ms of which 4 ms to minimize.
[2025-05-29 21:06:25] [INFO ] Deduced a trap composed of 14 places in 1171 ms of which 3 ms to minimize.
[2025-05-29 21:06:26] [INFO ] Deduced a trap composed of 20 places in 713 ms of which 3 ms to minimize.
[2025-05-29 21:06:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 3579 ms
[2025-05-29 21:06:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:954)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-29 21:06:26] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2025-05-29 21:06:27] [INFO ] [Real]Absence check using state equation in 1261 ms returned sat
[2025-05-29 21:06:28] [INFO ] [Real]Added 303 Read/Feed constraints in 180 ms returned sat
[2025-05-29 21:06:28] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:06:28] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-05-29 21:06:29] [INFO ] [Nat]Absence check using state equation in 1110 ms returned sat
[2025-05-29 21:06:29] [INFO ] [Nat]Added 303 Read/Feed constraints in 215 ms returned sat
[2025-05-29 21:06:30] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 371 ms.
[2025-05-29 21:06:30] [INFO ] Added : 8 causal constraints over 2 iterations in 1092 ms. Result :sat
Minimization took 1491 ms.
[2025-05-29 21:06:32] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-05-29 21:06:33] [INFO ] [Real]Absence check using state equation in 1001 ms returned sat
[2025-05-29 21:06:33] [INFO ] [Real]Added 303 Read/Feed constraints in 112 ms returned sat
[2025-05-29 21:06:33] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:06:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-05-29 21:06:34] [INFO ] [Nat]Absence check using state equation in 1129 ms returned sat
[2025-05-29 21:06:35] [INFO ] [Nat]Added 303 Read/Feed constraints in 149 ms returned sat
[2025-05-29 21:06:35] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 490 ms.
[2025-05-29 21:06:37] [INFO ] Deduced a trap composed of 12 places in 172 ms of which 1 ms to minimize.
[2025-05-29 21:06:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 514 ms
[2025-05-29 21:06:37] [INFO ] Added : 9 causal constraints over 3 iterations in 2490 ms. Result :sat
Minimization took 1020 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, +inf, 1, 1, 1, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, +inf, 1, 1, 1, +inf]
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Graph (complete) has 4653 edges and 280 vertex of which 278 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.18 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 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 277 transition count 3871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 16 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 275 transition count 3877
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 275 transition count 3871
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 269 transition count 3871
Applied a total of 19 rules in 480 ms. Remains 269 /280 variables (removed 11) and now considering 3871/3904 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 498 ms. Remains : 269/280 places, 3871/3904 transitions.
[2025-05-29 21:06:39] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
Found an invariant !
This invariant on transitions {2=1, 44=1, 3014=1, 3635=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {2=1, 3014=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 376 ms. (steps per millisecond=26 ) 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:[1, +inf, 1, 1, 1, +inf]
[2025-05-29 21:06:41] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2025-05-29 21:06:41] [INFO ] Computed 8 invariants in 39 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, +inf, 1, 1, 1, +inf]
RANDOM walk for 1000027 steps (2 resets) in 1220 ms. (819 steps per ms)
BEST_FIRST walk for 6000006 steps (12 resets) in 14895 ms. (402 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, +inf, 1, 1, 1, +inf]
[2025-05-29 21:06:57] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2025-05-29 21:06:57] [INFO ] Invariant cache hit.
[2025-05-29 21:06:57] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-29 21:06:58] [INFO ] [Real]Absence check using state equation in 955 ms returned sat
[2025-05-29 21:06:58] [INFO ] State equation strengthened by 283 read => feed constraints.
[2025-05-29 21:06:58] [INFO ] [Real]Added 283 Read/Feed constraints in 87 ms returned sat
[2025-05-29 21:06:59] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:06:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-29 21:07:00] [INFO ] [Nat]Absence check using state equation in 1031 ms returned sat
[2025-05-29 21:07:00] [INFO ] [Nat]Added 283 Read/Feed constraints in 309 ms returned sat
[2025-05-29 21:07:01] [INFO ] Deduced a trap composed of 118 places in 1185 ms of which 4 ms to minimize.
[2025-05-29 21:07:03] [INFO ] Deduced a trap composed of 55 places in 1167 ms of which 3 ms to minimize.
[2025-05-29 21:07:04] [INFO ] Deduced a trap composed of 28 places in 700 ms of which 3 ms to minimize.
[2025-05-29 21:07:04] [INFO ] Deduced a trap composed of 44 places in 623 ms of which 3 ms to minimize.
[2025-05-29 21:07:05] [INFO ] Deduced a trap composed of 18 places in 788 ms of which 2 ms to minimize.
[2025-05-29 21:07:06] [INFO ] Deduced a trap composed of 22 places in 750 ms of which 3 ms to minimize.
[2025-05-29 21:07:07] [INFO ] Deduced a trap composed of 28 places in 473 ms of which 3 ms to minimize.
[2025-05-29 21:07:07] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 6935 ms
[2025-05-29 21:07:07] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 371 ms.
[2025-05-29 21:07:08] [INFO ] Added : 3 causal constraints over 1 iterations in 885 ms. Result :sat
Minimization took 4503 ms.
[2025-05-29 21:07:12] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-29 21:07:13] [INFO ] [Real]Absence check using state equation in 824 ms returned sat
[2025-05-29 21:07:13] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:07:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-29 21:07:14] [INFO ] [Nat]Absence check using state equation in 846 ms returned sat
[2025-05-29 21:07:15] [INFO ] [Nat]Added 283 Read/Feed constraints in 737 ms returned sat
[2025-05-29 21:07:15] [INFO ] Deduced a trap composed of 35 places in 440 ms of which 3 ms to minimize.
[2025-05-29 21:07:16] [INFO ] Deduced a trap composed of 23 places in 320 ms of which 1 ms to minimize.
[2025-05-29 21:07:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1024 ms
[2025-05-29 21:07:16] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 308 ms.
[2025-05-29 21:07:17] [INFO ] Added : 10 causal constraints over 5 iterations in 1370 ms. Result :sat
Minimization took 4509 ms.
[2025-05-29 21:07:22] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-29 21:07:23] [INFO ] [Real]Absence check using state equation in 796 ms returned sat
[2025-05-29 21:07:23] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:07:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-29 21:07:24] [INFO ] [Nat]Absence check using state equation in 802 ms returned sat
[2025-05-29 21:07:24] [INFO ] [Nat]Added 283 Read/Feed constraints in 704 ms returned sat
[2025-05-29 21:07:25] [INFO ] Deduced a trap composed of 23 places in 435 ms of which 2 ms to minimize.
[2025-05-29 21:07:25] [INFO ] Deduced a trap composed of 10 places in 154 ms of which 1 ms to minimize.
[2025-05-29 21:07:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 907 ms
[2025-05-29 21:07:26] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 388 ms.
[2025-05-29 21:07:26] [INFO ] Added : 7 causal constraints over 2 iterations in 1057 ms. Result :sat
Minimization took 4503 ms.
[2025-05-29 21:07:31] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-29 21:07:32] [INFO ] [Real]Absence check using state equation in 1074 ms returned sat
[2025-05-29 21:07:32] [INFO ] [Real]Added 283 Read/Feed constraints in 98 ms returned sat
[2025-05-29 21:07:32] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:07:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2025-05-29 21:07:34] [INFO ] [Nat]Absence check using state equation in 1137 ms returned sat
[2025-05-29 21:07:34] [INFO ] [Nat]Added 283 Read/Feed constraints in 346 ms returned sat
[2025-05-29 21:07:35] [INFO ] Deduced a trap composed of 55 places in 1229 ms of which 5 ms to minimize.
[2025-05-29 21:07:37] [INFO ] Deduced a trap composed of 26 places in 1266 ms of which 4 ms to minimize.
[2025-05-29 21:07:38] [INFO ] Deduced a trap composed of 31 places in 1187 ms of which 4 ms to minimize.
[2025-05-29 21:07:39] [INFO ] Deduced a trap composed of 43 places in 806 ms of which 3 ms to minimize.
[2025-05-29 21:07:40] [INFO ] Deduced a trap composed of 62 places in 827 ms of which 3 ms to minimize.
[2025-05-29 21:07:41] [INFO ] Deduced a trap composed of 14 places in 790 ms of which 3 ms to minimize.
[2025-05-29 21:07:42] [INFO ] Deduced a trap composed of 43 places in 742 ms of which 2 ms to minimize.
[2025-05-29 21:07:42] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 8566 ms
[2025-05-29 21:07:43] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 490 ms.
[2025-05-29 21:07:44] [INFO ] Added : 8 causal constraints over 2 iterations in 1339 ms. Result :sat
Minimization took 4554 ms.
[2025-05-29 21:07:48] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-29 21:07:49] [INFO ] [Real]Absence check using state equation in 942 ms returned sat
[2025-05-29 21:07:50] [INFO ] [Real]Added 283 Read/Feed constraints in 130 ms returned sat
[2025-05-29 21:07:50] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:07:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-29 21:07:51] [INFO ] [Nat]Absence check using state equation in 1079 ms returned sat
[2025-05-29 21:07:51] [INFO ] [Nat]Added 283 Read/Feed constraints in 239 ms returned sat
[2025-05-29 21:07:52] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 503 ms.
[2025-05-29 21:07:54] [INFO ] Deduced a trap composed of 53 places in 984 ms of which 4 ms to minimize.
[2025-05-29 21:07:55] [INFO ] Deduced a trap composed of 84 places in 1010 ms of which 5 ms to minimize.
[2025-05-29 21:07:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2614 ms
[2025-05-29 21:07:56] [INFO ] Added : 11 causal constraints over 4 iterations in 4981 ms. Result :sat
Minimization took 4501 ms.
[2025-05-29 21:08:01] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-29 21:08:02] [INFO ] [Real]Absence check using state equation in 1068 ms returned sat
[2025-05-29 21:08:02] [INFO ] [Real]Added 283 Read/Feed constraints in 104 ms returned sat
[2025-05-29 21:08:02] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:08:02] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-29 21:08:03] [INFO ] [Nat]Absence check using state equation in 1073 ms returned sat
[2025-05-29 21:08:04] [INFO ] [Nat]Added 283 Read/Feed constraints in 236 ms returned sat
[2025-05-29 21:08:04] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 438 ms.
[2025-05-29 21:08:05] [INFO ] Added : 1 causal constraints over 1 iterations in 959 ms. Result :sat
Minimization took 4571 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, +inf, 1, 1, 1, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, +inf, 1, 1, 1, +inf]
Support contains 6 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 84 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 76 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2025-05-29 21:08:09] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2025-05-29 21:08:09] [INFO ] Invariant cache hit.
[2025-05-29 21:08:10] [INFO ] Implicit Places using invariants in 883 ms returned []
[2025-05-29 21:08:10] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2025-05-29 21:08:10] [INFO ] Invariant cache hit.
[2025-05-29 21:08:12] [INFO ] State equation strengthened by 283 read => feed constraints.
[2025-05-29 21:08:14] [INFO ] Implicit Places using invariants and state equation in 3709 ms returned []
Implicit Place search using SMT with State Equation took 4596 ms to find 0 implicit places.
[2025-05-29 21:08:15] [INFO ] Redundant transitions in 865 ms returned []
Running 3870 sub problems to find dead transitions.
[2025-05-29 21:08:15] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2025-05-29 21:08:15] [INFO ] Invariant cache hit.
[2025-05-29 21:08:15] [INFO ] State equation strengthened by 283 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3870 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 269/3968 variables, and 8 constraints, problems are : Problem set: 0 solved, 3870 unsolved in 30169 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/269 constraints, ReadFeed: 0/283 constraints, PredecessorRefiner: 3870/2667 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3870 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3870 unsolved
[2025-05-29 21:10:02] [INFO ] Deduced a trap composed of 6 places in 178 ms of which 2 ms to minimize.
[2025-05-29 21:10:02] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 1 ms to minimize.
Problem TDEAD1546 is UNSAT
Problem TDEAD1547 is UNSAT
Problem TDEAD1548 is UNSAT
Problem TDEAD1549 is UNSAT
Problem TDEAD1550 is UNSAT
Problem TDEAD1551 is UNSAT
Problem TDEAD1552 is UNSAT
Problem TDEAD1553 is UNSAT
Problem TDEAD1554 is UNSAT
Problem TDEAD1557 is UNSAT
Problem TDEAD1558 is UNSAT
Problem TDEAD1559 is UNSAT
Problem TDEAD1560 is UNSAT
Problem TDEAD1561 is UNSAT
Problem TDEAD1562 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 TDEAD1577 is UNSAT
Problem TDEAD1578 is UNSAT
Problem TDEAD1579 is UNSAT
Problem TDEAD1580 is UNSAT
Problem TDEAD1581 is UNSAT
Problem TDEAD1582 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 TDEAD1597 is UNSAT
Problem TDEAD1598 is UNSAT
Problem TDEAD1599 is UNSAT
Problem TDEAD1600 is UNSAT
Problem TDEAD1601 is UNSAT
Problem TDEAD1602 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 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 TDEAD1646 is UNSAT
Problem TDEAD1647 is UNSAT
Problem TDEAD1648 is UNSAT
Problem TDEAD1649 is UNSAT
Problem TDEAD1650 is UNSAT
Problem TDEAD1651 is UNSAT
Problem TDEAD1652 is UNSAT
Problem TDEAD1653 is UNSAT
Problem TDEAD1654 is UNSAT
Problem TDEAD1655 is UNSAT
Problem TDEAD1656 is UNSAT
Problem TDEAD1657 is UNSAT
Problem TDEAD1658 is UNSAT
Problem TDEAD1659 is UNSAT
Problem TDEAD1660 is UNSAT
Problem TDEAD1661 is UNSAT
Problem TDEAD1662 is UNSAT
Problem TDEAD1663 is UNSAT
Problem TDEAD1664 is UNSAT
Problem TDEAD1665 is UNSAT
Problem TDEAD1666 is UNSAT
Problem TDEAD1667 is UNSAT
Problem TDEAD1668 is UNSAT
Problem TDEAD1669 is UNSAT
Problem TDEAD1670 is UNSAT
Problem TDEAD1671 is UNSAT
Problem TDEAD1672 is UNSAT
Problem TDEAD1673 is UNSAT
Problem TDEAD1674 is UNSAT
Problem TDEAD1675 is UNSAT
Problem TDEAD1676 is UNSAT
Problem TDEAD1677 is UNSAT
Problem TDEAD1678 is UNSAT
Problem TDEAD1679 is UNSAT
Problem TDEAD1680 is UNSAT
Problem TDEAD1681 is UNSAT
Problem TDEAD1682 is UNSAT
Problem TDEAD1683 is UNSAT
Problem TDEAD1684 is UNSAT
Problem TDEAD1685 is UNSAT
Problem TDEAD1686 is UNSAT
Problem TDEAD1687 is UNSAT
Problem TDEAD1688 is UNSAT
Problem TDEAD1689 is UNSAT
Problem TDEAD1690 is UNSAT
Problem TDEAD1691 is UNSAT
Problem TDEAD1692 is UNSAT
Problem TDEAD1693 is UNSAT
Problem TDEAD1694 is UNSAT
Problem TDEAD1695 is UNSAT
Problem TDEAD1696 is UNSAT
Problem TDEAD1697 is UNSAT
Problem TDEAD1698 is UNSAT
Problem TDEAD1699 is UNSAT
Problem TDEAD1700 is UNSAT
Problem TDEAD1701 is UNSAT
Problem TDEAD1702 is UNSAT
Problem TDEAD1703 is UNSAT
Problem TDEAD1704 is UNSAT
Problem TDEAD1705 is UNSAT
Problem TDEAD1706 is UNSAT
Problem TDEAD1707 is UNSAT
Problem TDEAD1708 is UNSAT
Problem TDEAD1709 is UNSAT
Problem TDEAD1710 is UNSAT
Problem TDEAD1711 is UNSAT
Problem TDEAD1712 is UNSAT
Problem TDEAD1713 is UNSAT
Problem TDEAD1714 is UNSAT
Problem TDEAD1715 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 TDEAD1803 is UNSAT
Problem TDEAD1804 is UNSAT
Problem TDEAD1805 is UNSAT
Problem TDEAD1806 is UNSAT
Problem TDEAD1807 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
Problem TDEAD1824 is UNSAT
Problem TDEAD1825 is UNSAT
Problem TDEAD1826 is UNSAT
Problem TDEAD1827 is UNSAT
Problem TDEAD1828 is UNSAT
Problem TDEAD1829 is UNSAT
Problem TDEAD1830 is UNSAT
Problem TDEAD1831 is UNSAT
Problem TDEAD1832 is UNSAT
Problem TDEAD1833 is UNSAT
Problem TDEAD1834 is UNSAT
Problem TDEAD1835 is UNSAT
Problem TDEAD1836 is UNSAT
Problem TDEAD1837 is UNSAT
Problem TDEAD1838 is UNSAT
Problem TDEAD1839 is UNSAT
Problem TDEAD1840 is UNSAT
Problem TDEAD1841 is UNSAT
Problem TDEAD1842 is UNSAT
Problem TDEAD1843 is UNSAT
Problem TDEAD1844 is UNSAT
Problem TDEAD1845 is UNSAT
Problem TDEAD1846 is UNSAT
Problem TDEAD1847 is UNSAT
Problem TDEAD1848 is UNSAT
Problem TDEAD1849 is UNSAT
Problem TDEAD1850 is UNSAT
Problem TDEAD1851 is UNSAT
Problem TDEAD1852 is UNSAT
Problem TDEAD1853 is UNSAT
Problem TDEAD1854 is UNSAT
Problem TDEAD1855 is UNSAT
Problem TDEAD1856 is UNSAT
Problem TDEAD1857 is UNSAT
Problem TDEAD1858 is UNSAT
Problem TDEAD1859 is UNSAT
Problem TDEAD1860 is UNSAT
Problem TDEAD1861 is UNSAT
Problem TDEAD1862 is UNSAT
Problem TDEAD1863 is UNSAT
Problem TDEAD1864 is UNSAT
Problem TDEAD1865 is UNSAT
Problem TDEAD1866 is UNSAT
Problem TDEAD1867 is UNSAT
Problem TDEAD1868 is UNSAT
Problem TDEAD1869 is UNSAT
Problem TDEAD1870 is UNSAT
Problem TDEAD1871 is UNSAT
Problem TDEAD1872 is UNSAT
Problem TDEAD1873 is UNSAT
Problem TDEAD1874 is UNSAT
Problem TDEAD1875 is UNSAT
Problem TDEAD1876 is UNSAT
Problem TDEAD1877 is UNSAT
Problem TDEAD1878 is UNSAT
Problem TDEAD1879 is UNSAT
Problem TDEAD1880 is UNSAT
Problem TDEAD1881 is UNSAT
Problem TDEAD1882 is UNSAT
Problem TDEAD1883 is UNSAT
Problem TDEAD1884 is UNSAT
Problem TDEAD1885 is UNSAT
Problem TDEAD1886 is UNSAT
Problem TDEAD1887 is UNSAT
Problem TDEAD1888 is UNSAT
Problem TDEAD1889 is UNSAT
Problem TDEAD1890 is UNSAT
Problem TDEAD1891 is UNSAT
Problem TDEAD1892 is UNSAT
Problem TDEAD1893 is UNSAT
Problem TDEAD1894 is UNSAT
Problem TDEAD1895 is UNSAT
Problem TDEAD1896 is UNSAT
Problem TDEAD1897 is UNSAT
Problem TDEAD1898 is UNSAT
Problem TDEAD1899 is UNSAT
Problem TDEAD1900 is UNSAT
Problem TDEAD1901 is UNSAT
Problem TDEAD1902 is UNSAT
Problem TDEAD1903 is UNSAT
Problem TDEAD1904 is UNSAT
Problem TDEAD1905 is UNSAT
Problem TDEAD1906 is UNSAT
Problem TDEAD1907 is UNSAT
Problem TDEAD1908 is UNSAT
Problem TDEAD1909 is UNSAT
Problem TDEAD1910 is UNSAT
Problem TDEAD1911 is UNSAT
Problem TDEAD1912 is UNSAT
Problem TDEAD1913 is UNSAT
Problem TDEAD1914 is UNSAT
Problem TDEAD1915 is UNSAT
Problem TDEAD1916 is UNSAT
Problem TDEAD1917 is UNSAT
Problem TDEAD1918 is UNSAT
Problem TDEAD1919 is UNSAT
Problem TDEAD1920 is UNSAT
Problem TDEAD1921 is UNSAT
Problem TDEAD1922 is UNSAT
Problem TDEAD1923 is UNSAT
Problem TDEAD1924 is UNSAT
Problem TDEAD1925 is UNSAT
Problem TDEAD1926 is UNSAT
Problem TDEAD1927 is UNSAT
Problem TDEAD1928 is UNSAT
Problem TDEAD1929 is UNSAT
Problem TDEAD1930 is UNSAT
Problem TDEAD1931 is UNSAT
Problem TDEAD1932 is UNSAT
Problem TDEAD1933 is UNSAT
Problem TDEAD1934 is UNSAT
Problem TDEAD1935 is UNSAT
Problem TDEAD1936 is UNSAT
Problem TDEAD1937 is UNSAT
Problem TDEAD1938 is UNSAT
Problem TDEAD1939 is UNSAT
Problem TDEAD1940 is UNSAT
Problem TDEAD1941 is UNSAT
Problem TDEAD1942 is UNSAT
Problem TDEAD1943 is UNSAT
Problem TDEAD1944 is UNSAT
Problem TDEAD1945 is UNSAT
Problem TDEAD1946 is UNSAT
Problem TDEAD1947 is UNSAT
Problem TDEAD1948 is UNSAT
Problem TDEAD1949 is UNSAT
Problem TDEAD1950 is UNSAT
Problem TDEAD1951 is UNSAT
Problem TDEAD1952 is UNSAT
Problem TDEAD1953 is UNSAT
Problem TDEAD1954 is UNSAT
Problem TDEAD1955 is UNSAT
Problem TDEAD1956 is UNSAT
Problem TDEAD1957 is UNSAT
Problem TDEAD1958 is UNSAT
Problem TDEAD1959 is UNSAT
Problem TDEAD1960 is UNSAT
Problem TDEAD1961 is UNSAT
Problem TDEAD1962 is UNSAT
Problem TDEAD2044 is UNSAT
Problem TDEAD2045 is UNSAT
Problem TDEAD2046 is UNSAT
Problem TDEAD2047 is UNSAT
Problem TDEAD2048 is UNSAT
Problem TDEAD2049 is UNSAT
Problem TDEAD2050 is UNSAT
Problem TDEAD2051 is UNSAT
[2025-05-29 21:10:05] [INFO ] Deduced a trap composed of 25 places in 210 ms of which 1 ms to minimize.
Problem TDEAD2052 is UNSAT
Problem TDEAD2053 is UNSAT
[2025-05-29 21:10:06] [INFO ] Deduced a trap composed of 8 places in 239 ms of which 1 ms to minimize.
Problem TDEAD2054 is UNSAT
Problem TDEAD2055 is UNSAT
Problem TDEAD2056 is UNSAT
Problem TDEAD2057 is UNSAT
Problem TDEAD2058 is UNSAT
Problem TDEAD2059 is UNSAT
Problem TDEAD2060 is UNSAT
Problem TDEAD2061 is UNSAT
Problem TDEAD2062 is UNSAT
Problem TDEAD2063 is UNSAT
Problem TDEAD2069 is UNSAT
Problem TDEAD2070 is UNSAT
Problem TDEAD2071 is UNSAT
Problem TDEAD2072 is UNSAT
Problem TDEAD2073 is UNSAT
Problem TDEAD2074 is UNSAT
Problem TDEAD2075 is UNSAT
Problem TDEAD2076 is UNSAT
Problem TDEAD2081 is UNSAT
Problem TDEAD2082 is UNSAT
Problem TDEAD2083 is UNSAT
Problem TDEAD2084 is UNSAT
Problem TDEAD2085 is UNSAT
Problem TDEAD2086 is UNSAT
Problem TDEAD2087 is UNSAT
Problem TDEAD2088 is UNSAT
[2025-05-29 21:10:06] [INFO ] Deduced a trap composed of 8 places in 369 ms of which 2 ms to minimize.
[2025-05-29 21:10:07] [INFO ] Deduced a trap composed of 17 places in 370 ms of which 2 ms to minimize.
Problem TDEAD2097 is UNSAT
Problem TDEAD2098 is UNSAT
Problem TDEAD2099 is UNSAT
Problem TDEAD2100 is UNSAT
Problem TDEAD2101 is UNSAT
Problem TDEAD2102 is UNSAT
Problem TDEAD2103 is UNSAT
Problem TDEAD2104 is UNSAT
Problem TDEAD2105 is UNSAT
Problem TDEAD2106 is UNSAT
Problem TDEAD2107 is UNSAT
Problem TDEAD2108 is UNSAT
Problem TDEAD2109 is UNSAT
Problem TDEAD2110 is UNSAT
Problem TDEAD2111 is UNSAT
Problem TDEAD2112 is UNSAT
Problem TDEAD2116 is UNSAT
Problem TDEAD2117 is UNSAT
Problem TDEAD2118 is UNSAT
Problem TDEAD2119 is UNSAT
Problem TDEAD2120 is UNSAT
Problem TDEAD2121 is UNSAT
Problem TDEAD2122 is UNSAT
Problem TDEAD2123 is UNSAT
Problem TDEAD2124 is UNSAT
Problem TDEAD2125 is UNSAT
Problem TDEAD2126 is UNSAT
Problem TDEAD2127 is UNSAT
Problem TDEAD2132 is UNSAT
Problem TDEAD2133 is UNSAT
Problem TDEAD2134 is UNSAT
Problem TDEAD2135 is UNSAT
Problem TDEAD2136 is UNSAT
Problem TDEAD2137 is UNSAT
Problem TDEAD2138 is UNSAT
Problem TDEAD2139 is UNSAT
Problem TDEAD2140 is UNSAT
Problem TDEAD2141 is UNSAT
Problem TDEAD2142 is UNSAT
Problem TDEAD2143 is UNSAT
Problem TDEAD2144 is UNSAT
Problem TDEAD2145 is UNSAT
Problem TDEAD2146 is UNSAT
Problem TDEAD2147 is UNSAT
Problem TDEAD2151 is UNSAT
Problem TDEAD2152 is UNSAT
Problem TDEAD2153 is UNSAT
Problem TDEAD2154 is UNSAT
Problem TDEAD2155 is UNSAT
Problem TDEAD2156 is UNSAT
Problem TDEAD2157 is UNSAT
Problem TDEAD2158 is UNSAT
Problem TDEAD2159 is UNSAT
Problem TDEAD2160 is UNSAT
Problem TDEAD2161 is UNSAT
Problem TDEAD2162 is UNSAT
Problem TDEAD2167 is UNSAT
Problem TDEAD2168 is UNSAT
Problem TDEAD2169 is UNSAT
Problem TDEAD2170 is UNSAT
Problem TDEAD2171 is UNSAT
Problem TDEAD2172 is UNSAT
Problem TDEAD2173 is UNSAT
Problem TDEAD2174 is UNSAT
Problem TDEAD2175 is UNSAT
Problem TDEAD2176 is UNSAT
Problem TDEAD2177 is UNSAT
Problem TDEAD2178 is UNSAT
Problem TDEAD2179 is UNSAT
Problem TDEAD2180 is UNSAT
Problem TDEAD2181 is UNSAT
Problem TDEAD2182 is UNSAT
Problem TDEAD2186 is UNSAT
Problem TDEAD2187 is UNSAT
Problem TDEAD2188 is UNSAT
Problem TDEAD2189 is UNSAT
Problem TDEAD2190 is UNSAT
Problem TDEAD2191 is UNSAT
Problem TDEAD2192 is UNSAT
Problem TDEAD2193 is UNSAT
Problem TDEAD2194 is UNSAT
Problem TDEAD2195 is UNSAT
Problem TDEAD2196 is UNSAT
Problem TDEAD2197 is UNSAT
Problem TDEAD2202 is UNSAT
Problem TDEAD2203 is UNSAT
Problem TDEAD2204 is UNSAT
Problem TDEAD2205 is UNSAT
Problem TDEAD2206 is UNSAT
Problem TDEAD2207 is UNSAT
Problem TDEAD2208 is UNSAT
Problem TDEAD2209 is UNSAT
Problem TDEAD2210 is UNSAT
Problem TDEAD2211 is UNSAT
Problem TDEAD2212 is UNSAT
Problem TDEAD2213 is UNSAT
Problem TDEAD2214 is UNSAT
Problem TDEAD2215 is UNSAT
Problem TDEAD2216 is UNSAT
Problem TDEAD2217 is UNSAT
Problem TDEAD2221 is UNSAT
Problem TDEAD2222 is UNSAT
Problem TDEAD2223 is UNSAT
Problem TDEAD2224 is UNSAT
Problem TDEAD2225 is UNSAT
Problem TDEAD2226 is UNSAT
Problem TDEAD2227 is UNSAT
Problem TDEAD2228 is UNSAT
Problem TDEAD2229 is UNSAT
Problem TDEAD2230 is UNSAT
Problem TDEAD2231 is UNSAT
Problem TDEAD2232 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 269/3968 variables, and 14 constraints, problems are : Problem set: 468 solved, 3402 unsolved in 30109 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/269 constraints, ReadFeed: 0/283 constraints, PredecessorRefiner: 1203/2667 constraints, Known Traps: 6/6 constraints]
After SMT, in 112645ms problems are : Problem set: 468 solved, 3402 unsolved
Search for dead transitions found 468 dead transitions in 112728ms
Found 468 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 468 transitions
Dead transitions reduction (with SMT) removed 468 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 269/269 places, 3403/3871 transitions.
Reduce places removed 13 places and 425 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 256 transition count 2978
Reduce places removed 8 places and 233 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 21 place count 248 transition count 2745
Reduce places removed 10 places and 290 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 31 place count 238 transition count 2455
Reduce places removed 6 places and 167 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 37 place count 232 transition count 2288
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 50 place count 219 transition count 2262
Deduced a syphon composed of 2 places in 34 ms
Iterating global reduction 4 with 13 rules applied. Total rules applied 63 place count 219 transition count 2262
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 76 place count 206 transition count 2145
Deduced a syphon composed of 2 places in 4 ms
Iterating global reduction 4 with 13 rules applied. Total rules applied 89 place count 206 transition count 2145
Deduced a syphon composed of 2 places in 3 ms
Applied a total of 89 rules in 240 ms. Remains 206 /269 variables (removed 63) and now considering 2145/3403 (removed 1258) transitions.
[2025-05-29 21:10:08] [INFO ] Flow matrix only has 1994 transitions (discarded 151 similar events)
// Phase 1: matrix 1994 rows 206 cols
[2025-05-29 21:10:08] [INFO ] Computed 10 invariants in 20 ms
[2025-05-29 21:10:09] [INFO ] Implicit Places using invariants in 638 ms returned []
[2025-05-29 21:10:09] [INFO ] Flow matrix only has 1994 transitions (discarded 151 similar events)
[2025-05-29 21:10:09] [INFO ] Invariant cache hit.
[2025-05-29 21:10:09] [INFO ] State equation strengthened by 181 read => feed constraints.
[2025-05-29 21:10:10] [INFO ] Implicit Places using invariants and state equation in 1727 ms returned []
Implicit Place search using SMT with State Equation took 2368 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 206/269 places, 2145/3871 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 120933 ms. Remains : 206/269 places, 2145/3871 transitions.
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
FORMULA BugTracking-PT-q8m064-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-29 21:10:10] [INFO ] Flow matrix only has 1994 transitions (discarded 151 similar events)
Found an invariant !
This invariant on transitions {0=1, 1540=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {2=1, 1540=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 264 ms. (steps per millisecond=37 ) properties (out of 4) seen :[0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, +inf, 1, 1, 1, +inf]
[2025-05-29 21:10:12] [INFO ] Flow matrix only has 1994 transitions (discarded 151 similar events)
// Phase 1: matrix 1994 rows 204 cols
[2025-05-29 21:10:12] [INFO ] Computed 8 invariants in 18 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, +inf]
RANDOM walk for 1000057 steps (2 resets) in 1403 ms. (712 steps per ms)
BEST_FIRST walk for 4000004 steps (8 resets) in 8166 ms. (489 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, +inf]
[2025-05-29 21:10:21] [INFO ] Flow matrix only has 1994 transitions (discarded 151 similar events)
[2025-05-29 21:10:21] [INFO ] Invariant cache hit.
[2025-05-29 21:10:21] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-29 21:10:22] [INFO ] [Real]Absence check using state equation in 634 ms returned sat
[2025-05-29 21:10:22] [INFO ] State equation strengthened by 181 read => feed constraints.
[2025-05-29 21:10:22] [INFO ] [Real]Added 181 Read/Feed constraints in 83 ms returned sat
[2025-05-29 21:10:22] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:10:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-29 21:10:23] [INFO ] [Nat]Absence check using state equation in 739 ms returned sat
[2025-05-29 21:10:23] [INFO ] [Nat]Added 181 Read/Feed constraints in 269 ms returned sat
[2025-05-29 21:10:24] [INFO ] Computed and/alt/rep : 449/1676/449 causal constraints (skipped 1544 transitions) in 235 ms.
[2025-05-29 21:10:25] [INFO ] Deduced a trap composed of 41 places in 340 ms of which 2 ms to minimize.
[2025-05-29 21:10:25] [INFO ] Deduced a trap composed of 22 places in 253 ms of which 1 ms to minimize.
[2025-05-29 21:10:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 931 ms
[2025-05-29 21:10:25] [INFO ] Added : 11 causal constraints over 3 iterations in 1922 ms. Result :sat
Minimization took 1584 ms.
[2025-05-29 21:10:27] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-29 21:10:28] [INFO ] [Real]Absence check using state equation in 625 ms returned sat
[2025-05-29 21:10:28] [INFO ] [Real]Added 181 Read/Feed constraints in 74 ms returned sat
[2025-05-29 21:10:28] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:10:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-29 21:10:29] [INFO ] [Nat]Absence check using state equation in 716 ms returned sat
[2025-05-29 21:10:29] [INFO ] [Nat]Added 181 Read/Feed constraints in 177 ms returned sat
[2025-05-29 21:10:30] [INFO ] Deduced a trap composed of 34 places in 704 ms of which 4 ms to minimize.
[2025-05-29 21:10:30] [INFO ] Deduced a trap composed of 36 places in 678 ms of which 3 ms to minimize.
[2025-05-29 21:10:31] [INFO ] Deduced a trap composed of 25 places in 711 ms of which 3 ms to minimize.
[2025-05-29 21:10:32] [INFO ] Deduced a trap composed of 40 places in 629 ms of which 3 ms to minimize.
[2025-05-29 21:10:33] [INFO ] Deduced a trap composed of 38 places in 668 ms of which 3 ms to minimize.
[2025-05-29 21:10:33] [INFO ] Deduced a trap composed of 25 places in 699 ms of which 3 ms to minimize.
[2025-05-29 21:10:34] [INFO ] Deduced a trap composed of 27 places in 355 ms of which 2 ms to minimize.
[2025-05-29 21:10:34] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
[2025-05-29 21:10:34] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 5265 ms
[2025-05-29 21:10:34] [INFO ] Computed and/alt/rep : 449/1676/449 causal constraints (skipped 1544 transitions) in 277 ms.
[2025-05-29 21:10:35] [INFO ] Deduced a trap composed of 44 places in 330 ms of which 2 ms to minimize.
[2025-05-29 21:10:36] [INFO ] Deduced a trap composed of 24 places in 389 ms of which 2 ms to minimize.
[2025-05-29 21:10:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1087 ms
[2025-05-29 21:10:36] [INFO ] Added : 10 causal constraints over 3 iterations in 2129 ms. Result :sat
Minimization took 1572 ms.
[2025-05-29 21:10:38] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-29 21:10:39] [INFO ] [Real]Absence check using state equation in 651 ms returned sat
[2025-05-29 21:10:39] [INFO ] [Real]Added 181 Read/Feed constraints in 47 ms returned sat
[2025-05-29 21:10:39] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:10:39] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-29 21:10:39] [INFO ] [Nat]Absence check using state equation in 597 ms returned sat
[2025-05-29 21:10:40] [INFO ] [Nat]Added 181 Read/Feed constraints in 194 ms returned sat
[2025-05-29 21:10:40] [INFO ] Deduced a trap composed of 62 places in 634 ms of which 4 ms to minimize.
[2025-05-29 21:10:41] [INFO ] Deduced a trap composed of 9 places in 588 ms of which 3 ms to minimize.
[2025-05-29 21:10:42] [INFO ] Deduced a trap composed of 29 places in 654 ms of which 3 ms to minimize.
[2025-05-29 21:10:43] [INFO ] Deduced a trap composed of 59 places in 669 ms of which 7 ms to minimize.
[2025-05-29 21:10:43] [INFO ] Deduced a trap composed of 8 places in 289 ms of which 2 ms to minimize.
[2025-05-29 21:10:43] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3345 ms
[2025-05-29 21:10:43] [INFO ] Computed and/alt/rep : 449/1676/449 causal constraints (skipped 1544 transitions) in 283 ms.
[2025-05-29 21:10:44] [INFO ] Added : 15 causal constraints over 3 iterations in 919 ms. Result :sat
Minimization took 1605 ms.
[2025-05-29 21:10:46] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-29 21:10:46] [INFO ] [Real]Absence check using state equation in 636 ms returned sat
[2025-05-29 21:10:47] [INFO ] [Real]Added 181 Read/Feed constraints in 76 ms returned sat
[2025-05-29 21:10:47] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:10:47] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2025-05-29 21:10:47] [INFO ] [Nat]Absence check using state equation in 695 ms returned sat
[2025-05-29 21:10:48] [INFO ] [Nat]Added 181 Read/Feed constraints in 84 ms returned sat
[2025-05-29 21:10:48] [INFO ] Computed and/alt/rep : 449/1676/449 causal constraints (skipped 1544 transitions) in 275 ms.
[2025-05-29 21:10:48] [INFO ] Added : 1 causal constraints over 1 iterations in 613 ms. Result :sat
Minimization took 1603 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, +inf]
Support contains 4 out of 204 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 204/204 places, 2145/2145 transitions.
Applied a total of 0 rules in 64 ms. Remains 204 /204 variables (removed 0) and now considering 2145/2145 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 204/204 places, 2145/2145 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 204/204 places, 2145/2145 transitions.
Applied a total of 0 rules in 65 ms. Remains 204 /204 variables (removed 0) and now considering 2145/2145 (removed 0) transitions.
[2025-05-29 21:10:51] [INFO ] Flow matrix only has 1994 transitions (discarded 151 similar events)
[2025-05-29 21:10:51] [INFO ] Invariant cache hit.
[2025-05-29 21:10:51] [INFO ] Implicit Places using invariants in 510 ms returned []
[2025-05-29 21:10:51] [INFO ] Flow matrix only has 1994 transitions (discarded 151 similar events)
[2025-05-29 21:10:51] [INFO ] Invariant cache hit.
[2025-05-29 21:10:52] [INFO ] State equation strengthened by 181 read => feed constraints.
[2025-05-29 21:10:53] [INFO ] Implicit Places using invariants and state equation in 1928 ms returned []
Implicit Place search using SMT with State Equation took 2454 ms to find 0 implicit places.
[2025-05-29 21:10:53] [INFO ] Redundant transitions in 265 ms returned []
Running 2144 sub problems to find dead transitions.
[2025-05-29 21:10:53] [INFO ] Flow matrix only has 1994 transitions (discarded 151 similar events)
[2025-05-29 21:10:53] [INFO ] Invariant cache hit.
[2025-05-29 21:10:53] [INFO ] State equation strengthened by 181 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2144 unsolved
[2025-05-29 21:11:41] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 1 ms to minimize.
[2025-05-29 21:11:41] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 0 ms to minimize.
Problem TDEAD1019 is UNSAT
Problem TDEAD1020 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1022 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 204/2198 variables, and 10 constraints, problems are : Problem set: 4 solved, 2140 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/204 constraints, ReadFeed: 0/181 constraints, PredecessorRefiner: 2144/2144 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 4 solved, 2140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 8/8 constraints. Problems are: Problem set: 4 solved, 2140 unsolved
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 2/10 constraints. Problems are: Problem set: 12 solved, 2132 unsolved
[2025-05-29 21:11:58] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 2 ms to minimize.
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 TDEAD1162 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1165 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1176 is UNSAT
Problem TDEAD1177 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1182 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1184 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1218 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1227 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1229 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1232 is UNSAT
Problem TDEAD1233 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
[2025-05-29 21:12:00] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 1 ms to minimize.
Problem TDEAD1485 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1487 is UNSAT
Problem TDEAD1488 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1490 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1493 is UNSAT
Problem TDEAD1494 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1497 is UNSAT
Problem TDEAD1498 is UNSAT
Problem TDEAD1499 is UNSAT
Problem TDEAD1500 is UNSAT
Problem TDEAD1501 is UNSAT
Problem TDEAD1502 is UNSAT
Problem TDEAD1503 is UNSAT
Problem TDEAD1504 is UNSAT
Problem TDEAD1505 is UNSAT
Problem TDEAD1506 is UNSAT
Problem TDEAD1507 is UNSAT
Problem TDEAD1508 is UNSAT
Problem TDEAD1509 is UNSAT
Problem TDEAD1510 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1513 is UNSAT
Problem TDEAD1514 is UNSAT
Problem TDEAD1515 is UNSAT
Problem TDEAD1516 is UNSAT
Problem TDEAD1517 is UNSAT
Problem TDEAD1518 is UNSAT
Problem TDEAD1519 is UNSAT
Problem TDEAD1520 is UNSAT
Problem TDEAD1521 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1523 is UNSAT
Problem TDEAD1524 is UNSAT
Problem TDEAD1525 is UNSAT
Problem TDEAD1526 is UNSAT
Problem TDEAD1527 is UNSAT
Problem TDEAD1528 is UNSAT
Problem TDEAD1529 is UNSAT
Problem TDEAD1530 is UNSAT
Problem TDEAD1531 is UNSAT
Problem TDEAD1532 is UNSAT
Problem TDEAD1533 is UNSAT
Problem TDEAD1534 is UNSAT
Problem TDEAD1535 is UNSAT
Problem TDEAD1536 is UNSAT
Problem TDEAD1537 is UNSAT
Problem TDEAD1538 is UNSAT
Problem TDEAD1539 is UNSAT
Problem TDEAD1540 is UNSAT
Problem TDEAD1541 is UNSAT
Problem TDEAD1542 is UNSAT
Problem TDEAD1543 is UNSAT
Problem TDEAD1544 is UNSAT
Problem TDEAD1545 is UNSAT
Problem TDEAD1546 is UNSAT
Problem TDEAD1547 is UNSAT
Problem TDEAD1552 is UNSAT
Problem TDEAD1553 is UNSAT
Problem TDEAD1554 is UNSAT
Problem TDEAD1560 is UNSAT
Problem TDEAD1561 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 TDEAD1576 is UNSAT
Problem TDEAD1577 is UNSAT
Problem TDEAD1578 is UNSAT
Problem TDEAD1580 is UNSAT
Problem TDEAD1581 is UNSAT
Problem TDEAD1582 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
[2025-05-29 21:12:01] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 1 ms to minimize.
Problem TDEAD1599 is UNSAT
Problem TDEAD1604 is UNSAT
Problem TDEAD1605 is UNSAT
Problem TDEAD1606 is UNSAT
Problem TDEAD1608 is UNSAT
Problem TDEAD1609 is UNSAT
Problem TDEAD1610 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 TDEAD1632 is UNSAT
Problem TDEAD1633 is UNSAT
Problem TDEAD1634 is UNSAT
Problem TDEAD1636 is UNSAT
Problem TDEAD1637 is UNSAT
Problem TDEAD1638 is UNSAT
Problem TDEAD1644 is UNSAT
Problem TDEAD1645 is UNSAT
Problem TDEAD1646 is UNSAT
Problem TDEAD1647 is UNSAT
Problem TDEAD1648 is UNSAT
Problem TDEAD1649 is UNSAT
Problem TDEAD1650 is UNSAT
Problem TDEAD1651 is UNSAT
[2025-05-29 21:12:05] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
Problem TDEAD2125 is UNSAT
Problem TDEAD2126 is UNSAT
[2025-05-29 21:12:05] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
Problem TDEAD2129 is UNSAT
Problem TDEAD2130 is UNSAT
Problem TDEAD2137 is UNSAT
Problem TDEAD2138 is UNSAT
Problem TDEAD2141 is UNSAT
Problem TDEAD2142 is UNSAT
Problem TDEAD1555 is UNSAT
Problem TDEAD1556 is UNSAT
Problem TDEAD1557 is UNSAT
Problem TDEAD1558 is UNSAT
Problem TDEAD1559 is UNSAT
Problem TDEAD1571 is UNSAT
Problem TDEAD1583 is UNSAT
Problem TDEAD1584 is UNSAT
Problem TDEAD1585 is UNSAT
Problem TDEAD1586 is UNSAT
Problem TDEAD1587 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 5/15 constraints. Problems are: Problem set: 316 solved, 1828 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 204/2198 variables, and 15 constraints, problems are : Problem set: 316 solved, 1828 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/204 constraints, ReadFeed: 0/181 constraints, PredecessorRefiner: 0/2144 constraints, Known Traps: 7/7 constraints]
After SMT, in 80042ms problems are : Problem set: 316 solved, 1828 unsolved
Search for dead transitions found 316 dead transitions in 80101ms
Found 316 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 316 transitions
Dead transitions reduction (with SMT) removed 316 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 204/204 places, 1829/2145 transitions.
Graph (complete) has 2318 edges and 204 vertex of which 193 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Discarding 11 places :
Also discarding 0 output transitions
Reduce places removed 16 places and 431 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 177 transition count 1398
Reduce places removed 14 places and 223 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 31 place count 163 transition count 1175
Reduce places removed 8 places and 109 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 39 place count 155 transition count 1066
Reduce places removed 4 places and 29 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 43 place count 151 transition count 1037
Reduce places removed 2 places and 46 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 45 place count 149 transition count 991
Reduce places removed 1 places and 16 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 46 place count 148 transition count 975
Reduce places removed 1 places and 9 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 47 place count 147 transition count 966
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 58 place count 136 transition count 827
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 2 places and 32 transitions.
Iterating global reduction 7 with 13 rules applied. Total rules applied 71 place count 134 transition count 795
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 71 rules in 81 ms. Remains 134 /204 variables (removed 70) and now considering 795/1829 (removed 1034) transitions.
[2025-05-29 21:12:13] [INFO ] Flow matrix only has 696 transitions (discarded 99 similar events)
// Phase 1: matrix 696 rows 134 cols
[2025-05-29 21:12:13] [INFO ] Computed 9 invariants in 6 ms
[2025-05-29 21:12:14] [INFO ] Implicit Places using invariants in 342 ms returned []
[2025-05-29 21:12:14] [INFO ] Flow matrix only has 696 transitions (discarded 99 similar events)
[2025-05-29 21:12:14] [INFO ] Invariant cache hit.
[2025-05-29 21:12:14] [INFO ] State equation strengthened by 92 read => feed constraints.
[2025-05-29 21:12:15] [INFO ] Implicit Places using invariants and state equation in 885 ms returned []
Implicit Place search using SMT with State Equation took 1230 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 134/204 places, 795/2145 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 84229 ms. Remains : 134/204 places, 795/2145 transitions.
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
FORMULA BugTracking-PT-q8m064-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-29 21:12:15] [INFO ] Flow matrix only has 696 transitions (discarded 99 similar events)
Found an invariant !
This invariant on transitions {0=1, 538=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1, 538=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 2) seen :[0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, +inf]
[2025-05-29 21:12:15] [INFO ] Flow matrix only has 696 transitions (discarded 99 similar events)
// Phase 1: matrix 696 rows 132 cols
[2025-05-29 21:12:15] [INFO ] Computed 7 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, +inf]
RANDOM walk for 1000044 steps (2 resets) in 894 ms. (1117 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 2036 ms. (981 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, +inf]
[2025-05-29 21:12:18] [INFO ] Flow matrix only has 696 transitions (discarded 99 similar events)
[2025-05-29 21:12:18] [INFO ] Invariant cache hit.
[2025-05-29 21:12:18] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-05-29 21:12:18] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2025-05-29 21:12:18] [INFO ] State equation strengthened by 92 read => feed constraints.
[2025-05-29 21:12:18] [INFO ] [Real]Added 92 Read/Feed constraints in 25 ms returned sat
[2025-05-29 21:12:18] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:12:18] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-29 21:12:19] [INFO ] [Nat]Absence check using state equation in 222 ms returned sat
[2025-05-29 21:12:19] [INFO ] [Nat]Added 92 Read/Feed constraints in 47 ms returned sat
[2025-05-29 21:12:19] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 1 ms to minimize.
[2025-05-29 21:12:19] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 1 ms to minimize.
[2025-05-29 21:12:19] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 2 ms to minimize.
[2025-05-29 21:12:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 458 ms
[2025-05-29 21:12:19] [INFO ] Computed and/alt/rep : 276/1096/276 causal constraints (skipped 419 transitions) in 90 ms.
[2025-05-29 21:12:20] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 1 ms to minimize.
[2025-05-29 21:12:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2025-05-29 21:12:20] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 1 ms to minimize.
[2025-05-29 21:12:20] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 1 ms to minimize.
[2025-05-29 21:12:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 313 ms
[2025-05-29 21:12:20] [INFO ] Added : 11 causal constraints over 3 iterations in 863 ms. Result :sat
Minimization took 314 ms.
[2025-05-29 21:12:20] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-05-29 21:12:21] [INFO ] [Real]Absence check using state equation in 260 ms returned sat
[2025-05-29 21:12:21] [INFO ] [Real]Added 92 Read/Feed constraints in 31 ms returned sat
[2025-05-29 21:12:21] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:12:21] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-05-29 21:12:21] [INFO ] [Nat]Absence check using state equation in 258 ms returned sat
[2025-05-29 21:12:21] [INFO ] [Nat]Added 92 Read/Feed constraints in 63 ms returned sat
[2025-05-29 21:12:21] [INFO ] Deduced a trap composed of 57 places in 218 ms of which 2 ms to minimize.
[2025-05-29 21:12:22] [INFO ] Deduced a trap composed of 35 places in 191 ms of which 2 ms to minimize.
[2025-05-29 21:12:22] [INFO ] Deduced a trap composed of 48 places in 273 ms of which 3 ms to minimize.
[2025-05-29 21:12:22] [INFO ] Deduced a trap composed of 48 places in 306 ms of which 2 ms to minimize.
[2025-05-29 21:12:23] [INFO ] Deduced a trap composed of 10 places in 241 ms of which 2 ms to minimize.
[2025-05-29 21:12:23] [INFO ] Deduced a trap composed of 58 places in 289 ms of which 2 ms to minimize.
[2025-05-29 21:12:23] [INFO ] Deduced a trap composed of 42 places in 222 ms of which 3 ms to minimize.
[2025-05-29 21:12:23] [INFO ] Deduced a trap composed of 23 places in 252 ms of which 2 ms to minimize.
[2025-05-29 21:12:24] [INFO ] Deduced a trap composed of 51 places in 286 ms of which 3 ms to minimize.
[2025-05-29 21:12:24] [INFO ] Deduced a trap composed of 28 places in 230 ms of which 2 ms to minimize.
[2025-05-29 21:12:24] [INFO ] Deduced a trap composed of 58 places in 239 ms of which 2 ms to minimize.
[2025-05-29 21:12:24] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3185 ms
[2025-05-29 21:12:24] [INFO ] Computed and/alt/rep : 276/1096/276 causal constraints (skipped 419 transitions) in 87 ms.
[2025-05-29 21:12:25] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
[2025-05-29 21:12:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2025-05-29 21:12:25] [INFO ] Added : 13 causal constraints over 4 iterations in 552 ms. Result :sat
Minimization took 370 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, +inf]
Support contains 2 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 795/795 transitions.
Applied a total of 0 rules in 17 ms. Remains 132 /132 variables (removed 0) and now considering 795/795 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 132/132 places, 795/795 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 795/795 transitions.
Applied a total of 0 rules in 16 ms. Remains 132 /132 variables (removed 0) and now considering 795/795 (removed 0) transitions.
[2025-05-29 21:12:26] [INFO ] Flow matrix only has 696 transitions (discarded 99 similar events)
[2025-05-29 21:12:26] [INFO ] Invariant cache hit.
[2025-05-29 21:12:26] [INFO ] Implicit Places using invariants in 366 ms returned []
[2025-05-29 21:12:26] [INFO ] Flow matrix only has 696 transitions (discarded 99 similar events)
[2025-05-29 21:12:26] [INFO ] Invariant cache hit.
[2025-05-29 21:12:26] [INFO ] State equation strengthened by 92 read => feed constraints.
[2025-05-29 21:12:27] [INFO ] Implicit Places using invariants and state equation in 1066 ms returned []
Implicit Place search using SMT with State Equation took 1434 ms to find 0 implicit places.
[2025-05-29 21:12:27] [INFO ] Redundant transitions in 11 ms returned []
Running 794 sub problems to find dead transitions.
[2025-05-29 21:12:27] [INFO ] Flow matrix only has 696 transitions (discarded 99 similar events)
[2025-05-29 21:12:27] [INFO ] Invariant cache hit.
[2025-05-29 21:12:27] [INFO ] State equation strengthened by 92 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 794 unsolved
[2025-05-29 21:12:33] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2025-05-29 21:12:38] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
Problem TDEAD785 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 2/9 constraints. Problems are: Problem set: 4 solved, 790 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/9 constraints. Problems are: Problem set: 4 solved, 790 unsolved
At refinement iteration 3 (OVERLAPS) 696/828 variables, 132/141 constraints. Problems are: Problem set: 4 solved, 790 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/828 variables, 92/233 constraints. Problems are: Problem set: 4 solved, 790 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 828/828 variables, and 233 constraints, problems are : Problem set: 4 solved, 790 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 132/132 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 794/794 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 4 solved, 790 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 7/7 constraints. Problems are: Problem set: 4 solved, 790 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 2/9 constraints. Problems are: Problem set: 4 solved, 790 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/9 constraints. Problems are: Problem set: 4 solved, 790 unsolved
At refinement iteration 3 (OVERLAPS) 696/828 variables, 132/141 constraints. Problems are: Problem set: 4 solved, 790 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/828 variables, 92/233 constraints. Problems are: Problem set: 4 solved, 790 unsolved
Problem TDEAD82 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 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 TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 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 TDEAD346 is UNSAT
Problem TDEAD347 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 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 TDEAD373 is UNSAT
Problem TDEAD374 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 TDEAD455 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD787 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/828 variables, 790/1023 constraints. Problems are: Problem set: 121 solved, 673 unsolved
[2025-05-29 21:13:23] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 2 ms to minimize.
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
[2025-05-29 21:13:27] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 828/828 variables, and 1025 constraints, problems are : Problem set: 176 solved, 618 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 132/132 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 790/794 constraints, Known Traps: 4/4 constraints]
After SMT, in 61951ms problems are : Problem set: 176 solved, 618 unsolved
Search for dead transitions found 176 dead transitions in 61966ms
Found 176 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 176 transitions
Dead transitions reduction (with SMT) removed 176 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 132/132 places, 619/795 transitions.
Graph (complete) has 908 edges and 132 vertex of which 129 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 16 places and 170 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 113 transition count 449
Reduce places removed 3 places and 39 transitions.
Graph (complete) has 632 edges and 110 vertex of which 2 are kept as prefixes of interest. Removing 108 places using SCC suffix rule.1 ms
Discarding 108 places :
Also discarding 410 output transitions
Drop transitions (Output transitions of discarded places.) removed 410 transitions
Iterating post reduction 1 with 4 rules applied. Total rules applied 21 place count 2 transition count 0
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 21 rules in 8 ms. Remains 2 /132 variables (removed 130) and now considering 0/619 (removed 619) transitions.
[2025-05-29 21:13:29] [INFO ] Computed 0 invariants in 1 ms
[2025-05-29 21:13:29] [INFO ] Implicit Places using invariants in 19 ms returned []
[2025-05-29 21:13:29] [INFO ] Invariant cache hit.
[2025-05-29 21:13:29] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2/132 places, 0/795 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 63494 ms. Remains : 2/132 places, 0/795 transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
FORMULA BugTracking-PT-q8m064-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
All properties solved without resorting to model-checking.
Total runtime 454025 ms.

BK_STOP 1748553209641

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

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