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.r223-tall-171649610600061.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is JoinFreeModules-PT-0200, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-tall-171649610600061
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K 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.6K Apr 22 14:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 14:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Apr 11 14:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 14:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 11 14:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:50 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 613K 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-0200-UpperBounds-00
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-01
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-02
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-03
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-04
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-05
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-06
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-07
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-08
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-09
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-10
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-11
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-12
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-13
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-14
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716500335021

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-0200
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 21:38:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-23 21:38:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 21:38:56] [INFO ] Load time of PNML (sax parser for PT used): 146 ms
[2024-05-23 21:38:56] [INFO ] Transformed 1001 places.
[2024-05-23 21:38:56] [INFO ] Transformed 1601 transitions.
[2024-05-23 21:38:56] [INFO ] Parsed PT model containing 1001 places and 1601 transitions and 4602 arcs in 270 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Reduce places removed 1 places and 0 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[1, 200, 0, 200, 2, 200, 1, 2, 2, 0, 0, 0, 0, 0, 0, 2] 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:[1, 200, 0, 200, 2, 200, 1, 2, 2, 0, 0, 0, 0, 0, 0, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 1601 rows 1000 cols
[2024-05-23 21:38:56] [INFO ] Computed 200 invariants in 38 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 200, 0, 200, 2, 200, 1, 2, 2, 0, 0, 0, 0, 0, 0, 2] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
RANDOM walk for 10198 steps (2 resets) in 135 ms. (74 steps per ms)
BEST_FIRST walk for 160016 steps (32 resets) in 1667 ms. (95 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 200, 12, 200, 2, 200, 10, 2, 2, 100, 9, 12, 100, 9, 12, 2] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
[2024-05-23 21:38:58] [INFO ] Invariant cache hit.
[2024-05-23 21:38:58] [INFO ] [Real]Absence check using 200 positive place invariants in 44 ms returned sat
[2024-05-23 21:38:59] [INFO ] [Real]Absence check using state equation in 427 ms returned sat
[2024-05-23 21:38:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:38:59] [INFO ] [Nat]Absence check using 200 positive place invariants in 42 ms returned sat
[2024-05-23 21:39:00] [INFO ] [Nat]Absence check using state equation in 415 ms returned sat
[2024-05-23 21:39:00] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-23 21:39:00] [INFO ] [Nat]Added 200 Read/Feed constraints in 501 ms returned sat
[2024-05-23 21:39:00] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 88 ms.
[2024-05-23 21:39:04] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-23 21:39:04] [INFO ] [Real]Absence check using 200 positive place invariants in 34 ms returned sat
[2024-05-23 21:39:04] [INFO ] [Real]Absence check using state equation in 366 ms returned sat
[2024-05-23 21:39:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:39:05] [INFO ] [Nat]Absence check using 200 positive place invariants in 37 ms returned sat
[2024-05-23 21:39:06] [INFO ] [Nat]Absence check using state equation in 1013 ms returned sat
[2024-05-23 21:39:06] [INFO ] [Nat]Added 200 Read/Feed constraints in 114 ms returned sat
[2024-05-23 21:39:06] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 87 ms.
[2024-05-23 21:39:10] [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 1
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.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-23 21:39:10] [INFO ] [Real]Absence check using 200 positive place invariants in 32 ms returned sat
[2024-05-23 21:39:10] [INFO ] [Real]Absence check using state equation in 347 ms returned sat
[2024-05-23 21:39:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:39:10] [INFO ] [Nat]Absence check using 200 positive place invariants in 35 ms returned sat
[2024-05-23 21:39:11] [INFO ] [Nat]Absence check using state equation in 386 ms returned sat
[2024-05-23 21:39:11] [INFO ] [Nat]Added 200 Read/Feed constraints in 246 ms returned sat
[2024-05-23 21:39:11] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 85 ms.
[2024-05-23 21:39:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-23 21:39:15] [INFO ] [Real]Absence check using 200 positive place invariants in 34 ms returned sat
[2024-05-23 21:39:16] [INFO ] [Real]Absence check using state equation in 352 ms returned sat
[2024-05-23 21:39:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:39:16] [INFO ] [Nat]Absence check using 200 positive place invariants in 39 ms returned sat
[2024-05-23 21:39:17] [INFO ] [Nat]Absence check using state equation in 776 ms returned sat
[2024-05-23 21:39:17] [INFO ] [Nat]Added 200 Read/Feed constraints in 163 ms returned sat
[2024-05-23 21:39:17] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 68 ms.
[2024-05-23 21:39:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-23 21:39:21] [INFO ] [Real]Absence check using 200 positive place invariants in 37 ms returned sat
[2024-05-23 21:39:21] [INFO ] [Real]Absence check using state equation in 383 ms returned sat
[2024-05-23 21:39:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:39:21] [INFO ] [Nat]Absence check using 200 positive place invariants in 37 ms returned sat
[2024-05-23 21:39:22] [INFO ] [Nat]Absence check using state equation in 391 ms returned sat
[2024-05-23 21:39:22] [INFO ] [Nat]Added 200 Read/Feed constraints in 257 ms returned sat
[2024-05-23 21:39:22] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 82 ms.
[2024-05-23 21:39:26] [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: Broken pipe ... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-23 21:39:26] [INFO ] [Real]Absence check using 200 positive place invariants in 34 ms returned sat
[2024-05-23 21:39:27] [INFO ] [Real]Absence check using state equation in 375 ms returned sat
[2024-05-23 21:39:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:39:27] [INFO ] [Nat]Absence check using 200 positive place invariants in 34 ms returned sat
[2024-05-23 21:39:27] [INFO ] [Nat]Absence check using state equation in 390 ms returned sat
[2024-05-23 21:39:28] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-23 21:39:28] [INFO ] [Nat]Added 200 Read/Feed constraints in 521 ms returned sat
[2024-05-23 21:39:28] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 79 ms.
[2024-05-23 21:39:32] [INFO ] Added : 250 causal constraints over 50 iterations in 3890 ms. Result :unknown
[2024-05-23 21:39:32] [INFO ] [Real]Absence check using 200 positive place invariants in 34 ms returned sat
[2024-05-23 21:39:32] [INFO ] [Real]Absence check using state equation in 375 ms returned sat
[2024-05-23 21:39:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:39:33] [INFO ] [Nat]Absence check using 200 positive place invariants in 35 ms returned sat
[2024-05-23 21:39:33] [INFO ] [Nat]Absence check using state equation in 400 ms returned sat
[2024-05-23 21:39:33] [INFO ] [Nat]Added 200 Read/Feed constraints in 446 ms returned sat
[2024-05-23 21:39:34] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 84 ms.
[2024-05-23 21:39: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 6
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.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-23 21:39:38] [INFO ] [Real]Absence check using 200 positive place invariants in 36 ms returned sat
[2024-05-23 21:39:38] [INFO ] [Real]Absence check using state equation in 375 ms returned sat
[2024-05-23 21:39:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:39:38] [INFO ] [Nat]Absence check using 200 positive place invariants in 34 ms returned sat
[2024-05-23 21:39:39] [INFO ] [Nat]Absence check using state equation in 401 ms returned sat
[2024-05-23 21:39:39] [INFO ] [Nat]Added 200 Read/Feed constraints in 456 ms returned sat
[2024-05-23 21:39:39] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 83 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2024-05-23 21:39:43] [INFO ] [Real]Absence check using 200 positive place invariants in 35 ms returned sat
[2024-05-23 21:39:44] [INFO ] [Real]Absence check using state equation in 385 ms returned sat
[2024-05-23 21:39:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:39:44] [INFO ] [Nat]Absence check using 200 positive place invariants in 36 ms returned sat
[2024-05-23 21:39:44] [INFO ] [Nat]Absence check using state equation in 404 ms returned sat
[2024-05-23 21:39:44] [INFO ] [Nat]Added 200 Read/Feed constraints in 251 ms returned sat
[2024-05-23 21:39:45] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 78 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2024-05-23 21:39:49] [INFO ] [Real]Absence check using 200 positive place invariants in 36 ms returned sat
[2024-05-23 21:39:49] [INFO ] [Real]Absence check using state equation in 375 ms returned sat
[2024-05-23 21:39:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:39:49] [INFO ] [Nat]Absence check using 200 positive place invariants in 34 ms returned sat
[2024-05-23 21:39:50] [INFO ] [Nat]Absence check using state equation in 357 ms returned sat
[2024-05-23 21:39:50] [INFO ] [Nat]Added 200 Read/Feed constraints in 241 ms returned sat
[2024-05-23 21:39:50] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 89 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2024-05-23 21:39:54] [INFO ] [Real]Absence check using 200 positive place invariants in 38 ms returned sat
[2024-05-23 21:39:55] [INFO ] [Real]Absence check using state equation in 342 ms returned sat
[2024-05-23 21:39:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:39:55] [INFO ] [Nat]Absence check using 200 positive place invariants in 35 ms returned sat
[2024-05-23 21:39:56] [INFO ] [Nat]Absence check using state equation in 1039 ms returned sat
[2024-05-23 21:39:56] [INFO ] [Nat]Added 200 Read/Feed constraints in 204 ms returned sat
[2024-05-23 21:39:56] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 80 ms.
[2024-05-23 21:40:00] [INFO ] Added : 217 causal constraints over 45 iterations in 3504 ms. Result :sat
Minimization took 53 ms.
[2024-05-23 21:40:00] [INFO ] [Real]Absence check using 200 positive place invariants in 35 ms returned sat
[2024-05-23 21:40:00] [INFO ] [Real]Absence check using state equation in 376 ms returned sat
[2024-05-23 21:40:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:40:01] [INFO ] [Nat]Absence check using 200 positive place invariants in 36 ms returned sat
[2024-05-23 21:40:01] [INFO ] [Nat]Absence check using state equation in 402 ms returned sat
[2024-05-23 21:40:01] [INFO ] [Nat]Added 200 Read/Feed constraints in 252 ms returned sat
[2024-05-23 21:40:01] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 73 ms.
[2024-05-23 21:40:05] [INFO ] Added : 255 causal constraints over 51 iterations in 4140 ms. Result :unknown
[2024-05-23 21:40:06] [INFO ] [Real]Absence check using 200 positive place invariants in 36 ms returned sat
[2024-05-23 21:40:06] [INFO ] [Real]Absence check using state equation in 378 ms returned sat
[2024-05-23 21:40:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:40:06] [INFO ] [Nat]Absence check using 200 positive place invariants in 36 ms returned sat
[2024-05-23 21:40:07] [INFO ] [Nat]Absence check using state equation in 367 ms returned sat
[2024-05-23 21:40:07] [INFO ] [Nat]Added 200 Read/Feed constraints in 491 ms returned sat
[2024-05-23 21:40:07] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 68 ms.
[2024-05-23 21:40:11] [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 12
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.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-23 21:40:11] [INFO ] [Real]Absence check using 200 positive place invariants in 33 ms returned sat
[2024-05-23 21:40:12] [INFO ] [Real]Absence check using state equation in 349 ms returned sat
[2024-05-23 21:40:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:40:12] [INFO ] [Nat]Absence check using 200 positive place invariants in 35 ms returned sat
[2024-05-23 21:40:12] [INFO ] [Nat]Absence check using state equation in 396 ms returned sat
[2024-05-23 21:40:13] [INFO ] [Nat]Added 200 Read/Feed constraints in 381 ms returned sat
[2024-05-23 21:40:13] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 82 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2024-05-23 21:40:17] [INFO ] [Real]Absence check using 200 positive place invariants in 34 ms returned sat
[2024-05-23 21:40:17] [INFO ] [Real]Absence check using state equation in 376 ms returned sat
[2024-05-23 21:40:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:40:17] [INFO ] [Nat]Absence check using 200 positive place invariants in 35 ms returned sat
[2024-05-23 21:40:18] [INFO ] [Nat]Absence check using state equation in 386 ms returned sat
[2024-05-23 21:40:18] [INFO ] [Nat]Added 200 Read/Feed constraints in 249 ms returned sat
[2024-05-23 21:40:18] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 71 ms.
[2024-05-23 21:40:22] [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 14
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.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-23 21:40:22] [INFO ] [Real]Absence check using 200 positive place invariants in 37 ms returned sat
[2024-05-23 21:40:23] [INFO ] [Real]Absence check using state equation in 374 ms returned sat
[2024-05-23 21:40:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:40:23] [INFO ] [Nat]Absence check using 200 positive place invariants in 37 ms returned sat
[2024-05-23 21:40:23] [INFO ] [Nat]Absence check using state equation in 415 ms returned sat
[2024-05-23 21:40:24] [INFO ] [Nat]Added 200 Read/Feed constraints in 357 ms returned sat
[2024-05-23 21:40:24] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 70 ms.
[2024-05-23 21:40:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 15
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.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[10, 200, 12, 200, 2, 200, 10, 2, 2, 100, 9, 12, 100, 9, 12, 2] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[14, 200, 108, 200, 28, 200, 10, 33, 28, 104, 100, 108, 104, 101, 104, 26] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
Support contains 16 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Graph (complete) has 2400 edges and 1000 vertex of which 80 are kept as prefixes of interest. Removing 920 places using SCC suffix rule.3 ms
Discarding 920 places :
Also discarding 1472 output transitions
Drop transitions (Output transitions of discarded places.) removed 1472 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 47 ms. Remains 80 /1000 variables (removed 920) and now considering 128/1601 (removed 1473) transitions.
Running 96 sub problems to find dead transitions.
// Phase 1: matrix 128 rows 80 cols
[2024-05-23 21:41:28] [INFO ] Computed 16 invariants in 1 ms
[2024-05-23 21:41:28] [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 2508 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-05-23 21:41:31] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 20 ms to minimize.
[2024-05-23 21:41:32] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-23 21:41:32] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 3/211 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-23 21:41:35] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-23 21:41:35] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/208 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 0/208 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 213 constraints, problems are : Problem set: 0 solved, 96 unsolved in 8204 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: 5/5 constraints]
After SMT, in 10803ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 10818ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10888 ms. Remains : 80/1000 places, 128/1601 transitions.
[2024-05-23 21:41:39] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[14, 200, 108, 200, 28, 200, 10, 33, 28, 104, 100, 108, 104, 101, 104, 26] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
RANDOM walk for 1000009 steps (2 resets) in 1196 ms. (835 steps per ms)
FORMULA JoinFreeModules-PT-0200-UpperBounds-14 203 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA JoinFreeModules-PT-0200-UpperBounds-09 203 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA JoinFreeModules-PT-0200-UpperBounds-02 203 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 13000013 steps (26 resets) in 15944 ms. (815 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[201, 200, 200, 200, 200, 201, 195, 196, 200, 202, 202, 200, 198] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
[2024-05-23 21:41:56] [INFO ] Invariant cache hit.
[2024-05-23 21:41:56] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 21:41:56] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2024-05-23 21:41:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:41:56] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 21:41:56] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-05-23 21:41:56] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-23 21:41:56] [INFO ] [Nat]Added 16 Read/Feed constraints in 14 ms returned sat
[2024-05-23 21:41:56] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-23 21:41:56] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-23 21:41:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2024-05-23 21:41:56] [INFO ] Added : 52 causal constraints over 11 iterations in 198 ms. Result :sat
Minimization took 58 ms.
[2024-05-23 21:41:56] [INFO ] [Real]Absence check using 16 positive place invariants in 23 ms returned sat
[2024-05-23 21:41:56] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-05-23 21:41:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:41:57] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2024-05-23 21:41:57] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-05-23 21:41:57] [INFO ] [Nat]Added 16 Read/Feed constraints in 98 ms returned sat
[2024-05-23 21:41:57] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-23 21:41:57] [INFO ] Added : 70 causal constraints over 15 iterations in 158 ms. Result :sat
Minimization took 59 ms.
[2024-05-23 21:41:57] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2024-05-23 21:41:57] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-05-23 21:41:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:41:57] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-23 21:41:57] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-05-23 21:41:57] [INFO ] [Nat]Added 16 Read/Feed constraints in 58 ms returned sat
[2024-05-23 21:41:57] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-23 21:41:57] [INFO ] Added : 48 causal constraints over 12 iterations in 91 ms. Result :sat
Minimization took 31 ms.
[2024-05-23 21:41:57] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-23 21:41:57] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-23 21:41:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:41:57] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-23 21:41:57] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-23 21:41:57] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2024-05-23 21:41:57] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-23 21:41:58] [INFO ] Added : 60 causal constraints over 13 iterations in 124 ms. Result :sat
Minimization took 33 ms.
[2024-05-23 21:41:58] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 21:41:58] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2024-05-23 21:41:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:41:58] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 21:41:58] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-23 21:41:58] [INFO ] [Nat]Added 16 Read/Feed constraints in 40 ms returned sat
[2024-05-23 21:41:58] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-23 21:41:58] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-23 21:41:58] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-23 21:41:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 72 ms
[2024-05-23 21:41:58] [INFO ] Added : 74 causal constraints over 15 iterations in 247 ms. Result :sat
Minimization took 34 ms.
[2024-05-23 21:41:58] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 21:41:58] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-23 21:41:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:41:58] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-23 21:41:58] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-23 21:41:58] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2024-05-23 21:41:58] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-23 21:41:58] [INFO ] Added : 54 causal constraints over 11 iterations in 115 ms. Result :sat
Minimization took 32 ms.
[2024-05-23 21:41:59] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 21:41:59] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-23 21:41:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:41:59] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 21:41:59] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-23 21:41:59] [INFO ] [Nat]Added 16 Read/Feed constraints in 39 ms returned sat
[2024-05-23 21:41:59] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-23 21:41:59] [INFO ] Added : 62 causal constraints over 13 iterations in 135 ms. Result :sat
Minimization took 47 ms.
[2024-05-23 21:41:59] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 21:41:59] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-23 21:41:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:41:59] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 21:41:59] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2024-05-23 21:41:59] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2024-05-23 21:41:59] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-23 21:41:59] [INFO ] Added : 54 causal constraints over 11 iterations in 92 ms. Result :sat
Minimization took 40 ms.
[2024-05-23 21:41:59] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-23 21:41:59] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-05-23 21:41:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:41:59] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-23 21:41:59] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-23 21:41:59] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2024-05-23 21:41:59] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-23 21:42:00] [INFO ] Added : 61 causal constraints over 13 iterations in 149 ms. Result :sat
Minimization took 42 ms.
[2024-05-23 21:42:00] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2024-05-23 21:42:00] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-23 21:42:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:42:00] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 21:42:00] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-23 21:42:00] [INFO ] [Nat]Added 16 Read/Feed constraints in 59 ms returned sat
[2024-05-23 21:42:00] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-23 21:42:00] [INFO ] Added : 51 causal constraints over 11 iterations in 93 ms. Result :sat
Minimization took 22 ms.
[2024-05-23 21:42:00] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 21:42:00] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-23 21:42:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:42:00] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-23 21:42:00] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-23 21:42:00] [INFO ] [Nat]Added 16 Read/Feed constraints in 63 ms returned sat
[2024-05-23 21:42:00] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-23 21:42:00] [INFO ] Added : 63 causal constraints over 13 iterations in 106 ms. Result :sat
Minimization took 24 ms.
[2024-05-23 21:42:00] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-23 21:42:00] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-05-23 21:42:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:42:00] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 21:42:00] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2024-05-23 21:42:00] [INFO ] [Nat]Added 16 Read/Feed constraints in 29 ms returned sat
[2024-05-23 21:42:00] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-23 21:42:01] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-23 21:42:01] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-23 21:42:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 65 ms
[2024-05-23 21:42:01] [INFO ] Added : 35 causal constraints over 8 iterations in 145 ms. Result :sat
Minimization took 29 ms.
[2024-05-23 21:42:01] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 21:42:01] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-23 21:42:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:42:01] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 21:42:01] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2024-05-23 21:42:01] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2024-05-23 21:42:01] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-23 21:42:01] [INFO ] Added : 57 causal constraints over 12 iterations in 147 ms. Result :sat
Minimization took 42 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[201, 200, 200, 200, 200, 201, 195, 196, 200, 202, 202, 200, 198] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[201, 200, 200, 202, 200, 201, 202, 202, 201, 202, 202, 201, 202] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
Support contains 13 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 65 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 24 output transitions
Drop transitions (Output transitions of discarded places.) removed 24 transitions
Applied a total of 1 rules in 4 ms. Remains 65 /80 variables (removed 15) and now considering 104/128 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 65/80 places, 104/128 transitions.
// Phase 1: matrix 104 rows 65 cols
[2024-05-23 21:42:09] [INFO ] Computed 13 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[201, 200, 200, 202, 200, 201, 202, 202, 201, 202, 202, 201, 202] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
RANDOM walk for 1000040 steps (2 resets) in 939 ms. (1063 steps per ms)
BEST_FIRST walk for 13000013 steps (26 resets) in 13332 ms. (975 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[201, 200, 200, 202, 200, 201, 202, 202, 201, 202, 202, 201, 202] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
[2024-05-23 21:42:24] [INFO ] Invariant cache hit.
[2024-05-23 21:42:24] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-23 21:42:24] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-23 21:42:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:42:24] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-23 21:42:24] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-23 21:42:24] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-23 21:42:24] [INFO ] [Nat]Added 13 Read/Feed constraints in 25 ms returned sat
[2024-05-23 21:42:24] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-23 21:42:24] [INFO ] Added : 63 causal constraints over 13 iterations in 91 ms. Result :sat
Minimization took 31 ms.
[2024-05-23 21:42:24] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-23 21:42:24] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-23 21:42:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:42:24] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-23 21:42:24] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-23 21:42:24] [INFO ] [Nat]Added 13 Read/Feed constraints in 66 ms returned sat
[2024-05-23 21:42:24] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-23 21:42:24] [INFO ] Added : 61 causal constraints over 15 iterations in 135 ms. Result :sat
Minimization took 30 ms.
[2024-05-23 21:42:24] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-23 21:42:24] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-23 21:42:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:42:24] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-23 21:42:24] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-05-23 21:42:25] [INFO ] [Nat]Added 13 Read/Feed constraints in 70 ms returned sat
[2024-05-23 21:42:25] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-23 21:42:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2024-05-23 21:42:25] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-23 21:42:25] [INFO ] Added : 37 causal constraints over 8 iterations in 58 ms. Result :sat
Minimization took 26 ms.
[2024-05-23 21:42:25] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-23 21:42:25] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-23 21:42:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:42:25] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-23 21:42:25] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-23 21:42:25] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2024-05-23 21:42:25] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-23 21:42:25] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-23 21:42:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
Minimization took 24 ms.
[2024-05-23 21:42:25] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-23 21:42:25] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-23 21:42:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:42:25] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-23 21:42:25] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-23 21:42:25] [INFO ] [Nat]Added 13 Read/Feed constraints in 69 ms returned sat
[2024-05-23 21:42:25] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-23 21:42:25] [INFO ] Added : 62 causal constraints over 15 iterations in 130 ms. Result :sat
Minimization took 30 ms.
[2024-05-23 21:42:25] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-23 21:42:25] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-23 21:42:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:42:25] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-23 21:42:25] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-05-23 21:42:25] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2024-05-23 21:42:25] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-23 21:42:26] [INFO ] Added : 36 causal constraints over 8 iterations in 93 ms. Result :sat
Minimization took 42 ms.
[2024-05-23 21:42:26] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-23 21:42:26] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-23 21:42:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:42:26] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-23 21:42:26] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-23 21:42:26] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2024-05-23 21:42:26] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-23 21:42:26] [INFO ] Added : 74 causal constraints over 16 iterations in 107 ms. Result :sat
Minimization took 24 ms.
[2024-05-23 21:42:26] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-23 21:42:26] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-23 21:42:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:42:26] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-23 21:42:26] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2024-05-23 21:42:26] [INFO ] [Nat]Added 13 Read/Feed constraints in 24 ms returned sat
[2024-05-23 21:42:26] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-23 21:42:26] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-23 21:42:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
Minimization took 11 ms.
[2024-05-23 21:42:26] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-23 21:42:26] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 21:42:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:42:26] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-23 21:42:26] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-23 21:42:26] [INFO ] [Nat]Added 13 Read/Feed constraints in 24 ms returned sat
[2024-05-23 21:42:26] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-23 21:42:26] [INFO ] Added : 71 causal constraints over 16 iterations in 130 ms. Result :sat
Minimization took 40 ms.
[2024-05-23 21:42:27] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-23 21:42:27] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-23 21:42:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:42:27] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-23 21:42:27] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2024-05-23 21:42:27] [INFO ] [Nat]Added 13 Read/Feed constraints in 24 ms returned sat
[2024-05-23 21:42:27] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-23 21:42:27] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 14 ms to minimize.
[2024-05-23 21:42:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2024-05-23 21:42:27] [INFO ] Added : 36 causal constraints over 8 iterations in 114 ms. Result :sat
Minimization took 19 ms.
[2024-05-23 21:42:27] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-23 21:42:27] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-23 21:42:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:42:27] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-23 21:42:27] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-23 21:42:27] [INFO ] [Nat]Added 13 Read/Feed constraints in 67 ms returned sat
[2024-05-23 21:42:27] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-23 21:42:27] [INFO ] Added : 67 causal constraints over 14 iterations in 100 ms. Result :sat
Minimization took 22 ms.
[2024-05-23 21:42:27] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-23 21:42:27] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-23 21:42:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:42:27] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-23 21:42:27] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2024-05-23 21:42:27] [INFO ] [Nat]Added 13 Read/Feed constraints in 7 ms returned sat
[2024-05-23 21:42:27] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-23 21:42:27] [INFO ] Added : 53 causal constraints over 12 iterations in 84 ms. Result :sat
Minimization took 31 ms.
[2024-05-23 21:42:28] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-23 21:42:28] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-23 21:42:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:42:28] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-23 21:42:28] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-23 21:42:28] [INFO ] [Nat]Added 13 Read/Feed constraints in 44 ms returned sat
[2024-05-23 21:42:28] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-23 21:42:28] [INFO ] Added : 58 causal constraints over 12 iterations in 89 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[201, 200, 200, 202, 200, 201, 202, 202, 201, 202, 202, 201, 202] Max Struct:[203, 203, 203, 202, 203, 203, 203, 202, 203, 203, 203, 203, 203]
FORMULA JoinFreeModules-PT-0200-UpperBounds-08 202 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0200-UpperBounds-04 202 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[201, 200, 200, 200, 201, 202, 201, 202, 202, 201, 202] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
Support contains 11 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 104/104 transitions.
Graph (complete) has 156 edges and 65 vertex of which 55 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Applied a total of 1 rules in 2 ms. Remains 55 /65 variables (removed 10) and now considering 88/104 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 55/65 places, 88/104 transitions.
// Phase 1: matrix 88 rows 55 cols
[2024-05-23 21:42:33] [INFO ] Computed 11 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[201, 200, 200, 200, 201, 202, 201, 202, 202, 201, 202] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
RANDOM walk for 1000041 steps (2 resets) in 747 ms. (1336 steps per ms)
FORMULA JoinFreeModules-PT-0200-UpperBounds-12 203 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA JoinFreeModules-PT-0200-UpperBounds-11 203 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 9000009 steps (18 resets) in 8169 ms. (1101 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[201, 200, 200, 200, 201, 202, 201, 201, 202] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203]
[2024-05-23 21:42:42] [INFO ] Invariant cache hit.
[2024-05-23 21:42:42] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-23 21:42:42] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-23 21:42:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:42:42] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-23 21:42:42] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-23 21:42:42] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-23 21:42:42] [INFO ] [Nat]Added 11 Read/Feed constraints in 49 ms returned sat
[2024-05-23 21:42:42] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-23 21:42:42] [INFO ] Added : 25 causal constraints over 5 iterations in 33 ms. Result :sat
Minimization took 20 ms.
[2024-05-23 21:42:42] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-23 21:42:42] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-23 21:42:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:42:42] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-23 21:42:42] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-23 21:42:42] [INFO ] [Nat]Added 11 Read/Feed constraints in 151 ms returned sat
[2024-05-23 21:42:42] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-23 21:42:42] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-23 21:42:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2024-05-23 21:42:42] [INFO ] Added : 33 causal constraints over 8 iterations in 87 ms. Result :sat
Minimization took 26 ms.
[2024-05-23 21:42:42] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-23 21:42:42] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-23 21:42:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:42:42] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-23 21:42:42] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-23 21:42:42] [INFO ] [Nat]Added 11 Read/Feed constraints in 143 ms returned sat
[2024-05-23 21:42:42] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-23 21:42:42] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-23 21:42:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2024-05-23 21:42:43] [INFO ] Added : 40 causal constraints over 10 iterations in 102 ms. Result :sat
Minimization took 25 ms.
[2024-05-23 21:42:43] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-23 21:42:43] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-23 21:42:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:42:43] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-23 21:42:43] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-23 21:42:43] [INFO ] [Nat]Added 11 Read/Feed constraints in 126 ms returned sat
[2024-05-23 21:42:43] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-23 21:42:43] [INFO ] Added : 39 causal constraints over 8 iterations in 61 ms. Result :sat
Minimization took 28 ms.
[2024-05-23 21:42:43] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-23 21:42:43] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-23 21:42:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:42:43] [INFO ] [Nat]Absence check using 11 positive place invariants in 1 ms returned sat
[2024-05-23 21:42:43] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-05-23 21:42:43] [INFO ] [Nat]Added 11 Read/Feed constraints in 2 ms returned sat
[2024-05-23 21:42:43] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-23 21:42:43] [INFO ] Added : 35 causal constraints over 8 iterations in 49 ms. Result :sat
Minimization took 17 ms.
[2024-05-23 21:42:43] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-23 21:42:43] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-23 21:42:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:42:43] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-23 21:42:43] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-23 21:42:43] [INFO ] [Nat]Added 11 Read/Feed constraints in 49 ms returned sat
[2024-05-23 21:42:43] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-23 21:42:43] [INFO ] Added : 36 causal constraints over 9 iterations in 56 ms. Result :sat
Minimization took 16 ms.
[2024-05-23 21:42:43] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-23 21:42:43] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-23 21:42:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:42:43] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-23 21:42:43] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-23 21:42:43] [INFO ] [Nat]Added 11 Read/Feed constraints in 1 ms returned sat
[2024-05-23 21:42:43] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-23 21:42:44] [INFO ] Added : 46 causal constraints over 10 iterations in 121 ms. Result :sat
Minimization took 25 ms.
[2024-05-23 21:42:44] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-23 21:42:44] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-23 21:42:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:42:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-23 21:42:44] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2024-05-23 21:42:44] [INFO ] [Nat]Added 11 Read/Feed constraints in 31 ms returned sat
[2024-05-23 21:42:44] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-23 21:42:44] [INFO ] Added : 36 causal constraints over 8 iterations in 50 ms. Result :sat
Minimization took 22 ms.
[2024-05-23 21:42:44] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-23 21:42:44] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-23 21:42:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:42:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-23 21:42:44] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-23 21:42:44] [INFO ] [Nat]Added 11 Read/Feed constraints in 1 ms returned sat
[2024-05-23 21:42:44] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-23 21:42:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
Current structural bounds on expressions (after SMT) : Max Seen:[201, 200, 200, 200, 201, 202, 201, 201, 202] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 202]
FORMULA JoinFreeModules-PT-0200-UpperBounds-15 202 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[201, 200, 200, 200, 201, 202, 201, 201] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203]
Support contains 8 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 88/88 transitions.
Graph (complete) has 132 edges and 55 vertex of which 40 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 24 output transitions
Drop transitions (Output transitions of discarded places.) removed 24 transitions
Applied a total of 1 rules in 2 ms. Remains 40 /55 variables (removed 15) and now considering 64/88 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 40/55 places, 64/88 transitions.
// Phase 1: matrix 64 rows 40 cols
[2024-05-23 21:42:46] [INFO ] Computed 8 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[201, 200, 200, 200, 201, 202, 201, 201] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203]
RANDOM walk for 1000002 steps (2 resets) in 565 ms. (1766 steps per ms)
BEST_FIRST walk for 8000008 steps (16 resets) in 4992 ms. (1602 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[201, 200, 200, 200, 201, 202, 201, 201] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203]
[2024-05-23 21:42:52] [INFO ] Invariant cache hit.
[2024-05-23 21:42:52] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-23 21:42:52] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-23 21:42:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:42:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-23 21:42:52] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-23 21:42:52] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 21:42:52] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 21:42:52] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-23 21:42:52] [INFO ] Added : 36 causal constraints over 9 iterations in 138 ms. Result :sat
Minimization took 19 ms.
[2024-05-23 21:42:52] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-23 21:42:52] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-23 21:42:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:42:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-23 21:42:52] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-23 21:42:52] [INFO ] [Nat]Added 8 Read/Feed constraints in 20 ms returned sat
[2024-05-23 21:42:52] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-23 21:42:52] [INFO ] Added : 46 causal constraints over 13 iterations in 65 ms. Result :sat
Minimization took 32 ms.
[2024-05-23 21:42:52] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-23 21:42:52] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-23 21:42:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:42:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-23 21:42:52] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-23 21:42:52] [INFO ] [Nat]Added 8 Read/Feed constraints in 19 ms returned sat
[2024-05-23 21:42:52] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-23 21:42:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2024-05-23 21:42:52] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-23 21:42:53] [INFO ] Added : 38 causal constraints over 11 iterations in 53 ms. Result :sat
Minimization took 19 ms.
[2024-05-23 21:42:53] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-23 21:42:53] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-23 21:42:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:42:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-23 21:42:53] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-23 21:42:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 22 ms returned sat
[2024-05-23 21:42:53] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-23 21:42:53] [INFO ] Added : 41 causal constraints over 9 iterations in 44 ms. Result :sat
Minimization took 20 ms.
[2024-05-23 21:42:53] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-23 21:42:53] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-23 21:42:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:42:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-23 21:42:53] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-23 21:42:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 21:42:53] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-23 21:42:53] [INFO ] Added : 37 causal constraints over 9 iterations in 77 ms. Result :sat
Minimization took 19 ms.
[2024-05-23 21:42:53] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-23 21:42:53] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-23 21:42:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:42:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-23 21:42:53] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-23 21:42:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 10 ms returned sat
[2024-05-23 21:42:53] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2024-05-23 21:42:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 17 ms
[2024-05-23 21:42:53] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-23 21:42:53] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-23 21:42:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:42:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-23 21:42:53] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-23 21:42:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 21:42:53] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-23 21:42:53] [INFO ] Added : 42 causal constraints over 12 iterations in 51 ms. Result :sat
Minimization took 21 ms.
[2024-05-23 21:42:53] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-23 21:42:53] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-23 21:42:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:42:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-23 21:42:53] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-23 21:42:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 21:42:53] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-23 21:42:53] [INFO ] Added : 34 causal constraints over 10 iterations in 137 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[201, 200, 200, 200, 201, 202, 201, 201] Max Struct:[203, 203, 203, 203, 203, 202, 203, 203]
FORMULA JoinFreeModules-PT-0200-UpperBounds-07 202 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[201, 200, 200, 200, 201, 201, 201] Max Struct:[203, 203, 203, 203, 203, 203, 203]
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 2 ms. Remains : 35/40 places, 56/64 transitions.
// Phase 1: matrix 56 rows 35 cols
[2024-05-23 21:42:55] [INFO ] Computed 7 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[201, 200, 200, 200, 201, 201, 201] Max Struct:[203, 203, 203, 203, 203, 203, 203]
RANDOM walk for 1000024 steps (2 resets) in 507 ms. (1968 steps per ms)
BEST_FIRST walk for 7000007 steps (14 resets) in 3947 ms. (1773 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[201, 200, 200, 200, 201, 201, 201] Max Struct:[203, 203, 203, 203, 203, 203, 203]
[2024-05-23 21:42:59] [INFO ] Invariant cache hit.
[2024-05-23 21:42:59] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 21:42:59] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-23 21:42:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:42:59] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 21:42:59] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-23 21:42:59] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 21:42:59] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2024-05-23 21:42:59] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-23 21:42:59] [INFO ] Added : 26 causal constraints over 7 iterations in 63 ms. Result :sat
Minimization took 16 ms.
[2024-05-23 21:42:59] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 21:42:59] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-23 21:42:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:42:59] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 21:42:59] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-23 21:43:00] [INFO ] [Nat]Added 7 Read/Feed constraints in 24 ms returned sat
[2024-05-23 21:43:00] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-23 21:43:00] [INFO ] Added : 17 causal constraints over 6 iterations in 55 ms. Result :sat
Minimization took 19 ms.
[2024-05-23 21:43:00] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 21:43:00] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-23 21:43:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:43:00] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 21:43:00] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-23 21:43:00] [INFO ] [Nat]Added 7 Read/Feed constraints in 8 ms returned sat
[2024-05-23 21:43:00] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-23 21:43:00] [INFO ] Added : 14 causal constraints over 6 iterations in 25 ms. Result :sat
Minimization took 14 ms.
[2024-05-23 21:43:00] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 21:43:00] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-23 21:43:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:43:00] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 21:43:00] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-23 21:43:00] [INFO ] [Nat]Added 7 Read/Feed constraints in 15 ms returned sat
[2024-05-23 21:43:00] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-23 21:43:00] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-23 21:43:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2024-05-23 21:43:00] [INFO ] Added : 29 causal constraints over 7 iterations in 70 ms. Result :sat
Minimization took 26 ms.
[2024-05-23 21:43:00] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 21:43:00] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-23 21:43:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:43:00] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 21:43:00] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-23 21:43:00] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2024-05-23 21:43:00] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-23 21:43:00] [INFO ] Added : 26 causal constraints over 6 iterations in 43 ms. Result :sat
Minimization took 16 ms.
[2024-05-23 21:43:00] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 21:43:00] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-23 21:43:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:43:00] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 21:43:00] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-23 21:43:00] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2024-05-23 21:43:00] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-23 21:43:00] [INFO ] Added : 26 causal constraints over 7 iterations in 29 ms. Result :sat
Minimization took 18 ms.
[2024-05-23 21:43:00] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 21:43:00] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-23 21:43:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:43:00] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 21:43:00] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-23 21:43:00] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2024-05-23 21:43:00] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-23 21:43:00] [INFO ] Added : 29 causal constraints over 6 iterations in 29 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[201, 200, 200, 200, 201, 201, 201] Max Struct:[203, 203, 203, 203, 203, 203, 203]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[201, 200, 200, 200, 201, 201, 201] Max Struct:[203, 203, 203, 203, 203, 203, 203]
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 1 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 2 ms. Remains 35 /35 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2024-05-23 21:43:01] [INFO ] Invariant cache hit.
[2024-05-23 21:43:01] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-23 21:43:01] [INFO ] Invariant cache hit.
[2024-05-23 21:43:01] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 21:43:01] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2024-05-23 21:43:01] [INFO ] Redundant transitions in 0 ms returned []
Running 42 sub problems to find dead transitions.
[2024-05-23 21:43:01] [INFO ] Invariant cache hit.
[2024-05-23 21:43:01] [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 462 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
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (OVERLAPS) 0/91 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 91 constraints, problems are : Problem set: 0 solved, 42 unsolved in 691 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]
After SMT, in 1201ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 1202ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1294 ms. Remains : 35/35 places, 56/56 transitions.
RANDOM walk for 40110 steps (8 resets) in 282 ms. (141 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 238983 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :0 out of 14
Probabilistic random walk after 238983 steps, saw 205210 distinct states, run finished after 3004 ms. (steps per millisecond=79 ) properties seen :0
[2024-05-23 21:43:07] [INFO ] Invariant cache hit.
[2024-05-23 21:43:07] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 28/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-23 21:43:07] [INFO ] Deduced a trap composed of 3 places in 310 ms of which 5 ms to minimize.
[2024-05-23 21:43:07] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-05-23 21:43:07] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-23 21:43:07] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-05-23 21:43:07] [INFO ] Deduced a trap composed of 3 places in 113 ms of which 3 ms to minimize.
Problem MAX0 is UNSAT
[2024-05-23 21:43:07] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2024-05-23 21:43:07] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
Problem MAX1 is UNSAT
Problem MAX2 is UNSAT
Problem MAX3 is UNSAT
Problem MAX4 is UNSAT
Problem MAX5 is UNSAT
Problem MAX6 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 7/14 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/14 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 56/91 variables, 35/49 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 7/56 constraints. Problems are: Problem set: 7 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/56 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/91 variables, 0/56 constraints. Problems are: Problem set: 7 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 56 constraints, problems are : Problem set: 7 solved, 7 unsolved in 1626 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 7 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 28/35 variables, 7/7 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 7/14 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/14 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 56/91 variables, 35/49 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 7/56 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 7/63 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/63 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 0/91 variables, 0/63 constraints. Problems are: Problem set: 7 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 63 constraints, problems are : Problem set: 7 solved, 7 unsolved in 295 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 7/14 constraints, Known Traps: 7/7 constraints]
After SMT, in 1932ms problems are : Problem set: 7 solved, 7 unsolved
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 1006 ms.
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 1 ms. Remains 30 /35 variables (removed 5) and now considering 48/56 (removed 8) transitions.
Running 36 sub problems to find dead transitions.
// Phase 1: matrix 48 rows 30 cols
[2024-05-23 21:43:09] [INFO ] Computed 6 invariants in 0 ms
[2024-05-23 21:43:09] [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 375 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 562 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 954ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 954ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 956 ms. Remains : 30/35 places, 48/56 transitions.
RANDOM walk for 40177 steps (8 resets) in 26 ms. (1488 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 26 ms. (1481 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 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 40003 steps (8 resets) in 34 ms. (1142 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 639638 steps, run timeout after 3001 ms. (steps per millisecond=213 ) properties seen :0 out of 6
Probabilistic random walk after 639638 steps, saw 541491 distinct states, run finished after 3001 ms. (steps per millisecond=213 ) properties seen :0
[2024-05-23 21:43:14] [INFO ] Invariant cache hit.
[2024-05-23 21:43:14] [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 64 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-05-23 21:43:14] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-23 21:43:14] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 48/78 variables, 30/38 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 6/44 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 6/50 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-23 21:43:37] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/78 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (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 24155 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 24250ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2803 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 2 ms. Remains 30 /30 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2024-05-23 21:43:41] [INFO ] Invariant cache hit.
[2024-05-23 21:43:41] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-23 21:43:41] [INFO ] Invariant cache hit.
[2024-05-23 21:43:41] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-23 21:43:41] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2024-05-23 21:43:41] [INFO ] Redundant transitions in 0 ms returned []
Running 36 sub problems to find dead transitions.
[2024-05-23 21:43:41] [INFO ] Invariant cache hit.
[2024-05-23 21:43:41] [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 450 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 490 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 968ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 969ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1061 ms. Remains : 30/30 places, 48/48 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[201, 200, 200, 200, 201, 201, 201] Max Struct:[203, 203, 203, 203, 203, 203, 203]
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-00
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:[203]
Current structural bounds on expressions (Before main loop) : Max Seen:[1] Max Struct:[203]
// Phase 1: matrix 56 rows 35 cols
[2024-05-23 21:43:42] [INFO ] Computed 7 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[203]
RANDOM walk for 10054 steps (2 resets) in 6 ms. (1436 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:[201] Max Struct:[203]
[2024-05-23 21:43:42] [INFO ] Invariant cache hit.
[2024-05-23 21:43:42] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 21:43:42] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-23 21:43:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:43:42] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 21:43:42] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-23 21:43:42] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 21:43:42] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2024-05-23 21:43:42] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-23 21:43:42] [INFO ] Added : 26 causal constraints over 7 iterations in 79 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[201] Max Struct:[203]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[201] Max Struct:[203]
Support contains 1 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 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions (Output transitions of discarded places.) removed 48 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-05-23 21:43:42] [INFO ] Computed 1 invariants in 1 ms
[2024-05-23 21:43:42] [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 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]
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 41 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 120 ms. Remains : 5/35 places, 8/56 transitions.
[2024-05-23 21:43:42] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[201] Max Struct:[203]
RANDOM walk for 1000011 steps (2 resets) in 118 ms. (8403 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 220 ms. (4524 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[201] Max Struct:[203]
[2024-05-23 21:43:42] [INFO ] Invariant cache hit.
[2024-05-23 21:43:42] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 21:43:42] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-23 21:43:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:43:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 21:43:42] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-23 21:43:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 21:43:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-23 21:43:42] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-23 21:43:42] [INFO ] Added : 6 causal constraints over 3 iterations in 5 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[201] Max Struct:[203]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[201] Max Struct:[203]
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-05-23 21:43:42] [INFO ] Invariant cache hit.
[2024-05-23 21:43:43] [INFO ] Implicit Places using invariants in 12 ms returned []
[2024-05-23 21:43:43] [INFO ] Invariant cache hit.
[2024-05-23 21:43:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 21:43:43] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2024-05-23 21:43:43] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-23 21:43:43] [INFO ] Invariant cache hit.
[2024-05-23 21:43:43] [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 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]
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 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 145 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40130 steps (8 resets) in 24 ms. (1605 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1442086 steps, run timeout after 3001 ms. (steps per millisecond=480 ) properties seen :0 out of 2
Probabilistic random walk after 1442086 steps, saw 470405 distinct states, run finished after 3001 ms. (steps per millisecond=480 ) properties seen :0
[2024-05-23 21:43:46] [INFO ] Invariant cache hit.
[2024-05-23 21:43:46] [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-05-23 21:43:46] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 2 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 48 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 23 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 78ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 12 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-05-23 21:43:46] [INFO ] Invariant cache hit.
[2024-05-23 21:43:46] [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 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]
After SMT, in 99ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 99ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40044 steps (8 resets) in 19 ms. (2002 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 4065172 steps, run timeout after 3001 ms. (steps per millisecond=1354 ) properties seen :0 out of 1
Probabilistic random walk after 4065172 steps, saw 1400530 distinct states, run finished after 3001 ms. (steps per millisecond=1354 ) properties seen :0
[2024-05-23 21:43:49] [INFO ] Invariant cache hit.
[2024-05-23 21:43:49] [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 34 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 22 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 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.
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-05-23 21:43:49] [INFO ] Invariant cache hit.
[2024-05-23 21:43:49] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-23 21:43:49] [INFO ] Invariant cache hit.
[2024-05-23 21:43:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 21:43:49] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-05-23 21:43:49] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-23 21:43:49] [INFO ] Invariant cache hit.
[2024-05-23 21:43:49] [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 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 133ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 133ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 186 ms. Remains : 5/5 places, 8/8 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[201] Max Struct:[203]
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-00 in 7531 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-01
Current structural bounds on expressions (Initially) : Max Seen:[200] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[200] Max Struct:[203]
Current structural bounds on expressions (Before main loop) : Max Seen:[200] Max Struct:[203]
// Phase 1: matrix 56 rows 35 cols
[2024-05-23 21:43:49] [INFO ] Computed 7 invariants in 13 ms
Current structural bounds on expressions (after invariants) : Max Seen:[200] Max Struct:[203]
RANDOM walk for 10111 steps (2 resets) in 6 ms. (1444 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:[200] Max Struct:[203]
[2024-05-23 21:43:49] [INFO ] Invariant cache hit.
[2024-05-23 21:43:49] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 21:43:49] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-23 21:43:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:43:49] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 21:43:49] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-23 21:43:49] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 21:43:49] [INFO ] [Nat]Added 7 Read/Feed constraints in 25 ms returned sat
[2024-05-23 21:43:49] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-23 21:43:49] [INFO ] Added : 17 causal constraints over 6 iterations in 23 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[200] Max Struct:[203]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[200] Max Struct:[203]
Support contains 1 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 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions (Output transitions of discarded places.) removed 48 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-05-23 21:43:50] [INFO ] Computed 1 invariants in 0 ms
[2024-05-23 21:43:50] [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 144 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 40 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 188ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 188ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 188 ms. Remains : 5/35 places, 8/56 transitions.
[2024-05-23 21:43:50] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[200] Max Struct:[203]
RANDOM walk for 1000024 steps (2 resets) in 184 ms. (5405 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 165 ms. (6024 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[200] Max Struct:[203]
[2024-05-23 21:43:50] [INFO ] Invariant cache hit.
[2024-05-23 21:43:50] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-23 21:43:50] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-23 21:43:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 21:43:50] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-23 21:43:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:43:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 21:43:50] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-23 21:43:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-23 21:43:50] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-23 21:43:50] [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:[200] Max Struct:[203]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[200] Max Struct:[203]
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-05-23 21:43:50] [INFO ] Invariant cache hit.
[2024-05-23 21:43:50] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-23 21:43:50] [INFO ] Invariant cache hit.
[2024-05-23 21:43:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 21:43:50] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-05-23 21:43:50] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-23 21:43:50] [INFO ] Invariant cache hit.
[2024-05-23 21:43:50] [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 38 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 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]
After SMT, in 90ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 90ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40167 steps (8 resets) in 9 ms. (4016 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
BEST_FIRST walk for 40004 steps (8 resets) in 18 ms. (2105 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1944502 steps, run timeout after 3001 ms. (steps per millisecond=647 ) properties seen :0 out of 2
Probabilistic random walk after 1944502 steps, saw 652716 distinct states, run finished after 3001 ms. (steps per millisecond=647 ) properties seen :0
[2024-05-23 21:43:53] [INFO ] Invariant cache hit.
[2024-05-23 21:43:53] [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-05-23 21:43:53] [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
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 45 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 23 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 75ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 20 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-05-23 21:43:53] [INFO ] Invariant cache hit.
[2024-05-23 21:43:53] [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 89 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 161ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 161ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40114 steps (8 resets) in 10 ms. (3646 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 12 ms. (3077 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 4365209 steps, run timeout after 3001 ms. (steps per millisecond=1454 ) properties seen :0 out of 1
Probabilistic random walk after 4365209 steps, saw 1508268 distinct states, run finished after 3001 ms. (steps per millisecond=1454 ) properties seen :0
[2024-05-23 21:43:57] [INFO ] Invariant cache hit.
[2024-05-23 21:43:57] [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 72ms 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 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-05-23 21:43:57] [INFO ] Invariant cache hit.
[2024-05-23 21:43:57] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-23 21:43:57] [INFO ] Invariant cache hit.
[2024-05-23 21:43:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 21:43:57] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2024-05-23 21:43:57] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-23 21:43:57] [INFO ] Invariant cache hit.
[2024-05-23 21:43:57] [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 77 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 88 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 171ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 173ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 271 ms. Remains : 5/5 places, 8/8 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[200] Max Struct:[203]
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-01 in 7747 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-03
Current structural bounds on expressions (Initially) : Max Seen:[200] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[200] Max Struct:[203]
Current structural bounds on expressions (Before main loop) : Max Seen:[200] Max Struct:[203]
// Phase 1: matrix 56 rows 35 cols
[2024-05-23 21:43:57] [INFO ] Computed 7 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[200] Max Struct:[203]
RANDOM walk for 10033 steps (2 resets) in 7 ms. (1254 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:[200] Max Struct:[203]
[2024-05-23 21:43:57] [INFO ] Invariant cache hit.
[2024-05-23 21:43:57] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 21:43:57] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-23 21:43:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:43:57] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 21:43:57] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-23 21:43:57] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 21:43:57] [INFO ] [Nat]Added 7 Read/Feed constraints in 8 ms returned sat
[2024-05-23 21:43:57] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-23 21:43:57] [INFO ] Added : 14 causal constraints over 6 iterations in 27 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[200] Max Struct:[203]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[200] Max Struct:[203]
Support contains 1 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 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions (Output transitions of discarded places.) removed 48 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-05-23 21:43:57] [INFO ] Computed 1 invariants in 1 ms
[2024-05-23 21:43:57] [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 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]
After SMT, in 124ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 124ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 5/35 places, 8/56 transitions.
[2024-05-23 21:43:57] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[200] Max Struct:[203]
RANDOM walk for 1000031 steps (2 resets) in 137 ms. (7246 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 171 ms. (5813 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[200] Max Struct:[203]
[2024-05-23 21:43:58] [INFO ] Invariant cache hit.
[2024-05-23 21:43:58] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 21:43:58] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-23 21:43:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 21:43:58] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-23 21:43:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:43:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 21:43:58] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-23 21:43:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-23 21:43:58] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-23 21:43:58] [INFO ] Added : 5 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[200] Max Struct:[203]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[200] Max Struct:[203]
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 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-23 21:43:58] [INFO ] Invariant cache hit.
[2024-05-23 21:43:58] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-23 21:43:58] [INFO ] Invariant cache hit.
[2024-05-23 21:43:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 21:43:58] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-05-23 21:43:58] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-23 21:43:58] [INFO ] Invariant cache hit.
[2024-05-23 21:43:58] [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 40 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 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]
After SMT, in 104ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 104ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40175 steps (8 resets) in 26 ms. (1487 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1361889 steps, run timeout after 3001 ms. (steps per millisecond=453 ) properties seen :0 out of 2
Probabilistic random walk after 1361889 steps, saw 441306 distinct states, run finished after 3001 ms. (steps per millisecond=453 ) properties seen :0
[2024-05-23 21:44:01] [INFO ] Invariant cache hit.
[2024-05-23 21:44:01] [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-05-23 21:44:01] [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 45 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 77ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 11 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-05-23 21:44:01] [INFO ] Invariant cache hit.
[2024-05-23 21:44:01] [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 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]
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 107 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40088 steps (8 resets) in 10 ms. (3644 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 4473947 steps, run timeout after 3001 ms. (steps per millisecond=1490 ) properties seen :0 out of 1
Probabilistic random walk after 4473947 steps, saw 1545430 distinct states, run finished after 3001 ms. (steps per millisecond=1490 ) properties seen :0
[2024-05-23 21:44:04] [INFO ] Invariant cache hit.
[2024-05-23 21:44:04] [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 34 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 22 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 66ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 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-05-23 21:44:04] [INFO ] Invariant cache hit.
[2024-05-23 21:44:04] [INFO ] Implicit Places using invariants in 13 ms returned []
[2024-05-23 21:44:04] [INFO ] Invariant cache hit.
[2024-05-23 21:44:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 21:44:04] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2024-05-23 21:44:04] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-23 21:44:04] [INFO ] Invariant cache hit.
[2024-05-23 21:44:04] [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 44 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 40 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 180 ms. Remains : 5/5 places, 8/8 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[200] Max Struct:[203]
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-03 in 7518 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-05
Current structural bounds on expressions (Initially) : Max Seen:[200] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[200] Max Struct:[203]
Current structural bounds on expressions (Before main loop) : Max Seen:[200] Max Struct:[203]
// Phase 1: matrix 56 rows 35 cols
[2024-05-23 21:44:04] [INFO ] Computed 7 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[200] Max Struct:[203]
RANDOM walk for 10048 steps (2 resets) in 5 ms. (1674 steps per ms)
BEST_FIRST walk for 10000 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[200] Max Struct:[203]
[2024-05-23 21:44:04] [INFO ] Invariant cache hit.
[2024-05-23 21:44:04] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 21:44:04] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-23 21:44:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:44:05] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 21:44:05] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-23 21:44:05] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 21:44:05] [INFO ] [Nat]Added 7 Read/Feed constraints in 15 ms returned sat
[2024-05-23 21:44:05] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-23 21:44:05] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-23 21:44:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2024-05-23 21:44:05] [INFO ] Added : 29 causal constraints over 7 iterations in 68 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[200] Max Struct:[203]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[200] Max Struct:[203]
Support contains 1 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 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions (Output transitions of discarded places.) removed 48 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-05-23 21:44:05] [INFO ] Computed 1 invariants in 1 ms
[2024-05-23 21:44:05] [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 40 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 89ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 89ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 5/35 places, 8/56 transitions.
[2024-05-23 21:44:05] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[200] Max Struct:[203]
RANDOM walk for 1000001 steps (2 resets) in 119 ms. (8333 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 186 ms. (5347 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[200] Max Struct:[203]
[2024-05-23 21:44:05] [INFO ] Invariant cache hit.
[2024-05-23 21:44:05] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 21:44:05] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-23 21:44:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 21:44:05] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-23 21:44:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:44:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 21:44:05] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-23 21:44:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-23 21:44:05] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-23 21:44:05] [INFO ] Added : 5 causal constraints over 2 iterations in 4 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[200] Max Struct:[203]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[200] Max Struct:[203]
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-05-23 21:44:05] [INFO ] Invariant cache hit.
[2024-05-23 21:44:05] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-23 21:44:05] [INFO ] Invariant cache hit.
[2024-05-23 21:44:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 21:44:05] [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-05-23 21:44:05] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-23 21:44:05] [INFO ] Invariant cache hit.
[2024-05-23 21:44:05] [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 40 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 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]
After SMT, in 92ms 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 137 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40142 steps (8 resets) in 18 ms. (2112 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 17 ms. (2222 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 13 ms. (2857 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 2049416 steps, run timeout after 3001 ms. (steps per millisecond=682 ) properties seen :0 out of 2
Probabilistic random walk after 2049416 steps, saw 690433 distinct states, run finished after 3001 ms. (steps per millisecond=682 ) properties seen :0
[2024-05-23 21:44:08] [INFO ] Invariant cache hit.
[2024-05-23 21:44:08] [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-05-23 21:44:08] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 6 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 44 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 85ms 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-05-23 21:44:08] [INFO ] Invariant cache hit.
[2024-05-23 21:44: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 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 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 94 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40129 steps (8 resets) in 12 ms. (3086 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 12 ms. (3077 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3824036 steps, run timeout after 3001 ms. (steps per millisecond=1274 ) properties seen :0 out of 1
Probabilistic random walk after 3824036 steps, saw 1315921 distinct states, run finished after 3001 ms. (steps per millisecond=1274 ) properties seen :0
[2024-05-23 21:44:12] [INFO ] Invariant cache hit.
[2024-05-23 21:44:12] [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 33 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 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]
After SMT, in 85ms 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 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-23 21:44:12] [INFO ] Invariant cache hit.
[2024-05-23 21:44:12] [INFO ] Implicit Places using invariants in 13 ms returned []
[2024-05-23 21:44:12] [INFO ] Invariant cache hit.
[2024-05-23 21:44:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 21:44:12] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
[2024-05-23 21:44:12] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-23 21:44:12] [INFO ] Invariant cache hit.
[2024-05-23 21:44:12] [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 77 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 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]
After SMT, in 131ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 131ms
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:[200] Max Struct:[203]
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-05 in 7416 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-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:[203]
Current structural bounds on expressions (Before main loop) : Max Seen:[1] Max Struct:[203]
// Phase 1: matrix 56 rows 35 cols
[2024-05-23 21:44:12] [INFO ] Computed 7 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[203]
RANDOM walk for 10000 steps (2 resets) in 5 ms. (1666 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:[201] Max Struct:[203]
[2024-05-23 21:44:12] [INFO ] Invariant cache hit.
[2024-05-23 21:44:12] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 21:44:12] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-23 21:44:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:44:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 21:44:12] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-23 21:44:12] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 21:44:12] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2024-05-23 21:44:12] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-23 21:44:12] [INFO ] Added : 26 causal constraints over 6 iterations in 27 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[201] Max Struct:[203]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[201] Max Struct:[203]
Support contains 1 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 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions (Output transitions of discarded places.) removed 48 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-05-23 21:44:12] [INFO ] Computed 1 invariants in 0 ms
[2024-05-23 21:44:12] [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 44 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 112ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 5/35 places, 8/56 transitions.
[2024-05-23 21:44:12] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[201] Max Struct:[203]
RANDOM walk for 1000016 steps (2 resets) in 118 ms. (8403 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 221 ms. (4504 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[201] Max Struct:[203]
[2024-05-23 21:44:13] [INFO ] Invariant cache hit.
[2024-05-23 21:44:13] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 21:44:13] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-23 21:44:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:44:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 21:44:13] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-23 21:44:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 21:44:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-23 21:44:13] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-23 21:44:13] [INFO ] Added : 6 causal constraints over 3 iterations in 5 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[201] Max Struct:[203]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[201] Max Struct:[203]
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 9 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 9 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-05-23 21:44:13] [INFO ] Invariant cache hit.
[2024-05-23 21:44:13] [INFO ] Implicit Places using invariants in 13 ms returned []
[2024-05-23 21:44:13] [INFO ] Invariant cache hit.
[2024-05-23 21:44:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 21:44:13] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2024-05-23 21:44:13] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-23 21:44:13] [INFO ] Invariant cache hit.
[2024-05-23 21:44:13] [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 41 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 158 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40096 steps (8 resets) in 13 ms. (2864 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 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 2621577 steps, run timeout after 3001 ms. (steps per millisecond=873 ) properties seen :0 out of 2
Probabilistic random walk after 2621577 steps, saw 893009 distinct states, run finished after 3001 ms. (steps per millisecond=873 ) properties seen :0
[2024-05-23 21:44:16] [INFO ] Invariant cache hit.
[2024-05-23 21:44:16] [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-05-23 21:44:16] [INFO ] Deduced a trap composed of 3 places in 14 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 24 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 102ms 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 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-05-23 21:44:16] [INFO ] Invariant cache hit.
[2024-05-23 21:44:16] [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 40 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 65 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 142ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 143ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40093 steps (8 resets) in 9 ms. (4009 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 4404815 steps, run timeout after 3001 ms. (steps per millisecond=1467 ) properties seen :0 out of 1
Probabilistic random walk after 4404815 steps, saw 1522141 distinct states, run finished after 3001 ms. (steps per millisecond=1467 ) properties seen :0
[2024-05-23 21:44:19] [INFO ] Invariant cache hit.
[2024-05-23 21:44: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, 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 40 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 82ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 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 5 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 6 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-05-23 21:44:19] [INFO ] Invariant cache hit.
[2024-05-23 21:44:19] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-23 21:44:19] [INFO ] Invariant cache hit.
[2024-05-23 21:44:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 21:44:19] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2024-05-23 21:44:19] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-23 21:44:19] [INFO ] Invariant cache hit.
[2024-05-23 21:44: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 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 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 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 159 ms. Remains : 5/5 places, 8/8 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[201] Max Struct:[203]
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-06 in 7513 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-10
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[203]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[203]
// Phase 1: matrix 56 rows 35 cols
[2024-05-23 21:44:19] [INFO ] Computed 7 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[203]
RANDOM walk for 10096 steps (2 resets) in 6 ms. (1442 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:[163] Max Struct:[203]
[2024-05-23 21:44:19] [INFO ] Invariant cache hit.
[2024-05-23 21:44:19] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 21:44:19] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-23 21:44:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:44:19] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 21:44:19] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-23 21:44:19] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 21:44:19] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2024-05-23 21:44:19] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-23 21:44:19] [INFO ] Added : 27 causal constraints over 7 iterations in 28 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[163] Max Struct:[203]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[201] Max Struct:[203]
Support contains 1 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 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions (Output transitions of discarded places.) removed 48 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-05-23 21:44:20] [INFO ] Computed 1 invariants in 0 ms
[2024-05-23 21:44:20] [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 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 120ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 120ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 5/35 places, 8/56 transitions.
[2024-05-23 21:44:20] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[201] Max Struct:[203]
RANDOM walk for 1000001 steps (2 resets) in 118 ms. (8403 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 212 ms. (4694 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[201] Max Struct:[203]
[2024-05-23 21:44:20] [INFO ] Invariant cache hit.
[2024-05-23 21:44:20] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 21:44:20] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-23 21:44:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:44:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 21:44:20] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-23 21:44:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 21:44:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-23 21:44:20] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-23 21:44:20] [INFO ] Added : 5 causal constraints over 2 iterations in 4 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[201] Max Struct:[203]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[201] Max Struct:[203]
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-05-23 21:44:20] [INFO ] Invariant cache hit.
[2024-05-23 21:44:20] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-23 21:44:20] [INFO ] Invariant cache hit.
[2024-05-23 21:44:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 21:44:20] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2024-05-23 21:44:20] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-23 21:44:20] [INFO ] Invariant cache hit.
[2024-05-23 21:44:20] [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 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]
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 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 150 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40132 steps (8 resets) in 17 ms. (2229 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 17 ms. (2222 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 2479100 steps, run timeout after 3001 ms. (steps per millisecond=826 ) properties seen :0 out of 2
Probabilistic random walk after 2479100 steps, saw 843056 distinct states, run finished after 3001 ms. (steps per millisecond=826 ) properties seen :0
[2024-05-23 21:44:23] [INFO ] Invariant cache hit.
[2024-05-23 21:44:23] [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-05-23 21:44:23] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 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 45 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 21 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 17 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-05-23 21:44:24] [INFO ] Invariant cache hit.
[2024-05-23 21:44:24] [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 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]
After SMT, in 98ms 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 100 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40083 steps (8 resets) in 9 ms. (4008 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 12 ms. (3077 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 4576610 steps, run timeout after 3001 ms. (steps per millisecond=1525 ) properties seen :0 out of 1
Probabilistic random walk after 4576610 steps, saw 1581181 distinct states, run finished after 3001 ms. (steps per millisecond=1525 ) properties seen :0
[2024-05-23 21:44:27] [INFO ] Invariant cache hit.
[2024-05-23 21:44:27] [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 26 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 63ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 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-05-23 21:44:27] [INFO ] Invariant cache hit.
[2024-05-23 21:44:27] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-23 21:44:27] [INFO ] Invariant cache hit.
[2024-05-23 21:44:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 21:44:27] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2024-05-23 21:44:27] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-23 21:44:27] [INFO ] Invariant cache hit.
[2024-05-23 21:44:27] [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 52 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 38 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 92ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 92ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 5/5 places, 8/8 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[201] Max Struct:[203]
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-10 in 7468 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-13
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[203]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[203]
// Phase 1: matrix 56 rows 35 cols
[2024-05-23 21:44:27] [INFO ] Computed 7 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[203]
RANDOM walk for 10027 steps (2 resets) in 6 ms. (1432 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:[151] Max Struct:[203]
[2024-05-23 21:44:27] [INFO ] Invariant cache hit.
[2024-05-23 21:44:27] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 21:44:27] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-23 21:44:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:44:27] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 21:44:27] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-23 21:44:27] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 21:44:27] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2024-05-23 21:44:27] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-23 21:44:27] [INFO ] Added : 28 causal constraints over 6 iterations in 26 ms. Result :sat
Minimization took 44 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[151] Max Struct:[203]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[201] Max Struct:[203]
Support contains 1 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 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions (Output transitions of discarded places.) removed 48 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-05-23 21:44:27] [INFO ] Computed 1 invariants in 1 ms
[2024-05-23 21:44:27] [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 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]
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 142ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 142ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 5/35 places, 8/56 transitions.
[2024-05-23 21:44:27] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[201] Max Struct:[203]
RANDOM walk for 1000003 steps (2 resets) in 148 ms. (6711 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 164 ms. (6060 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[201] Max Struct:[203]
[2024-05-23 21:44:28] [INFO ] Invariant cache hit.
[2024-05-23 21:44:28] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 21:44:28] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-23 21:44:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:44:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 21:44:28] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-23 21:44:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 21:44:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-23 21:44:28] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-23 21:44:28] [INFO ] Added : 5 causal constraints over 2 iterations in 4 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[201] Max Struct:[203]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[201] Max Struct:[203]
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-05-23 21:44:28] [INFO ] Invariant cache hit.
[2024-05-23 21:44:28] [INFO ] Implicit Places using invariants in 13 ms returned []
[2024-05-23 21:44:28] [INFO ] Invariant cache hit.
[2024-05-23 21:44:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 21:44:28] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2024-05-23 21:44:28] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-23 21:44:28] [INFO ] Invariant cache hit.
[2024-05-23 21:44:28] [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 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]
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 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 159 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40043 steps (8 resets) in 15 ms. (2502 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 17 ms. (2222 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 2564753 steps, run timeout after 3001 ms. (steps per millisecond=854 ) properties seen :0 out of 2
Probabilistic random walk after 2564753 steps, saw 873528 distinct states, run finished after 3001 ms. (steps per millisecond=854 ) properties seen :0
[2024-05-23 21:44:31] [INFO ] Invariant cache hit.
[2024-05-23 21:44:31] [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-05-23 21:44:31] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 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 78ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 13 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-05-23 21:44:31] [INFO ] Invariant cache hit.
[2024-05-23 21:44:31] [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 38 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 44 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 104 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40054 steps (8 resets) in 9 ms. (4005 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 14 ms. (2666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 4494057 steps, run timeout after 3001 ms. (steps per millisecond=1497 ) properties seen :0 out of 1
Probabilistic random walk after 4494057 steps, saw 1552376 distinct states, run finished after 3001 ms. (steps per millisecond=1497 ) properties seen :0
[2024-05-23 21:44:34] [INFO ] Invariant cache hit.
[2024-05-23 21:44:34] [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 22 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 61ms problems are : Problem set: 0 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.
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-05-23 21:44:34] [INFO ] Invariant cache hit.
[2024-05-23 21:44:34] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-23 21:44:34] [INFO ] Invariant cache hit.
[2024-05-23 21:44:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 21:44:34] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-05-23 21:44:34] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-23 21:44:34] [INFO ] Invariant cache hit.
[2024-05-23 21:44:34] [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 41 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 157 ms. Remains : 5/5 places, 8/8 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[201] Max Struct:[203]
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-13 in 7674 ms.
[2024-05-23 21:44:35] [INFO ] Flatten gal took : 55 ms
[2024-05-23 21:44:35] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/UpperBounds.sr.xml took 6 ms.
[2024-05-23 21:44:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 35 places, 56 transitions and 147 arcs took 3 ms.
Total runtime 339044 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running JoinFreeModules-PT-0200

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 35
TRANSITIONS: 56
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.000s, Sys 0.001s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1677
MODEL NAME: /home/mcc/execution/412/model
35 places, 56 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA JoinFreeModules-PT-0200-UpperBounds-00 201 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA JoinFreeModules-PT-0200-UpperBounds-03 200 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA JoinFreeModules-PT-0200-UpperBounds-01 200 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA JoinFreeModules-PT-0200-UpperBounds-05 200 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA JoinFreeModules-PT-0200-UpperBounds-10 202 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA JoinFreeModules-PT-0200-UpperBounds-06 201 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA JoinFreeModules-PT-0200-UpperBounds-13 202 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716500692378

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.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

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-0200"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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