Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r472-tajo-171620399400381.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is BugTracking-PT-q3m256, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399400381
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 16M May 18 16:42 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

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

=== Now, execution of the tool begins

BK_START 1717223785811

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q3m256
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:36:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 06:36:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:36:29] [INFO ] Load time of PNML (sax parser for PT used): 1575 ms
[2024-06-01 06:36:29] [INFO ] Transformed 754 places.
[2024-06-01 06:36:29] [INFO ] Transformed 27370 transitions.
[2024-06-01 06:36:29] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 2052 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 16 ms.
Deduced a syphon composed of 514 places in 133 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m256-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0] 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]
[2024-06-01 06:36:30] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
// Phase 1: matrix 2642 rows 240 cols
[2024-06-01 06:36:30] [INFO ] Computed 10 invariants in 46 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, +inf, +inf, 1, 1]
RANDOM walk for 10000 steps (4 resets) in 72 ms. (136 steps per ms)
FORMULA BugTracking-PT-q3m256-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60005 steps (12 resets) in 196 ms. (304 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 7, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, +inf, +inf, 1]
[2024-06-01 06:36:30] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
[2024-06-01 06:36:30] [INFO ] Invariant cache hit.
[2024-06-01 06:36:31] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2024-06-01 06:36:31] [INFO ] [Real]Absence check using state equation in 790 ms returned sat
[2024-06-01 06:36:32] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-06-01 06:36:32] [INFO ] [Real]Added 255 Read/Feed constraints in 112 ms returned sat
[2024-06-01 06:36:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:36:32] [INFO ] [Nat]Absence check using 10 positive place invariants in 14 ms returned sat
[2024-06-01 06:36:33] [INFO ] [Nat]Absence check using state equation in 773 ms returned sat
[2024-06-01 06:36:33] [INFO ] [Nat]Added 255 Read/Feed constraints in 60 ms returned sat
[2024-06-01 06:36:33] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 467 ms.
[2024-06-01 06:36:34] [INFO ] Added : 2 causal constraints over 1 iterations in 859 ms. Result :sat
Minimization took 715 ms.
[2024-06-01 06:36:35] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2024-06-01 06:36:35] [INFO ] [Real]Absence check using state equation in 525 ms returned sat
[2024-06-01 06:36:35] [INFO ] [Real]Added 255 Read/Feed constraints in 72 ms returned sat
[2024-06-01 06:36:35] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:36:36] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 06:36:36] [INFO ] [Nat]Absence check using state equation in 550 ms returned sat
[2024-06-01 06:36:36] [INFO ] [Nat]Added 255 Read/Feed constraints in 74 ms returned sat
[2024-06-01 06:36:37] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 262 ms.
[2024-06-01 06:36:37] [INFO ] Added : 2 causal constraints over 1 iterations in 760 ms. Result :sat
Minimization took 876 ms.
[2024-06-01 06:36:38] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 06:36:39] [INFO ] [Real]Absence check using state equation in 1222 ms returned sat
[2024-06-01 06:36:39] [INFO ] [Real]Added 255 Read/Feed constraints in 69 ms returned sat
[2024-06-01 06:36:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:36:39] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-01 06:36:40] [INFO ] [Nat]Absence check using state equation in 498 ms returned sat
[2024-06-01 06:36:40] [INFO ] [Nat]Added 255 Read/Feed constraints in 177 ms returned sat
[2024-06-01 06:36:41] [INFO ] Deduced a trap composed of 21 places in 354 ms of which 28 ms to minimize.
[2024-06-01 06:36:44] [INFO ] Deduced a trap composed of 40 places in 3565 ms of which 3 ms to minimize.
[2024-06-01 06:36:45] [INFO ] Deduced a trap composed of 39 places in 649 ms of which 2 ms to minimize.
[2024-06-01 06:36:45] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.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)
[2024-06-01 06:36:45] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-01 06:36:46] [INFO ] [Real]Absence check using state equation in 615 ms returned sat
[2024-06-01 06:36:46] [INFO ] [Real]Added 255 Read/Feed constraints in 37 ms returned sat
[2024-06-01 06:36:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:36:46] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-01 06:36:46] [INFO ] [Nat]Absence check using state equation in 394 ms returned sat
[2024-06-01 06:36:46] [INFO ] [Nat]Added 255 Read/Feed constraints in 103 ms returned sat
[2024-06-01 06:36:47] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 186 ms.
[2024-06-01 06:36:47] [INFO ] Added : 3 causal constraints over 1 iterations in 453 ms. Result :sat
Minimization took 750 ms.
[2024-06-01 06:36:48] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-01 06:36:48] [INFO ] [Real]Absence check using state equation in 474 ms returned sat
[2024-06-01 06:36:48] [INFO ] [Real]Added 255 Read/Feed constraints in 91 ms returned sat
[2024-06-01 06:36:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:36:49] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-01 06:36:49] [INFO ] [Nat]Absence check using state equation in 472 ms returned sat
[2024-06-01 06:36:49] [INFO ] [Nat]Added 255 Read/Feed constraints in 112 ms returned sat
[2024-06-01 06:36:50] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 239 ms.
[2024-06-01 06:36:50] [INFO ] Added : 6 causal constraints over 2 iterations in 711 ms. Result :sat
Minimization took 872 ms.
[2024-06-01 06:36:51] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 06:36:51] [INFO ] [Real]Absence check using state equation in 463 ms returned sat
[2024-06-01 06:36:52] [INFO ] [Real]Added 255 Read/Feed constraints in 39 ms returned sat
[2024-06-01 06:36:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:36:52] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-01 06:36:52] [INFO ] [Nat]Absence check using state equation in 467 ms returned sat
[2024-06-01 06:36:52] [INFO ] [Nat]Added 255 Read/Feed constraints in 133 ms returned sat
[2024-06-01 06:36:53] [INFO ] Deduced a trap composed of 27 places in 256 ms of which 2 ms to minimize.
[2024-06-01 06:36:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 399 ms
[2024-06-01 06:36:53] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 308 ms.
[2024-06-01 06:36:54] [INFO ] Deduced a trap composed of 18 places in 361 ms of which 2 ms to minimize.
[2024-06-01 06:36:54] [INFO ] Deduced a trap composed of 11 places in 385 ms of which 2 ms to minimize.
[2024-06-01 06:36:55] [INFO ] Deduced a trap composed of 9 places in 285 ms of which 4 ms to minimize.
[2024-06-01 06:36:55] [INFO ] Deduced a trap composed of 51 places in 263 ms of which 2 ms to minimize.
[2024-06-01 06:36:56] [INFO ] Deduced a trap composed of 56 places in 265 ms of which 10 ms to minimize.
[2024-06-01 06:36:56] [INFO ] Deduced a trap composed of 40 places in 245 ms of which 2 ms to minimize.
[2024-06-01 06:36:56] [INFO ] Deduced a trap composed of 19 places in 294 ms of which 3 ms to minimize.
[2024-06-01 06:36:57] [INFO ] Deduced a trap composed of 34 places in 198 ms of which 1 ms to minimize.
[2024-06-01 06:36:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1128)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 7, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, +inf, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 7, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, +inf, +inf, 1]
Support contains 6 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 2769/2769 transitions.
Graph (complete) has 3422 edges and 240 vertex of which 238 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.11 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 237 transition count 2750
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 237 transition count 2750
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 235 transition count 2753
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 235 transition count 2747
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 229 transition count 2747
Applied a total of 19 rules in 255 ms. Remains 229 /240 variables (removed 11) and now considering 2747/2769 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 268 ms. Remains : 229/240 places, 2747/2769 transitions.
[2024-06-01 06:36:57] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
Found an invariant !
This invariant on transitions {4=1, 1722=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1, 1722=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 6) seen :[0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 7, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, +inf, +inf, 1]
[2024-06-01 06:36:58] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2024-06-01 06:36:58] [INFO ] Computed 8 invariants in 14 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 7, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, +inf, +inf, 1]
RANDOM walk for 1000143 steps (2 resets) in 600 ms. (1664 steps per ms)
BEST_FIRST walk for 6000003 steps (12 resets) in 13002 ms. (461 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 10, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, +inf, +inf, 1]
[2024-06-01 06:37:11] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-06-01 06:37:11] [INFO ] Invariant cache hit.
[2024-06-01 06:37:12] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-01 06:37:12] [INFO ] [Real]Absence check using state equation in 469 ms returned sat
[2024-06-01 06:37:12] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-06-01 06:37:12] [INFO ] [Real]Added 241 Read/Feed constraints in 43 ms returned sat
[2024-06-01 06:37:12] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:37:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-01 06:37:13] [INFO ] [Nat]Absence check using state equation in 434 ms returned sat
[2024-06-01 06:37:13] [INFO ] [Nat]Added 241 Read/Feed constraints in 122 ms returned sat
[2024-06-01 06:37:13] [INFO ] Deduced a trap composed of 7 places in 425 ms of which 2 ms to minimize.
[2024-06-01 06:37:14] [INFO ] Deduced a trap composed of 33 places in 372 ms of which 2 ms to minimize.
[2024-06-01 06:37:14] [INFO ] Deduced a trap composed of 10 places in 377 ms of which 2 ms to minimize.
[2024-06-01 06:37:15] [INFO ] Deduced a trap composed of 19 places in 379 ms of which 2 ms to minimize.
[2024-06-01 06:37:15] [INFO ] Deduced a trap composed of 38 places in 355 ms of which 2 ms to minimize.
[2024-06-01 06:37:15] [INFO ] Deduced a trap composed of 58 places in 358 ms of which 1 ms to minimize.
[2024-06-01 06:37:16] [INFO ] Deduced a trap composed of 48 places in 428 ms of which 2 ms to minimize.
[2024-06-01 06:37:16] [INFO ] Deduced a trap composed of 39 places in 424 ms of which 2 ms to minimize.
[2024-06-01 06:37:17] [INFO ] Deduced a trap composed of 27 places in 363 ms of which 1 ms to minimize.
[2024-06-01 06:37:17] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 4228 ms
[2024-06-01 06:37:17] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 244 ms.
[2024-06-01 06:37:18] [INFO ] Added : 10 causal constraints over 4 iterations in 900 ms. Result :sat
Minimization took 2304 ms.
[2024-06-01 06:37:20] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-01 06:37:21] [INFO ] [Real]Absence check using state equation in 484 ms returned sat
[2024-06-01 06:37:21] [INFO ] [Real]Added 241 Read/Feed constraints in 64 ms returned sat
[2024-06-01 06:37:21] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:37:21] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-01 06:37:22] [INFO ] [Nat]Absence check using state equation in 410 ms returned sat
[2024-06-01 06:37:22] [INFO ] [Nat]Added 241 Read/Feed constraints in 48 ms returned sat
[2024-06-01 06:37:22] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 171 ms.
[2024-06-01 06:37:22] [INFO ] Added : 2 causal constraints over 1 iterations in 376 ms. Result :sat
Minimization took 2687 ms.
[2024-06-01 06:37:25] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-01 06:37:25] [INFO ] [Real]Absence check using state equation in 450 ms returned sat
[2024-06-01 06:37:25] [INFO ] [Real]Added 241 Read/Feed constraints in 61 ms returned sat
[2024-06-01 06:37:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:37:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-01 06:37:26] [INFO ] [Nat]Absence check using state equation in 459 ms returned sat
[2024-06-01 06:37:26] [INFO ] [Nat]Added 241 Read/Feed constraints in 151 ms returned sat
[2024-06-01 06:37:27] [INFO ] Deduced a trap composed of 19 places in 330 ms of which 2 ms to minimize.
[2024-06-01 06:37:27] [INFO ] Deduced a trap composed of 24 places in 190 ms of which 2 ms to minimize.
[2024-06-01 06:37:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 689 ms
[2024-06-01 06:37:27] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 226 ms.
[2024-06-01 06:37:28] [INFO ] Deduced a trap composed of 51 places in 385 ms of which 17 ms to minimize.
[2024-06-01 06:37:29] [INFO ] Deduced a trap composed of 21 places in 362 ms of which 1 ms to minimize.
[2024-06-01 06:37:29] [INFO ] Deduced a trap composed of 32 places in 493 ms of which 1 ms to minimize.
[2024-06-01 06:37:30] [INFO ] Deduced a trap composed of 28 places in 288 ms of which 2 ms to minimize.
[2024-06-01 06:37:30] [INFO ] Deduced a trap composed of 49 places in 318 ms of which 1 ms to minimize.
[2024-06-01 06:37:31] [INFO ] Deduced a trap composed of 51 places in 326 ms of which 2 ms to minimize.
[2024-06-01 06:37:31] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2967 ms
[2024-06-01 06:37:31] [INFO ] Added : 7 causal constraints over 3 iterations in 3861 ms. Result :sat
Minimization took 2664 ms.
[2024-06-01 06:37:34] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-01 06:37:34] [INFO ] [Real]Absence check using state equation in 507 ms returned sat
[2024-06-01 06:37:34] [INFO ] [Real]Added 241 Read/Feed constraints in 58 ms returned sat
[2024-06-01 06:37:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:37:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-01 06:37:35] [INFO ] [Nat]Absence check using state equation in 792 ms returned sat
[2024-06-01 06:37:35] [INFO ] [Nat]Added 241 Read/Feed constraints in 129 ms returned sat
[2024-06-01 06:37:36] [INFO ] Deduced a trap composed of 66 places in 527 ms of which 3 ms to minimize.
[2024-06-01 06:37:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 646 ms
[2024-06-01 06:37:36] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 268 ms.
[2024-06-01 06:37:37] [INFO ] Added : 3 causal constraints over 1 iterations in 613 ms. Result :sat
Minimization took 2661 ms.
[2024-06-01 06:37:39] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-01 06:37:40] [INFO ] [Real]Absence check using state equation in 429 ms returned sat
[2024-06-01 06:37:40] [INFO ] [Real]Added 241 Read/Feed constraints in 45 ms returned sat
[2024-06-01 06:37:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:37:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-01 06:37:41] [INFO ] [Nat]Absence check using state equation in 458 ms returned sat
[2024-06-01 06:37:41] [INFO ] [Nat]Added 241 Read/Feed constraints in 58 ms returned sat
[2024-06-01 06:37:41] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 222 ms.
[2024-06-01 06:37:41] [INFO ] Added : 1 causal constraints over 1 iterations in 578 ms. Result :sat
Minimization took 2286 ms.
[2024-06-01 06:37:44] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-01 06:37:44] [INFO ] [Real]Absence check using state equation in 497 ms returned sat
[2024-06-01 06:37:44] [INFO ] [Real]Added 241 Read/Feed constraints in 51 ms returned sat
[2024-06-01 06:37:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:37:44] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-06-01 06:37:45] [INFO ] [Nat]Absence check using state equation in 897 ms returned sat
[2024-06-01 06:37:45] [INFO ] [Nat]Added 241 Read/Feed constraints in 127 ms returned sat
[2024-06-01 06:37:46] [INFO ] Deduced a trap composed of 19 places in 341 ms of which 2 ms to minimize.
[2024-06-01 06:37:46] [INFO ] Deduced a trap composed of 60 places in 316 ms of which 2 ms to minimize.
[2024-06-01 06:37:47] [INFO ] Deduced a trap composed of 24 places in 313 ms of which 2 ms to minimize.
[2024-06-01 06:37:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1236 ms
[2024-06-01 06:37:47] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 272 ms.
[2024-06-01 06:37:47] [INFO ] Added : 6 causal constraints over 2 iterations in 686 ms. Result :sat
Minimization took 2034 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 10, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, +inf, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 10, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, +inf, +inf, 1]
Support contains 6 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 128 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 55 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2024-06-01 06:37:51] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-06-01 06:37:51] [INFO ] Invariant cache hit.
[2024-06-01 06:37:51] [INFO ] Implicit Places using invariants in 427 ms returned []
[2024-06-01 06:37:51] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-06-01 06:37:51] [INFO ] Invariant cache hit.
[2024-06-01 06:37:51] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-06-01 06:37:53] [INFO ] Implicit Places using invariants and state equation in 1743 ms returned []
Implicit Place search using SMT with State Equation took 2175 ms to find 0 implicit places.
[2024-06-01 06:37:53] [INFO ] Redundant transitions in 301 ms returned []
Running 2746 sub problems to find dead transitions.
[2024-06-01 06:37:53] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-06-01 06:37:53] [INFO ] Invariant cache hit.
[2024-06-01 06:37:53] [INFO ] State equation strengthened by 241 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2746 unsolved
[2024-06-01 06:38:40] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 2 ms to minimize.
[2024-06-01 06:38:44] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 6 ms to minimize.
Problem TDEAD1480 is UNSAT
Problem TDEAD1481 is UNSAT
Problem TDEAD1482 is UNSAT
Problem TDEAD1483 is UNSAT
Problem TDEAD1485 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1490 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1497 is UNSAT
Problem TDEAD1498 is UNSAT
Problem TDEAD1501 is UNSAT
Problem TDEAD1502 is UNSAT
Problem TDEAD1503 is UNSAT
Problem TDEAD1504 is UNSAT
Problem TDEAD1506 is UNSAT
Problem TDEAD1507 is UNSAT
Problem TDEAD1510 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1513 is UNSAT
Problem TDEAD1516 is UNSAT
Problem TDEAD1517 is UNSAT
Problem TDEAD1518 is UNSAT
Problem TDEAD1519 is UNSAT
[2024-06-01 06:38:44] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 1 ms to minimize.
Problem TDEAD1562 is UNSAT
Problem TDEAD1563 is UNSAT
Problem TDEAD1564 is UNSAT
Problem TDEAD1565 is UNSAT
Problem TDEAD1566 is UNSAT
Problem TDEAD1567 is UNSAT
Problem TDEAD1568 is UNSAT
Problem TDEAD1569 is UNSAT
Problem TDEAD1570 is UNSAT
Problem TDEAD1571 is UNSAT
Problem TDEAD1572 is UNSAT
Problem TDEAD1573 is UNSAT
Problem TDEAD1574 is UNSAT
Problem TDEAD1575 is UNSAT
Problem TDEAD1576 is UNSAT
Problem TDEAD1577 is UNSAT
Problem TDEAD1578 is UNSAT
Problem TDEAD1579 is UNSAT
Problem TDEAD1580 is UNSAT
Problem TDEAD1581 is UNSAT
Problem TDEAD1582 is UNSAT
Problem TDEAD1583 is UNSAT
Problem TDEAD1584 is UNSAT
Problem TDEAD1585 is UNSAT
Problem TDEAD1586 is UNSAT
Problem TDEAD1587 is UNSAT
Problem TDEAD1588 is UNSAT
Problem TDEAD1589 is UNSAT
Problem TDEAD1590 is UNSAT
Problem TDEAD1591 is UNSAT
Problem TDEAD1592 is UNSAT
Problem TDEAD1593 is UNSAT
Problem TDEAD1594 is UNSAT
Problem TDEAD1595 is UNSAT
Problem TDEAD1596 is UNSAT
Problem TDEAD1597 is UNSAT
Problem TDEAD1598 is UNSAT
Problem TDEAD1599 is UNSAT
Problem TDEAD1600 is UNSAT
Problem TDEAD1601 is UNSAT
Problem TDEAD1602 is UNSAT
Problem TDEAD1603 is UNSAT
Problem TDEAD1604 is UNSAT
Problem TDEAD1605 is UNSAT
Problem TDEAD1606 is UNSAT
Problem TDEAD1607 is UNSAT
Problem TDEAD1608 is UNSAT
Problem TDEAD1609 is UNSAT
Problem TDEAD1610 is UNSAT
Problem TDEAD1611 is UNSAT
Problem TDEAD1612 is UNSAT
Problem TDEAD1613 is UNSAT
Problem TDEAD1614 is UNSAT
Problem TDEAD1615 is UNSAT
Problem TDEAD1616 is UNSAT
Problem TDEAD1617 is UNSAT
Problem TDEAD1618 is UNSAT
Problem TDEAD1619 is UNSAT
Problem TDEAD1620 is UNSAT
Problem TDEAD1621 is UNSAT
Problem TDEAD1622 is UNSAT
Problem TDEAD1623 is UNSAT
Problem TDEAD1624 is UNSAT
Problem TDEAD1625 is UNSAT
Problem TDEAD1626 is UNSAT
Problem TDEAD1627 is UNSAT
Problem TDEAD1628 is UNSAT
Problem TDEAD1629 is UNSAT
Problem TDEAD1630 is UNSAT
Problem TDEAD1631 is UNSAT
Problem TDEAD1632 is UNSAT
Problem TDEAD1633 is UNSAT
Problem TDEAD1634 is UNSAT
Problem TDEAD1635 is UNSAT
Problem TDEAD1636 is UNSAT
Problem TDEAD1637 is UNSAT
Problem TDEAD1638 is UNSAT
Problem TDEAD1639 is UNSAT
Problem TDEAD1640 is UNSAT
Problem TDEAD1641 is UNSAT
Problem TDEAD1642 is UNSAT
Problem TDEAD1643 is UNSAT
Problem TDEAD1644 is UNSAT
Problem TDEAD1645 is UNSAT
[2024-06-01 06:38:45] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 1 ms to minimize.
Problem TDEAD1716 is UNSAT
Problem TDEAD1717 is UNSAT
Problem TDEAD1718 is UNSAT
Problem TDEAD1719 is UNSAT
Problem TDEAD1720 is UNSAT
Problem TDEAD1721 is UNSAT
Problem TDEAD1722 is UNSAT
Problem TDEAD1723 is UNSAT
Problem TDEAD1724 is UNSAT
Problem TDEAD1725 is UNSAT
Problem TDEAD1726 is UNSAT
Problem TDEAD1727 is UNSAT
Problem TDEAD1728 is UNSAT
Problem TDEAD1729 is UNSAT
Problem TDEAD1730 is UNSAT
Problem TDEAD1731 is UNSAT
Problem TDEAD1732 is UNSAT
Problem TDEAD1733 is UNSAT
Problem TDEAD1734 is UNSAT
Problem TDEAD1735 is UNSAT
Problem TDEAD1736 is UNSAT
Problem TDEAD1737 is UNSAT
Problem TDEAD1738 is UNSAT
Problem TDEAD1739 is UNSAT
Problem TDEAD1740 is UNSAT
Problem TDEAD1741 is UNSAT
Problem TDEAD1742 is UNSAT
Problem TDEAD1743 is UNSAT
Problem TDEAD1747 is UNSAT
Problem TDEAD1748 is UNSAT
[2024-06-01 06:38:45] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 1 ms to minimize.
Problem TDEAD1749 is UNSAT
Problem TDEAD1750 is UNSAT
Problem TDEAD1751 is UNSAT
Problem TDEAD1752 is UNSAT
Problem TDEAD1753 is UNSAT
Problem TDEAD1754 is UNSAT
Problem TDEAD1755 is UNSAT
Problem TDEAD1756 is UNSAT
Problem TDEAD1757 is UNSAT
Problem TDEAD1758 is UNSAT
Problem TDEAD1759 is UNSAT
Problem TDEAD1760 is UNSAT
Problem TDEAD1763 is UNSAT
Problem TDEAD1764 is UNSAT
Problem TDEAD1766 is UNSAT
Problem TDEAD1767 is UNSAT
[2024-06-01 06:38:45] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 1 ms to minimize.
Problem TDEAD1768 is UNSAT
Problem TDEAD1769 is UNSAT
Problem TDEAD1770 is UNSAT
Problem TDEAD1771 is UNSAT
Problem TDEAD1772 is UNSAT
Problem TDEAD1773 is UNSAT
Problem TDEAD1774 is UNSAT
Problem TDEAD1775 is UNSAT
Problem TDEAD1776 is UNSAT
Problem TDEAD1780 is UNSAT
Problem TDEAD1781 is UNSAT
Problem TDEAD1782 is UNSAT
Problem TDEAD1783 is UNSAT
Problem TDEAD1785 is UNSAT
Problem TDEAD1786 is UNSAT
Problem TDEAD1790 is UNSAT
Problem TDEAD1791 is UNSAT
Problem TDEAD1792 is UNSAT
Problem TDEAD1793 is UNSAT
Problem TDEAD1794 is UNSAT
Problem TDEAD1795 is UNSAT
[2024-06-01 06:38:46] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 1 ms to minimize.
Problem TDEAD1796 is UNSAT
Problem TDEAD1797 is UNSAT
Problem TDEAD1798 is UNSAT
Problem TDEAD1801 is UNSAT
Problem TDEAD1802 is UNSAT
Problem TDEAD1804 is UNSAT
Problem TDEAD1805 is UNSAT
[2024-06-01 06:38:46] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 1 ms to minimize.
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
[2024-06-01 06:38:52] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 1 ms to minimize.
Problem TDEAD2683 is UNSAT
Problem TDEAD2695 is UNSAT
[2024-06-01 06:38:53] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 1 ms to minimize.
Problem TDEAD2709 is UNSAT
Problem TDEAD2710 is UNSAT
Problem TDEAD2720 is UNSAT
Problem TDEAD2721 is UNSAT
Problem TDEAD2732 is UNSAT
Problem TDEAD2733 is UNSAT
Problem TDEAD2743 is UNSAT
Problem TDEAD2744 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1458 is UNSAT
Problem TDEAD1459 is UNSAT
Problem TDEAD1460 is UNSAT
Problem TDEAD1461 is UNSAT
Problem TDEAD1462 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1468 is UNSAT
Problem TDEAD1469 is UNSAT
Problem TDEAD1470 is UNSAT
Problem TDEAD1471 is UNSAT
Problem TDEAD1472 is UNSAT
Problem TDEAD1473 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1475 is UNSAT
Problem TDEAD1476 is UNSAT
Problem TDEAD1477 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 10/18 constraints. Problems are: Problem set: 236 solved, 2510 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 229/2847 variables, and 18 constraints, problems are : Problem set: 236 solved, 2510 unsolved in 30079 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/229 constraints, ReadFeed: 0/241 constraints, PredecessorRefiner: 2746/2746 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 236 solved, 2510 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 7/7 constraints. Problems are: Problem set: 236 solved, 2510 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/221 variables, 10/17 constraints. Problems are: Problem set: 236 solved, 2510 unsolved
[2024-06-01 06:39:16] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 1 ms to minimize.
Problem TDEAD1433 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1435 is UNSAT
Problem TDEAD1436 is UNSAT
Problem TDEAD1437 is UNSAT
Problem TDEAD1438 is UNSAT
Problem TDEAD1439 is UNSAT
[2024-06-01 06:39:16] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 1 ms to minimize.
Problem TDEAD1440 is UNSAT
Problem TDEAD1441 is UNSAT
Problem TDEAD1442 is UNSAT
Problem TDEAD1443 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1446 is UNSAT
Problem TDEAD1447 is UNSAT
Problem TDEAD1448 is UNSAT
Problem TDEAD1449 is UNSAT
Problem TDEAD1450 is UNSAT
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 221/2847 variables, and 19 constraints, problems are : Problem set: 254 solved, 2492 unsolved in 30132 ms.
Refiners :[Positive P Invariants (semi-flows): 7/8 constraints, State Equation: 0/229 constraints, ReadFeed: 0/241 constraints, PredecessorRefiner: 0/2746 constraints, Known Traps: 12/12 constraints]
After SMT, in 90864ms problems are : Problem set: 254 solved, 2492 unsolved
Search for dead transitions found 254 dead transitions in 90943ms
Found 254 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 254 transitions
Dead transitions reduction (with SMT) removed 254 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 229/229 places, 2493/2747 transitions.
Graph (complete) has 3014 edges and 229 vertex of which 221 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Reduce places removed 29 places and 650 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 192 transition count 1843
Reduce places removed 15 places and 271 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 45 place count 177 transition count 1572
Reduce places removed 10 places and 174 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 55 place count 167 transition count 1398
Reduce places removed 8 places and 119 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 63 place count 159 transition count 1279
Reduce places removed 1 places and 17 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 64 place count 158 transition count 1262
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 67 place count 155 transition count 1220
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 16 places and 270 transitions.
Iterating global reduction 5 with 19 rules applied. Total rules applied 86 place count 139 transition count 950
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 86 rules in 61 ms. Remains 139 /229 variables (removed 90) and now considering 950/2493 (removed 1543) transitions.
[2024-06-01 06:39:24] [INFO ] Flow matrix only has 902 transitions (discarded 48 similar events)
// Phase 1: matrix 902 rows 139 cols
[2024-06-01 06:39:24] [INFO ] Computed 9 invariants in 4 ms
[2024-06-01 06:39:31] [INFO ] Implicit Places using invariants in 7080 ms returned []
[2024-06-01 06:39:31] [INFO ] Flow matrix only has 902 transitions (discarded 48 similar events)
[2024-06-01 06:39:31] [INFO ] Invariant cache hit.
[2024-06-01 06:39:31] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-06-01 06:39:32] [INFO ] Implicit Places using invariants and state equation in 1230 ms returned []
Implicit Place search using SMT with State Equation took 8314 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 139/229 places, 950/2747 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 101899 ms. Remains : 139/229 places, 950/2747 transitions.
Deduced a syphon composed of 2 places in 13 ms
Reduce places removed 2 places and 0 transitions.
FORMULA BugTracking-PT-q3m256-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 06:39:32] [INFO ] Flow matrix only has 902 transitions (discarded 48 similar events)
Found an invariant !
This invariant on transitions {0=1, 12=1, 587=1, 862=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 12 ms.
This minimized invariant on transitions {1=1, 587=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 4) seen :[0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 10, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, +inf, +inf, 1]
[2024-06-01 06:39:33] [INFO ] Flow matrix only has 902 transitions (discarded 48 similar events)
// Phase 1: matrix 902 rows 137 cols
[2024-06-01 06:39:33] [INFO ] Computed 7 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 10, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 1, +inf, 1]
Inconsistency detected : max struct is less than max seen for bound index 1
RANDOM walk for 1000040 steps (2 resets) in 504 ms. (1980 steps per ms)
BEST_FIRST walk for 4000004 steps (8 resets) in 4153 ms. (962 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[8, 10, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 1, +inf, 1]
Inconsistency detected : max struct is less than max seen for bound index 1
[2024-06-01 06:39:38] [INFO ] Flow matrix only has 902 transitions (discarded 48 similar events)
[2024-06-01 06:39:38] [INFO ] Invariant cache hit.
[2024-06-01 06:39:38] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-06-01 06:39:38] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2024-06-01 06:39:38] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-06-01 06:39:38] [INFO ] [Real]Added 112 Read/Feed constraints in 34 ms returned sat
[2024-06-01 06:39:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:39:38] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 06:39:38] [INFO ] [Nat]Absence check using state equation in 194 ms returned sat
[2024-06-01 06:39:38] [INFO ] [Nat]Added 112 Read/Feed constraints in 37 ms returned sat
[2024-06-01 06:39:38] [INFO ] Deduced a trap composed of 18 places in 223 ms of which 2 ms to minimize.
[2024-06-01 06:39:39] [INFO ] Deduced a trap composed of 5 places in 248 ms of which 1 ms to minimize.
[2024-06-01 06:39:39] [INFO ] Deduced a trap composed of 12 places in 156 ms of which 1 ms to minimize.
[2024-06-01 06:39:39] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 2 ms to minimize.
[2024-06-01 06:39:39] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 1 ms to minimize.
[2024-06-01 06:39:39] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1158 ms
[2024-06-01 06:39:39] [INFO ] Computed and/alt/rep : 228/837/228 causal constraints (skipped 673 transitions) in 78 ms.
[2024-06-01 06:39:40] [INFO ] Deduced a trap composed of 12 places in 165 ms of which 2 ms to minimize.
[2024-06-01 06:39:40] [INFO ] Deduced a trap composed of 29 places in 131 ms of which 4 ms to minimize.
[2024-06-01 06:39:40] [INFO ] Deduced a trap composed of 29 places in 131 ms of which 1 ms to minimize.
[2024-06-01 06:39:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 618 ms
[2024-06-01 06:39:41] [INFO ] Added : 21 causal constraints over 6 iterations in 1263 ms. Result :sat
Minimization took 513 ms.
[2024-06-01 06:39:41] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2024-06-01 06:39:41] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-01 06:39:42] [INFO ] [Real]Absence check using state equation in 188 ms returned sat
[2024-06-01 06:39:42] [INFO ] [Real]Added 112 Read/Feed constraints in 18 ms returned sat
[2024-06-01 06:39:42] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:39:42] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 06:39:42] [INFO ] [Nat]Absence check using state equation in 235 ms returned sat
[2024-06-01 06:39:42] [INFO ] [Nat]Added 112 Read/Feed constraints in 40 ms returned sat
[2024-06-01 06:39:42] [INFO ] Deduced a trap composed of 14 places in 188 ms of which 1 ms to minimize.
[2024-06-01 06:39:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 246 ms
[2024-06-01 06:39:42] [INFO ] Computed and/alt/rep : 228/837/228 causal constraints (skipped 673 transitions) in 93 ms.
[2024-06-01 06:39:42] [INFO ] Added : 3 causal constraints over 1 iterations in 232 ms. Result :sat
Minimization took 446 ms.
[2024-06-01 06:39:43] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-06-01 06:39:43] [INFO ] [Real]Absence check using state equation in 306 ms returned sat
[2024-06-01 06:39:43] [INFO ] [Real]Added 112 Read/Feed constraints in 18 ms returned sat
[2024-06-01 06:39:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:39:43] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-01 06:39:44] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2024-06-01 06:39:44] [INFO ] [Nat]Added 112 Read/Feed constraints in 35 ms returned sat
[2024-06-01 06:39:44] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 1 ms to minimize.
[2024-06-01 06:39:44] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 1 ms to minimize.
[2024-06-01 06:39:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 342 ms
[2024-06-01 06:39:44] [INFO ] Computed and/alt/rep : 228/837/228 causal constraints (skipped 673 transitions) in 51 ms.
[2024-06-01 06:39:44] [INFO ] Added : 9 causal constraints over 4 iterations in 205 ms. Result :sat
Minimization took 484 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[8, 10, 0, 0, 0, 0] Max Struct:[+inf, 10, 1, 1, +inf, 1]
FORMULA BugTracking-PT-q3m256-UpperBounds-03 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[8, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
Support contains 3 out of 137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 137/137 places, 950/950 transitions.
Applied a total of 0 rules in 19 ms. Remains 137 /137 variables (removed 0) and now considering 950/950 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 137/137 places, 950/950 transitions.
[2024-06-01 06:39:45] [INFO ] Flow matrix only has 902 transitions (discarded 48 similar events)
Found an invariant !
This invariant on transitions {0=1, 12=1, 587=1, 862=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {1=1, 587=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 3) seen :[1, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[8, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
[2024-06-01 06:39:46] [INFO ] Flow matrix only has 902 transitions (discarded 48 similar events)
[2024-06-01 06:39:46] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[8, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
RANDOM walk for 1000186 steps (2 resets) in 601 ms. (1661 steps per ms)
BEST_FIRST walk for 3000003 steps (6 resets) in 3554 ms. (843 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[8, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
[2024-06-01 06:39:50] [INFO ] Flow matrix only has 902 transitions (discarded 48 similar events)
[2024-06-01 06:39:50] [INFO ] Invariant cache hit.
[2024-06-01 06:39:50] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-06-01 06:39:50] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2024-06-01 06:39:50] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-06-01 06:39:50] [INFO ] [Real]Added 112 Read/Feed constraints in 30 ms returned sat
[2024-06-01 06:39:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:39:50] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-01 06:39:51] [INFO ] [Nat]Absence check using state equation in 296 ms returned sat
[2024-06-01 06:39:51] [INFO ] [Nat]Added 112 Read/Feed constraints in 59 ms returned sat
[2024-06-01 06:39:51] [INFO ] Deduced a trap composed of 18 places in 264 ms of which 4 ms to minimize.
[2024-06-01 06:39:51] [INFO ] Deduced a trap composed of 5 places in 166 ms of which 2 ms to minimize.
[2024-06-01 06:39:51] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 1 ms to minimize.
[2024-06-01 06:39:51] [INFO ] Deduced a trap composed of 38 places in 138 ms of which 1 ms to minimize.
[2024-06-01 06:39:52] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 1 ms to minimize.
[2024-06-01 06:39:52] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 979 ms
[2024-06-01 06:39:52] [INFO ] Computed and/alt/rep : 228/837/228 causal constraints (skipped 673 transitions) in 78 ms.
[2024-06-01 06:39:52] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 1 ms to minimize.
[2024-06-01 06:39:52] [INFO ] Deduced a trap composed of 29 places in 124 ms of which 1 ms to minimize.
[2024-06-01 06:39:52] [INFO ] Deduced a trap composed of 29 places in 144 ms of which 1 ms to minimize.
[2024-06-01 06:39:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 538 ms
[2024-06-01 06:39:52] [INFO ] Added : 21 causal constraints over 6 iterations in 925 ms. Result :sat
Minimization took 581 ms.
[2024-06-01 06:39:53] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-06-01 06:39:53] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2024-06-01 06:39:53] [INFO ] [Real]Added 112 Read/Feed constraints in 26 ms returned sat
[2024-06-01 06:39:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:39:53] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-01 06:39:54] [INFO ] [Nat]Absence check using state equation in 191 ms returned sat
[2024-06-01 06:39:54] [INFO ] [Nat]Added 112 Read/Feed constraints in 30 ms returned sat
[2024-06-01 06:39:54] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 2 ms to minimize.
[2024-06-01 06:39:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 205 ms
[2024-06-01 06:39:54] [INFO ] Computed and/alt/rep : 228/837/228 causal constraints (skipped 673 transitions) in 81 ms.
[2024-06-01 06:39:54] [INFO ] Added : 3 causal constraints over 1 iterations in 200 ms. Result :sat
Minimization took 595 ms.
[2024-06-01 06:39:55] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-01 06:39:55] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2024-06-01 06:39:55] [INFO ] [Real]Added 112 Read/Feed constraints in 16 ms returned sat
[2024-06-01 06:39:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:39:55] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 06:39:55] [INFO ] [Nat]Absence check using state equation in 211 ms returned sat
[2024-06-01 06:39:55] [INFO ] [Nat]Added 112 Read/Feed constraints in 39 ms returned sat
[2024-06-01 06:39:56] [INFO ] Deduced a trap composed of 14 places in 162 ms of which 1 ms to minimize.
[2024-06-01 06:39:56] [INFO ] Deduced a trap composed of 16 places in 156 ms of which 1 ms to minimize.
[2024-06-01 06:39:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 406 ms
[2024-06-01 06:39:56] [INFO ] Computed and/alt/rep : 228/837/228 causal constraints (skipped 673 transitions) in 71 ms.
[2024-06-01 06:39:56] [INFO ] Added : 9 causal constraints over 4 iterations in 290 ms. Result :sat
Minimization took 561 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[8, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[8, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
Support contains 3 out of 137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 137/137 places, 950/950 transitions.
Applied a total of 0 rules in 28 ms. Remains 137 /137 variables (removed 0) and now considering 950/950 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 137/137 places, 950/950 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 137/137 places, 950/950 transitions.
Applied a total of 0 rules in 22 ms. Remains 137 /137 variables (removed 0) and now considering 950/950 (removed 0) transitions.
[2024-06-01 06:39:57] [INFO ] Flow matrix only has 902 transitions (discarded 48 similar events)
[2024-06-01 06:39:57] [INFO ] Invariant cache hit.
[2024-06-01 06:39:57] [INFO ] Implicit Places using invariants in 217 ms returned []
[2024-06-01 06:39:57] [INFO ] Flow matrix only has 902 transitions (discarded 48 similar events)
[2024-06-01 06:39:57] [INFO ] Invariant cache hit.
[2024-06-01 06:39:57] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-06-01 06:39:58] [INFO ] Implicit Places using invariants and state equation in 582 ms returned []
Implicit Place search using SMT with State Equation took 805 ms to find 0 implicit places.
[2024-06-01 06:39:58] [INFO ] Redundant transitions in 36 ms returned []
Running 949 sub problems to find dead transitions.
[2024-06-01 06:39:58] [INFO ] Flow matrix only has 902 transitions (discarded 48 similar events)
[2024-06-01 06:39:58] [INFO ] Invariant cache hit.
[2024-06-01 06:39:58] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 949 unsolved
[2024-06-01 06:40:05] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 0 ms to minimize.
[2024-06-01 06:40:06] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 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 TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD949 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 2/9 constraints. Problems are: Problem set: 147 solved, 802 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/9 constraints. Problems are: Problem set: 147 solved, 802 unsolved
Problem TDEAD619 is UNSAT
At refinement iteration 3 (OVERLAPS) 902/1039 variables, 137/146 constraints. Problems are: Problem set: 148 solved, 801 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1039 variables, 112/258 constraints. Problems are: Problem set: 148 solved, 801 unsolved
[2024-06-01 06:40:25] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 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 TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/1039 variables, 1/259 constraints. Problems are: Problem set: 208 solved, 741 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1039/1039 variables, and 259 constraints, problems are : Problem set: 208 solved, 741 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 137/137 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 949/949 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 208 solved, 741 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 7/7 constraints. Problems are: Problem set: 208 solved, 741 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 3/10 constraints. Problems are: Problem set: 208 solved, 741 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/10 constraints. Problems are: Problem set: 208 solved, 741 unsolved
At refinement iteration 3 (OVERLAPS) 902/1039 variables, 137/147 constraints. Problems are: Problem set: 208 solved, 741 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1039 variables, 112/259 constraints. Problems are: Problem set: 208 solved, 741 unsolved
Problem TDEAD105 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 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 TDEAD319 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD934 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/1039 variables, 741/1000 constraints. Problems are: Problem set: 267 solved, 682 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1039/1039 variables, and 1000 constraints, problems are : Problem set: 267 solved, 682 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 137/137 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 741/949 constraints, Known Traps: 3/3 constraints]
After SMT, in 64283ms problems are : Problem set: 267 solved, 682 unsolved
Search for dead transitions found 267 dead transitions in 64295ms
Found 267 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 267 transitions
Dead transitions reduction (with SMT) removed 267 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 137/137 places, 683/950 transitions.
Graph (complete) has 991 edges and 137 vertex of which 134 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 22 places and 252 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 112 transition count 431
Reduce places removed 15 places and 89 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 38 place count 97 transition count 342
Reduce places removed 3 places and 29 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 41 place count 94 transition count 313
Reduce places removed 2 places and 16 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 43 place count 92 transition count 297
Reduce places removed 1 places and 9 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 44 place count 91 transition count 288
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 50 place count 85 transition count 242
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 5 with 6 rules applied. Total rules applied 56 place count 85 transition count 242
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 56 rules in 25 ms. Remains 85 /137 variables (removed 52) and now considering 242/683 (removed 441) transitions.
[2024-06-01 06:41:02] [INFO ] Flow matrix only has 225 transitions (discarded 17 similar events)
// Phase 1: matrix 225 rows 85 cols
[2024-06-01 06:41:02] [INFO ] Computed 10 invariants in 2 ms
[2024-06-01 06:41:02] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-06-01 06:41:02] [INFO ] Flow matrix only has 225 transitions (discarded 17 similar events)
[2024-06-01 06:41:02] [INFO ] Invariant cache hit.
[2024-06-01 06:41:02] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-06-01 06:41:02] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 85/137 places, 242/950 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 65500 ms. Remains : 85/137 places, 242/950 transitions.
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
FORMULA BugTracking-PT-q3m256-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 06:41:02] [INFO ] Flow matrix only has 225 transitions (discarded 17 similar events)
Found an invariant !
This invariant on transitions {4=1, 154=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {1=1, 154=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[8, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
[2024-06-01 06:41:03] [INFO ] Flow matrix only has 225 transitions (discarded 17 similar events)
// Phase 1: matrix 225 rows 83 cols
[2024-06-01 06:41:03] [INFO ] Computed 8 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[8, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
RANDOM walk for 1000029 steps (2 resets) in 414 ms. (2409 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 579 ms. (1724 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[8, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
[2024-06-01 06:41:04] [INFO ] Flow matrix only has 225 transitions (discarded 17 similar events)
[2024-06-01 06:41:04] [INFO ] Invariant cache hit.
[2024-06-01 06:41:04] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-06-01 06:41:04] [INFO ] [Real]Absence check using 7 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 06:41:04] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2024-06-01 06:41:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:41:04] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 06:41:04] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 06:41:04] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2024-06-01 06:41:04] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-06-01 06:41:04] [INFO ] [Nat]Added 48 Read/Feed constraints in 7 ms returned sat
[2024-06-01 06:41:04] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:41:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2024-06-01 06:41:04] [INFO ] Computed and/alt/rep : 187/1011/187 causal constraints (skipped 37 transitions) in 13 ms.
[2024-06-01 06:41:04] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:41:04] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:41:04] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:41:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 214 ms
[2024-06-01 06:41:04] [INFO ] Added : 76 causal constraints over 16 iterations in 505 ms. Result :sat
Minimization took 75 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[8, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[8, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 242/242 transitions.
Applied a total of 0 rules in 4 ms. Remains 83 /83 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 83/83 places, 242/242 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 242/242 transitions.
Applied a total of 0 rules in 3 ms. Remains 83 /83 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-06-01 06:41:04] [INFO ] Flow matrix only has 225 transitions (discarded 17 similar events)
[2024-06-01 06:41:04] [INFO ] Invariant cache hit.
[2024-06-01 06:41:05] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-06-01 06:41:05] [INFO ] Flow matrix only has 225 transitions (discarded 17 similar events)
[2024-06-01 06:41:05] [INFO ] Invariant cache hit.
[2024-06-01 06:41:05] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-06-01 06:41:05] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
[2024-06-01 06:41:05] [INFO ] Redundant transitions in 1 ms returned []
Running 241 sub problems to find dead transitions.
[2024-06-01 06:41:05] [INFO ] Flow matrix only has 225 transitions (discarded 17 similar events)
[2024-06-01 06:41:05] [INFO ] Invariant cache hit.
[2024-06-01 06:41:05] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 241 unsolved
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
At refinement iteration 3 (OVERLAPS) 225/308 variables, 83/91 constraints. Problems are: Problem set: 2 solved, 239 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 48/139 constraints. Problems are: Problem set: 2 solved, 239 unsolved
[2024-06-01 06:41:07] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 1/140 constraints. Problems are: Problem set: 2 solved, 239 unsolved
[2024-06-01 06:41:08] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 1/141 constraints. Problems are: Problem set: 2 solved, 239 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 0/141 constraints. Problems are: Problem set: 2 solved, 239 unsolved
[2024-06-01 06:41:11] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/308 variables, 1/142 constraints. Problems are: Problem set: 2 solved, 239 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 0/142 constraints. Problems are: Problem set: 2 solved, 239 unsolved
At refinement iteration 10 (OVERLAPS) 0/308 variables, 0/142 constraints. Problems are: Problem set: 2 solved, 239 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 142 constraints, problems are : Problem set: 2 solved, 239 unsolved in 9261 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 2 solved, 239 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 239 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 1/8 constraints. Problems are: Problem set: 2 solved, 239 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 3/11 constraints. Problems are: Problem set: 2 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 239 unsolved
At refinement iteration 4 (OVERLAPS) 225/308 variables, 83/94 constraints. Problems are: Problem set: 2 solved, 239 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 48/142 constraints. Problems are: Problem set: 2 solved, 239 unsolved
Problem TDEAD110 is UNSAT
Problem TDEAD115 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 239/381 constraints. Problems are: Problem set: 4 solved, 237 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 0/381 constraints. Problems are: Problem set: 4 solved, 237 unsolved
At refinement iteration 8 (OVERLAPS) 0/308 variables, 0/381 constraints. Problems are: Problem set: 4 solved, 237 unsolved
No progress, stopping.
After SMT solving in domain Int declared 308/308 variables, and 381 constraints, problems are : Problem set: 4 solved, 237 unsolved in 9737 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 239/241 constraints, Known Traps: 3/3 constraints]
After SMT, in 19237ms problems are : Problem set: 4 solved, 237 unsolved
Search for dead transitions found 4 dead transitions in 19241ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 83/83 places, 238/242 transitions.
Reduce places removed 1 places and 7 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 82 transition count 231
Applied a total of 1 rules in 9 ms. Remains 82 /83 variables (removed 1) and now considering 231/238 (removed 7) transitions.
[2024-06-01 06:41:24] [INFO ] Flow matrix only has 215 transitions (discarded 16 similar events)
// Phase 1: matrix 215 rows 82 cols
[2024-06-01 06:41:24] [INFO ] Computed 8 invariants in 5 ms
[2024-06-01 06:41:24] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-01 06:41:24] [INFO ] Flow matrix only has 215 transitions (discarded 16 similar events)
[2024-06-01 06:41:24] [INFO ] Invariant cache hit.
[2024-06-01 06:41:24] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-06-01 06:41:24] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 82/83 places, 231/242 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 19906 ms. Remains : 82/83 places, 231/242 transitions.
[2024-06-01 06:41:24] [INFO ] Flow matrix only has 215 transitions (discarded 16 similar events)
Found an invariant !
This invariant on transitions {1=1, 144=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1, 144=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[8, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
[2024-06-01 06:41:25] [INFO ] Flow matrix only has 215 transitions (discarded 16 similar events)
[2024-06-01 06:41:25] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[8, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
RANDOM walk for 1000084 steps (2 resets) in 455 ms. (2193 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 774 ms. (1290 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[8, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
[2024-06-01 06:41:26] [INFO ] Flow matrix only has 215 transitions (discarded 16 similar events)
[2024-06-01 06:41:26] [INFO ] Invariant cache hit.
[2024-06-01 06:41:26] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 06:41:26] [INFO ] [Real]Absence check using 7 positive and 1 generalized place invariants in 3 ms returned sat
[2024-06-01 06:41:26] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-06-01 06:41:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:41:26] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-01 06:41:26] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 06:41:26] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2024-06-01 06:41:26] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-06-01 06:41:26] [INFO ] [Nat]Added 47 Read/Feed constraints in 22 ms returned sat
[2024-06-01 06:41:26] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:41:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2024-06-01 06:41:26] [INFO ] Computed and/alt/rep : 178/955/178 causal constraints (skipped 36 transitions) in 21 ms.
[2024-06-01 06:41:26] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 6 ms to minimize.
[2024-06-01 06:41:26] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-06-01 06:41:27] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-06-01 06:41:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 272 ms
[2024-06-01 06:41:27] [INFO ] Added : 50 causal constraints over 10 iterations in 485 ms. Result :sat
Minimization took 59 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[8, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[8, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 231/231 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 231/231 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 82/82 places, 231/231 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 231/231 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 231/231 (removed 0) transitions.
[2024-06-01 06:41:27] [INFO ] Flow matrix only has 215 transitions (discarded 16 similar events)
[2024-06-01 06:41:27] [INFO ] Invariant cache hit.
[2024-06-01 06:41:27] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-01 06:41:27] [INFO ] Flow matrix only has 215 transitions (discarded 16 similar events)
[2024-06-01 06:41:27] [INFO ] Invariant cache hit.
[2024-06-01 06:41:27] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-06-01 06:41:27] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
[2024-06-01 06:41:27] [INFO ] Redundant transitions in 1 ms returned []
Running 230 sub problems to find dead transitions.
[2024-06-01 06:41:27] [INFO ] Flow matrix only has 215 transitions (discarded 16 similar events)
[2024-06-01 06:41:27] [INFO ] Invariant cache hit.
[2024-06-01 06:41:27] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 230 unsolved
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
At refinement iteration 3 (OVERLAPS) 215/297 variables, 82/90 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 47/137 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 0/137 constraints. Problems are: Problem set: 12 solved, 218 unsolved
[2024-06-01 06:41:30] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/297 variables, 1/138 constraints. Problems are: Problem set: 12 solved, 218 unsolved
[2024-06-01 06:41:32] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 1/139 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 0/139 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 9 (OVERLAPS) 0/297 variables, 0/139 constraints. Problems are: Problem set: 12 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 297/297 variables, and 139 constraints, problems are : Problem set: 12 solved, 218 unsolved in 8642 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 12 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 2/10 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/10 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 215/297 variables, 82/92 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 47/139 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 218/357 constraints. Problems are: Problem set: 12 solved, 218 unsolved
[2024-06-01 06:41:38] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 1/358 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 0/358 constraints. Problems are: Problem set: 12 solved, 218 unsolved
[2024-06-01 06:41:49] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/297 variables, 1/359 constraints. Problems are: Problem set: 12 solved, 218 unsolved
[2024-06-01 06:41:53] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/297 variables, 1/360 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/297 variables, 0/360 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 12 (OVERLAPS) 0/297 variables, 0/360 constraints. Problems are: Problem set: 12 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 297/297 variables, and 360 constraints, problems are : Problem set: 12 solved, 218 unsolved in 22334 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 218/230 constraints, Known Traps: 5/5 constraints]
After SMT, in 31241ms problems are : Problem set: 12 solved, 218 unsolved
Search for dead transitions found 12 dead transitions in 31245ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 82/82 places, 219/231 transitions.
Applied a total of 0 rules in 4 ms. Remains 82 /82 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2024-06-01 06:41:58] [INFO ] Redundant transitions in 0 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 31563 ms. Remains : 82/82 places, 219/231 transitions.
[2024-06-01 06:41:58] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
Found an invariant !
This invariant on transitions {0=1, 10=1, 132=1, 187=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {4=1, 132=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[8, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
[2024-06-01 06:41:58] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
// Phase 1: matrix 203 rows 82 cols
[2024-06-01 06:41:58] [INFO ] Computed 8 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[8, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
RANDOM walk for 1000079 steps (2 resets) in 374 ms. (2666 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 625 ms. (1597 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[8, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
[2024-06-01 06:41:59] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-06-01 06:41:59] [INFO ] Invariant cache hit.
[2024-06-01 06:41:59] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-01 06:41:59] [INFO ] [Real]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 06:42:00] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-06-01 06:42:00] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-01 06:42:00] [INFO ] [Real]Added 45 Read/Feed constraints in 7 ms returned sat
[2024-06-01 06:42:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:42:00] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2024-06-01 06:42:00] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 06:42:00] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2024-06-01 06:42:00] [INFO ] [Nat]Added 45 Read/Feed constraints in 8 ms returned sat
[2024-06-01 06:42:00] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-06-01 06:42:00] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:42:00] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-06-01 06:42:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 256 ms
[2024-06-01 06:42:00] [INFO ] Computed and/alt/rep : 166/847/166 causal constraints (skipped 36 transitions) in 27 ms.
[2024-06-01 06:42:00] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:42:00] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 13 ms to minimize.
[2024-06-01 06:42:00] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 0 ms to minimize.
[2024-06-01 06:42:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 219 ms
[2024-06-01 06:42:00] [INFO ] Added : 57 causal constraints over 13 iterations in 448 ms. Result :sat
Minimization took 62 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[8, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[8, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 219/219 transitions.
Applied a total of 0 rules in 13 ms. Remains 82 /82 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 82/82 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 219/219 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2024-06-01 06:42:01] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-06-01 06:42:01] [INFO ] Invariant cache hit.
[2024-06-01 06:42:01] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-06-01 06:42:01] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-06-01 06:42:01] [INFO ] Invariant cache hit.
[2024-06-01 06:42:01] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-01 06:42:01] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
[2024-06-01 06:42:01] [INFO ] Redundant transitions in 0 ms returned []
Running 218 sub problems to find dead transitions.
[2024-06-01 06:42:01] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-06-01 06:42:01] [INFO ] Invariant cache hit.
[2024-06-01 06:42:01] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 203/285 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 45/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 135 constraints, problems are : Problem set: 0 solved, 218 unsolved in 5002 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 203/285 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 45/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 218/353 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 06:42:08] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 0/285 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 354 constraints, problems are : Problem set: 0 solved, 218 unsolved in 13532 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 1/1 constraints]
After SMT, in 18677ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 18679ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19052 ms. Remains : 82/82 places, 219/219 transitions.
[2024-06-01 06:42:20] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
Found an invariant !
This invariant on transitions {0=1, 10=1, 132=1, 187=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {4=1, 132=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[8, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
RANDOM walk for 40474 steps (8 resets) in 93 ms. (430 steps per ms) remains 1/1 properties
BEST_FIRST walk for 30555 steps (6 resets) in 121 ms. (250 steps per ms) remains 0/1 properties
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[8, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
Starting property specific reduction for BugTracking-PT-q3m256-UpperBounds-01
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-06-01 06:42:20] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-06-01 06:42:20] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10077 steps (2 resets) in 8 ms. (1119 steps per ms)
BEST_FIRST walk for 10000 steps (2 resets) in 16 ms. (588 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-06-01 06:42:20] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-06-01 06:42:20] [INFO ] Invariant cache hit.
[2024-06-01 06:42:20] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 06:42:20] [INFO ] [Real]Absence check using 7 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 06:42:20] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2024-06-01 06:42:20] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-01 06:42:20] [INFO ] [Real]Added 45 Read/Feed constraints in 8 ms returned sat
[2024-06-01 06:42:20] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:42:20] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 06:42:20] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 06:42:20] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2024-06-01 06:42:20] [INFO ] [Nat]Added 45 Read/Feed constraints in 7 ms returned sat
[2024-06-01 06:42:20] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 0 ms to minimize.
[2024-06-01 06:42:20] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-06-01 06:42:20] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2024-06-01 06:42:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 225 ms
[2024-06-01 06:42:20] [INFO ] Computed and/alt/rep : 166/847/166 causal constraints (skipped 36 transitions) in 17 ms.
[2024-06-01 06:42:21] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:42:21] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:42:21] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:42:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 214 ms
[2024-06-01 06:42:21] [INFO ] Added : 56 causal constraints over 12 iterations in 377 ms. Result :sat
Minimization took 73 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 219/219 transitions.
Applied a total of 0 rules in 9 ms. Remains 82 /82 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 82/82 places, 219/219 transitions.
[2024-06-01 06:42:21] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
Found an invariant !
This invariant on transitions {0=1, 10=1, 132=1, 187=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {4=1, 132=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2024-06-01 06:42:21] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-06-01 06:42:21] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[+inf]
RANDOM walk for 1000133 steps (2 resets) in 468 ms. (2132 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 629 ms. (1587 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[9] Max Struct:[+inf]
[2024-06-01 06:42:22] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-06-01 06:42:22] [INFO ] Invariant cache hit.
[2024-06-01 06:42:22] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-01 06:42:22] [INFO ] [Real]Absence check using 7 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 06:42:22] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-06-01 06:42:22] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-01 06:42:22] [INFO ] [Real]Added 45 Read/Feed constraints in 8 ms returned sat
[2024-06-01 06:42:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:42:23] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-01 06:42:23] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 06:42:23] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-06-01 06:42:23] [INFO ] [Nat]Added 45 Read/Feed constraints in 8 ms returned sat
[2024-06-01 06:42:23] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-06-01 06:42:23] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2024-06-01 06:42:23] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:42:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 247 ms
[2024-06-01 06:42:23] [INFO ] Computed and/alt/rep : 166/847/166 causal constraints (skipped 36 transitions) in 14 ms.
[2024-06-01 06:42:23] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 2 ms to minimize.
[2024-06-01 06:42:23] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
[2024-06-01 06:42:23] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:42:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 231 ms
[2024-06-01 06:42:23] [INFO ] Added : 57 causal constraints over 13 iterations in 435 ms. Result :sat
Minimization took 76 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[9] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[9] Max Struct:[+inf]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 219/219 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 82/82 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 219/219 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2024-06-01 06:42:24] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-06-01 06:42:24] [INFO ] Invariant cache hit.
[2024-06-01 06:42:24] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-06-01 06:42:24] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-06-01 06:42:24] [INFO ] Invariant cache hit.
[2024-06-01 06:42:24] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-01 06:42:24] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
[2024-06-01 06:42:24] [INFO ] Redundant transitions in 0 ms returned []
Running 218 sub problems to find dead transitions.
[2024-06-01 06:42:24] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-06-01 06:42:24] [INFO ] Invariant cache hit.
[2024-06-01 06:42:24] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 203/285 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 45/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 135 constraints, problems are : Problem set: 0 solved, 218 unsolved in 5125 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 203/285 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 45/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 218/353 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 06:42:31] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 0/285 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 354 constraints, problems are : Problem set: 0 solved, 218 unsolved in 7709 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 1/1 constraints]
After SMT, in 13036ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 13040ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13335 ms. Remains : 82/82 places, 219/219 transitions.
[2024-06-01 06:42:37] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
Found an invariant !
This invariant on transitions {0=1, 10=1, 132=1, 187=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {4=1, 132=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[9] Max Struct:[+inf]
[2024-06-01 06:42:37] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-06-01 06:42:37] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[9] Max Struct:[+inf]
RANDOM walk for 1000252 steps (2 resets) in 498 ms. (2004 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 680 ms. (1468 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[9] Max Struct:[+inf]
[2024-06-01 06:42:38] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-06-01 06:42:38] [INFO ] Invariant cache hit.
[2024-06-01 06:42:38] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-01 06:42:38] [INFO ] [Real]Absence check using 7 positive and 1 generalized place invariants in 9 ms returned sat
[2024-06-01 06:42:38] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2024-06-01 06:42:38] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-01 06:42:38] [INFO ] [Real]Added 45 Read/Feed constraints in 6 ms returned sat
[2024-06-01 06:42:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:42:38] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-01 06:42:38] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 3 ms returned sat
[2024-06-01 06:42:38] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-06-01 06:42:38] [INFO ] [Nat]Added 45 Read/Feed constraints in 9 ms returned sat
[2024-06-01 06:42:38] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:42:39] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 0 ms to minimize.
[2024-06-01 06:42:39] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:42:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 209 ms
[2024-06-01 06:42:39] [INFO ] Computed and/alt/rep : 166/847/166 causal constraints (skipped 36 transitions) in 17 ms.
[2024-06-01 06:42:39] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 1 ms to minimize.
[2024-06-01 06:42:39] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 0 ms to minimize.
[2024-06-01 06:42:39] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:42:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 298 ms
[2024-06-01 06:42:39] [INFO ] Added : 57 causal constraints over 13 iterations in 509 ms. Result :sat
Minimization took 84 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[9] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[9] Max Struct:[+inf]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 219/219 transitions.
Applied a total of 0 rules in 6 ms. Remains 82 /82 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 82/82 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 219/219 transitions.
Applied a total of 0 rules in 6 ms. Remains 82 /82 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2024-06-01 06:42:39] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-06-01 06:42:39] [INFO ] Invariant cache hit.
[2024-06-01 06:42:39] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-01 06:42:39] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-06-01 06:42:39] [INFO ] Invariant cache hit.
[2024-06-01 06:42:40] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-01 06:42:40] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
[2024-06-01 06:42:40] [INFO ] Redundant transitions in 1 ms returned []
Running 218 sub problems to find dead transitions.
[2024-06-01 06:42:40] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-06-01 06:42:40] [INFO ] Invariant cache hit.
[2024-06-01 06:42:40] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 203/285 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 45/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 135 constraints, problems are : Problem set: 0 solved, 218 unsolved in 4176 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 203/285 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 45/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 218/353 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 06:42:46] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 0/285 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 354 constraints, problems are : Problem set: 0 solved, 218 unsolved in 7355 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 1/1 constraints]
After SMT, in 11733ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 11737ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12075 ms. Remains : 82/82 places, 219/219 transitions.
[2024-06-01 06:42:51] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
Found an invariant !
This invariant on transitions {0=1, 10=1, 132=1, 187=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {4=1, 132=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[9] Max Struct:[+inf]
RANDOM walk for 40405 steps (8 resets) in 45 ms. (878 steps per ms) remains 1/1 properties
BEST_FIRST walk for 24494 steps (5 resets) in 113 ms. (214 steps per ms) remains 0/1 properties
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[9] Max Struct:[+inf]
Ending property specific reduction for BugTracking-PT-q3m256-UpperBounds-01 in 31689 ms.
[2024-06-01 06:42:52] [INFO ] Flatten gal took : 106 ms
[2024-06-01 06:42:52] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2024-06-01 06:42:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 82 places, 219 transitions and 1042 arcs took 7 ms.
Total runtime 384880 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : BugTracking-PT-q3m256-UpperBounds-01

BK_STOP 1717224173080

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2024
ub formula name BugTracking-PT-q3m256-UpperBounds-01
ub formula formula --maxsum=/tmp/1235/ub_0_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BugTracking-PT-q3m256"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is BugTracking-PT-q3m256, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r472-tajo-171620399400381"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q3m256.tgz
mv BugTracking-PT-q3m256 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;