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-171620399400373.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-q3m128, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399400373
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 12 02:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 12 02:12 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-q3m128-UpperBounds-00
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-01
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-02
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-03
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-04
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-05
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-06
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-07
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-08
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-09
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-10
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-11
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-12
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-13
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-14
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717223677312

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-q3m128
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:34:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 06:34:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:34:40] [INFO ] Load time of PNML (sax parser for PT used): 1114 ms
[2024-06-01 06:34:40] [INFO ] Transformed 754 places.
[2024-06-01 06:34:40] [INFO ] Transformed 27370 transitions.
[2024-06-01 06:34:40] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1401 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Deduced a syphon composed of 514 places in 100 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m128-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-06-01 06:34:40] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
// Phase 1: matrix 2642 rows 240 cols
[2024-06-01 06:34:40] [INFO ] Computed 10 invariants in 71 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, +inf, 1]
RANDOM walk for 10000 steps (9 resets) in 71 ms. (138 steps per ms)
BEST_FIRST walk for 80008 steps (16 resets) in 165 ms. (481 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 1, 29, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, +inf, 1]
[2024-06-01 06:34:41] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
[2024-06-01 06:34:41] [INFO ] Invariant cache hit.
[2024-06-01 06:34:41] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-06-01 06:34:41] [INFO ] [Real]Absence check using state equation in 478 ms returned sat
[2024-06-01 06:34:41] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-06-01 06:34:42] [INFO ] [Real]Added 255 Read/Feed constraints in 89 ms returned sat
[2024-06-01 06:34:42] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:34:42] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-01 06:34:42] [INFO ] [Nat]Absence check using state equation in 706 ms returned sat
[2024-06-01 06:34:43] [INFO ] [Nat]Added 255 Read/Feed constraints in 100 ms returned sat
[2024-06-01 06:34:43] [INFO ] Deduced a trap composed of 13 places in 313 ms of which 16 ms to minimize.
[2024-06-01 06:34:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 509 ms
[2024-06-01 06:34:44] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 429 ms.
[2024-06-01 06:34:44] [INFO ] Added : 10 causal constraints over 2 iterations in 913 ms. Result :sat
Minimization took 652 ms.
[2024-06-01 06:34:45] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 06:34:45] [INFO ] [Real]Absence check using state equation in 655 ms returned sat
[2024-06-01 06:34:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:34:46] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-01 06:34:46] [INFO ] [Nat]Absence check using state equation in 333 ms returned sat
[2024-06-01 06:34:46] [INFO ] [Nat]Added 255 Read/Feed constraints in 115 ms returned sat
[2024-06-01 06:34:47] [INFO ] Deduced a trap composed of 23 places in 393 ms of which 2 ms to minimize.
[2024-06-01 06:34:47] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 1 ms to minimize.
[2024-06-01 06:34:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 794 ms
[2024-06-01 06:34:47] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 236 ms.
[2024-06-01 06:34:48] [INFO ] Deduced a trap composed of 48 places in 287 ms of which 2 ms to minimize.
[2024-06-01 06:34:48] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-06-01 06:34:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 651 ms
[2024-06-01 06:34:49] [INFO ] Added : 15 causal constraints over 3 iterations in 1920 ms. Result :sat
Minimization took 889 ms.
[2024-06-01 06:34:50] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 06:34:50] [INFO ] [Real]Absence check using state equation in 516 ms returned sat
[2024-06-01 06:34:50] [INFO ] [Real]Added 255 Read/Feed constraints in 42 ms returned sat
[2024-06-01 06:34:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:34:50] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-01 06:34:51] [INFO ] [Nat]Absence check using state equation in 501 ms returned sat
[2024-06-01 06:34:51] [INFO ] [Nat]Added 255 Read/Feed constraints in 148 ms returned sat
[2024-06-01 06:34:51] [INFO ] Deduced a trap composed of 27 places in 308 ms of which 2 ms to minimize.
[2024-06-01 06:34:52] [INFO ] Deduced a trap composed of 62 places in 305 ms of which 1 ms to minimize.
[2024-06-01 06:34:52] [INFO ] Deduced a trap composed of 74 places in 302 ms of which 2 ms to minimize.
[2024-06-01 06:34:52] [INFO ] Deduced a trap composed of 9 places in 254 ms of which 1 ms to minimize.
[2024-06-01 06:34:53] [INFO ] Deduced a trap composed of 52 places in 231 ms of which 4 ms to minimize.
[2024-06-01 06:34:53] [INFO ] Deduced a trap composed of 12 places in 277 ms of which 2 ms to minimize.
[2024-06-01 06:34:53] [INFO ] Deduced a trap composed of 38 places in 272 ms of which 1 ms to minimize.
[2024-06-01 06:34:54] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2390 ms
[2024-06-01 06:34:54] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 171 ms.
[2024-06-01 06:34:54] [INFO ] Added : 8 causal constraints over 2 iterations in 657 ms. Result :sat
Minimization took 914 ms.
[2024-06-01 06:34:55] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-06-01 06:34:56] [INFO ] [Real]Absence check using state equation in 512 ms returned sat
[2024-06-01 06:34:56] [INFO ] [Real]Added 255 Read/Feed constraints in 63 ms returned sat
[2024-06-01 06:34:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:34:56] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-01 06:34:56] [INFO ] [Nat]Absence check using state equation in 459 ms returned sat
[2024-06-01 06:34:57] [INFO ] [Nat]Added 255 Read/Feed constraints in 174 ms returned sat
[2024-06-01 06:34:57] [INFO ] Deduced a trap composed of 8 places in 484 ms of which 3 ms to minimize.
[2024-06-01 06:34:58] [INFO ] Deduced a trap composed of 89 places in 490 ms of which 3 ms to minimize.
[2024-06-01 06:34:58] [INFO ] Deduced a trap composed of 41 places in 443 ms of which 2 ms to minimize.
[2024-06-01 06:34:59] [INFO ] Deduced a trap composed of 18 places in 379 ms of which 2 ms to minimize.
[2024-06-01 06:34:59] [INFO ] Deduced a trap composed of 64 places in 384 ms of which 2 ms to minimize.
[2024-06-01 06:35:00] [INFO ] Deduced a trap composed of 119 places in 407 ms of which 2 ms to minimize.
[2024-06-01 06:35:00] [INFO ] Deduced a trap composed of 87 places in 383 ms of which 2 ms to minimize.
[2024-06-01 06:35:00] [INFO ] Deduced a trap composed of 48 places in 387 ms of which 1 ms to minimize.
[2024-06-01 06:35:01] [INFO ] Deduced a trap composed of 115 places in 466 ms of which 2 ms to minimize.
[2024-06-01 06:35:01] [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 3
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:35:01] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-01 06:35:02] [INFO ] [Real]Absence check using state equation in 379 ms returned sat
[2024-06-01 06:35:02] [INFO ] [Real]Added 255 Read/Feed constraints in 44 ms returned sat
[2024-06-01 06:35:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:35:02] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-01 06:35:02] [INFO ] [Nat]Absence check using state equation in 355 ms returned sat
[2024-06-01 06:35:02] [INFO ] [Nat]Added 255 Read/Feed constraints in 45 ms returned sat
[2024-06-01 06:35:02] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 193 ms.
[2024-06-01 06:35:03] [INFO ] Added : 2 causal constraints over 1 iterations in 407 ms. Result :sat
Minimization took 634 ms.
[2024-06-01 06:35:03] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-01 06:35:04] [INFO ] [Real]Absence check using state equation in 476 ms returned sat
[2024-06-01 06:35:04] [INFO ] [Real]Added 255 Read/Feed constraints in 72 ms returned sat
[2024-06-01 06:35:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:35:04] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-01 06:35:04] [INFO ] [Nat]Absence check using state equation in 334 ms returned sat
[2024-06-01 06:35:04] [INFO ] [Nat]Added 255 Read/Feed constraints in 56 ms returned sat
[2024-06-01 06:35:05] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 169 ms.
[2024-06-01 06:35:05] [INFO ] Added : 3 causal constraints over 1 iterations in 412 ms. Result :sat
Minimization took 626 ms.
[2024-06-01 06:35:06] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-01 06:35:06] [INFO ] [Real]Absence check using state equation in 436 ms returned sat
[2024-06-01 06:35:06] [INFO ] [Real]Added 255 Read/Feed constraints in 40 ms returned sat
[2024-06-01 06:35:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:35:06] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-01 06:35:07] [INFO ] [Nat]Absence check using state equation in 314 ms returned sat
[2024-06-01 06:35:07] [INFO ] [Nat]Added 255 Read/Feed constraints in 101 ms returned sat
[2024-06-01 06:35:07] [INFO ] Deduced a trap composed of 19 places in 348 ms of which 2 ms to minimize.
[2024-06-01 06:35:07] [INFO ] Deduced a trap composed of 20 places in 311 ms of which 2 ms to minimize.
[2024-06-01 06:35:08] [INFO ] Deduced a trap composed of 72 places in 346 ms of which 2 ms to minimize.
[2024-06-01 06:35:08] [INFO ] Deduced a trap composed of 73 places in 314 ms of which 2 ms to minimize.
[2024-06-01 06:35:09] [INFO ] Deduced a trap composed of 35 places in 309 ms of which 1 ms to minimize.
[2024-06-01 06:35:09] [INFO ] Deduced a trap composed of 38 places in 281 ms of which 1 ms to minimize.
[2024-06-01 06:35:10] [INFO ] Deduced a trap composed of 46 places in 262 ms of which 2 ms to minimize.
[2024-06-01 06:35:10] [INFO ] Deduced a trap composed of 17 places in 237 ms of which 2 ms to minimize.
[2024-06-01 06:35:10] [INFO ] Deduced a trap composed of 7 places in 202 ms of which 1 ms to minimize.
[2024-06-01 06:35:11] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 1 ms to minimize.
[2024-06-01 06:35:11] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4041 ms
[2024-06-01 06:35:11] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 248 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2024-06-01 06:35:11] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-01 06:35:12] [INFO ] [Real]Absence check using state equation in 431 ms returned sat
[2024-06-01 06:35:12] [INFO ] [Real]Added 255 Read/Feed constraints in 52 ms returned sat
[2024-06-01 06:35:12] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:35:12] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-01 06:35:12] [INFO ] [Nat]Absence check using state equation in 474 ms returned sat
[2024-06-01 06:35:12] [INFO ] [Nat]Added 255 Read/Feed constraints in 56 ms returned sat
[2024-06-01 06:35:13] [INFO ] Deduced a trap composed of 11 places in 345 ms of which 1 ms to minimize.
[2024-06-01 06:35:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 467 ms
[2024-06-01 06:35:13] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 211 ms.
[2024-06-01 06:35:13] [INFO ] Added : 2 causal constraints over 1 iterations in 557 ms. Result :sat
Minimization took 850 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 1, 29, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 1, 29, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, +inf, 1]
Support contains 8 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
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 237 transition count 2772
Free-agglomeration rule applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 10 place count 237 transition count 2765
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 17 place count 230 transition count 2765
Applied a total of 17 rules in 307 ms. Remains 230 /240 variables (removed 10) and now considering 2765/2769 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 320 ms. Remains : 230/240 places, 2765/2769 transitions.
[2024-06-01 06:35:15] [INFO ] Flow matrix only has 2634 transitions (discarded 131 similar events)
Found an invariant !
This invariant on transitions {3=1, 1721=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {8=1, 1721=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 268 ms. (steps per millisecond=37 ) properties (out of 8) seen :[0, 0, 0, 0, 0, 2147483647, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 1, +inf, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, +inf, 1]
[2024-06-01 06:35:16] [INFO ] Flow matrix only has 2634 transitions (discarded 131 similar events)
// Phase 1: matrix 2634 rows 230 cols
[2024-06-01 06:35:16] [INFO ] Computed 8 invariants in 18 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 1, +inf, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, +inf, 1]
RANDOM walk for 1000028 steps (2 resets) in 845 ms. (1182 steps per ms)
FORMULA BugTracking-PT-q3m128-UpperBounds-13 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 7000006 steps (14 resets) in 14177 ms. (493 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, 1]
[2024-06-01 06:35:31] [INFO ] Flow matrix only has 2634 transitions (discarded 131 similar events)
[2024-06-01 06:35:31] [INFO ] Invariant cache hit.
[2024-06-01 06:35:31] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-01 06:35:31] [INFO ] [Real]Absence check using state equation in 464 ms returned sat
[2024-06-01 06:35:31] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-06-01 06:35:31] [INFO ] [Real]Added 255 Read/Feed constraints in 42 ms returned sat
[2024-06-01 06:35:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:35:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-01 06:35:32] [INFO ] [Nat]Absence check using state equation in 365 ms returned sat
[2024-06-01 06:35:32] [INFO ] [Nat]Added 255 Read/Feed constraints in 119 ms returned sat
[2024-06-01 06:35:32] [INFO ] Deduced a trap composed of 60 places in 302 ms of which 2 ms to minimize.
[2024-06-01 06:35:33] [INFO ] Deduced a trap composed of 24 places in 258 ms of which 2 ms to minimize.
[2024-06-01 06:35:33] [INFO ] Deduced a trap composed of 19 places in 239 ms of which 2 ms to minimize.
[2024-06-01 06:35:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 991 ms
[2024-06-01 06:35:33] [INFO ] Computed and/alt/rep : 345/1349/345 causal constraints (skipped 2288 transitions) in 201 ms.
[2024-06-01 06:35:34] [INFO ] Deduced a trap composed of 19 places in 173 ms of which 1 ms to minimize.
[2024-06-01 06:35:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 312 ms
[2024-06-01 06:35:34] [INFO ] Added : 11 causal constraints over 4 iterations in 975 ms. Result :sat
Minimization took 1922 ms.
[2024-06-01 06:35:36] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-01 06:35:37] [INFO ] [Real]Absence check using state equation in 432 ms returned sat
[2024-06-01 06:35:37] [INFO ] [Real]Added 255 Read/Feed constraints in 46 ms returned sat
[2024-06-01 06:35:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:35:37] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-01 06:35:37] [INFO ] [Nat]Absence check using state equation in 412 ms returned sat
[2024-06-01 06:35:37] [INFO ] [Nat]Added 255 Read/Feed constraints in 76 ms returned sat
[2024-06-01 06:35:38] [INFO ] Deduced a trap composed of 22 places in 313 ms of which 2 ms to minimize.
[2024-06-01 06:35:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 433 ms
[2024-06-01 06:35:38] [INFO ] Computed and/alt/rep : 345/1349/345 causal constraints (skipped 2288 transitions) in 176 ms.
[2024-06-01 06:35:39] [INFO ] Deduced a trap composed of 10 places in 342 ms of which 2 ms to minimize.
[2024-06-01 06:35:39] [INFO ] Deduced a trap composed of 15 places in 363 ms of which 1 ms to minimize.
[2024-06-01 06:35:39] [INFO ] Deduced a trap composed of 5 places in 155 ms of which 1 ms to minimize.
[2024-06-01 06:35:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1159 ms
[2024-06-01 06:35:39] [INFO ] Added : 11 causal constraints over 3 iterations in 1809 ms. Result :sat
Minimization took 2029 ms.
[2024-06-01 06:35:42] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-01 06:35:42] [INFO ] [Real]Absence check using state equation in 417 ms returned sat
[2024-06-01 06:35:42] [INFO ] [Real]Added 255 Read/Feed constraints in 44 ms returned sat
[2024-06-01 06:35:42] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:35:42] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-01 06:35:43] [INFO ] [Nat]Absence check using state equation in 374 ms returned sat
[2024-06-01 06:35:43] [INFO ] [Nat]Added 255 Read/Feed constraints in 143 ms returned sat
[2024-06-01 06:35:43] [INFO ] Deduced a trap composed of 39 places in 143 ms of which 1 ms to minimize.
[2024-06-01 06:35:43] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 1 ms to minimize.
[2024-06-01 06:35:43] [INFO ] Deduced a trap composed of 39 places in 147 ms of which 1 ms to minimize.
[2024-06-01 06:35:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 609 ms
[2024-06-01 06:35:44] [INFO ] Computed and/alt/rep : 345/1349/345 causal constraints (skipped 2288 transitions) in 185 ms.
[2024-06-01 06:35:44] [INFO ] Added : 9 causal constraints over 2 iterations in 606 ms. Result :sat
Minimization took 2601 ms.
[2024-06-01 06:35:47] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-01 06:35:47] [INFO ] [Real]Absence check using state equation in 502 ms returned sat
[2024-06-01 06:35:47] [INFO ] [Real]Added 255 Read/Feed constraints in 43 ms returned sat
[2024-06-01 06:35:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:35:47] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-01 06:35:48] [INFO ] [Nat]Absence check using state equation in 383 ms returned sat
[2024-06-01 06:35:48] [INFO ] [Nat]Added 255 Read/Feed constraints in 119 ms returned sat
[2024-06-01 06:35:48] [INFO ] Deduced a trap composed of 32 places in 362 ms of which 2 ms to minimize.
[2024-06-01 06:35:49] [INFO ] Deduced a trap composed of 18 places in 322 ms of which 1 ms to minimize.
[2024-06-01 06:35:49] [INFO ] Deduced a trap composed of 10 places in 364 ms of which 2 ms to minimize.
[2024-06-01 06:35:50] [INFO ] Deduced a trap composed of 77 places in 301 ms of which 2 ms to minimize.
[2024-06-01 06:35:50] [INFO ] Deduced a trap composed of 17 places in 328 ms of which 2 ms to minimize.
[2024-06-01 06:35:50] [INFO ] Deduced a trap composed of 52 places in 270 ms of which 1 ms to minimize.
[2024-06-01 06:35:51] [INFO ] Deduced a trap composed of 76 places in 241 ms of which 1 ms to minimize.
[2024-06-01 06:35:51] [INFO ] Deduced a trap composed of 67 places in 230 ms of which 2 ms to minimize.
[2024-06-01 06:35:51] [INFO ] Deduced a trap composed of 68 places in 246 ms of which 1 ms to minimize.
[2024-06-01 06:35:51] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3237 ms
[2024-06-01 06:35:51] [INFO ] Computed and/alt/rep : 345/1349/345 causal constraints (skipped 2288 transitions) in 159 ms.
[2024-06-01 06:35:52] [INFO ] Added : 11 causal constraints over 4 iterations in 751 ms. Result :sat
Minimization took 2039 ms.
[2024-06-01 06:35:54] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-01 06:35:55] [INFO ] [Real]Absence check using state equation in 465 ms returned sat
[2024-06-01 06:35:55] [INFO ] [Real]Added 255 Read/Feed constraints in 70 ms returned sat
[2024-06-01 06:35:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:35:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-01 06:35:55] [INFO ] [Nat]Absence check using state equation in 392 ms returned sat
[2024-06-01 06:35:55] [INFO ] [Nat]Added 255 Read/Feed constraints in 45 ms returned sat
[2024-06-01 06:35:56] [INFO ] Deduced a trap composed of 11 places in 291 ms of which 1 ms to minimize.
[2024-06-01 06:35:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 395 ms
[2024-06-01 06:35:56] [INFO ] Computed and/alt/rep : 345/1349/345 causal constraints (skipped 2288 transitions) in 235 ms.
[2024-06-01 06:35:56] [INFO ] Added : 2 causal constraints over 1 iterations in 537 ms. Result :sat
Minimization took 1979 ms.
[2024-06-01 06:35:58] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-01 06:35:59] [INFO ] [Real]Absence check using state equation in 423 ms returned sat
[2024-06-01 06:35:59] [INFO ] [Real]Added 255 Read/Feed constraints in 35 ms returned sat
[2024-06-01 06:35:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:35:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-01 06:35:59] [INFO ] [Nat]Absence check using state equation in 415 ms returned sat
[2024-06-01 06:35:59] [INFO ] [Nat]Added 255 Read/Feed constraints in 109 ms returned sat
[2024-06-01 06:36:00] [INFO ] Deduced a trap composed of 10 places in 326 ms of which 2 ms to minimize.
[2024-06-01 06:36:00] [INFO ] Deduced a trap composed of 16 places in 288 ms of which 1 ms to minimize.
[2024-06-01 06:36:01] [INFO ] Deduced a trap composed of 23 places in 249 ms of which 1 ms to minimize.
[2024-06-01 06:36:01] [INFO ] Deduced a trap composed of 29 places in 217 ms of which 2 ms to minimize.
[2024-06-01 06:36:01] [INFO ] Deduced a trap composed of 28 places in 294 ms of which 1 ms to minimize.
[2024-06-01 06:36:01] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1713 ms
[2024-06-01 06:36:01] [INFO ] Computed and/alt/rep : 345/1349/345 causal constraints (skipped 2288 transitions) in 190 ms.
[2024-06-01 06:36:02] [INFO ] Added : 2 causal constraints over 1 iterations in 453 ms. Result :sat
Minimization took 2504 ms.
[2024-06-01 06:36:04] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-01 06:36:05] [INFO ] [Real]Absence check using state equation in 446 ms returned sat
[2024-06-01 06:36:05] [INFO ] [Real]Added 255 Read/Feed constraints in 31 ms returned sat
[2024-06-01 06:36:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:36:05] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-01 06:36:05] [INFO ] [Nat]Absence check using state equation in 459 ms returned sat
[2024-06-01 06:36:05] [INFO ] [Nat]Added 255 Read/Feed constraints in 40 ms returned sat
[2024-06-01 06:36:06] [INFO ] Computed and/alt/rep : 345/1349/345 causal constraints (skipped 2288 transitions) in 181 ms.
[2024-06-01 06:36:06] [INFO ] Deduced a trap composed of 49 places in 211 ms of which 2 ms to minimize.
[2024-06-01 06:36:06] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 1 ms to minimize.
[2024-06-01 06:36:07] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 1 ms to minimize.
[2024-06-01 06:36:07] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 1 ms to minimize.
[2024-06-01 06:36:07] [INFO ] Deduced a trap composed of 10 places in 191 ms of which 1 ms to minimize.
[2024-06-01 06:36:07] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1313 ms
[2024-06-01 06:36:07] [INFO ] Added : 5 causal constraints over 2 iterations in 1896 ms. Result :sat
Minimization took 2440 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, 1]
Support contains 7 out of 230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 2765/2765 transitions.
Applied a total of 0 rules in 74 ms. Remains 230 /230 variables (removed 0) and now considering 2765/2765 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 230/230 places, 2765/2765 transitions.
[2024-06-01 06:36:11] [INFO ] Flow matrix only has 2634 transitions (discarded 131 similar events)
Found an invariant !
This invariant on transitions {3=1, 1721=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {8=1, 1721=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 7) seen :[0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, 1]
[2024-06-01 06:36:12] [INFO ] Flow matrix only has 2634 transitions (discarded 131 similar events)
[2024-06-01 06:36:12] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, 1]
RANDOM walk for 1000027 steps (2 resets) in 756 ms. (1321 steps per ms)
BEST_FIRST walk for 7000006 steps (14 resets) in 13085 ms. (534 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, 1]
[2024-06-01 06:36:26] [INFO ] Flow matrix only has 2634 transitions (discarded 131 similar events)
[2024-06-01 06:36:26] [INFO ] Invariant cache hit.
[2024-06-01 06:36:26] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-01 06:36:26] [INFO ] [Real]Absence check using state equation in 346 ms returned sat
[2024-06-01 06:36:26] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-06-01 06:36:26] [INFO ] [Real]Added 255 Read/Feed constraints in 70 ms returned sat
[2024-06-01 06:36:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:36:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-01 06:36:27] [INFO ] [Nat]Absence check using state equation in 414 ms returned sat
[2024-06-01 06:36:27] [INFO ] [Nat]Added 255 Read/Feed constraints in 153 ms returned sat
[2024-06-01 06:36:27] [INFO ] Deduced a trap composed of 60 places in 276 ms of which 2 ms to minimize.
[2024-06-01 06:36:28] [INFO ] Deduced a trap composed of 24 places in 299 ms of which 2 ms to minimize.
[2024-06-01 06:36:28] [INFO ] Deduced a trap composed of 19 places in 331 ms of which 1 ms to minimize.
[2024-06-01 06:36:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1119 ms
[2024-06-01 06:36:28] [INFO ] Computed and/alt/rep : 345/1349/345 causal constraints (skipped 2288 transitions) in 179 ms.
[2024-06-01 06:36:29] [INFO ] Deduced a trap composed of 19 places in 209 ms of which 1 ms to minimize.
[2024-06-01 06:36:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 347 ms
[2024-06-01 06:36:29] [INFO ] Added : 11 causal constraints over 4 iterations in 1240 ms. Result :sat
Minimization took 1857 ms.
[2024-06-01 06:36:31] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-01 06:36:32] [INFO ] [Real]Absence check using state equation in 415 ms returned sat
[2024-06-01 06:36:32] [INFO ] [Real]Added 255 Read/Feed constraints in 55 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 8 positive place invariants in 3 ms returned sat
[2024-06-01 06:36:32] [INFO ] [Nat]Absence check using state equation in 364 ms returned sat
[2024-06-01 06:36:32] [INFO ] [Nat]Added 255 Read/Feed constraints in 68 ms returned sat
[2024-06-01 06:36:33] [INFO ] Deduced a trap composed of 22 places in 240 ms of which 1 ms to minimize.
[2024-06-01 06:36:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 330 ms
[2024-06-01 06:36:33] [INFO ] Computed and/alt/rep : 345/1349/345 causal constraints (skipped 2288 transitions) in 162 ms.
[2024-06-01 06:36:34] [INFO ] Deduced a trap composed of 10 places in 317 ms of which 1 ms to minimize.
[2024-06-01 06:36:34] [INFO ] Deduced a trap composed of 15 places in 316 ms of which 1 ms to minimize.
[2024-06-01 06:36:34] [INFO ] Deduced a trap composed of 5 places in 143 ms of which 1 ms to minimize.
[2024-06-01 06:36:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1036 ms
[2024-06-01 06:36:34] [INFO ] Added : 11 causal constraints over 3 iterations in 1649 ms. Result :sat
Minimization took 2476 ms.
[2024-06-01 06:36:37] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-01 06:36:37] [INFO ] [Real]Absence check using state equation in 442 ms returned sat
[2024-06-01 06:36:37] [INFO ] [Real]Added 255 Read/Feed constraints in 44 ms returned sat
[2024-06-01 06:36:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:36:38] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-01 06:36:38] [INFO ] [Nat]Absence check using state equation in 452 ms returned sat
[2024-06-01 06:36:38] [INFO ] [Nat]Added 255 Read/Feed constraints in 189 ms returned sat
[2024-06-01 06:36:38] [INFO ] Deduced a trap composed of 39 places in 155 ms of which 1 ms to minimize.
[2024-06-01 06:36:39] [INFO ] Deduced a trap composed of 19 places in 157 ms of which 0 ms to minimize.
[2024-06-01 06:36:39] [INFO ] Deduced a trap composed of 39 places in 131 ms of which 1 ms to minimize.
[2024-06-01 06:36:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 676 ms
[2024-06-01 06:36:39] [INFO ] Computed and/alt/rep : 345/1349/345 causal constraints (skipped 2288 transitions) in 209 ms.
[2024-06-01 06:36:39] [INFO ] Added : 9 causal constraints over 2 iterations in 472 ms. Result :sat
Minimization took 2570 ms.
[2024-06-01 06:36:42] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-01 06:36:43] [INFO ] [Real]Absence check using state equation in 414 ms returned sat
[2024-06-01 06:36:43] [INFO ] [Real]Added 255 Read/Feed constraints in 45 ms returned sat
[2024-06-01 06:36:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:36:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-01 06:36:43] [INFO ] [Nat]Absence check using state equation in 426 ms returned sat
[2024-06-01 06:36:43] [INFO ] [Nat]Added 255 Read/Feed constraints in 117 ms returned sat
[2024-06-01 06:36:44] [INFO ] Deduced a trap composed of 32 places in 311 ms of which 2 ms to minimize.
[2024-06-01 06:36:44] [INFO ] Deduced a trap composed of 18 places in 274 ms of which 2 ms to minimize.
[2024-06-01 06:36:44] [INFO ] Deduced a trap composed of 10 places in 283 ms of which 1 ms to minimize.
[2024-06-01 06:36:45] [INFO ] Deduced a trap composed of 77 places in 258 ms of which 1 ms to minimize.
[2024-06-01 06:36:45] [INFO ] Deduced a trap composed of 17 places in 258 ms of which 1 ms to minimize.
[2024-06-01 06:36:45] [INFO ] Deduced a trap composed of 52 places in 221 ms of which 1 ms to minimize.
[2024-06-01 06:36:45] [INFO ] Deduced a trap composed of 76 places in 216 ms of which 1 ms to minimize.
[2024-06-01 06:36:46] [INFO ] Deduced a trap composed of 67 places in 218 ms of which 1 ms to minimize.
[2024-06-01 06:36:46] [INFO ] Deduced a trap composed of 68 places in 214 ms of which 1 ms to minimize.
[2024-06-01 06:36:46] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2753 ms
[2024-06-01 06:36:46] [INFO ] Computed and/alt/rep : 345/1349/345 causal constraints (skipped 2288 transitions) in 181 ms.
[2024-06-01 06:36:47] [INFO ] Added : 11 causal constraints over 4 iterations in 628 ms. Result :sat
Minimization took 2532 ms.
[2024-06-01 06:36:49] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-01 06:36:50] [INFO ] [Real]Absence check using state equation in 434 ms returned sat
[2024-06-01 06:36:50] [INFO ] [Real]Added 255 Read/Feed constraints in 45 ms returned sat
[2024-06-01 06:36:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:36:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-01 06:36:50] [INFO ] [Nat]Absence check using state equation in 352 ms returned sat
[2024-06-01 06:36:50] [INFO ] [Nat]Added 255 Read/Feed constraints in 44 ms returned sat
[2024-06-01 06:36:51] [INFO ] Deduced a trap composed of 11 places in 194 ms of which 2 ms to minimize.
[2024-06-01 06:36:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 291 ms
[2024-06-01 06:36:51] [INFO ] Computed and/alt/rep : 345/1349/345 causal constraints (skipped 2288 transitions) in 195 ms.
[2024-06-01 06:36:51] [INFO ] Added : 2 causal constraints over 1 iterations in 430 ms. Result :sat
Minimization took 2045 ms.
[2024-06-01 06:36:53] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-06-01 06:36:54] [INFO ] [Real]Absence check using state equation in 414 ms returned sat
[2024-06-01 06:36:54] [INFO ] [Real]Added 255 Read/Feed constraints in 34 ms returned sat
[2024-06-01 06:36:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:36:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-01 06:36:54] [INFO ] [Nat]Absence check using state equation in 355 ms returned sat
[2024-06-01 06:36:54] [INFO ] [Nat]Added 255 Read/Feed constraints in 91 ms returned sat
[2024-06-01 06:36:55] [INFO ] Deduced a trap composed of 10 places in 236 ms of which 2 ms to minimize.
[2024-06-01 06:36:55] [INFO ] Deduced a trap composed of 16 places in 232 ms of which 1 ms to minimize.
[2024-06-01 06:36:55] [INFO ] Deduced a trap composed of 23 places in 217 ms of which 1 ms to minimize.
[2024-06-01 06:36:55] [INFO ] Deduced a trap composed of 29 places in 208 ms of which 2 ms to minimize.
[2024-06-01 06:36:56] [INFO ] Deduced a trap composed of 28 places in 240 ms of which 1 ms to minimize.
[2024-06-01 06:36:56] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1401 ms
[2024-06-01 06:36:56] [INFO ] Computed and/alt/rep : 345/1349/345 causal constraints (skipped 2288 transitions) in 185 ms.
[2024-06-01 06:36:56] [INFO ] Added : 2 causal constraints over 1 iterations in 400 ms. Result :sat
Minimization took 1925 ms.
[2024-06-01 06:36:58] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-01 06:36:58] [INFO ] [Real]Absence check using state equation in 327 ms returned sat
[2024-06-01 06:36:59] [INFO ] [Real]Added 255 Read/Feed constraints in 29 ms returned sat
[2024-06-01 06:36:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:36:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-01 06:36:59] [INFO ] [Nat]Absence check using state equation in 287 ms returned sat
[2024-06-01 06:36:59] [INFO ] [Nat]Added 255 Read/Feed constraints in 35 ms returned sat
[2024-06-01 06:36:59] [INFO ] Computed and/alt/rep : 345/1349/345 causal constraints (skipped 2288 transitions) in 156 ms.
[2024-06-01 06:37:00] [INFO ] Deduced a trap composed of 49 places in 192 ms of which 1 ms to minimize.
[2024-06-01 06:37:00] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 1 ms to minimize.
[2024-06-01 06:37:00] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 1 ms to minimize.
[2024-06-01 06:37:00] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 1 ms to minimize.
[2024-06-01 06:37:00] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 1 ms to minimize.
[2024-06-01 06:37:01] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1135 ms
[2024-06-01 06:37:01] [INFO ] Added : 5 causal constraints over 2 iterations in 1676 ms. Result :sat
Minimization took 2478 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, 1]
Support contains 7 out of 230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 2765/2765 transitions.
Applied a total of 0 rules in 110 ms. Remains 230 /230 variables (removed 0) and now considering 2765/2765 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 230/230 places, 2765/2765 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 2765/2765 transitions.
Applied a total of 0 rules in 66 ms. Remains 230 /230 variables (removed 0) and now considering 2765/2765 (removed 0) transitions.
[2024-06-01 06:37:04] [INFO ] Flow matrix only has 2634 transitions (discarded 131 similar events)
[2024-06-01 06:37:04] [INFO ] Invariant cache hit.
[2024-06-01 06:37:05] [INFO ] Implicit Places using invariants in 477 ms returned []
[2024-06-01 06:37:05] [INFO ] Flow matrix only has 2634 transitions (discarded 131 similar events)
[2024-06-01 06:37:05] [INFO ] Invariant cache hit.
[2024-06-01 06:37:05] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-06-01 06:37:06] [INFO ] Implicit Places using invariants and state equation in 1700 ms returned []
Implicit Place search using SMT with State Equation took 2201 ms to find 0 implicit places.
[2024-06-01 06:37:07] [INFO ] Redundant transitions in 227 ms returned []
Running 2764 sub problems to find dead transitions.
[2024-06-01 06:37:07] [INFO ] Flow matrix only has 2634 transitions (discarded 131 similar events)
[2024-06-01 06:37:07] [INFO ] Invariant cache hit.
[2024-06-01 06:37:07] [INFO ] State equation strengthened by 255 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2764 unsolved
[2024-06-01 06:37:47] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 1 ms to minimize.
[2024-06-01 06:37:47] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 1 ms to minimize.
[2024-06-01 06:37:47] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 0 ms to minimize.
[2024-06-01 06:37:53] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 1 ms to minimize.
[2024-06-01 06:37:56] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 0 ms to minimize.
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 TDEAD1777 is UNSAT
Problem TDEAD1778 is UNSAT
Problem TDEAD1779 is UNSAT
Problem TDEAD1780 is UNSAT
Problem TDEAD1781 is UNSAT
Problem TDEAD1782 is UNSAT
Problem TDEAD1785 is UNSAT
Problem TDEAD1786 is UNSAT
Problem TDEAD1788 is UNSAT
Problem TDEAD1789 is UNSAT
Problem TDEAD1790 is UNSAT
Problem TDEAD1791 is UNSAT
Problem TDEAD1792 is UNSAT
Problem TDEAD1793 is UNSAT
Problem TDEAD1794 is UNSAT
Problem TDEAD1795 is UNSAT
Problem TDEAD1796 is UNSAT
Problem TDEAD1797 is UNSAT
Problem TDEAD1798 is UNSAT
Problem TDEAD1800 is UNSAT
Problem TDEAD1801 is UNSAT
Problem TDEAD1807 is UNSAT
Problem TDEAD1808 is UNSAT
Problem TDEAD1812 is UNSAT
Problem TDEAD1813 is UNSAT
Problem TDEAD1814 is UNSAT
Problem TDEAD1815 is UNSAT
Problem TDEAD1816 is UNSAT
Problem TDEAD1817 is UNSAT
Problem TDEAD1818 is UNSAT
Problem TDEAD1819 is UNSAT
Problem TDEAD1820 is UNSAT
Problem TDEAD1823 is UNSAT
Problem TDEAD1824 is UNSAT
[2024-06-01 06:38:03] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 1 ms to minimize.
[2024-06-01 06:38:04] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 1 ms to minimize.
[2024-06-01 06:38:04] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 0 ms to minimize.
Problem TDEAD2708 is UNSAT
Problem TDEAD2709 is UNSAT
Problem TDEAD2719 is UNSAT
Problem TDEAD2720 is UNSAT
Problem TDEAD2731 is UNSAT
Problem TDEAD2732 is UNSAT
Problem TDEAD2742 is UNSAT
Problem TDEAD2743 is UNSAT
Problem TDEAD2746 is UNSAT
Problem TDEAD2747 is UNSAT
Problem TDEAD2748 is UNSAT
Problem TDEAD2749 is UNSAT
Problem TDEAD2750 is UNSAT
Problem TDEAD2751 is UNSAT
Problem TDEAD2752 is UNSAT
Problem TDEAD2753 is UNSAT
Problem TDEAD2754 is UNSAT
Problem TDEAD2755 is UNSAT
Problem TDEAD2756 is UNSAT
Problem TDEAD2757 is UNSAT
Problem TDEAD2758 is UNSAT
Problem TDEAD2759 is UNSAT
Problem TDEAD2760 is UNSAT
Problem TDEAD2763 is UNSAT
Problem TDEAD2764 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
Problem TDEAD1768 is UNSAT
Problem TDEAD1806 is UNSAT
Problem TDEAD1821 is UNSAT
Problem TDEAD1822 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/230 variables, 8/16 constraints. Problems are: Problem set: 97 solved, 2667 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 230/2864 variables, and 16 constraints, problems are : Problem set: 97 solved, 2667 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/230 constraints, ReadFeed: 0/255 constraints, PredecessorRefiner: 2764/2764 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 97 solved, 2667 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 8/8 constraints. Problems are: Problem set: 97 solved, 2667 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/230 variables, 8/16 constraints. Problems are: Problem set: 97 solved, 2667 unsolved
[2024-06-01 06:38:16] [INFO ] Deduced a trap composed of 10 places in 55 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:38:16] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 0 ms to minimize.
Problem TDEAD1440 is UNSAT
Problem TDEAD1441 is UNSAT
Problem TDEAD1442 is UNSAT
Problem TDEAD1443 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1446 is UNSAT
Problem TDEAD1447 is UNSAT
Problem TDEAD1448 is UNSAT
Problem TDEAD1449 is UNSAT
Problem TDEAD1450 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1049 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1073 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1081 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1092 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1095 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1097 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1102 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1109 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1114 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1116 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1121 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1123 is UNSAT
Problem TDEAD1124 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1129 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1132 is UNSAT
Problem TDEAD1133 is UNSAT
Problem TDEAD1134 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1141 is UNSAT
Problem TDEAD1142 is UNSAT
Problem TDEAD1143 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1147 is UNSAT
Problem TDEAD1148 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1150 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1237 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1250 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1263 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1270 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1281 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1283 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1286 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1288 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1292 is UNSAT
Problem TDEAD1293 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1297 is UNSAT
Problem TDEAD1298 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1301 is UNSAT
Problem TDEAD1302 is UNSAT
Problem TDEAD1303 is UNSAT
Problem TDEAD1304 is UNSAT
Problem TDEAD1305 is UNSAT
Problem TDEAD1306 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1312 is UNSAT
Problem TDEAD1313 is UNSAT
Problem TDEAD1314 is UNSAT
Problem TDEAD1315 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1317 is UNSAT
Problem TDEAD1318 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1320 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1324 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1326 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1329 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1334 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1339 is UNSAT
Problem TDEAD1340 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1343 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1348 is UNSAT
Problem TDEAD1349 is UNSAT
Problem TDEAD1350 is UNSAT
Problem TDEAD1351 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1354 is UNSAT
Problem TDEAD1355 is UNSAT
Problem TDEAD1356 is UNSAT
Problem TDEAD1357 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1359 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 2/18 constraints. Problems are: Problem set: 367 solved, 2397 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 230/2864 variables, and 18 constraints, problems are : Problem set: 367 solved, 2397 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/230 constraints, ReadFeed: 0/255 constraints, PredecessorRefiner: 0/2764 constraints, Known Traps: 10/10 constraints]
After SMT, in 90867ms problems are : Problem set: 367 solved, 2397 unsolved
Search for dead transitions found 367 dead transitions in 90937ms
Found 367 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 367 transitions
Dead transitions reduction (with SMT) removed 367 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 230/230 places, 2398/2765 transitions.
Reduce places removed 21 places and 562 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 209 transition count 1836
Reduce places removed 17 places and 234 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 38 place count 192 transition count 1602
Reduce places removed 15 places and 269 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 53 place count 177 transition count 1333
Reduce places removed 11 places and 192 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 64 place count 166 transition count 1141
Reduce places removed 3 places and 49 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 67 place count 163 transition count 1092
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 79 place count 151 transition count 1032
Deduced a syphon composed of 21 places in 18 ms
Reduce places removed 15 places and 231 transitions.
Iterating global reduction 5 with 27 rules applied. Total rules applied 106 place count 136 transition count 801
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 114 place count 128 transition count 729
Deduced a syphon composed of 6 places in 4 ms
Iterating global reduction 5 with 8 rules applied. Total rules applied 122 place count 128 transition count 729
Deduced a syphon composed of 6 places in 16 ms
Applied a total of 122 rules in 78 ms. Remains 128 /230 variables (removed 102) and now considering 729/2398 (removed 1669) transitions.
[2024-06-01 06:38:38] [INFO ] Flow matrix only has 663 transitions (discarded 66 similar events)
// Phase 1: matrix 663 rows 128 cols
[2024-06-01 06:38:38] [INFO ] Computed 14 invariants in 3 ms
[2024-06-01 06:38:38] [INFO ] Implicit Places using invariants in 205 ms returned []
[2024-06-01 06:38:38] [INFO ] Flow matrix only has 663 transitions (discarded 66 similar events)
[2024-06-01 06:38:38] [INFO ] Invariant cache hit.
[2024-06-01 06:38:38] [INFO ] State equation strengthened by 88 read => feed constraints.
[2024-06-01 06:38:38] [INFO ] Implicit Places using invariants and state equation in 521 ms returned []
Implicit Place search using SMT with State Equation took 729 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 128/230 places, 729/2765 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 94304 ms. Remains : 128/230 places, 729/2765 transitions.
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
FORMULA BugTracking-PT-q3m128-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 06:38:38] [INFO ] Flow matrix only has 663 transitions (discarded 66 similar events)
Found an invariant !
This invariant on transitions {3=1, 364=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {2=1, 364=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, 1]
[2024-06-01 06:38:39] [INFO ] Flow matrix only has 663 transitions (discarded 66 similar events)
// Phase 1: matrix 663 rows 122 cols
[2024-06-01 06:38:39] [INFO ] Computed 8 invariants in 13 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, 1]
RANDOM walk for 1000122 steps (2 resets) in 452 ms. (2207 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 924 ms. (1081 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, 1]
[2024-06-01 06:38:40] [INFO ] Flow matrix only has 663 transitions (discarded 66 similar events)
[2024-06-01 06:38:40] [INFO ] Invariant cache hit.
[2024-06-01 06:38:40] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-01 06:38:40] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2024-06-01 06:38:40] [INFO ] State equation strengthened by 88 read => feed constraints.
[2024-06-01 06:38:40] [INFO ] [Real]Added 88 Read/Feed constraints in 17 ms returned sat
[2024-06-01 06:38:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:38:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-01 06:38:41] [INFO ] [Nat]Absence check using state equation in 230 ms returned sat
[2024-06-01 06:38:41] [INFO ] [Nat]Added 88 Read/Feed constraints in 20 ms returned sat
[2024-06-01 06:38:41] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 1 ms to minimize.
[2024-06-01 06:38:41] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
[2024-06-01 06:38:41] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 1 ms to minimize.
[2024-06-01 06:38:41] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:38:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 399 ms
[2024-06-01 06:38:41] [INFO ] Computed and/alt/rep : 180/577/179 causal constraints (skipped 483 transitions) in 35 ms.
[2024-06-01 06:38:41] [INFO ] Added : 15 causal constraints over 3 iterations in 141 ms. Result :sat
Minimization took 242 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, 1]
Support contains 1 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 729/729 transitions.
Applied a total of 0 rules in 10 ms. Remains 122 /122 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 122/122 places, 729/729 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 729/729 transitions.
Applied a total of 0 rules in 9 ms. Remains 122 /122 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-06-01 06:38:42] [INFO ] Flow matrix only has 663 transitions (discarded 66 similar events)
[2024-06-01 06:38:42] [INFO ] Invariant cache hit.
[2024-06-01 06:38:42] [INFO ] Implicit Places using invariants in 267 ms returned []
[2024-06-01 06:38:42] [INFO ] Flow matrix only has 663 transitions (discarded 66 similar events)
[2024-06-01 06:38:42] [INFO ] Invariant cache hit.
[2024-06-01 06:38:42] [INFO ] State equation strengthened by 88 read => feed constraints.
[2024-06-01 06:38:42] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 651 ms to find 0 implicit places.
[2024-06-01 06:38:42] [INFO ] Redundant transitions in 15 ms returned []
Running 728 sub problems to find dead transitions.
[2024-06-01 06:38:42] [INFO ] Flow matrix only has 663 transitions (discarded 66 similar events)
[2024-06-01 06:38:42] [INFO ] Invariant cache hit.
[2024-06-01 06:38:42] [INFO ] State equation strengthened by 88 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 728 unsolved
[2024-06-01 06:38:46] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:38:47] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
Problem TDEAD391 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 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 TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD728 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 2/10 constraints. Problems are: Problem set: 13 solved, 715 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/10 constraints. Problems are: Problem set: 13 solved, 715 unsolved
At refinement iteration 3 (OVERLAPS) 663/785 variables, 122/132 constraints. Problems are: Problem set: 13 solved, 715 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/785 variables, 88/220 constraints. Problems are: Problem set: 13 solved, 715 unsolved
[2024-06-01 06:38:55] [INFO ] Deduced a trap composed of 14 places in 27 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/785 variables, 1/221 constraints. Problems are: Problem set: 73 solved, 655 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/785 variables, 0/221 constraints. Problems are: Problem set: 73 solved, 655 unsolved
At refinement iteration 7 (OVERLAPS) 0/785 variables, 0/221 constraints. Problems are: Problem set: 73 solved, 655 unsolved
No progress, stopping.
After SMT solving in domain Real declared 785/785 variables, and 221 constraints, problems are : Problem set: 73 solved, 655 unsolved in 26320 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 122/122 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 728/728 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 73 solved, 655 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 7/7 constraints. Problems are: Problem set: 73 solved, 655 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 3/10 constraints. Problems are: Problem set: 73 solved, 655 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/10 constraints. Problems are: Problem set: 73 solved, 655 unsolved
At refinement iteration 3 (OVERLAPS) 1/122 variables, 1/11 constraints. Problems are: Problem set: 73 solved, 655 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/11 constraints. Problems are: Problem set: 73 solved, 655 unsolved
At refinement iteration 5 (OVERLAPS) 663/785 variables, 122/133 constraints. Problems are: Problem set: 73 solved, 655 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/785 variables, 88/221 constraints. Problems are: Problem set: 73 solved, 655 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 TDEAD380 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD721 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/785 variables, 655/876 constraints. Problems are: Problem set: 134 solved, 594 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/785 variables, 0/876 constraints. Problems are: Problem set: 134 solved, 594 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 785/785 variables, and 876 constraints, problems are : Problem set: 134 solved, 594 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 122/122 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 655/728 constraints, Known Traps: 3/3 constraints]
After SMT, in 58101ms problems are : Problem set: 134 solved, 594 unsolved
Search for dead transitions found 134 dead transitions in 58107ms
Found 134 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 134 transitions
Dead transitions reduction (with SMT) removed 134 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 122/122 places, 595/729 transitions.
Graph (complete) has 868 edges and 122 vertex of which 118 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 14 places and 180 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 104 transition count 415
Reduce places removed 8 places and 73 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 23 place count 96 transition count 342
Reduce places removed 4 places and 29 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 27 place count 92 transition count 313
Reduce places removed 2 places and 16 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 29 place count 90 transition count 297
Reduce places removed 1 places and 9 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 30 place count 89 transition count 288
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 36 place count 83 transition count 242
Iterating global reduction 5 with 6 rules applied. Total rules applied 42 place count 83 transition count 242
Applied a total of 42 rules in 9 ms. Remains 83 /122 variables (removed 39) and now considering 242/595 (removed 353) transitions.
[2024-06-01 06:39:40] [INFO ] Flow matrix only has 225 transitions (discarded 17 similar events)
// Phase 1: matrix 225 rows 83 cols
[2024-06-01 06:39:40] [INFO ] Computed 8 invariants in 7 ms
[2024-06-01 06:39:41] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-06-01 06:39:41] [INFO ] Flow matrix only has 225 transitions (discarded 17 similar events)
[2024-06-01 06:39:41] [INFO ] Invariant cache hit.
[2024-06-01 06:39:41] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-06-01 06:39:41] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 83/122 places, 242/729 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 59129 ms. Remains : 83/122 places, 242/729 transitions.
[2024-06-01 06:39:41] [INFO ] Flow matrix only has 225 transitions (discarded 17 similar events)
Found an invariant !
This invariant on transitions {3=1, 154=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 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 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, 1]
[2024-06-01 06:39:41] [INFO ] Flow matrix only has 225 transitions (discarded 17 similar events)
[2024-06-01 06:39:41] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, 1]
RANDOM walk for 1000059 steps (2 resets) in 342 ms. (2915 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 501 ms. (1992 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, 1]
[2024-06-01 06:39:42] [INFO ] Flow matrix only has 225 transitions (discarded 17 similar events)
[2024-06-01 06:39:42] [INFO ] Invariant cache hit.
[2024-06-01 06:39:42] [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 7 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 06:39:42] [INFO ] [Real]Absence check using state equation in 55 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 1 ms returned sat
[2024-06-01 06:39:42] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 06:39:42] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2024-06-01 06:39:42] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-06-01 06:39:42] [INFO ] [Nat]Added 48 Read/Feed constraints in 7 ms returned sat
[2024-06-01 06:39:42] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:39:42] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:39:42] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:39:42] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:39:42] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 0 ms to minimize.
[2024-06-01 06:39:42] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:39:42] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:39:42] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 408 ms
[2024-06-01 06:39:42] [INFO ] Computed and/alt/rep : 187/1011/187 causal constraints (skipped 37 transitions) in 10 ms.
[2024-06-01 06:39:43] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:39:43] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:39:43] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:39:43] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
[2024-06-01 06:39:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 160 ms
[2024-06-01 06:39:43] [INFO ] Added : 50 causal constraints over 14 iterations in 342 ms. Result :sat
Minimization took 82 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +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 5 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 5 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 4 ms. Remains 83 /83 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-06-01 06:39:43] [INFO ] Flow matrix only has 225 transitions (discarded 17 similar events)
[2024-06-01 06:39:43] [INFO ] Invariant cache hit.
[2024-06-01 06:39:43] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-01 06:39:43] [INFO ] Flow matrix only has 225 transitions (discarded 17 similar events)
[2024-06-01 06:39:43] [INFO ] Invariant cache hit.
[2024-06-01 06:39:43] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-06-01 06:39:43] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
[2024-06-01 06:39:43] [INFO ] Redundant transitions in 1 ms returned []
Running 241 sub problems to find dead transitions.
[2024-06-01 06:39:43] [INFO ] Flow matrix only has 225 transitions (discarded 17 similar events)
[2024-06-01 06:39:43] [INFO ] Invariant cache hit.
[2024-06-01 06:39:43] [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:39:46] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 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:39:47] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 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
At refinement iteration 8 (OVERLAPS) 0/308 variables, 0/141 constraints. Problems are: Problem set: 2 solved, 239 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 141 constraints, problems are : Problem set: 2 solved, 239 unsolved in 6213 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: 2/2 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, 2/10 constraints. Problems are: Problem set: 2 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 239 unsolved
At refinement iteration 4 (OVERLAPS) 225/308 variables, 83/93 constraints. Problems are: Problem set: 2 solved, 239 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 48/141 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/380 constraints. Problems are: Problem set: 4 solved, 237 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 0/380 constraints. Problems are: Problem set: 4 solved, 237 unsolved
At refinement iteration 8 (OVERLAPS) 0/308 variables, 0/380 constraints. Problems are: Problem set: 4 solved, 237 unsolved
No progress, stopping.
After SMT solving in domain Int declared 308/308 variables, and 380 constraints, problems are : Problem set: 4 solved, 237 unsolved in 7302 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: 2/2 constraints]
After SMT, in 13774ms problems are : Problem set: 4 solved, 237 unsolved
Search for dead transitions found 4 dead transitions in 13777ms
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 5 ms. Remains 82 /83 variables (removed 1) and now considering 231/238 (removed 7) transitions.
[2024-06-01 06:39:57] [INFO ] Flow matrix only has 215 transitions (discarded 16 similar events)
// Phase 1: matrix 215 rows 82 cols
[2024-06-01 06:39:57] [INFO ] Computed 8 invariants in 2 ms
[2024-06-01 06:39:57] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-01 06:39:57] [INFO ] Flow matrix only has 215 transitions (discarded 16 similar events)
[2024-06-01 06:39:57] [INFO ] Invariant cache hit.
[2024-06-01 06:39:57] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-06-01 06:39:57] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 266 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 14379 ms. Remains : 82/83 places, 231/242 transitions.
[2024-06-01 06:39:57] [INFO ] Flow matrix only has 215 transitions (discarded 16 similar events)
Found an invariant !
This invariant on transitions {0=1, 10=1, 51=1, 144=1, 206=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 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, 1]
[2024-06-01 06:39:57] [INFO ] Flow matrix only has 215 transitions (discarded 16 similar events)
[2024-06-01 06:39:57] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, 1]
RANDOM walk for 1000073 steps (2 resets) in 338 ms. (2950 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 518 ms. (1926 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, 1]
[2024-06-01 06:39:58] [INFO ] Flow matrix only has 215 transitions (discarded 16 similar events)
[2024-06-01 06:39:58] [INFO ] Invariant cache hit.
[2024-06-01 06:39:58] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-01 06:39:58] [INFO ] [Real]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 06:39:58] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-06-01 06:39:58] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-06-01 06:39:58] [INFO ] [Real]Added 47 Read/Feed constraints in 5 ms returned sat
[2024-06-01 06:39:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:39:58] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 06:39:58] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 06:39:58] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-06-01 06:39:58] [INFO ] [Nat]Added 47 Read/Feed constraints in 6 ms returned sat
[2024-06-01 06:39:58] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:39:58] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-06-01 06:39:59] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:39:59] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:39:59] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:39:59] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:39:59] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:39:59] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 489 ms
[2024-06-01 06:39:59] [INFO ] Computed and/alt/rep : 178/955/178 causal constraints (skipped 36 transitions) in 12 ms.
[2024-06-01 06:39:59] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:39:59] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:39:59] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:39:59] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2024-06-01 06:39:59] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 0 ms to minimize.
[2024-06-01 06:39:59] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 372 ms
[2024-06-01 06:39:59] [INFO ] Added : 63 causal constraints over 14 iterations in 547 ms. Result :sat
Minimization took 45 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +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 4 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 5 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 4 ms. Remains 82 /82 variables (removed 0) and now considering 231/231 (removed 0) transitions.
[2024-06-01 06:40:00] [INFO ] Flow matrix only has 215 transitions (discarded 16 similar events)
[2024-06-01 06:40:00] [INFO ] Invariant cache hit.
[2024-06-01 06:40:00] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-06-01 06:40:00] [INFO ] Flow matrix only has 215 transitions (discarded 16 similar events)
[2024-06-01 06:40:00] [INFO ] Invariant cache hit.
[2024-06-01 06:40:00] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-06-01 06:40:00] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
[2024-06-01 06:40:00] [INFO ] Redundant transitions in 1 ms returned []
Running 230 sub problems to find dead transitions.
[2024-06-01 06:40:00] [INFO ] Flow matrix only has 215 transitions (discarded 16 similar events)
[2024-06-01 06:40:00] [INFO ] Invariant cache hit.
[2024-06-01 06:40:00] [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
[2024-06-01 06:40:02] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 1/138 constraints. Problems are: Problem set: 12 solved, 218 unsolved
[2024-06-01 06:40:03] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 1/139 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 0/139 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 8 (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 5058 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:40:07] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 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
At refinement iteration 9 (OVERLAPS) 0/297 variables, 0/358 constraints. Problems are: Problem set: 12 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 297/297 variables, and 358 constraints, problems are : Problem set: 12 solved, 218 unsolved in 8252 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: 3/3 constraints]
After SMT, in 13479ms problems are : Problem set: 12 solved, 218 unsolved
Search for dead transitions found 12 dead transitions in 13481ms
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 3 ms. Remains 82 /82 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2024-06-01 06:40:13] [INFO ] Redundant transitions in 0 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 13797 ms. Remains : 82/82 places, 219/231 transitions.
[2024-06-01 06:40:13] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
Found an invariant !
This invariant on transitions {4=1, 132=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {0=1, 132=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, 1]
[2024-06-01 06:40:13] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
// Phase 1: matrix 203 rows 82 cols
[2024-06-01 06:40:13] [INFO ] Computed 8 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, 1]
RANDOM walk for 1000002 steps (2 resets) in 397 ms. (2512 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 514 ms. (1941 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, 1]
[2024-06-01 06:40:14] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-06-01 06:40:14] [INFO ] Invariant cache hit.
[2024-06-01 06:40:14] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 06:40:14] [INFO ] [Real]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 06:40:14] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-06-01 06:40:14] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-01 06:40:14] [INFO ] [Real]Added 45 Read/Feed constraints in 5 ms returned sat
[2024-06-01 06:40:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:40:14] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 06:40:14] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 8 ms returned sat
[2024-06-01 06:40:15] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2024-06-01 06:40:15] [INFO ] [Nat]Added 45 Read/Feed constraints in 7 ms returned sat
[2024-06-01 06:40:15] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:40:15] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-06-01 06:40:15] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:40:15] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 3 ms to minimize.
[2024-06-01 06:40:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 264 ms
[2024-06-01 06:40:15] [INFO ] Computed and/alt/rep : 166/847/166 causal constraints (skipped 36 transitions) in 9 ms.
[2024-06-01 06:40:15] [INFO ] Added : 42 causal constraints over 9 iterations in 96 ms. Result :sat
Minimization took 36 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +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 4 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 4 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:40:15] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-06-01 06:40:15] [INFO ] Invariant cache hit.
[2024-06-01 06:40:15] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-06-01 06:40:15] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-06-01 06:40:15] [INFO ] Invariant cache hit.
[2024-06-01 06:40:15] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-01 06:40:15] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2024-06-01 06:40:15] [INFO ] Redundant transitions in 1 ms returned []
Running 218 sub problems to find dead transitions.
[2024-06-01 06:40:15] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-06-01 06:40:15] [INFO ] Invariant cache hit.
[2024-06-01 06:40:15] [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 3904 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
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 06:40:23] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:40:23] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/285 variables, 2/355 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 06:40:24] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/285 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 06:40:27] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/285 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/285 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 11 (OVERLAPS) 0/285 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 357 constraints, problems are : Problem set: 0 solved, 218 unsolved in 12455 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: 4/4 constraints]
After SMT, in 16541ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 16544ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16846 ms. Remains : 82/82 places, 219/219 transitions.
[2024-06-01 06:40:32] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
Found an invariant !
This invariant on transitions {4=1, 132=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1, 132=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 :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, 1]
RANDOM walk for 40171 steps (8 resets) in 131 ms. (304 steps per ms) remains 1/1 properties
BEST_FIRST walk for 31963 steps (6 resets) in 97 ms. (326 steps per ms) remains 0/1 properties
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, 1]
Starting property specific reduction for BugTracking-PT-q3m128-UpperBounds-12
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:40:32] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-06-01 06:40:32] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10082 steps (2 resets) in 5 ms. (1680 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2024-06-01 06:40:32] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-06-01 06:40:32] [INFO ] Invariant cache hit.
[2024-06-01 06:40:32] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 06:40:32] [INFO ] [Real]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 06:40:32] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-06-01 06:40:32] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-01 06:40:32] [INFO ] [Real]Added 45 Read/Feed constraints in 6 ms returned sat
[2024-06-01 06:40:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:40:32] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 06:40:32] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 06:40:32] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-06-01 06:40:32] [INFO ] [Nat]Added 45 Read/Feed constraints in 6 ms returned sat
[2024-06-01 06:40:32] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:40:32] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:40:32] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:40:33] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 0 ms to minimize.
[2024-06-01 06:40:33] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 239 ms
[2024-06-01 06:40:33] [INFO ] Computed and/alt/rep : 166/847/166 causal constraints (skipped 36 transitions) in 9 ms.
[2024-06-01 06:40:33] [INFO ] Added : 42 causal constraints over 9 iterations in 104 ms. Result :sat
Minimization took 43 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] 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 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.
[2024-06-01 06:40:33] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
Found an invariant !
This invariant on transitions {4=1, 132=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1, 132=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2024-06-01 06:40:33] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-06-01 06:40:33] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[+inf]
RANDOM walk for 1000029 steps (2 resets) in 527 ms. (1893 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 588 ms. (1697 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2024-06-01 06:40:34] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-06-01 06:40:34] [INFO ] Invariant cache hit.
[2024-06-01 06:40:34] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-01 06:40:34] [INFO ] [Real]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 06:40:34] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2024-06-01 06:40:34] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-01 06:40:34] [INFO ] [Real]Added 45 Read/Feed constraints in 7 ms returned sat
[2024-06-01 06:40:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:40:34] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-01 06:40:34] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 06:40:34] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-06-01 06:40:34] [INFO ] [Nat]Added 45 Read/Feed constraints in 10 ms returned sat
[2024-06-01 06:40:34] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:40:34] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:40:34] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:40:34] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:40:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 250 ms
[2024-06-01 06:40:34] [INFO ] Computed and/alt/rep : 166/847/166 causal constraints (skipped 36 transitions) in 13 ms.
[2024-06-01 06:40:35] [INFO ] Added : 42 causal constraints over 9 iterations in 121 ms. Result :sat
Minimization took 52 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] 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 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 2 ms. Remains 82 /82 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2024-06-01 06:40:35] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-06-01 06:40:35] [INFO ] Invariant cache hit.
[2024-06-01 06:40:35] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-01 06:40:35] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-06-01 06:40:35] [INFO ] Invariant cache hit.
[2024-06-01 06:40:35] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-01 06:40:35] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
[2024-06-01 06:40:35] [INFO ] Redundant transitions in 1 ms returned []
Running 218 sub problems to find dead transitions.
[2024-06-01 06:40:35] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-06-01 06:40:35] [INFO ] Invariant cache hit.
[2024-06-01 06:40:35] [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 4484 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
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 06:40:44] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:40:44] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/285 variables, 2/355 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 06:40:45] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/285 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 06:40:48] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/285 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/285 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 11 (OVERLAPS) 0/285 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 357 constraints, problems are : Problem set: 0 solved, 218 unsolved in 13234 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: 4/4 constraints]
After SMT, in 17922ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 17926ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18195 ms. Remains : 82/82 places, 219/219 transitions.
[2024-06-01 06:40:53] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
Found an invariant !
This invariant on transitions {4=1, 132=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1, 132=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
RANDOM walk for 40303 steps (8 resets) in 37 ms. (1060 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 126 ms. (314 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1112143 steps, run timeout after 3001 ms. (steps per millisecond=370 ) properties seen :0 out of 1
Probabilistic random walk after 1112143 steps, saw 710321 distinct states, run finished after 3004 ms. (steps per millisecond=370 ) properties seen :0
[2024-06-01 06:40:56] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-06-01 06:40:56] [INFO ] Invariant cache hit.
[2024-06-01 06:40:56] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 76/86 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 14/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/88 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/91 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/91 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/91 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/93 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/93 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 63/156 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/156 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/156 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 85/241 variables, 14/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/241 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/241 variables, 14/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/241 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/243 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/243 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 40/283 variables, 32/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/283 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/283 variables, 11/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/283 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 2/285 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 135 constraints, problems are : Problem set: 0 solved, 1 unsolved in 169 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: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 76/86 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 14/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/88 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/91 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/91 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/91 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/91 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/93 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/93 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 63/156 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/156 variables, 5/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/156 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 85/241 variables, 14/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/241 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/241 variables, 14/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/241 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/243 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/243 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 40/283 variables, 32/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/283 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/283 variables, 11/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/283 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 2/285 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:40:56] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/285 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/285 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 0/285 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 137 constraints, problems are : Problem set: 0 solved, 1 unsolved in 241 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: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 419ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
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.
RANDOM walk for 40229 steps (8 resets) in 67 ms. (591 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 982861 steps, run timeout after 3001 ms. (steps per millisecond=327 ) properties seen :0 out of 1
Probabilistic random walk after 982861 steps, saw 624035 distinct states, run finished after 3001 ms. (steps per millisecond=327 ) properties seen :0
[2024-06-01 06:41:00] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-06-01 06:41:00] [INFO ] Invariant cache hit.
[2024-06-01 06:41:00] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 76/86 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 14/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/88 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/91 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/91 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/91 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/93 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/93 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 63/156 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/156 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/156 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 85/241 variables, 14/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/241 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/241 variables, 14/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/241 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/243 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/243 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 40/283 variables, 32/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/283 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/283 variables, 11/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/283 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 2/285 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 135 constraints, problems are : Problem set: 0 solved, 1 unsolved in 134 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: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 76/86 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 14/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/88 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/91 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/91 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/91 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/91 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/93 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/93 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 63/156 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/156 variables, 5/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/156 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 85/241 variables, 14/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/241 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/241 variables, 14/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/241 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/243 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/243 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 40/283 variables, 32/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/283 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/283 variables, 11/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/283 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 2/285 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:41:00] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/285 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/285 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 0/285 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 137 constraints, problems are : Problem set: 0 solved, 1 unsolved in 276 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: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 428ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
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 2 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 2 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:41:00] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-06-01 06:41:00] [INFO ] Invariant cache hit.
[2024-06-01 06:41:00] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-01 06:41:00] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-06-01 06:41:00] [INFO ] Invariant cache hit.
[2024-06-01 06:41:00] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-01 06:41:00] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2024-06-01 06:41:00] [INFO ] Redundant transitions in 1 ms returned []
Running 218 sub problems to find dead transitions.
[2024-06-01 06:41:00] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-06-01 06:41:00] [INFO ] Invariant cache hit.
[2024-06-01 06:41:00] [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 4116 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
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 06:41:09] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:41:09] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/285 variables, 2/355 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 06:41:10] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/285 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 06:41:12] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/285 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/285 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 11 (OVERLAPS) 0/285 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 357 constraints, problems are : Problem set: 0 solved, 218 unsolved in 13148 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: 4/4 constraints]
After SMT, in 17409ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 17411ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17638 ms. Remains : 82/82 places, 219/219 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 331 edges and 82 vertex of which 80 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 80 transition count 202
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 18 place count 80 transition count 201
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 79 transition count 201
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 31 place count 68 transition count 157
Iterating global reduction 1 with 11 rules applied. Total rules applied 42 place count 68 transition count 157
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 43 place count 68 transition count 156
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 67 transition count 155
Ensure Unique test removed 1 places
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 66 transition count 155
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 65 transition count 154
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 65 transition count 154
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 50 place count 65 transition count 152
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 52 place count 63 transition count 152
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 52 place count 63 transition count 151
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 55 place count 61 transition count 151
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 63 place count 57 transition count 147
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 69 place count 54 transition count 150
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 74 place count 54 transition count 145
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 79 place count 49 transition count 145
Applied a total of 79 rules in 29 ms. Remains 49 /82 variables (removed 33) and now considering 145/219 (removed 74) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 145 rows 49 cols
[2024-06-01 06:41:18] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 06:41:18] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 06:41:18] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 06:41:18] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 06:41:18] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 06:41:18] [INFO ] After 43ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 06:41:18] [INFO ] After 79ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 182 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[+inf]
Ending property specific reduction for BugTracking-PT-q3m128-UpperBounds-12 in 45721 ms.
[2024-06-01 06:41:18] [INFO ] Flatten gal took : 58 ms
[2024-06-01 06:41:18] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 5 ms.
[2024-06-01 06:41:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 82 places, 219 transitions and 1042 arcs took 3 ms.
Total runtime 399540 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-q3m128-UpperBounds-12

BK_STOP 1717224078759

--------------------
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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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-q3m128-UpperBounds-12
ub formula formula --maxsum=/tmp/1428/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-q3m128"
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-q3m128, 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-171620399400373"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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