Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r480-tall-171624189600573.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is DBSingleClientW-PT-d2m07, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624189600573
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 12:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Apr 12 12:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 12 12:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 12 12:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.6M 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 DBSingleClientW-PT-d2m07-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717190844847

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:27:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-31 21:27:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:27:26] [INFO ] Load time of PNML (sax parser for PT used): 202 ms
[2024-05-31 21:27:26] [INFO ] Transformed 4763 places.
[2024-05-31 21:27:26] [INFO ] Transformed 2478 transitions.
[2024-05-31 21:27:26] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 340 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
Deduced a syphon composed of 3580 places in 25 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
// Phase 1: matrix 2478 rows 1183 cols
[2024-05-31 21:27:26] [INFO ] Computed 6 invariants in 161 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[7, 7, 7, 7]
RANDOM walk for 10000 steps (2275 resets) in 383 ms. (26 steps per ms)
BEST_FIRST walk for 40002 steps (3875 resets) in 268 ms. (148 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 3, 0, 0] Max Struct:[7, 7, 7, 7]
[2024-05-31 21:27:27] [INFO ] Invariant cache hit.
[2024-05-31 21:27:27] [INFO ] [Real]Absence check using 2 positive place invariants in 15 ms returned sat
[2024-05-31 21:27:27] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 10 ms returned sat
[2024-05-31 21:27:28] [INFO ] [Real]Absence check using state equation in 735 ms returned sat
[2024-05-31 21:27:28] [INFO ] State equation strengthened by 1588 read => feed constraints.
[2024-05-31 21:27:29] [INFO ] [Real]Added 1588 Read/Feed constraints in 689 ms returned sat
[2024-05-31 21:27:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:27:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 19 ms returned sat
[2024-05-31 21:27:29] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 13 ms returned sat
[2024-05-31 21:27:30] [INFO ] [Nat]Absence check using state equation in 758 ms returned sat
[2024-05-31 21:27:31] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1058 ms returned sat
[2024-05-31 21:27:32] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 675 ms.
[2024-05-31 21:27:34] [INFO ] Deduced a trap composed of 48 places in 926 ms of which 136 ms to minimize.
[2024-05-31 21:27:35] [INFO ] Deduced a trap composed of 51 places in 797 ms of which 22 ms to minimize.
[2024-05-31 21:27:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1128)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-31 21:27:35] [INFO ] [Real]Absence check using 2 positive place invariants in 14 ms returned sat
[2024-05-31 21:27:35] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 10 ms returned sat
[2024-05-31 21:27:36] [INFO ] [Real]Absence check using state equation in 693 ms returned sat
[2024-05-31 21:27:37] [INFO ] [Real]Added 1588 Read/Feed constraints in 939 ms returned sat
[2024-05-31 21:27:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:27:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 18 ms returned sat
[2024-05-31 21:27:37] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-31 21:27:37] [INFO ] [Nat]Absence check using state equation in 684 ms returned sat
[2024-05-31 21:27:38] [INFO ] [Nat]Added 1588 Read/Feed constraints in 684 ms returned sat
[2024-05-31 21:27:39] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 692 ms.
[2024-05-31 21:27:39] [INFO ] Added : 1 causal constraints over 1 iterations in 966 ms. Result :sat
Minimization took 642 ms.
[2024-05-31 21:27:40] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-31 21:27:40] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 18 ms returned sat
[2024-05-31 21:27:41] [INFO ] [Real]Absence check using state equation in 697 ms returned sat
[2024-05-31 21:27:42] [INFO ] [Real]Added 1588 Read/Feed constraints in 779 ms returned sat
[2024-05-31 21:27:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:27:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-31 21:27:42] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 14 ms returned sat
[2024-05-31 21:27:42] [INFO ] [Nat]Absence check using state equation in 671 ms returned sat
[2024-05-31 21:27:43] [INFO ] [Nat]Added 1588 Read/Feed constraints in 791 ms returned sat
[2024-05-31 21:27:44] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 418 ms.
[2024-05-31 21:27:45] [INFO ] Deduced a trap composed of 31 places in 821 ms of which 8 ms to minimize.
[2024-05-31 21:27:46] [INFO ] Deduced a trap composed of 56 places in 778 ms of which 10 ms to minimize.
[2024-05-31 21:27:47] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 2053 ms
Maximisation of solution failed !
Minimization took 1 ms.
[2024-05-31 21:27:47] [INFO ] [Real]Absence check using 2 positive place invariants in 12 ms returned sat
[2024-05-31 21:27:47] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-31 21:27:48] [INFO ] [Real]Absence check using state equation in 735 ms returned sat
[2024-05-31 21:27:48] [INFO ] [Real]Added 1588 Read/Feed constraints in 786 ms returned sat
[2024-05-31 21:27:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:27:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-31 21:27:49] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 12 ms returned sat
[2024-05-31 21:27:49] [INFO ] [Nat]Absence check using state equation in 670 ms returned sat
[2024-05-31 21:27:51] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1165 ms returned sat
[2024-05-31 21:27:51] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 411 ms.
[2024-05-31 21:27:53] [INFO ] Deduced a trap composed of 41 places in 776 ms of which 7 ms to minimize.
[2024-05-31 21:27:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 986 ms
[2024-05-31 21:27:53] [INFO ] Added : 15 causal constraints over 3 iterations in 2204 ms. Result :sat
Minimization took 647 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 3, 0, 0] Max Struct:[7, 7, 7, 7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 3, 0, 0] Max Struct:[7, 7, 7, 7]
Support contains 4 out of 1183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Graph (complete) has 4476 edges and 1183 vertex of which 1136 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.7 ms
Discarding 47 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 217 transitions.
Iterating post reduction 0 with 217 rules applied. Total rules applied 218 place count 1136 transition count 2261
Discarding 389 places :
Symmetric choice reduction at 1 with 389 rule applications. Total rules 607 place count 747 transition count 1202
Iterating global reduction 1 with 389 rules applied. Total rules applied 996 place count 747 transition count 1202
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 1005 place count 747 transition count 1193
Discarding 314 places :
Symmetric choice reduction at 2 with 314 rule applications. Total rules 1319 place count 433 transition count 879
Iterating global reduction 2 with 314 rules applied. Total rules applied 1633 place count 433 transition count 879
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1645 place count 433 transition count 867
Discarding 239 places :
Symmetric choice reduction at 3 with 239 rule applications. Total rules 1884 place count 194 transition count 531
Iterating global reduction 3 with 239 rules applied. Total rules applied 2123 place count 194 transition count 531
Ensure Unique test removed 211 transitions
Reduce isomorphic transitions removed 211 transitions.
Iterating post reduction 3 with 211 rules applied. Total rules applied 2334 place count 194 transition count 320
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 2358 place count 170 transition count 281
Iterating global reduction 4 with 24 rules applied. Total rules applied 2382 place count 170 transition count 281
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2388 place count 170 transition count 275
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 2404 place count 154 transition count 259
Iterating global reduction 5 with 16 rules applied. Total rules applied 2420 place count 154 transition count 259
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2424 place count 154 transition count 255
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 2437 place count 141 transition count 242
Iterating global reduction 6 with 13 rules applied. Total rules applied 2450 place count 141 transition count 242
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 2460 place count 141 transition count 232
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 2463 place count 138 transition count 223
Iterating global reduction 7 with 3 rules applied. Total rules applied 2466 place count 138 transition count 223
Applied a total of 2466 rules in 259 ms. Remains 138 /1183 variables (removed 1045) and now considering 223/2478 (removed 2255) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 275 ms. Remains : 138/1183 places, 223/2478 transitions.
// Phase 1: matrix 223 rows 138 cols
[2024-05-31 21:27:54] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 3, 0, 0] Max Struct:[7, 7, 7, 7]
RANDOM walk for 1000000 steps (229791 resets) in 2670 ms. (374 steps per ms)
BEST_FIRST walk for 4000003 steps (383762 resets) in 4612 ms. (867 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 4, 0, 0] Max Struct:[7, 7, 7, 7]
[2024-05-31 21:28:01] [INFO ] Invariant cache hit.
[2024-05-31 21:28:01] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:28:01] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-05-31 21:28:01] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-31 21:28:01] [INFO ] [Real]Added 91 Read/Feed constraints in 19 ms returned sat
[2024-05-31 21:28:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:28:01] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:28:01] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-05-31 21:28:01] [INFO ] [Nat]Added 91 Read/Feed constraints in 22 ms returned sat
[2024-05-31 21:28:01] [INFO ] Computed and/alt/rep : 53/130/53 causal constraints (skipped 169 transitions) in 25 ms.
[2024-05-31 21:28:01] [INFO ] Added : 12 causal constraints over 3 iterations in 89 ms. Result :sat
Minimization took 149 ms.
[2024-05-31 21:28:02] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:28:02] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-05-31 21:28:02] [INFO ] [Real]Added 91 Read/Feed constraints in 16 ms returned sat
[2024-05-31 21:28:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:28:02] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:28:02] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-05-31 21:28:02] [INFO ] [Nat]Added 91 Read/Feed constraints in 15 ms returned sat
[2024-05-31 21:28:02] [INFO ] Computed and/alt/rep : 53/130/53 causal constraints (skipped 169 transitions) in 17 ms.
[2024-05-31 21:28:02] [INFO ] Added : 1 causal constraints over 1 iterations in 45 ms. Result :sat
Minimization took 128 ms.
[2024-05-31 21:28:02] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:28:02] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-05-31 21:28:02] [INFO ] [Real]Added 91 Read/Feed constraints in 15 ms returned sat
[2024-05-31 21:28:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:28:02] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:28:02] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2024-05-31 21:28:02] [INFO ] [Nat]Added 91 Read/Feed constraints in 21 ms returned sat
[2024-05-31 21:28:02] [INFO ] Computed and/alt/rep : 53/130/53 causal constraints (skipped 169 transitions) in 18 ms.
[2024-05-31 21:28:02] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-31 21:28:02] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-31 21:28:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 176 ms
[2024-05-31 21:28:02] [INFO ] Added : 14 causal constraints over 4 iterations in 272 ms. Result :sat
Minimization took 151 ms.
[2024-05-31 21:28:03] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:28:03] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-05-31 21:28:03] [INFO ] [Real]Added 91 Read/Feed constraints in 18 ms returned sat
[2024-05-31 21:28:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:28:03] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:28:03] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-05-31 21:28:03] [INFO ] [Nat]Added 91 Read/Feed constraints in 22 ms returned sat
[2024-05-31 21:28:03] [INFO ] Computed and/alt/rep : 53/130/53 causal constraints (skipped 169 transitions) in 17 ms.
[2024-05-31 21:28:03] [INFO ] Added : 15 causal constraints over 4 iterations in 94 ms. Result :sat
Minimization took 150 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 4, 0, 0] Max Struct:[7, 7, 7, 7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 4, 0, 0] Max Struct:[7, 7, 7, 7]
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 223/223 transitions.
Applied a total of 0 rules in 14 ms. Remains 138 /138 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 138/138 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 223/223 transitions.
Applied a total of 0 rules in 15 ms. Remains 138 /138 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2024-05-31 21:28:03] [INFO ] Invariant cache hit.
[2024-05-31 21:28:04] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-31 21:28:04] [INFO ] Invariant cache hit.
[2024-05-31 21:28:04] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-31 21:28:04] [INFO ] Implicit Places using invariants and state equation in 577 ms returned []
Implicit Place search using SMT with State Equation took 681 ms to find 0 implicit places.
[2024-05-31 21:28:04] [INFO ] Redundant transitions in 8 ms returned []
Running 222 sub problems to find dead transitions.
[2024-05-31 21:28:04] [INFO ] Invariant cache hit.
[2024-05-31 21:28:04] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (OVERLAPS) 1/138 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (OVERLAPS) 223/361 variables, 138/140 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 91/231 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (OVERLAPS) 0/361 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Real declared 361/361 variables, and 231 constraints, problems are : Problem set: 0 solved, 222 unsolved in 8404 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 138/138 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (OVERLAPS) 1/138 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (OVERLAPS) 223/361 variables, 138/140 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 91/231 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 222/453 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 8 (OVERLAPS) 0/361 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Int declared 361/361 variables, and 453 constraints, problems are : Problem set: 0 solved, 222 unsolved in 14399 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 138/138 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 0/0 constraints]
After SMT, in 23297ms problems are : Problem set: 0 solved, 222 unsolved
Search for dead transitions found 0 dead transitions in 23310ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24030 ms. Remains : 138/138 places, 223/223 transitions.
[2024-05-31 21:28:27] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 4, 0, 0] Max Struct:[7, 7, 7, 7]
RANDOM walk for 1000000 steps (230368 resets) in 2716 ms. (368 steps per ms)
BEST_FIRST walk for 4000003 steps (384086 resets) in 4751 ms. (841 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 4, 0, 0] Max Struct:[7, 7, 7, 7]
[2024-05-31 21:28:35] [INFO ] Invariant cache hit.
[2024-05-31 21:28:35] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:28:35] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2024-05-31 21:28:35] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-31 21:28:35] [INFO ] [Real]Added 91 Read/Feed constraints in 18 ms returned sat
[2024-05-31 21:28:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:28:35] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:28:35] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2024-05-31 21:28:35] [INFO ] [Nat]Added 91 Read/Feed constraints in 26 ms returned sat
[2024-05-31 21:28:35] [INFO ] Computed and/alt/rep : 53/130/53 causal constraints (skipped 169 transitions) in 21 ms.
[2024-05-31 21:28:35] [INFO ] Added : 12 causal constraints over 3 iterations in 83 ms. Result :sat
Minimization took 137 ms.
[2024-05-31 21:28:35] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:28:35] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2024-05-31 21:28:35] [INFO ] [Real]Added 91 Read/Feed constraints in 15 ms returned sat
[2024-05-31 21:28:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:28:36] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:28:36] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2024-05-31 21:28:36] [INFO ] [Nat]Added 91 Read/Feed constraints in 15 ms returned sat
[2024-05-31 21:28:36] [INFO ] Computed and/alt/rep : 53/130/53 causal constraints (skipped 169 transitions) in 15 ms.
[2024-05-31 21:28:36] [INFO ] Added : 1 causal constraints over 1 iterations in 39 ms. Result :sat
Minimization took 120 ms.
[2024-05-31 21:28:36] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:28:36] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-05-31 21:28:36] [INFO ] [Real]Added 91 Read/Feed constraints in 14 ms returned sat
[2024-05-31 21:28:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:28:36] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:28:36] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2024-05-31 21:28:36] [INFO ] [Nat]Added 91 Read/Feed constraints in 19 ms returned sat
[2024-05-31 21:28:36] [INFO ] Computed and/alt/rep : 53/130/53 causal constraints (skipped 169 transitions) in 18 ms.
[2024-05-31 21:28:36] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-31 21:28:36] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-31 21:28:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 174 ms
[2024-05-31 21:28:36] [INFO ] Added : 14 causal constraints over 4 iterations in 273 ms. Result :sat
Minimization took 140 ms.
[2024-05-31 21:28:36] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:28:37] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2024-05-31 21:28:37] [INFO ] [Real]Added 91 Read/Feed constraints in 18 ms returned sat
[2024-05-31 21:28:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:28:37] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:28:37] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-05-31 21:28:37] [INFO ] [Nat]Added 91 Read/Feed constraints in 22 ms returned sat
[2024-05-31 21:28:37] [INFO ] Computed and/alt/rep : 53/130/53 causal constraints (skipped 169 transitions) in 18 ms.
[2024-05-31 21:28:37] [INFO ] Added : 15 causal constraints over 4 iterations in 89 ms. Result :sat
Minimization took 142 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 4, 0, 0] Max Struct:[7, 7, 7, 7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 4, 0, 0] Max Struct:[7, 7, 7, 7]
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 223/223 transitions.
Applied a total of 0 rules in 7 ms. Remains 138 /138 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 138/138 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 223/223 transitions.
Applied a total of 0 rules in 9 ms. Remains 138 /138 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2024-05-31 21:28:37] [INFO ] Invariant cache hit.
[2024-05-31 21:28:37] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-31 21:28:37] [INFO ] Invariant cache hit.
[2024-05-31 21:28:37] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-31 21:28:38] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 485 ms to find 0 implicit places.
[2024-05-31 21:28:38] [INFO ] Redundant transitions in 14 ms returned []
Running 222 sub problems to find dead transitions.
[2024-05-31 21:28:38] [INFO ] Invariant cache hit.
[2024-05-31 21:28:38] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (OVERLAPS) 1/138 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (OVERLAPS) 223/361 variables, 138/140 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 91/231 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (OVERLAPS) 0/361 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Real declared 361/361 variables, and 231 constraints, problems are : Problem set: 0 solved, 222 unsolved in 8165 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 138/138 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (OVERLAPS) 1/138 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (OVERLAPS) 223/361 variables, 138/140 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 91/231 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 222/453 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 8 (OVERLAPS) 0/361 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Int declared 361/361 variables, and 453 constraints, problems are : Problem set: 0 solved, 222 unsolved in 14718 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 138/138 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 0/0 constraints]
After SMT, in 23257ms problems are : Problem set: 0 solved, 222 unsolved
Search for dead transitions found 0 dead transitions in 23261ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23779 ms. Remains : 138/138 places, 223/223 transitions.
RANDOM walk for 40000 steps (9205 resets) in 1293 ms. (30 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (3869 resets) in 320 ms. (124 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (3786 resets) in 149 ms. (266 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (3968 resets) in 141 ms. (281 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (3832 resets) in 138 ms. (287 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (3698 resets) in 145 ms. (273 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (3866 resets) in 188 ms. (211 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (3818 resets) in 141 ms. (281 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (3816 resets) in 136 ms. (291 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 522485 steps, run timeout after 3001 ms. (steps per millisecond=174 ) properties seen :3 out of 8
Probabilistic random walk after 522485 steps, saw 206127 distinct states, run finished after 3015 ms. (steps per millisecond=173 ) properties seen :3
[2024-05-31 21:29:05] [INFO ] Invariant cache hit.
[2024-05-31 21:29:05] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 93/97 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 144/241 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem MAX0 is UNSAT
Problem MAX2 is UNSAT
Problem MAX3 is UNSAT
At refinement iteration 5 (OVERLAPS) 113/354 variables, 37/136 constraints. Problems are: Problem set: 3 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 88/224 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 0/224 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 7/361 variables, 4/228 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/361 variables, 3/231 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-05-31 21:29:05] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 3 ms to minimize.
Problem MAX1 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/361 variables, 1/232 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/361 variables, 0/232 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/361 variables, 0/232 constraints. Problems are: Problem set: 4 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 361/361 variables, and 232 constraints, problems are : Problem set: 4 solved, 1 unsolved in 307 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 138/138 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 4 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 142/145 variables, 4/5 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 8/13 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 1/14 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/14 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 75/220 variables, 1/15 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 55/70 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/220 variables, 0/70 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 19/239 variables, 1/71 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/239 variables, 13/84 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/239 variables, 0/84 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 122/361 variables, 65/149 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/361 variables, 83/232 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/361 variables, 1/233 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/361 variables, 0/233 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/361 variables, 0/233 constraints. Problems are: Problem set: 4 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 361/361 variables, and 233 constraints, problems are : Problem set: 4 solved, 1 unsolved in 115 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 138/138 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1/5 constraints, Known Traps: 1/1 constraints]
After SMT, in 435ms problems are : Problem set: 4 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 223/223 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 135 transition count 220
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 135 transition count 220
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 132 transition count 213
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 132 transition count 213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 132 transition count 212
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 129 transition count 201
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 129 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 129 transition count 200
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 22 place count 127 transition count 192
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 127 transition count 192
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 126 transition count 191
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 126 transition count 191
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 29 place count 126 transition count 188
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 32 place count 123 transition count 168
Iterating global reduction 3 with 3 rules applied. Total rules applied 35 place count 123 transition count 168
Applied a total of 35 rules in 36 ms. Remains 123 /138 variables (removed 15) and now considering 168/223 (removed 55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 123/138 places, 168/223 transitions.
RANDOM walk for 40000 steps (9153 resets) in 173 ms. (229 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3869 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1602040 steps, run timeout after 3001 ms. (steps per millisecond=533 ) properties seen :0 out of 1
Probabilistic random walk after 1602040 steps, saw 675300 distinct states, run finished after 3001 ms. (steps per millisecond=533 ) properties seen :0
// Phase 1: matrix 168 rows 123 cols
[2024-05-31 21:29:08] [INFO ] Computed 2 invariants in 5 ms
[2024-05-31 21:29:08] [INFO ] State equation strengthened by 49 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 129/132 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 72/204 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 53/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 15/219 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 72/291 variables, 54/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/291 variables, 41/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/291 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/291 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 174 constraints, problems are : Problem set: 0 solved, 1 unsolved in 107 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 123/123 constraints, ReadFeed: 49/49 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 129/132 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 72/204 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 53/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 15/219 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 72/291 variables, 54/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/291 variables, 41/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/291 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/291 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 175 constraints, problems are : Problem set: 0 solved, 1 unsolved in 110 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 123/123 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 239ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 5 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 123/123 places, 168/168 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 6 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2024-05-31 21:29:09] [INFO ] Invariant cache hit.
[2024-05-31 21:29:09] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-31 21:29:09] [INFO ] Invariant cache hit.
[2024-05-31 21:29:09] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-31 21:29:09] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
[2024-05-31 21:29:09] [INFO ] Redundant transitions in 1 ms returned []
Running 167 sub problems to find dead transitions.
[2024-05-31 21:29:09] [INFO ] Invariant cache hit.
[2024-05-31 21:29:09] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/125 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 49/174 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (OVERLAPS) 0/291 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 174 constraints, problems are : Problem set: 0 solved, 167 unsolved in 5957 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 123/123 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/125 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 49/174 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 167/341 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (OVERLAPS) 0/291 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 341 constraints, problems are : Problem set: 0 solved, 167 unsolved in 9177 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 123/123 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints]
After SMT, in 15366ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 15368ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15726 ms. Remains : 123/123 places, 168/168 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 123 transition count 157
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 14 place count 120 transition count 157
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 14 place count 120 transition count 146
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 36 place count 109 transition count 146
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 108 transition count 145
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 108 transition count 145
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 107 transition count 144
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 107 transition count 144
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 44 place count 105 transition count 142
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 48 place count 103 transition count 164
Free-agglomeration rule applied 9 times.
Iterating global reduction 2 with 9 rules applied. Total rules applied 57 place count 103 transition count 155
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 66 place count 94 transition count 155
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 69 place count 94 transition count 155
Applied a total of 69 rules in 38 ms. Remains 94 /123 variables (removed 29) and now considering 155/168 (removed 13) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 155 rows 94 cols
[2024-05-31 21:29:24] [INFO ] Computed 6 invariants in 1 ms
[2024-05-31 21:29:24] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 21:29:24] [INFO ] [Real]Absence check using 1 positive and 5 generalized place invariants in 3 ms returned sat
[2024-05-31 21:29:24] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:29:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-31 21:29:25] [INFO ] [Nat]Absence check using 1 positive and 5 generalized place invariants in 4 ms returned sat
[2024-05-31 21:29:25] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 21:29:25] [INFO ] After 47ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 21:29:25] [INFO ] After 86ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 176 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 4, 0, 0] Max Struct:[7, 7, 7, 7]
Starting property specific reduction for DBSingleClientW-PT-d2m07-UpperBounds-04
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:[7]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[7]
// Phase 1: matrix 223 rows 138 cols
[2024-05-31 21:29:25] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10000 steps (2321 resets) in 26 ms. (370 steps per ms)
BEST_FIRST walk for 10000 steps (951 resets) in 13 ms. (714 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-31 21:29:25] [INFO ] Invariant cache hit.
[2024-05-31 21:29:25] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:29:25] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-05-31 21:29:25] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-31 21:29:25] [INFO ] [Real]Added 91 Read/Feed constraints in 18 ms returned sat
[2024-05-31 21:29:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:29:25] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:29:25] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-05-31 21:29:25] [INFO ] [Nat]Added 91 Read/Feed constraints in 24 ms returned sat
[2024-05-31 21:29:25] [INFO ] Computed and/alt/rep : 53/130/53 causal constraints (skipped 169 transitions) in 16 ms.
[2024-05-31 21:29:25] [INFO ] Added : 12 causal constraints over 3 iterations in 71 ms. Result :sat
Minimization took 141 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 223/223 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 136 transition count 221
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 136 transition count 221
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 134 transition count 216
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 134 transition count 216
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 132 transition count 213
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 132 transition count 213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 132 transition count 212
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 130 transition count 204
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 130 transition count 204
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 129 transition count 203
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 129 transition count 203
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 22 place count 129 transition count 200
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 25 place count 126 transition count 180
Iterating global reduction 2 with 3 rules applied. Total rules applied 28 place count 126 transition count 180
Applied a total of 28 rules in 18 ms. Remains 126 /138 variables (removed 12) and now considering 180/223 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 126/138 places, 180/223 transitions.
// Phase 1: matrix 180 rows 126 cols
[2024-05-31 21:29:25] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 1000000 steps (229722 resets) in 2329 ms. (429 steps per ms)
BEST_FIRST walk for 1000001 steps (95176 resets) in 1027 ms. (972 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-31 21:29:29] [INFO ] Invariant cache hit.
[2024-05-31 21:29:29] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:29:29] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2024-05-31 21:29:29] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-31 21:29:29] [INFO ] [Real]Added 58 Read/Feed constraints in 10 ms returned sat
[2024-05-31 21:29:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:29:29] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:29:29] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2024-05-31 21:29:29] [INFO ] [Nat]Added 58 Read/Feed constraints in 12 ms returned sat
[2024-05-31 21:29:29] [INFO ] Computed and/alt/rep : 50/119/50 causal constraints (skipped 129 transitions) in 14 ms.
[2024-05-31 21:29:29] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-05-31 21:29:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2024-05-31 21:29:29] [INFO ] Added : 19 causal constraints over 4 iterations in 194 ms. Result :sat
Minimization took 92 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 180/180 transitions.
Applied a total of 0 rules in 4 ms. Remains 126 /126 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 126/126 places, 180/180 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 180/180 transitions.
Applied a total of 0 rules in 3 ms. Remains 126 /126 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-31 21:29:29] [INFO ] Invariant cache hit.
[2024-05-31 21:29:29] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-31 21:29:29] [INFO ] Invariant cache hit.
[2024-05-31 21:29:29] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-31 21:29:30] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
[2024-05-31 21:29:30] [INFO ] Redundant transitions in 1 ms returned []
Running 179 sub problems to find dead transitions.
[2024-05-31 21:29:30] [INFO ] Invariant cache hit.
[2024-05-31 21:29:30] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 180/306 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 58/186 constraints. Problems are: Problem set: 0 solved, 179 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (OVERLAPS) 0/306 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 186 constraints, problems are : Problem set: 0 solved, 179 unsolved in 4703 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 180/306 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 58/186 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 179/365 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (OVERLAPS) 0/306 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 365 constraints, problems are : Problem set: 0 solved, 179 unsolved in 11914 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints]
After SMT, in 16880ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 16885ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17267 ms. Remains : 126/126 places, 180/180 transitions.
RANDOM walk for 40000 steps (9166 resets) in 196 ms. (203 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (3685 resets) in 90 ms. (439 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3746 resets) in 77 ms. (512 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1613909 steps, run timeout after 3001 ms. (steps per millisecond=537 ) properties seen :1 out of 2
Probabilistic random walk after 1613909 steps, saw 675135 distinct states, run finished after 3005 ms. (steps per millisecond=537 ) properties seen :1
[2024-05-31 21:29:50] [INFO ] Invariant cache hit.
[2024-05-31 21:29:50] [INFO ] State equation strengthened by 58 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) 74/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 131/221 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 297/306 variables, and 123 constraints, problems are : Problem set: 1 solved, 0 unsolved in 118 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 121/126 constraints, ReadFeed: 0/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 130ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[7]
Ending property specific reduction for DBSingleClientW-PT-d2m07-UpperBounds-04 in 25123 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m07-UpperBounds-11
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:[7]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[7]
// Phase 1: matrix 223 rows 138 cols
[2024-05-31 21:29:50] [INFO ] Computed 2 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10000 steps (2272 resets) in 33 ms. (294 steps per ms)
BEST_FIRST walk for 10001 steps (965 resets) in 13 ms. (714 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[7]
[2024-05-31 21:29:50] [INFO ] Invariant cache hit.
[2024-05-31 21:29:50] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:29:50] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2024-05-31 21:29:50] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-31 21:29:50] [INFO ] [Real]Added 91 Read/Feed constraints in 16 ms returned sat
[2024-05-31 21:29:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:29:50] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:29:50] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-05-31 21:29:50] [INFO ] [Nat]Added 91 Read/Feed constraints in 17 ms returned sat
[2024-05-31 21:29:50] [INFO ] Computed and/alt/rep : 53/130/53 causal constraints (skipped 169 transitions) in 15 ms.
[2024-05-31 21:29:50] [INFO ] Added : 1 causal constraints over 1 iterations in 41 ms. Result :sat
Minimization took 131 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[7]
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 223/223 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 135 transition count 220
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 135 transition count 220
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 132 transition count 213
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 132 transition count 213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 132 transition count 212
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 129 transition count 201
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 129 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 129 transition count 200
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 22 place count 127 transition count 192
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 127 transition count 192
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 126 transition count 191
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 126 transition count 191
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 29 place count 126 transition count 188
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 32 place count 123 transition count 168
Iterating global reduction 3 with 3 rules applied. Total rules applied 35 place count 123 transition count 168
Applied a total of 35 rules in 15 ms. Remains 123 /138 variables (removed 15) and now considering 168/223 (removed 55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 123/138 places, 168/223 transitions.
// Phase 1: matrix 168 rows 123 cols
[2024-05-31 21:29:50] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[7]
RANDOM walk for 1000000 steps (229945 resets) in 2232 ms. (447 steps per ms)
BEST_FIRST walk for 1000001 steps (96145 resets) in 987 ms. (1012 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[7]
[2024-05-31 21:29:53] [INFO ] Invariant cache hit.
[2024-05-31 21:29:53] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:29:54] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-05-31 21:29:54] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-31 21:29:54] [INFO ] [Real]Added 49 Read/Feed constraints in 10 ms returned sat
[2024-05-31 21:29:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:29:54] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:29:54] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-05-31 21:29:54] [INFO ] [Nat]Added 49 Read/Feed constraints in 7 ms returned sat
[2024-05-31 21:29:54] [INFO ] Computed and/alt/rep : 49/115/49 causal constraints (skipped 118 transitions) in 12 ms.
[2024-05-31 21:29:54] [INFO ] Added : 1 causal constraints over 1 iterations in 31 ms. Result :sat
Minimization took 50 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[7]
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 4 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 123/123 places, 168/168 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 3 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2024-05-31 21:29:54] [INFO ] Invariant cache hit.
[2024-05-31 21:29:54] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-31 21:29:54] [INFO ] Invariant cache hit.
[2024-05-31 21:29:54] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-31 21:29:54] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
[2024-05-31 21:29:54] [INFO ] Redundant transitions in 1 ms returned []
Running 167 sub problems to find dead transitions.
[2024-05-31 21:29:54] [INFO ] Invariant cache hit.
[2024-05-31 21:29:54] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/125 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 49/174 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (OVERLAPS) 0/291 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 174 constraints, problems are : Problem set: 0 solved, 167 unsolved in 5890 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 123/123 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/125 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 49/174 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 167/341 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (OVERLAPS) 0/291 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 341 constraints, problems are : Problem set: 0 solved, 167 unsolved in 11527 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 123/123 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints]
After SMT, in 17627ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 17629ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18137 ms. Remains : 123/123 places, 168/168 transitions.
[2024-05-31 21:30:12] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[7]
RANDOM walk for 1000000 steps (230148 resets) in 2221 ms. (450 steps per ms)
BEST_FIRST walk for 1000001 steps (95911 resets) in 986 ms. (1013 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[7]
[2024-05-31 21:30:15] [INFO ] Invariant cache hit.
[2024-05-31 21:30:15] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:30:15] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-05-31 21:30:15] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-31 21:30:15] [INFO ] [Real]Added 49 Read/Feed constraints in 6 ms returned sat
[2024-05-31 21:30:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:30:15] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:30:15] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-05-31 21:30:15] [INFO ] [Nat]Added 49 Read/Feed constraints in 10 ms returned sat
[2024-05-31 21:30:15] [INFO ] Computed and/alt/rep : 49/115/49 causal constraints (skipped 118 transitions) in 13 ms.
[2024-05-31 21:30:15] [INFO ] Added : 1 causal constraints over 1 iterations in 30 ms. Result :sat
Minimization took 59 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[7]
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 5 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 123/123 places, 168/168 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 3 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2024-05-31 21:30:15] [INFO ] Invariant cache hit.
[2024-05-31 21:30:15] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-31 21:30:15] [INFO ] Invariant cache hit.
[2024-05-31 21:30:16] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-31 21:30:16] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2024-05-31 21:30:16] [INFO ] Redundant transitions in 1 ms returned []
Running 167 sub problems to find dead transitions.
[2024-05-31 21:30:16] [INFO ] Invariant cache hit.
[2024-05-31 21:30:16] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/125 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 49/174 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (OVERLAPS) 0/291 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 174 constraints, problems are : Problem set: 0 solved, 167 unsolved in 6097 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 123/123 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/125 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 49/174 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 167/341 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (OVERLAPS) 0/291 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 341 constraints, problems are : Problem set: 0 solved, 167 unsolved in 9444 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 123/123 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints]
After SMT, in 15741ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 15744ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16095 ms. Remains : 123/123 places, 168/168 transitions.
RANDOM walk for 40000 steps (9168 resets) in 168 ms. (236 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3900 resets) in 82 ms. (481 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (3833 resets) in 74 ms. (533 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 961677 steps, run timeout after 3001 ms. (steps per millisecond=320 ) properties seen :0 out of 2
Probabilistic random walk after 961677 steps, saw 405911 distinct states, run finished after 3001 ms. (steps per millisecond=320 ) properties seen :0
[2024-05-31 21:30:35] [INFO ] Invariant cache hit.
[2024-05-31 21:30:35] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 129/132 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 72/204 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 53/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 15/219 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 72/291 variables, 54/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/291 variables, 41/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 21:30:35] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 14 (INCLUDED_ONLY) 0/291 variables, 1/175 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/291 variables, 0/175 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/291 variables, 0/175 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 175 constraints, problems are : Problem set: 1 solved, 1 unsolved in 211 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 123/123 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 129/132 variables, 4/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 8/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 1/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 72/204 variables, 1/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 53/68 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 0/68 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 15/219 variables, 1/69 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 11/80 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 0/80 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 72/291 variables, 54/134 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/291 variables, 41/175 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/291 variables, 1/176 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/291 variables, 0/176 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/291 variables, 0/176 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 176 constraints, problems are : Problem set: 1 solved, 1 unsolved in 119 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 123/123 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 338ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 5 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 123/123 places, 168/168 transitions.
RANDOM walk for 40000 steps (9091 resets) in 134 ms. (296 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3878 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1836075 steps, run timeout after 3001 ms. (steps per millisecond=611 ) properties seen :0 out of 1
Probabilistic random walk after 1836075 steps, saw 766654 distinct states, run finished after 3001 ms. (steps per millisecond=611 ) properties seen :0
[2024-05-31 21:30:38] [INFO ] Invariant cache hit.
[2024-05-31 21:30:38] [INFO ] State equation strengthened by 49 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 129/132 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 72/204 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 53/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 15/219 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 72/291 variables, 54/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/291 variables, 41/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/291 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/291 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 174 constraints, problems are : Problem set: 0 solved, 1 unsolved in 97 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 123/123 constraints, ReadFeed: 49/49 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 129/132 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 72/204 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 53/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 15/219 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 72/291 variables, 54/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/291 variables, 41/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/291 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/291 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 175 constraints, problems are : Problem set: 0 solved, 1 unsolved in 97 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 123/123 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 199ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 6 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 123/123 places, 168/168 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 3 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2024-05-31 21:30:38] [INFO ] Invariant cache hit.
[2024-05-31 21:30:38] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-31 21:30:38] [INFO ] Invariant cache hit.
[2024-05-31 21:30:38] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-31 21:30:39] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2024-05-31 21:30:39] [INFO ] Redundant transitions in 1 ms returned []
Running 167 sub problems to find dead transitions.
[2024-05-31 21:30:39] [INFO ] Invariant cache hit.
[2024-05-31 21:30:39] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/125 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 49/174 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (OVERLAPS) 0/291 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 174 constraints, problems are : Problem set: 0 solved, 167 unsolved in 6095 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 123/123 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/125 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 49/174 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 167/341 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (OVERLAPS) 0/291 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 341 constraints, problems are : Problem set: 0 solved, 167 unsolved in 9269 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 123/123 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints]
After SMT, in 15572ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 15574ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15919 ms. Remains : 123/123 places, 168/168 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 123 transition count 157
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 14 place count 120 transition count 157
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 14 place count 120 transition count 146
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 36 place count 109 transition count 146
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 108 transition count 145
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 108 transition count 145
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 107 transition count 144
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 107 transition count 144
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 44 place count 105 transition count 142
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 48 place count 103 transition count 164
Free-agglomeration rule applied 9 times.
Iterating global reduction 2 with 9 rules applied. Total rules applied 57 place count 103 transition count 155
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 66 place count 94 transition count 155
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 69 place count 94 transition count 155
Applied a total of 69 rules in 21 ms. Remains 94 /123 variables (removed 29) and now considering 155/168 (removed 13) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 155 rows 94 cols
[2024-05-31 21:30:54] [INFO ] Computed 6 invariants in 4 ms
[2024-05-31 21:30:54] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 21:30:54] [INFO ] [Real]Absence check using 1 positive and 5 generalized place invariants in 4 ms returned sat
[2024-05-31 21:30:54] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:30:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-31 21:30:54] [INFO ] [Nat]Absence check using 1 positive and 5 generalized place invariants in 3 ms returned sat
[2024-05-31 21:30:54] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 21:30:54] [INFO ] After 47ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 21:30:54] [INFO ] After 84ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 149 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[4] Max Struct:[7]
Ending property specific reduction for DBSingleClientW-PT-d2m07-UpperBounds-11 in 64606 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m07-UpperBounds-13
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:[7]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[7]
// Phase 1: matrix 223 rows 138 cols
[2024-05-31 21:30:54] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10000 steps (2298 resets) in 28 ms. (344 steps per ms)
BEST_FIRST walk for 10001 steps (930 resets) in 13 ms. (714 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-31 21:30:54] [INFO ] Invariant cache hit.
[2024-05-31 21:30:54] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:30:54] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-05-31 21:30:54] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-31 21:30:54] [INFO ] [Real]Added 91 Read/Feed constraints in 13 ms returned sat
[2024-05-31 21:30:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:30:55] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:30:55] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2024-05-31 21:30:55] [INFO ] [Nat]Added 91 Read/Feed constraints in 21 ms returned sat
[2024-05-31 21:30:55] [INFO ] Computed and/alt/rep : 53/130/53 causal constraints (skipped 169 transitions) in 16 ms.
[2024-05-31 21:30:55] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-31 21:30:55] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-31 21:30:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 183 ms
[2024-05-31 21:30:55] [INFO ] Added : 14 causal constraints over 4 iterations in 278 ms. Result :sat
Minimization took 165 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 223/223 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 136 transition count 221
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 136 transition count 221
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 134 transition count 218
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 134 transition count 218
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 134 transition count 217
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 132 transition count 207
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 132 transition count 207
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 132 transition count 206
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 131 transition count 199
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 131 transition count 199
Applied a total of 16 rules in 12 ms. Remains 131 /138 variables (removed 7) and now considering 199/223 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 131/138 places, 199/223 transitions.
// Phase 1: matrix 199 rows 131 cols
[2024-05-31 21:30:55] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 1000000 steps (229910 resets) in 2479 ms. (403 steps per ms)
BEST_FIRST walk for 1000000 steps (96550 resets) in 1093 ms. (914 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-31 21:30:59] [INFO ] Invariant cache hit.
[2024-05-31 21:30:59] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:30:59] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-05-31 21:30:59] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-31 21:30:59] [INFO ] [Real]Added 73 Read/Feed constraints in 15 ms returned sat
[2024-05-31 21:30:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:30:59] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:30:59] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-05-31 21:30:59] [INFO ] [Nat]Added 73 Read/Feed constraints in 14 ms returned sat
[2024-05-31 21:30:59] [INFO ] Computed and/alt/rep : 51/122/51 causal constraints (skipped 147 transitions) in 15 ms.
[2024-05-31 21:30:59] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-05-31 21:30:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2024-05-31 21:30:59] [INFO ] Added : 11 causal constraints over 3 iterations in 160 ms. Result :sat
Minimization took 100 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 131 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 131/131 places, 199/199 transitions.
Applied a total of 0 rules in 4 ms. Remains 131 /131 variables (removed 0) and now considering 199/199 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 131/131 places, 199/199 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 131/131 places, 199/199 transitions.
Applied a total of 0 rules in 3 ms. Remains 131 /131 variables (removed 0) and now considering 199/199 (removed 0) transitions.
[2024-05-31 21:30:59] [INFO ] Invariant cache hit.
[2024-05-31 21:30:59] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-31 21:30:59] [INFO ] Invariant cache hit.
[2024-05-31 21:30:59] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-31 21:31:00] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
[2024-05-31 21:31:00] [INFO ] Redundant transitions in 1 ms returned []
Running 198 sub problems to find dead transitions.
[2024-05-31 21:31:00] [INFO ] Invariant cache hit.
[2024-05-31 21:31:00] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 1/131 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 199/330 variables, 131/133 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/330 variables, 73/206 constraints. Problems are: Problem set: 0 solved, 198 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (OVERLAPS) 0/330 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 206 constraints, problems are : Problem set: 0 solved, 198 unsolved in 5366 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 131/131 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 1/131 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 199/330 variables, 131/133 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/330 variables, 73/206 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 198/404 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (OVERLAPS) 0/330 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 404 constraints, problems are : Problem set: 0 solved, 198 unsolved in 12448 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 131/131 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints]
After SMT, in 18121ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 18123ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18510 ms. Remains : 131/131 places, 199/199 transitions.
RANDOM walk for 40000 steps (9209 resets) in 235 ms. (169 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3715 resets) in 100 ms. (396 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3859 resets) in 102 ms. (388 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1529793 steps, run timeout after 3001 ms. (steps per millisecond=509 ) properties seen :1 out of 2
Probabilistic random walk after 1529793 steps, saw 625474 distinct states, run finished after 3001 ms. (steps per millisecond=509 ) properties seen :1
[2024-05-31 21:31:21] [INFO ] Invariant cache hit.
[2024-05-31 21:31:21] [INFO ] State equation strengthened by 73 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) 29/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 63/93 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 136/229 variables, 93/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 321/330 variables, and 128 constraints, problems are : Problem set: 1 solved, 0 unsolved in 94 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/131 constraints, ReadFeed: 0/73 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 103ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[7]
Ending property specific reduction for DBSingleClientW-PT-d2m07-UpperBounds-13 in 26712 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m07-UpperBounds-15
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:[7]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[7]
// Phase 1: matrix 223 rows 138 cols
[2024-05-31 21:31:21] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10000 steps (2266 resets) in 32 ms. (303 steps per ms)
BEST_FIRST walk for 10001 steps (980 resets) in 13 ms. (714 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-31 21:31:21] [INFO ] Invariant cache hit.
[2024-05-31 21:31:21] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:31:21] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-05-31 21:31:21] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-31 21:31:21] [INFO ] [Real]Added 91 Read/Feed constraints in 18 ms returned sat
[2024-05-31 21:31:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:31:21] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:31:21] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2024-05-31 21:31:21] [INFO ] [Nat]Added 91 Read/Feed constraints in 22 ms returned sat
[2024-05-31 21:31:21] [INFO ] Computed and/alt/rep : 53/130/53 causal constraints (skipped 169 transitions) in 17 ms.
[2024-05-31 21:31:21] [INFO ] Added : 15 causal constraints over 4 iterations in 88 ms. Result :sat
Minimization took 145 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 223/223 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 136 transition count 221
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 136 transition count 221
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 134 transition count 215
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 134 transition count 215
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 134 transition count 214
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 132 transition count 205
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 132 transition count 205
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 131 transition count 204
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 131 transition count 204
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 130 transition count 203
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 130 transition count 203
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 20 place count 130 transition count 200
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 23 place count 127 transition count 180
Iterating global reduction 2 with 3 rules applied. Total rules applied 26 place count 127 transition count 180
Applied a total of 26 rules in 15 ms. Remains 127 /138 variables (removed 11) and now considering 180/223 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 127/138 places, 180/223 transitions.
// Phase 1: matrix 180 rows 127 cols
[2024-05-31 21:31:22] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 1000000 steps (229783 resets) in 2217 ms. (450 steps per ms)
BEST_FIRST walk for 1000001 steps (95708 resets) in 1013 ms. (986 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-31 21:31:25] [INFO ] Invariant cache hit.
[2024-05-31 21:31:25] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:31:25] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-05-31 21:31:25] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-31 21:31:25] [INFO ] [Real]Added 58 Read/Feed constraints in 8 ms returned sat
[2024-05-31 21:31:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:31:25] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:31:25] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2024-05-31 21:31:25] [INFO ] [Nat]Added 58 Read/Feed constraints in 10 ms returned sat
[2024-05-31 21:31:25] [INFO ] Computed and/alt/rep : 50/119/50 causal constraints (skipped 129 transitions) in 14 ms.
[2024-05-31 21:31:25] [INFO ] Added : 11 causal constraints over 3 iterations in 63 ms. Result :sat
Minimization took 82 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 180/180 transitions.
Applied a total of 0 rules in 3 ms. Remains 127 /127 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 127/127 places, 180/180 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 180/180 transitions.
Applied a total of 0 rules in 3 ms. Remains 127 /127 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-31 21:31:25] [INFO ] Invariant cache hit.
[2024-05-31 21:31:25] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-31 21:31:25] [INFO ] Invariant cache hit.
[2024-05-31 21:31:25] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-31 21:31:26] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
[2024-05-31 21:31:26] [INFO ] Redundant transitions in 1 ms returned []
Running 179 sub problems to find dead transitions.
[2024-05-31 21:31:26] [INFO ] Invariant cache hit.
[2024-05-31 21:31:26] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 180/307 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 58/187 constraints. Problems are: Problem set: 0 solved, 179 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (OVERLAPS) 0/307 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 307/307 variables, and 187 constraints, problems are : Problem set: 0 solved, 179 unsolved in 4424 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 127/127 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 180/307 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 58/187 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 179/366 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (OVERLAPS) 0/307 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Int declared 307/307 variables, and 366 constraints, problems are : Problem set: 0 solved, 179 unsolved in 11222 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 127/127 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints]
After SMT, in 15864ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 15866ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16247 ms. Remains : 127/127 places, 180/180 transitions.
RANDOM walk for 40000 steps (9145 resets) in 197 ms. (202 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3855 resets) in 117 ms. (339 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3859 resets) in 88 ms. (449 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1649599 steps, run timeout after 3001 ms. (steps per millisecond=549 ) properties seen :1 out of 2
Probabilistic random walk after 1649599 steps, saw 691446 distinct states, run finished after 3001 ms. (steps per millisecond=549 ) properties seen :1
[2024-05-31 21:31:45] [INFO ] Invariant cache hit.
[2024-05-31 21:31:45] [INFO ] State equation strengthened by 58 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) 75/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 132/223 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 298/307 variables, and 124 constraints, problems are : Problem set: 1 solved, 0 unsolved in 104 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 122/127 constraints, ReadFeed: 0/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 120ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[7]
Ending property specific reduction for DBSingleClientW-PT-d2m07-UpperBounds-15 in 23758 ms.
[2024-05-31 21:31:45] [INFO ] Flatten gal took : 72 ms
[2024-05-31 21:31:45] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-05-31 21:31:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 138 places, 223 transitions and 879 arcs took 4 ms.
Total runtime 259429 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 : DBSingleClientW-PT-d2m07-UpperBounds-04
Could not compute solution for formula : DBSingleClientW-PT-d2m07-UpperBounds-11
Could not compute solution for formula : DBSingleClientW-PT-d2m07-UpperBounds-13
Could not compute solution for formula : DBSingleClientW-PT-d2m07-UpperBounds-15

BK_STOP 1717191105833

--------------------
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 DBSingleClientW-PT-d2m07-UpperBounds-04
ub formula formula --maxsum=/tmp/923/ub_0_
ub formula name DBSingleClientW-PT-d2m07-UpperBounds-11
ub formula formula --maxsum=/tmp/923/ub_1_
ub formula name DBSingleClientW-PT-d2m07-UpperBounds-13
ub formula formula --maxsum=/tmp/923/ub_2_
ub formula name DBSingleClientW-PT-d2m07-UpperBounds-15
ub formula formula --maxsum=/tmp/923/ub_3_
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="DBSingleClientW-PT-d2m07"
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 DBSingleClientW-PT-d2m07, 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 r480-tall-171624189600573"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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