About the Execution of GreatSPN+red for DBSingleClientW-PT-d2m07
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1226.203 | 282306.00 | 343030.00 | 582.60 | 0 0 0 0 1 0 0 0 0 0 0 5 0 1 0 1 | normal |
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.r091-tall-171624188000573.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 greatspnxred
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 r091-tall-171624188000573
=====================================================================
--------------------
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 1716301867078
Invoking MCC driver with
BK_TOOL=greatspnxred
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 greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 14:31:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-21 14:31:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 14:31:08] [INFO ] Load time of PNML (sax parser for PT used): 196 ms
[2024-05-21 14:31:08] [INFO ] Transformed 4763 places.
[2024-05-21 14:31:08] [INFO ] Transformed 2478 transitions.
[2024-05-21 14:31:08] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 311 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 3580 places in 24 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-21 14:31:08] [INFO ] Computed 6 invariants in 134 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 (2320 resets) in 403 ms. (24 steps per ms)
BEST_FIRST walk for 40003 steps (3772 resets) in 250 ms. (159 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 1, 0, 0] Max Struct:[7, 7, 7, 7]
[2024-05-21 14:31:09] [INFO ] Invariant cache hit.
[2024-05-21 14:31:09] [INFO ] [Real]Absence check using 2 positive place invariants in 16 ms returned sat
[2024-05-21 14:31:09] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 19 ms returned sat
[2024-05-21 14:31:10] [INFO ] [Real]Absence check using state equation in 745 ms returned sat
[2024-05-21 14:31:10] [INFO ] State equation strengthened by 1588 read => feed constraints.
[2024-05-21 14:31:11] [INFO ] [Real]Added 1588 Read/Feed constraints in 690 ms returned sat
[2024-05-21 14:31:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 14:31:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 13 ms returned sat
[2024-05-21 14:31:11] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-21 14:31:12] [INFO ] [Nat]Absence check using state equation in 715 ms returned sat
[2024-05-21 14:31:13] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1016 ms returned sat
[2024-05-21 14:31:14] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 681 ms.
[2024-05-21 14:31:16] [INFO ] Deduced a trap composed of 48 places in 807 ms of which 78 ms to minimize.
[2024-05-21 14:31:17] [INFO ] Deduced a trap composed of 51 places in 708 ms of which 11 ms to minimize.
[2024-05-21 14:31:17] [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-21 14:31:17] [INFO ] [Real]Absence check using 2 positive place invariants in 13 ms returned sat
[2024-05-21 14:31:17] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 10 ms returned sat
[2024-05-21 14:31:17] [INFO ] [Real]Absence check using state equation in 575 ms returned sat
[2024-05-21 14:31:18] [INFO ] [Real]Added 1588 Read/Feed constraints in 708 ms returned sat
[2024-05-21 14:31:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 14:31:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 12 ms returned sat
[2024-05-21 14:31:18] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-21 14:31:19] [INFO ] [Nat]Absence check using state equation in 607 ms returned sat
[2024-05-21 14:31:20] [INFO ] [Nat]Added 1588 Read/Feed constraints in 714 ms returned sat
[2024-05-21 14:31:20] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 605 ms.
[2024-05-21 14:31:21] [INFO ] Added : 1 causal constraints over 1 iterations in 877 ms. Result :sat
Minimization took 632 ms.
[2024-05-21 14:31:21] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2024-05-21 14:31:21] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 10 ms returned sat
[2024-05-21 14:31:22] [INFO ] [Real]Absence check using state equation in 593 ms returned sat
[2024-05-21 14:31:23] [INFO ] [Real]Added 1588 Read/Feed constraints in 778 ms returned sat
[2024-05-21 14:31:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 14:31:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 14 ms returned sat
[2024-05-21 14:31:23] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-21 14:31:24] [INFO ] [Nat]Absence check using state equation in 593 ms returned sat
[2024-05-21 14:31:24] [INFO ] [Nat]Added 1588 Read/Feed constraints in 884 ms returned sat
[2024-05-21 14:31:25] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 364 ms.
[2024-05-21 14:31:26] [INFO ] Deduced a trap composed of 31 places in 691 ms of which 8 ms to minimize.
[2024-05-21 14:31:27] [INFO ] Deduced a trap composed of 56 places in 635 ms of which 8 ms to minimize.
[2024-05-21 14:31:28] [INFO ] Deduced a trap composed of 31 places in 693 ms of which 8 ms to minimize.
[2024-05-21 14:31:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.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-21 14:31:29] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-21 14:31:29] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-21 14:31:29] [INFO ] [Real]Absence check using state equation in 617 ms returned sat
[2024-05-21 14:31:30] [INFO ] [Real]Added 1588 Read/Feed constraints in 729 ms returned sat
[2024-05-21 14:31:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 14:31:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-21 14:31:30] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-21 14:31:31] [INFO ] [Nat]Absence check using state equation in 596 ms returned sat
[2024-05-21 14:31:32] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1058 ms returned sat
[2024-05-21 14:31:32] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 356 ms.
[2024-05-21 14:31:33] [INFO ] Deduced a trap composed of 41 places in 632 ms of which 7 ms to minimize.
[2024-05-21 14:31:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 836 ms
[2024-05-21 14:31:34] [INFO ] Added : 15 causal constraints over 3 iterations in 1923 ms. Result :sat
Minimization took 634 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 1, 0, 0] Max Struct:[7, 7, 7, 7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 1, 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 258 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 272 ms. Remains : 138/1183 places, 223/2478 transitions.
// Phase 1: matrix 223 rows 138 cols
[2024-05-21 14:31:35] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 1, 0, 0] Max Struct:[7, 7, 7, 7]
RANDOM walk for 1000000 steps (230021 resets) in 1543 ms. (647 steps per ms)
BEST_FIRST walk for 4000003 steps (382113 resets) in 2837 ms. (1409 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 4, 0, 0] Max Struct:[7, 7, 7, 7]
[2024-05-21 14:31:39] [INFO ] Invariant cache hit.
[2024-05-21 14:31:39] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 14:31:39] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-05-21 14:31:39] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-21 14:31:39] [INFO ] [Real]Added 91 Read/Feed constraints in 22 ms returned sat
[2024-05-21 14:31:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 14:31:39] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 14:31:39] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-05-21 14:31:39] [INFO ] [Nat]Added 91 Read/Feed constraints in 21 ms returned sat
[2024-05-21 14:31:39] [INFO ] Computed and/alt/rep : 53/130/53 causal constraints (skipped 169 transitions) in 11 ms.
[2024-05-21 14:31:39] [INFO ] Added : 12 causal constraints over 3 iterations in 81 ms. Result :sat
Minimization took 152 ms.
[2024-05-21 14:31:40] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 14:31:40] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2024-05-21 14:31:40] [INFO ] [Real]Added 91 Read/Feed constraints in 17 ms returned sat
[2024-05-21 14:31:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 14:31:40] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 14:31:40] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-05-21 14:31:40] [INFO ] [Nat]Added 91 Read/Feed constraints in 14 ms returned sat
[2024-05-21 14:31:40] [INFO ] Computed and/alt/rep : 53/130/53 causal constraints (skipped 169 transitions) in 13 ms.
[2024-05-21 14:31:40] [INFO ] Added : 1 causal constraints over 1 iterations in 40 ms. Result :sat
Minimization took 125 ms.
[2024-05-21 14:31:40] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 14:31:40] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-05-21 14:31:40] [INFO ] [Real]Added 91 Read/Feed constraints in 13 ms returned sat
[2024-05-21 14:31:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 14:31:40] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 14:31:40] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-05-21 14:31:40] [INFO ] [Nat]Added 91 Read/Feed constraints in 28 ms returned sat
[2024-05-21 14:31:40] [INFO ] Computed and/alt/rep : 53/130/53 causal constraints (skipped 169 transitions) in 14 ms.
[2024-05-21 14:31:40] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-21 14:31:40] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-21 14:31:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 170 ms
[2024-05-21 14:31:40] [INFO ] Added : 14 causal constraints over 4 iterations in 257 ms. Result :sat
Minimization took 144 ms.
[2024-05-21 14:31:41] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 14:31:41] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2024-05-21 14:31:41] [INFO ] [Real]Added 91 Read/Feed constraints in 15 ms returned sat
[2024-05-21 14:31:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 14:31:41] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 14:31:41] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-05-21 14:31:41] [INFO ] [Nat]Added 91 Read/Feed constraints in 19 ms returned sat
[2024-05-21 14:31:41] [INFO ] Computed and/alt/rep : 53/130/53 causal constraints (skipped 169 transitions) in 15 ms.
[2024-05-21 14:31:41] [INFO ] Added : 15 causal constraints over 4 iterations in 83 ms. Result :sat
Minimization took 147 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 12 ms. Remains 138 /138 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2024-05-21 14:31:41] [INFO ] Invariant cache hit.
[2024-05-21 14:31:41] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-21 14:31:41] [INFO ] Invariant cache hit.
[2024-05-21 14:31:41] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-21 14:31:42] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
[2024-05-21 14:31:42] [INFO ] Redundant transitions in 7 ms returned []
Running 222 sub problems to find dead transitions.
[2024-05-21 14:31:42] [INFO ] Invariant cache hit.
[2024-05-21 14:31:42] [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 8000 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 14733 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 23159ms problems are : Problem set: 0 solved, 222 unsolved
Search for dead transitions found 0 dead transitions in 23168ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23650 ms. Remains : 138/138 places, 223/223 transitions.
[2024-05-21 14:32:05] [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 (230083 resets) in 1456 ms. (686 steps per ms)
BEST_FIRST walk for 4000003 steps (382102 resets) in 2643 ms. (1512 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 4, 0, 0] Max Struct:[7, 7, 7, 7]
[2024-05-21 14:32:09] [INFO ] Invariant cache hit.
[2024-05-21 14:32:09] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 14:32:09] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-05-21 14:32:09] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-21 14:32:09] [INFO ] [Real]Added 91 Read/Feed constraints in 22 ms returned sat
[2024-05-21 14:32:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 14:32:09] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 14:32:09] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-05-21 14:32:09] [INFO ] [Nat]Added 91 Read/Feed constraints in 21 ms returned sat
[2024-05-21 14:32:09] [INFO ] Computed and/alt/rep : 53/130/53 causal constraints (skipped 169 transitions) in 14 ms.
[2024-05-21 14:32:09] [INFO ] Added : 12 causal constraints over 3 iterations in 70 ms. Result :sat
Minimization took 145 ms.
[2024-05-21 14:32:09] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 14:32:09] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-05-21 14:32:09] [INFO ] [Real]Added 91 Read/Feed constraints in 15 ms returned sat
[2024-05-21 14:32:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 14:32:09] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 14:32:10] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-05-21 14:32:10] [INFO ] [Nat]Added 91 Read/Feed constraints in 14 ms returned sat
[2024-05-21 14:32:10] [INFO ] Computed and/alt/rep : 53/130/53 causal constraints (skipped 169 transitions) in 12 ms.
[2024-05-21 14:32:10] [INFO ] Added : 1 causal constraints over 1 iterations in 47 ms. Result :sat
Minimization took 127 ms.
[2024-05-21 14:32:10] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 14:32:10] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-05-21 14:32:10] [INFO ] [Real]Added 91 Read/Feed constraints in 13 ms returned sat
[2024-05-21 14:32:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 14:32:10] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 14:32:10] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-05-21 14:32:10] [INFO ] [Nat]Added 91 Read/Feed constraints in 18 ms returned sat
[2024-05-21 14:32:10] [INFO ] Computed and/alt/rep : 53/130/53 causal constraints (skipped 169 transitions) in 13 ms.
[2024-05-21 14:32:10] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-21 14:32:10] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-21 14:32:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 162 ms
[2024-05-21 14:32:10] [INFO ] Added : 14 causal constraints over 4 iterations in 253 ms. Result :sat
Minimization took 142 ms.
[2024-05-21 14:32:10] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 14:32:10] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2024-05-21 14:32:10] [INFO ] [Real]Added 91 Read/Feed constraints in 16 ms returned sat
[2024-05-21 14:32:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 14:32:10] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 14:32:11] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2024-05-21 14:32:11] [INFO ] [Nat]Added 91 Read/Feed constraints in 18 ms returned sat
[2024-05-21 14:32:11] [INFO ] Computed and/alt/rep : 53/130/53 causal constraints (skipped 169 transitions) in 13 ms.
[2024-05-21 14:32:11] [INFO ] Added : 15 causal constraints over 4 iterations in 80 ms. Result :sat
Minimization took 148 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-21 14:32:11] [INFO ] Invariant cache hit.
[2024-05-21 14:32:11] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-21 14:32:11] [INFO ] Invariant cache hit.
[2024-05-21 14:32:11] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-21 14:32:11] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
[2024-05-21 14:32:11] [INFO ] Redundant transitions in 10 ms returned []
Running 222 sub problems to find dead transitions.
[2024-05-21 14:32:11] [INFO ] Invariant cache hit.
[2024-05-21 14:32:11] [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 7727 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 14821 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 22867ms problems are : Problem set: 0 solved, 222 unsolved
Search for dead transitions found 0 dead transitions in 22873ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23308 ms. Remains : 138/138 places, 223/223 transitions.
RANDOM walk for 40000 steps (9181 resets) in 1264 ms. (31 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (3934 resets) in 122 ms. (325 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (3869 resets) in 127 ms. (312 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (3865 resets) in 130 ms. (305 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (3821 resets) in 90 ms. (439 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (3800 resets) in 101 ms. (392 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (3856 resets) in 91 ms. (434 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (3803 resets) in 144 ms. (275 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (3816 resets) in 83 ms. (476 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 579312 steps, run timeout after 3001 ms. (steps per millisecond=193 ) properties seen :3 out of 8
Probabilistic random walk after 579312 steps, saw 227470 distinct states, run finished after 3005 ms. (steps per millisecond=192 ) properties seen :3
[2024-05-21 14:32:38] [INFO ] Invariant cache hit.
[2024-05-21 14:32:38] [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-21 14:32:38] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 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 305 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 108 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 422ms problems are : Problem set: 4 solved, 1 unsolved
Parikh walk visited 0 properties in 8 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 26 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 26 ms. Remains : 123/138 places, 168/223 transitions.
RANDOM walk for 40000 steps (9150 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (3912 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2463274 steps, run timeout after 3001 ms. (steps per millisecond=820 ) properties seen :0 out of 1
Probabilistic random walk after 2463274 steps, saw 1007429 distinct states, run finished after 3001 ms. (steps per millisecond=820 ) properties seen :0
// Phase 1: matrix 168 rows 123 cols
[2024-05-21 14:32:42] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 14:32:42] [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 101 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 92 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 203ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 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 4 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2024-05-21 14:32:42] [INFO ] Invariant cache hit.
[2024-05-21 14:32:42] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-21 14:32:42] [INFO ] Invariant cache hit.
[2024-05-21 14:32:42] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-21 14:32:42] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
[2024-05-21 14:32:42] [INFO ] Redundant transitions in 2 ms returned []
Running 167 sub problems to find dead transitions.
[2024-05-21 14:32:42] [INFO ] Invariant cache hit.
[2024-05-21 14:32:42] [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 6038 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 9759 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 16017ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 16019ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16338 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 31 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-21 14:32:58] [INFO ] Computed 6 invariants in 2 ms
[2024-05-21 14:32:58] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-21 14:32:58] [INFO ] [Real]Absence check using 1 positive and 5 generalized place invariants in 3 ms returned sat
[2024-05-21 14:32:58] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 14:32:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 14:32:58] [INFO ] [Nat]Absence check using 1 positive and 5 generalized place invariants in 3 ms returned sat
[2024-05-21 14:32:58] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-21 14:32:58] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-21 14:32:58] [INFO ] After 77ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 152 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-21 14:32:58] [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 (2342 resets) in 17 ms. (555 steps per ms)
BEST_FIRST walk for 10000 steps (988 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-21 14:32:58] [INFO ] Invariant cache hit.
[2024-05-21 14:32:58] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 14:32:58] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2024-05-21 14:32:58] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-21 14:32:58] [INFO ] [Real]Added 91 Read/Feed constraints in 17 ms returned sat
[2024-05-21 14:32:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 14:32:58] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 14:32:58] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-05-21 14:32:58] [INFO ] [Nat]Added 91 Read/Feed constraints in 23 ms returned sat
[2024-05-21 14:32:59] [INFO ] Computed and/alt/rep : 53/130/53 causal constraints (skipped 169 transitions) in 13 ms.
[2024-05-21 14:32:59] [INFO ] Added : 12 causal constraints over 3 iterations in 74 ms. Result :sat
Minimization took 150 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 17 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-21 14:32:59] [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 (230662 resets) in 1187 ms. (841 steps per ms)
BEST_FIRST walk for 1000000 steps (95881 resets) in 548 ms. (1821 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-21 14:33:01] [INFO ] Invariant cache hit.
[2024-05-21 14:33:01] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 14:33:01] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2024-05-21 14:33:01] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-21 14:33:01] [INFO ] [Real]Added 58 Read/Feed constraints in 9 ms returned sat
[2024-05-21 14:33:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 14:33:01] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 14:33:01] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-05-21 14:33:01] [INFO ] [Nat]Added 58 Read/Feed constraints in 12 ms returned sat
[2024-05-21 14:33:01] [INFO ] Computed and/alt/rep : 50/119/50 causal constraints (skipped 129 transitions) in 11 ms.
[2024-05-21 14:33:01] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-21 14:33:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2024-05-21 14:33:01] [INFO ] Added : 19 causal constraints over 4 iterations in 179 ms. Result :sat
Minimization took 88 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 16 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 16 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 6 ms. Remains 126 /126 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-21 14:33:01] [INFO ] Invariant cache hit.
[2024-05-21 14:33:01] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-21 14:33:01] [INFO ] Invariant cache hit.
[2024-05-21 14:33:01] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-21 14:33:01] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
[2024-05-21 14:33:01] [INFO ] Redundant transitions in 1 ms returned []
Running 179 sub problems to find dead transitions.
[2024-05-21 14:33:01] [INFO ] Invariant cache hit.
[2024-05-21 14:33:01] [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 4792 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 12529 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 17528ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 17529ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17836 ms. Remains : 126/126 places, 180/180 transitions.
RANDOM walk for 40000 steps (9179 resets) in 95 ms. (416 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3673 resets) in 40 ms. (975 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3815 resets) in 37 ms. (1052 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 2380914 steps, run timeout after 3001 ms. (steps per millisecond=793 ) properties seen :1 out of 2
Probabilistic random walk after 2380914 steps, saw 964747 distinct states, run finished after 3001 ms. (steps per millisecond=793 ) properties seen :1
[2024-05-21 14:33:22] [INFO ] Invariant cache hit.
[2024-05-21 14:33:22] [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 81 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 88ms 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 23800 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-21 14:33:22] [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 (2311 resets) in 17 ms. (555 steps per ms)
BEST_FIRST walk for 10001 steps (1004 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[7]
[2024-05-21 14:33:22] [INFO ] Invariant cache hit.
[2024-05-21 14:33:22] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 14:33:22] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-05-21 14:33:22] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-21 14:33:22] [INFO ] [Real]Added 91 Read/Feed constraints in 16 ms returned sat
[2024-05-21 14:33:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 14:33:22] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 14:33:22] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-05-21 14:33:22] [INFO ] [Nat]Added 91 Read/Feed constraints in 15 ms returned sat
[2024-05-21 14:33:22] [INFO ] Computed and/alt/rep : 53/130/53 causal constraints (skipped 169 transitions) in 23 ms.
[2024-05-21 14:33:22] [INFO ] Added : 1 causal constraints over 1 iterations in 50 ms. Result :sat
Minimization took 135 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] 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 16 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 16 ms. Remains : 123/138 places, 168/223 transitions.
// Phase 1: matrix 168 rows 123 cols
[2024-05-21 14:33:23] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[7]
RANDOM walk for 1000000 steps (230249 resets) in 1118 ms. (893 steps per ms)
BEST_FIRST walk for 1000000 steps (96288 resets) in 513 ms. (1945 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[7]
[2024-05-21 14:33:24] [INFO ] Invariant cache hit.
[2024-05-21 14:33:24] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 14:33:24] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-21 14:33:24] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-21 14:33:24] [INFO ] [Real]Added 49 Read/Feed constraints in 7 ms returned sat
[2024-05-21 14:33:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 14:33:24] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 14:33:24] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-05-21 14:33:24] [INFO ] [Nat]Added 49 Read/Feed constraints in 6 ms returned sat
[2024-05-21 14:33:24] [INFO ] Computed and/alt/rep : 49/115/49 causal constraints (skipped 118 transitions) in 9 ms.
[2024-05-21 14:33:24] [INFO ] Added : 1 causal constraints over 1 iterations in 26 ms. Result :sat
Minimization took 52 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 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-21 14:33:24] [INFO ] Invariant cache hit.
[2024-05-21 14:33:24] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-21 14:33:24] [INFO ] Invariant cache hit.
[2024-05-21 14:33:25] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-21 14:33:25] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
[2024-05-21 14:33:25] [INFO ] Redundant transitions in 1 ms returned []
Running 167 sub problems to find dead transitions.
[2024-05-21 14:33:25] [INFO ] Invariant cache hit.
[2024-05-21 14:33:25] [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 6212 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 9686 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 16081ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 16083ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16382 ms. Remains : 123/123 places, 168/168 transitions.
[2024-05-21 14:33:41] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[7]
RANDOM walk for 1000000 steps (230062 resets) in 1107 ms. (902 steps per ms)
BEST_FIRST walk for 1000000 steps (96090 resets) in 511 ms. (1953 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[7]
[2024-05-21 14:33:42] [INFO ] Invariant cache hit.
[2024-05-21 14:33:42] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 14:33:42] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-05-21 14:33:42] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-21 14:33:42] [INFO ] [Real]Added 49 Read/Feed constraints in 6 ms returned sat
[2024-05-21 14:33:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 14:33:43] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 14:33:43] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2024-05-21 14:33:43] [INFO ] [Nat]Added 49 Read/Feed constraints in 6 ms returned sat
[2024-05-21 14:33:43] [INFO ] Computed and/alt/rep : 49/115/49 causal constraints (skipped 118 transitions) in 8 ms.
[2024-05-21 14:33:43] [INFO ] Added : 1 causal constraints over 1 iterations in 31 ms. Result :sat
Minimization took 53 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 8 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 8 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-21 14:33:43] [INFO ] Invariant cache hit.
[2024-05-21 14:33:43] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-21 14:33:43] [INFO ] Invariant cache hit.
[2024-05-21 14:33:43] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-21 14:33:43] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
[2024-05-21 14:33:43] [INFO ] Redundant transitions in 1 ms returned []
Running 167 sub problems to find dead transitions.
[2024-05-21 14:33:43] [INFO ] Invariant cache hit.
[2024-05-21 14:33:43] [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 5980 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 9661 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 15843ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 15845ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16153 ms. Remains : 123/123 places, 168/168 transitions.
[2024-05-21 14:33:59] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[7]
RANDOM walk for 1000000 steps (229705 resets) in 1111 ms. (899 steps per ms)
BEST_FIRST walk for 1000000 steps (96709 resets) in 515 ms. (1937 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[7]
[2024-05-21 14:34:00] [INFO ] Invariant cache hit.
[2024-05-21 14:34:00] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 14:34:01] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-05-21 14:34:01] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-21 14:34:01] [INFO ] [Real]Added 49 Read/Feed constraints in 6 ms returned sat
[2024-05-21 14:34:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 14:34:01] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 14:34:01] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-05-21 14:34:01] [INFO ] [Nat]Added 49 Read/Feed constraints in 6 ms returned sat
[2024-05-21 14:34:01] [INFO ] Computed and/alt/rep : 49/115/49 causal constraints (skipped 118 transitions) in 10 ms.
[2024-05-21 14:34:01] [INFO ] Added : 1 causal constraints over 1 iterations in 27 ms. Result :sat
Minimization took 53 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] 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 9 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 9 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-21 14:34:01] [INFO ] Invariant cache hit.
[2024-05-21 14:34:01] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-21 14:34:01] [INFO ] Invariant cache hit.
[2024-05-21 14:34:01] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-21 14:34:01] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
[2024-05-21 14:34:01] [INFO ] Redundant transitions in 0 ms returned []
Running 167 sub problems to find dead transitions.
[2024-05-21 14:34:01] [INFO ] Invariant cache hit.
[2024-05-21 14:34:01] [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 6148 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 9731 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 16074ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 16077ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16408 ms. Remains : 123/123 places, 168/168 transitions.
[2024-05-21 14:34:17] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5] Max Struct:[7]
RANDOM walk for 1000000 steps (229680 resets) in 1122 ms. (890 steps per ms)
BEST_FIRST walk for 1000001 steps (96447 resets) in 518 ms. (1926 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[7]
[2024-05-21 14:34:19] [INFO ] Invariant cache hit.
[2024-05-21 14:34:19] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 14:34:19] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-05-21 14:34:19] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-21 14:34:19] [INFO ] [Real]Added 49 Read/Feed constraints in 9 ms returned sat
[2024-05-21 14:34:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 14:34:19] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 14:34:19] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-05-21 14:34:19] [INFO ] [Nat]Added 49 Read/Feed constraints in 6 ms returned sat
[2024-05-21 14:34:19] [INFO ] Computed and/alt/rep : 49/115/49 causal constraints (skipped 118 transitions) in 9 ms.
[2024-05-21 14:34:19] [INFO ] Added : 1 causal constraints over 1 iterations in 27 ms. Result :sat
Minimization took 56 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] 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 7 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 7 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 5 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2024-05-21 14:34:19] [INFO ] Invariant cache hit.
[2024-05-21 14:34:19] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-21 14:34:19] [INFO ] Invariant cache hit.
[2024-05-21 14:34:19] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-21 14:34:19] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
[2024-05-21 14:34:19] [INFO ] Redundant transitions in 0 ms returned []
Running 167 sub problems to find dead transitions.
[2024-05-21 14:34:19] [INFO ] Invariant cache hit.
[2024-05-21 14:34:19] [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 6162 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 9811 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 16153ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 16155ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16471 ms. Remains : 123/123 places, 168/168 transitions.
RANDOM walk for 40000 steps (9179 resets) in 100 ms. (396 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3945 resets) in 43 ms. (909 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3892 resets) in 41 ms. (952 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1121969 steps, run timeout after 3001 ms. (steps per millisecond=373 ) properties seen :0 out of 2
Probabilistic random walk after 1121969 steps, saw 472419 distinct states, run finished after 3001 ms. (steps per millisecond=373 ) properties seen :0
[2024-05-21 14:34:39] [INFO ] Invariant cache hit.
[2024-05-21 14:34:39] [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-21 14:34:39] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 2 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 189 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 97 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 290ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 7 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 (9216 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3862 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2474802 steps, run timeout after 3001 ms. (steps per millisecond=824 ) properties seen :0 out of 1
Probabilistic random walk after 2474802 steps, saw 1012590 distinct states, run finished after 3001 ms. (steps per millisecond=824 ) properties seen :0
[2024-05-21 14:34:42] [INFO ] Invariant cache hit.
[2024-05-21 14:34:42] [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 94 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 89 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 188ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 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 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 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 3 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2024-05-21 14:34:42] [INFO ] Invariant cache hit.
[2024-05-21 14:34:42] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-21 14:34:42] [INFO ] Invariant cache hit.
[2024-05-21 14:34:42] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-21 14:34:42] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
[2024-05-21 14:34:42] [INFO ] Redundant transitions in 0 ms returned []
Running 167 sub problems to find dead transitions.
[2024-05-21 14:34:42] [INFO ] Invariant cache hit.
[2024-05-21 14:34:42] [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 6137 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 9629 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 15953ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 15955ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16266 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 1 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 30 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-21 14:34:58] [INFO ] Computed 6 invariants in 3 ms
[2024-05-21 14:34:58] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-21 14:34:58] [INFO ] [Real]Absence check using 1 positive and 5 generalized place invariants in 3 ms returned sat
[2024-05-21 14:34:58] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 14:34:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-21 14:34:59] [INFO ] [Nat]Absence check using 1 positive and 5 generalized place invariants in 3 ms returned sat
[2024-05-21 14:34:59] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-21 14:34:59] [INFO ] After 41ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-21 14:34:59] [INFO ] After 77ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 145 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[5] Max Struct:[7]
Ending property specific reduction for DBSingleClientW-PT-d2m07-UpperBounds-11 in 96497 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-21 14:34:59] [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 (2318 resets) in 19 ms. (500 steps per ms)
BEST_FIRST walk for 10000 steps (974 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-21 14:34:59] [INFO ] Invariant cache hit.
[2024-05-21 14:34:59] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 14:34:59] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-05-21 14:34:59] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-21 14:34:59] [INFO ] [Real]Added 91 Read/Feed constraints in 19 ms returned sat
[2024-05-21 14:34:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 14:34:59] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 14:34:59] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-05-21 14:34:59] [INFO ] [Nat]Added 91 Read/Feed constraints in 19 ms returned sat
[2024-05-21 14:34:59] [INFO ] Computed and/alt/rep : 53/130/53 causal constraints (skipped 169 transitions) in 14 ms.
[2024-05-21 14:34:59] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-21 14:34:59] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-21 14:34:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 170 ms
[2024-05-21 14:34:59] [INFO ] Added : 14 causal constraints over 4 iterations in 262 ms. Result :sat
Minimization took 156 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 11 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 11 ms. Remains : 131/138 places, 199/223 transitions.
// Phase 1: matrix 199 rows 131 cols
[2024-05-21 14:34:59] [INFO ] Computed 2 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 1000000 steps (229921 resets) in 1314 ms. (760 steps per ms)
BEST_FIRST walk for 1000001 steps (95543 resets) in 590 ms. (1692 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-21 14:35:01] [INFO ] Invariant cache hit.
[2024-05-21 14:35:01] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 14:35:01] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-05-21 14:35:01] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-21 14:35:01] [INFO ] [Real]Added 73 Read/Feed constraints in 13 ms returned sat
[2024-05-21 14:35:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 14:35:01] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 14:35:01] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2024-05-21 14:35:01] [INFO ] [Nat]Added 73 Read/Feed constraints in 14 ms returned sat
[2024-05-21 14:35:01] [INFO ] Computed and/alt/rep : 51/122/51 causal constraints (skipped 147 transitions) in 12 ms.
[2024-05-21 14:35:02] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 2 ms to minimize.
[2024-05-21 14:35:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2024-05-21 14:35:02] [INFO ] Added : 11 causal constraints over 3 iterations in 140 ms. Result :sat
Minimization took 107 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 4 ms. Remains 131 /131 variables (removed 0) and now considering 199/199 (removed 0) transitions.
[2024-05-21 14:35:02] [INFO ] Invariant cache hit.
[2024-05-21 14:35:02] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-21 14:35:02] [INFO ] Invariant cache hit.
[2024-05-21 14:35:02] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-21 14:35:02] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2024-05-21 14:35:02] [INFO ] Redundant transitions in 1 ms returned []
Running 198 sub problems to find dead transitions.
[2024-05-21 14:35:02] [INFO ] Invariant cache hit.
[2024-05-21 14:35:02] [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 5465 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 13007 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 18709ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 18711ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19057 ms. Remains : 131/131 places, 199/199 transitions.
RANDOM walk for 40000 steps (9154 resets) in 95 ms. (416 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3946 resets) in 41 ms. (952 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3812 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 2325986 steps, run timeout after 3001 ms. (steps per millisecond=775 ) properties seen :1 out of 2
Probabilistic random walk after 2325986 steps, saw 927455 distinct states, run finished after 3001 ms. (steps per millisecond=775 ) properties seen :1
[2024-05-21 14:35:24] [INFO ] Invariant cache hit.
[2024-05-21 14:35:24] [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 83 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 86ms 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 25320 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-21 14:35:24] [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 (2291 resets) in 19 ms. (500 steps per ms)
BEST_FIRST walk for 10001 steps (976 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-21 14:35:24] [INFO ] Invariant cache hit.
[2024-05-21 14:35:24] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 14:35:24] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-05-21 14:35:24] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-21 14:35:24] [INFO ] [Real]Added 91 Read/Feed constraints in 16 ms returned sat
[2024-05-21 14:35:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 14:35:24] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 14:35:24] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-05-21 14:35:24] [INFO ] [Nat]Added 91 Read/Feed constraints in 20 ms returned sat
[2024-05-21 14:35:24] [INFO ] Computed and/alt/rep : 53/130/53 causal constraints (skipped 169 transitions) in 13 ms.
[2024-05-21 14:35:24] [INFO ] Added : 15 causal constraints over 4 iterations in 89 ms. Result :sat
Minimization took 152 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 16 ms. Remains : 127/138 places, 180/223 transitions.
// Phase 1: matrix 180 rows 127 cols
[2024-05-21 14:35:24] [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 (229489 resets) in 1187 ms. (841 steps per ms)
BEST_FIRST walk for 1000001 steps (95474 resets) in 548 ms. (1821 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-21 14:35:26] [INFO ] Invariant cache hit.
[2024-05-21 14:35:26] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 14:35:26] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2024-05-21 14:35:26] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-21 14:35:26] [INFO ] [Real]Added 58 Read/Feed constraints in 8 ms returned sat
[2024-05-21 14:35:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 14:35:26] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 14:35:26] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-05-21 14:35:26] [INFO ] [Nat]Added 58 Read/Feed constraints in 9 ms returned sat
[2024-05-21 14:35:26] [INFO ] Computed and/alt/rep : 50/119/50 causal constraints (skipped 129 transitions) in 11 ms.
[2024-05-21 14:35:26] [INFO ] Added : 11 causal constraints over 3 iterations in 56 ms. Result :sat
Minimization took 86 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 2 ms. Remains 127 /127 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-21 14:35:26] [INFO ] Invariant cache hit.
[2024-05-21 14:35:27] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-21 14:35:27] [INFO ] Invariant cache hit.
[2024-05-21 14:35:27] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-21 14:35:27] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
[2024-05-21 14:35:27] [INFO ] Redundant transitions in 0 ms returned []
Running 179 sub problems to find dead transitions.
[2024-05-21 14:35:27] [INFO ] Invariant cache hit.
[2024-05-21 14:35:27] [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 4475 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 10940 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 15639ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 15641ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15949 ms. Remains : 127/127 places, 180/180 transitions.
RANDOM walk for 40000 steps (9186 resets) in 89 ms. (444 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3826 resets) in 34 ms. (1142 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (3826 resets) in 35 ms. (1111 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 2400064 steps, run timeout after 3001 ms. (steps per millisecond=799 ) properties seen :1 out of 2
Probabilistic random walk after 2400064 steps, saw 978909 distinct states, run finished after 3001 ms. (steps per millisecond=799 ) properties seen :1
[2024-05-21 14:35:45] [INFO ] Invariant cache hit.
[2024-05-21 14:35: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 81 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 85ms 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 21702 ms.
[2024-05-21 14:35:46] [INFO ] Flatten gal took : 44 ms
[2024-05-21 14:35:46] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-05-21 14:35:46] [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 278155 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running DBSingleClientW-PT-d2m07
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 138
TRANSITIONS: 223
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.005s, Sys 0.000s]
SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 1002
MODEL NAME: /home/mcc/execution/412/model
138 places, 223 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-04 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-11 5 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-13 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-15 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716302149384
--------------------
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
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="greatspnxred"
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 greatspnxred"
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 r091-tall-171624188000573"
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 '
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 ;