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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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.5K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 15K May 19 15:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 795K 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 ASLink-PT-05b-UpperBounds-00
FORMULA_NAME ASLink-PT-05b-UpperBounds-01
FORMULA_NAME ASLink-PT-05b-UpperBounds-02
FORMULA_NAME ASLink-PT-05b-UpperBounds-03
FORMULA_NAME ASLink-PT-05b-UpperBounds-04
FORMULA_NAME ASLink-PT-05b-UpperBounds-05
FORMULA_NAME ASLink-PT-05b-UpperBounds-06
FORMULA_NAME ASLink-PT-05b-UpperBounds-07
FORMULA_NAME ASLink-PT-05b-UpperBounds-08
FORMULA_NAME ASLink-PT-05b-UpperBounds-09
FORMULA_NAME ASLink-PT-05b-UpperBounds-10
FORMULA_NAME ASLink-PT-05b-UpperBounds-11
FORMULA_NAME ASLink-PT-05b-UpperBounds-12
FORMULA_NAME ASLink-PT-05b-UpperBounds-13
FORMULA_NAME ASLink-PT-05b-UpperBounds-14
FORMULA_NAME ASLink-PT-05b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717203081969

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-05b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:51:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 00:51:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:51:25] [INFO ] Load time of PNML (sax parser for PT used): 604 ms
[2024-06-01 00:51:25] [INFO ] Transformed 2430 places.
[2024-06-01 00:51:25] [INFO ] Transformed 3040 transitions.
[2024-06-01 00:51:25] [INFO ] Found NUPN structural information;
[2024-06-01 00:51:25] [INFO ] Parsed PT model containing 2430 places and 3040 transitions and 9292 arcs in 902 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 18 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 3040 rows 2430 cols
[2024-06-01 00:51:25] [INFO ] Computed 238 invariants in 176 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (18 resets) in 90 ms. (109 steps per ms)
FORMULA ASLink-PT-05b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-05b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-05b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-05b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-05b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-05b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-05b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-05b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80007 steps (20 resets) in 162 ms. (490 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-01 00:51:26] [INFO ] Invariant cache hit.
[2024-06-01 00:51:27] [INFO ] [Real]Absence check using 56 positive place invariants in 132 ms returned sat
[2024-06-01 00:51:27] [INFO ] [Real]Absence check using 56 positive and 182 generalized place invariants in 138 ms returned sat
[2024-06-01 00:51:30] [INFO ] [Real]Absence check using state equation in 2740 ms returned sat
[2024-06-01 00:51:33] [INFO ] Deduced a trap composed of 126 places in 2816 ms of which 283 ms to minimize.
[2024-06-01 00:51:33] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 00:51:34] [INFO ] [Real]Absence check using 56 positive place invariants in 81 ms returned sat
[2024-06-01 00:51:34] [INFO ] [Real]Absence check using 56 positive and 182 generalized place invariants in 110 ms returned sat
[2024-06-01 00:51:37] [INFO ] [Real]Absence check using state equation in 2811 ms returned sat
[2024-06-01 00:51:39] [INFO ] Deduced a trap composed of 112 places in 2016 ms of which 28 ms to minimize.
[2024-06-01 00:51:39] [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.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 00:51:40] [INFO ] [Real]Absence check using 56 positive place invariants in 87 ms returned sat
[2024-06-01 00:51:40] [INFO ] [Real]Absence check using 56 positive and 182 generalized place invariants in 120 ms returned sat
[2024-06-01 00:51:43] [INFO ] [Real]Absence check using state equation in 2525 ms returned sat
[2024-06-01 00:51:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:51:44] [INFO ] [Nat]Absence check using 56 positive place invariants in 125 ms returned sat
[2024-06-01 00:51:44] [INFO ] [Nat]Absence check using 56 positive and 182 generalized place invariants in 154 ms returned sat
[2024-06-01 00:51:46] [INFO ] [Nat]Absence check using state equation in 2392 ms returned sat
[2024-06-01 00:51:48] [INFO ] Deduced a trap composed of 85 places in 1873 ms of which 20 ms to minimize.
[2024-06-01 00:51:48] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 00:51:49] [INFO ] [Real]Absence check using 56 positive place invariants in 118 ms returned sat
[2024-06-01 00:51:50] [INFO ] [Real]Absence check using 56 positive and 182 generalized place invariants in 155 ms returned sat
[2024-06-01 00:51:52] [INFO ] [Real]Absence check using state equation in 2229 ms returned sat
[2024-06-01 00:51:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:51:53] [INFO ] [Nat]Absence check using 56 positive place invariants in 81 ms returned sat
[2024-06-01 00:51:53] [INFO ] [Nat]Absence check using 56 positive and 182 generalized place invariants in 107 ms returned sat
[2024-06-01 00:51:55] [INFO ] [Nat]Absence check using state equation in 2635 ms returned sat
[2024-06-01 00:51:56] [INFO ] Computed and/alt/rep : 2552/5600/2552 causal constraints (skipped 487 transitions) in 398 ms.
Maximisation of solution failed !
Minimization took 2 ms.
[2024-06-01 00:51:58] [INFO ] [Real]Absence check using 56 positive place invariants in 80 ms returned sat
[2024-06-01 00:51:58] [INFO ] [Real]Absence check using 56 positive and 182 generalized place invariants in 104 ms returned sat
[2024-06-01 00:52:00] [INFO ] [Real]Absence check using state equation in 2156 ms returned sat
[2024-06-01 00:52:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:52:01] [INFO ] [Nat]Absence check using 56 positive place invariants in 89 ms returned sat
[2024-06-01 00:52:01] [INFO ] [Nat]Absence check using 56 positive and 182 generalized place invariants in 111 ms returned sat
[2024-06-01 00:52:03] [INFO ] [Nat]Absence check using state equation in 2187 ms returned sat
[2024-06-01 00:52:06] [INFO ] Deduced a trap composed of 51 places in 1893 ms of which 18 ms to minimize.
[2024-06-01 00:52:06] [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 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 00:52:06] [INFO ] [Real]Absence check using 56 positive place invariants in 82 ms returned sat
[2024-06-01 00:52:06] [INFO ] [Real]Absence check using 56 positive and 182 generalized place invariants in 105 ms returned sat
[2024-06-01 00:52:09] [INFO ] [Real]Absence check using state equation in 2333 ms returned sat
[2024-06-01 00:52:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:52:10] [INFO ] [Nat]Absence check using 56 positive place invariants in 96 ms returned sat
[2024-06-01 00:52:10] [INFO ] [Nat]Absence check using 56 positive and 182 generalized place invariants in 125 ms returned sat
[2024-06-01 00:52:12] [INFO ] [Nat]Absence check using state equation in 2711 ms returned sat
[2024-06-01 00:52:14] [INFO ] Deduced a trap composed of 45 places in 1490 ms of which 15 ms to minimize.
[2024-06-01 00:52:14] [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 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 00:52:15] [INFO ] [Real]Absence check using 56 positive place invariants in 79 ms returned sat
[2024-06-01 00:52:15] [INFO ] [Real]Absence check using 56 positive and 182 generalized place invariants in 112 ms returned sat
[2024-06-01 00:52:17] [INFO ] [Real]Absence check using state equation in 1905 ms returned sat
[2024-06-01 00:52:19] [INFO ] Deduced a trap composed of 59 places in 2011 ms of which 18 ms to minimize.
[2024-06-01 00:52:19] [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.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 00:52:20] [INFO ] [Real]Absence check using 56 positive place invariants in 79 ms returned sat
[2024-06-01 00:52:20] [INFO ] [Real]Absence check using 56 positive and 182 generalized place invariants in 112 ms returned sat
[2024-06-01 00:52:22] [INFO ] [Real]Absence check using state equation in 2368 ms returned sat
[2024-06-01 00:52:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:52:23] [INFO ] [Nat]Absence check using 56 positive place invariants in 125 ms returned sat
[2024-06-01 00:52:23] [INFO ] [Nat]Absence check using 56 positive and 182 generalized place invariants in 156 ms returned sat
[2024-06-01 00:52:26] [INFO ] [Nat]Absence check using state equation in 2096 ms returned sat
[2024-06-01 00:52:27] [INFO ] Deduced a trap composed of 74 places in 1564 ms of which 13 ms to minimize.
[2024-06-01 00:52:29] [INFO ] Deduced a trap composed of 58 places in 1389 ms of which 13 ms to minimize.
[2024-06-01 00:52:29] [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 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
Support contains 8 out of 2430 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2430/2430 places, 3040/3040 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 556 transitions
Trivial Post-agglo rules discarded 556 transitions
Performed 556 trivial Post agglomeration. Transition count delta: 556
Iterating post reduction 0 with 556 rules applied. Total rules applied 556 place count 2430 transition count 2484
Reduce places removed 556 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 582 rules applied. Total rules applied 1138 place count 1874 transition count 2458
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 9 rules applied. Total rules applied 1147 place count 1867 transition count 2456
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1149 place count 1865 transition count 2456
Performed 558 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 558 Pre rules applied. Total rules applied 1149 place count 1865 transition count 1898
Deduced a syphon composed of 558 places in 6 ms
Ensure Unique test removed 53 places
Reduce places removed 611 places and 0 transitions.
Iterating global reduction 4 with 1169 rules applied. Total rules applied 2318 place count 1254 transition count 1898
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 4 with 41 rules applied. Total rules applied 2359 place count 1248 transition count 1863
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 5 with 35 rules applied. Total rules applied 2394 place count 1213 transition count 1863
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 20 Pre rules applied. Total rules applied 2394 place count 1213 transition count 1843
Deduced a syphon composed of 20 places in 13 ms
Ensure Unique test removed 19 places
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 6 with 59 rules applied. Total rules applied 2453 place count 1174 transition count 1843
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 19 Pre rules applied. Total rules applied 2453 place count 1174 transition count 1824
Deduced a syphon composed of 19 places in 5 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 2491 place count 1155 transition count 1824
Discarding 77 places :
Symmetric choice reduction at 6 with 77 rule applications. Total rules 2568 place count 1078 transition count 1747
Iterating global reduction 6 with 77 rules applied. Total rules applied 2645 place count 1078 transition count 1747
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2646 place count 1078 transition count 1746
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 26 Pre rules applied. Total rules applied 2646 place count 1078 transition count 1720
Deduced a syphon composed of 26 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 7 with 53 rules applied. Total rules applied 2699 place count 1051 transition count 1720
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 2699 place count 1051 transition count 1719
Deduced a syphon composed of 1 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 2702 place count 1049 transition count 1719
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 2707 place count 1044 transition count 1686
Iterating global reduction 7 with 5 rules applied. Total rules applied 2712 place count 1044 transition count 1686
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 4 Pre rules applied. Total rules applied 2712 place count 1044 transition count 1682
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 2720 place count 1040 transition count 1682
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2721 place count 1039 transition count 1674
Iterating global reduction 7 with 1 rules applied. Total rules applied 2722 place count 1039 transition count 1674
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2723 place count 1038 transition count 1666
Iterating global reduction 7 with 1 rules applied. Total rules applied 2724 place count 1038 transition count 1666
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2725 place count 1037 transition count 1658
Iterating global reduction 7 with 1 rules applied. Total rules applied 2726 place count 1037 transition count 1658
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2727 place count 1036 transition count 1650
Iterating global reduction 7 with 1 rules applied. Total rules applied 2728 place count 1036 transition count 1650
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2729 place count 1035 transition count 1642
Iterating global reduction 7 with 1 rules applied. Total rules applied 2730 place count 1035 transition count 1642
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2731 place count 1034 transition count 1634
Iterating global reduction 7 with 1 rules applied. Total rules applied 2732 place count 1034 transition count 1634
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2733 place count 1033 transition count 1626
Iterating global reduction 7 with 1 rules applied. Total rules applied 2734 place count 1033 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2735 place count 1032 transition count 1618
Iterating global reduction 7 with 1 rules applied. Total rules applied 2736 place count 1032 transition count 1618
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2737 place count 1031 transition count 1610
Iterating global reduction 7 with 1 rules applied. Total rules applied 2738 place count 1031 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2739 place count 1030 transition count 1602
Iterating global reduction 7 with 1 rules applied. Total rules applied 2740 place count 1030 transition count 1602
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2741 place count 1029 transition count 1594
Iterating global reduction 7 with 1 rules applied. Total rules applied 2742 place count 1029 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2743 place count 1028 transition count 1586
Iterating global reduction 7 with 1 rules applied. Total rules applied 2744 place count 1028 transition count 1586
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2745 place count 1027 transition count 1578
Iterating global reduction 7 with 1 rules applied. Total rules applied 2746 place count 1027 transition count 1578
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2747 place count 1026 transition count 1570
Iterating global reduction 7 with 1 rules applied. Total rules applied 2748 place count 1026 transition count 1570
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2749 place count 1025 transition count 1562
Iterating global reduction 7 with 1 rules applied. Total rules applied 2750 place count 1025 transition count 1562
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2751 place count 1024 transition count 1554
Iterating global reduction 7 with 1 rules applied. Total rules applied 2752 place count 1024 transition count 1554
Performed 138 Post agglomeration using F-continuation condition.Transition count delta: 138
Deduced a syphon composed of 138 places in 2 ms
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 7 with 276 rules applied. Total rules applied 3028 place count 886 transition count 1416
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3029 place count 885 transition count 1415
Ensure Unique test removed 1 places
Iterating global reduction 7 with 2 rules applied. Total rules applied 3031 place count 884 transition count 1415
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3032 place count 883 transition count 1414
Iterating global reduction 7 with 1 rules applied. Total rules applied 3033 place count 883 transition count 1414
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 3035 place count 883 transition count 1412
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 3036 place count 882 transition count 1412
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 3038 place count 881 transition count 1421
Free-agglomeration rule applied 6 times.
Iterating global reduction 9 with 6 rules applied. Total rules applied 3044 place count 881 transition count 1415
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 3050 place count 875 transition count 1415
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 10 with 4 rules applied. Total rules applied 3054 place count 875 transition count 1411
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 3058 place count 871 transition count 1411
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 3059 place count 870 transition count 1410
Reduce places removed 10 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 11 with 15 rules applied. Total rules applied 3074 place count 860 transition count 1405
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 3079 place count 855 transition count 1405
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 15 Pre rules applied. Total rules applied 3079 place count 855 transition count 1390
Deduced a syphon composed of 15 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 13 with 31 rules applied. Total rules applied 3110 place count 839 transition count 1390
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 13 with 6 rules applied. Total rules applied 3116 place count 833 transition count 1390
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 3116 place count 833 transition count 1389
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 3118 place count 832 transition count 1389
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 14 with 22 rules applied. Total rules applied 3140 place count 821 transition count 1378
Discarding 5 places :
Symmetric choice reduction at 14 with 5 rule applications. Total rules 3145 place count 816 transition count 1373
Iterating global reduction 14 with 5 rules applied. Total rules applied 3150 place count 816 transition count 1373
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 3151 place count 815 transition count 1372
Iterating global reduction 14 with 1 rules applied. Total rules applied 3152 place count 815 transition count 1372
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 3153 place count 815 transition count 1371
Free-agglomeration rule applied 4 times.
Iterating global reduction 15 with 4 rules applied. Total rules applied 3157 place count 815 transition count 1367
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 3161 place count 811 transition count 1367
Applied a total of 3161 rules in 2454 ms. Remains 811 /2430 variables (removed 1619) and now considering 1367/3040 (removed 1673) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2475 ms. Remains : 811/2430 places, 1367/3040 transitions.
// Phase 1: matrix 1367 rows 811 cols
[2024-06-01 00:52:31] [INFO ] Computed 140 invariants in 41 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (12290 resets) in 3556 ms. (281 steps per ms)
FORMULA ASLink-PT-05b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-05b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-05b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 5000004 steps (11765 resets) in 7465 ms. (669 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2024-06-01 00:52:42] [INFO ] Invariant cache hit.
[2024-06-01 00:52:42] [INFO ] [Real]Absence check using 36 positive place invariants in 22 ms returned sat
[2024-06-01 00:52:43] [INFO ] [Real]Absence check using 36 positive and 104 generalized place invariants in 32 ms returned sat
[2024-06-01 00:52:43] [INFO ] [Real]Absence check using state equation in 771 ms returned sat
[2024-06-01 00:52:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:52:43] [INFO ] [Nat]Absence check using 36 positive place invariants in 22 ms returned sat
[2024-06-01 00:52:44] [INFO ] [Nat]Absence check using 36 positive and 104 generalized place invariants in 43 ms returned sat
[2024-06-01 00:52:44] [INFO ] [Nat]Absence check using state equation in 809 ms returned sat
[2024-06-01 00:52:45] [INFO ] Computed and/alt/rep : 554/2148/554 causal constraints (skipped 783 transitions) in 136 ms.
[2024-06-01 00:52:52] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 2 ms to minimize.
[2024-06-01 00:52:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 259 ms
[2024-06-01 00:52:52] [INFO ] Added : 395 causal constraints over 79 iterations in 8037 ms. Result :sat
Minimization took 1039 ms.
[2024-06-01 00:52:54] [INFO ] [Real]Absence check using 36 positive place invariants in 21 ms returned sat
[2024-06-01 00:52:54] [INFO ] [Real]Absence check using 36 positive and 104 generalized place invariants in 47 ms returned sat
[2024-06-01 00:52:54] [INFO ] [Real]Absence check using state equation in 628 ms returned sat
[2024-06-01 00:52:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:52:55] [INFO ] [Nat]Absence check using 36 positive place invariants in 24 ms returned sat
[2024-06-01 00:52:55] [INFO ] [Nat]Absence check using 36 positive and 104 generalized place invariants in 33 ms returned sat
[2024-06-01 00:52:55] [INFO ] [Nat]Absence check using state equation in 639 ms returned sat
[2024-06-01 00:52:55] [INFO ] Computed and/alt/rep : 554/2148/554 causal constraints (skipped 783 transitions) in 113 ms.
[2024-06-01 00:52:59] [INFO ] Added : 141 causal constraints over 29 iterations in 3337 ms. Result :sat
Minimization took 913 ms.
[2024-06-01 00:53:00] [INFO ] [Real]Absence check using 36 positive place invariants in 28 ms returned sat
[2024-06-01 00:53:00] [INFO ] [Real]Absence check using 36 positive and 104 generalized place invariants in 55 ms returned sat
[2024-06-01 00:53:01] [INFO ] [Real]Absence check using state equation in 658 ms returned sat
[2024-06-01 00:53:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:53:01] [INFO ] [Nat]Absence check using 36 positive place invariants in 22 ms returned sat
[2024-06-01 00:53:01] [INFO ] [Nat]Absence check using 36 positive and 104 generalized place invariants in 41 ms returned sat
[2024-06-01 00:53:02] [INFO ] [Nat]Absence check using state equation in 672 ms returned sat
[2024-06-01 00:53:02] [INFO ] Computed and/alt/rep : 554/2148/554 causal constraints (skipped 783 transitions) in 155 ms.
[2024-06-01 00:53:11] [INFO ] Added : 368 causal constraints over 74 iterations in 9082 ms. Result :sat
Minimization took 1360 ms.
[2024-06-01 00:53:12] [INFO ] [Real]Absence check using 36 positive place invariants in 22 ms returned sat
[2024-06-01 00:53:12] [INFO ] [Real]Absence check using 36 positive and 104 generalized place invariants in 55 ms returned sat
[2024-06-01 00:53:13] [INFO ] [Real]Absence check using state equation in 766 ms returned sat
[2024-06-01 00:53:13] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:53:13] [INFO ] [Nat]Absence check using 36 positive place invariants in 21 ms returned sat
[2024-06-01 00:53:13] [INFO ] [Nat]Absence check using 36 positive and 104 generalized place invariants in 41 ms returned sat
[2024-06-01 00:53:14] [INFO ] [Nat]Absence check using state equation in 603 ms returned sat
[2024-06-01 00:53:14] [INFO ] Computed and/alt/rep : 554/2148/554 causal constraints (skipped 783 transitions) in 104 ms.
[2024-06-01 00:53:16] [INFO ] Added : 86 causal constraints over 18 iterations in 2269 ms. Result :sat
Minimization took 739 ms.
[2024-06-01 00:53:17] [INFO ] [Real]Absence check using 36 positive place invariants in 21 ms returned sat
[2024-06-01 00:53:17] [INFO ] [Real]Absence check using 36 positive and 104 generalized place invariants in 43 ms returned sat
[2024-06-01 00:53:18] [INFO ] [Real]Absence check using state equation in 606 ms returned sat
[2024-06-01 00:53:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:53:18] [INFO ] [Nat]Absence check using 36 positive place invariants in 21 ms returned sat
[2024-06-01 00:53:18] [INFO ] [Nat]Absence check using 36 positive and 104 generalized place invariants in 43 ms returned sat
[2024-06-01 00:53:19] [INFO ] [Nat]Absence check using state equation in 634 ms returned sat
[2024-06-01 00:53:19] [INFO ] Computed and/alt/rep : 554/2148/554 causal constraints (skipped 783 transitions) in 101 ms.
[2024-06-01 00:53:22] [INFO ] Added : 119 causal constraints over 24 iterations in 2565 ms. Result :sat
Minimization took 916 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 811 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 811/811 places, 1367/1367 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 811 transition count 1365
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 809 transition count 1365
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 809 transition count 1363
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 807 transition count 1363
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 806 transition count 1362
Applied a total of 10 rules in 69 ms. Remains 806 /811 variables (removed 5) and now considering 1362/1367 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 806/811 places, 1362/1367 transitions.
// Phase 1: matrix 1362 rows 806 cols
[2024-06-01 00:53:26] [INFO ] Computed 140 invariants in 22 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (12218 resets) in 3385 ms. (295 steps per ms)
FORMULA ASLink-PT-05b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 5000003 steps (11752 resets) in 7456 ms. (670 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2024-06-01 00:53:37] [INFO ] Invariant cache hit.
[2024-06-01 00:53:37] [INFO ] [Real]Absence check using 36 positive place invariants in 19 ms returned sat
[2024-06-01 00:53:37] [INFO ] [Real]Absence check using 36 positive and 104 generalized place invariants in 38 ms returned sat
[2024-06-01 00:53:38] [INFO ] [Real]Absence check using state equation in 764 ms returned sat
[2024-06-01 00:53:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:53:38] [INFO ] [Nat]Absence check using 36 positive place invariants in 31 ms returned sat
[2024-06-01 00:53:38] [INFO ] [Nat]Absence check using 36 positive and 104 generalized place invariants in 57 ms returned sat
[2024-06-01 00:53:39] [INFO ] [Nat]Absence check using state equation in 867 ms returned sat
[2024-06-01 00:53:39] [INFO ] Computed and/alt/rep : 541/2064/541 causal constraints (skipped 791 transitions) in 154 ms.
[2024-06-01 00:53:42] [INFO ] Added : 107 causal constraints over 22 iterations in 3167 ms. Result :sat
Minimization took 1296 ms.
[2024-06-01 00:53:44] [INFO ] [Real]Absence check using 36 positive place invariants in 21 ms returned sat
[2024-06-01 00:53:44] [INFO ] [Real]Absence check using 36 positive and 104 generalized place invariants in 42 ms returned sat
[2024-06-01 00:53:44] [INFO ] [Real]Absence check using state equation in 649 ms returned sat
[2024-06-01 00:53:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:53:45] [INFO ] [Nat]Absence check using 36 positive place invariants in 20 ms returned sat
[2024-06-01 00:53:45] [INFO ] [Nat]Absence check using 36 positive and 104 generalized place invariants in 54 ms returned sat
[2024-06-01 00:53:45] [INFO ] [Nat]Absence check using state equation in 744 ms returned sat
[2024-06-01 00:53:46] [INFO ] Computed and/alt/rep : 541/2064/541 causal constraints (skipped 791 transitions) in 95 ms.
[2024-06-01 00:53:58] [INFO ] Deduced a trap composed of 21 places in 234 ms of which 4 ms to minimize.
[2024-06-01 00:53:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 496 ms
[2024-06-01 00:53:59] [INFO ] Added : 421 causal constraints over 85 iterations in 13170 ms. Result :sat
Minimization took 1893 ms.
[2024-06-01 00:54:01] [INFO ] [Real]Absence check using 36 positive place invariants in 30 ms returned sat
[2024-06-01 00:54:01] [INFO ] [Real]Absence check using 36 positive and 104 generalized place invariants in 58 ms returned sat
[2024-06-01 00:54:02] [INFO ] [Real]Absence check using state equation in 770 ms returned sat
[2024-06-01 00:54:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:54:02] [INFO ] [Nat]Absence check using 36 positive place invariants in 30 ms returned sat
[2024-06-01 00:54:02] [INFO ] [Nat]Absence check using 36 positive and 104 generalized place invariants in 58 ms returned sat
[2024-06-01 00:54:03] [INFO ] [Nat]Absence check using state equation in 850 ms returned sat
[2024-06-01 00:54:03] [INFO ] Computed and/alt/rep : 541/2064/541 causal constraints (skipped 791 transitions) in 152 ms.
[2024-06-01 00:54:08] [INFO ] Added : 160 causal constraints over 32 iterations in 5557 ms. Result :sat
Minimization took 1199 ms.
[2024-06-01 00:54:10] [INFO ] [Real]Absence check using 36 positive place invariants in 18 ms returned sat
[2024-06-01 00:54:10] [INFO ] [Real]Absence check using 36 positive and 104 generalized place invariants in 36 ms returned sat
[2024-06-01 00:54:11] [INFO ] [Real]Absence check using state equation in 857 ms returned sat
[2024-06-01 00:54:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:54:11] [INFO ] [Nat]Absence check using 36 positive place invariants in 30 ms returned sat
[2024-06-01 00:54:11] [INFO ] [Nat]Absence check using 36 positive and 104 generalized place invariants in 57 ms returned sat
[2024-06-01 00:54:12] [INFO ] [Nat]Absence check using state equation in 937 ms returned sat
[2024-06-01 00:54:12] [INFO ] Computed and/alt/rep : 541/2064/541 causal constraints (skipped 791 transitions) in 102 ms.
[2024-06-01 00:54:23] [INFO ] Added : 405 causal constraints over 81 iterations in 10409 ms. Result :sat
Minimization took 1377 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 806 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 806/806 places, 1362/1362 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 806 transition count 1361
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 805 transition count 1361
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 804 transition count 1360
Applied a total of 4 rules in 92 ms. Remains 804 /806 variables (removed 2) and now considering 1360/1362 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 804/806 places, 1360/1362 transitions.
// Phase 1: matrix 1360 rows 804 cols
[2024-06-01 00:54:31] [INFO ] Computed 140 invariants in 29 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (11983 resets) in 3430 ms. (291 steps per ms)
FORMULA ASLink-PT-05b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 3000002 steps (7034 resets) in 5008 ms. (598 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-06-01 00:54:39] [INFO ] Invariant cache hit.
[2024-06-01 00:54:40] [INFO ] [Real]Absence check using 36 positive place invariants in 18 ms returned sat
[2024-06-01 00:54:40] [INFO ] [Real]Absence check using 36 positive and 104 generalized place invariants in 38 ms returned sat
[2024-06-01 00:54:40] [INFO ] [Real]Absence check using state equation in 568 ms returned sat
[2024-06-01 00:54:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:54:40] [INFO ] [Nat]Absence check using 36 positive place invariants in 19 ms returned sat
[2024-06-01 00:54:40] [INFO ] [Nat]Absence check using 36 positive and 104 generalized place invariants in 37 ms returned sat
[2024-06-01 00:54:41] [INFO ] [Nat]Absence check using state equation in 747 ms returned sat
[2024-06-01 00:54:41] [INFO ] Computed and/alt/rep : 539/2062/539 causal constraints (skipped 791 transitions) in 95 ms.
[2024-06-01 00:54:52] [INFO ] Deduced a trap composed of 33 places in 122 ms of which 2 ms to minimize.
[2024-06-01 00:54:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 302 ms
[2024-06-01 00:54:52] [INFO ] Added : 413 causal constraints over 84 iterations in 10725 ms. Result :sat
Minimization took 1293 ms.
[2024-06-01 00:54:54] [INFO ] [Real]Absence check using 36 positive place invariants in 18 ms returned sat
[2024-06-01 00:54:54] [INFO ] [Real]Absence check using 36 positive and 104 generalized place invariants in 30 ms returned sat
[2024-06-01 00:54:54] [INFO ] [Real]Absence check using state equation in 749 ms returned sat
[2024-06-01 00:54:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:54:54] [INFO ] [Nat]Absence check using 36 positive place invariants in 19 ms returned sat
[2024-06-01 00:54:55] [INFO ] [Nat]Absence check using 36 positive and 104 generalized place invariants in 39 ms returned sat
[2024-06-01 00:54:55] [INFO ] [Nat]Absence check using state equation in 634 ms returned sat
[2024-06-01 00:54:55] [INFO ] Computed and/alt/rep : 539/2062/539 causal constraints (skipped 791 transitions) in 149 ms.
[2024-06-01 00:55:05] [INFO ] Added : 386 causal constraints over 78 iterations in 9417 ms. Result :sat
Minimization took 1085 ms.
[2024-06-01 00:55:06] [INFO ] [Real]Absence check using 36 positive place invariants in 31 ms returned sat
[2024-06-01 00:55:06] [INFO ] [Real]Absence check using 36 positive and 104 generalized place invariants in 59 ms returned sat
[2024-06-01 00:55:07] [INFO ] [Real]Absence check using state equation in 873 ms returned sat
[2024-06-01 00:55:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:55:07] [INFO ] [Nat]Absence check using 36 positive place invariants in 32 ms returned sat
[2024-06-01 00:55:07] [INFO ] [Nat]Absence check using 36 positive and 104 generalized place invariants in 59 ms returned sat
[2024-06-01 00:55:08] [INFO ] [Nat]Absence check using state equation in 809 ms returned sat
[2024-06-01 00:55:08] [INFO ] Computed and/alt/rep : 539/2062/539 causal constraints (skipped 791 transitions) in 95 ms.
[2024-06-01 00:55:12] [INFO ] Added : 126 causal constraints over 26 iterations in 4103 ms. Result :sat
Minimization took 1267 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 804 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 804/804 places, 1360/1360 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 804 transition count 1359
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 803 transition count 1359
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 803 transition count 1358
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 802 transition count 1358
Applied a total of 4 rules in 42 ms. Remains 802 /804 variables (removed 2) and now considering 1358/1360 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 802/804 places, 1358/1360 transitions.
// Phase 1: matrix 1358 rows 802 cols
[2024-06-01 00:55:16] [INFO ] Computed 140 invariants in 20 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (12274 resets) in 3265 ms. (306 steps per ms)
BEST_FIRST walk for 3000002 steps (7023 resets) in 4068 ms. (737 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-06-01 00:55:23] [INFO ] Invariant cache hit.
[2024-06-01 00:55:24] [INFO ] [Real]Absence check using 37 positive place invariants in 20 ms returned sat
[2024-06-01 00:55:24] [INFO ] [Real]Absence check using 37 positive and 103 generalized place invariants in 36 ms returned sat
[2024-06-01 00:55:24] [INFO ] [Real]Absence check using state equation in 795 ms returned sat
[2024-06-01 00:55:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:55:25] [INFO ] [Nat]Absence check using 37 positive place invariants in 21 ms returned sat
[2024-06-01 00:55:25] [INFO ] [Nat]Absence check using 37 positive and 103 generalized place invariants in 38 ms returned sat
[2024-06-01 00:55:25] [INFO ] [Nat]Absence check using state equation in 793 ms returned sat
[2024-06-01 00:55:26] [INFO ] Computed and/alt/rep : 537/2060/537 causal constraints (skipped 791 transitions) in 99 ms.
[2024-06-01 00:55:38] [INFO ] Added : 433 causal constraints over 87 iterations in 12757 ms. Result :sat
Minimization took 1155 ms.
[2024-06-01 00:55:40] [INFO ] [Real]Absence check using 37 positive place invariants in 20 ms returned sat
[2024-06-01 00:55:40] [INFO ] [Real]Absence check using 37 positive and 103 generalized place invariants in 39 ms returned sat
[2024-06-01 00:55:40] [INFO ] [Real]Absence check using state equation in 541 ms returned sat
[2024-06-01 00:55:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:55:40] [INFO ] [Nat]Absence check using 37 positive place invariants in 20 ms returned sat
[2024-06-01 00:55:40] [INFO ] [Nat]Absence check using 37 positive and 103 generalized place invariants in 37 ms returned sat
[2024-06-01 00:55:41] [INFO ] [Nat]Absence check using state equation in 605 ms returned sat
[2024-06-01 00:55:41] [INFO ] Computed and/alt/rep : 537/2060/537 causal constraints (skipped 791 transitions) in 100 ms.
[2024-06-01 00:55:53] [INFO ] Added : 399 causal constraints over 80 iterations in 11474 ms. Result :sat
Minimization took 1263 ms.
[2024-06-01 00:55:54] [INFO ] [Real]Absence check using 37 positive place invariants in 21 ms returned sat
[2024-06-01 00:55:54] [INFO ] [Real]Absence check using 37 positive and 103 generalized place invariants in 36 ms returned sat
[2024-06-01 00:55:55] [INFO ] [Real]Absence check using state equation in 933 ms returned sat
[2024-06-01 00:55:55] [INFO ] Computed and/alt/rep : 537/2060/537 causal constraints (skipped 791 transitions) in 157 ms.
[2024-06-01 00:55:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:55:56] [INFO ] [Nat]Absence check using 37 positive place invariants in 31 ms returned sat
[2024-06-01 00:55:56] [INFO ] [Nat]Absence check using 37 positive and 103 generalized place invariants in 60 ms returned sat
[2024-06-01 00:55:57] [INFO ] [Nat]Absence check using state equation in 1030 ms returned sat
[2024-06-01 00:55:57] [INFO ] Computed and/alt/rep : 537/2060/537 causal constraints (skipped 791 transitions) in 101 ms.
[2024-06-01 00:56:09] [INFO ] Added : 404 causal constraints over 81 iterations in 11821 ms. Result :sat
Minimization took 1280 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 802/802 places, 1358/1358 transitions.
Applied a total of 0 rules in 29 ms. Remains 802 /802 variables (removed 0) and now considering 1358/1358 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 802/802 places, 1358/1358 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 802/802 places, 1358/1358 transitions.
Applied a total of 0 rules in 27 ms. Remains 802 /802 variables (removed 0) and now considering 1358/1358 (removed 0) transitions.
[2024-06-01 00:56:13] [INFO ] Invariant cache hit.
[2024-06-01 00:56:14] [INFO ] Implicit Places using invariants in 1034 ms returned [1, 18, 19, 50, 68, 87, 136, 141, 150, 151, 153, 170, 188, 258, 262, 263, 274, 275, 277, 294, 312, 381, 385, 386, 397, 398, 400, 417, 435, 505, 509, 510, 521, 522, 524, 541, 559, 628, 632, 633, 636, 647, 648, 649, 667, 669, 673, 691, 692, 693, 694, 706, 712, 718, 724, 730, 736, 742, 748, 754, 760, 766]
[2024-06-01 00:56:14] [INFO ] Actually due to overlaps returned [667, 649, 50, 170, 294, 417, 541, 673, 153, 277, 400, 524, 150, 274, 397, 521, 647, 691, 151, 275, 398, 522, 648, 669, 692, 1, 18, 262, 263, 385, 386, 509, 510, 632, 633, 188, 312, 435, 559, 693, 736, 754, 766, 19, 68, 87, 136, 636, 694, 706, 712, 718, 724, 730, 742, 748, 760]
Discarding 57 places :
Implicit Place search using SMT only with invariants took 1039 ms to find 57 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 745/802 places, 1358/1358 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 0 with 106 rules applied. Total rules applied 106 place count 741 transition count 1256
Reduce places removed 102 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 107 rules applied. Total rules applied 213 place count 639 transition count 1251
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 214 place count 638 transition count 1251
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 214 place count 638 transition count 1222
Deduced a syphon composed of 29 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 59 rules applied. Total rules applied 273 place count 608 transition count 1222
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 285 place count 604 transition count 1214
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 293 place count 596 transition count 1214
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 308 place count 581 transition count 1199
Iterating global reduction 5 with 15 rules applied. Total rules applied 323 place count 581 transition count 1199
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 326 place count 581 transition count 1196
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 326 place count 581 transition count 1195
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 328 place count 580 transition count 1195
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 331 place count 577 transition count 1189
Iterating global reduction 6 with 3 rules applied. Total rules applied 334 place count 577 transition count 1189
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 335 place count 576 transition count 1188
Iterating global reduction 6 with 1 rules applied. Total rules applied 336 place count 576 transition count 1188
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 337 place count 575 transition count 1186
Iterating global reduction 6 with 1 rules applied. Total rules applied 338 place count 575 transition count 1186
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 6 with 80 rules applied. Total rules applied 418 place count 535 transition count 1146
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 423 place count 530 transition count 1140
Iterating global reduction 6 with 5 rules applied. Total rules applied 428 place count 530 transition count 1140
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 432 place count 530 transition count 1136
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 436 place count 528 transition count 1137
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 437 place count 528 transition count 1136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 438 place count 527 transition count 1136
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 8 with 10 rules applied. Total rules applied 448 place count 527 transition count 1126
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 459 place count 516 transition count 1126
Partial Free-agglomeration rule applied 15 times.
Drop transitions (Partial Free agglomeration) removed 15 transitions
Iterating global reduction 9 with 15 rules applied. Total rules applied 474 place count 516 transition count 1126
Applied a total of 474 rules in 274 ms. Remains 516 /745 variables (removed 229) and now considering 1126/1358 (removed 232) transitions.
// Phase 1: matrix 1126 rows 516 cols
[2024-06-01 00:56:15] [INFO ] Computed 73 invariants in 12 ms
[2024-06-01 00:56:15] [INFO ] Implicit Places using invariants in 602 ms returned [95, 101, 104, 106, 107, 110, 111, 163, 182, 188, 191, 193, 198, 199, 251, 268, 274, 277, 279, 284, 285, 337, 355, 361, 364, 366, 371, 372, 424, 441, 447, 450, 452]
[2024-06-01 00:56:15] [INFO ] Actually due to overlaps returned [110, 198, 284, 371, 111, 199, 285, 372, 95, 101, 106, 182, 188, 193, 268, 274, 279, 355, 361, 366, 441, 447, 452, 107, 163, 251, 337, 424]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 606 ms to find 28 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 488/802 places, 1126/1358 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 468 transition count 1106
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 468 transition count 1106
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 463 transition count 1101
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 463 transition count 1101
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 68 place count 454 transition count 1092
Free-agglomeration rule applied 15 times.
Iterating global reduction 0 with 15 rules applied. Total rules applied 83 place count 454 transition count 1077
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 98 place count 439 transition count 1077
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 102 place count 439 transition count 1073
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 106 place count 435 transition count 1073
Applied a total of 106 rules in 149 ms. Remains 435 /488 variables (removed 53) and now considering 1073/1126 (removed 53) transitions.
// Phase 1: matrix 1073 rows 435 cols
[2024-06-01 00:56:15] [INFO ] Computed 45 invariants in 16 ms
[2024-06-01 00:56:16] [INFO ] Implicit Places using invariants in 692 ms returned []
[2024-06-01 00:56:16] [INFO ] Invariant cache hit.
[2024-06-01 00:56:17] [INFO ] Implicit Places using invariants and state equation in 1411 ms returned []
Implicit Place search using SMT with State Equation took 2107 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 435/802 places, 1073/1358 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 4205 ms. Remains : 435/802 places, 1073/1358 transitions.
[2024-06-01 00:56:17] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (18466 resets) in 3145 ms. (317 steps per ms)
BEST_FIRST walk for 3000003 steps (13503 resets) in 2960 ms. (1013 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-06-01 00:56:24] [INFO ] Invariant cache hit.
[2024-06-01 00:56:24] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2024-06-01 00:56:24] [INFO ] [Real]Absence check using 10 positive and 35 generalized place invariants in 16 ms returned sat
[2024-06-01 00:56:24] [INFO ] [Real]Absence check using state equation in 572 ms returned sat
[2024-06-01 00:56:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:56:24] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2024-06-01 00:56:24] [INFO ] [Nat]Absence check using 10 positive and 35 generalized place invariants in 26 ms returned sat
[2024-06-01 00:56:25] [INFO ] [Nat]Absence check using state equation in 511 ms returned sat
[2024-06-01 00:56:25] [INFO ] Computed and/alt/rep : 242/1146/242 causal constraints (skipped 802 transitions) in 116 ms.
[2024-06-01 00:56:25] [INFO ] Added : 9 causal constraints over 3 iterations in 543 ms. Result :sat
Minimization took 933 ms.
[2024-06-01 00:56:27] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2024-06-01 00:56:27] [INFO ] [Real]Absence check using 10 positive and 35 generalized place invariants in 19 ms returned sat
[2024-06-01 00:56:27] [INFO ] [Real]Absence check using state equation in 602 ms returned sat
[2024-06-01 00:56:27] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:56:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-06-01 00:56:27] [INFO ] [Nat]Absence check using 10 positive and 35 generalized place invariants in 17 ms returned sat
[2024-06-01 00:56:28] [INFO ] [Nat]Absence check using state equation in 463 ms returned sat
[2024-06-01 00:56:28] [INFO ] Computed and/alt/rep : 242/1146/242 causal constraints (skipped 802 transitions) in 133 ms.
[2024-06-01 00:56:29] [INFO ] Added : 43 causal constraints over 9 iterations in 1271 ms. Result :sat
Minimization took 993 ms.
[2024-06-01 00:56:30] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2024-06-01 00:56:30] [INFO ] [Real]Absence check using 10 positive and 35 generalized place invariants in 18 ms returned sat
[2024-06-01 00:56:31] [INFO ] [Real]Absence check using state equation in 369 ms returned sat
[2024-06-01 00:56:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:56:31] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2024-06-01 00:56:31] [INFO ] [Nat]Absence check using 10 positive and 35 generalized place invariants in 22 ms returned sat
[2024-06-01 00:56:31] [INFO ] [Nat]Absence check using state equation in 469 ms returned sat
[2024-06-01 00:56:31] [INFO ] Computed and/alt/rep : 242/1146/242 causal constraints (skipped 802 transitions) in 105 ms.
[2024-06-01 00:56:32] [INFO ] Added : 27 causal constraints over 6 iterations in 676 ms. Result :sat
Minimization took 984 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 435 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 435/435 places, 1073/1073 transitions.
Applied a total of 0 rules in 24 ms. Remains 435 /435 variables (removed 0) and now considering 1073/1073 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 435/435 places, 1073/1073 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 435/435 places, 1073/1073 transitions.
Applied a total of 0 rules in 14 ms. Remains 435 /435 variables (removed 0) and now considering 1073/1073 (removed 0) transitions.
[2024-06-01 00:56:34] [INFO ] Invariant cache hit.
[2024-06-01 00:56:34] [INFO ] Implicit Places using invariants in 504 ms returned []
[2024-06-01 00:56:34] [INFO ] Invariant cache hit.
[2024-06-01 00:56:35] [INFO ] Implicit Places using invariants and state equation in 1302 ms returned []
Implicit Place search using SMT with State Equation took 1807 ms to find 0 implicit places.
[2024-06-01 00:56:36] [INFO ] Redundant transitions in 135 ms returned []
Running 1044 sub problems to find dead transitions.
[2024-06-01 00:56:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1044 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 32/39 constraints. Problems are: Problem set: 0 solved, 1044 unsolved
[2024-06-01 00:56:52] [INFO ] Deduced a trap composed of 35 places in 143 ms of which 2 ms to minimize.
[2024-06-01 00:56:59] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 2 ms to minimize.
Problem TDEAD411 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD418 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 434/1508 variables, and 41 constraints, problems are : Problem set: 4 solved, 1040 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 7/10 constraints, Generalized P Invariants (flows): 32/35 constraints, State Equation: 0/435 constraints, PredecessorRefiner: 1044/1044 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 4 solved, 1040 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 7/7 constraints. Problems are: Problem set: 4 solved, 1040 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 32/39 constraints. Problems are: Problem set: 4 solved, 1040 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 2/41 constraints. Problems are: Problem set: 4 solved, 1040 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/434 variables, 0/41 constraints. Problems are: Problem set: 4 solved, 1040 unsolved
At refinement iteration 4 (OVERLAPS) 1/435 variables, 3/44 constraints. Problems are: Problem set: 4 solved, 1040 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/435 variables, 3/47 constraints. Problems are: Problem set: 4 solved, 1040 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 435/1508 variables, and 47 constraints, problems are : Problem set: 4 solved, 1040 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 0/435 constraints, PredecessorRefiner: 0/1044 constraints, Known Traps: 2/2 constraints]
After SMT, in 61173ms problems are : Problem set: 4 solved, 1040 unsolved
Search for dead transitions found 4 dead transitions in 61225ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 435/435 places, 1069/1073 transitions.
Applied a total of 0 rules in 24 ms. Remains 435 /435 variables (removed 0) and now considering 1069/1069 (removed 0) transitions.
[2024-06-01 00:57:37] [INFO ] Redundant transitions in 34 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 63285 ms. Remains : 435/435 places, 1069/1073 transitions.
// Phase 1: matrix 1069 rows 435 cols
[2024-06-01 00:57:37] [INFO ] Computed 45 invariants in 19 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (18578 resets) in 2646 ms. (377 steps per ms)
BEST_FIRST walk for 3000000 steps (13462 resets) in 2786 ms. (1076 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-06-01 00:57:42] [INFO ] Invariant cache hit.
[2024-06-01 00:57:42] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2024-06-01 00:57:42] [INFO ] [Real]Absence check using 10 positive and 35 generalized place invariants in 24 ms returned sat
[2024-06-01 00:57:43] [INFO ] [Real]Absence check using state equation in 510 ms returned sat
[2024-06-01 00:57:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:57:43] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2024-06-01 00:57:43] [INFO ] [Nat]Absence check using 10 positive and 35 generalized place invariants in 21 ms returned sat
[2024-06-01 00:57:44] [INFO ] [Nat]Absence check using state equation in 443 ms returned sat
[2024-06-01 00:57:44] [INFO ] Computed and/alt/rep : 241/1164/241 causal constraints (skipped 799 transitions) in 124 ms.
[2024-06-01 00:57:45] [INFO ] Added : 25 causal constraints over 6 iterations in 865 ms. Result :sat
Minimization took 1085 ms.
[2024-06-01 00:57:46] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2024-06-01 00:57:46] [INFO ] [Real]Absence check using 10 positive and 35 generalized place invariants in 21 ms returned sat
[2024-06-01 00:57:46] [INFO ] [Real]Absence check using state equation in 590 ms returned sat
[2024-06-01 00:57:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:57:47] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned sat
[2024-06-01 00:57:47] [INFO ] [Nat]Absence check using 10 positive and 35 generalized place invariants in 25 ms returned sat
[2024-06-01 00:57:47] [INFO ] [Nat]Absence check using state equation in 556 ms returned sat
[2024-06-01 00:57:47] [INFO ] Computed and/alt/rep : 241/1164/241 causal constraints (skipped 799 transitions) in 107 ms.
[2024-06-01 00:57:48] [INFO ] Added : 21 causal constraints over 5 iterations in 684 ms. Result :sat
Minimization took 1032 ms.
[2024-06-01 00:57:49] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2024-06-01 00:57:49] [INFO ] [Real]Absence check using 10 positive and 35 generalized place invariants in 23 ms returned sat
[2024-06-01 00:57:50] [INFO ] [Real]Absence check using state equation in 530 ms returned sat
[2024-06-01 00:57:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:57:50] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2024-06-01 00:57:50] [INFO ] [Nat]Absence check using 10 positive and 35 generalized place invariants in 19 ms returned sat
[2024-06-01 00:57:50] [INFO ] [Nat]Absence check using state equation in 500 ms returned sat
[2024-06-01 00:57:51] [INFO ] Computed and/alt/rep : 241/1164/241 causal constraints (skipped 799 transitions) in 133 ms.
[2024-06-01 00:57:51] [INFO ] Added : 27 causal constraints over 6 iterations in 819 ms. Result :sat
Minimization took 1122 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 435 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 435/435 places, 1069/1069 transitions.
Applied a total of 0 rules in 22 ms. Remains 435 /435 variables (removed 0) and now considering 1069/1069 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 435/435 places, 1069/1069 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 435/435 places, 1069/1069 transitions.
Applied a total of 0 rules in 33 ms. Remains 435 /435 variables (removed 0) and now considering 1069/1069 (removed 0) transitions.
[2024-06-01 00:57:53] [INFO ] Invariant cache hit.
[2024-06-01 00:57:54] [INFO ] Implicit Places using invariants in 831 ms returned []
[2024-06-01 00:57:54] [INFO ] Invariant cache hit.
[2024-06-01 00:57:56] [INFO ] Implicit Places using invariants and state equation in 1967 ms returned []
Implicit Place search using SMT with State Equation took 2800 ms to find 0 implicit places.
[2024-06-01 00:57:56] [INFO ] Redundant transitions in 22 ms returned []
Running 1040 sub problems to find dead transitions.
[2024-06-01 00:57:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1040 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 32/39 constraints. Problems are: Problem set: 0 solved, 1040 unsolved
[2024-06-01 00:58:13] [INFO ] Deduced a trap composed of 31 places in 188 ms of which 2 ms to minimize.
[2024-06-01 00:58:18] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 434/1504 variables, and 41 constraints, problems are : Problem set: 0 solved, 1040 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 7/10 constraints, Generalized P Invariants (flows): 32/35 constraints, State Equation: 0/435 constraints, PredecessorRefiner: 1040/1040 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1040 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1040 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 32/39 constraints. Problems are: Problem set: 0 solved, 1040 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 1040 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/434 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1040 unsolved
At refinement iteration 4 (OVERLAPS) 1/435 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 1040 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/435 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 1040 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 435/1504 variables, and 47 constraints, problems are : Problem set: 0 solved, 1040 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 0/435 constraints, PredecessorRefiner: 0/1040 constraints, Known Traps: 2/2 constraints]
After SMT, in 60777ms problems are : Problem set: 0 solved, 1040 unsolved
Search for dead transitions found 0 dead transitions in 60799ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63668 ms. Remains : 435/435 places, 1069/1069 transitions.
RANDOM walk for 40000 steps (739 resets) in 1549 ms. (25 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (177 resets) in 300 ms. (132 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (175 resets) in 491 ms. (81 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (177 resets) in 345 ms. (115 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (183 resets) in 317 ms. (125 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (177 resets) in 141 ms. (281 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (179 resets) in 213 ms. (186 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 155246 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :0 out of 6
Probabilistic random walk after 155246 steps, saw 72246 distinct states, run finished after 3006 ms. (steps per millisecond=51 ) properties seen :0
[2024-06-01 00:59:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 214/217 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 10/227 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 125/352 variables, 12/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 34/386 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 00:59:02] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 49/435 variables, 9/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/435 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 1069/1504 variables, 435/481 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1504 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/1504 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1504/1504 variables, and 481 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1765 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 435/435 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 214/217 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 10/227 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 125/352 variables, 12/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 34/386 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 49/435 variables, 9/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/435 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 1069/1504 variables, 435/481 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1504 variables, 6/487 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1504 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/1504 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1504/1504 variables, and 487 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1713 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 435/435 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 3489ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1278 ms.
Support contains 3 out of 435 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 435/435 places, 1069/1069 transitions.
Applied a total of 0 rules in 14 ms. Remains 435 /435 variables (removed 0) and now considering 1069/1069 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 435/435 places, 1069/1069 transitions.
RANDOM walk for 40000 steps (741 resets) in 414 ms. (96 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (179 resets) in 117 ms. (339 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (183 resets) in 119 ms. (333 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (186 resets) in 113 ms. (350 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (182 resets) in 130 ms. (305 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (183 resets) in 120 ms. (330 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (182 resets) in 213 ms. (186 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 177127 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :0 out of 6
Probabilistic random walk after 177127 steps, saw 87552 distinct states, run finished after 3004 ms. (steps per millisecond=58 ) properties seen :0
[2024-06-01 00:59:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 214/217 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 10/227 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 125/352 variables, 12/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 34/386 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 00:59:10] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 49/435 variables, 9/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/435 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 1069/1504 variables, 435/481 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1504 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/1504 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1504/1504 variables, and 481 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1957 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 435/435 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 214/217 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 10/227 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 125/352 variables, 12/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 34/386 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 49/435 variables, 9/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/435 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 1069/1504 variables, 435/481 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1504 variables, 6/487 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1504 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/1504 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1504/1504 variables, and 487 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1489 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 435/435 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 3461ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1381 ms.
Support contains 3 out of 435 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 435/435 places, 1069/1069 transitions.
Applied a total of 0 rules in 21 ms. Remains 435 /435 variables (removed 0) and now considering 1069/1069 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 435/435 places, 1069/1069 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 435/435 places, 1069/1069 transitions.
Applied a total of 0 rules in 14 ms. Remains 435 /435 variables (removed 0) and now considering 1069/1069 (removed 0) transitions.
[2024-06-01 00:59:15] [INFO ] Invariant cache hit.
[2024-06-01 00:59:15] [INFO ] Implicit Places using invariants in 573 ms returned []
[2024-06-01 00:59:15] [INFO ] Invariant cache hit.
[2024-06-01 00:59:17] [INFO ] Implicit Places using invariants and state equation in 1905 ms returned []
Implicit Place search using SMT with State Equation took 2481 ms to find 0 implicit places.
[2024-06-01 00:59:17] [INFO ] Redundant transitions in 22 ms returned []
Running 1040 sub problems to find dead transitions.
[2024-06-01 00:59:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1040 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 32/39 constraints. Problems are: Problem set: 0 solved, 1040 unsolved
[2024-06-01 00:59:33] [INFO ] Deduced a trap composed of 31 places in 194 ms of which 3 ms to minimize.
[2024-06-01 00:59:40] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 434/1504 variables, and 41 constraints, problems are : Problem set: 0 solved, 1040 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 7/10 constraints, Generalized P Invariants (flows): 32/35 constraints, State Equation: 0/435 constraints, PredecessorRefiner: 1040/1040 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1040 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1040 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 32/39 constraints. Problems are: Problem set: 0 solved, 1040 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 1040 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/434 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1040 unsolved
At refinement iteration 4 (OVERLAPS) 1/435 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 1040 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/435 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 1040 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 435/1504 variables, and 47 constraints, problems are : Problem set: 0 solved, 1040 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 0/435 constraints, PredecessorRefiner: 0/1040 constraints, Known Traps: 2/2 constraints]
After SMT, in 61079ms problems are : Problem set: 0 solved, 1040 unsolved
Search for dead transitions found 0 dead transitions in 61103ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63641 ms. Remains : 435/435 places, 1069/1069 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 24 ms. Remains 435 /435 variables (removed 0) and now considering 1069/1069 (removed 0) transitions.
Running SMT prover for 6 properties.
[2024-06-01 01:00:18] [INFO ] Invariant cache hit.
[2024-06-01 01:00:18] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 01:00:19] [INFO ] [Real]Absence check using 10 positive and 35 generalized place invariants in 35 ms returned sat
[2024-06-01 01:00:19] [INFO ] After 1096ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-06-01 01:00:20] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 01:00:20] [INFO ] [Nat]Absence check using 10 positive and 35 generalized place invariants in 23 ms returned sat
[2024-06-01 01:00:21] [INFO ] After 1011ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-06-01 01:00:21] [INFO ] After 1593ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-06-01 01:00:22] [INFO ] After 2182ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 3337 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Starting property specific reduction for ASLink-PT-05b-UpperBounds-01
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:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2024-06-01 01:00:22] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (176 resets) in 29 ms. (333 steps per ms)
BEST_FIRST walk for 10001 steps (41 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 01:00:22] [INFO ] Invariant cache hit.
[2024-06-01 01:00:22] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2024-06-01 01:00:22] [INFO ] [Real]Absence check using 10 positive and 35 generalized place invariants in 20 ms returned sat
[2024-06-01 01:00:22] [INFO ] [Real]Absence check using state equation in 398 ms returned sat
[2024-06-01 01:00:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:00:22] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2024-06-01 01:00:22] [INFO ] [Nat]Absence check using 10 positive and 35 generalized place invariants in 19 ms returned sat
[2024-06-01 01:00:23] [INFO ] [Nat]Absence check using state equation in 410 ms returned sat
[2024-06-01 01:00:23] [INFO ] Computed and/alt/rep : 241/1164/241 causal constraints (skipped 799 transitions) in 109 ms.
[2024-06-01 01:00:24] [INFO ] Added : 25 causal constraints over 6 iterations in 867 ms. Result :sat
Minimization took 506 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 435 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p1429) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 435/435 places, 1068/1068 transitions.
Reduce places removed 1 places and 1 transitions.
Graph (complete) has 2639 edges and 434 vertex of which 433 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 433 transition count 1066
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 432 transition count 1066
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 432 transition count 1064
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 430 transition count 1064
Applied a total of 8 rules in 26 ms. Remains 430 /435 variables (removed 5) and now considering 1064/1068 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 430/435 places, 1064/1068 transitions.
// Phase 1: matrix 1064 rows 430 cols
[2024-06-01 01:00:24] [INFO ] Computed 44 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (18526 resets) in 2502 ms. (399 steps per ms)
BEST_FIRST walk for 1000000 steps (4485 resets) in 954 ms. (1047 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 01:00:28] [INFO ] Invariant cache hit.
[2024-06-01 01:00:28] [INFO ] [Real]Absence check using 12 positive place invariants in 12 ms returned sat
[2024-06-01 01:00:28] [INFO ] [Real]Absence check using 12 positive and 32 generalized place invariants in 21 ms returned sat
[2024-06-01 01:00:28] [INFO ] [Real]Absence check using state equation in 524 ms returned sat
[2024-06-01 01:00:28] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:00:28] [INFO ] [Nat]Absence check using 12 positive place invariants in 14 ms returned sat
[2024-06-01 01:00:29] [INFO ] [Nat]Absence check using 12 positive and 32 generalized place invariants in 21 ms returned sat
[2024-06-01 01:00:29] [INFO ] [Nat]Absence check using state equation in 506 ms returned sat
[2024-06-01 01:00:29] [INFO ] Computed and/alt/rep : 236/1157/236 causal constraints (skipped 799 transitions) in 128 ms.
[2024-06-01 01:00:30] [INFO ] Added : 29 causal constraints over 6 iterations in 917 ms. Result :sat
Minimization took 685 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 430 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 430/430 places, 1064/1064 transitions.
Applied a total of 0 rules in 23 ms. Remains 430 /430 variables (removed 0) and now considering 1064/1064 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 430/430 places, 1064/1064 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 430/430 places, 1064/1064 transitions.
Applied a total of 0 rules in 22 ms. Remains 430 /430 variables (removed 0) and now considering 1064/1064 (removed 0) transitions.
[2024-06-01 01:00:31] [INFO ] Invariant cache hit.
[2024-06-01 01:00:32] [INFO ] Implicit Places using invariants in 847 ms returned []
[2024-06-01 01:00:32] [INFO ] Invariant cache hit.
[2024-06-01 01:00:34] [INFO ] Implicit Places using invariants and state equation in 1967 ms returned []
Implicit Place search using SMT with State Equation took 2816 ms to find 0 implicit places.
[2024-06-01 01:00:34] [INFO ] Redundant transitions in 22 ms returned []
Running 1035 sub problems to find dead transitions.
[2024-06-01 01:00:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/428 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/428 variables, 30/37 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
[2024-06-01 01:01:02] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 428/1494 variables, and 38 constraints, problems are : Problem set: 0 solved, 1035 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 7/12 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/430 constraints, PredecessorRefiner: 1035/1035 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1035 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/428 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/428 variables, 30/37 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/428 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/428 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
At refinement iteration 4 (OVERLAPS) 2/430 variables, 5/43 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/430 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/1494 variables, and 45 constraints, problems are : Problem set: 0 solved, 1035 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 0/430 constraints, PredecessorRefiner: 0/1035 constraints, Known Traps: 1/1 constraints]
After SMT, in 60923ms problems are : Problem set: 0 solved, 1035 unsolved
Search for dead transitions found 0 dead transitions in 60944ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63814 ms. Remains : 430/430 places, 1064/1064 transitions.
RANDOM walk for 40000 steps (759 resets) in 240 ms. (165 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (177 resets) in 73 ms. (540 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (174 resets) in 73 ms. (540 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 239963 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :0 out of 2
Probabilistic random walk after 239963 steps, saw 130435 distinct states, run finished after 3001 ms. (steps per millisecond=79 ) properties seen :0
[2024-06-01 01:01:38] [INFO ] Invariant cache hit.
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) 35/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/47 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/50 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 148/198 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 55/253 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/253 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 129/382 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/382 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 4/386 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/386 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 43/429 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/429 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1064/1493 variables, 429/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1493 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/1494 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1494 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/1494 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1494/1494 variables, and 474 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1026 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 430/430 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
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) 35/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/47 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/50 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 148/198 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 55/253 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/253 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 129/382 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/382 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 4/386 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/386 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 43/429 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/429 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1064/1493 variables, 429/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1493 variables, 2/475 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1493 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/1494 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1494 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/1494 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1494/1494 variables, and 476 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1059 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 430/430 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 2111ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 189 ms.
Support contains 1 out of 430 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 430/430 places, 1064/1064 transitions.
Applied a total of 0 rules in 19 ms. Remains 430 /430 variables (removed 0) and now considering 1064/1064 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 430/430 places, 1064/1064 transitions.
RANDOM walk for 40000 steps (795 resets) in 232 ms. (171 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (175 resets) in 91 ms. (434 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (174 resets) in 97 ms. (408 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 241840 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :0 out of 2
Probabilistic random walk after 241840 steps, saw 131166 distinct states, run finished after 3001 ms. (steps per millisecond=80 ) properties seen :0
[2024-06-01 01:01:44] [INFO ] Invariant cache hit.
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) 35/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/47 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/50 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 148/198 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 55/253 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/253 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 129/382 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/382 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 4/386 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/386 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 43/429 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/429 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1064/1493 variables, 429/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1493 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/1494 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1494 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/1494 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1494/1494 variables, and 474 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1056 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 430/430 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
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) 35/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/47 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/50 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 148/198 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 55/253 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/253 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 129/382 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/382 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 4/386 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/386 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 43/429 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/429 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1064/1493 variables, 429/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1493 variables, 2/475 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1493 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/1494 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1494 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/1494 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1494/1494 variables, and 476 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1042 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 430/430 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 2121ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 206 ms.
Support contains 1 out of 430 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 430/430 places, 1064/1064 transitions.
Applied a total of 0 rules in 13 ms. Remains 430 /430 variables (removed 0) and now considering 1064/1064 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 430/430 places, 1064/1064 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 430/430 places, 1064/1064 transitions.
Applied a total of 0 rules in 14 ms. Remains 430 /430 variables (removed 0) and now considering 1064/1064 (removed 0) transitions.
[2024-06-01 01:01:46] [INFO ] Invariant cache hit.
[2024-06-01 01:01:47] [INFO ] Implicit Places using invariants in 515 ms returned []
[2024-06-01 01:01:47] [INFO ] Invariant cache hit.
[2024-06-01 01:01:48] [INFO ] Implicit Places using invariants and state equation in 1759 ms returned []
Implicit Place search using SMT with State Equation took 2276 ms to find 0 implicit places.
[2024-06-01 01:01:48] [INFO ] Redundant transitions in 21 ms returned []
Running 1035 sub problems to find dead transitions.
[2024-06-01 01:01:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/428 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/428 variables, 30/37 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
[2024-06-01 01:02:15] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 1.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 1.0)
(s232 1.0)
(s233 0.0)
(s234 1.0)
(s235 1.0)
(s236 0.0)
(s237 1.0)
(s238 0.0)
(s239 1.0)
(s240 0.0)
(s241 2.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 1.0)
(s246 0.0)
(s247 1.0)
(s248 0.0)
(s249 1.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 1.0)
(s262 0.0)
(s263 1.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 0.0)
(s286 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 0.0)
(s296 0.0)
(s297 1.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 428/1494 variables, and 38 constraints, problems are : Problem set: 0 solved, 1035 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 7/12 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/430 constraints, PredecessorRefiner: 1035/1035 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1035 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/428 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/428 variables, 30/37 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/428 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/428 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
At refinement iteration 4 (OVERLAPS) 2/430 variables, 5/43 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/430 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/1494 variables, and 45 constraints, problems are : Problem set: 0 solved, 1035 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 0/430 constraints, PredecessorRefiner: 0/1035 constraints, Known Traps: 1/1 constraints]
After SMT, in 60780ms problems are : Problem set: 0 solved, 1035 unsolved
Search for dead transitions found 0 dead transitions in 60796ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63116 ms. Remains : 430/430 places, 1064/1064 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 23 ms. Remains 430 /430 variables (removed 0) and now considering 1064/1064 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-06-01 01:02:49] [INFO ] Invariant cache hit.
[2024-06-01 01:02:49] [INFO ] [Real]Absence check using 12 positive place invariants in 9 ms returned sat
[2024-06-01 01:02:49] [INFO ] [Real]Absence check using 12 positive and 32 generalized place invariants in 30 ms returned sat
[2024-06-01 01:02:50] [INFO ] After 934ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 01:02:50] [INFO ] [Nat]Absence check using 12 positive place invariants in 9 ms returned sat
[2024-06-01 01:02:50] [INFO ] [Nat]Absence check using 12 positive and 32 generalized place invariants in 28 ms returned sat
[2024-06-01 01:02:51] [INFO ] After 701ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 01:02:51] [INFO ] After 880ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 01:02:51] [INFO ] After 1192ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 2164 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for ASLink-PT-05b-UpperBounds-01 in 149662 ms.
Starting property specific reduction for ASLink-PT-05b-UpperBounds-03
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:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 1069 rows 435 cols
[2024-06-01 01:02:51] [INFO ] Computed 45 invariants in 15 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (185 resets) in 43 ms. (227 steps per ms)
BEST_FIRST walk for 10001 steps (45 resets) in 16 ms. (588 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 01:02:51] [INFO ] Invariant cache hit.
[2024-06-01 01:02:51] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2024-06-01 01:02:52] [INFO ] [Real]Absence check using 10 positive and 35 generalized place invariants in 30 ms returned sat
[2024-06-01 01:02:52] [INFO ] [Real]Absence check using state equation in 618 ms returned sat
[2024-06-01 01:02:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:02:52] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-06-01 01:02:52] [INFO ] [Nat]Absence check using 10 positive and 35 generalized place invariants in 16 ms returned sat
[2024-06-01 01:02:53] [INFO ] [Nat]Absence check using state equation in 406 ms returned sat
[2024-06-01 01:02:53] [INFO ] Computed and/alt/rep : 241/1164/241 causal constraints (skipped 799 transitions) in 123 ms.
[2024-06-01 01:02:54] [INFO ] Added : 21 causal constraints over 5 iterations in 783 ms. Result :sat
Minimization took 630 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 435 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p91) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 435/435 places, 1068/1068 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 435 transition count 1066
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 433 transition count 1066
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 433 transition count 1065
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 432 transition count 1065
Applied a total of 6 rules in 22 ms. Remains 432 /435 variables (removed 3) and now considering 1065/1068 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 432/435 places, 1065/1068 transitions.
// Phase 1: matrix 1065 rows 432 cols
[2024-06-01 01:02:54] [INFO ] Computed 45 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (18405 resets) in 3173 ms. (315 steps per ms)
BEST_FIRST walk for 1000001 steps (4462 resets) in 951 ms. (1050 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 01:02:58] [INFO ] Invariant cache hit.
[2024-06-01 01:02:58] [INFO ] [Real]Absence check using 12 positive place invariants in 9 ms returned sat
[2024-06-01 01:02:58] [INFO ] [Real]Absence check using 12 positive and 33 generalized place invariants in 15 ms returned sat
[2024-06-01 01:02:59] [INFO ] [Real]Absence check using state equation in 372 ms returned sat
[2024-06-01 01:02:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:02:59] [INFO ] [Nat]Absence check using 12 positive place invariants in 8 ms returned sat
[2024-06-01 01:02:59] [INFO ] [Nat]Absence check using 12 positive and 33 generalized place invariants in 20 ms returned sat
[2024-06-01 01:02:59] [INFO ] [Nat]Absence check using state equation in 466 ms returned sat
[2024-06-01 01:03:00] [INFO ] Computed and/alt/rep : 238/1161/238 causal constraints (skipped 798 transitions) in 79 ms.
[2024-06-01 01:03:00] [INFO ] Added : 18 causal constraints over 4 iterations in 489 ms. Result :sat
Minimization took 943 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 432 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 432/432 places, 1065/1065 transitions.
Applied a total of 0 rules in 18 ms. Remains 432 /432 variables (removed 0) and now considering 1065/1065 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 432/432 places, 1065/1065 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 432/432 places, 1065/1065 transitions.
Applied a total of 0 rules in 13 ms. Remains 432 /432 variables (removed 0) and now considering 1065/1065 (removed 0) transitions.
[2024-06-01 01:03:01] [INFO ] Invariant cache hit.
[2024-06-01 01:03:02] [INFO ] Implicit Places using invariants in 499 ms returned []
[2024-06-01 01:03:02] [INFO ] Invariant cache hit.
[2024-06-01 01:03:03] [INFO ] Implicit Places using invariants and state equation in 1642 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2149 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 431/432 places, 1065/1065 transitions.
Applied a total of 0 rules in 14 ms. Remains 431 /431 variables (removed 0) and now considering 1065/1065 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2178 ms. Remains : 431/432 places, 1065/1065 transitions.
// Phase 1: matrix 1065 rows 431 cols
[2024-06-01 01:03:03] [INFO ] Computed 44 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (18498 resets) in 2434 ms. (410 steps per ms)
BEST_FIRST walk for 1000001 steps (4459 resets) in 881 ms. (1133 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 01:03:07] [INFO ] Invariant cache hit.
[2024-06-01 01:03:07] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-06-01 01:03:07] [INFO ] [Real]Absence check using 11 positive and 33 generalized place invariants in 15 ms returned sat
[2024-06-01 01:03:07] [INFO ] [Real]Absence check using state equation in 398 ms returned sat
[2024-06-01 01:03:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:03:07] [INFO ] [Nat]Absence check using 11 positive place invariants in 12 ms returned sat
[2024-06-01 01:03:07] [INFO ] [Nat]Absence check using 11 positive and 33 generalized place invariants in 24 ms returned sat
[2024-06-01 01:03:08] [INFO ] [Nat]Absence check using state equation in 663 ms returned sat
[2024-06-01 01:03:08] [INFO ] Computed and/alt/rep : 238/1161/238 causal constraints (skipped 798 transitions) in 108 ms.
[2024-06-01 01:03:09] [INFO ] Deduced a trap composed of 44 places in 180 ms of which 3 ms to minimize.
[2024-06-01 01:03:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 323 ms
[2024-06-01 01:03:09] [INFO ] Added : 31 causal constraints over 8 iterations in 1410 ms. Result :sat
Minimization took 968 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 431 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 431/431 places, 1065/1065 transitions.
Applied a total of 0 rules in 17 ms. Remains 431 /431 variables (removed 0) and now considering 1065/1065 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 431/431 places, 1065/1065 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 431/431 places, 1065/1065 transitions.
Applied a total of 0 rules in 13 ms. Remains 431 /431 variables (removed 0) and now considering 1065/1065 (removed 0) transitions.
[2024-06-01 01:03:11] [INFO ] Invariant cache hit.
[2024-06-01 01:03:11] [INFO ] Implicit Places using invariants in 523 ms returned []
[2024-06-01 01:03:11] [INFO ] Invariant cache hit.
[2024-06-01 01:03:13] [INFO ] Implicit Places using invariants and state equation in 1451 ms returned []
Implicit Place search using SMT with State Equation took 1976 ms to find 0 implicit places.
[2024-06-01 01:03:13] [INFO ] Redundant transitions in 13 ms returned []
Running 1036 sub problems to find dead transitions.
[2024-06-01 01:03:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/429 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/429 variables, 27/34 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 429/1496 variables, and 34 constraints, problems are : Problem set: 0 solved, 1036 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 7/11 constraints, Generalized P Invariants (flows): 27/33 constraints, State Equation: 0/431 constraints, PredecessorRefiner: 1036/1036 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1036 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/429 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/429 variables, 27/34 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/429 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
At refinement iteration 3 (OVERLAPS) 2/431 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/431 variables, 6/44 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
[2024-06-01 01:04:07] [INFO ] Deduced a trap composed of 60 places in 128 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 431/1496 variables, and 45 constraints, problems are : Problem set: 0 solved, 1036 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 0/431 constraints, PredecessorRefiner: 0/1036 constraints, Known Traps: 1/1 constraints]
After SMT, in 60708ms problems are : Problem set: 0 solved, 1036 unsolved
Search for dead transitions found 0 dead transitions in 60721ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62731 ms. Remains : 431/431 places, 1065/1065 transitions.
RANDOM walk for 40000 steps (751 resets) in 183 ms. (217 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (177 resets) in 70 ms. (563 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (175 resets) in 92 ms. (430 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 247252 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :0 out of 2
Probabilistic random walk after 247252 steps, saw 122070 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) properties seen :0
[2024-06-01 01:04:17] [INFO ] Invariant cache hit.
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) 15/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/27 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/30 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 144/174 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 15/189 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 147/336 variables, 14/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/336 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 51/387 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/387 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 41/428 variables, 9/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/428 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1065/1493 variables, 428/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1493 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 3/1496 variables, 3/475 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1496 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/1496 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1496/1496 variables, and 475 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1329 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 431/431 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
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) 15/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/27 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/30 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 144/174 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 15/189 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 147/336 variables, 14/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/336 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 51/387 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/387 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 41/428 variables, 9/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/428 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1065/1493 variables, 428/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1493 variables, 2/474 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1493 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 3/1496 variables, 3/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1496 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/1496 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1496/1496 variables, and 477 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1280 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 431/431 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 2620ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 389 ms.
Support contains 1 out of 431 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 431/431 places, 1065/1065 transitions.
Applied a total of 0 rules in 23 ms. Remains 431 /431 variables (removed 0) and now considering 1065/1065 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 431/431 places, 1065/1065 transitions.
RANDOM walk for 40000 steps (776 resets) in 244 ms. (163 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (187 resets) in 90 ms. (439 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (174 resets) in 113 ms. (350 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 162835 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :0 out of 2
Probabilistic random walk after 162835 steps, saw 76962 distinct states, run finished after 3001 ms. (steps per millisecond=54 ) properties seen :0
[2024-06-01 01:04:23] [INFO ] Invariant cache hit.
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) 15/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/27 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/30 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 144/174 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 15/189 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 147/336 variables, 14/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/336 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 51/387 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/387 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 41/428 variables, 9/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/428 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1065/1493 variables, 428/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1493 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 3/1496 variables, 3/475 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1496 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/1496 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1496/1496 variables, and 475 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1408 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 431/431 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
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) 15/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/27 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/30 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 144/174 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 15/189 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 147/336 variables, 14/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/336 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 51/387 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/387 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 41/428 variables, 9/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/428 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1065/1493 variables, 428/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1493 variables, 2/474 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1493 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 3/1496 variables, 3/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1496 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/1496 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1496/1496 variables, and 477 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1119 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 431/431 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 2562ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 320 ms.
Support contains 1 out of 431 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 431/431 places, 1065/1065 transitions.
Applied a total of 0 rules in 22 ms. Remains 431 /431 variables (removed 0) and now considering 1065/1065 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 431/431 places, 1065/1065 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 431/431 places, 1065/1065 transitions.
Applied a total of 0 rules in 21 ms. Remains 431 /431 variables (removed 0) and now considering 1065/1065 (removed 0) transitions.
[2024-06-01 01:04:26] [INFO ] Invariant cache hit.
[2024-06-01 01:04:27] [INFO ] Implicit Places using invariants in 885 ms returned []
[2024-06-01 01:04:27] [INFO ] Invariant cache hit.
[2024-06-01 01:04:29] [INFO ] Implicit Places using invariants and state equation in 2461 ms returned []
Implicit Place search using SMT with State Equation took 3349 ms to find 0 implicit places.
[2024-06-01 01:04:29] [INFO ] Redundant transitions in 22 ms returned []
Running 1036 sub problems to find dead transitions.
[2024-06-01 01:04:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/429 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/429 variables, 27/34 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 429/1496 variables, and 34 constraints, problems are : Problem set: 0 solved, 1036 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 7/11 constraints, Generalized P Invariants (flows): 27/33 constraints, State Equation: 0/431 constraints, PredecessorRefiner: 1036/1036 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1036 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/429 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/429 variables, 27/34 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/429 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
At refinement iteration 3 (OVERLAPS) 2/431 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/431 variables, 6/44 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
[2024-06-01 01:05:23] [INFO ] Deduced a trap composed of 60 places in 171 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 431/1496 variables, and 45 constraints, problems are : Problem set: 0 solved, 1036 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 0/431 constraints, PredecessorRefiner: 0/1036 constraints, Known Traps: 1/1 constraints]
After SMT, in 61071ms problems are : Problem set: 0 solved, 1036 unsolved
Search for dead transitions found 0 dead transitions in 61091ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64495 ms. Remains : 431/431 places, 1065/1065 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 22 ms. Remains 431 /431 variables (removed 0) and now considering 1065/1065 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-06-01 01:05:30] [INFO ] Invariant cache hit.
[2024-06-01 01:05:30] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2024-06-01 01:05:30] [INFO ] [Real]Absence check using 11 positive and 33 generalized place invariants in 31 ms returned sat
[2024-06-01 01:05:31] [INFO ] After 913ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 01:05:31] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-06-01 01:05:31] [INFO ] [Nat]Absence check using 11 positive and 33 generalized place invariants in 19 ms returned sat
[2024-06-01 01:05:32] [INFO ] After 509ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 01:05:32] [INFO ] After 685ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 01:05:32] [INFO ] After 915ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 1865 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for ASLink-PT-05b-UpperBounds-03 in 160797 ms.
Starting property specific reduction for ASLink-PT-05b-UpperBounds-14
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:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 1069 rows 435 cols
[2024-06-01 01:05:32] [INFO ] Computed 45 invariants in 15 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (184 resets) in 40 ms. (243 steps per ms)
BEST_FIRST walk for 10000 steps (46 resets) in 16 ms. (588 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 01:05:32] [INFO ] Invariant cache hit.
[2024-06-01 01:05:32] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2024-06-01 01:05:32] [INFO ] [Real]Absence check using 10 positive and 35 generalized place invariants in 26 ms returned sat
[2024-06-01 01:05:33] [INFO ] [Real]Absence check using state equation in 675 ms returned sat
[2024-06-01 01:05:33] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:05:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2024-06-01 01:05:33] [INFO ] [Nat]Absence check using 10 positive and 35 generalized place invariants in 28 ms returned sat
[2024-06-01 01:05:34] [INFO ] [Nat]Absence check using state equation in 545 ms returned sat
[2024-06-01 01:05:34] [INFO ] Computed and/alt/rep : 241/1164/241 causal constraints (skipped 799 transitions) in 114 ms.
[2024-06-01 01:05:35] [INFO ] Added : 27 causal constraints over 6 iterations in 773 ms. Result :sat
Minimization took 613 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 435 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p632) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 435/435 places, 1068/1068 transitions.
Reduce places removed 1 places and 1 transitions.
Graph (complete) has 2640 edges and 434 vertex of which 433 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 433 transition count 1066
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 432 transition count 1066
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 432 transition count 1065
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 431 transition count 1065
Applied a total of 6 rules in 21 ms. Remains 431 /435 variables (removed 4) and now considering 1065/1068 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 431/435 places, 1065/1068 transitions.
// Phase 1: matrix 1065 rows 431 cols
[2024-06-01 01:05:35] [INFO ] Computed 44 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (18454 resets) in 3199 ms. (312 steps per ms)
BEST_FIRST walk for 1000001 steps (4483 resets) in 983 ms. (1016 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 01:05:39] [INFO ] Invariant cache hit.
[2024-06-01 01:05:39] [INFO ] [Real]Absence check using 13 positive place invariants in 13 ms returned sat
[2024-06-01 01:05:40] [INFO ] [Real]Absence check using 13 positive and 31 generalized place invariants in 21 ms returned sat
[2024-06-01 01:05:40] [INFO ] [Real]Absence check using state equation in 530 ms returned sat
[2024-06-01 01:05:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:05:40] [INFO ] [Nat]Absence check using 13 positive place invariants in 13 ms returned sat
[2024-06-01 01:05:40] [INFO ] [Nat]Absence check using 13 positive and 31 generalized place invariants in 22 ms returned sat
[2024-06-01 01:05:41] [INFO ] [Nat]Absence check using state equation in 636 ms returned sat
[2024-06-01 01:05:41] [INFO ] Computed and/alt/rep : 237/1158/237 causal constraints (skipped 799 transitions) in 122 ms.
[2024-06-01 01:05:42] [INFO ] Added : 17 causal constraints over 4 iterations in 595 ms. Result :sat
Minimization took 1481 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 431 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 431/431 places, 1065/1065 transitions.
Applied a total of 0 rules in 23 ms. Remains 431 /431 variables (removed 0) and now considering 1065/1065 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 431/431 places, 1065/1065 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 431/431 places, 1065/1065 transitions.
Applied a total of 0 rules in 22 ms. Remains 431 /431 variables (removed 0) and now considering 1065/1065 (removed 0) transitions.
[2024-06-01 01:05:43] [INFO ] Invariant cache hit.
[2024-06-01 01:05:44] [INFO ] Implicit Places using invariants in 835 ms returned []
[2024-06-01 01:05:44] [INFO ] Invariant cache hit.
[2024-06-01 01:05:46] [INFO ] Implicit Places using invariants and state equation in 1861 ms returned []
Implicit Place search using SMT with State Equation took 2699 ms to find 0 implicit places.
[2024-06-01 01:05:46] [INFO ] Redundant transitions in 21 ms returned []
Running 1036 sub problems to find dead transitions.
[2024-06-01 01:05:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/429 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/429 variables, 28/36 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
[2024-06-01 01:06:08] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/429 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 429/1496 variables, and 37 constraints, problems are : Problem set: 0 solved, 1036 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 8/13 constraints, Generalized P Invariants (flows): 28/31 constraints, State Equation: 0/431 constraints, PredecessorRefiner: 1036/1036 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1036 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/429 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/429 variables, 28/36 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/429 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/429 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
At refinement iteration 4 (OVERLAPS) 2/431 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/431 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
[2024-06-01 01:06:46] [INFO ] Deduced a trap composed of 13 places in 206 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 431/1496 variables, and 46 constraints, problems are : Problem set: 0 solved, 1036 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 0/431 constraints, PredecessorRefiner: 0/1036 constraints, Known Traps: 2/2 constraints]
After SMT, in 60920ms problems are : Problem set: 0 solved, 1036 unsolved
Search for dead transitions found 0 dead transitions in 60939ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63706 ms. Remains : 431/431 places, 1065/1065 transitions.
RANDOM walk for 40000 steps (745 resets) in 252 ms. (158 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (184 resets) in 88 ms. (449 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (182 resets) in 73 ms. (540 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 255563 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :0 out of 2
Probabilistic random walk after 255563 steps, saw 123944 distinct states, run finished after 3001 ms. (steps per millisecond=85 ) properties seen :0
[2024-06-01 01:06:50] [INFO ] Invariant cache hit.
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) 36/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/54 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 142/196 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/204 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/204 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 134/338 variables, 12/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/338 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 51/389 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/389 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 41/430 variables, 9/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/430 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1065/1495 variables, 430/474 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1495 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/1496 variables, 1/475 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1496 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/1496 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1496/1496 variables, and 475 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1129 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 431/431 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
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) 36/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/54 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 142/196 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/204 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/204 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 134/338 variables, 12/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/338 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 51/389 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/389 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 41/430 variables, 9/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/430 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1065/1495 variables, 430/474 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1495 variables, 2/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1495 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/1496 variables, 1/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1496 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/1496 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1496/1496 variables, and 477 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1130 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 431/431 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 2278ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 408 ms.
Support contains 1 out of 431 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 431/431 places, 1065/1065 transitions.
Applied a total of 0 rules in 22 ms. Remains 431 /431 variables (removed 0) and now considering 1065/1065 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 431/431 places, 1065/1065 transitions.
RANDOM walk for 40000 steps (759 resets) in 231 ms. (172 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (185 resets) in 68 ms. (579 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (181 resets) in 114 ms. (347 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 257320 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :0 out of 2
Probabilistic random walk after 257320 steps, saw 124266 distinct states, run finished after 3001 ms. (steps per millisecond=85 ) properties seen :0
[2024-06-01 01:06:56] [INFO ] Invariant cache hit.
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) 36/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/54 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 142/196 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/204 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/204 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 134/338 variables, 12/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/338 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 51/389 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/389 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 41/430 variables, 9/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/430 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1065/1495 variables, 430/474 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1495 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/1496 variables, 1/475 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1496 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/1496 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1496/1496 variables, and 475 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1382 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 431/431 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
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) 36/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/54 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 142/196 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/204 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/204 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 134/338 variables, 12/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/338 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 51/389 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/389 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 41/430 variables, 9/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/430 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1065/1495 variables, 430/474 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1495 variables, 2/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1495 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/1496 variables, 1/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1496 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/1496 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1496/1496 variables, and 477 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1244 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 431/431 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 2634ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 682 ms.
Support contains 1 out of 431 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 431/431 places, 1065/1065 transitions.
Applied a total of 0 rules in 22 ms. Remains 431 /431 variables (removed 0) and now considering 1065/1065 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 431/431 places, 1065/1065 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 431/431 places, 1065/1065 transitions.
Applied a total of 0 rules in 22 ms. Remains 431 /431 variables (removed 0) and now considering 1065/1065 (removed 0) transitions.
[2024-06-01 01:06:59] [INFO ] Invariant cache hit.
[2024-06-01 01:07:00] [INFO ] Implicit Places using invariants in 838 ms returned []
[2024-06-01 01:07:00] [INFO ] Invariant cache hit.
[2024-06-01 01:07:02] [INFO ] Implicit Places using invariants and state equation in 1774 ms returned []
Implicit Place search using SMT with State Equation took 2615 ms to find 0 implicit places.
[2024-06-01 01:07:02] [INFO ] Redundant transitions in 22 ms returned []
Running 1036 sub problems to find dead transitions.
[2024-06-01 01:07:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/429 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/429 variables, 28/36 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
[2024-06-01 01:07:29] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 429/1496 variables, and 37 constraints, problems are : Problem set: 0 solved, 1036 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 8/13 constraints, Generalized P Invariants (flows): 28/31 constraints, State Equation: 0/431 constraints, PredecessorRefiner: 1036/1036 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1036 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/429 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/429 variables, 28/36 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/429 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/429 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
At refinement iteration 4 (OVERLAPS) 2/431 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/431 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 431/1496 variables, and 45 constraints, problems are : Problem set: 0 solved, 1036 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 0/431 constraints, PredecessorRefiner: 0/1036 constraints, Known Traps: 1/1 constraints]
After SMT, in 60871ms problems are : Problem set: 0 solved, 1036 unsolved
Search for dead transitions found 0 dead transitions in 60889ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63558 ms. Remains : 431/431 places, 1065/1065 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 23 ms. Remains 431 /431 variables (removed 0) and now considering 1065/1065 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-06-01 01:08:03] [INFO ] Invariant cache hit.
[2024-06-01 01:08:03] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-06-01 01:08:03] [INFO ] [Real]Absence check using 13 positive and 31 generalized place invariants in 30 ms returned sat
[2024-06-01 01:08:04] [INFO ] After 979ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 01:08:04] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-06-01 01:08:04] [INFO ] [Nat]Absence check using 13 positive and 31 generalized place invariants in 27 ms returned sat
[2024-06-01 01:08:05] [INFO ] After 702ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 01:08:05] [INFO ] After 883ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 01:08:05] [INFO ] After 1206ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 2223 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for ASLink-PT-05b-UpperBounds-14 in 153143 ms.
[2024-06-01 01:08:06] [INFO ] Flatten gal took : 345 ms
[2024-06-01 01:08:06] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/UpperBounds.sr.xml took 4 ms.
[2024-06-01 01:08:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 435 places, 1069 transitions and 4358 arcs took 28 ms.
Total runtime 1001985 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : ASLink-PT-05b-UpperBounds-01
Could not compute solution for formula : ASLink-PT-05b-UpperBounds-03
Could not compute solution for formula : ASLink-PT-05b-UpperBounds-14

BK_STOP 1717204087084

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2024
ub formula name ASLink-PT-05b-UpperBounds-01
ub formula formula --maxsum=/tmp/1115/ub_0_
ub formula name ASLink-PT-05b-UpperBounds-03
ub formula formula --maxsum=/tmp/1115/ub_1_
ub formula name ASLink-PT-05b-UpperBounds-14
ub formula formula --maxsum=/tmp/1115/ub_2_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ASLink-PT-05b, 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 r464-smll-171620117800085"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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