MCC'2024- Execution of r504-tall-171649612000077

About the Execution of LTSMin+red for JoinFreeModules-PT-1000

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
1302.588	512585.00	595258.00	1310.30	1003 1002 1002 1002 ? 1002 ? 1002 ? 1002 ? ? 1002 1002 1002 ?	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.r504-tall-171649612000077.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is JoinFreeModules-PT-1000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r504-tall-171649612000077
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 14:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K Apr 11 14:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 11 14:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 11 14:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 3.1M 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 JoinFreeModules-PT-1000-UpperBounds-00
FORMULA_NAME JoinFreeModules-PT-1000-UpperBounds-01
FORMULA_NAME JoinFreeModules-PT-1000-UpperBounds-02
FORMULA_NAME JoinFreeModules-PT-1000-UpperBounds-03
FORMULA_NAME JoinFreeModules-PT-1000-UpperBounds-04
FORMULA_NAME JoinFreeModules-PT-1000-UpperBounds-05
FORMULA_NAME JoinFreeModules-PT-1000-UpperBounds-06
FORMULA_NAME JoinFreeModules-PT-1000-UpperBounds-07
FORMULA_NAME JoinFreeModules-PT-1000-UpperBounds-08
FORMULA_NAME JoinFreeModules-PT-1000-UpperBounds-09
FORMULA_NAME JoinFreeModules-PT-1000-UpperBounds-10
FORMULA_NAME JoinFreeModules-PT-1000-UpperBounds-11
FORMULA_NAME JoinFreeModules-PT-1000-UpperBounds-12
FORMULA_NAME JoinFreeModules-PT-1000-UpperBounds-13
FORMULA_NAME JoinFreeModules-PT-1000-UpperBounds-14
FORMULA_NAME JoinFreeModules-PT-1000-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717220758191

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-1000
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:45:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 05:45:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:45:59] [INFO ] Load time of PNML (sax parser for PT used): 308 ms
[2024-06-01 05:45:59] [INFO ] Transformed 5001 places.
[2024-06-01 05:45:59] [INFO ] Transformed 8001 transitions.
[2024-06-01 05:45:59] [INFO ] Parsed PT model containing 5001 places and 8001 transitions and 23002 arcs in 457 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Reduce places removed 1 places and 0 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 1000, 2, 1, 0, 1000, 0, 1000, 1, 0, 2, 2, 1000] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 1000, 2, 1, 0, 1000, 0, 1000, 1, 0, 2, 2, 1000] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 8001 rows 5000 cols
[2024-06-01 05:46:00] [INFO ] Computed 1000 invariants in 87 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 1000, 2, 1, 0, 1000, 0, 1000, 1, 0, 2, 2, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003]
RANDOM walk for 10015 steps (2 resets) in 484 ms. (20 steps per ms)
BEST_FIRST walk for 160016 steps (32 resets) in 7676 ms. (20 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2, 2, 2, 1000, 2, 3, 2, 1000, 2, 1000, 3, 2, 2, 2, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003]
[2024-06-01 05:46:08] [INFO ] Invariant cache hit.
[2024-06-01 05:46:09] [INFO ] [Real]Absence check using 1000 positive place invariants in 305 ms returned sat
[2024-06-01 05:46:12] [INFO ] [Real]Absence check using state equation in 2845 ms returned sat
[2024-06-01 05:46:12] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:46:13] [INFO ] [Nat]Absence check using 1000 positive place invariants in 261 ms returned sat
[2024-06-01 05:46:17] [INFO ] [Nat]Absence check using state equation in 4227 ms returned unknown
[2024-06-01 05:46:18] [INFO ] [Real]Absence check using 1000 positive place invariants in 258 ms returned sat
[2024-06-01 05:46:21] [INFO ] [Real]Absence check using state equation in 2843 ms returned sat
[2024-06-01 05:46:21] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:46:22] [INFO ] [Nat]Absence check using 1000 positive place invariants in 266 ms returned sat
[2024-06-01 05:46:26] [INFO ] [Nat]Absence check using state equation in 4269 ms returned unknown
[2024-06-01 05:46:27] [INFO ] [Real]Absence check using 1000 positive place invariants in 245 ms returned sat
[2024-06-01 05:46:30] [INFO ] [Real]Absence check using state equation in 2938 ms returned sat
[2024-06-01 05:46:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:46:31] [INFO ] [Nat]Absence check using 1000 positive place invariants in 251 ms returned sat
[2024-06-01 05:46:35] [INFO ] [Nat]Absence check using state equation in 4231 ms returned unknown
[2024-06-01 05:46:36] [INFO ] [Real]Absence check using 1000 positive place invariants in 237 ms returned sat
[2024-06-01 05:46:39] [INFO ] [Real]Absence check using state equation in 2787 ms returned sat
[2024-06-01 05:46:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:46:40] [INFO ] [Nat]Absence check using 1000 positive place invariants in 231 ms returned sat
[2024-06-01 05:46:44] [INFO ] [Nat]Absence check using state equation in 4331 ms returned unknown
[2024-06-01 05:46:45] [INFO ] [Real]Absence check using 1000 positive place invariants in 250 ms returned sat
[2024-06-01 05:46:47] [INFO ] [Real]Absence check using state equation in 2821 ms returned sat
[2024-06-01 05:46:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:46:49] [INFO ] [Nat]Absence check using 1000 positive place invariants in 257 ms returned sat
[2024-06-01 05:46:53] [INFO ] [Nat]Absence check using state equation in 4222 ms returned unknown
[2024-06-01 05:46:54] [INFO ] [Real]Absence check using 1000 positive place invariants in 221 ms returned sat
[2024-06-01 05:46:56] [INFO ] [Real]Absence check using state equation in 2585 ms returned sat
[2024-06-01 05:46:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:46:57] [INFO ] [Nat]Absence check using 1000 positive place invariants in 230 ms returned sat
[2024-06-01 05:47:01] [INFO ] [Nat]Absence check using state equation in 4386 ms returned unknown
[2024-06-01 05:47:02] [INFO ] [Real]Absence check using 1000 positive place invariants in 237 ms returned sat
[2024-06-01 05:47:05] [INFO ] [Real]Absence check using state equation in 2844 ms returned sat
[2024-06-01 05:47:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:47:06] [INFO ] [Nat]Absence check using 1000 positive place invariants in 245 ms returned sat
[2024-06-01 05:47:10] [INFO ] [Nat]Absence check using state equation in 4283 ms returned unknown
[2024-06-01 05:47:11] [INFO ] [Real]Absence check using 1000 positive place invariants in 253 ms returned sat
[2024-06-01 05:47:14] [INFO ] [Real]Absence check using state equation in 2824 ms returned sat
[2024-06-01 05:47:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:47:15] [INFO ] [Nat]Absence check using 1000 positive place invariants in 250 ms returned sat
[2024-06-01 05:47:19] [INFO ] [Nat]Absence check using state equation in 4312 ms returned unknown
[2024-06-01 05:47:20] [INFO ] [Real]Absence check using 1000 positive place invariants in 255 ms returned sat
[2024-06-01 05:47:23] [INFO ] [Real]Absence check using state equation in 2909 ms returned sat
[2024-06-01 05:47:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:47:24] [INFO ] [Nat]Absence check using 1000 positive place invariants in 257 ms returned sat
[2024-06-01 05:47:28] [INFO ] [Nat]Absence check using state equation in 3763 ms returned unknown
[2024-06-01 05:47:29] [INFO ] [Real]Absence check using 1000 positive place invariants in 252 ms returned sat
[2024-06-01 05:47:32] [INFO ] [Real]Absence check using state equation in 3001 ms returned sat
[2024-06-01 05:47:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:47:33] [INFO ] [Nat]Absence check using 1000 positive place invariants in 260 ms returned sat
[2024-06-01 05:47:37] [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 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:851)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 05:47:38] [INFO ] [Real]Absence check using 1000 positive place invariants in 253 ms returned sat
[2024-06-01 05:47:41] [INFO ] [Real]Absence check using state equation in 2862 ms returned sat
[2024-06-01 05:47:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:47:42] [INFO ] [Nat]Absence check using 1000 positive place invariants in 243 ms returned sat
[2024-06-01 05:47:46] [INFO ] [Nat]Absence check using state equation in 4295 ms returned unknown
[2024-06-01 05:47:47] [INFO ] [Real]Absence check using 1000 positive place invariants in 235 ms returned sat
[2024-06-01 05:47:49] [INFO ] [Real]Absence check using state equation in 2818 ms returned sat
[2024-06-01 05:47:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:47:51] [INFO ] [Nat]Absence check using 1000 positive place invariants in 240 ms returned sat
[2024-06-01 05:47:55] [INFO ] [Nat]Absence check using state equation in 4275 ms returned unknown
[2024-06-01 05:47:56] [INFO ] [Real]Absence check using 1000 positive place invariants in 253 ms returned sat
[2024-06-01 05:47:58] [INFO ] [Real]Absence check using state equation in 2831 ms returned sat
[2024-06-01 05:47:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:47:59] [INFO ] [Nat]Absence check using 1000 positive place invariants in 253 ms returned sat
[2024-06-01 05:48:04] [INFO ] [Nat]Absence check using state equation in 4216 ms returned unknown
[2024-06-01 05:48:04] [INFO ] [Real]Absence check using 1000 positive place invariants in 248 ms returned sat
[2024-06-01 05:48:08] [INFO ] [Real]Absence check using state equation in 3014 ms returned sat
[2024-06-01 05:48:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:48:09] [INFO ] [Nat]Absence check using 1000 positive place invariants in 248 ms returned sat
[2024-06-01 05:48:13] [INFO ] [Nat]Absence check using state equation in 4287 ms returned unknown
[2024-06-01 05:48:14] [INFO ] [Real]Absence check using 1000 positive place invariants in 245 ms returned sat
[2024-06-01 05:48:17] [INFO ] [Real]Absence check using state equation in 2906 ms returned sat
[2024-06-01 05:48:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:48:18] [INFO ] [Nat]Absence check using 1000 positive place invariants in 247 ms returned sat
[2024-06-01 05:48:22] [INFO ] [Nat]Absence check using state equation in 4277 ms returned unknown
[2024-06-01 05:48:23] [INFO ] [Real]Absence check using 1000 positive place invariants in 237 ms returned sat
[2024-06-01 05:48:25] [INFO ] [Real]Absence check using state equation in 2855 ms returned sat
[2024-06-01 05:48:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:48:26] [INFO ] [Nat]Absence check using 1000 positive place invariants in 251 ms returned sat
[2024-06-01 05:48:31] [INFO ] [Nat]Absence check using state equation in 4237 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2, 2, 2, 1000, 2, 3, 2, 1000, 2, 1000, 3, 2, 2, 2, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2, 2, 2, 1000, 2, 3, 2, 1000, 2, 1000, 3, 2, 2, 2, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003]
Support contains 16 out of 5000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Graph (complete) has 12000 edges and 5000 vertex of which 80 are kept as prefixes of interest. Removing 4920 places using SCC suffix rule.12 ms
Discarding 4920 places :
Also discarding 7872 output transitions
Drop transitions (Output transitions of discarded places.) removed 7872 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 80 transition count 128
Applied a total of 2 rules in 68 ms. Remains 80 /5000 variables (removed 4920) and now considering 128/8001 (removed 7873) transitions.
Running 96 sub problems to find dead transitions.
// Phase 1: matrix 128 rows 80 cols
[2024-06-01 05:48:31] [INFO ] Computed 16 invariants in 1 ms
[2024-06-01 05:48:31] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 16/80 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 128/208 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 16/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/208 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 112 constraints, problems are : Problem set: 0 solved, 96 unsolved in 1903 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 80/80 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 16/80 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 128/208 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 16/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 96/208 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-01 05:48:34] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-01 05:48:35] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (OVERLAPS) 0/208 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 210 constraints, problems are : Problem set: 0 solved, 96 unsolved in 4317 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 80/80 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 2/2 constraints]
After SMT, in 6271ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 6295ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6386 ms. Remains : 80/5000 places, 128/8001 transitions.
[2024-06-01 05:48:37] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 2, 2, 2, 1000, 2, 3, 2, 1000, 2, 1000, 3, 2, 2, 2, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003]
RANDOM walk for 1000001 steps (2 resets) in 1129 ms. (884 steps per ms)
BEST_FIRST walk for 16000016 steps (32 resets) in 20614 ms. (776 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1000, 973, 936, 977, 1000, 966, 1001, 948, 1000, 973, 1000, 1001, 981, 962, 987, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003]
[2024-06-01 05:48:59] [INFO ] Invariant cache hit.
[2024-06-01 05:48:59] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 05:48:59] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2024-06-01 05:48:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:48:59] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 05:48:59] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-06-01 05:48:59] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-01 05:48:59] [INFO ] [Nat]Added 16 Read/Feed constraints in 61 ms returned sat
[2024-06-01 05:48:59] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2024-06-01 05:48:59] [INFO ] Added : 61 causal constraints over 13 iterations in 144 ms. Result :sat
Minimization took 57 ms.
[2024-06-01 05:48:59] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 05:48:59] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-06-01 05:48:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:48:59] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 05:48:59] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-06-01 05:48:59] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2024-06-01 05:48:59] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 05:49:00] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 05:49:00] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
[2024-06-01 05:49:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 85 ms
[2024-06-01 05:49:00] [INFO ] Added : 66 causal constraints over 14 iterations in 283 ms. Result :sat
Minimization took 82 ms.
[2024-06-01 05:49:00] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-06-01 05:49:00] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-06-01 05:49:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:49:00] [INFO ] [Nat]Absence check using 16 positive place invariants in 24 ms returned sat
[2024-06-01 05:49:00] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-06-01 05:49:00] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2024-06-01 05:49:00] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 05:49:00] [INFO ] Added : 62 causal constraints over 13 iterations in 108 ms. Result :sat
Minimization took 102 ms.
[2024-06-01 05:49:00] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 05:49:00] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-06-01 05:49:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:49:00] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 05:49:00] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-06-01 05:49:00] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2024-06-01 05:49:00] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 05:49:00] [INFO ] Added : 59 causal constraints over 12 iterations in 142 ms. Result :sat
Minimization took 66 ms.
[2024-06-01 05:49:01] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 05:49:01] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-06-01 05:49:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:49:01] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 05:49:01] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-06-01 05:49:01] [INFO ] [Nat]Added 16 Read/Feed constraints in 40 ms returned sat
[2024-06-01 05:49:01] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2024-06-01 05:49:01] [INFO ] Added : 71 causal constraints over 16 iterations in 158 ms. Result :sat
Minimization took 35 ms.
[2024-06-01 05:49:01] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-06-01 05:49:01] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-06-01 05:49:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:49:01] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-06-01 05:49:01] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-06-01 05:49:01] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2024-06-01 05:49:01] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 05:49:01] [INFO ] Added : 61 causal constraints over 13 iterations in 188 ms. Result :sat
Minimization took 71 ms.
[2024-06-01 05:49:01] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 05:49:01] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-06-01 05:49:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:49:01] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-06-01 05:49:01] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-06-01 05:49:01] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2024-06-01 05:49:01] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 05:49:02] [INFO ] Added : 78 causal constraints over 17 iterations in 199 ms. Result :sat
Minimization took 38 ms.
[2024-06-01 05:49:02] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-06-01 05:49:02] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-06-01 05:49:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:49:02] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-06-01 05:49:02] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-06-01 05:49:02] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2024-06-01 05:49:02] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 05:49:02] [INFO ] Added : 60 causal constraints over 12 iterations in 117 ms. Result :sat
Minimization took 78 ms.
[2024-06-01 05:49:02] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-06-01 05:49:02] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-06-01 05:49:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:49:02] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-06-01 05:49:02] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-06-01 05:49:02] [INFO ] [Nat]Added 16 Read/Feed constraints in 61 ms returned sat
[2024-06-01 05:49:02] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 12 ms.
[2024-06-01 05:49:02] [INFO ] Added : 56 causal constraints over 12 iterations in 127 ms. Result :sat
Minimization took 32 ms.
[2024-06-01 05:49:02] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-06-01 05:49:02] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-06-01 05:49:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:49:02] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 05:49:02] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-06-01 05:49:02] [INFO ] [Nat]Added 16 Read/Feed constraints in 59 ms returned sat
[2024-06-01 05:49:03] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 10 ms.
[2024-06-01 05:49:03] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 05:49:03] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-06-01 05:49:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 73 ms
[2024-06-01 05:49:03] [INFO ] Added : 76 causal constraints over 17 iterations in 243 ms. Result :sat
Minimization took 83 ms.
[2024-06-01 05:49:03] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 05:49:03] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-06-01 05:49:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:49:03] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-06-01 05:49:03] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-06-01 05:49:03] [INFO ] [Nat]Added 16 Read/Feed constraints in 43 ms returned sat
[2024-06-01 05:49:03] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2024-06-01 05:49:03] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
[2024-06-01 05:49:03] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-06-01 05:49:03] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-06-01 05:49:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 112 ms
[2024-06-01 05:49:03] [INFO ] Added : 62 causal constraints over 14 iterations in 259 ms. Result :sat
Minimization took 35 ms.
[2024-06-01 05:49:03] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 05:49:03] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-06-01 05:49:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:49:03] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 05:49:03] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-06-01 05:49:04] [INFO ] [Nat]Added 16 Read/Feed constraints in 57 ms returned sat
[2024-06-01 05:49:04] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2024-06-01 05:49:04] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-06-01 05:49:04] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 05:49:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 81 ms
[2024-06-01 05:49:04] [INFO ] Added : 61 causal constraints over 14 iterations in 205 ms. Result :sat
Minimization took 26 ms.
[2024-06-01 05:49:04] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 05:49:04] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-06-01 05:49:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:49:04] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 05:49:04] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2024-06-01 05:49:04] [INFO ] [Nat]Added 16 Read/Feed constraints in 25 ms returned sat
[2024-06-01 05:49:04] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2024-06-01 05:49:04] [INFO ] Added : 55 causal constraints over 13 iterations in 111 ms. Result :sat
Minimization took 80 ms.
[2024-06-01 05:49:04] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-06-01 05:49:04] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-06-01 05:49:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:49:04] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 05:49:04] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-06-01 05:49:04] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2024-06-01 05:49:04] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 05:49:04] [INFO ] Added : 62 causal constraints over 14 iterations in 180 ms. Result :sat
Minimization took 79 ms.
[2024-06-01 05:49:05] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 05:49:05] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-06-01 05:49:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:49:05] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2024-06-01 05:49:05] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2024-06-01 05:49:05] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2024-06-01 05:49:05] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 05:49:05] [INFO ] Added : 59 causal constraints over 13 iterations in 106 ms. Result :sat
Minimization took 58 ms.
[2024-06-01 05:49:05] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 05:49:05] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-06-01 05:49:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:49:05] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 05:49:05] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2024-06-01 05:49:05] [INFO ] [Nat]Added 16 Read/Feed constraints in 43 ms returned sat
[2024-06-01 05:49:05] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 05:49:05] [INFO ] Added : 53 causal constraints over 11 iterations in 119 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1000, 973, 936, 977, 1000, 966, 1001, 948, 1000, 973, 1000, 1001, 981, 962, 987, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1001, 1001, 1001, 1001, 1000, 1002, 1001, 1001, 1000, 1000, 1000, 1001, 1001, 1002, 1002, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003]
Support contains 16 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 128/128 transitions.
Applied a total of 0 rules in 5 ms. Remains 80 /80 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 80/80 places, 128/128 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 128/128 transitions.
Applied a total of 0 rules in 4 ms. Remains 80 /80 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2024-06-01 05:49:58] [INFO ] Invariant cache hit.
[2024-06-01 05:49:58] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-06-01 05:49:58] [INFO ] Invariant cache hit.
[2024-06-01 05:49:58] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-01 05:49:58] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2024-06-01 05:49:58] [INFO ] Redundant transitions in 3 ms returned []
Running 96 sub problems to find dead transitions.
[2024-06-01 05:49:58] [INFO ] Invariant cache hit.
[2024-06-01 05:49:58] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 16/80 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 128/208 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 16/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/208 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 112 constraints, problems are : Problem set: 0 solved, 96 unsolved in 1758 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 80/80 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 16/80 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 128/208 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 16/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 96/208 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/208 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 208 constraints, problems are : Problem set: 0 solved, 96 unsolved in 2221 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 80/80 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
After SMT, in 3997ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 3999ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4113 ms. Remains : 80/80 places, 128/128 transitions.
[2024-06-01 05:50:02] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1001, 1001, 1001, 1001, 1000, 1002, 1001, 1001, 1000, 1000, 1000, 1001, 1001, 1002, 1002, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003]
RANDOM walk for 1000042 steps (2 resets) in 1032 ms. (968 steps per ms)
FORMULA JoinFreeModules-PT-1000-UpperBounds-00 1003 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 15000015 steps (30 resets) in 18902 ms. (793 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1001, 1001, 1001, 1000, 1002, 1001, 1001, 1000, 1000, 1000, 1001, 1001, 1002, 1002, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003]
[2024-06-01 05:50:22] [INFO ] Invariant cache hit.
[2024-06-01 05:50:22] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 05:50:22] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-06-01 05:50:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:50:22] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 05:50:22] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-06-01 05:50:22] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-01 05:50:22] [INFO ] [Nat]Added 16 Read/Feed constraints in 9 ms returned sat
[2024-06-01 05:50:22] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2024-06-01 05:50:22] [INFO ] Added : 48 causal constraints over 10 iterations in 139 ms. Result :sat
Minimization took 44 ms.
[2024-06-01 05:50:22] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2024-06-01 05:50:23] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-06-01 05:50:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:50:23] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 05:50:23] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-06-01 05:50:23] [INFO ] [Nat]Added 16 Read/Feed constraints in 38 ms returned sat
[2024-06-01 05:50:23] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 10 ms.
[2024-06-01 05:50:23] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-06-01 05:50:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2024-06-01 05:50:23] [INFO ] Added : 68 causal constraints over 15 iterations in 216 ms. Result :sat
Minimization took 35 ms.
[2024-06-01 05:50:23] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 05:50:23] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-06-01 05:50:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:50:23] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 05:50:23] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2024-06-01 05:50:23] [INFO ] [Nat]Added 16 Read/Feed constraints in 22 ms returned sat
[2024-06-01 05:50:23] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2024-06-01 05:50:23] [INFO ] Added : 48 causal constraints over 11 iterations in 93 ms. Result :sat
Minimization took 42 ms.
[2024-06-01 05:50:23] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-06-01 05:50:23] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-06-01 05:50:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:50:23] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 05:50:23] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-06-01 05:50:23] [INFO ] [Nat]Added 16 Read/Feed constraints in 39 ms returned sat
[2024-06-01 05:50:23] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 05:50:24] [INFO ] Added : 71 causal constraints over 16 iterations in 161 ms. Result :sat
Minimization took 34 ms.
[2024-06-01 05:50:24] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 05:50:24] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-06-01 05:50:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:50:24] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 05:50:24] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-06-01 05:50:24] [INFO ] [Nat]Added 16 Read/Feed constraints in 58 ms returned sat
[2024-06-01 05:50:24] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2024-06-01 05:50:24] [INFO ] Added : 58 causal constraints over 12 iterations in 106 ms. Result :sat
Minimization took 23 ms.
[2024-06-01 05:50:24] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-06-01 05:50:24] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-06-01 05:50:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:50:24] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 05:50:24] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-06-01 05:50:24] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2024-06-01 05:50:24] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 05:50:24] [INFO ] Added : 78 causal constraints over 17 iterations in 197 ms. Result :sat
Minimization took 37 ms.
[2024-06-01 05:50:24] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 05:50:24] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-06-01 05:50:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:50:24] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 05:50:24] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-06-01 05:50:25] [INFO ] [Nat]Added 16 Read/Feed constraints in 23 ms returned sat
[2024-06-01 05:50:25] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 10 ms.
[2024-06-01 05:50:25] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-06-01 05:50:25] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2024-06-01 05:50:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 88 ms
[2024-06-01 05:50:25] [INFO ] Added : 72 causal constraints over 16 iterations in 231 ms. Result :sat
Minimization took 35 ms.
[2024-06-01 05:50:25] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-06-01 05:50:25] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-06-01 05:50:25] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:50:25] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 05:50:25] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-06-01 05:50:25] [INFO ] [Nat]Added 16 Read/Feed constraints in 60 ms returned sat
[2024-06-01 05:50:25] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 11 ms.
[2024-06-01 05:50:25] [INFO ] Added : 56 causal constraints over 12 iterations in 140 ms. Result :sat
Minimization took 33 ms.
[2024-06-01 05:50:25] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-06-01 05:50:25] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-06-01 05:50:25] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:50:25] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-06-01 05:50:25] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-06-01 05:50:25] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2024-06-01 05:50:25] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-06-01 05:50:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2024-06-01 05:50:25] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 05:50:26] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 05:50:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2024-06-01 05:50:26] [INFO ] Added : 68 causal constraints over 14 iterations in 193 ms. Result :sat
Minimization took 35 ms.
[2024-06-01 05:50:26] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-06-01 05:50:26] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-06-01 05:50:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:50:26] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 05:50:26] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-06-01 05:50:26] [INFO ] [Nat]Added 16 Read/Feed constraints in 43 ms returned sat
[2024-06-01 05:50:26] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2024-06-01 05:50:26] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-06-01 05:50:26] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 05:50:26] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-06-01 05:50:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 114 ms
[2024-06-01 05:50:26] [INFO ] Added : 62 causal constraints over 14 iterations in 264 ms. Result :sat
Minimization took 33 ms.
[2024-06-01 05:50:26] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-06-01 05:50:26] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-06-01 05:50:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:50:26] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 05:50:26] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-06-01 05:50:26] [INFO ] [Nat]Added 16 Read/Feed constraints in 56 ms returned sat
[2024-06-01 05:50:26] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 12 ms.
[2024-06-01 05:50:26] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-06-01 05:50:26] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 05:50:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 74 ms
[2024-06-01 05:50:26] [INFO ] Added : 61 causal constraints over 14 iterations in 194 ms. Result :sat
Minimization took 25 ms.
[2024-06-01 05:50:27] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 05:50:27] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-06-01 05:50:27] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:50:27] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-06-01 05:50:27] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2024-06-01 05:50:27] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2024-06-01 05:50:27] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 05:50:27] [INFO ] Added : 50 causal constraints over 10 iterations in 78 ms. Result :sat
Minimization took 32 ms.
[2024-06-01 05:50:27] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-06-01 05:50:27] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-06-01 05:50:27] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:50:27] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-06-01 05:50:27] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-06-01 05:50:27] [INFO ] [Nat]Added 16 Read/Feed constraints in 40 ms returned sat
[2024-06-01 05:50:27] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 05:50:27] [INFO ] Added : 70 causal constraints over 15 iterations in 119 ms. Result :sat
Minimization took 25 ms.
[2024-06-01 05:50:27] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-06-01 05:50:27] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-06-01 05:50:27] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:50:27] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 05:50:27] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2024-06-01 05:50:27] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2024-06-01 05:50:27] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 05:50:27] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-06-01 05:50:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2024-06-01 05:50:27] [INFO ] Added : 43 causal constraints over 9 iterations in 131 ms. Result :sat
Minimization took 19 ms.
[2024-06-01 05:50:28] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 05:50:28] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-06-01 05:50:28] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:50:28] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 05:50:28] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-06-01 05:50:28] [INFO ] [Nat]Added 16 Read/Feed constraints in 43 ms returned sat
[2024-06-01 05:50:28] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 05:50:28] [INFO ] Added : 53 causal constraints over 11 iterations in 126 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1001, 1001, 1001, 1000, 1002, 1001, 1001, 1000, 1000, 1000, 1001, 1001, 1002, 1002, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1001, 1002, 1002, 1000, 1002, 1001, 1002, 1000, 1002, 1000, 1001, 1001, 1002, 1002, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003]
Support contains 15 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 128/128 transitions.
Graph (complete) has 192 edges and 80 vertex of which 75 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Applied a total of 1 rules in 7 ms. Remains 75 /80 variables (removed 5) and now considering 120/128 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 75/80 places, 120/128 transitions.
// Phase 1: matrix 120 rows 75 cols
[2024-06-01 05:51:14] [INFO ] Computed 15 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1001, 1002, 1002, 1000, 1002, 1001, 1002, 1000, 1002, 1000, 1001, 1001, 1002, 1002, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003]
RANDOM walk for 1000055 steps (2 resets) in 981 ms. (1018 steps per ms)
BEST_FIRST walk for 15000015 steps (30 resets) in 18196 ms. (824 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1001, 1002, 1002, 1000, 1002, 1001, 1002, 1000, 1002, 1000, 1001, 1001, 1002, 1002, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003]
[2024-06-01 05:51:33] [INFO ] Invariant cache hit.
[2024-06-01 05:51:33] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2024-06-01 05:51:33] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-06-01 05:51:33] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:51:33] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2024-06-01 05:51:33] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2024-06-01 05:51:33] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-06-01 05:51:33] [INFO ] [Nat]Added 15 Read/Feed constraints in 26 ms returned sat
[2024-06-01 05:51:33] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 8 ms.
[2024-06-01 05:51:33] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-06-01 05:51:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2024-06-01 05:51:33] [INFO ] Added : 47 causal constraints over 11 iterations in 133 ms. Result :sat
Minimization took 39 ms.
[2024-06-01 05:51:33] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2024-06-01 05:51:33] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-06-01 05:51:33] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:51:33] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2024-06-01 05:51:34] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2024-06-01 05:51:34] [INFO ] [Nat]Added 15 Read/Feed constraints in 2 ms returned sat
[2024-06-01 05:51:34] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 8 ms.
[2024-06-01 05:51:34] [INFO ] Added : 50 causal constraints over 11 iterations in 86 ms. Result :sat
Minimization took 22 ms.
[2024-06-01 05:51:34] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2024-06-01 05:51:34] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-06-01 05:51:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:51:34] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2024-06-01 05:51:34] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-06-01 05:51:34] [INFO ] [Nat]Added 15 Read/Feed constraints in 44 ms returned sat
[2024-06-01 05:51:34] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 05:51:34] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-06-01 05:51:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
Minimization took 21 ms.
[2024-06-01 05:51:34] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2024-06-01 05:51:34] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-06-01 05:51:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:51:34] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2024-06-01 05:51:34] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-06-01 05:51:34] [INFO ] [Nat]Added 15 Read/Feed constraints in 24 ms returned sat
[2024-06-01 05:51:34] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 8 ms.
[2024-06-01 05:51:34] [INFO ] Added : 55 causal constraints over 13 iterations in 123 ms. Result :sat
Minimization took 31 ms.
[2024-06-01 05:51:34] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2024-06-01 05:51:34] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-06-01 05:51:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:51:34] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2024-06-01 05:51:34] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-06-01 05:51:34] [INFO ] [Nat]Added 15 Read/Feed constraints in 2 ms returned sat
[2024-06-01 05:51:34] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 05:51:35] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-06-01 05:51:35] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-06-01 05:51:35] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 05:51:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 103 ms
Minimization took 18 ms.
[2024-06-01 05:51:35] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2024-06-01 05:51:35] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-06-01 05:51:35] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:51:35] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2024-06-01 05:51:35] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-06-01 05:51:35] [INFO ] [Nat]Added 15 Read/Feed constraints in 1 ms returned sat
[2024-06-01 05:51:35] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 05:51:35] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-06-01 05:51:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2024-06-01 05:51:35] [INFO ] Added : 63 causal constraints over 13 iterations in 151 ms. Result :sat
Minimization took 25 ms.
[2024-06-01 05:51:35] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2024-06-01 05:51:35] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-06-01 05:51:35] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:51:35] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2024-06-01 05:51:35] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-06-01 05:51:35] [INFO ] [Nat]Added 15 Read/Feed constraints in 2 ms returned sat
[2024-06-01 05:51:35] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 05:51:35] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-06-01 05:51:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
Minimization took 13 ms.
[2024-06-01 05:51:35] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2024-06-01 05:51:35] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-06-01 05:51:35] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:51:35] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2024-06-01 05:51:35] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-06-01 05:51:36] [INFO ] [Nat]Added 15 Read/Feed constraints in 84 ms returned sat
[2024-06-01 05:51:36] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 9 ms.
[2024-06-01 05:51:36] [INFO ] Added : 49 causal constraints over 10 iterations in 114 ms. Result :sat
Minimization took 30 ms.
[2024-06-01 05:51:36] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2024-06-01 05:51:36] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-06-01 05:51:36] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:51:36] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2024-06-01 05:51:36] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-06-01 05:51:36] [INFO ] [Nat]Added 15 Read/Feed constraints in 2 ms returned sat
[2024-06-01 05:51:36] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-06-01 05:51:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2024-06-01 05:51:36] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2024-06-01 05:51:36] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-06-01 05:51:36] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:51:36] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2024-06-01 05:51:36] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-06-01 05:51:36] [INFO ] [Nat]Added 15 Read/Feed constraints in 84 ms returned sat
[2024-06-01 05:51:36] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 10 ms.
[2024-06-01 05:51:36] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 05:51:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2024-06-01 05:51:36] [INFO ] Added : 51 causal constraints over 11 iterations in 143 ms. Result :sat
Minimization took 30 ms.
[2024-06-01 05:51:36] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2024-06-01 05:51:36] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-06-01 05:51:36] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:51:36] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2024-06-01 05:51:36] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2024-06-01 05:51:36] [INFO ] [Nat]Added 15 Read/Feed constraints in 4 ms returned sat
[2024-06-01 05:51:36] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 05:51:37] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 05:51:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2024-06-01 05:51:37] [INFO ] Added : 52 causal constraints over 11 iterations in 130 ms. Result :sat
Minimization took 31 ms.
[2024-06-01 05:51:37] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2024-06-01 05:51:37] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-06-01 05:51:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:51:37] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2024-06-01 05:51:37] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-06-01 05:51:37] [INFO ] [Nat]Added 15 Read/Feed constraints in 2 ms returned sat
[2024-06-01 05:51:37] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 05:51:37] [INFO ] Added : 64 causal constraints over 15 iterations in 115 ms. Result :sat
Minimization took 32 ms.
[2024-06-01 05:51:37] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2024-06-01 05:51:37] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-06-01 05:51:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:51:37] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2024-06-01 05:51:37] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-06-01 05:51:37] [INFO ] [Nat]Added 15 Read/Feed constraints in 2 ms returned sat
[2024-06-01 05:51:37] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 05:51:37] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-06-01 05:51:37] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
[2024-06-01 05:51:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 83 ms
[2024-06-01 05:51:37] [INFO ] Added : 70 causal constraints over 16 iterations in 233 ms. Result :sat
Minimization took 24 ms.
[2024-06-01 05:51:37] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2024-06-01 05:51:37] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-06-01 05:51:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:51:37] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2024-06-01 05:51:37] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-06-01 05:51:37] [INFO ] [Nat]Added 15 Read/Feed constraints in 2 ms returned sat
[2024-06-01 05:51:37] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 05:51:38] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-06-01 05:51:38] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 05:51:38] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-06-01 05:51:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 97 ms
Minimization took 22 ms.
[2024-06-01 05:51:38] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2024-06-01 05:51:38] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-06-01 05:51:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:51:38] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2024-06-01 05:51:38] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2024-06-01 05:51:38] [INFO ] [Nat]Added 15 Read/Feed constraints in 25 ms returned sat
[2024-06-01 05:51:38] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 9 ms.
[2024-06-01 05:51:38] [INFO ] Added : 57 causal constraints over 13 iterations in 111 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1001, 1002, 1002, 1000, 1002, 1001, 1002, 1000, 1002, 1000, 1001, 1001, 1002, 1002, 1000] Max Struct:[1003, 1003, 1002, 1003, 1002, 1003, 1002, 1003, 1002, 1003, 1003, 1003, 1003, 1002, 1003]
FORMULA JoinFreeModules-PT-1000-UpperBounds-14 1002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-1000-UpperBounds-09 1002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-1000-UpperBounds-07 1002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-1000-UpperBounds-05 1002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-1000-UpperBounds-03 1002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1001, 1002, 1000, 1001, 1000, 1000, 1001, 1001, 1002, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003]
Support contains 10 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 120/120 transitions.
Graph (complete) has 180 edges and 75 vertex of which 50 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.1 ms
Discarding 25 places :
Also discarding 40 output transitions
Drop transitions (Output transitions of discarded places.) removed 40 transitions
Applied a total of 1 rules in 4 ms. Remains 50 /75 variables (removed 25) and now considering 80/120 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 50/75 places, 80/120 transitions.
// Phase 1: matrix 80 rows 50 cols
[2024-06-01 05:52:06] [INFO ] Computed 10 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1001, 1002, 1000, 1001, 1000, 1000, 1001, 1001, 1002, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003]
RANDOM walk for 1000079 steps (2 resets) in 660 ms. (1512 steps per ms)
BEST_FIRST walk for 10000010 steps (20 resets) in 8992 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1001, 1002, 1000, 1001, 1000, 1000, 1001, 1001, 1002, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003]
[2024-06-01 05:52:15] [INFO ] Invariant cache hit.
[2024-06-01 05:52:15] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-01 05:52:16] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-06-01 05:52:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:52:16] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 05:52:16] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-06-01 05:52:16] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 05:52:16] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 05:52:16] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 05:52:16] [INFO ] Added : 27 causal constraints over 6 iterations in 37 ms. Result :sat
Minimization took 23 ms.
[2024-06-01 05:52:16] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 05:52:16] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-06-01 05:52:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:52:16] [INFO ] [Nat]Absence check using 10 positive place invariants in 1 ms returned sat
[2024-06-01 05:52:16] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-06-01 05:52:16] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 05:52:16] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-06-01 05:52:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2024-06-01 05:52:16] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 05:52:16] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-06-01 05:52:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:52:16] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 05:52:16] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-06-01 05:52:16] [INFO ] [Nat]Added 10 Read/Feed constraints in 87 ms returned sat
[2024-06-01 05:52:16] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 05:52:16] [INFO ] Added : 33 causal constraints over 8 iterations in 81 ms. Result :sat
Minimization took 26 ms.
[2024-06-01 05:52:16] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 05:52:16] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-06-01 05:52:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:52:16] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 05:52:16] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-06-01 05:52:16] [INFO ] [Nat]Added 10 Read/Feed constraints in 67 ms returned sat
[2024-06-01 05:52:16] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 05:52:16] [INFO ] Added : 23 causal constraints over 5 iterations in 36 ms. Result :sat
Minimization took 19 ms.
[2024-06-01 05:52:16] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-01 05:52:16] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-06-01 05:52:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:52:16] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 05:52:16] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-06-01 05:52:16] [INFO ] [Nat]Added 10 Read/Feed constraints in 20 ms returned sat
[2024-06-01 05:52:16] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 05:52:16] [INFO ] Added : 23 causal constraints over 6 iterations in 35 ms. Result :sat
Minimization took 18 ms.
[2024-06-01 05:52:16] [INFO ] [Real]Absence check using 10 positive place invariants in 1 ms returned sat
[2024-06-01 05:52:16] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-06-01 05:52:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:52:17] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 05:52:17] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-06-01 05:52:17] [INFO ] [Nat]Added 10 Read/Feed constraints in 64 ms returned sat
[2024-06-01 05:52:17] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 05:52:17] [INFO ] Added : 25 causal constraints over 6 iterations in 85 ms. Result :sat
Minimization took 19 ms.
[2024-06-01 05:52:17] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 05:52:17] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-06-01 05:52:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:52:17] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 05:52:17] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-06-01 05:52:17] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 05:52:17] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 05:52:17] [INFO ] Added : 25 causal constraints over 6 iterations in 70 ms. Result :sat
Minimization took 19 ms.
[2024-06-01 05:52:17] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 05:52:17] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-06-01 05:52:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:52:17] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 05:52:17] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-06-01 05:52:17] [INFO ] [Nat]Added 10 Read/Feed constraints in 37 ms returned sat
[2024-06-01 05:52:17] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 05:52:17] [INFO ] Added : 31 causal constraints over 7 iterations in 47 ms. Result :sat
Minimization took 31 ms.
[2024-06-01 05:52:17] [INFO ] [Real]Absence check using 10 positive place invariants in 1 ms returned sat
[2024-06-01 05:52:17] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-06-01 05:52:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:52:17] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 05:52:17] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-06-01 05:52:17] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 05:52:17] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 05:52:17] [INFO ] Added : 35 causal constraints over 9 iterations in 55 ms. Result :sat
Minimization took 16 ms.
[2024-06-01 05:52:17] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 05:52:17] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-06-01 05:52:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:52:17] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 05:52:17] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-06-01 05:52:17] [INFO ] [Nat]Added 10 Read/Feed constraints in 19 ms returned sat
[2024-06-01 05:52:17] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 05:52:17] [INFO ] Added : 22 causal constraints over 5 iterations in 62 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1001, 1002, 1000, 1001, 1000, 1000, 1001, 1001, 1002, 1000] Max Struct:[1003, 1002, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003]
FORMULA JoinFreeModules-PT-1000-UpperBounds-02 1002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1001, 1000, 1001, 1000, 1000, 1001, 1002, 1002, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003]
Support contains 9 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 80/80 transitions.
Graph (complete) has 120 edges and 50 vertex of which 45 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Applied a total of 1 rules in 2 ms. Remains 45 /50 variables (removed 5) and now considering 72/80 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 45/50 places, 72/80 transitions.
// Phase 1: matrix 72 rows 45 cols
[2024-06-01 05:52:28] [INFO ] Computed 9 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1001, 1000, 1001, 1000, 1000, 1001, 1002, 1002, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003]
RANDOM walk for 1000072 steps (2 resets) in 603 ms. (1655 steps per ms)
BEST_FIRST walk for 9000009 steps (18 resets) in 6944 ms. (1295 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1001, 1000, 1001, 1000, 1000, 1001, 1002, 1002, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003]
[2024-06-01 05:52:36] [INFO ] Invariant cache hit.
[2024-06-01 05:52:36] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-06-01 05:52:36] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-06-01 05:52:36] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:52:36] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2024-06-01 05:52:36] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2024-06-01 05:52:36] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-01 05:52:36] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2024-06-01 05:52:36] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 05:52:36] [INFO ] Added : 30 causal constraints over 7 iterations in 34 ms. Result :sat
Minimization took 23 ms.
[2024-06-01 05:52:36] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-06-01 05:52:36] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-06-01 05:52:36] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:52:36] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2024-06-01 05:52:36] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-06-01 05:52:36] [INFO ] [Nat]Added 9 Read/Feed constraints in 68 ms returned sat
[2024-06-01 05:52:36] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 8 ms.
[2024-06-01 05:52:36] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 05:52:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2024-06-01 05:52:36] [INFO ] Added : 36 causal constraints over 8 iterations in 92 ms. Result :sat
Minimization took 21 ms.
[2024-06-01 05:52:36] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-06-01 05:52:36] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-06-01 05:52:36] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:52:36] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2024-06-01 05:52:36] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-06-01 05:52:36] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2024-06-01 05:52:36] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 05:52:36] [INFO ] Added : 42 causal constraints over 10 iterations in 53 ms. Result :sat
Minimization took 23 ms.
[2024-06-01 05:52:37] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-06-01 05:52:37] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-06-01 05:52:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:52:37] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-06-01 05:52:37] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-06-01 05:52:37] [INFO ] [Nat]Added 9 Read/Feed constraints in 121 ms returned sat
[2024-06-01 05:52:37] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 05:52:37] [INFO ] Added : 47 causal constraints over 11 iterations in 63 ms. Result :sat
Minimization took 23 ms.
[2024-06-01 05:52:37] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-06-01 05:52:37] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-06-01 05:52:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:52:37] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-06-01 05:52:37] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-06-01 05:52:37] [INFO ] [Nat]Added 9 Read/Feed constraints in 107 ms returned sat
[2024-06-01 05:52:37] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 05:52:37] [INFO ] Added : 38 causal constraints over 9 iterations in 54 ms. Result :sat
Minimization took 27 ms.
[2024-06-01 05:52:37] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-06-01 05:52:37] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-06-01 05:52:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:52:37] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-06-01 05:52:37] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-06-01 05:52:37] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2024-06-01 05:52:37] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 05:52:37] [INFO ] Added : 35 causal constraints over 9 iterations in 49 ms. Result :sat
Minimization took 24 ms.
[2024-06-01 05:52:37] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-06-01 05:52:37] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-06-01 05:52:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:52:37] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-06-01 05:52:37] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-06-01 05:52:37] [INFO ] [Nat]Added 9 Read/Feed constraints in 15 ms returned sat
[2024-06-01 05:52:37] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 05:52:37] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 05:52:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
Minimization took 14 ms.
[2024-06-01 05:52:37] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-06-01 05:52:37] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-06-01 05:52:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:52:38] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-06-01 05:52:38] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-06-01 05:52:38] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2024-06-01 05:52:38] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 05:52:38] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 05:52:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2024-06-01 05:52:38] [INFO ] Added : 42 causal constraints over 11 iterations in 96 ms. Result :sat
Minimization took 19 ms.
[2024-06-01 05:52:38] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-06-01 05:52:38] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-06-01 05:52:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:52:38] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-06-01 05:52:38] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-06-01 05:52:38] [INFO ] [Nat]Added 9 Read/Feed constraints in 106 ms returned sat
[2024-06-01 05:52:38] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 05:52:38] [INFO ] Added : 43 causal constraints over 10 iterations in 70 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1001, 1000, 1001, 1000, 1000, 1001, 1002, 1002, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1002, 1003, 1003]
FORMULA JoinFreeModules-PT-1000-UpperBounds-12 1002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1001, 1000, 1001, 1000, 1000, 1001, 1002, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003]
Support contains 8 out of 45 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 72/72 transitions.
Graph (complete) has 108 edges and 45 vertex of which 40 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Applied a total of 1 rules in 2 ms. Remains 40 /45 variables (removed 5) and now considering 64/72 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 40/45 places, 64/72 transitions.
// Phase 1: matrix 64 rows 40 cols
[2024-06-01 05:52:46] [INFO ] Computed 8 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1001, 1000, 1001, 1000, 1000, 1001, 1002, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003]
RANDOM walk for 1000239 steps (2 resets) in 550 ms. (1815 steps per ms)
BEST_FIRST walk for 8000007 steps (16 resets) in 5552 ms. (1440 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1001, 1000, 1001, 1000, 1000, 1001, 1002, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003]
[2024-06-01 05:52:52] [INFO ] Invariant cache hit.
[2024-06-01 05:52:52] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-01 05:52:52] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-06-01 05:52:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:52:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-01 05:52:52] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-06-01 05:52:52] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 05:52:52] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-06-01 05:52:52] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 05:52:52] [INFO ] Added : 36 causal constraints over 8 iterations in 41 ms. Result :sat
Minimization took 20 ms.
[2024-06-01 05:52:52] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-01 05:52:53] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-06-01 05:52:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:52:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-01 05:52:53] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-06-01 05:52:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 20 ms returned sat
[2024-06-01 05:52:53] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 05:52:53] [INFO ] Added : 41 causal constraints over 10 iterations in 106 ms. Result :sat
Minimization took 20 ms.
[2024-06-01 05:52:53] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-01 05:52:53] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-06-01 05:52:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:52:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-01 05:52:53] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-06-01 05:52:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-06-01 05:52:53] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 05:52:53] [INFO ] Added : 36 causal constraints over 11 iterations in 59 ms. Result :sat
Minimization took 20 ms.
[2024-06-01 05:52:53] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-01 05:52:53] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-06-01 05:52:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:52:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-06-01 05:52:53] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-06-01 05:52:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-06-01 05:52:53] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 05:52:53] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 05:52:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2024-06-01 05:52:53] [INFO ] Added : 34 causal constraints over 10 iterations in 98 ms. Result :sat
Minimization took 22 ms.
[2024-06-01 05:52:53] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-01 05:52:53] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-06-01 05:52:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:52:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-06-01 05:52:53] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 05:52:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 21 ms returned sat
[2024-06-01 05:52:53] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 05:52:53] [INFO ] Added : 36 causal constraints over 9 iterations in 44 ms. Result :sat
Minimization took 19 ms.
[2024-06-01 05:52:53] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-06-01 05:52:53] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-06-01 05:52:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:52:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-06-01 05:52:53] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-06-01 05:52:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-06-01 05:52:53] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 05:52:53] [INFO ] Added : 36 causal constraints over 10 iterations in 45 ms. Result :sat
Minimization took 26 ms.
[2024-06-01 05:52:53] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-06-01 05:52:53] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-06-01 05:52:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:52:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-01 05:52:53] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-06-01 05:52:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 11 ms returned sat
[2024-06-01 05:52:53] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 05:52:54] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 05:52:54] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-06-01 05:52:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 49 ms
Minimization took 8 ms.
[2024-06-01 05:52:54] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-01 05:52:54] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-06-01 05:52:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:52:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-01 05:52:54] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-06-01 05:52:54] [INFO ] [Nat]Added 8 Read/Feed constraints in 31 ms returned sat
[2024-06-01 05:52:54] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 05:52:54] [INFO ] Added : 35 causal constraints over 8 iterations in 40 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1001, 1000, 1001, 1000, 1000, 1001, 1002, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1002, 1003]
FORMULA JoinFreeModules-PT-1000-UpperBounds-13 1002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1001, 1000, 1001, 1000, 1000, 1001, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003]
Support contains 7 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 64/64 transitions.
Graph (complete) has 96 edges and 40 vertex of which 35 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Applied a total of 1 rules in 1 ms. Remains 35 /40 variables (removed 5) and now considering 56/64 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 35/40 places, 56/64 transitions.
// Phase 1: matrix 56 rows 35 cols
[2024-06-01 05:52:59] [INFO ] Computed 7 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1001, 1000, 1001, 1000, 1000, 1001, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003]
RANDOM walk for 1000218 steps (2 resets) in 507 ms. (1968 steps per ms)
BEST_FIRST walk for 7000007 steps (14 resets) in 4308 ms. (1624 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1001, 1000, 1001, 1000, 1000, 1001, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003]
[2024-06-01 05:53:04] [INFO ] Invariant cache hit.
[2024-06-01 05:53:04] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 05:53:04] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-06-01 05:53:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:53:04] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-01 05:53:04] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 05:53:04] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-01 05:53:04] [INFO ] [Nat]Added 7 Read/Feed constraints in 16 ms returned sat
[2024-06-01 05:53:04] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 05:53:04] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 05:53:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2024-06-01 05:53:04] [INFO ] Added : 19 causal constraints over 4 iterations in 56 ms. Result :sat
Minimization took 10 ms.
[2024-06-01 05:53:04] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 05:53:04] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-06-01 05:53:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:53:04] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-01 05:53:04] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 05:53:04] [INFO ] [Nat]Added 7 Read/Feed constraints in 9 ms returned sat
[2024-06-01 05:53:04] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 05:53:04] [INFO ] Added : 23 causal constraints over 5 iterations in 26 ms. Result :sat
Minimization took 15 ms.
[2024-06-01 05:53:05] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 05:53:05] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-06-01 05:53:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:53:05] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-01 05:53:05] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-06-01 05:53:05] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2024-06-01 05:53:05] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 05:53:05] [INFO ] Added : 32 causal constraints over 7 iterations in 32 ms. Result :sat
Minimization took 18 ms.
[2024-06-01 05:53:05] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 05:53:05] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-06-01 05:53:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:53:05] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-01 05:53:05] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-06-01 05:53:05] [INFO ] [Nat]Added 7 Read/Feed constraints in 7 ms returned sat
[2024-06-01 05:53:05] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 05:53:05] [INFO ] Added : 17 causal constraints over 4 iterations in 33 ms. Result :sat
Minimization took 15 ms.
[2024-06-01 05:53:05] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-01 05:53:05] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-06-01 05:53:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:53:05] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 05:53:05] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-06-01 05:53:05] [INFO ] [Nat]Added 7 Read/Feed constraints in 25 ms returned sat
[2024-06-01 05:53:05] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 05:53:05] [INFO ] Added : 17 causal constraints over 6 iterations in 28 ms. Result :sat
Minimization took 16 ms.
[2024-06-01 05:53:05] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-01 05:53:05] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-06-01 05:53:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:53:05] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 05:53:05] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-06-01 05:53:05] [INFO ] [Nat]Added 7 Read/Feed constraints in 0 ms returned sat
[2024-06-01 05:53:05] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 05:53:05] [INFO ] Added : 26 causal constraints over 7 iterations in 57 ms. Result :sat
Minimization took 17 ms.
[2024-06-01 05:53:05] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 05:53:05] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-06-01 05:53:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:53:05] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-01 05:53:05] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 05:53:05] [INFO ] [Nat]Added 7 Read/Feed constraints in 8 ms returned sat
[2024-06-01 05:53:05] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 05:53:05] [INFO ] Added : 29 causal constraints over 8 iterations in 35 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1001, 1000, 1001, 1000, 1000, 1001, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1002, 1000, 1001, 1000, 1000, 1001, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003]
Support contains 7 out of 35 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 35 /35 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 35/35 places, 56/56 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 35 /35 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2024-06-01 05:53:10] [INFO ] Invariant cache hit.
[2024-06-01 05:53:10] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-01 05:53:10] [INFO ] Invariant cache hit.
[2024-06-01 05:53:10] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-01 05:53:10] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2024-06-01 05:53:10] [INFO ] Redundant transitions in 0 ms returned []
Running 42 sub problems to find dead transitions.
[2024-06-01 05:53:10] [INFO ] Invariant cache hit.
[2024-06-01 05:53:10] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 7/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 56/91 variables, 35/42 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (OVERLAPS) 0/91 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 49 constraints, problems are : Problem set: 0 solved, 42 unsolved in 440 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 7/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 56/91 variables, 35/42 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 42/91 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-06-01 05:53:10] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 0/91 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 92 constraints, problems are : Problem set: 0 solved, 42 unsolved in 886 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 1/1 constraints]
After SMT, in 1332ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 1333ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1398 ms. Remains : 35/35 places, 56/56 transitions.
[2024-06-01 05:53:11] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1002, 1000, 1001, 1000, 1000, 1001, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003]
RANDOM walk for 1000699 steps (2 resets) in 499 ms. (2001 steps per ms)
BEST_FIRST walk for 7000006 steps (14 resets) in 4322 ms. (1619 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1002, 1000, 1001, 1000, 1000, 1001, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003]
[2024-06-01 05:53:16] [INFO ] Invariant cache hit.
[2024-06-01 05:53:16] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-01 05:53:16] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-06-01 05:53:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:53:16] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-01 05:53:16] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-06-01 05:53:16] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-01 05:53:16] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2024-06-01 05:53:16] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 05:53:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2024-06-01 05:53:16] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-01 05:53:16] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-06-01 05:53:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:53:16] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 05:53:16] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-06-01 05:53:16] [INFO ] [Nat]Added 7 Read/Feed constraints in 8 ms returned sat
[2024-06-01 05:53:16] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 05:53:16] [INFO ] Added : 23 causal constraints over 5 iterations in 30 ms. Result :sat
Minimization took 15 ms.
[2024-06-01 05:53:16] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 05:53:16] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-06-01 05:53:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:53:16] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 05:53:16] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-06-01 05:53:16] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2024-06-01 05:53:16] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 05:53:16] [INFO ] Added : 32 causal constraints over 7 iterations in 32 ms. Result :sat
Minimization took 17 ms.
[2024-06-01 05:53:16] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 05:53:16] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-06-01 05:53:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:53:16] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 05:53:16] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-06-01 05:53:16] [INFO ] [Nat]Added 7 Read/Feed constraints in 8 ms returned sat
[2024-06-01 05:53:16] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 05:53:16] [INFO ] Added : 17 causal constraints over 4 iterations in 34 ms. Result :sat
Minimization took 13 ms.
[2024-06-01 05:53:16] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 05:53:16] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-06-01 05:53:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:53:16] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-01 05:53:16] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 05:53:16] [INFO ] [Nat]Added 7 Read/Feed constraints in 25 ms returned sat
[2024-06-01 05:53:16] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 05:53:16] [INFO ] Added : 17 causal constraints over 6 iterations in 29 ms. Result :sat
Minimization took 18 ms.
[2024-06-01 05:53:16] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 05:53:16] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-06-01 05:53:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:53:17] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-01 05:53:17] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 05:53:17] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2024-06-01 05:53:17] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 05:53:17] [INFO ] Added : 26 causal constraints over 7 iterations in 56 ms. Result :sat
Minimization took 18 ms.
[2024-06-01 05:53:17] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-01 05:53:17] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-06-01 05:53:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:53:17] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 05:53:17] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 05:53:17] [INFO ] [Nat]Added 7 Read/Feed constraints in 8 ms returned sat
[2024-06-01 05:53:17] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 05:53:17] [INFO ] Added : 29 causal constraints over 8 iterations in 36 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1002, 1000, 1001, 1000, 1000, 1001, 1000] Max Struct:[1002, 1003, 1003, 1003, 1003, 1003, 1003]
FORMULA JoinFreeModules-PT-1000-UpperBounds-01 1002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1000, 1001, 1000, 1000, 1001, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003]
Support contains 6 out of 35 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 56/56 transitions.
Graph (complete) has 84 edges and 35 vertex of which 30 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Applied a total of 1 rules in 2 ms. Remains 30 /35 variables (removed 5) and now considering 48/56 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 30/35 places, 48/56 transitions.
// Phase 1: matrix 48 rows 30 cols
[2024-06-01 05:53:20] [INFO ] Computed 6 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1000, 1001, 1000, 1000, 1001, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003]
RANDOM walk for 1000101 steps (2 resets) in 416 ms. (2398 steps per ms)
BEST_FIRST walk for 6000006 steps (12 resets) in 3119 ms. (1923 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1000, 1001, 1000, 1000, 1001, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003]
[2024-06-01 05:53:24] [INFO ] Invariant cache hit.
[2024-06-01 05:53:24] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 05:53:24] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-06-01 05:53:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:53:24] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 05:53:24] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-06-01 05:53:24] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 05:53:24] [INFO ] [Nat]Added 6 Read/Feed constraints in 6 ms returned sat
[2024-06-01 05:53:24] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 05:53:24] [INFO ] Added : 23 causal constraints over 5 iterations in 32 ms. Result :sat
Minimization took 19 ms.
[2024-06-01 05:53:24] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 05:53:24] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-06-01 05:53:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:53:24] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 05:53:24] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 05:53:24] [INFO ] [Nat]Added 6 Read/Feed constraints in 10 ms returned sat
[2024-06-01 05:53:24] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 05:53:24] [INFO ] Added : 28 causal constraints over 6 iterations in 35 ms. Result :sat
Minimization took 24 ms.
[2024-06-01 05:53:24] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 05:53:24] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-06-01 05:53:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:53:24] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 05:53:24] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-06-01 05:53:24] [INFO ] [Nat]Added 6 Read/Feed constraints in 5 ms returned sat
[2024-06-01 05:53:24] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 05:53:24] [INFO ] Added : 17 causal constraints over 5 iterations in 21 ms. Result :sat
Minimization took 15 ms.
[2024-06-01 05:53:24] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 05:53:24] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-06-01 05:53:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:53:24] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 05:53:24] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 05:53:24] [INFO ] [Nat]Added 6 Read/Feed constraints in 16 ms returned sat
[2024-06-01 05:53:24] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 05:53:24] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 3 ms to minimize.
[2024-06-01 05:53:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2024-06-01 05:53:24] [INFO ] Added : 16 causal constraints over 5 iterations in 71 ms. Result :sat
Minimization took 14 ms.
[2024-06-01 05:53:24] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 05:53:24] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-06-01 05:53:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:53:24] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 05:53:24] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-06-01 05:53:24] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2024-06-01 05:53:24] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 05:53:24] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-06-01 05:53:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2024-06-01 05:53:24] [INFO ] Added : 29 causal constraints over 6 iterations in 71 ms. Result :sat
Minimization took 16 ms.
[2024-06-01 05:53:24] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 05:53:25] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-06-01 05:53:25] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:53:25] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 05:53:25] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 05:53:25] [INFO ] [Nat]Added 6 Read/Feed constraints in 15 ms returned sat
[2024-06-01 05:53:25] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 05:53:25] [INFO ] Added : 27 causal constraints over 6 iterations in 26 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1000, 1001, 1000, 1000, 1001, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1000, 1001, 1000, 1000, 1001, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003]
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 30/30 places, 48/48 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2024-06-01 05:53:27] [INFO ] Invariant cache hit.
[2024-06-01 05:53:27] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-01 05:53:27] [INFO ] Invariant cache hit.
[2024-06-01 05:53:27] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 05:53:27] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2024-06-01 05:53:27] [INFO ] Redundant transitions in 1 ms returned []
Running 36 sub problems to find dead transitions.
[2024-06-01 05:53:27] [INFO ] Invariant cache hit.
[2024-06-01 05:53:27] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 6/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 48/78 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/78 variables, and 42 constraints, problems are : Problem set: 0 solved, 36 unsolved in 325 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 30/30 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 6/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 48/78 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 36/78 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 0/78 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/78 variables, and 78 constraints, problems are : Problem set: 0 solved, 36 unsolved in 470 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 30/30 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
After SMT, in 804ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 808ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 881 ms. Remains : 30/30 places, 48/48 transitions.
RANDOM walk for 41017 steps (8 resets) in 79 ms. (512 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 220 ms. (181 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 211 ms. (188 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 289 ms. (137 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 250 ms. (159 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 125 ms. (317 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 90 ms. (439 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 156724 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :0 out of 12
Probabilistic random walk after 156724 steps, saw 140066 distinct states, run finished after 3005 ms. (steps per millisecond=52 ) properties seen :0
[2024-06-01 05:53:32] [INFO ] Invariant cache hit.
[2024-06-01 05:53:32] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 24/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-01 05:53:32] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 05:53:32] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-06-01 05:53:32] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 05:53:32] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 05:53:32] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 05:53:32] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
Problem MAX0 is UNSAT
Problem MAX1 is UNSAT
Problem MAX2 is UNSAT
Problem MAX3 is UNSAT
Problem MAX4 is UNSAT
Problem MAX5 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 6/12 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/12 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 48/78 variables, 30/42 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 6/48 constraints. Problems are: Problem set: 6 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/48 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/78 variables, 0/48 constraints. Problems are: Problem set: 6 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/78 variables, and 48 constraints, problems are : Problem set: 6 solved, 6 unsolved in 216 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 30/30 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 6 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 24/30 variables, 6/6 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 6/12 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/12 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 48/78 variables, 30/42 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 6/48 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 6/54 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/54 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/78 variables, 0/54 constraints. Problems are: Problem set: 6 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/78 variables, and 54 constraints, problems are : Problem set: 6 solved, 6 unsolved in 216 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 30/30 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/12 constraints, Known Traps: 6/6 constraints]
After SMT, in 437ms problems are : Problem set: 6 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3582 ms.
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Running 36 sub problems to find dead transitions.
[2024-06-01 05:53:36] [INFO ] Invariant cache hit.
[2024-06-01 05:53:36] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 6/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 48/78 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/78 variables, and 42 constraints, problems are : Problem set: 0 solved, 36 unsolved in 357 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 30/30 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 6/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 48/78 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 36/78 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 0/78 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/78 variables, and 78 constraints, problems are : Problem set: 0 solved, 36 unsolved in 476 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 30/30 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
After SMT, in 843ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 843ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 846 ms. Remains : 30/30 places, 48/48 transitions.
RANDOM walk for 42473 steps (8 resets) in 58 ms. (719 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 35 ms. (1111 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 214863 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :0 out of 6
Probabilistic random walk after 214863 steps, saw 188836 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :0
[2024-06-01 05:53:40] [INFO ] Invariant cache hit.
[2024-06-01 05:53:40] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 24/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 48/78 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/78 variables, and 42 constraints, problems are : Problem set: 0 solved, 6 unsolved in 73 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 30/30 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 24/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 05:53:40] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 05:53:40] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 10 ms to minimize.
[2024-06-01 05:53:40] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 48/78 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 6/45 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/78 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/78 variables, and 51 constraints, problems are : Problem set: 0 solved, 6 unsolved in 263 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 30/30 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 3/3 constraints]
After SMT, in 340ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2486 ms.
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 30/30 places, 48/48 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2024-06-01 05:53:42] [INFO ] Invariant cache hit.
[2024-06-01 05:53:42] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 05:53:42] [INFO ] Invariant cache hit.
[2024-06-01 05:53:43] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 05:53:43] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-06-01 05:53:43] [INFO ] Redundant transitions in 0 ms returned []
Running 36 sub problems to find dead transitions.
[2024-06-01 05:53:43] [INFO ] Invariant cache hit.
[2024-06-01 05:53:43] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 6/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 48/78 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/78 variables, and 42 constraints, problems are : Problem set: 0 solved, 36 unsolved in 385 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 30/30 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 6/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 48/78 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 36/78 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 0/78 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/78 variables, and 78 constraints, problems are : Problem set: 0 solved, 36 unsolved in 442 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 30/30 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
After SMT, in 834ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 834ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 891 ms. Remains : 30/30 places, 48/48 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1000, 1001, 1000, 1000, 1001, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003]
Starting property specific reduction for JoinFreeModules-PT-1000-UpperBounds-04
Current structural bounds on expressions (Initially) : Max Seen:[1000] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[1000] Max Struct:[1003]
Current structural bounds on expressions (Before main loop) : Max Seen:[1000] Max Struct:[1003]
[2024-06-01 05:53:43] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1000] Max Struct:[1003]
RANDOM walk for 10150 steps (2 resets) in 5 ms. (1691 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1000] Max Struct:[1003]
[2024-06-01 05:53:43] [INFO ] Invariant cache hit.
[2024-06-01 05:53:43] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 05:53:43] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-06-01 05:53:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:53:43] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 05:53:43] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-06-01 05:53:43] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 05:53:43] [INFO ] [Nat]Added 6 Read/Feed constraints in 6 ms returned sat
[2024-06-01 05:53:43] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 05:53:43] [INFO ] Added : 23 causal constraints over 5 iterations in 30 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1000] Max Struct:[1003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1000] Max Struct:[1003]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 48/48 transitions.
Graph (complete) has 72 edges and 30 vertex of which 5 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.1 ms
Discarding 25 places :
Also discarding 40 output transitions
Drop transitions (Output transitions of discarded places.) removed 40 transitions
Applied a total of 1 rules in 2 ms. Remains 5 /30 variables (removed 25) and now considering 8/48 (removed 40) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-06-01 05:53:44] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 05:53:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 107ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 108ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 5/30 places, 8/48 transitions.
[2024-06-01 05:53:44] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1000] Max Struct:[1003]
RANDOM walk for 1000038 steps (2 resets) in 112 ms. (8849 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 159 ms. (6250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1000] Max Struct:[1003]
[2024-06-01 05:53:44] [INFO ] Invariant cache hit.
[2024-06-01 05:53:44] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 05:53:44] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-06-01 05:53:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 05:53:44] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-06-01 05:53:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:53:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 05:53:44] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-06-01 05:53:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 05:53:44] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 05:53:44] [INFO ] Added : 5 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1000] Max Struct:[1003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1000] Max Struct:[1003]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 05:53:44] [INFO ] Invariant cache hit.
[2024-06-01 05:53:44] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-01 05:53:44] [INFO ] Invariant cache hit.
[2024-06-01 05:53:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 05:53:44] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-06-01 05:53:44] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 05:53:44] [INFO ] Invariant cache hit.
[2024-06-01 05:53:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 113ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 113ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40732 steps (8 resets) in 12 ms. (3133 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 22 ms. (1739 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 959848 steps, run timeout after 3001 ms. (steps per millisecond=319 ) properties seen :0 out of 2
Probabilistic random walk after 959848 steps, saw 384859 distinct states, run finished after 3005 ms. (steps per millisecond=319 ) properties seen :0
[2024-06-01 05:53:48] [INFO ] Invariant cache hit.
[2024-06-01 05:53:48] [INFO ] State equation strengthened by 1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 05:53:48] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 31 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 92ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2024-06-01 05:53:48] [INFO ] Invariant cache hit.
[2024-06-01 05:53:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 68 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 133ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 134ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40737 steps (8 resets) in 13 ms. (2909 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 16 ms. (2353 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3418514 steps, run timeout after 3001 ms. (steps per millisecond=1139 ) properties seen :0 out of 1
Probabilistic random walk after 3418514 steps, saw 1203625 distinct states, run finished after 3001 ms. (steps per millisecond=1139 ) properties seen :0
[2024-06-01 05:53:51] [INFO ] Invariant cache hit.
[2024-06-01 05:53:51] [INFO ] State equation strengthened by 1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 25 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 59ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 05:53:51] [INFO ] Invariant cache hit.
[2024-06-01 05:53:51] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 05:53:51] [INFO ] Invariant cache hit.
[2024-06-01 05:53:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 05:53:51] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2024-06-01 05:53:51] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 05:53:51] [INFO ] Invariant cache hit.
[2024-06-01 05:53:51] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 57 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 106ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 107ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 151 ms. Remains : 5/5 places, 8/8 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1000] Max Struct:[1003]
Ending property specific reduction for JoinFreeModules-PT-1000-UpperBounds-04 in 7703 ms.
Starting property specific reduction for JoinFreeModules-PT-1000-UpperBounds-06
Current structural bounds on expressions (Initially) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[1] Max Struct:[1003]
Current structural bounds on expressions (Before main loop) : Max Seen:[1] Max Struct:[1003]
// Phase 1: matrix 48 rows 30 cols
[2024-06-01 05:53:51] [INFO ] Computed 6 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[1003]
RANDOM walk for 10477 steps (2 resets) in 5 ms. (1746 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1001] Max Struct:[1003]
[2024-06-01 05:53:51] [INFO ] Invariant cache hit.
[2024-06-01 05:53:51] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 05:53:51] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-06-01 05:53:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:53:51] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 05:53:51] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-06-01 05:53:51] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 05:53:51] [INFO ] [Nat]Added 6 Read/Feed constraints in 11 ms returned sat
[2024-06-01 05:53:51] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 05:53:51] [INFO ] Added : 28 causal constraints over 6 iterations in 24 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1001] Max Struct:[1003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1001] Max Struct:[1003]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 48/48 transitions.
Graph (complete) has 72 edges and 30 vertex of which 5 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.1 ms
Discarding 25 places :
Also discarding 40 output transitions
Drop transitions (Output transitions of discarded places.) removed 40 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /30 variables (removed 25) and now considering 8/48 (removed 40) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-06-01 05:53:52] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 05:53:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 122ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 122ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 5/30 places, 8/48 transitions.
[2024-06-01 05:53:52] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1001] Max Struct:[1003]
RANDOM walk for 1000100 steps (2 resets) in 106 ms. (9346 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 214 ms. (4651 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1001] Max Struct:[1003]
[2024-06-01 05:53:52] [INFO ] Invariant cache hit.
[2024-06-01 05:53:52] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 05:53:52] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-06-01 05:53:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:53:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 05:53:52] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-06-01 05:53:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 05:53:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 05:53:52] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-01 05:53:52] [INFO ] Added : 6 causal constraints over 3 iterations in 6 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1001] Max Struct:[1003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1001] Max Struct:[1003]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 05:53:52] [INFO ] Invariant cache hit.
[2024-06-01 05:53:52] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 05:53:52] [INFO ] Invariant cache hit.
[2024-06-01 05:53:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 05:53:52] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2024-06-01 05:53:52] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 05:53:52] [INFO ] Invariant cache hit.
[2024-06-01 05:53:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 39 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 56 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 97ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 97ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40832 steps (8 resets) in 36 ms. (1103 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 24 ms. (1600 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1155983 steps, run timeout after 3001 ms. (steps per millisecond=385 ) properties seen :0 out of 2
Probabilistic random walk after 1155983 steps, saw 441903 distinct states, run finished after 3001 ms. (steps per millisecond=385 ) properties seen :0
[2024-06-01 05:53:55] [INFO ] Invariant cache hit.
[2024-06-01 05:53:55] [INFO ] State equation strengthened by 1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 05:53:55] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 57 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 91ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 42 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2024-06-01 05:53:56] [INFO ] Invariant cache hit.
[2024-06-01 05:53:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 56 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 108ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 109ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40674 steps (8 resets) in 12 ms. (3128 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 17 ms. (2222 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3868625 steps, run timeout after 3001 ms. (steps per millisecond=1289 ) properties seen :0 out of 1
Probabilistic random walk after 3868625 steps, saw 1364462 distinct states, run finished after 3001 ms. (steps per millisecond=1289 ) properties seen :0
[2024-06-01 05:53:59] [INFO ] Invariant cache hit.
[2024-06-01 05:53:59] [INFO ] State equation strengthened by 1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 27 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 60ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 42 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 05:53:59] [INFO ] Invariant cache hit.
[2024-06-01 05:53:59] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 05:53:59] [INFO ] Invariant cache hit.
[2024-06-01 05:53:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 05:53:59] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-06-01 05:53:59] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 05:53:59] [INFO ] Invariant cache hit.
[2024-06-01 05:53:59] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 111ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 111ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 161 ms. Remains : 5/5 places, 8/8 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1001] Max Struct:[1003]
Ending property specific reduction for JoinFreeModules-PT-1000-UpperBounds-06 in 7875 ms.
Starting property specific reduction for JoinFreeModules-PT-1000-UpperBounds-08
Current structural bounds on expressions (Initially) : Max Seen:[1000] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[1000] Max Struct:[1003]
Current structural bounds on expressions (Before main loop) : Max Seen:[1000] Max Struct:[1003]
// Phase 1: matrix 48 rows 30 cols
[2024-06-01 05:53:59] [INFO ] Computed 6 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1000] Max Struct:[1003]
RANDOM walk for 10339 steps (2 resets) in 7 ms. (1292 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1000] Max Struct:[1003]
[2024-06-01 05:53:59] [INFO ] Invariant cache hit.
[2024-06-01 05:53:59] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 05:53:59] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-06-01 05:53:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:53:59] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 05:53:59] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-06-01 05:53:59] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 05:53:59] [INFO ] [Nat]Added 6 Read/Feed constraints in 5 ms returned sat
[2024-06-01 05:53:59] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 05:53:59] [INFO ] Added : 17 causal constraints over 5 iterations in 20 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1000] Max Struct:[1003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1000] Max Struct:[1003]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 48/48 transitions.
Graph (complete) has 72 edges and 30 vertex of which 5 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.0 ms
Discarding 25 places :
Also discarding 40 output transitions
Drop transitions (Output transitions of discarded places.) removed 40 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /30 variables (removed 25) and now considering 8/48 (removed 40) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-06-01 05:53:59] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 05:53:59] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 104ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 105ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 5/30 places, 8/48 transitions.
[2024-06-01 05:54:00] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1000] Max Struct:[1003]
RANDOM walk for 1000229 steps (2 resets) in 106 ms. (9347 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 143 ms. (6944 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1000] Max Struct:[1003]
[2024-06-01 05:54:00] [INFO ] Invariant cache hit.
[2024-06-01 05:54:00] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 05:54:00] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-06-01 05:54:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 05:54:00] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-06-01 05:54:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:54:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 05:54:00] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-06-01 05:54:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2024-06-01 05:54:00] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 05:54:00] [INFO ] Added : 5 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1000] Max Struct:[1003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1000] Max Struct:[1003]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 05:54:00] [INFO ] Invariant cache hit.
[2024-06-01 05:54:00] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-06-01 05:54:00] [INFO ] Invariant cache hit.
[2024-06-01 05:54:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 05:54:00] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2024-06-01 05:54:00] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 05:54:00] [INFO ] Invariant cache hit.
[2024-06-01 05:54:00] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 42 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 93ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 93ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40563 steps (8 resets) in 14 ms. (2704 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 19 ms. (2000 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 16 ms. (2353 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1282933 steps, run timeout after 3001 ms. (steps per millisecond=427 ) properties seen :0 out of 2
Probabilistic random walk after 1282933 steps, saw 443881 distinct states, run finished after 3001 ms. (steps per millisecond=427 ) properties seen :0
[2024-06-01 05:54:03] [INFO ] Invariant cache hit.
[2024-06-01 05:54:03] [INFO ] State equation strengthened by 1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 05:54:03] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 26 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 80ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2024-06-01 05:54:03] [INFO ] Invariant cache hit.
[2024-06-01 05:54:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 57 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 112ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 112ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40285 steps (8 resets) in 17 ms. (2238 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 23 ms. (1666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3580943 steps, run timeout after 3001 ms. (steps per millisecond=1193 ) properties seen :0 out of 1
Probabilistic random walk after 3580943 steps, saw 1261442 distinct states, run finished after 3001 ms. (steps per millisecond=1193 ) properties seen :0
[2024-06-01 05:54:06] [INFO ] Invariant cache hit.
[2024-06-01 05:54:06] [INFO ] State equation strengthened by 1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 23 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 56ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 05:54:06] [INFO ] Invariant cache hit.
[2024-06-01 05:54:06] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 05:54:06] [INFO ] Invariant cache hit.
[2024-06-01 05:54:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 05:54:06] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-06-01 05:54:06] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 05:54:06] [INFO ] Invariant cache hit.
[2024-06-01 05:54:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 100ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 100ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 5/5 places, 8/8 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1000] Max Struct:[1003]
Ending property specific reduction for JoinFreeModules-PT-1000-UpperBounds-08 in 7569 ms.
Starting property specific reduction for JoinFreeModules-PT-1000-UpperBounds-10
Current structural bounds on expressions (Initially) : Max Seen:[1000] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[1000] Max Struct:[1003]
Current structural bounds on expressions (Before main loop) : Max Seen:[1000] Max Struct:[1003]
// Phase 1: matrix 48 rows 30 cols
[2024-06-01 05:54:07] [INFO ] Computed 6 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1000] Max Struct:[1003]
RANDOM walk for 10117 steps (2 resets) in 6 ms. (1445 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1000] Max Struct:[1003]
[2024-06-01 05:54:07] [INFO ] Invariant cache hit.
[2024-06-01 05:54:07] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 05:54:07] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-06-01 05:54:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:54:07] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 05:54:07] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-06-01 05:54:07] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 05:54:07] [INFO ] [Nat]Added 6 Read/Feed constraints in 15 ms returned sat
[2024-06-01 05:54:07] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 05:54:07] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 05:54:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2024-06-01 05:54:07] [INFO ] Added : 16 causal constraints over 5 iterations in 66 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1000] Max Struct:[1003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1000] Max Struct:[1003]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 48/48 transitions.
Graph (complete) has 72 edges and 30 vertex of which 5 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.0 ms
Discarding 25 places :
Also discarding 40 output transitions
Drop transitions (Output transitions of discarded places.) removed 40 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /30 variables (removed 25) and now considering 8/48 (removed 40) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-06-01 05:54:07] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 05:54:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 68 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 118ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 119ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 5/30 places, 8/48 transitions.
[2024-06-01 05:54:07] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1000] Max Struct:[1003]
RANDOM walk for 1000030 steps (2 resets) in 108 ms. (9174 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 147 ms. (6756 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1000] Max Struct:[1003]
[2024-06-01 05:54:07] [INFO ] Invariant cache hit.
[2024-06-01 05:54:07] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 05:54:07] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-06-01 05:54:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 05:54:07] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-06-01 05:54:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:54:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 05:54:08] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-06-01 05:54:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 05:54:08] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 05:54:08] [INFO ] Added : 5 causal constraints over 2 iterations in 11 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1000] Max Struct:[1003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1000] Max Struct:[1003]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 05:54:08] [INFO ] Invariant cache hit.
[2024-06-01 05:54:08] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-06-01 05:54:08] [INFO ] Invariant cache hit.
[2024-06-01 05:54:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 05:54:08] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2024-06-01 05:54:08] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 05:54:08] [INFO ] Invariant cache hit.
[2024-06-01 05:54:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 103ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 103ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40373 steps (8 resets) in 16 ms. (2374 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 25 ms. (1538 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 15 ms. (2500 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1057962 steps, run timeout after 3001 ms. (steps per millisecond=352 ) properties seen :0 out of 2
Probabilistic random walk after 1057962 steps, saw 420897 distinct states, run finished after 3003 ms. (steps per millisecond=352 ) properties seen :0
[2024-06-01 05:54:11] [INFO ] Invariant cache hit.
[2024-06-01 05:54:11] [INFO ] State equation strengthened by 1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 05:54:11] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 52 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 30 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 85ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 2 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2024-06-01 05:54:11] [INFO ] Invariant cache hit.
[2024-06-01 05:54:11] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 57 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 107ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 107ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40638 steps (8 resets) in 15 ms. (2539 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3790710 steps, run timeout after 3001 ms. (steps per millisecond=1263 ) properties seen :0 out of 1
Probabilistic random walk after 3790710 steps, saw 1336408 distinct states, run finished after 3001 ms. (steps per millisecond=1263 ) properties seen :0
[2024-06-01 05:54:14] [INFO ] Invariant cache hit.
[2024-06-01 05:54:14] [INFO ] State equation strengthened by 1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 32 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 35 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 71ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 2 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 05:54:14] [INFO ] Invariant cache hit.
[2024-06-01 05:54:14] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 05:54:14] [INFO ] Invariant cache hit.
[2024-06-01 05:54:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 05:54:14] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-06-01 05:54:14] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 05:54:14] [INFO ] Invariant cache hit.
[2024-06-01 05:54:14] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 59 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 119ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 119ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 5/5 places, 8/8 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1000] Max Struct:[1003]
Ending property specific reduction for JoinFreeModules-PT-1000-UpperBounds-10 in 7653 ms.
Starting property specific reduction for JoinFreeModules-PT-1000-UpperBounds-11
Current structural bounds on expressions (Initially) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[1] Max Struct:[1003]
Current structural bounds on expressions (Before main loop) : Max Seen:[1] Max Struct:[1003]
// Phase 1: matrix 48 rows 30 cols
[2024-06-01 05:54:14] [INFO ] Computed 6 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[1003]
RANDOM walk for 10452 steps (2 resets) in 9 ms. (1045 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1001] Max Struct:[1003]
[2024-06-01 05:54:14] [INFO ] Invariant cache hit.
[2024-06-01 05:54:14] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 05:54:14] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 05:54:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:54:14] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 05:54:14] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-06-01 05:54:14] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 05:54:14] [INFO ] [Nat]Added 6 Read/Feed constraints in 0 ms returned sat
[2024-06-01 05:54:14] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 05:54:14] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-06-01 05:54:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2024-06-01 05:54:14] [INFO ] Added : 29 causal constraints over 6 iterations in 65 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1001] Max Struct:[1003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1001] Max Struct:[1003]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 48/48 transitions.
Graph (complete) has 72 edges and 30 vertex of which 5 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.0 ms
Discarding 25 places :
Also discarding 40 output transitions
Drop transitions (Output transitions of discarded places.) removed 40 transitions
Applied a total of 1 rules in 2 ms. Remains 5 /30 variables (removed 25) and now considering 8/48 (removed 40) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-06-01 05:54:15] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 05:54:15] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 61 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 115ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 115ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 5/30 places, 8/48 transitions.
[2024-06-01 05:54:15] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1001] Max Struct:[1003]
RANDOM walk for 1000112 steps (2 resets) in 109 ms. (9091 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 150 ms. (6622 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1001] Max Struct:[1003]
[2024-06-01 05:54:15] [INFO ] Invariant cache hit.
[2024-06-01 05:54:15] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 05:54:15] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-06-01 05:54:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:54:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 05:54:15] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-06-01 05:54:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 05:54:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 05:54:15] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 05:54:15] [INFO ] Added : 6 causal constraints over 3 iterations in 6 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1001] Max Struct:[1003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1001] Max Struct:[1003]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 05:54:15] [INFO ] Invariant cache hit.
[2024-06-01 05:54:15] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-01 05:54:15] [INFO ] Invariant cache hit.
[2024-06-01 05:54:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 05:54:15] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-06-01 05:54:15] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 05:54:15] [INFO ] Invariant cache hit.
[2024-06-01 05:54:15] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 118ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 118ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40599 steps (8 resets) in 14 ms. (2706 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 16 ms. (2353 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 947185 steps, run timeout after 3001 ms. (steps per millisecond=315 ) properties seen :0 out of 2
Probabilistic random walk after 947185 steps, saw 379801 distinct states, run finished after 3001 ms. (steps per millisecond=315 ) properties seen :0
[2024-06-01 05:54:19] [INFO ] Invariant cache hit.
[2024-06-01 05:54:19] [INFO ] State equation strengthened by 1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 05:54:19] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 34 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 89ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 43 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2024-06-01 05:54:19] [INFO ] Invariant cache hit.
[2024-06-01 05:54:19] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 108ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 108ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40618 steps (8 resets) in 13 ms. (2901 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 15 ms. (2500 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3110739 steps, run timeout after 3001 ms. (steps per millisecond=1036 ) properties seen :0 out of 1
Probabilistic random walk after 3110739 steps, saw 1097452 distinct states, run finished after 3001 ms. (steps per millisecond=1036 ) properties seen :0
[2024-06-01 05:54:22] [INFO ] Invariant cache hit.
[2024-06-01 05:54:22] [INFO ] State equation strengthened by 1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 24 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 25 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 54ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 44 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 05:54:22] [INFO ] Invariant cache hit.
[2024-06-01 05:54:22] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 05:54:22] [INFO ] Invariant cache hit.
[2024-06-01 05:54:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 05:54:22] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-06-01 05:54:22] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 05:54:22] [INFO ] Invariant cache hit.
[2024-06-01 05:54:22] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 66 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 112ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 113ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 5/5 places, 8/8 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1001] Max Struct:[1003]
Ending property specific reduction for JoinFreeModules-PT-1000-UpperBounds-11 in 7921 ms.
Starting property specific reduction for JoinFreeModules-PT-1000-UpperBounds-15
Current structural bounds on expressions (Initially) : Max Seen:[1000] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[1000] Max Struct:[1003]
Current structural bounds on expressions (Before main loop) : Max Seen:[1000] Max Struct:[1003]
// Phase 1: matrix 48 rows 30 cols
[2024-06-01 05:54:22] [INFO ] Computed 6 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1000] Max Struct:[1003]
RANDOM walk for 10429 steps (2 resets) in 7 ms. (1303 steps per ms)
BEST_FIRST walk for 10000 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1000] Max Struct:[1003]
[2024-06-01 05:54:22] [INFO ] Invariant cache hit.
[2024-06-01 05:54:22] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 05:54:22] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-06-01 05:54:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:54:22] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 05:54:22] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 05:54:22] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 05:54:22] [INFO ] [Nat]Added 6 Read/Feed constraints in 6 ms returned sat
[2024-06-01 05:54:22] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 05:54:22] [INFO ] Added : 27 causal constraints over 6 iterations in 34 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1000] Max Struct:[1003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1000] Max Struct:[1003]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 48/48 transitions.
Graph (complete) has 72 edges and 30 vertex of which 5 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.0 ms
Discarding 25 places :
Also discarding 40 output transitions
Drop transitions (Output transitions of discarded places.) removed 40 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /30 variables (removed 25) and now considering 8/48 (removed 40) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-06-01 05:54:23] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 05:54:23] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 106ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 106ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 5/30 places, 8/48 transitions.
[2024-06-01 05:54:23] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1000] Max Struct:[1003]
RANDOM walk for 1000194 steps (2 resets) in 109 ms. (9092 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 150 ms. (6622 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1000] Max Struct:[1003]
[2024-06-01 05:54:23] [INFO ] Invariant cache hit.
[2024-06-01 05:54:23] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 05:54:23] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-06-01 05:54:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 05:54:23] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-06-01 05:54:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:54:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 05:54:23] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-06-01 05:54:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2024-06-01 05:54:23] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-01 05:54:23] [INFO ] Added : 5 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1000] Max Struct:[1003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1000] Max Struct:[1003]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 05:54:23] [INFO ] Invariant cache hit.
[2024-06-01 05:54:23] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 05:54:23] [INFO ] Invariant cache hit.
[2024-06-01 05:54:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 05:54:23] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2024-06-01 05:54:23] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 05:54:23] [INFO ] Invariant cache hit.
[2024-06-01 05:54:23] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 58 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 107ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 108ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40698 steps (8 resets) in 16 ms. (2394 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 22 ms. (1739 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 21 ms. (1818 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 904288 steps, run timeout after 3001 ms. (steps per millisecond=301 ) properties seen :0 out of 2
Probabilistic random walk after 904288 steps, saw 364422 distinct states, run finished after 3001 ms. (steps per millisecond=301 ) properties seen :0
[2024-06-01 05:54:26] [INFO ] Invariant cache hit.
[2024-06-01 05:54:26] [INFO ] State equation strengthened by 1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 05:54:26] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 31 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 88ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2024-06-01 05:54:26] [INFO ] Invariant cache hit.
[2024-06-01 05:54:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 112ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 113ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 41319 steps (8 resets) in 14 ms. (2754 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 17 ms. (2222 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3830901 steps, run timeout after 3001 ms. (steps per millisecond=1276 ) properties seen :0 out of 1
Probabilistic random walk after 3830901 steps, saw 1350965 distinct states, run finished after 3003 ms. (steps per millisecond=1275 ) properties seen :0
[2024-06-01 05:54:29] [INFO ] Invariant cache hit.
[2024-06-01 05:54:29] [INFO ] State equation strengthened by 1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 30 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 31 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 89ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 05:54:30] [INFO ] Invariant cache hit.
[2024-06-01 05:54:30] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-01 05:54:30] [INFO ] Invariant cache hit.
[2024-06-01 05:54:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 05:54:30] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2024-06-01 05:54:30] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 05:54:30] [INFO ] Invariant cache hit.
[2024-06-01 05:54:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 42 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 126ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 127ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 5/5 places, 8/8 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1000] Max Struct:[1003]
Ending property specific reduction for JoinFreeModules-PT-1000-UpperBounds-15 in 7668 ms.
[2024-06-01 05:54:30] [INFO ] Flatten gal took : 21 ms
[2024-06-01 05:54:30] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-06-01 05:54:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 30 places, 48 transitions and 126 arcs took 3 ms.
Total runtime 511147 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : JoinFreeModules-PT-1000-UpperBounds-04
Could not compute solution for formula : JoinFreeModules-PT-1000-UpperBounds-06
Could not compute solution for formula : JoinFreeModules-PT-1000-UpperBounds-08
Could not compute solution for formula : JoinFreeModules-PT-1000-UpperBounds-10
Could not compute solution for formula : JoinFreeModules-PT-1000-UpperBounds-11
Could not compute solution for formula : JoinFreeModules-PT-1000-UpperBounds-15

BK_STOP 1717221270776

--------------------
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:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2024
ub formula name JoinFreeModules-PT-1000-UpperBounds-04
ub formula formula --maxsum=/tmp/1957/ub_0_
ub formula name JoinFreeModules-PT-1000-UpperBounds-06
ub formula formula --maxsum=/tmp/1957/ub_1_
ub formula name JoinFreeModules-PT-1000-UpperBounds-08
ub formula formula --maxsum=/tmp/1957/ub_2_
ub formula name JoinFreeModules-PT-1000-UpperBounds-10
ub formula formula --maxsum=/tmp/1957/ub_3_
ub formula name JoinFreeModules-PT-1000-UpperBounds-11
ub formula formula --maxsum=/tmp/1957/ub_4_
ub formula name JoinFreeModules-PT-1000-UpperBounds-15
ub formula formula --maxsum=/tmp/1957/ub_5_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="JoinFreeModules-PT-1000"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is JoinFreeModules-PT-1000, 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 r504-tall-171649612000077"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;